594 {
595 double *A, *AP;
598
600
602 LDA = *n;
603 A = ( double* )malloc( LDA*LDA*sizeof( double ) );
604 AP = ( double* )malloc( (((LDA+1)*LDA)/2)*sizeof( double ) );
606 for( j=0, k=0; j<*n; j++ )
607 for( i=0; i<j+1; i++, k++ )
608 A[ LDA*i+j ]=ap[ k ];
609 for( i=0, k=0; i<*n; i++ )
610 for( j=i; j<*n; j++, k++ )
611 AP[ k ]=A[ LDA*i+j ];
612 }
613 else {
614 for( j=0, k=0; j<*n; j++ )
615 for( i=j; i<*n; i++, k++ )
616 A[ LDA*i+j ]=ap[ k ];
617 for( i=0, k=0; i<*n; i++ )
618 for( j=0; j<i+1; j++, k++ )
619 AP[ k ]=A[ LDA*i+j ];
620 }
623 for( i=0, k=0; i<*n; i++ )
624 for( j=i; j<*n; j++, k++ )
625 A[ LDA*i+j ]=AP[ k ];
626 for( j=0, k=0; j<*n; j++ )
627 for( i=0; i<j+1; i++, k++ )
628 ap[ k ]=A[ LDA*i+j ];
629 }
630 else {
631 for( i=0, k=0; i<*n; i++ )
632 for( j=0; j<i+1; j++, k++ )
633 A[ LDA*i+j ]=AP[ k ];
634 for( j=0, k=0; j<*n; j++ )
635 for( i=j; i<*n; i++, k++ )
636 ap[ k ]=A[ LDA*i+j ];
637 }
638 free(A);
639 free(AP);
640 }
641 else
643}
void cblas_dspr2(CBLAS_LAYOUT layout, CBLAS_UPLO Uplo, const CBLAS_INT N, const double alpha, const double *X, const CBLAS_INT incX, const double *Y, const CBLAS_INT incY, double *A)
void get_uplo_type(char *type, CBLAS_UPLO *uplo)