538 {
539 double *A, *AP;
542
544
546 LDA = *n;
547 A = ( double* )malloc( LDA*LDA*sizeof( double ) );
548 AP = ( double* )malloc( (((LDA+1)*LDA)/2)*sizeof( double ) );
550 for( j=0, k=0; j<*n; j++ )
551 for( i=0; i<j+1; i++, k++ )
552 A[ LDA*i+j ]=ap[ k ];
553 for( i=0, k=0; i<*n; i++ )
554 for( j=i; j<*n; j++, k++ )
555 AP[ k ]=A[ LDA*i+j ];
556 }
557 else {
558 for( j=0, k=0; j<*n; j++ )
559 for( i=j; i<*n; i++, k++ )
560 A[ LDA*i+j ]=ap[ k ];
561 for( i=0, k=0; i<*n; i++ )
562 for( j=0; j<i+1; j++, k++ )
563 AP[ k ]=A[ LDA*i+j ];
564 }
567 for( i=0, k=0; i<*n; i++ )
568 for( j=i; j<*n; j++, k++ )
569 A[ LDA*i+j ]=AP[ k ];
570 for( j=0, k=0; j<*n; j++ )
571 for( i=0; i<j+1; i++, k++ )
572 ap[ k ]=A[ LDA*i+j ];
573 }
574 else {
575 for( i=0, k=0; i<*n; i++ )
576 for( j=0; j<i+1; j++, k++ )
577 A[ LDA*i+j ]=AP[ k ];
578 for( j=0, k=0; j<*n; j++ )
579 for( i=j; i<*n; i++, k++ )
580 ap[ k ]=A[ LDA*i+j ];
581 }
582 free(A);
583 free(AP);
584 }
585 else
587}
void cblas_dspr(CBLAS_LAYOUT layout, CBLAS_UPLO Uplo, const CBLAS_INT N, const double alpha, const double *X, const CBLAS_INT incX, double *Ap)
void get_uplo_type(char *type, CBLAS_UPLO *uplo)