diff --git a/CBLAS/CMakeLists.txt b/CBLAS/CMakeLists.txt index b19afdaa..bfc0b2f0 100644 --- a/CBLAS/CMakeLists.txt +++ b/CBLAS/CMakeLists.txt @@ -1,4 +1,8 @@ -set(headers +find_library(F2C f2c) +if (NOT F2C) +message(FATAL_ERROR "f2c required. It is available at http://www.netlib.org/f2c/index.html ") +endif() +set(headers f2c.h slu_Cnames.h ) @@ -12,8 +16,8 @@ set(sources "") scopy.c sdot.c snrm2.c - srot.c - sscal.c + srot.c + sscal.c sswap.c sgemv ssymv @@ -79,4 +83,6 @@ set(sources "") ) #endif() -add_library(blas ${sources} ${HEADERS}) +#This must be compiled as a static library +add_library(blas STATIC ${sources} ${HEADERS}) +target_link_libraries(blas ${F2C} m) diff --git a/CBLAS/caxpy.c b/CBLAS/caxpy.c index 27d4bd51..16181b75 100644 --- a/CBLAS/caxpy.c +++ b/CBLAS/caxpy.c @@ -23,13 +23,13 @@ static integer i, ix, iy; -/* constant times a vector plus a vector. - jack dongarra, linpack, 3/11/78. - modified 12/3/93, array(1) declarations changed to array(*) +/* constant times a vector plus a vector. + jack dongarra, linpack, 3/11/78. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define CY(I) cy[(I)-1] #define CX(I) cx[(I)-1] @@ -45,7 +45,7 @@ goto L20; } -/* code for unequal increments or equal increments +/* code for unequal increments or equal increments not equal to 1 */ ix = 1; diff --git a/CBLAS/ccopy.c b/CBLAS/ccopy.c index dbfd87b5..6bb69470 100644 --- a/CBLAS/ccopy.c +++ b/CBLAS/ccopy.c @@ -18,13 +18,13 @@ static integer i, ix, iy; -/* copies a vector, x, to a vector, y. - jack dongarra, linpack, 3/11/78. - modified 12/3/93, array(1) declarations changed to array(*) +/* copies a vector, x, to a vector, y. + jack dongarra, linpack, 3/11/78. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define CY(I) cy[(I)-1] #define CX(I) cx[(I)-1] @@ -37,7 +37,7 @@ goto L20; } -/* code for unequal increments or equal increments +/* code for unequal increments or equal increments not equal to 1 */ ix = 1; diff --git a/CBLAS/cdotc.c b/CBLAS/cdotc.c index c7a153ff..00440597 100644 --- a/CBLAS/cdotc.c +++ b/CBLAS/cdotc.c @@ -5,7 +5,7 @@ #include "f2c.h" -/* Complex */ VOID cdotc_(complex * ret_val, integer *n, complex *cx, integer +/* Complex */ VOID cdotc_(complex * ret_val, integer *n, complex *cx, integer *incx, complex *cy, integer *incy) { /* System generated locals */ @@ -21,13 +21,13 @@ static integer ix, iy; -/* forms the dot product of two vectors, conjugating the first - vector. - jack dongarra, linpack, 3/11/78. - modified 12/3/93, array(1) declarations changed to array(*) +/* forms the dot product of two vectors, conjugating the first + vector. + jack dongarra, linpack, 3/11/78. + modified 12/3/93, array(1) declarations changed to array(*) + - Parameter adjustments */ --cy; --cx; @@ -42,7 +42,7 @@ goto L20; } -/* code for unequal increments or equal increments +/* code for unequal increments or equal increments not equal to 1 */ ix = 1; @@ -57,7 +57,7 @@ for (i = 1; i <= *n; ++i) { r_cnjg(&q__3, &cx[ix]); i__2 = iy; - q__2.r = q__3.r * cy[iy].r - q__3.i * cy[iy].i, q__2.i = q__3.r * + q__2.r = q__3.r * cy[iy].r - q__3.i * cy[iy].i, q__2.i = q__3.r * cy[iy].i + q__3.i * cy[iy].r; q__1.r = ctemp.r + q__2.r, q__1.i = ctemp.i + q__2.i; ctemp.r = q__1.r, ctemp.i = q__1.i; @@ -75,7 +75,7 @@ for (i = 1; i <= *n; ++i) { r_cnjg(&q__3, &cx[i]); i__2 = i; - q__2.r = q__3.r * cy[i].r - q__3.i * cy[i].i, q__2.i = q__3.r * + q__2.r = q__3.r * cy[i].r - q__3.i * cy[i].i, q__2.i = q__3.r * cy[i].i + q__3.i * cy[i].r; q__1.r = ctemp.r + q__2.r, q__1.i = ctemp.i + q__2.i; ctemp.r = q__1.r, ctemp.i = q__1.i; diff --git a/CBLAS/cgemv.c b/CBLAS/cgemv.c index 44a01f00..c5982442 100644 --- a/CBLAS/cgemv.c +++ b/CBLAS/cgemv.c @@ -28,104 +28,104 @@ extern int input_error(char *, int *); -/* Purpose - ======= +/* Purpose + ======= - CGEMV performs one of the matrix-vector operations + CGEMV performs one of the matrix-vector operations - y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, or + y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, or - y := alpha*conjg( A' )*x + beta*y, + y := alpha*conjg( A' )*x + beta*y, - where alpha and beta are scalars, x and y are vectors and A is an - m by n matrix. + where alpha and beta are scalars, x and y are vectors and A is an + m by n matrix. - Parameters - ========== + Parameters + ========== - TRANS - CHARACTER*1. - On entry, TRANS specifies the operation to be performed as - follows: + TRANS - CHARACTER*1. + On entry, TRANS specifies the operation to be performed as + follows: - TRANS = 'N' or 'n' y := alpha*A*x + beta*y. + TRANS = 'N' or 'n' y := alpha*A*x + beta*y. - TRANS = 'T' or 't' y := alpha*A'*x + beta*y. + TRANS = 'T' or 't' y := alpha*A'*x + beta*y. - TRANS = 'C' or 'c' y := alpha*conjg( A' )*x + beta*y. + TRANS = 'C' or 'c' y := alpha*conjg( A' )*x + beta*y. - Unchanged on exit. + Unchanged on exit. - M - INTEGER. - On entry, M specifies the number of rows of the matrix A. - M must be at least zero. - Unchanged on exit. + M - INTEGER. + On entry, M specifies the number of rows of the matrix A. + M must be at least zero. + Unchanged on exit. - N - INTEGER. - On entry, N specifies the number of columns of the matrix A. - - N must be at least zero. - Unchanged on exit. + N - INTEGER. + On entry, N specifies the number of columns of the matrix A. - ALPHA - COMPLEX . - On entry, ALPHA specifies the scalar alpha. - Unchanged on exit. + N must be at least zero. + Unchanged on exit. - A - COMPLEX array of DIMENSION ( LDA, n ). - Before entry, the leading m by n part of the array A must - contain the matrix of coefficients. - Unchanged on exit. + ALPHA - COMPLEX . + On entry, ALPHA specifies the scalar alpha. + Unchanged on exit. - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, m ). - Unchanged on exit. + A - COMPLEX array of DIMENSION ( LDA, n ). + Before entry, the leading m by n part of the array A must + contain the matrix of coefficients. + Unchanged on exit. - X - COMPLEX array of DIMENSION at least - ( 1 + ( n - 1 )*abs( INCX ) ) when TRANS = 'N' or 'n' - and at least - ( 1 + ( m - 1 )*abs( INCX ) ) otherwise. - Before entry, the incremented array X must contain the - vector x. - Unchanged on exit. + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. + in the calling (sub) program. LDA must be at least + max( 1, m ). + Unchanged on exit. - BETA - COMPLEX . - On entry, BETA specifies the scalar beta. When BETA is - supplied as zero then Y need not be set on input. - Unchanged on exit. + X - COMPLEX array of DIMENSION at least + ( 1 + ( n - 1 )*abs( INCX ) ) when TRANS = 'N' or 'n' + and at least + ( 1 + ( m - 1 )*abs( INCX ) ) otherwise. + Before entry, the incremented array X must contain the + vector x. + Unchanged on exit. - Y - COMPLEX array of DIMENSION at least - ( 1 + ( m - 1 )*abs( INCY ) ) when TRANS = 'N' or 'n' - and at least - ( 1 + ( n - 1 )*abs( INCY ) ) otherwise. - Before entry with BETA non-zero, the incremented array Y - must contain the vector y. On exit, Y is overwritten by the - - updated vector y. + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. - INCY - INTEGER. - On entry, INCY specifies the increment for the elements of - Y. INCY must not be zero. - Unchanged on exit. + BETA - COMPLEX . + On entry, BETA specifies the scalar beta. When BETA is + supplied as zero then Y need not be set on input. + Unchanged on exit. + Y - COMPLEX array of DIMENSION at least + ( 1 + ( m - 1 )*abs( INCY ) ) when TRANS = 'N' or 'n' + and at least + ( 1 + ( n - 1 )*abs( INCY ) ) otherwise. + Before entry with BETA non-zero, the incremented array Y + must contain the vector y. On exit, Y is overwritten by the - Level 2 Blas routine. + updated vector y. - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. + INCY - INTEGER. + On entry, INCY specifies the increment for the elements of + Y. INCY must not be zero. + Unchanged on exit. - Test the input parameters. - - Parameter adjustments + + Level 2 Blas routine. + + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. + + Test the input parameters. + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] #define Y(I) y[(I)-1] @@ -133,7 +133,7 @@ #define A(I,J) a[(I)-1 + ((J)-1)* ( *lda)] info = 0; - if ( strncmp(trans, "N", 1)!=0 && strncmp(trans, "T", 1)!=0 && + if ( strncmp(trans, "N", 1)!=0 && strncmp(trans, "T", 1)!=0 && strncmp(trans, "C", 1) != 0) { info = 1; } else if (*m < 0) { @@ -154,14 +154,14 @@ /* Quick return if possible. */ - if (*m == 0 || *n == 0 || alpha->r == 0.f && alpha->i == 0.f && (beta->r + if (*m == 0 || *n == 0 || alpha->r == 0.f && alpha->i == 0.f && (beta->r == 1.f && beta->i == 0.f)) { return 0; } noconj = (strncmp(trans, "T", 1)==0); -/* Set LENX and LENY, the lengths of the vectors x and y, and set +/* Set LENX and LENY, the lengths of the vectors x and y, and set up the start points in X and Y. */ if (strncmp(trans, "N", 1)==0) { @@ -182,8 +182,8 @@ ky = 1 - (leny - 1) * *incy; } -/* Start the operations. In this version the elements of A are - accessed sequentially with one pass through A. +/* Start the operations. In this version the elements of A are + accessed sequentially with one pass through A. First form y := beta*y. */ @@ -201,7 +201,7 @@ for (i = 1; i <= leny; ++i) { i__2 = i; i__3 = i; - q__1.r = beta->r * Y(i).r - beta->i * Y(i).i, + q__1.r = beta->r * Y(i).r - beta->i * Y(i).i, q__1.i = beta->r * Y(i).i + beta->i * Y(i) .r; Y(i).r = q__1.r, Y(i).i = q__1.i; @@ -223,7 +223,7 @@ for (i = 1; i <= leny; ++i) { i__2 = iy; i__3 = iy; - q__1.r = beta->r * Y(iy).r - beta->i * Y(iy).i, + q__1.r = beta->r * Y(iy).r - beta->i * Y(iy).i, q__1.i = beta->r * Y(iy).i + beta->i * Y(iy) .r; Y(iy).r = q__1.r, Y(iy).i = q__1.i; @@ -247,7 +247,7 @@ i__2 = jx; if (X(jx).r != 0.f || X(jx).i != 0.f) { i__2 = jx; - q__1.r = alpha->r * X(jx).r - alpha->i * X(jx).i, + q__1.r = alpha->r * X(jx).r - alpha->i * X(jx).i, q__1.i = alpha->r * X(jx).i + alpha->i * X(jx) .r; temp.r = q__1.r, temp.i = q__1.i; @@ -256,10 +256,10 @@ i__3 = i; i__4 = i; i__5 = i + j * a_dim1; - q__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, + q__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, q__2.i = temp.r * A(i,j).i + temp.i * A(i,j) .r; - q__1.r = Y(i).r + q__2.r, q__1.i = Y(i).i + + q__1.r = Y(i).r + q__2.r, q__1.i = Y(i).i + q__2.i; Y(i).r = q__1.r, Y(i).i = q__1.i; /* L50: */ @@ -274,7 +274,7 @@ i__2 = jx; if (X(jx).r != 0.f || X(jx).i != 0.f) { i__2 = jx; - q__1.r = alpha->r * X(jx).r - alpha->i * X(jx).i, + q__1.r = alpha->r * X(jx).r - alpha->i * X(jx).i, q__1.i = alpha->r * X(jx).i + alpha->i * X(jx) .r; temp.r = q__1.r, temp.i = q__1.i; @@ -284,10 +284,10 @@ i__3 = iy; i__4 = iy; i__5 = i + j * a_dim1; - q__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, + q__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, q__2.i = temp.r * A(i,j).i + temp.i * A(i,j) .r; - q__1.r = Y(iy).r + q__2.r, q__1.i = Y(iy).i + + q__1.r = Y(iy).r + q__2.r, q__1.i = Y(iy).i + q__2.i; Y(iy).r = q__1.r, Y(iy).i = q__1.i; iy += *incy; @@ -325,7 +325,7 @@ for (i = 1; i <= *m; ++i) { r_cnjg(&q__3, &A(i,j)); i__3 = i; - q__2.r = q__3.r * X(i).r - q__3.i * X(i).i, + q__2.r = q__3.r * X(i).r - q__3.i * X(i).i, q__2.i = q__3.r * X(i).i + q__3.i * X(i) .r; q__1.r = temp.r + q__2.r, q__1.i = temp.i + q__2.i; @@ -335,7 +335,7 @@ } i__2 = jy; i__3 = jy; - q__2.r = alpha->r * temp.r - alpha->i * temp.i, q__2.i = + q__2.r = alpha->r * temp.r - alpha->i * temp.i, q__2.i = alpha->r * temp.i + alpha->i * temp.r; q__1.r = Y(jy).r + q__2.r, q__1.i = Y(jy).i + q__2.i; Y(jy).r = q__1.r, Y(jy).i = q__1.i; @@ -365,7 +365,7 @@ for (i = 1; i <= *m; ++i) { r_cnjg(&q__3, &A(i,j)); i__3 = ix; - q__2.r = q__3.r * X(ix).r - q__3.i * X(ix).i, + q__2.r = q__3.r * X(ix).r - q__3.i * X(ix).i, q__2.i = q__3.r * X(ix).i + q__3.i * X(ix) .r; q__1.r = temp.r + q__2.r, q__1.i = temp.i + q__2.i; @@ -376,7 +376,7 @@ } i__2 = jy; i__3 = jy; - q__2.r = alpha->r * temp.r - alpha->i * temp.i, q__2.i = + q__2.r = alpha->r * temp.r - alpha->i * temp.i, q__2.i = alpha->r * temp.i + alpha->i * temp.r; q__1.r = Y(jy).r + q__2.r, q__1.i = Y(jy).i + q__2.i; Y(jy).r = q__1.r, Y(jy).i = q__1.i; diff --git a/CBLAS/cgerc.c b/CBLAS/cgerc.c index cf40fa4d..93f82583 100644 --- a/CBLAS/cgerc.c +++ b/CBLAS/cgerc.c @@ -25,84 +25,84 @@ extern int input_error(char *, int *); -/* Purpose - ======= +/* Purpose + ======= - CGERC performs the rank 1 operation + CGERC performs the rank 1 operation - A := alpha*x*conjg( y' ) + A, + A := alpha*x*conjg( y' ) + A, - where alpha is a scalar, x is an m element vector, y is an n element - - vector and A is an m by n matrix. + where alpha is a scalar, x is an m element vector, y is an n element - Parameters - ========== + vector and A is an m by n matrix. - M - INTEGER. - On entry, M specifies the number of rows of the matrix A. - M must be at least zero. - Unchanged on exit. + Parameters + ========== - N - INTEGER. - On entry, N specifies the number of columns of the matrix A. - - N must be at least zero. - Unchanged on exit. + M - INTEGER. + On entry, M specifies the number of rows of the matrix A. + M must be at least zero. + Unchanged on exit. - ALPHA - COMPLEX . - On entry, ALPHA specifies the scalar alpha. - Unchanged on exit. + N - INTEGER. + On entry, N specifies the number of columns of the matrix A. - X - COMPLEX array of dimension at least - ( 1 + ( m - 1 )*abs( INCX ) ). - Before entry, the incremented array X must contain the m - element vector x. - Unchanged on exit. + N must be at least zero. + Unchanged on exit. - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. + ALPHA - COMPLEX . + On entry, ALPHA specifies the scalar alpha. + Unchanged on exit. - Y - COMPLEX array of dimension at least - ( 1 + ( n - 1 )*abs( INCY ) ). - Before entry, the incremented array Y must contain the n - element vector y. - Unchanged on exit. + X - COMPLEX array of dimension at least + ( 1 + ( m - 1 )*abs( INCX ) ). + Before entry, the incremented array X must contain the m + element vector x. + Unchanged on exit. - INCY - INTEGER. - On entry, INCY specifies the increment for the elements of - Y. INCY must not be zero. - Unchanged on exit. + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. - A - COMPLEX array of DIMENSION ( LDA, n ). - Before entry, the leading m by n part of the array A must - contain the matrix of coefficients. On exit, A is - overwritten by the updated matrix. + Y - COMPLEX array of dimension at least + ( 1 + ( n - 1 )*abs( INCY ) ). + Before entry, the incremented array Y must contain the n + element vector y. + Unchanged on exit. - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, m ). - Unchanged on exit. + INCY - INTEGER. + On entry, INCY specifies the increment for the elements of + Y. INCY must not be zero. + Unchanged on exit. + A - COMPLEX array of DIMENSION ( LDA, n ). + Before entry, the leading m by n part of the array A must + contain the matrix of coefficients. On exit, A is + overwritten by the updated matrix. - Level 2 Blas routine. + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. + in the calling (sub) program. LDA must be at least + max( 1, m ). + Unchanged on exit. + Level 2 Blas routine. - Test the input parameters. + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. - - Parameter adjustments + + + Test the input parameters. + + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] #define Y(I) y[(I)-1] @@ -132,7 +132,7 @@ return 0; } -/* Start the operations. In this version the elements of A are +/* Start the operations. In this version the elements of A are accessed sequentially with one pass through A. */ if (*incy > 0) { @@ -146,7 +146,7 @@ i__2 = jy; if (Y(jy).r != 0.f || Y(jy).i != 0.f) { r_cnjg(&q__2, &Y(jy)); - q__1.r = alpha->r * q__2.r - alpha->i * q__2.i, q__1.i = + q__1.r = alpha->r * q__2.r - alpha->i * q__2.i, q__1.i = alpha->r * q__2.i + alpha->i * q__2.r; temp.r = q__1.r, temp.i = q__1.i; i__2 = *m; @@ -175,7 +175,7 @@ i__2 = jy; if (Y(jy).r != 0.f || Y(jy).i != 0.f) { r_cnjg(&q__2, &Y(jy)); - q__1.r = alpha->r * q__2.r - alpha->i * q__2.i, q__1.i = + q__1.r = alpha->r * q__2.r - alpha->i * q__2.i, q__1.i = alpha->r * q__2.i + alpha->i * q__2.r; temp.r = q__1.r, temp.i = q__1.i; ix = kx; diff --git a/CBLAS/chemv.c b/CBLAS/chemv.c index a0d0871a..da32ae7f 100644 --- a/CBLAS/chemv.c +++ b/CBLAS/chemv.c @@ -28,106 +28,106 @@ extern int input_error(char *, int *); -/* Purpose - ======= - - CHEMV performs the matrix-vector operation - - y := alpha*A*x + beta*y, - - where alpha and beta are scalars, x and y are n element vectors and - A is an n by n hermitian matrix. - - Parameters - ========== - - UPLO - CHARACTER*1. - On entry, UPLO specifies whether the upper or lower - triangular part of the array A is to be referenced as - follows: - - UPLO = 'U' or 'u' Only the upper triangular part of A - is to be referenced. - - UPLO = 'L' or 'l' Only the lower triangular part of A - is to be referenced. - - Unchanged on exit. - - N - INTEGER. - On entry, N specifies the order of the matrix A. - N must be at least zero. - Unchanged on exit. - - ALPHA - COMPLEX . - On entry, ALPHA specifies the scalar alpha. - Unchanged on exit. - - A - COMPLEX array of DIMENSION ( LDA, n ). - Before entry with UPLO = 'U' or 'u', the leading n by n - upper triangular part of the array A must contain the upper - - triangular part of the hermitian matrix and the strictly - lower triangular part of A is not referenced. - Before entry with UPLO = 'L' or 'l', the leading n by n - lower triangular part of the array A must contain the lower - - triangular part of the hermitian matrix and the strictly - upper triangular part of A is not referenced. - Note that the imaginary parts of the diagonal elements need - - not be set and are assumed to be zero. - Unchanged on exit. - - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, n ). - Unchanged on exit. - - X - COMPLEX array of dimension at least - ( 1 + ( n - 1 )*abs( INCX ) ). - Before entry, the incremented array X must contain the n - element vector x. - Unchanged on exit. - - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. - - BETA - COMPLEX . - On entry, BETA specifies the scalar beta. When BETA is - supplied as zero then Y need not be set on input. - Unchanged on exit. - - Y - COMPLEX array of dimension at least - ( 1 + ( n - 1 )*abs( INCY ) ). - Before entry, the incremented array Y must contain the n - element vector y. On exit, Y is overwritten by the updated - vector y. - - INCY - INTEGER. - On entry, INCY specifies the increment for the elements of - Y. INCY must not be zero. - Unchanged on exit. - - - Level 2 Blas routine. - - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. - - - - Test the input parameters. - - - Parameter adjustments +/* Purpose + ======= + + CHEMV performs the matrix-vector operation + + y := alpha*A*x + beta*y, + + where alpha and beta are scalars, x and y are n element vectors and + A is an n by n hermitian matrix. + + Parameters + ========== + + UPLO - CHARACTER*1. + On entry, UPLO specifies whether the upper or lower + triangular part of the array A is to be referenced as + follows: + + UPLO = 'U' or 'u' Only the upper triangular part of A + is to be referenced. + + UPLO = 'L' or 'l' Only the lower triangular part of A + is to be referenced. + + Unchanged on exit. + + N - INTEGER. + On entry, N specifies the order of the matrix A. + N must be at least zero. + Unchanged on exit. + + ALPHA - COMPLEX . + On entry, ALPHA specifies the scalar alpha. + Unchanged on exit. + + A - COMPLEX array of DIMENSION ( LDA, n ). + Before entry with UPLO = 'U' or 'u', the leading n by n + upper triangular part of the array A must contain the upper + + triangular part of the hermitian matrix and the strictly + lower triangular part of A is not referenced. + Before entry with UPLO = 'L' or 'l', the leading n by n + lower triangular part of the array A must contain the lower + + triangular part of the hermitian matrix and the strictly + upper triangular part of A is not referenced. + Note that the imaginary parts of the diagonal elements need + + not be set and are assumed to be zero. + Unchanged on exit. + + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared + + in the calling (sub) program. LDA must be at least + max( 1, n ). + Unchanged on exit. + + X - COMPLEX array of dimension at least + ( 1 + ( n - 1 )*abs( INCX ) ). + Before entry, the incremented array X must contain the n + element vector x. + Unchanged on exit. + + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. + + BETA - COMPLEX . + On entry, BETA specifies the scalar beta. When BETA is + supplied as zero then Y need not be set on input. + Unchanged on exit. + + Y - COMPLEX array of dimension at least + ( 1 + ( n - 1 )*abs( INCY ) ). + Before entry, the incremented array Y must contain the n + element vector y. On exit, Y is overwritten by the updated + vector y. + + INCY - INTEGER. + On entry, INCY specifies the increment for the elements of + Y. INCY must not be zero. + Unchanged on exit. + + + Level 2 Blas routine. + + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. + + + + Test the input parameters. + + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] #define Y(I) y[(I)-1] @@ -153,7 +153,7 @@ /* Quick return if possible. */ - if (*n == 0 || alpha->r == 0.f && alpha->i == 0.f && (beta->r == 1.f && + if (*n == 0 || alpha->r == 0.f && alpha->i == 0.f && (beta->r == 1.f && beta->i == 0.f)) { return 0; } @@ -171,9 +171,9 @@ ky = 1 - (*n - 1) * *incy; } -/* Start the operations. In this version the elements of A are - accessed sequentially with one pass through the triangular part - of A. +/* Start the operations. In this version the elements of A are + accessed sequentially with one pass through the triangular part + of A. First form y := beta*y. */ @@ -191,7 +191,7 @@ for (i = 1; i <= *n; ++i) { i__2 = i; i__3 = i; - q__1.r = beta->r * Y(i).r - beta->i * Y(i).i, + q__1.r = beta->r * Y(i).r - beta->i * Y(i).i, q__1.i = beta->r * Y(i).i + beta->i * Y(i) .r; Y(i).r = q__1.r, Y(i).i = q__1.i; @@ -213,7 +213,7 @@ for (i = 1; i <= *n; ++i) { i__2 = iy; i__3 = iy; - q__1.r = beta->r * Y(iy).r - beta->i * Y(iy).i, + q__1.r = beta->r * Y(iy).r - beta->i * Y(iy).i, q__1.i = beta->r * Y(iy).i + beta->i * Y(iy) .r; Y(iy).r = q__1.r, Y(iy).i = q__1.i; @@ -243,7 +243,7 @@ i__3 = i; i__4 = i; i__5 = i + j * a_dim1; - q__2.r = temp1.r * A(i,j).r - temp1.i * A(i,j).i, + q__2.r = temp1.r * A(i,j).r - temp1.i * A(i,j).i, q__2.i = temp1.r * A(i,j).i + temp1.i * A(i,j) .r; q__1.r = Y(i).r + q__2.r, q__1.i = Y(i).i + q__2.i; @@ -262,7 +262,7 @@ d__1 = A(j,j).r; q__3.r = d__1 * temp1.r, q__3.i = d__1 * temp1.i; q__2.r = Y(j).r + q__3.r, q__2.i = Y(j).i + q__3.i; - q__4.r = alpha->r * temp2.r - alpha->i * temp2.i, q__4.i = + q__4.r = alpha->r * temp2.r - alpha->i * temp2.i, q__4.i = alpha->r * temp2.i + alpha->i * temp2.r; q__1.r = q__2.r + q__4.r, q__1.i = q__2.i + q__4.i; Y(j).r = q__1.r, Y(j).i = q__1.i; @@ -285,7 +285,7 @@ i__3 = iy; i__4 = iy; i__5 = i + j * a_dim1; - q__2.r = temp1.r * A(i,j).r - temp1.i * A(i,j).i, + q__2.r = temp1.r * A(i,j).r - temp1.i * A(i,j).i, q__2.i = temp1.r * A(i,j).i + temp1.i * A(i,j) .r; q__1.r = Y(iy).r + q__2.r, q__1.i = Y(iy).i + q__2.i; @@ -306,7 +306,7 @@ d__1 = A(j,j).r; q__3.r = d__1 * temp1.r, q__3.i = d__1 * temp1.i; q__2.r = Y(jy).r + q__3.r, q__2.i = Y(jy).i + q__3.i; - q__4.r = alpha->r * temp2.r - alpha->i * temp2.i, q__4.i = + q__4.r = alpha->r * temp2.r - alpha->i * temp2.i, q__4.i = alpha->r * temp2.i + alpha->i * temp2.r; q__1.r = q__2.r + q__4.r, q__1.i = q__2.i + q__4.i; Y(jy).r = q__1.r, Y(jy).i = q__1.i; @@ -339,7 +339,7 @@ i__3 = i; i__4 = i; i__5 = i + j * a_dim1; - q__2.r = temp1.r * A(i,j).r - temp1.i * A(i,j).i, + q__2.r = temp1.r * A(i,j).r - temp1.i * A(i,j).i, q__2.i = temp1.r * A(i,j).i + temp1.i * A(i,j) .r; q__1.r = Y(i).r + q__2.r, q__1.i = Y(i).i + q__2.i; @@ -354,7 +354,7 @@ } i__2 = j; i__3 = j; - q__2.r = alpha->r * temp2.r - alpha->i * temp2.i, q__2.i = + q__2.r = alpha->r * temp2.r - alpha->i * temp2.i, q__2.i = alpha->r * temp2.i + alpha->i * temp2.r; q__1.r = Y(j).r + q__2.r, q__1.i = Y(j).i + q__2.i; Y(j).r = q__1.r, Y(j).i = q__1.i; @@ -386,7 +386,7 @@ i__3 = iy; i__4 = iy; i__5 = i + j * a_dim1; - q__2.r = temp1.r * A(i,j).r - temp1.i * A(i,j).i, + q__2.r = temp1.r * A(i,j).r - temp1.i * A(i,j).i, q__2.i = temp1.r * A(i,j).i + temp1.i * A(i,j) .r; q__1.r = Y(iy).r + q__2.r, q__1.i = Y(iy).i + q__2.i; @@ -401,7 +401,7 @@ } i__2 = jy; i__3 = jy; - q__2.r = alpha->r * temp2.r - alpha->i * temp2.i, q__2.i = + q__2.r = alpha->r * temp2.r - alpha->i * temp2.i, q__2.i = alpha->r * temp2.i + alpha->i * temp2.r; q__1.r = Y(jy).r + q__2.r, q__1.i = Y(jy).i + q__2.i; Y(jy).r = q__1.r, Y(jy).i = q__1.i; diff --git a/CBLAS/cher2.c b/CBLAS/cher2.c index 3b894e14..f598b028 100644 --- a/CBLAS/cher2.c +++ b/CBLAS/cher2.c @@ -27,106 +27,106 @@ extern int input_error(char *, int *); -/* Purpose - ======= - - CHER2 performs the hermitian rank 2 operation - - A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A, - - where alpha is a scalar, x and y are n element vectors and A is an n - - by n hermitian matrix. - - Parameters - ========== - - UPLO - CHARACTER*1. - On entry, UPLO specifies whether the upper or lower - triangular part of the array A is to be referenced as - follows: - - UPLO = 'U' or 'u' Only the upper triangular part of A - is to be referenced. - - UPLO = 'L' or 'l' Only the lower triangular part of A - is to be referenced. - - Unchanged on exit. - - N - INTEGER. - On entry, N specifies the order of the matrix A. - N must be at least zero. - Unchanged on exit. - - ALPHA - COMPLEX . - On entry, ALPHA specifies the scalar alpha. - Unchanged on exit. - - X - COMPLEX array of dimension at least - ( 1 + ( n - 1 )*abs( INCX ) ). - Before entry, the incremented array X must contain the n - element vector x. - Unchanged on exit. - - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. - - Y - COMPLEX array of dimension at least - ( 1 + ( n - 1 )*abs( INCY ) ). - Before entry, the incremented array Y must contain the n - element vector y. - Unchanged on exit. - - INCY - INTEGER. - On entry, INCY specifies the increment for the elements of - Y. INCY must not be zero. - Unchanged on exit. - - A - COMPLEX array of DIMENSION ( LDA, n ). - Before entry with UPLO = 'U' or 'u', the leading n by n - upper triangular part of the array A must contain the upper - - triangular part of the hermitian matrix and the strictly - lower triangular part of A is not referenced. On exit, the - upper triangular part of the array A is overwritten by the - upper triangular part of the updated matrix. - Before entry with UPLO = 'L' or 'l', the leading n by n - lower triangular part of the array A must contain the lower - - triangular part of the hermitian matrix and the strictly - upper triangular part of A is not referenced. On exit, the - lower triangular part of the array A is overwritten by the - lower triangular part of the updated matrix. - Note that the imaginary parts of the diagonal elements need - - not be set, they are assumed to be zero, and on exit they - are set to zero. - - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, n ). - Unchanged on exit. - - - Level 2 Blas routine. - - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. - - - - Test the input parameters. - - - Parameter adjustments +/* Purpose + ======= + + CHER2 performs the hermitian rank 2 operation + + A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A, + + where alpha is a scalar, x and y are n element vectors and A is an n + + by n hermitian matrix. + + Parameters + ========== + + UPLO - CHARACTER*1. + On entry, UPLO specifies whether the upper or lower + triangular part of the array A is to be referenced as + follows: + + UPLO = 'U' or 'u' Only the upper triangular part of A + is to be referenced. + + UPLO = 'L' or 'l' Only the lower triangular part of A + is to be referenced. + + Unchanged on exit. + + N - INTEGER. + On entry, N specifies the order of the matrix A. + N must be at least zero. + Unchanged on exit. + + ALPHA - COMPLEX . + On entry, ALPHA specifies the scalar alpha. + Unchanged on exit. + + X - COMPLEX array of dimension at least + ( 1 + ( n - 1 )*abs( INCX ) ). + Before entry, the incremented array X must contain the n + element vector x. + Unchanged on exit. + + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. + + Y - COMPLEX array of dimension at least + ( 1 + ( n - 1 )*abs( INCY ) ). + Before entry, the incremented array Y must contain the n + element vector y. + Unchanged on exit. + + INCY - INTEGER. + On entry, INCY specifies the increment for the elements of + Y. INCY must not be zero. + Unchanged on exit. + + A - COMPLEX array of DIMENSION ( LDA, n ). + Before entry with UPLO = 'U' or 'u', the leading n by n + upper triangular part of the array A must contain the upper + + triangular part of the hermitian matrix and the strictly + lower triangular part of A is not referenced. On exit, the + upper triangular part of the array A is overwritten by the + upper triangular part of the updated matrix. + Before entry with UPLO = 'L' or 'l', the leading n by n + lower triangular part of the array A must contain the lower + + triangular part of the hermitian matrix and the strictly + upper triangular part of A is not referenced. On exit, the + lower triangular part of the array A is overwritten by the + lower triangular part of the updated matrix. + Note that the imaginary parts of the diagonal elements need + + not be set, they are assumed to be zero, and on exit they + are set to zero. + + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared + + in the calling (sub) program. LDA must be at least + max( 1, n ). + Unchanged on exit. + + + Level 2 Blas routine. + + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. + + + + Test the input parameters. + + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] #define Y(I) y[(I)-1] @@ -156,8 +156,8 @@ return 0; } -/* Set up the start points in X and Y if the increments are not both - +/* Set up the start points in X and Y if the increments are not both + unity. */ if (*incx != 1 || *incy != 1) { @@ -175,8 +175,8 @@ jy = ky; } -/* Start the operations. In this version the elements of A are - accessed sequentially with one pass through the triangular part +/* Start the operations. In this version the elements of A are + accessed sequentially with one pass through the triangular part of A. */ if (strncmp(uplo, "U", 1)==0) { @@ -188,14 +188,14 @@ for (j = 1; j <= *n; ++j) { i__2 = j; i__3 = j; - if (X(j).r != 0.f || X(j).i != 0.f || (Y(j).r != 0.f + if (X(j).r != 0.f || X(j).i != 0.f || (Y(j).r != 0.f || Y(j).i != 0.f)) { r_cnjg(&q__2, &Y(j)); - q__1.r = alpha->r * q__2.r - alpha->i * q__2.i, q__1.i = + q__1.r = alpha->r * q__2.r - alpha->i * q__2.i, q__1.i = alpha->r * q__2.i + alpha->i * q__2.r; temp1.r = q__1.r, temp1.i = q__1.i; i__2 = j; - q__2.r = alpha->r * X(j).r - alpha->i * X(j).i, + q__2.r = alpha->r * X(j).r - alpha->i * X(j).i, q__2.i = alpha->r * X(j).i + alpha->i * X(j) .r; r_cnjg(&q__1, &q__2); @@ -205,14 +205,14 @@ i__3 = i + j * a_dim1; i__4 = i + j * a_dim1; i__5 = i; - q__3.r = X(i).r * temp1.r - X(i).i * temp1.i, - q__3.i = X(i).r * temp1.i + X(i).i * + q__3.r = X(i).r * temp1.r - X(i).i * temp1.i, + q__3.i = X(i).r * temp1.i + X(i).i * temp1.r; - q__2.r = A(i,j).r + q__3.r, q__2.i = A(i,j).i + + q__2.r = A(i,j).r + q__3.r, q__2.i = A(i,j).i + q__3.i; i__6 = i; - q__4.r = Y(i).r * temp2.r - Y(i).i * temp2.i, - q__4.i = Y(i).r * temp2.i + Y(i).i * + q__4.r = Y(i).r * temp2.r - Y(i).i * temp2.i, + q__4.i = Y(i).r * temp2.i + Y(i).i * temp2.r; q__1.r = q__2.r + q__4.r, q__1.i = q__2.i + q__4.i; A(i,j).r = q__1.r, A(i,j).i = q__1.i; @@ -221,12 +221,12 @@ i__2 = j + j * a_dim1; i__3 = j + j * a_dim1; i__4 = j; - q__2.r = X(j).r * temp1.r - X(j).i * temp1.i, - q__2.i = X(j).r * temp1.i + X(j).i * + q__2.r = X(j).r * temp1.r - X(j).i * temp1.i, + q__2.i = X(j).r * temp1.i + X(j).i * temp1.r; i__5 = j; - q__3.r = Y(j).r * temp2.r - Y(j).i * temp2.i, - q__3.i = Y(j).r * temp2.i + Y(j).i * + q__3.r = Y(j).r * temp2.r - Y(j).i * temp2.i, + q__3.i = Y(j).r * temp2.i + Y(j).i * temp2.r; q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i; d__1 = A(j,j).r + q__1.r; @@ -244,14 +244,14 @@ for (j = 1; j <= *n; ++j) { i__2 = jx; i__3 = jy; - if (X(jx).r != 0.f || X(jx).i != 0.f || (Y(jy).r != 0.f + if (X(jx).r != 0.f || X(jx).i != 0.f || (Y(jy).r != 0.f || Y(jy).i != 0.f)) { r_cnjg(&q__2, &Y(jy)); - q__1.r = alpha->r * q__2.r - alpha->i * q__2.i, q__1.i = + q__1.r = alpha->r * q__2.r - alpha->i * q__2.i, q__1.i = alpha->r * q__2.i + alpha->i * q__2.r; temp1.r = q__1.r, temp1.i = q__1.i; i__2 = jx; - q__2.r = alpha->r * X(jx).r - alpha->i * X(jx).i, + q__2.r = alpha->r * X(jx).r - alpha->i * X(jx).i, q__2.i = alpha->r * X(jx).i + alpha->i * X(jx) .r; r_cnjg(&q__1, &q__2); @@ -263,14 +263,14 @@ i__3 = i + j * a_dim1; i__4 = i + j * a_dim1; i__5 = ix; - q__3.r = X(ix).r * temp1.r - X(ix).i * temp1.i, - q__3.i = X(ix).r * temp1.i + X(ix).i * + q__3.r = X(ix).r * temp1.r - X(ix).i * temp1.i, + q__3.i = X(ix).r * temp1.i + X(ix).i * temp1.r; - q__2.r = A(i,j).r + q__3.r, q__2.i = A(i,j).i + + q__2.r = A(i,j).r + q__3.r, q__2.i = A(i,j).i + q__3.i; i__6 = iy; - q__4.r = Y(iy).r * temp2.r - Y(iy).i * temp2.i, - q__4.i = Y(iy).r * temp2.i + Y(iy).i * + q__4.r = Y(iy).r * temp2.r - Y(iy).i * temp2.i, + q__4.i = Y(iy).r * temp2.i + Y(iy).i * temp2.r; q__1.r = q__2.r + q__4.r, q__1.i = q__2.i + q__4.i; A(i,j).r = q__1.r, A(i,j).i = q__1.i; @@ -281,12 +281,12 @@ i__2 = j + j * a_dim1; i__3 = j + j * a_dim1; i__4 = jx; - q__2.r = X(jx).r * temp1.r - X(jx).i * temp1.i, - q__2.i = X(jx).r * temp1.i + X(jx).i * + q__2.r = X(jx).r * temp1.r - X(jx).i * temp1.i, + q__2.i = X(jx).r * temp1.i + X(jx).i * temp1.r; i__5 = jy; - q__3.r = Y(jy).r * temp2.r - Y(jy).i * temp2.i, - q__3.i = Y(jy).r * temp2.i + Y(jy).i * + q__3.r = Y(jy).r * temp2.r - Y(jy).i * temp2.i, + q__3.i = Y(jy).r * temp2.i + Y(jy).i * temp2.r; q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i; d__1 = A(j,j).r + q__1.r; @@ -311,14 +311,14 @@ for (j = 1; j <= *n; ++j) { i__2 = j; i__3 = j; - if (X(j).r != 0.f || X(j).i != 0.f || (Y(j).r != 0.f + if (X(j).r != 0.f || X(j).i != 0.f || (Y(j).r != 0.f || Y(j).i != 0.f)) { r_cnjg(&q__2, &Y(j)); - q__1.r = alpha->r * q__2.r - alpha->i * q__2.i, q__1.i = + q__1.r = alpha->r * q__2.r - alpha->i * q__2.i, q__1.i = alpha->r * q__2.i + alpha->i * q__2.r; temp1.r = q__1.r, temp1.i = q__1.i; i__2 = j; - q__2.r = alpha->r * X(j).r - alpha->i * X(j).i, + q__2.r = alpha->r * X(j).r - alpha->i * X(j).i, q__2.i = alpha->r * X(j).i + alpha->i * X(j) .r; r_cnjg(&q__1, &q__2); @@ -326,12 +326,12 @@ i__2 = j + j * a_dim1; i__3 = j + j * a_dim1; i__4 = j; - q__2.r = X(j).r * temp1.r - X(j).i * temp1.i, - q__2.i = X(j).r * temp1.i + X(j).i * + q__2.r = X(j).r * temp1.r - X(j).i * temp1.i, + q__2.i = X(j).r * temp1.i + X(j).i * temp1.r; i__5 = j; - q__3.r = Y(j).r * temp2.r - Y(j).i * temp2.i, - q__3.i = Y(j).r * temp2.i + Y(j).i * + q__3.r = Y(j).r * temp2.r - Y(j).i * temp2.i, + q__3.i = Y(j).r * temp2.i + Y(j).i * temp2.r; q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i; d__1 = A(j,j).r + q__1.r; @@ -341,14 +341,14 @@ i__3 = i + j * a_dim1; i__4 = i + j * a_dim1; i__5 = i; - q__3.r = X(i).r * temp1.r - X(i).i * temp1.i, - q__3.i = X(i).r * temp1.i + X(i).i * + q__3.r = X(i).r * temp1.r - X(i).i * temp1.i, + q__3.i = X(i).r * temp1.i + X(i).i * temp1.r; - q__2.r = A(i,j).r + q__3.r, q__2.i = A(i,j).i + + q__2.r = A(i,j).r + q__3.r, q__2.i = A(i,j).i + q__3.i; i__6 = i; - q__4.r = Y(i).r * temp2.r - Y(i).i * temp2.i, - q__4.i = Y(i).r * temp2.i + Y(i).i * + q__4.r = Y(i).r * temp2.r - Y(i).i * temp2.i, + q__4.i = Y(i).r * temp2.i + Y(i).i * temp2.r; q__1.r = q__2.r + q__4.r, q__1.i = q__2.i + q__4.i; A(i,j).r = q__1.r, A(i,j).i = q__1.i; @@ -367,14 +367,14 @@ for (j = 1; j <= *n; ++j) { i__2 = jx; i__3 = jy; - if (X(jx).r != 0.f || X(jx).i != 0.f || (Y(jy).r != 0.f + if (X(jx).r != 0.f || X(jx).i != 0.f || (Y(jy).r != 0.f || Y(jy).i != 0.f)) { r_cnjg(&q__2, &Y(jy)); - q__1.r = alpha->r * q__2.r - alpha->i * q__2.i, q__1.i = + q__1.r = alpha->r * q__2.r - alpha->i * q__2.i, q__1.i = alpha->r * q__2.i + alpha->i * q__2.r; temp1.r = q__1.r, temp1.i = q__1.i; i__2 = jx; - q__2.r = alpha->r * X(jx).r - alpha->i * X(jx).i, + q__2.r = alpha->r * X(jx).r - alpha->i * X(jx).i, q__2.i = alpha->r * X(jx).i + alpha->i * X(jx) .r; r_cnjg(&q__1, &q__2); @@ -382,12 +382,12 @@ i__2 = j + j * a_dim1; i__3 = j + j * a_dim1; i__4 = jx; - q__2.r = X(jx).r * temp1.r - X(jx).i * temp1.i, - q__2.i = X(jx).r * temp1.i + X(jx).i * + q__2.r = X(jx).r * temp1.r - X(jx).i * temp1.i, + q__2.i = X(jx).r * temp1.i + X(jx).i * temp1.r; i__5 = jy; - q__3.r = Y(jy).r * temp2.r - Y(jy).i * temp2.i, - q__3.i = Y(jy).r * temp2.i + Y(jy).i * + q__3.r = Y(jy).r * temp2.r - Y(jy).i * temp2.i, + q__3.i = Y(jy).r * temp2.i + Y(jy).i * temp2.r; q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i; d__1 = A(j,j).r + q__1.r; @@ -401,14 +401,14 @@ i__3 = i + j * a_dim1; i__4 = i + j * a_dim1; i__5 = ix; - q__3.r = X(ix).r * temp1.r - X(ix).i * temp1.i, - q__3.i = X(ix).r * temp1.i + X(ix).i * + q__3.r = X(ix).r * temp1.r - X(ix).i * temp1.i, + q__3.i = X(ix).r * temp1.i + X(ix).i * temp1.r; - q__2.r = A(i,j).r + q__3.r, q__2.i = A(i,j).i + + q__2.r = A(i,j).r + q__3.r, q__2.i = A(i,j).i + q__3.i; i__6 = iy; - q__4.r = Y(iy).r * temp2.r - Y(iy).i * temp2.i, - q__4.i = Y(iy).r * temp2.i + Y(iy).i * + q__4.r = Y(iy).r * temp2.r - Y(iy).i * temp2.i, + q__4.i = Y(iy).r * temp2.i + Y(iy).i * temp2.r; q__1.r = q__2.r + q__4.r, q__1.i = q__2.i + q__4.i; A(i,j).r = q__1.r, A(i,j).i = q__1.i; diff --git a/CBLAS/cscal.c b/CBLAS/cscal.c index 8cc5173a..eb02c9aa 100644 --- a/CBLAS/cscal.c +++ b/CBLAS/cscal.c @@ -19,14 +19,14 @@ static integer i, nincx; -/* scales a vector by a constant. - jack dongarra, linpack, 3/11/78. - modified 3/93 to return if incx .le. 0. - modified 12/3/93, array(1) declarations changed to array(*) +/* scales a vector by a constant. + jack dongarra, linpack, 3/11/78. + modified 3/93 to return if incx .le. 0. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define CX(I) cx[(I)-1] diff --git a/CBLAS/ctrsv.c b/CBLAS/ctrsv.c index ebb61f5e..e3f6fe15 100644 --- a/CBLAS/ctrsv.c +++ b/CBLAS/ctrsv.c @@ -6,7 +6,7 @@ #include #include "f2c.h" -/* Subroutine */ int ctrsv_(char *uplo, char *trans, char *diag, integer *n, +/* Subroutine */ int ctrsv_(char *uplo, char *trans, char *diag, integer *n, complex *a, integer *lda, complex *x, integer *incx) { @@ -27,112 +27,112 @@ extern int input_error(char *, int *); -/* Purpose - ======= +/* Purpose + ======= - CTRSV solves one of the systems of equations + CTRSV solves one of the systems of equations - A*x = b, or A'*x = b, or conjg( A' )*x = b, + A*x = b, or A'*x = b, or conjg( A' )*x = b, - where b and x are n element vectors and A is an n by n unit, or - non-unit, upper or lower triangular matrix. + where b and x are n element vectors and A is an n by n unit, or + non-unit, upper or lower triangular matrix. - No test for singularity or near-singularity is included in this - routine. Such tests must be performed before calling this routine. + No test for singularity or near-singularity is included in this + routine. Such tests must be performed before calling this routine. - Parameters - ========== + Parameters + ========== - UPLO - CHARACTER*1. - On entry, UPLO specifies whether the matrix is an upper or - lower triangular matrix as follows: + UPLO - CHARACTER*1. + On entry, UPLO specifies whether the matrix is an upper or + lower triangular matrix as follows: - UPLO = 'U' or 'u' A is an upper triangular matrix. + UPLO = 'U' or 'u' A is an upper triangular matrix. - UPLO = 'L' or 'l' A is a lower triangular matrix. + UPLO = 'L' or 'l' A is a lower triangular matrix. - Unchanged on exit. + Unchanged on exit. - TRANS - CHARACTER*1. - On entry, TRANS specifies the equations to be solved as - follows: + TRANS - CHARACTER*1. + On entry, TRANS specifies the equations to be solved as + follows: - TRANS = 'N' or 'n' A*x = b. + TRANS = 'N' or 'n' A*x = b. - TRANS = 'T' or 't' A'*x = b. + TRANS = 'T' or 't' A'*x = b. - TRANS = 'C' or 'c' conjg( A' )*x = b. + TRANS = 'C' or 'c' conjg( A' )*x = b. - Unchanged on exit. + Unchanged on exit. - DIAG - CHARACTER*1. - On entry, DIAG specifies whether or not A is unit - triangular as follows: + DIAG - CHARACTER*1. + On entry, DIAG specifies whether or not A is unit + triangular as follows: - DIAG = 'U' or 'u' A is assumed to be unit triangular. + DIAG = 'U' or 'u' A is assumed to be unit triangular. - DIAG = 'N' or 'n' A is not assumed to be unit - triangular. + DIAG = 'N' or 'n' A is not assumed to be unit + triangular. - Unchanged on exit. + Unchanged on exit. - N - INTEGER. - On entry, N specifies the order of the matrix A. - N must be at least zero. - Unchanged on exit. + N - INTEGER. + On entry, N specifies the order of the matrix A. + N must be at least zero. + Unchanged on exit. - A - COMPLEX array of DIMENSION ( LDA, n ). - Before entry with UPLO = 'U' or 'u', the leading n by n - upper triangular part of the array A must contain the upper - - triangular matrix and the strictly lower triangular part of - - A is not referenced. - Before entry with UPLO = 'L' or 'l', the leading n by n - lower triangular part of the array A must contain the lower - - triangular matrix and the strictly upper triangular part of - - A is not referenced. - Note that when DIAG = 'U' or 'u', the diagonal elements of - - A are not referenced either, but are assumed to be unity. - Unchanged on exit. + A - COMPLEX array of DIMENSION ( LDA, n ). + Before entry with UPLO = 'U' or 'u', the leading n by n + upper triangular part of the array A must contain the upper - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, n ). - Unchanged on exit. + triangular matrix and the strictly lower triangular part of - X - COMPLEX array of dimension at least - ( 1 + ( n - 1 )*abs( INCX ) ). - Before entry, the incremented array X must contain the n - element right-hand side vector b. On exit, X is overwritten - - with the solution vector x. + A is not referenced. + Before entry with UPLO = 'L' or 'l', the leading n by n + lower triangular part of the array A must contain the lower - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. + triangular matrix and the strictly upper triangular part of + A is not referenced. + Note that when DIAG = 'U' or 'u', the diagonal elements of - Level 2 Blas routine. + A are not referenced either, but are assumed to be unity. + Unchanged on exit. - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared + in the calling (sub) program. LDA must be at least + max( 1, n ). + Unchanged on exit. + X - COMPLEX array of dimension at least + ( 1 + ( n - 1 )*abs( INCX ) ). + Before entry, the incremented array X must contain the n + element right-hand side vector b. On exit, X is overwritten - Test the input parameters. + with the solution vector x. - - Parameter adjustments + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. + + + Level 2 Blas routine. + + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. + + + + Test the input parameters. + + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] @@ -167,7 +167,7 @@ noconj = (strncmp(trans, "T", 1)==0); nounit = (strncmp(diag, "N", 1)==0); -/* Set up the start point in X if the increment is not unity. This +/* Set up the start point in X if the increment is not unity. This will be ( N - 1 )*INCX too small for descending loops. */ if (*incx <= 0) { @@ -176,7 +176,7 @@ kx = 1; } -/* Start the operations. In this version the elements of A are +/* Start the operations. In this version the elements of A are accessed sequentially with one pass through A. */ if (strncmp(trans, "N", 1)==0) { @@ -199,9 +199,9 @@ i__1 = i; i__2 = i; i__3 = i + j * a_dim1; - q__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, + q__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, q__2.i = temp.r * A(i,j).i + temp.i * A(i,j).r; - q__1.r = X(i).r - q__2.r, q__1.i = X(i).i - + q__1.r = X(i).r - q__2.r, q__1.i = X(i).i - q__2.i; X(i).r = q__1.r, X(i).i = q__1.i; /* L10: */ @@ -227,9 +227,9 @@ i__1 = ix; i__2 = ix; i__3 = i + j * a_dim1; - q__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, + q__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, q__2.i = temp.r * A(i,j).i + temp.i * A(i,j).r; - q__1.r = X(ix).r - q__2.r, q__1.i = X(ix).i - + q__1.r = X(ix).r - q__2.r, q__1.i = X(ix).i - q__2.i; X(ix).r = q__1.r, X(ix).i = q__1.i; /* L30: */ @@ -257,9 +257,9 @@ i__3 = i; i__4 = i; i__5 = i + j * a_dim1; - q__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, + q__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, q__2.i = temp.r * A(i,j).i + temp.i * A(i,j).r; - q__1.r = X(i).r - q__2.r, q__1.i = X(i).i - + q__1.r = X(i).r - q__2.r, q__1.i = X(i).i - q__2.i; X(i).r = q__1.r, X(i).i = q__1.i; /* L50: */ @@ -287,9 +287,9 @@ i__3 = ix; i__4 = ix; i__5 = i + j * a_dim1; - q__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, + q__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, q__2.i = temp.r * A(i,j).i + temp.i * A(i,j).r; - q__1.r = X(ix).r - q__2.r, q__1.i = X(ix).i - + q__1.r = X(ix).r - q__2.r, q__1.i = X(ix).i - q__2.i; X(ix).r = q__1.r, X(ix).i = q__1.i; /* L70: */ @@ -316,9 +316,9 @@ i__3 = i + j * a_dim1; i__4 = i; q__2.r = A(i,j).r * X(i).r - A(i,j).i * X( - i).i, q__2.i = A(i,j).r * X(i).i + + i).i, q__2.i = A(i,j).r * X(i).i + A(i,j).i * X(i).r; - q__1.r = temp.r - q__2.r, q__1.i = temp.i - + q__1.r = temp.r - q__2.r, q__1.i = temp.i - q__2.i; temp.r = q__1.r, temp.i = q__1.i; /* L90: */ @@ -332,10 +332,10 @@ for (i = 1; i <= j-1; ++i) { r_cnjg(&q__3, &A(i,j)); i__3 = i; - q__2.r = q__3.r * X(i).r - q__3.i * X(i).i, + q__2.r = q__3.r * X(i).r - q__3.i * X(i).i, q__2.i = q__3.r * X(i).i + q__3.i * X( i).r; - q__1.r = temp.r - q__2.r, q__1.i = temp.i - + q__1.r = temp.r - q__2.r, q__1.i = temp.i - q__2.i; temp.r = q__1.r, temp.i = q__1.i; /* L100: */ @@ -363,9 +363,9 @@ i__3 = i + j * a_dim1; i__4 = ix; q__2.r = A(i,j).r * X(ix).r - A(i,j).i * X( - ix).i, q__2.i = A(i,j).r * X(ix).i + + ix).i, q__2.i = A(i,j).r * X(ix).i + A(i,j).i * X(ix).r; - q__1.r = temp.r - q__2.r, q__1.i = temp.i - + q__1.r = temp.r - q__2.r, q__1.i = temp.i - q__2.i; temp.r = q__1.r, temp.i = q__1.i; ix += *incx; @@ -380,10 +380,10 @@ for (i = 1; i <= j-1; ++i) { r_cnjg(&q__3, &A(i,j)); i__3 = ix; - q__2.r = q__3.r * X(ix).r - q__3.i * X(ix).i, + q__2.r = q__3.r * X(ix).r - q__3.i * X(ix).i, q__2.i = q__3.r * X(ix).i + q__3.i * X( ix).r; - q__1.r = temp.r - q__2.r, q__1.i = temp.i - + q__1.r = temp.r - q__2.r, q__1.i = temp.i - q__2.i; temp.r = q__1.r, temp.i = q__1.i; ix += *incx; @@ -412,9 +412,9 @@ i__2 = i + j * a_dim1; i__3 = i; q__2.r = A(i,j).r * X(i).r - A(i,j).i * X( - i).i, q__2.i = A(i,j).r * X(i).i + + i).i, q__2.i = A(i,j).r * X(i).i + A(i,j).i * X(i).r; - q__1.r = temp.r - q__2.r, q__1.i = temp.i - + q__1.r = temp.r - q__2.r, q__1.i = temp.i - q__2.i; temp.r = q__1.r, temp.i = q__1.i; /* L150: */ @@ -428,10 +428,10 @@ for (i = *n; i >= j+1; --i) { r_cnjg(&q__3, &A(i,j)); i__2 = i; - q__2.r = q__3.r * X(i).r - q__3.i * X(i).i, + q__2.r = q__3.r * X(i).r - q__3.i * X(i).i, q__2.i = q__3.r * X(i).i + q__3.i * X( i).r; - q__1.r = temp.r - q__2.r, q__1.i = temp.i - + q__1.r = temp.r - q__2.r, q__1.i = temp.i - q__2.i; temp.r = q__1.r, temp.i = q__1.i; /* L160: */ @@ -459,9 +459,9 @@ i__2 = i + j * a_dim1; i__3 = ix; q__2.r = A(i,j).r * X(ix).r - A(i,j).i * X( - ix).i, q__2.i = A(i,j).r * X(ix).i + + ix).i, q__2.i = A(i,j).r * X(ix).i + A(i,j).i * X(ix).r; - q__1.r = temp.r - q__2.r, q__1.i = temp.i - + q__1.r = temp.r - q__2.r, q__1.i = temp.i - q__2.i; temp.r = q__1.r, temp.i = q__1.i; ix -= *incx; @@ -476,10 +476,10 @@ for (i = *n; i >= j+1; --i) { r_cnjg(&q__3, &A(i,j)); i__2 = ix; - q__2.r = q__3.r * X(ix).r - q__3.i * X(ix).i, + q__2.r = q__3.r * X(ix).r - q__3.i * X(ix).i, q__2.i = q__3.r * X(ix).i + q__3.i * X( ix).r; - q__1.r = temp.r - q__2.r, q__1.i = temp.i - + q__1.r = temp.r - q__2.r, q__1.i = temp.i - q__2.i; temp.r = q__1.r, temp.i = q__1.i; ix -= *incx; diff --git a/CBLAS/dasum.c b/CBLAS/dasum.c index 42d1c74c..ec0c669f 100644 --- a/CBLAS/dasum.c +++ b/CBLAS/dasum.c @@ -20,14 +20,14 @@ doublereal dasum_(integer *n, doublereal *dx, integer *incx) static integer nincx, mp1; -/* takes the sum of the absolute values. - jack dongarra, linpack, 3/11/78. - modified 3/93 to return if incx .le. 0. - modified 12/3/93, array(1) declarations changed to array(*) +/* takes the sum of the absolute values. + jack dongarra, linpack, 3/11/78. + modified 3/93 to return if incx .le. 0. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define DX(I) dx[(I)-1] @@ -53,7 +53,7 @@ doublereal dasum_(integer *n, doublereal *dx, integer *incx) ret_val = dtemp; return ret_val; -/* code for increment equal to 1 +/* code for increment equal to 1 clean-up loop */ @@ -76,7 +76,7 @@ doublereal dasum_(integer *n, doublereal *dx, integer *incx) i__2 = *n; for (i = mp1; i <= *n; i += 6) { dtemp = dtemp + (d__1 = DX(i), abs(d__1)) + (d__2 = DX(i + 1), abs( - d__2)) + (d__3 = DX(i + 2), abs(d__3)) + (d__4 = DX(i + 3), + d__2)) + (d__3 = DX(i + 2), abs(d__3)) + (d__4 = DX(i + 3), abs(d__4)) + (d__5 = DX(i + 4), abs(d__5)) + (d__6 = DX(i + 5) , abs(d__6)); /* L50: */ diff --git a/CBLAS/daxpy.c b/CBLAS/daxpy.c index 953ae624..7f84bdc1 100644 --- a/CBLAS/daxpy.c +++ b/CBLAS/daxpy.c @@ -6,7 +6,7 @@ #include "f2c.h" -/* Subroutine */ int daxpy_(integer *n, doublereal *da, doublereal *dx, +/* Subroutine */ int daxpy_(integer *n, doublereal *da, doublereal *dx, integer *incx, doublereal *dy, integer *incy) { @@ -18,14 +18,14 @@ static integer i, m, ix, iy, mp1; -/* constant times a vector plus a vector. - uses unrolled loops for increments equal to one. - jack dongarra, linpack, 3/11/78. - modified 12/3/93, array(1) declarations changed to array(*) +/* constant times a vector plus a vector. + uses unrolled loops for increments equal to one. + jack dongarra, linpack, 3/11/78. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define DY(I) dy[(I)-1] #define DX(I) dx[(I)-1] @@ -41,7 +41,7 @@ goto L20; } -/* code for unequal increments or equal increments +/* code for unequal increments or equal increments not equal to 1 */ ix = 1; @@ -61,7 +61,7 @@ } return 0; -/* code for both increments equal to 1 +/* code for both increments equal to 1 clean-up loop */ diff --git a/CBLAS/dcabs1.c b/CBLAS/dcabs1.c index f4f9f77c..e29df048 100644 --- a/CBLAS/dcabs1.c +++ b/CBLAS/dcabs1.c @@ -7,7 +7,7 @@ doublereal dcabs1_(doublecomplex *z) { -/* >>Start of File<< +/* >>Start of File<< System generated locals */ doublereal ret_val; diff --git a/CBLAS/dcopy.c b/CBLAS/dcopy.c index a428b8f3..4f3d0b14 100644 --- a/CBLAS/dcopy.c +++ b/CBLAS/dcopy.c @@ -6,7 +6,7 @@ #include "f2c.h" -/* Subroutine */ int dcopy_(integer *n, doublereal *dx, integer *incx, +/* Subroutine */ int dcopy_(integer *n, doublereal *dx, integer *incx, doublereal *dy, integer *incy) { @@ -18,14 +18,14 @@ static integer i, m, ix, iy, mp1; -/* copies a vector, x, to a vector, y. - uses unrolled loops for increments equal to one. - jack dongarra, linpack, 3/11/78. - modified 12/3/93, array(1) declarations changed to array(*) +/* copies a vector, x, to a vector, y. + uses unrolled loops for increments equal to one. + jack dongarra, linpack, 3/11/78. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define DY(I) dy[(I)-1] #define DX(I) dx[(I)-1] @@ -38,7 +38,7 @@ goto L20; } -/* code for unequal increments or equal increments +/* code for unequal increments or equal increments not equal to 1 */ ix = 1; @@ -58,7 +58,7 @@ } return 0; -/* code for both increments equal to 1 +/* code for both increments equal to 1 clean-up loop */ diff --git a/CBLAS/ddot.c b/CBLAS/ddot.c index 10ed2b60..955885c7 100644 --- a/CBLAS/ddot.c +++ b/CBLAS/ddot.c @@ -6,7 +6,7 @@ #include "f2c.h" -doublereal ddot_(integer *n, doublereal *dx, integer *incx, doublereal *dy, +doublereal ddot_(integer *n, doublereal *dx, integer *incx, doublereal *dy, integer *incy) { @@ -21,14 +21,14 @@ doublereal ddot_(integer *n, doublereal *dx, integer *incx, doublereal *dy, static integer ix, iy, mp1; -/* forms the dot product of two vectors. - uses unrolled loops for increments equal to one. - jack dongarra, linpack, 3/11/78. - modified 12/3/93, array(1) declarations changed to array(*) +/* forms the dot product of two vectors. + uses unrolled loops for increments equal to one. + jack dongarra, linpack, 3/11/78. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define DY(I) dy[(I)-1] #define DX(I) dx[(I)-1] @@ -43,7 +43,7 @@ doublereal ddot_(integer *n, doublereal *dx, integer *incx, doublereal *dy, goto L20; } -/* code for unequal increments or equal increments +/* code for unequal increments or equal increments not equal to 1 */ ix = 1; @@ -64,7 +64,7 @@ doublereal ddot_(integer *n, doublereal *dx, integer *incx, doublereal *dy, ret_val = dtemp; return ret_val; -/* code for both increments equal to 1 +/* code for both increments equal to 1 clean-up loop */ @@ -86,7 +86,7 @@ doublereal ddot_(integer *n, doublereal *dx, integer *incx, doublereal *dy, mp1 = m + 1; i__1 = *n; for (i = mp1; i <= *n; i += 5) { - dtemp = dtemp + DX(i) * DY(i) + DX(i + 1) * DY(i + 1) + DX(i + 2) * + dtemp = dtemp + DX(i) * DY(i) + DX(i + 1) * DY(i + 1) + DX(i + 2) * DY(i + 2) + DX(i + 3) * DY(i + 3) + DX(i + 4) * DY(i + 4); /* L50: */ } diff --git a/CBLAS/dgemv.c b/CBLAS/dgemv.c index 9afef698..d4fbf8a5 100644 --- a/CBLAS/dgemv.c +++ b/CBLAS/dgemv.c @@ -7,7 +7,7 @@ #include "f2c.h" /* Subroutine */ int dgemv_(char *trans, integer *m, integer *n, doublereal * - alpha, doublereal *a, integer *lda, doublereal *x, integer *incx, + alpha, doublereal *a, integer *lda, doublereal *x, integer *incx, doublereal *beta, doublereal *y, integer *incy) { @@ -23,102 +23,102 @@ extern int input_error(char *, int *); -/* Purpose - ======= +/* Purpose + ======= - DGEMV performs one of the matrix-vector operations + DGEMV performs one of the matrix-vector operations - y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, + y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, - where alpha and beta are scalars, x and y are vectors and A is an - m by n matrix. + where alpha and beta are scalars, x and y are vectors and A is an + m by n matrix. - Parameters - ========== + Parameters + ========== - TRANS - CHARACTER*1. - On entry, TRANS specifies the operation to be performed as - follows: + TRANS - CHARACTER*1. + On entry, TRANS specifies the operation to be performed as + follows: - TRANS = 'N' or 'n' y := alpha*A*x + beta*y. + TRANS = 'N' or 'n' y := alpha*A*x + beta*y. - TRANS = 'T' or 't' y := alpha*A'*x + beta*y. + TRANS = 'T' or 't' y := alpha*A'*x + beta*y. - TRANS = 'C' or 'c' y := alpha*A'*x + beta*y. + TRANS = 'C' or 'c' y := alpha*A'*x + beta*y. - Unchanged on exit. + Unchanged on exit. - M - INTEGER. - On entry, M specifies the number of rows of the matrix A. - M must be at least zero. - Unchanged on exit. + M - INTEGER. + On entry, M specifies the number of rows of the matrix A. + M must be at least zero. + Unchanged on exit. - N - INTEGER. - On entry, N specifies the number of columns of the matrix A. - - N must be at least zero. - Unchanged on exit. + N - INTEGER. + On entry, N specifies the number of columns of the matrix A. - ALPHA - DOUBLE PRECISION. - On entry, ALPHA specifies the scalar alpha. - Unchanged on exit. + N must be at least zero. + Unchanged on exit. - A - DOUBLE PRECISION array of DIMENSION ( LDA, n ). - Before entry, the leading m by n part of the array A must - contain the matrix of coefficients. - Unchanged on exit. + ALPHA - DOUBLE PRECISION. + On entry, ALPHA specifies the scalar alpha. + Unchanged on exit. - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, m ). - Unchanged on exit. + A - DOUBLE PRECISION array of DIMENSION ( LDA, n ). + Before entry, the leading m by n part of the array A must + contain the matrix of coefficients. + Unchanged on exit. - X - DOUBLE PRECISION array of DIMENSION at least - ( 1 + ( n - 1 )*abs( INCX ) ) when TRANS = 'N' or 'n' - and at least - ( 1 + ( m - 1 )*abs( INCX ) ) otherwise. - Before entry, the incremented array X must contain the - vector x. - Unchanged on exit. + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. + in the calling (sub) program. LDA must be at least + max( 1, m ). + Unchanged on exit. - BETA - DOUBLE PRECISION. - On entry, BETA specifies the scalar beta. When BETA is - supplied as zero then Y need not be set on input. - Unchanged on exit. + X - DOUBLE PRECISION array of DIMENSION at least + ( 1 + ( n - 1 )*abs( INCX ) ) when TRANS = 'N' or 'n' + and at least + ( 1 + ( m - 1 )*abs( INCX ) ) otherwise. + Before entry, the incremented array X must contain the + vector x. + Unchanged on exit. - Y - DOUBLE PRECISION array of DIMENSION at least - ( 1 + ( m - 1 )*abs( INCY ) ) when TRANS = 'N' or 'n' - and at least - ( 1 + ( n - 1 )*abs( INCY ) ) otherwise. - Before entry with BETA non-zero, the incremented array Y - must contain the vector y. On exit, Y is overwritten by the - - updated vector y. + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. - INCY - INTEGER. - On entry, INCY specifies the increment for the elements of - Y. INCY must not be zero. - Unchanged on exit. + BETA - DOUBLE PRECISION. + On entry, BETA specifies the scalar beta. When BETA is + supplied as zero then Y need not be set on input. + Unchanged on exit. + Y - DOUBLE PRECISION array of DIMENSION at least + ( 1 + ( m - 1 )*abs( INCY ) ) when TRANS = 'N' or 'n' + and at least + ( 1 + ( n - 1 )*abs( INCY ) ) otherwise. + Before entry with BETA non-zero, the incremented array Y + must contain the vector y. On exit, Y is overwritten by the - Level 2 Blas routine. + updated vector y. - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. + INCY - INTEGER. + On entry, INCY specifies the increment for the elements of + Y. INCY must not be zero. + Unchanged on exit. - Test the input parameters. - Parameter adjustments + Level 2 Blas routine. + + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. + + Test the input parameters. + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] #define Y(I) y[(I)-1] @@ -151,8 +151,8 @@ return 0; } -/* Set LENX and LENY, the lengths of the vectors x and y, and set - +/* Set LENX and LENY, the lengths of the vectors x and y, and set + up the start points in X and Y. */ if (strncmp(trans, "N", 1)==0) { @@ -173,8 +173,8 @@ ky = 1 - (leny - 1) * *incy; } -/* Start the operations. In this version the elements of A are - accessed sequentially with one pass through A. +/* Start the operations. In this version the elements of A are + accessed sequentially with one pass through A. First form y := beta*y. */ diff --git a/CBLAS/dger.c b/CBLAS/dger.c index c68ccac9..f6ec1d91 100644 --- a/CBLAS/dger.c +++ b/CBLAS/dger.c @@ -6,8 +6,8 @@ #include "f2c.h" -/* Subroutine */ int dger_(integer *m, integer *n, doublereal *alpha, - doublereal *x, integer *incx, doublereal *y, integer *incy, +/* Subroutine */ int dger_(integer *m, integer *n, doublereal *alpha, + doublereal *x, integer *incx, doublereal *y, integer *incy, doublereal *a, integer *lda) { @@ -22,82 +22,82 @@ extern int input_error(char *, int *); -/* Purpose - ======= +/* Purpose + ======= - DGER performs the rank 1 operation + DGER performs the rank 1 operation - A := alpha*x*y' + A, + A := alpha*x*y' + A, - where alpha is a scalar, x is an m element vector, y is an n element - - vector and A is an m by n matrix. + where alpha is a scalar, x is an m element vector, y is an n element - Parameters - ========== + vector and A is an m by n matrix. - M - INTEGER. - On entry, M specifies the number of rows of the matrix A. - M must be at least zero. - Unchanged on exit. + Parameters + ========== - N - INTEGER. - On entry, N specifies the number of columns of the matrix A. - - N must be at least zero. - Unchanged on exit. + M - INTEGER. + On entry, M specifies the number of rows of the matrix A. + M must be at least zero. + Unchanged on exit. - ALPHA - DOUBLE PRECISION. - On entry, ALPHA specifies the scalar alpha. - Unchanged on exit. + N - INTEGER. + On entry, N specifies the number of columns of the matrix A. - X - DOUBLE PRECISION array of dimension at least - ( 1 + ( m - 1 )*abs( INCX ) ). - Before entry, the incremented array X must contain the m - element vector x. - Unchanged on exit. + N must be at least zero. + Unchanged on exit. - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. + ALPHA - DOUBLE PRECISION. + On entry, ALPHA specifies the scalar alpha. + Unchanged on exit. - Y - DOUBLE PRECISION array of dimension at least - ( 1 + ( n - 1 )*abs( INCY ) ). - Before entry, the incremented array Y must contain the n - element vector y. - Unchanged on exit. + X - DOUBLE PRECISION array of dimension at least + ( 1 + ( m - 1 )*abs( INCX ) ). + Before entry, the incremented array X must contain the m + element vector x. + Unchanged on exit. - INCY - INTEGER. - On entry, INCY specifies the increment for the elements of - Y. INCY must not be zero. - Unchanged on exit. + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. - A - DOUBLE PRECISION array of DIMENSION ( LDA, n ). - Before entry, the leading m by n part of the array A must - contain the matrix of coefficients. On exit, A is - overwritten by the updated matrix. + Y - DOUBLE PRECISION array of dimension at least + ( 1 + ( n - 1 )*abs( INCY ) ). + Before entry, the incremented array Y must contain the n + element vector y. + Unchanged on exit. - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, m ). - Unchanged on exit. + INCY - INTEGER. + On entry, INCY specifies the increment for the elements of + Y. INCY must not be zero. + Unchanged on exit. + A - DOUBLE PRECISION array of DIMENSION ( LDA, n ). + Before entry, the leading m by n part of the array A must + contain the matrix of coefficients. On exit, A is + overwritten by the updated matrix. - Level 2 Blas routine. + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. + in the calling (sub) program. LDA must be at least + max( 1, m ). + Unchanged on exit. - Test the input parameters. - - Parameter adjustments + Level 2 Blas routine. + + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. + + + Test the input parameters. + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] #define Y(I) y[(I)-1] @@ -127,7 +127,7 @@ return 0; } -/* Start the operations. In this version the elements of A are +/* Start the operations. In this version the elements of A are accessed sequentially with one pass through A. */ if (*incy > 0) { diff --git a/CBLAS/dnrm2.c b/CBLAS/dnrm2.c index 602813be..a23efa42 100644 --- a/CBLAS/dnrm2.c +++ b/CBLAS/dnrm2.c @@ -23,20 +23,20 @@ doublereal dnrm2_(integer *n, doublereal *x, integer *incx) static doublereal ssq; -/* DNRM2 returns the euclidean norm of a vector via the function - name, so that +/* DNRM2 returns the euclidean norm of a vector via the function + name, so that - DNRM2 := sqrt( x'*x ) + DNRM2 := sqrt( x'*x ) - -- This version written on 25-October-1982. - Modified on 14-October-1993 to inline the call to DLASSQ. - Sven Hammarling, Nag Ltd. + -- This version written on 25-October-1982. + Modified on 14-October-1993 to inline the call to DLASSQ. + Sven Hammarling, Nag Ltd. - - Parameter adjustments + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] @@ -48,9 +48,9 @@ doublereal dnrm2_(integer *n, doublereal *x, integer *incx) } else { scale = 0.; ssq = 1.; -/* The following loop is equivalent to this call to the LAPACK - - auxiliary routine: +/* The following loop is equivalent to this call to the LAPACK + + auxiliary routine: CALL DLASSQ( N, X, INCX, SCALE, SSQ ) */ i__1 = (*n - 1) * *incx + 1; diff --git a/CBLAS/drot.c b/CBLAS/drot.c index bc5264b9..9c8dc667 100644 --- a/CBLAS/drot.c +++ b/CBLAS/drot.c @@ -6,7 +6,7 @@ #include "f2c.h" -/* Subroutine */ int drot_(integer *n, doublereal *dx, integer *incx, +/* Subroutine */ int drot_(integer *n, doublereal *dx, integer *incx, doublereal *dy, integer *incy, doublereal *c, doublereal *s) { @@ -20,13 +20,13 @@ static integer ix, iy; -/* applies a plane rotation. - jack dongarra, linpack, 3/11/78. - modified 12/3/93, array(1) declarations changed to array(*) +/* applies a plane rotation. + jack dongarra, linpack, 3/11/78. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define DY(I) dy[(I)-1] #define DX(I) dx[(I)-1] @@ -39,7 +39,7 @@ goto L20; } -/* code for unequal increments or equal increments not equal +/* code for unequal increments or equal increments not equal to 1 */ ix = 1; diff --git a/CBLAS/dscal.c b/CBLAS/dscal.c index 24447404..fc0964cb 100644 --- a/CBLAS/dscal.c +++ b/CBLAS/dscal.c @@ -6,7 +6,7 @@ #include "f2c.h" -/* Subroutine */ int dscal_(integer *n, doublereal *da, doublereal *dx, +/* Subroutine */ int dscal_(integer *n, doublereal *da, doublereal *dx, integer *incx) { @@ -18,15 +18,15 @@ static integer i, m, nincx, mp1; -/* scales a vector by a constant. - uses unrolled loops for increment equal to one. - jack dongarra, linpack, 3/11/78. - modified 3/93 to return if incx .le. 0. - modified 12/3/93, array(1) declarations changed to array(*) +/* scales a vector by a constant. + uses unrolled loops for increment equal to one. + jack dongarra, linpack, 3/11/78. + modified 3/93 to return if incx .le. 0. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define DX(I) dx[(I)-1] @@ -49,7 +49,7 @@ } return 0; -/* code for increment equal to 1 +/* code for increment equal to 1 clean-up loop */ diff --git a/CBLAS/dswap.c b/CBLAS/dswap.c index 038dd996..dddf9c69 100644 --- a/CBLAS/dswap.c +++ b/CBLAS/dswap.c @@ -1,7 +1,7 @@ #include "f2c.h" /*#include "blaswrap.h"*/ -/* Subroutine */ int dswap_(integer *n, doublereal *dx, integer *incx, +/* Subroutine */ int dswap_(integer *n, doublereal *dx, integer *incx, doublereal *dy, integer *incy) { /* System generated locals */ diff --git a/CBLAS/dsymv.c b/CBLAS/dsymv.c index 25eb0495..06d8a0e6 100644 --- a/CBLAS/dsymv.c +++ b/CBLAS/dsymv.c @@ -6,8 +6,8 @@ #include #include "f2c.h" -/* Subroutine */ int dsymv_(char *uplo, integer *n, doublereal *alpha, - doublereal *a, integer *lda, doublereal *x, integer *incx, doublereal +/* Subroutine */ int dsymv_(char *uplo, integer *n, doublereal *alpha, + doublereal *a, integer *lda, doublereal *x, integer *incx, doublereal *beta, doublereal *y, integer *incy) { @@ -23,103 +23,103 @@ extern int input_error(char *, int *); -/* Purpose - ======= +/* Purpose + ======= - DSYMV performs the matrix-vector operation + DSYMV performs the matrix-vector operation - y := alpha*A*x + beta*y, + y := alpha*A*x + beta*y, - where alpha and beta are scalars, x and y are n element vectors and - A is an n by n symmetric matrix. + where alpha and beta are scalars, x and y are n element vectors and + A is an n by n symmetric matrix. - Parameters - ========== + Parameters + ========== - UPLO - CHARACTER*1. - On entry, UPLO specifies whether the upper or lower - triangular part of the array A is to be referenced as - follows: + UPLO - CHARACTER*1. + On entry, UPLO specifies whether the upper or lower + triangular part of the array A is to be referenced as + follows: - UPLO = 'U' or 'u' Only the upper triangular part of A - is to be referenced. + UPLO = 'U' or 'u' Only the upper triangular part of A + is to be referenced. - UPLO = 'L' or 'l' Only the lower triangular part of A - is to be referenced. + UPLO = 'L' or 'l' Only the lower triangular part of A + is to be referenced. - Unchanged on exit. + Unchanged on exit. - N - INTEGER. - On entry, N specifies the order of the matrix A. - N must be at least zero. - Unchanged on exit. + N - INTEGER. + On entry, N specifies the order of the matrix A. + N must be at least zero. + Unchanged on exit. - ALPHA - DOUBLE PRECISION. - On entry, ALPHA specifies the scalar alpha. - Unchanged on exit. + ALPHA - DOUBLE PRECISION. + On entry, ALPHA specifies the scalar alpha. + Unchanged on exit. - A - DOUBLE PRECISION array of DIMENSION ( LDA, n ). - Before entry with UPLO = 'U' or 'u', the leading n by n - upper triangular part of the array A must contain the upper - - triangular part of the symmetric matrix and the strictly - lower triangular part of A is not referenced. - Before entry with UPLO = 'L' or 'l', the leading n by n - lower triangular part of the array A must contain the lower - - triangular part of the symmetric matrix and the strictly - upper triangular part of A is not referenced. - Unchanged on exit. + A - DOUBLE PRECISION array of DIMENSION ( LDA, n ). + Before entry with UPLO = 'U' or 'u', the leading n by n + upper triangular part of the array A must contain the upper - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, n ). - Unchanged on exit. + triangular part of the symmetric matrix and the strictly + lower triangular part of A is not referenced. + Before entry with UPLO = 'L' or 'l', the leading n by n + lower triangular part of the array A must contain the lower - X - DOUBLE PRECISION array of dimension at least - ( 1 + ( n - 1 )*abs( INCX ) ). - Before entry, the incremented array X must contain the n - element vector x. - Unchanged on exit. + triangular part of the symmetric matrix and the strictly + upper triangular part of A is not referenced. + Unchanged on exit. - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared - BETA - DOUBLE PRECISION. - On entry, BETA specifies the scalar beta. When BETA is - supplied as zero then Y need not be set on input. - Unchanged on exit. + in the calling (sub) program. LDA must be at least + max( 1, n ). + Unchanged on exit. - Y - DOUBLE PRECISION array of dimension at least - ( 1 + ( n - 1 )*abs( INCY ) ). - Before entry, the incremented array Y must contain the n - element vector y. On exit, Y is overwritten by the updated - vector y. + X - DOUBLE PRECISION array of dimension at least + ( 1 + ( n - 1 )*abs( INCX ) ). + Before entry, the incremented array X must contain the n + element vector x. + Unchanged on exit. - INCY - INTEGER. - On entry, INCY specifies the increment for the elements of - Y. INCY must not be zero. - Unchanged on exit. + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. + BETA - DOUBLE PRECISION. + On entry, BETA specifies the scalar beta. When BETA is + supplied as zero then Y need not be set on input. + Unchanged on exit. - Level 2 Blas routine. + Y - DOUBLE PRECISION array of dimension at least + ( 1 + ( n - 1 )*abs( INCY ) ). + Before entry, the incremented array Y must contain the n + element vector y. On exit, Y is overwritten by the updated + vector y. - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. + INCY - INTEGER. + On entry, INCY specifies the increment for the elements of + Y. INCY must not be zero. + Unchanged on exit. + Level 2 Blas routine. - Test the input parameters. + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. - - Parameter adjustments + + + Test the input parameters. + + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] #define Y(I) y[(I)-1] @@ -162,9 +162,9 @@ ky = 1 - (*n - 1) * *incy; } -/* Start the operations. In this version the elements of A are - accessed sequentially with one pass through the triangular part - of A. +/* Start the operations. In this version the elements of A are + accessed sequentially with one pass through the triangular part + of A. First form y := beta*y. */ diff --git a/CBLAS/dsyr2.c b/CBLAS/dsyr2.c index 7a79c821..6052c0ff 100644 --- a/CBLAS/dsyr2.c +++ b/CBLAS/dsyr2.c @@ -6,8 +6,8 @@ #include #include "f2c.h" -/* Subroutine */ int dsyr2_(char *uplo, integer *n, doublereal *alpha, - doublereal *x, integer *incx, doublereal *y, integer *incy, +/* Subroutine */ int dsyr2_(char *uplo, integer *n, doublereal *alpha, + doublereal *x, integer *incx, doublereal *y, integer *incy, doublereal *a, integer *lda) { @@ -22,102 +22,102 @@ static integer ix, iy, jx, jy, kx, ky; extern int input_error(char *, int *); -/* Purpose - ======= +/* Purpose + ======= - DSYR2 performs the symmetric rank 2 operation + DSYR2 performs the symmetric rank 2 operation - A := alpha*x*y' + alpha*y*x' + A, + A := alpha*x*y' + alpha*y*x' + A, - where alpha is a scalar, x and y are n element vectors and A is an n - - by n symmetric matrix. + where alpha is a scalar, x and y are n element vectors and A is an n - Parameters - ========== + by n symmetric matrix. - UPLO - CHARACTER*1. - On entry, UPLO specifies whether the upper or lower - triangular part of the array A is to be referenced as - follows: + Parameters + ========== - UPLO = 'U' or 'u' Only the upper triangular part of A - is to be referenced. + UPLO - CHARACTER*1. + On entry, UPLO specifies whether the upper or lower + triangular part of the array A is to be referenced as + follows: - UPLO = 'L' or 'l' Only the lower triangular part of A - is to be referenced. + UPLO = 'U' or 'u' Only the upper triangular part of A + is to be referenced. - Unchanged on exit. + UPLO = 'L' or 'l' Only the lower triangular part of A + is to be referenced. - N - INTEGER. - On entry, N specifies the order of the matrix A. - N must be at least zero. - Unchanged on exit. + Unchanged on exit. - ALPHA - DOUBLE PRECISION. - On entry, ALPHA specifies the scalar alpha. - Unchanged on exit. + N - INTEGER. + On entry, N specifies the order of the matrix A. + N must be at least zero. + Unchanged on exit. - X - DOUBLE PRECISION array of dimension at least - ( 1 + ( n - 1 )*abs( INCX ) ). - Before entry, the incremented array X must contain the n - element vector x. - Unchanged on exit. + ALPHA - DOUBLE PRECISION. + On entry, ALPHA specifies the scalar alpha. + Unchanged on exit. - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. + X - DOUBLE PRECISION array of dimension at least + ( 1 + ( n - 1 )*abs( INCX ) ). + Before entry, the incremented array X must contain the n + element vector x. + Unchanged on exit. - Y - DOUBLE PRECISION array of dimension at least - ( 1 + ( n - 1 )*abs( INCY ) ). - Before entry, the incremented array Y must contain the n - element vector y. - Unchanged on exit. + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. - INCY - INTEGER. - On entry, INCY specifies the increment for the elements of - Y. INCY must not be zero. - Unchanged on exit. + Y - DOUBLE PRECISION array of dimension at least + ( 1 + ( n - 1 )*abs( INCY ) ). + Before entry, the incremented array Y must contain the n + element vector y. + Unchanged on exit. - A - DOUBLE PRECISION array of DIMENSION ( LDA, n ). - Before entry with UPLO = 'U' or 'u', the leading n by n - upper triangular part of the array A must contain the upper - - triangular part of the symmetric matrix and the strictly - lower triangular part of A is not referenced. On exit, the - upper triangular part of the array A is overwritten by the - upper triangular part of the updated matrix. - Before entry with UPLO = 'L' or 'l', the leading n by n - lower triangular part of the array A must contain the lower - - triangular part of the symmetric matrix and the strictly - upper triangular part of A is not referenced. On exit, the - lower triangular part of the array A is overwritten by the - lower triangular part of the updated matrix. + INCY - INTEGER. + On entry, INCY specifies the increment for the elements of + Y. INCY must not be zero. + Unchanged on exit. - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, n ). - Unchanged on exit. + A - DOUBLE PRECISION array of DIMENSION ( LDA, n ). + Before entry with UPLO = 'U' or 'u', the leading n by n + upper triangular part of the array A must contain the upper + triangular part of the symmetric matrix and the strictly + lower triangular part of A is not referenced. On exit, the + upper triangular part of the array A is overwritten by the + upper triangular part of the updated matrix. + Before entry with UPLO = 'L' or 'l', the leading n by n + lower triangular part of the array A must contain the lower - Level 2 Blas routine. + triangular part of the symmetric matrix and the strictly + upper triangular part of A is not referenced. On exit, the + lower triangular part of the array A is overwritten by the + lower triangular part of the updated matrix. - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared + in the calling (sub) program. LDA must be at least + max( 1, n ). + Unchanged on exit. - Test the input parameters. + Level 2 Blas routine. - - Parameter adjustments + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. + + + + Test the input parameters. + + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] #define Y(I) y[(I)-1] @@ -147,8 +147,8 @@ return 0; } -/* Set up the start points in X and Y if the increments are not both - +/* Set up the start points in X and Y if the increments are not both + unity. */ if (*incx != 1 || *incy != 1) { @@ -166,8 +166,8 @@ jy = ky; } -/* Start the operations. In this version the elements of A are - accessed sequentially with one pass through the triangular part +/* Start the operations. In this version the elements of A are + accessed sequentially with one pass through the triangular part of A. */ if (strncmp(uplo, "U", 1)==0) { @@ -182,7 +182,7 @@ temp2 = *alpha * X(j); i__2 = j; for (i = 1; i <= j; ++i) { - A(i,j) = A(i,j) + X(i) * temp1 + A(i,j) = A(i,j) + X(i) * temp1 + Y(i) * temp2; /* L10: */ } @@ -199,7 +199,7 @@ iy = ky; i__2 = j; for (i = 1; i <= j; ++i) { - A(i,j) = A(i,j) + X(ix) * temp1 + A(i,j) = A(i,j) + X(ix) * temp1 + Y(iy) * temp2; ix += *incx; iy += *incy; @@ -223,7 +223,7 @@ temp2 = *alpha * X(j); i__2 = *n; for (i = j; i <= *n; ++i) { - A(i,j) = A(i,j) + X(i) * temp1 + A(i,j) = A(i,j) + X(i) * temp1 + Y(i) * temp2; /* L50: */ } @@ -240,7 +240,7 @@ iy = jy; i__2 = *n; for (i = j; i <= *n; ++i) { - A(i,j) = A(i,j) + X(ix) * temp1 + A(i,j) = A(i,j) + X(ix) * temp1 + Y(iy) * temp2; ix += *incx; iy += *incy; diff --git a/CBLAS/dtrsv.c b/CBLAS/dtrsv.c index 769f0241..3433e2d6 100644 --- a/CBLAS/dtrsv.c +++ b/CBLAS/dtrsv.c @@ -6,7 +6,7 @@ #include #include "f2c.h" -/* Subroutine */ int dtrsv_(char *uplo, char *trans, char *diag, integer *n, +/* Subroutine */ int dtrsv_(char *uplo, char *trans, char *diag, integer *n, doublereal *a, integer *lda, doublereal *x, integer *incx) { @@ -23,112 +23,112 @@ extern int input_error(char *, int *); -/* Purpose - ======= +/* Purpose + ======= - DTRSV solves one of the systems of equations + DTRSV solves one of the systems of equations - A*x = b, or A'*x = b, + A*x = b, or A'*x = b, - where b and x are n element vectors and A is an n by n unit, or - non-unit, upper or lower triangular matrix. + where b and x are n element vectors and A is an n by n unit, or + non-unit, upper or lower triangular matrix. - No test for singularity or near-singularity is included in this - routine. Such tests must be performed before calling this routine. + No test for singularity or near-singularity is included in this + routine. Such tests must be performed before calling this routine. - Parameters - ========== + Parameters + ========== - UPLO - CHARACTER*1. - On entry, UPLO specifies whether the matrix is an upper or - lower triangular matrix as follows: + UPLO - CHARACTER*1. + On entry, UPLO specifies whether the matrix is an upper or + lower triangular matrix as follows: - UPLO = 'U' or 'u' A is an upper triangular matrix. + UPLO = 'U' or 'u' A is an upper triangular matrix. - UPLO = 'L' or 'l' A is a lower triangular matrix. + UPLO = 'L' or 'l' A is a lower triangular matrix. - Unchanged on exit. + Unchanged on exit. - TRANS - CHARACTER*1. - On entry, TRANS specifies the equations to be solved as - follows: + TRANS - CHARACTER*1. + On entry, TRANS specifies the equations to be solved as + follows: - TRANS = 'N' or 'n' A*x = b. + TRANS = 'N' or 'n' A*x = b. - TRANS = 'T' or 't' A'*x = b. + TRANS = 'T' or 't' A'*x = b. - TRANS = 'C' or 'c' A'*x = b. + TRANS = 'C' or 'c' A'*x = b. - Unchanged on exit. + Unchanged on exit. - DIAG - CHARACTER*1. - On entry, DIAG specifies whether or not A is unit - triangular as follows: + DIAG - CHARACTER*1. + On entry, DIAG specifies whether or not A is unit + triangular as follows: - DIAG = 'U' or 'u' A is assumed to be unit triangular. + DIAG = 'U' or 'u' A is assumed to be unit triangular. - DIAG = 'N' or 'n' A is not assumed to be unit - triangular. + DIAG = 'N' or 'n' A is not assumed to be unit + triangular. - Unchanged on exit. + Unchanged on exit. - N - INTEGER. - On entry, N specifies the order of the matrix A. - N must be at least zero. - Unchanged on exit. + N - INTEGER. + On entry, N specifies the order of the matrix A. + N must be at least zero. + Unchanged on exit. - A - DOUBLE PRECISION array of DIMENSION ( LDA, n ). - Before entry with UPLO = 'U' or 'u', the leading n by n - upper triangular part of the array A must contain the upper - - triangular matrix and the strictly lower triangular part of - - A is not referenced. - Before entry with UPLO = 'L' or 'l', the leading n by n - lower triangular part of the array A must contain the lower - - triangular matrix and the strictly upper triangular part of - - A is not referenced. - Note that when DIAG = 'U' or 'u', the diagonal elements of - - A are not referenced either, but are assumed to be unity. - Unchanged on exit. + A - DOUBLE PRECISION array of DIMENSION ( LDA, n ). + Before entry with UPLO = 'U' or 'u', the leading n by n + upper triangular part of the array A must contain the upper - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, n ). - Unchanged on exit. + triangular matrix and the strictly lower triangular part of - X - DOUBLE PRECISION array of dimension at least - ( 1 + ( n - 1 )*abs( INCX ) ). - Before entry, the incremented array X must contain the n - element right-hand side vector b. On exit, X is overwritten - - with the solution vector x. + A is not referenced. + Before entry with UPLO = 'L' or 'l', the leading n by n + lower triangular part of the array A must contain the lower - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. + triangular matrix and the strictly upper triangular part of + A is not referenced. + Note that when DIAG = 'U' or 'u', the diagonal elements of - Level 2 Blas routine. + A are not referenced either, but are assumed to be unity. + Unchanged on exit. - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared + in the calling (sub) program. LDA must be at least + max( 1, n ). + Unchanged on exit. + X - DOUBLE PRECISION array of dimension at least + ( 1 + ( n - 1 )*abs( INCX ) ). + Before entry, the incremented array X must contain the n + element right-hand side vector b. On exit, X is overwritten - Test the input parameters. + with the solution vector x. - - Parameter adjustments + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. + + + Level 2 Blas routine. + + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. + + + + Test the input parameters. + + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] @@ -162,7 +162,7 @@ nounit = (strncmp(diag, "N", 1)==0); -/* Set up the start point in X if the increment is not unity. This +/* Set up the start point in X if the increment is not unity. This will be ( N - 1 )*INCX too small for descending loops. */ if (*incx <= 0) { @@ -171,7 +171,7 @@ kx = 1; } -/* Start the operations. In this version the elements of A are +/* Start the operations. In this version the elements of A are accessed sequentially with one pass through A. */ if (strncmp(trans, "N", 1)==0) { diff --git a/CBLAS/dzasum.c b/CBLAS/dzasum.c index 5605d1e1..b18f502d 100644 --- a/CBLAS/dzasum.c +++ b/CBLAS/dzasum.c @@ -21,14 +21,14 @@ doublereal dzasum_(integer *n, doublecomplex *zx, integer *incx) static integer ix; -/* takes the sum of the absolute values. - jack dongarra, 3/11/78. - modified 3/93 to return if incx .le. 0. - modified 12/3/93, array(1) declarations changed to array(*) +/* takes the sum of the absolute values. + jack dongarra, 3/11/78. + modified 3/93 to return if incx .le. 0. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define ZX(I) zx[(I)-1] diff --git a/CBLAS/dznrm2.c b/CBLAS/dznrm2.c index d0318b73..cd6266c4 100644 --- a/CBLAS/dznrm2.c +++ b/CBLAS/dznrm2.c @@ -23,20 +23,20 @@ doublereal dznrm2_(integer *n, doublecomplex *x, integer *incx) static doublereal ssq; -/* DZNRM2 returns the euclidean norm of a vector via the function - name, so that +/* DZNRM2 returns the euclidean norm of a vector via the function + name, so that - DZNRM2 := sqrt( conjg( x' )*x ) + DZNRM2 := sqrt( conjg( x' )*x ) - -- This version written on 25-October-1982. - Modified on 14-October-1993 to inline the call to ZLASSQ. - Sven Hammarling, Nag Ltd. + -- This version written on 25-October-1982. + Modified on 14-October-1993 to inline the call to ZLASSQ. + Sven Hammarling, Nag Ltd. - - Parameter adjustments + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] @@ -46,9 +46,9 @@ doublereal dznrm2_(integer *n, doublecomplex *x, integer *incx) } else { scale = 0.; ssq = 1.; -/* The following loop is equivalent to this call to the LAPACK - - auxiliary routine: +/* The following loop is equivalent to this call to the LAPACK + + auxiliary routine: CALL ZLASSQ( N, X, INCX, SCALE, SSQ ) */ i__1 = (*n - 1) * *incx + 1; diff --git a/CBLAS/icamax.c b/CBLAS/icamax.c index 9ff47869..a022a31e 100644 --- a/CBLAS/icamax.c +++ b/CBLAS/icamax.c @@ -10,12 +10,12 @@ integer icamax_(integer *n, complex *cx, integer *incx) /* Local variables */ static real smax; static integer i, ix; -/* finds the index of element having max. absolute value. - jack dongarra, linpack, 3/11/78. - modified 3/93 to return if incx .le. 0. - modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments +/* finds the index of element having max. absolute value. + jack dongarra, linpack, 3/11/78. + modified 3/93 to return if incx .le. 0. + modified 12/3/93, array(1) declarations changed to array(*) + + Parameter adjustments Function Body */ #define CX(I) cx[(I)-1] ret_val = 0; @@ -42,7 +42,7 @@ integer icamax_(integer *n, complex *cx, integer *incx) } ret_val = i; i__2 = ix; - smax = (r__1 = CX(ix).r, dabs(r__1)) + (r__2 = r_imag(&CX(ix)), + smax = (r__1 = CX(ix).r, dabs(r__1)) + (r__2 = r_imag(&CX(ix)), dabs(r__2)); L5: ix += *incx; diff --git a/CBLAS/idamax.c b/CBLAS/idamax.c index 00ebc239..6a0ad3df 100644 --- a/CBLAS/idamax.c +++ b/CBLAS/idamax.c @@ -19,14 +19,14 @@ integer idamax_(integer *n, doublereal *dx, integer *incx) static integer i, ix; -/* finds the index of element having max. absolute value. - jack dongarra, linpack, 3/11/78. - modified 3/93 to return if incx .le. 0. - modified 12/3/93, array(1) declarations changed to array(*) +/* finds the index of element having max. absolute value. + jack dongarra, linpack, 3/11/78. + modified 3/93 to return if incx .le. 0. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define DX(I) dx[(I)-1] diff --git a/CBLAS/isamax.c b/CBLAS/isamax.c index b1ad4754..6a06f686 100644 --- a/CBLAS/isamax.c +++ b/CBLAS/isamax.c @@ -19,14 +19,14 @@ integer isamax_(integer *n, real *sx, integer *incx) static integer i, ix; -/* finds the index of element having max. absolute value. - jack dongarra, linpack, 3/11/78. - modified 3/93 to return if incx .le. 0. - modified 12/3/93, array(1) declarations changed to array(*) +/* finds the index of element having max. absolute value. + jack dongarra, linpack, 3/11/78. + modified 3/93 to return if incx .le. 0. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define SX(I) sx[(I)-1] diff --git a/CBLAS/izamax.c b/CBLAS/izamax.c index 44959d0c..3de86abc 100644 --- a/CBLAS/izamax.c +++ b/CBLAS/izamax.c @@ -20,14 +20,14 @@ integer izamax_(integer *n, doublecomplex *zx, integer *incx) static integer ix; -/* finds the index of element having max. absolute value. - jack dongarra, 1/15/85. - modified 3/93 to return if incx .le. 0. - modified 12/3/93, array(1) declarations changed to array(*) +/* finds the index of element having max. absolute value. + jack dongarra, 1/15/85. + modified 3/93 to return if incx .le. 0. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define ZX(I) zx[(I)-1] diff --git a/CBLAS/sasum.c b/CBLAS/sasum.c index 29eafe49..bc27d823 100644 --- a/CBLAS/sasum.c +++ b/CBLAS/sasum.c @@ -20,15 +20,15 @@ real sasum_(integer *n, real *sx, integer *incx) static integer mp1; -/* takes the sum of the absolute values. - uses unrolled loops for increment equal to one. - jack dongarra, linpack, 3/11/78. - modified 3/93 to return if incx .le. 0. - modified 12/3/93, array(1) declarations changed to array(*) +/* takes the sum of the absolute values. + uses unrolled loops for increment equal to one. + jack dongarra, linpack, 3/11/78. + modified 3/93 to return if incx .le. 0. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define SX(I) sx[(I)-1] @@ -54,7 +54,7 @@ real sasum_(integer *n, real *sx, integer *incx) ret_val = stemp; return ret_val; -/* code for increment equal to 1 +/* code for increment equal to 1 clean-up loop */ @@ -77,8 +77,8 @@ real sasum_(integer *n, real *sx, integer *incx) i__2 = *n; for (i = mp1; i <= *n; i += 6) { stemp = stemp + (r__1 = SX(i), dabs(r__1)) + (r__2 = SX(i + 1), dabs( - r__2)) + (r__3 = SX(i + 2), dabs(r__3)) + (r__4 = SX(i + 3), - dabs(r__4)) + (r__5 = SX(i + 4), dabs(r__5)) + (r__6 = SX(i + + r__2)) + (r__3 = SX(i + 2), dabs(r__3)) + (r__4 = SX(i + 3), + dabs(r__4)) + (r__5 = SX(i + 4), dabs(r__5)) + (r__6 = SX(i + 5), dabs(r__6)); /* L50: */ } diff --git a/CBLAS/saxpy.c b/CBLAS/saxpy.c index 06c26f37..868b41a6 100644 --- a/CBLAS/saxpy.c +++ b/CBLAS/saxpy.c @@ -6,7 +6,7 @@ #include "f2c.h" -/* Subroutine */ int saxpy_(integer *n, real *sa, real *sx, integer *incx, +/* Subroutine */ int saxpy_(integer *n, real *sa, real *sx, integer *incx, real *sy, integer *incy) { @@ -18,14 +18,14 @@ static integer i, m, ix, iy, mp1; -/* constant times a vector plus a vector. - uses unrolled loop for increments equal to one. - jack dongarra, linpack, 3/11/78. - modified 12/3/93, array(1) declarations changed to array(*) +/* constant times a vector plus a vector. + uses unrolled loop for increments equal to one. + jack dongarra, linpack, 3/11/78. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define SY(I) sy[(I)-1] #define SX(I) sx[(I)-1] @@ -41,7 +41,7 @@ goto L20; } -/* code for unequal increments or equal increments +/* code for unequal increments or equal increments not equal to 1 */ ix = 1; @@ -61,7 +61,7 @@ } return 0; -/* code for both increments equal to 1 +/* code for both increments equal to 1 clean-up loop */ diff --git a/CBLAS/scasum.c b/CBLAS/scasum.c index 5c3d3515..c47791bf 100644 --- a/CBLAS/scasum.c +++ b/CBLAS/scasum.c @@ -22,15 +22,15 @@ real scasum_(integer *n, complex *cx, integer *incx) static real stemp; -/* takes the sum of the absolute values of a complex vector and - returns a single precision result. - jack dongarra, linpack, 3/11/78. - modified 3/93 to return if incx .le. 0. - modified 12/3/93, array(1) declarations changed to array(*) +/* takes the sum of the absolute values of a complex vector and + returns a single precision result. + jack dongarra, linpack, 3/11/78. + modified 3/93 to return if incx .le. 0. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define CX(I) cx[(I)-1] diff --git a/CBLAS/scnrm2.c b/CBLAS/scnrm2.c index 8325b3df..157608fd 100644 --- a/CBLAS/scnrm2.c +++ b/CBLAS/scnrm2.c @@ -23,20 +23,20 @@ real scnrm2_(integer *n, complex *x, integer *incx) static real ssq; -/* SCNRM2 returns the euclidean norm of a vector via the function - name, so that +/* SCNRM2 returns the euclidean norm of a vector via the function + name, so that - SCNRM2 := sqrt( conjg( x' )*x ) + SCNRM2 := sqrt( conjg( x' )*x ) - -- This version written on 25-October-1982. - Modified on 14-October-1993 to inline the call to CLASSQ. - Sven Hammarling, Nag Ltd. + -- This version written on 25-October-1982. + Modified on 14-October-1993 to inline the call to CLASSQ. + Sven Hammarling, Nag Ltd. - - Parameter adjustments + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] @@ -46,9 +46,9 @@ real scnrm2_(integer *n, complex *x, integer *incx) } else { scale = 0.f; ssq = 1.f; -/* The following loop is equivalent to this call to the LAPACK - - auxiliary routine: +/* The following loop is equivalent to this call to the LAPACK + + auxiliary routine: CALL CLASSQ( N, X, INCX, SCALE, SSQ ) */ i__1 = (*n - 1) * *incx + 1; diff --git a/CBLAS/scopy.c b/CBLAS/scopy.c index 4e7a238d..98cb7394 100644 --- a/CBLAS/scopy.c +++ b/CBLAS/scopy.c @@ -6,7 +6,7 @@ #include "f2c.h" -/* Subroutine */ int scopy_(integer *n, real *sx, integer *incx, real *sy, +/* Subroutine */ int scopy_(integer *n, real *sx, integer *incx, real *sy, integer *incy) { @@ -18,14 +18,14 @@ static integer i, m, ix, iy, mp1; -/* copies a vector, x, to a vector, y. - uses unrolled loops for increments equal to 1. - jack dongarra, linpack, 3/11/78. - modified 12/3/93, array(1) declarations changed to array(*) +/* copies a vector, x, to a vector, y. + uses unrolled loops for increments equal to 1. + jack dongarra, linpack, 3/11/78. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define SY(I) sy[(I)-1] #define SX(I) sx[(I)-1] @@ -38,7 +38,7 @@ goto L20; } -/* code for unequal increments or equal increments +/* code for unequal increments or equal increments not equal to 1 */ ix = 1; @@ -58,7 +58,7 @@ } return 0; -/* code for both increments equal to 1 +/* code for both increments equal to 1 clean-up loop */ diff --git a/CBLAS/sdot.c b/CBLAS/sdot.c index b5539375..179db6f4 100644 --- a/CBLAS/sdot.c +++ b/CBLAS/sdot.c @@ -20,14 +20,14 @@ real sdot_(integer *n, real *sx, integer *incx, real *sy, integer *incy) static integer ix, iy, mp1; -/* forms the dot product of two vectors. - uses unrolled loops for increments equal to one. - jack dongarra, linpack, 3/11/78. - modified 12/3/93, array(1) declarations changed to array(*) +/* forms the dot product of two vectors. + uses unrolled loops for increments equal to one. + jack dongarra, linpack, 3/11/78. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define SY(I) sy[(I)-1] #define SX(I) sx[(I)-1] @@ -42,7 +42,7 @@ real sdot_(integer *n, real *sx, integer *incx, real *sy, integer *incy) goto L20; } -/* code for unequal increments or equal increments +/* code for unequal increments or equal increments not equal to 1 */ ix = 1; @@ -63,7 +63,7 @@ real sdot_(integer *n, real *sx, integer *incx, real *sy, integer *incy) ret_val = stemp; return ret_val; -/* code for both increments equal to 1 +/* code for both increments equal to 1 clean-up loop */ @@ -85,7 +85,7 @@ real sdot_(integer *n, real *sx, integer *incx, real *sy, integer *incy) mp1 = m + 1; i__1 = *n; for (i = mp1; i <= *n; i += 5) { - stemp = stemp + SX(i) * SY(i) + SX(i + 1) * SY(i + 1) + SX(i + 2) * + stemp = stemp + SX(i) * SY(i) + SX(i + 1) * SY(i + 1) + SX(i + 2) * SY(i + 2) + SX(i + 3) * SY(i + 3) + SX(i + 4) * SY(i + 4); /* L50: */ } diff --git a/CBLAS/sgemv.c b/CBLAS/sgemv.c index e79a77c5..5cac077b 100644 --- a/CBLAS/sgemv.c +++ b/CBLAS/sgemv.c @@ -6,8 +6,8 @@ #include #include "f2c.h" -/* Subroutine */ int sgemv_(char *trans, integer *m, integer *n, real *alpha, - real *a, integer *lda, real *x, integer *incx, real *beta, real *y, +/* Subroutine */ int sgemv_(char *trans, integer *m, integer *n, real *alpha, + real *a, integer *lda, real *x, integer *incx, real *beta, real *y, integer *incy) { @@ -23,105 +23,105 @@ extern int input_error(char *, int *); -/* Purpose - ======= +/* Purpose + ======= - SGEMV performs one of the matrix-vector operations + SGEMV performs one of the matrix-vector operations - y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, + y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, - where alpha and beta are scalars, x and y are vectors and A is an - m by n matrix. + where alpha and beta are scalars, x and y are vectors and A is an + m by n matrix. - Parameters - ========== + Parameters + ========== - TRANS - CHARACTER*1. - On entry, TRANS specifies the operation to be performed as - follows: + TRANS - CHARACTER*1. + On entry, TRANS specifies the operation to be performed as + follows: - TRANS = 'N' or 'n' y := alpha*A*x + beta*y. + TRANS = 'N' or 'n' y := alpha*A*x + beta*y. - TRANS = 'T' or 't' y := alpha*A'*x + beta*y. + TRANS = 'T' or 't' y := alpha*A'*x + beta*y. - TRANS = 'C' or 'c' y := alpha*A'*x + beta*y. + TRANS = 'C' or 'c' y := alpha*A'*x + beta*y. - Unchanged on exit. + Unchanged on exit. - M - INTEGER. - On entry, M specifies the number of rows of the matrix A. - M must be at least zero. - Unchanged on exit. + M - INTEGER. + On entry, M specifies the number of rows of the matrix A. + M must be at least zero. + Unchanged on exit. - N - INTEGER. - On entry, N specifies the number of columns of the matrix A. - - N must be at least zero. - Unchanged on exit. + N - INTEGER. + On entry, N specifies the number of columns of the matrix A. - ALPHA - REAL . - On entry, ALPHA specifies the scalar alpha. - Unchanged on exit. + N must be at least zero. + Unchanged on exit. - A - REAL array of DIMENSION ( LDA, n ). - Before entry, the leading m by n part of the array A must - contain the matrix of coefficients. - Unchanged on exit. + ALPHA - REAL . + On entry, ALPHA specifies the scalar alpha. + Unchanged on exit. - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, m ). - Unchanged on exit. + A - REAL array of DIMENSION ( LDA, n ). + Before entry, the leading m by n part of the array A must + contain the matrix of coefficients. + Unchanged on exit. - X - REAL array of DIMENSION at least - ( 1 + ( n - 1 )*abs( INCX ) ) when TRANS = 'N' or 'n' - and at least - ( 1 + ( m - 1 )*abs( INCX ) ) otherwise. - Before entry, the incremented array X must contain the - vector x. - Unchanged on exit. + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. + in the calling (sub) program. LDA must be at least + max( 1, m ). + Unchanged on exit. - BETA - REAL . - On entry, BETA specifies the scalar beta. When BETA is - supplied as zero then Y need not be set on input. - Unchanged on exit. + X - REAL array of DIMENSION at least + ( 1 + ( n - 1 )*abs( INCX ) ) when TRANS = 'N' or 'n' + and at least + ( 1 + ( m - 1 )*abs( INCX ) ) otherwise. + Before entry, the incremented array X must contain the + vector x. + Unchanged on exit. - Y - REAL array of DIMENSION at least - ( 1 + ( m - 1 )*abs( INCY ) ) when TRANS = 'N' or 'n' - and at least - ( 1 + ( n - 1 )*abs( INCY ) ) otherwise. - Before entry with BETA non-zero, the incremented array Y - must contain the vector y. On exit, Y is overwritten by the - - updated vector y. + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. - INCY - INTEGER. - On entry, INCY specifies the increment for the elements of - Y. INCY must not be zero. - Unchanged on exit. + BETA - REAL . + On entry, BETA specifies the scalar beta. When BETA is + supplied as zero then Y need not be set on input. + Unchanged on exit. + Y - REAL array of DIMENSION at least + ( 1 + ( m - 1 )*abs( INCY ) ) when TRANS = 'N' or 'n' + and at least + ( 1 + ( n - 1 )*abs( INCY ) ) otherwise. + Before entry with BETA non-zero, the incremented array Y + must contain the vector y. On exit, Y is overwritten by the - Level 2 Blas routine. + updated vector y. - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. + INCY - INTEGER. + On entry, INCY specifies the increment for the elements of + Y. INCY must not be zero. + Unchanged on exit. + Level 2 Blas routine. - Test the input parameters. + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. - - Parameter adjustments + + + Test the input parameters. + + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] #define Y(I) y[(I)-1] @@ -154,8 +154,8 @@ return 0; } -/* Set LENX and LENY, the lengths of the vectors x and y, and set - +/* Set LENX and LENY, the lengths of the vectors x and y, and set + up the start points in X and Y. */ if (strncmp(trans, "N", 1)==0) { @@ -176,8 +176,8 @@ ky = 1 - (leny - 1) * *incy; } -/* Start the operations. In this version the elements of A are - accessed sequentially with one pass through A. +/* Start the operations. In this version the elements of A are + accessed sequentially with one pass through A. First form y := beta*y. */ diff --git a/CBLAS/sger.c b/CBLAS/sger.c index ce03f527..06d3347f 100644 --- a/CBLAS/sger.c +++ b/CBLAS/sger.c @@ -6,7 +6,7 @@ #include "f2c.h" -/* Subroutine */ int sger_(integer *m, integer *n, real *alpha, real *x, +/* Subroutine */ int sger_(integer *m, integer *n, real *alpha, real *x, integer *incx, real *y, integer *incy, real *a, integer *lda) { @@ -21,84 +21,84 @@ extern int input_error(char *, int *); -/* Purpose - ======= +/* Purpose + ======= - SGER performs the rank 1 operation + SGER performs the rank 1 operation - A := alpha*x*y' + A, + A := alpha*x*y' + A, - where alpha is a scalar, x is an m element vector, y is an n element - - vector and A is an m by n matrix. + where alpha is a scalar, x is an m element vector, y is an n element - Parameters - ========== + vector and A is an m by n matrix. - M - INTEGER. - On entry, M specifies the number of rows of the matrix A. - M must be at least zero. - Unchanged on exit. + Parameters + ========== - N - INTEGER. - On entry, N specifies the number of columns of the matrix A. - - N must be at least zero. - Unchanged on exit. + M - INTEGER. + On entry, M specifies the number of rows of the matrix A. + M must be at least zero. + Unchanged on exit. - ALPHA - REAL . - On entry, ALPHA specifies the scalar alpha. - Unchanged on exit. + N - INTEGER. + On entry, N specifies the number of columns of the matrix A. - X - REAL array of dimension at least - ( 1 + ( m - 1 )*abs( INCX ) ). - Before entry, the incremented array X must contain the m - element vector x. - Unchanged on exit. + N must be at least zero. + Unchanged on exit. - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. + ALPHA - REAL . + On entry, ALPHA specifies the scalar alpha. + Unchanged on exit. - Y - REAL array of dimension at least - ( 1 + ( n - 1 )*abs( INCY ) ). - Before entry, the incremented array Y must contain the n - element vector y. - Unchanged on exit. + X - REAL array of dimension at least + ( 1 + ( m - 1 )*abs( INCX ) ). + Before entry, the incremented array X must contain the m + element vector x. + Unchanged on exit. - INCY - INTEGER. - On entry, INCY specifies the increment for the elements of - Y. INCY must not be zero. - Unchanged on exit. + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. - A - REAL array of DIMENSION ( LDA, n ). - Before entry, the leading m by n part of the array A must - contain the matrix of coefficients. On exit, A is - overwritten by the updated matrix. + Y - REAL array of dimension at least + ( 1 + ( n - 1 )*abs( INCY ) ). + Before entry, the incremented array Y must contain the n + element vector y. + Unchanged on exit. - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, m ). - Unchanged on exit. + INCY - INTEGER. + On entry, INCY specifies the increment for the elements of + Y. INCY must not be zero. + Unchanged on exit. + A - REAL array of DIMENSION ( LDA, n ). + Before entry, the leading m by n part of the array A must + contain the matrix of coefficients. On exit, A is + overwritten by the updated matrix. - Level 2 Blas routine. + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. + in the calling (sub) program. LDA must be at least + max( 1, m ). + Unchanged on exit. + Level 2 Blas routine. - Test the input parameters. + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. - - Parameter adjustments + + + Test the input parameters. + + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] #define Y(I) y[(I)-1] @@ -128,7 +128,7 @@ return 0; } -/* Start the operations. In this version the elements of A are +/* Start the operations. In this version the elements of A are accessed sequentially with one pass through A. */ if (*incy > 0) { diff --git a/CBLAS/slu_Cnames.h b/CBLAS/slu_Cnames.h index 9f426082..be5a8cdb 100644 --- a/CBLAS/slu_Cnames.h +++ b/CBLAS/slu_Cnames.h @@ -13,7 +13,7 @@ * NOCHANGE indicates that fortran will be calling, and that it expects * the name called by fortran to be identical to that compiled by the C * (RS6K's do this). UPCASE says it expects C routines called by fortran - * to be in all upcase (CRAY wants this). + * to be in all upcase (CRAY wants this). * */ #ifndef __SUPERLU_CNAMES /* allow multiple inclusions */ @@ -69,7 +69,7 @@ #if (F77_CALL_C == ADD__) /* * These defines set up the naming scheme required to have a fortran 77 - * routine call a C routine + * routine call a C routine * for following Fortran to C interface: * FORTRAN CALL C DECLARATION * call dgemm(...) void dgemm__(...) @@ -163,7 +163,7 @@ #if (F77_CALL_C == UPCASE) /* * These defines set up the naming scheme required to have a fortran 77 - * routine call a C routine + * routine call a C routine * following Fortran to C interface: * FORTRAN CALL C DECLARATION * call dgemm(...) void DGEMM(...) @@ -256,7 +256,7 @@ #if (F77_CALL_C == OLD_CRAY) /* * These defines set up the naming scheme required to have a fortran 77 - * routine call a C routine + * routine call a C routine * following Fortran to C interface: * FORTRAN CALL C DECLARATION * call dgemm(...) void SGEMM(...) @@ -349,7 +349,7 @@ #if (F77_CALL_C == NOCHANGE) /* * These defines set up the naming scheme required to have a fortran 77 - * routine call a C routine + * routine call a C routine * for following Fortran to C interface: * FORTRAN CALL C DECLARATION * call dgemm(...) void dgemm(...) diff --git a/CBLAS/snrm2.c b/CBLAS/snrm2.c index 99b4003f..56727ff0 100644 --- a/CBLAS/snrm2.c +++ b/CBLAS/snrm2.c @@ -23,20 +23,20 @@ real snrm2_(integer *n, real *x, integer *incx) static real ssq; -/* SNRM2 returns the euclidean norm of a vector via the function - name, so that +/* SNRM2 returns the euclidean norm of a vector via the function + name, so that - SNRM2 := sqrt( x'*x ) + SNRM2 := sqrt( x'*x ) - -- This version written on 25-October-1982. - Modified on 14-October-1993 to inline the call to SLASSQ. - Sven Hammarling, Nag Ltd. + -- This version written on 25-October-1982. + Modified on 14-October-1993 to inline the call to SLASSQ. + Sven Hammarling, Nag Ltd. - - Parameter adjustments + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] @@ -48,9 +48,9 @@ real snrm2_(integer *n, real *x, integer *incx) } else { scale = 0.f; ssq = 1.f; -/* The following loop is equivalent to this call to the LAPACK - - auxiliary routine: +/* The following loop is equivalent to this call to the LAPACK + + auxiliary routine: CALL SLASSQ( N, X, INCX, SCALE, SSQ ) */ i__1 = (*n - 1) * *incx + 1; diff --git a/CBLAS/srot.c b/CBLAS/srot.c index bdbb2345..d8f8d15c 100644 --- a/CBLAS/srot.c +++ b/CBLAS/srot.c @@ -6,7 +6,7 @@ #include "f2c.h" -/* Subroutine */ int srot_(integer *n, real *sx, integer *incx, real *sy, +/* Subroutine */ int srot_(integer *n, real *sx, integer *incx, real *sy, integer *incy, real *c, real *s) { @@ -20,13 +20,13 @@ static integer ix, iy; -/* applies a plane rotation. - jack dongarra, linpack, 3/11/78. - modified 12/3/93, array(1) declarations changed to array(*) +/* applies a plane rotation. + jack dongarra, linpack, 3/11/78. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define SY(I) sy[(I)-1] #define SX(I) sx[(I)-1] @@ -39,7 +39,7 @@ goto L20; } -/* code for unequal increments or equal increments not equal +/* code for unequal increments or equal increments not equal to 1 */ ix = 1; diff --git a/CBLAS/sscal.c b/CBLAS/sscal.c index a21ad4e8..a648d27c 100644 --- a/CBLAS/sscal.c +++ b/CBLAS/sscal.c @@ -17,15 +17,15 @@ static integer i, m, nincx, mp1; -/* scales a vector by a constant. - uses unrolled loops for increment equal to 1. - jack dongarra, linpack, 3/11/78. - modified 3/93 to return if incx .le. 0. - modified 12/3/93, array(1) declarations changed to array(*) +/* scales a vector by a constant. + uses unrolled loops for increment equal to 1. + jack dongarra, linpack, 3/11/78. + modified 3/93 to return if incx .le. 0. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define SX(I) sx[(I)-1] @@ -48,7 +48,7 @@ } return 0; -/* code for increment equal to 1 +/* code for increment equal to 1 clean-up loop */ diff --git a/CBLAS/sswap.c b/CBLAS/sswap.c index e6463a30..eee50974 100644 --- a/CBLAS/sswap.c +++ b/CBLAS/sswap.c @@ -1,7 +1,7 @@ #include "f2c.h" /*#include "blaswrap.h"*/ -/* Subroutine */ int sswap_(integer *n, real *sx, integer *incx, real *sy, +/* Subroutine */ int sswap_(integer *n, real *sx, integer *incx, real *sy, integer *incy) { /* System generated locals */ diff --git a/CBLAS/ssymv.c b/CBLAS/ssymv.c index 64bdbf5d..f189015f 100644 --- a/CBLAS/ssymv.c +++ b/CBLAS/ssymv.c @@ -6,7 +6,7 @@ #include #include "f2c.h" -/* Subroutine */ int ssymv_(char *uplo, integer *n, real *alpha, real *a, +/* Subroutine */ int ssymv_(char *uplo, integer *n, real *alpha, real *a, integer *lda, real *x, integer *incx, real *beta, real *y, integer * incy) { @@ -23,103 +23,103 @@ extern int input_error(char *, int *); -/* Purpose - ======= +/* Purpose + ======= - SSYMV performs the matrix-vector operation + SSYMV performs the matrix-vector operation - y := alpha*A*x + beta*y, + y := alpha*A*x + beta*y, - where alpha and beta are scalars, x and y are n element vectors and - A is an n by n symmetric matrix. + where alpha and beta are scalars, x and y are n element vectors and + A is an n by n symmetric matrix. - Parameters - ========== + Parameters + ========== - UPLO - CHARACTER*1. - On entry, UPLO specifies whether the upper or lower - triangular part of the array A is to be referenced as - follows: + UPLO - CHARACTER*1. + On entry, UPLO specifies whether the upper or lower + triangular part of the array A is to be referenced as + follows: - UPLO = 'U' or 'u' Only the upper triangular part of A - is to be referenced. + UPLO = 'U' or 'u' Only the upper triangular part of A + is to be referenced. - UPLO = 'L' or 'l' Only the lower triangular part of A - is to be referenced. + UPLO = 'L' or 'l' Only the lower triangular part of A + is to be referenced. - Unchanged on exit. + Unchanged on exit. - N - INTEGER. - On entry, N specifies the order of the matrix A. - N must be at least zero. - Unchanged on exit. + N - INTEGER. + On entry, N specifies the order of the matrix A. + N must be at least zero. + Unchanged on exit. - ALPHA - REAL . - On entry, ALPHA specifies the scalar alpha. - Unchanged on exit. + ALPHA - REAL . + On entry, ALPHA specifies the scalar alpha. + Unchanged on exit. - A - REAL array of DIMENSION ( LDA, n ). - Before entry with UPLO = 'U' or 'u', the leading n by n - upper triangular part of the array A must contain the upper - - triangular part of the symmetric matrix and the strictly - lower triangular part of A is not referenced. - Before entry with UPLO = 'L' or 'l', the leading n by n - lower triangular part of the array A must contain the lower - - triangular part of the symmetric matrix and the strictly - upper triangular part of A is not referenced. - Unchanged on exit. + A - REAL array of DIMENSION ( LDA, n ). + Before entry with UPLO = 'U' or 'u', the leading n by n + upper triangular part of the array A must contain the upper - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, n ). - Unchanged on exit. + triangular part of the symmetric matrix and the strictly + lower triangular part of A is not referenced. + Before entry with UPLO = 'L' or 'l', the leading n by n + lower triangular part of the array A must contain the lower - X - REAL array of dimension at least - ( 1 + ( n - 1 )*abs( INCX ) ). - Before entry, the incremented array X must contain the n - element vector x. - Unchanged on exit. + triangular part of the symmetric matrix and the strictly + upper triangular part of A is not referenced. + Unchanged on exit. - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared - BETA - REAL . - On entry, BETA specifies the scalar beta. When BETA is - supplied as zero then Y need not be set on input. - Unchanged on exit. + in the calling (sub) program. LDA must be at least + max( 1, n ). + Unchanged on exit. - Y - REAL array of dimension at least - ( 1 + ( n - 1 )*abs( INCY ) ). - Before entry, the incremented array Y must contain the n - element vector y. On exit, Y is overwritten by the updated - vector y. + X - REAL array of dimension at least + ( 1 + ( n - 1 )*abs( INCX ) ). + Before entry, the incremented array X must contain the n + element vector x. + Unchanged on exit. - INCY - INTEGER. - On entry, INCY specifies the increment for the elements of - Y. INCY must not be zero. - Unchanged on exit. + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. + BETA - REAL . + On entry, BETA specifies the scalar beta. When BETA is + supplied as zero then Y need not be set on input. + Unchanged on exit. - Level 2 Blas routine. + Y - REAL array of dimension at least + ( 1 + ( n - 1 )*abs( INCY ) ). + Before entry, the incremented array Y must contain the n + element vector y. On exit, Y is overwritten by the updated + vector y. - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. + INCY - INTEGER. + On entry, INCY specifies the increment for the elements of + Y. INCY must not be zero. + Unchanged on exit. + Level 2 Blas routine. - Test the input parameters. + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. - - Parameter adjustments + + + Test the input parameters. + + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] #define Y(I) y[(I)-1] @@ -162,9 +162,9 @@ ky = 1 - (*n - 1) * *incy; } -/* Start the operations. In this version the elements of A are - accessed sequentially with one pass through the triangular part - of A. +/* Start the operations. In this version the elements of A are + accessed sequentially with one pass through the triangular part + of A. First form y := beta*y. */ diff --git a/CBLAS/ssyr2.c b/CBLAS/ssyr2.c index 4c9b36e5..404fef97 100644 --- a/CBLAS/ssyr2.c +++ b/CBLAS/ssyr2.c @@ -6,7 +6,7 @@ #include #include "f2c.h" -/* Subroutine */ int ssyr2_(char *uplo, integer *n, real *alpha, real *x, +/* Subroutine */ int ssyr2_(char *uplo, integer *n, real *alpha, real *x, integer *incx, real *y, integer *incy, real *a, integer *lda) { @@ -21,102 +21,102 @@ static integer ix, iy, jx, jy, kx, ky; extern int input_error(char *, int *); -/* Purpose - ======= +/* Purpose + ======= - SSYR2 performs the symmetric rank 2 operation + SSYR2 performs the symmetric rank 2 operation - A := alpha*x*y' + alpha*y*x' + A, + A := alpha*x*y' + alpha*y*x' + A, - where alpha is a scalar, x and y are n element vectors and A is an n - - by n symmetric matrix. + where alpha is a scalar, x and y are n element vectors and A is an n - Parameters - ========== + by n symmetric matrix. - UPLO - CHARACTER*1. - On entry, UPLO specifies whether the upper or lower - triangular part of the array A is to be referenced as - follows: + Parameters + ========== - UPLO = 'U' or 'u' Only the upper triangular part of A - is to be referenced. + UPLO - CHARACTER*1. + On entry, UPLO specifies whether the upper or lower + triangular part of the array A is to be referenced as + follows: - UPLO = 'L' or 'l' Only the lower triangular part of A - is to be referenced. + UPLO = 'U' or 'u' Only the upper triangular part of A + is to be referenced. - Unchanged on exit. + UPLO = 'L' or 'l' Only the lower triangular part of A + is to be referenced. - N - INTEGER. - On entry, N specifies the order of the matrix A. - N must be at least zero. - Unchanged on exit. + Unchanged on exit. - ALPHA - REAL . - On entry, ALPHA specifies the scalar alpha. - Unchanged on exit. + N - INTEGER. + On entry, N specifies the order of the matrix A. + N must be at least zero. + Unchanged on exit. - X - REAL array of dimension at least - ( 1 + ( n - 1 )*abs( INCX ) ). - Before entry, the incremented array X must contain the n - element vector x. - Unchanged on exit. + ALPHA - REAL . + On entry, ALPHA specifies the scalar alpha. + Unchanged on exit. - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. + X - REAL array of dimension at least + ( 1 + ( n - 1 )*abs( INCX ) ). + Before entry, the incremented array X must contain the n + element vector x. + Unchanged on exit. - Y - REAL array of dimension at least - ( 1 + ( n - 1 )*abs( INCY ) ). - Before entry, the incremented array Y must contain the n - element vector y. - Unchanged on exit. + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. - INCY - INTEGER. - On entry, INCY specifies the increment for the elements of - Y. INCY must not be zero. - Unchanged on exit. + Y - REAL array of dimension at least + ( 1 + ( n - 1 )*abs( INCY ) ). + Before entry, the incremented array Y must contain the n + element vector y. + Unchanged on exit. - A - REAL array of DIMENSION ( LDA, n ). - Before entry with UPLO = 'U' or 'u', the leading n by n - upper triangular part of the array A must contain the upper - - triangular part of the symmetric matrix and the strictly - lower triangular part of A is not referenced. On exit, the - upper triangular part of the array A is overwritten by the - upper triangular part of the updated matrix. - Before entry with UPLO = 'L' or 'l', the leading n by n - lower triangular part of the array A must contain the lower - - triangular part of the symmetric matrix and the strictly - upper triangular part of A is not referenced. On exit, the - lower triangular part of the array A is overwritten by the - lower triangular part of the updated matrix. + INCY - INTEGER. + On entry, INCY specifies the increment for the elements of + Y. INCY must not be zero. + Unchanged on exit. - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, n ). - Unchanged on exit. + A - REAL array of DIMENSION ( LDA, n ). + Before entry with UPLO = 'U' or 'u', the leading n by n + upper triangular part of the array A must contain the upper + triangular part of the symmetric matrix and the strictly + lower triangular part of A is not referenced. On exit, the + upper triangular part of the array A is overwritten by the + upper triangular part of the updated matrix. + Before entry with UPLO = 'L' or 'l', the leading n by n + lower triangular part of the array A must contain the lower - Level 2 Blas routine. + triangular part of the symmetric matrix and the strictly + upper triangular part of A is not referenced. On exit, the + lower triangular part of the array A is overwritten by the + lower triangular part of the updated matrix. - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared + in the calling (sub) program. LDA must be at least + max( 1, n ). + Unchanged on exit. - Test the input parameters. + Level 2 Blas routine. - - Parameter adjustments + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. + + + + Test the input parameters. + + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] #define Y(I) y[(I)-1] @@ -146,8 +146,8 @@ return 0; } -/* Set up the start points in X and Y if the increments are not both - +/* Set up the start points in X and Y if the increments are not both + unity. */ if (*incx != 1 || *incy != 1) { @@ -165,8 +165,8 @@ jy = ky; } -/* Start the operations. In this version the elements of A are - accessed sequentially with one pass through the triangular part +/* Start the operations. In this version the elements of A are + accessed sequentially with one pass through the triangular part of A. */ if (strncmp(uplo, "U", 1)==0) { @@ -181,7 +181,7 @@ temp2 = *alpha * X(j); i__2 = j; for (i = 1; i <= j; ++i) { - A(i,j) = A(i,j) + X(i) * temp1 + A(i,j) = A(i,j) + X(i) * temp1 + Y(i) * temp2; /* L10: */ } @@ -198,7 +198,7 @@ iy = ky; i__2 = j; for (i = 1; i <= j; ++i) { - A(i,j) = A(i,j) + X(ix) * temp1 + A(i,j) = A(i,j) + X(ix) * temp1 + Y(iy) * temp2; ix += *incx; iy += *incy; @@ -222,7 +222,7 @@ temp2 = *alpha * X(j); i__2 = *n; for (i = j; i <= *n; ++i) { - A(i,j) = A(i,j) + X(i) * temp1 + A(i,j) = A(i,j) + X(i) * temp1 + Y(i) * temp2; /* L50: */ } @@ -239,7 +239,7 @@ iy = jy; i__2 = *n; for (i = j; i <= *n; ++i) { - A(i,j) = A(i,j) + X(ix) * temp1 + A(i,j) = A(i,j) + X(ix) * temp1 + Y(iy) * temp2; ix += *incx; iy += *incy; diff --git a/CBLAS/strsv.c b/CBLAS/strsv.c index 513ede73..687eccfc 100644 --- a/CBLAS/strsv.c +++ b/CBLAS/strsv.c @@ -6,7 +6,7 @@ #include #include "f2c.h" -/* Subroutine */ int strsv_(char *uplo, char *trans, char *diag, integer *n, +/* Subroutine */ int strsv_(char *uplo, char *trans, char *diag, integer *n, real *a, integer *lda, real *x, integer *incx) { @@ -23,109 +23,109 @@ extern int input_error(char *, int *); -/* Purpose - ======= +/* Purpose + ======= - STRSV solves one of the systems of equations + STRSV solves one of the systems of equations - A*x = b, or A'*x = b, + A*x = b, or A'*x = b, - where b and x are n element vectors and A is an n by n unit, or - non-unit, upper or lower triangular matrix. + where b and x are n element vectors and A is an n by n unit, or + non-unit, upper or lower triangular matrix. - No test for singularity or near-singularity is included in this - routine. Such tests must be performed before calling this routine. + No test for singularity or near-singularity is included in this + routine. Such tests must be performed before calling this routine. - Parameters - ========== + Parameters + ========== - UPLO - CHARACTER*1. - On entry, UPLO specifies whether the matrix is an upper or - lower triangular matrix as follows: + UPLO - CHARACTER*1. + On entry, UPLO specifies whether the matrix is an upper or + lower triangular matrix as follows: - UPLO = 'U' or 'u' A is an upper triangular matrix. + UPLO = 'U' or 'u' A is an upper triangular matrix. - UPLO = 'L' or 'l' A is a lower triangular matrix. + UPLO = 'L' or 'l' A is a lower triangular matrix. - Unchanged on exit. + Unchanged on exit. - TRANS - CHARACTER*1. - On entry, TRANS specifies the equations to be solved as - follows: + TRANS - CHARACTER*1. + On entry, TRANS specifies the equations to be solved as + follows: - TRANS = 'N' or 'n' A*x = b. + TRANS = 'N' or 'n' A*x = b. - TRANS = 'T' or 't' A'*x = b. + TRANS = 'T' or 't' A'*x = b. - TRANS = 'C' or 'c' A'*x = b. + TRANS = 'C' or 'c' A'*x = b. - Unchanged on exit. + Unchanged on exit. - DIAG - CHARACTER*1. - On entry, DIAG specifies whether or not A is unit - triangular as follows: + DIAG - CHARACTER*1. + On entry, DIAG specifies whether or not A is unit + triangular as follows: - DIAG = 'U' or 'u' A is assumed to be unit triangular. + DIAG = 'U' or 'u' A is assumed to be unit triangular. - DIAG = 'N' or 'n' A is not assumed to be unit - triangular. + DIAG = 'N' or 'n' A is not assumed to be unit + triangular. - Unchanged on exit. + Unchanged on exit. - N - INTEGER. - On entry, N specifies the order of the matrix A. - N must be at least zero. - Unchanged on exit. + N - INTEGER. + On entry, N specifies the order of the matrix A. + N must be at least zero. + Unchanged on exit. - A - REAL array of DIMENSION ( LDA, n ). - Before entry with UPLO = 'U' or 'u', the leading n by n - upper triangular part of the array A must contain the upper - - triangular matrix and the strictly lower triangular part of - - A is not referenced. - Before entry with UPLO = 'L' or 'l', the leading n by n - lower triangular part of the array A must contain the lower - - triangular matrix and the strictly upper triangular part of - - A is not referenced. - Note that when DIAG = 'U' or 'u', the diagonal elements of - - A are not referenced either, but are assumed to be unity. - Unchanged on exit. + A - REAL array of DIMENSION ( LDA, n ). + Before entry with UPLO = 'U' or 'u', the leading n by n + upper triangular part of the array A must contain the upper - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, n ). - Unchanged on exit. + triangular matrix and the strictly lower triangular part of - X - REAL array of dimension at least - ( 1 + ( n - 1 )*abs( INCX ) ). - Before entry, the incremented array X must contain the n - element right-hand side vector b. On exit, X is overwritten - - with the solution vector x. + A is not referenced. + Before entry with UPLO = 'L' or 'l', the leading n by n + lower triangular part of the array A must contain the lower - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. + triangular matrix and the strictly upper triangular part of + A is not referenced. + Note that when DIAG = 'U' or 'u', the diagonal elements of - Level 2 Blas routine. + A are not referenced either, but are assumed to be unity. + Unchanged on exit. - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared - Test the input parameters. - - Parameter adjustments + in the calling (sub) program. LDA must be at least + max( 1, n ). + Unchanged on exit. + + X - REAL array of dimension at least + ( 1 + ( n - 1 )*abs( INCX ) ). + Before entry, the incremented array X must contain the n + element right-hand side vector b. On exit, X is overwritten + + with the solution vector x. + + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. + + + Level 2 Blas routine. + + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. + + Test the input parameters. + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] @@ -159,7 +159,7 @@ nounit = (strncmp(diag, "N", 1)==0); -/* Set up the start point in X if the increment is not unity. This +/* Set up the start point in X if the increment is not unity. This will be ( N - 1 )*INCX too small for descending loops. */ if (*incx <= 0) { @@ -168,7 +168,7 @@ kx = 1; } -/* Start the operations. In this version the elements of A are +/* Start the operations. In this version the elements of A are accessed sequentially with one pass through A. */ if (strncmp(trans, "N", 1)==0) { diff --git a/CBLAS/zaxpy.c b/CBLAS/zaxpy.c index 37d4f32b..6b877b27 100644 --- a/CBLAS/zaxpy.c +++ b/CBLAS/zaxpy.c @@ -6,7 +6,7 @@ #include "f2c.h" -/* Subroutine */ int zaxpy_(integer *n, doublecomplex *za, doublecomplex *zx, +/* Subroutine */ int zaxpy_(integer *n, doublecomplex *za, doublecomplex *zx, integer *incx, doublecomplex *zy, integer *incy) { @@ -21,12 +21,12 @@ static integer ix, iy; -/* constant times a vector plus a vector. - jack dongarra, 3/11/78. - modified 12/3/93, array(1) declarations changed to array(*) +/* constant times a vector plus a vector. + jack dongarra, 3/11/78. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define ZY(I) zy[(I)-1] #define ZX(I) zx[(I)-1] @@ -42,7 +42,7 @@ goto L20; } -/* code for unequal increments or equal increments +/* code for unequal increments or equal increments not equal to 1 */ ix = 1; diff --git a/CBLAS/zcopy.c b/CBLAS/zcopy.c index 4cec89cf..5fc2454f 100644 --- a/CBLAS/zcopy.c +++ b/CBLAS/zcopy.c @@ -6,7 +6,7 @@ #include "f2c.h" -/* Subroutine */ int zcopy_(integer *n, doublecomplex *zx, integer *incx, +/* Subroutine */ int zcopy_(integer *n, doublecomplex *zx, integer *incx, doublecomplex *zy, integer *incy) { @@ -18,13 +18,13 @@ static integer i, ix, iy; -/* copies a vector, x, to a vector, y. - jack dongarra, linpack, 4/11/78. - modified 12/3/93, array(1) declarations changed to array(*) +/* copies a vector, x, to a vector, y. + jack dongarra, linpack, 4/11/78. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define ZY(I) zy[(I)-1] #define ZX(I) zx[(I)-1] @@ -37,7 +37,7 @@ goto L20; } -/* code for unequal increments or equal increments +/* code for unequal increments or equal increments not equal to 1 */ ix = 1; diff --git a/CBLAS/zdotc.c b/CBLAS/zdotc.c index 63ba4fb8..49e38929 100644 --- a/CBLAS/zdotc.c +++ b/CBLAS/zdotc.c @@ -5,7 +5,7 @@ #include "f2c.h" -/* Double Complex */ VOID zdotc_(doublecomplex * ret_val, integer *n, +/* Double Complex */ VOID zdotc_(doublecomplex * ret_val, integer *n, doublecomplex *zx, integer *incx, doublecomplex *zy, integer *incy) { /* System generated locals */ @@ -21,11 +21,11 @@ static integer ix, iy; -/* forms the dot product of a vector. - jack dongarra, 3/11/78. - modified 12/3/93, array(1) declarations changed to array(*) +/* forms the dot product of a vector. + jack dongarra, 3/11/78. + modified 12/3/93, array(1) declarations changed to array(*) + - Parameter adjustments */ --zy; --zx; @@ -40,7 +40,7 @@ goto L20; } -/* code for unequal increments or equal increments +/* code for unequal increments or equal increments not equal to 1 */ ix = 1; @@ -55,7 +55,7 @@ for (i = 1; i <= *n; ++i) { d_cnjg(&z__3, &zx[ix]); i__2 = iy; - z__2.r = z__3.r * zy[iy].r - z__3.i * zy[iy].i, z__2.i = z__3.r * + z__2.r = z__3.r * zy[iy].r - z__3.i * zy[iy].i, z__2.i = z__3.r * zy[iy].i + z__3.i * zy[iy].r; z__1.r = ztemp.r + z__2.r, z__1.i = ztemp.i + z__2.i; ztemp.r = z__1.r, ztemp.i = z__1.i; @@ -73,7 +73,7 @@ for (i = 1; i <= *n; ++i) { d_cnjg(&z__3, &zx[i]); i__2 = i; - z__2.r = z__3.r * zy[i].r - z__3.i * zy[i].i, z__2.i = z__3.r * + z__2.r = z__3.r * zy[i].r - z__3.i * zy[i].i, z__2.i = z__3.r * zy[i].i + z__3.i * zy[i].r; z__1.r = ztemp.r + z__2.r, z__1.i = ztemp.i + z__2.i; ztemp.r = z__1.r, ztemp.i = z__1.i; diff --git a/CBLAS/zgemv.c b/CBLAS/zgemv.c index 58cfe030..8fcf8e7d 100644 --- a/CBLAS/zgemv.c +++ b/CBLAS/zgemv.c @@ -6,7 +6,7 @@ #include #include "f2c.h" -/* Subroutine */ int zgemv_(char *trans, integer *m, integer *n, +/* Subroutine */ int zgemv_(char *trans, integer *m, integer *n, doublecomplex *alpha, doublecomplex *a, integer *lda, doublecomplex * x, integer *incx, doublecomplex *beta, doublecomplex *y, integer * incy) @@ -29,105 +29,105 @@ extern int input_error(char *, int *); -/* Purpose - ======= +/* Purpose + ======= - ZGEMV performs one of the matrix-vector operations + ZGEMV performs one of the matrix-vector operations - y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, or + y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, or - y := alpha*conjg( A' )*x + beta*y, + y := alpha*conjg( A' )*x + beta*y, - where alpha and beta are scalars, x and y are vectors and A is an - m by n matrix. + where alpha and beta are scalars, x and y are vectors and A is an + m by n matrix. - Parameters - ========== + Parameters + ========== - TRANS - CHARACTER*1. - On entry, TRANS specifies the operation to be performed as - follows: + TRANS - CHARACTER*1. + On entry, TRANS specifies the operation to be performed as + follows: - TRANS = 'N' or 'n' y := alpha*A*x + beta*y. + TRANS = 'N' or 'n' y := alpha*A*x + beta*y. - TRANS = 'T' or 't' y := alpha*A'*x + beta*y. + TRANS = 'T' or 't' y := alpha*A'*x + beta*y. - TRANS = 'C' or 'c' y := alpha*conjg( A' )*x + beta*y. + TRANS = 'C' or 'c' y := alpha*conjg( A' )*x + beta*y. - Unchanged on exit. + Unchanged on exit. - M - INTEGER. - On entry, M specifies the number of rows of the matrix A. - M must be at least zero. - Unchanged on exit. + M - INTEGER. + On entry, M specifies the number of rows of the matrix A. + M must be at least zero. + Unchanged on exit. - N - INTEGER. - On entry, N specifies the number of columns of the matrix A. - - N must be at least zero. - Unchanged on exit. + N - INTEGER. + On entry, N specifies the number of columns of the matrix A. - ALPHA - COMPLEX*16 . - On entry, ALPHA specifies the scalar alpha. - Unchanged on exit. + N must be at least zero. + Unchanged on exit. - A - COMPLEX*16 array of DIMENSION ( LDA, n ). - Before entry, the leading m by n part of the array A must - contain the matrix of coefficients. - Unchanged on exit. + ALPHA - COMPLEX*16 . + On entry, ALPHA specifies the scalar alpha. + Unchanged on exit. - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, m ). - Unchanged on exit. + A - COMPLEX*16 array of DIMENSION ( LDA, n ). + Before entry, the leading m by n part of the array A must + contain the matrix of coefficients. + Unchanged on exit. - X - COMPLEX*16 array of DIMENSION at least - ( 1 + ( n - 1 )*abs( INCX ) ) when TRANS = 'N' or 'n' - and at least - ( 1 + ( m - 1 )*abs( INCX ) ) otherwise. - Before entry, the incremented array X must contain the - vector x. - Unchanged on exit. + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. + in the calling (sub) program. LDA must be at least + max( 1, m ). + Unchanged on exit. - BETA - COMPLEX*16 . - On entry, BETA specifies the scalar beta. When BETA is - supplied as zero then Y need not be set on input. - Unchanged on exit. + X - COMPLEX*16 array of DIMENSION at least + ( 1 + ( n - 1 )*abs( INCX ) ) when TRANS = 'N' or 'n' + and at least + ( 1 + ( m - 1 )*abs( INCX ) ) otherwise. + Before entry, the incremented array X must contain the + vector x. + Unchanged on exit. - Y - COMPLEX*16 array of DIMENSION at least - ( 1 + ( m - 1 )*abs( INCY ) ) when TRANS = 'N' or 'n' - and at least - ( 1 + ( n - 1 )*abs( INCY ) ) otherwise. - Before entry with BETA non-zero, the incremented array Y - must contain the vector y. On exit, Y is overwritten by the - - updated vector y. + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. - INCY - INTEGER. - On entry, INCY specifies the increment for the elements of - Y. INCY must not be zero. - Unchanged on exit. + BETA - COMPLEX*16 . + On entry, BETA specifies the scalar beta. When BETA is + supplied as zero then Y need not be set on input. + Unchanged on exit. + Y - COMPLEX*16 array of DIMENSION at least + ( 1 + ( m - 1 )*abs( INCY ) ) when TRANS = 'N' or 'n' + and at least + ( 1 + ( n - 1 )*abs( INCY ) ) otherwise. + Before entry with BETA non-zero, the incremented array Y + must contain the vector y. On exit, Y is overwritten by the - Level 2 Blas routine. + updated vector y. - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. + INCY - INTEGER. + On entry, INCY specifies the increment for the elements of + Y. INCY must not be zero. + Unchanged on exit. - Test the input parameters. - - Parameter adjustments + Level 2 Blas routine. + + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. + + Test the input parameters. + + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] #define Y(I) y[(I)-1] @@ -156,14 +156,14 @@ /* Quick return if possible. */ - if (*m == 0 || *n == 0 || alpha->r == 0. && alpha->i == 0. && (beta->r == + if (*m == 0 || *n == 0 || alpha->r == 0. && alpha->i == 0. && (beta->r == 1. && beta->i == 0.)) { return 0; } noconj = ( strncmp(trans, "T", 1)==0 ); -/* Set LENX and LENY, the lengths of the vectors x and y, and set +/* Set LENX and LENY, the lengths of the vectors x and y, and set up the start points in X and Y. */ if (strncmp(trans, "N", 1)==0) { @@ -184,8 +184,8 @@ ky = 1 - (leny - 1) * *incy; } -/* Start the operations. In this version the elements of A are - accessed sequentially with one pass through A. +/* Start the operations. In this version the elements of A are + accessed sequentially with one pass through A. First form y := beta*y. */ @@ -203,7 +203,7 @@ for (i = 1; i <= leny; ++i) { i__2 = i; i__3 = i; - z__1.r = beta->r * Y(i).r - beta->i * Y(i).i, + z__1.r = beta->r * Y(i).r - beta->i * Y(i).i, z__1.i = beta->r * Y(i).i + beta->i * Y(i) .r; Y(i).r = z__1.r, Y(i).i = z__1.i; @@ -225,7 +225,7 @@ for (i = 1; i <= leny; ++i) { i__2 = iy; i__3 = iy; - z__1.r = beta->r * Y(iy).r - beta->i * Y(iy).i, + z__1.r = beta->r * Y(iy).r - beta->i * Y(iy).i, z__1.i = beta->r * Y(iy).i + beta->i * Y(iy) .r; Y(iy).r = z__1.r, Y(iy).i = z__1.i; @@ -249,7 +249,7 @@ i__2 = jx; if (X(jx).r != 0. || X(jx).i != 0.) { i__2 = jx; - z__1.r = alpha->r * X(jx).r - alpha->i * X(jx).i, + z__1.r = alpha->r * X(jx).r - alpha->i * X(jx).i, z__1.i = alpha->r * X(jx).i + alpha->i * X(jx) .r; temp.r = z__1.r, temp.i = z__1.i; @@ -258,10 +258,10 @@ i__3 = i; i__4 = i; i__5 = i + j * a_dim1; - z__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, + z__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, z__2.i = temp.r * A(i,j).i + temp.i * A(i,j) .r; - z__1.r = Y(i).r + z__2.r, z__1.i = Y(i).i + + z__1.r = Y(i).r + z__2.r, z__1.i = Y(i).i + z__2.i; Y(i).r = z__1.r, Y(i).i = z__1.i; /* L50: */ @@ -276,7 +276,7 @@ i__2 = jx; if (X(jx).r != 0. || X(jx).i != 0.) { i__2 = jx; - z__1.r = alpha->r * X(jx).r - alpha->i * X(jx).i, + z__1.r = alpha->r * X(jx).r - alpha->i * X(jx).i, z__1.i = alpha->r * X(jx).i + alpha->i * X(jx) .r; temp.r = z__1.r, temp.i = z__1.i; @@ -286,10 +286,10 @@ i__3 = iy; i__4 = iy; i__5 = i + j * a_dim1; - z__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, + z__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, z__2.i = temp.r * A(i,j).i + temp.i * A(i,j) .r; - z__1.r = Y(iy).r + z__2.r, z__1.i = Y(iy).i + + z__1.r = Y(iy).r + z__2.r, z__1.i = Y(iy).i + z__2.i; Y(iy).r = z__1.r, Y(iy).i = z__1.i; iy += *incy; @@ -327,7 +327,7 @@ for (i = 1; i <= *m; ++i) { d_cnjg(&z__3, &A(i,j)); i__3 = i; - z__2.r = z__3.r * X(i).r - z__3.i * X(i).i, + z__2.r = z__3.r * X(i).r - z__3.i * X(i).i, z__2.i = z__3.r * X(i).i + z__3.i * X(i) .r; z__1.r = temp.r + z__2.r, z__1.i = temp.i + z__2.i; @@ -337,7 +337,7 @@ } i__2 = jy; i__3 = jy; - z__2.r = alpha->r * temp.r - alpha->i * temp.i, z__2.i = + z__2.r = alpha->r * temp.r - alpha->i * temp.i, z__2.i = alpha->r * temp.i + alpha->i * temp.r; z__1.r = Y(jy).r + z__2.r, z__1.i = Y(jy).i + z__2.i; Y(jy).r = z__1.r, Y(jy).i = z__1.i; @@ -367,7 +367,7 @@ for (i = 1; i <= *m; ++i) { d_cnjg(&z__3, &A(i,j)); i__3 = ix; - z__2.r = z__3.r * X(ix).r - z__3.i * X(ix).i, + z__2.r = z__3.r * X(ix).r - z__3.i * X(ix).i, z__2.i = z__3.r * X(ix).i + z__3.i * X(ix) .r; z__1.r = temp.r + z__2.r, z__1.i = temp.i + z__2.i; @@ -378,7 +378,7 @@ } i__2 = jy; i__3 = jy; - z__2.r = alpha->r * temp.r - alpha->i * temp.i, z__2.i = + z__2.r = alpha->r * temp.r - alpha->i * temp.i, z__2.i = alpha->r * temp.i + alpha->i * temp.r; z__1.r = Y(jy).r + z__2.r, z__1.i = Y(jy).i + z__2.i; Y(jy).r = z__1.r, Y(jy).i = z__1.i; diff --git a/CBLAS/zgerc.c b/CBLAS/zgerc.c index d5562d02..ce8a32d7 100644 --- a/CBLAS/zgerc.c +++ b/CBLAS/zgerc.c @@ -6,8 +6,8 @@ #include "f2c.h" -/* Subroutine */ int zgerc_(integer *m, integer *n, doublecomplex *alpha, - doublecomplex *x, integer *incx, doublecomplex *y, integer *incy, +/* Subroutine */ int zgerc_(integer *m, integer *n, doublecomplex *alpha, + doublecomplex *x, integer *incx, doublecomplex *y, integer *incy, doublecomplex *a, integer *lda) { @@ -27,84 +27,84 @@ extern int input_error(char *, int *); -/* Purpose - ======= +/* Purpose + ======= - ZGERC performs the rank 1 operation + ZGERC performs the rank 1 operation - A := alpha*x*conjg( y' ) + A, + A := alpha*x*conjg( y' ) + A, - where alpha is a scalar, x is an m element vector, y is an n element - - vector and A is an m by n matrix. + where alpha is a scalar, x is an m element vector, y is an n element - Parameters - ========== + vector and A is an m by n matrix. - M - INTEGER. - On entry, M specifies the number of rows of the matrix A. - M must be at least zero. - Unchanged on exit. + Parameters + ========== - N - INTEGER. - On entry, N specifies the number of columns of the matrix A. - - N must be at least zero. - Unchanged on exit. + M - INTEGER. + On entry, M specifies the number of rows of the matrix A. + M must be at least zero. + Unchanged on exit. - ALPHA - COMPLEX*16 . - On entry, ALPHA specifies the scalar alpha. - Unchanged on exit. + N - INTEGER. + On entry, N specifies the number of columns of the matrix A. - X - COMPLEX*16 array of dimension at least - ( 1 + ( m - 1 )*abs( INCX ) ). - Before entry, the incremented array X must contain the m - element vector x. - Unchanged on exit. + N must be at least zero. + Unchanged on exit. - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. + ALPHA - COMPLEX*16 . + On entry, ALPHA specifies the scalar alpha. + Unchanged on exit. - Y - COMPLEX*16 array of dimension at least - ( 1 + ( n - 1 )*abs( INCY ) ). - Before entry, the incremented array Y must contain the n - element vector y. - Unchanged on exit. + X - COMPLEX*16 array of dimension at least + ( 1 + ( m - 1 )*abs( INCX ) ). + Before entry, the incremented array X must contain the m + element vector x. + Unchanged on exit. - INCY - INTEGER. - On entry, INCY specifies the increment for the elements of - Y. INCY must not be zero. - Unchanged on exit. + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. - A - COMPLEX*16 array of DIMENSION ( LDA, n ). - Before entry, the leading m by n part of the array A must - contain the matrix of coefficients. On exit, A is - overwritten by the updated matrix. + Y - COMPLEX*16 array of dimension at least + ( 1 + ( n - 1 )*abs( INCY ) ). + Before entry, the incremented array Y must contain the n + element vector y. + Unchanged on exit. - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, m ). - Unchanged on exit. + INCY - INTEGER. + On entry, INCY specifies the increment for the elements of + Y. INCY must not be zero. + Unchanged on exit. + A - COMPLEX*16 array of DIMENSION ( LDA, n ). + Before entry, the leading m by n part of the array A must + contain the matrix of coefficients. On exit, A is + overwritten by the updated matrix. - Level 2 Blas routine. + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. + in the calling (sub) program. LDA must be at least + max( 1, m ). + Unchanged on exit. + Level 2 Blas routine. - Test the input parameters. + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. - - Parameter adjustments + + + Test the input parameters. + + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] #define Y(I) y[(I)-1] @@ -134,7 +134,7 @@ return 0; } -/* Start the operations. In this version the elements of A are +/* Start the operations. In this version the elements of A are accessed sequentially with one pass through A. */ if (*incy > 0) { @@ -148,7 +148,7 @@ i__2 = jy; if (Y(jy).r != 0. || Y(jy).i != 0.) { d_cnjg(&z__2, &Y(jy)); - z__1.r = alpha->r * z__2.r - alpha->i * z__2.i, z__1.i = + z__1.r = alpha->r * z__2.r - alpha->i * z__2.i, z__1.i = alpha->r * z__2.i + alpha->i * z__2.r; temp.r = z__1.r, temp.i = z__1.i; i__2 = *m; @@ -177,7 +177,7 @@ i__2 = jy; if (Y(jy).r != 0. || Y(jy).i != 0.) { d_cnjg(&z__2, &Y(jy)); - z__1.r = alpha->r * z__2.r - alpha->i * z__2.i, z__1.i = + z__1.r = alpha->r * z__2.r - alpha->i * z__2.i, z__1.i = alpha->r * z__2.i + alpha->i * z__2.r; temp.r = z__1.r, temp.i = z__1.i; ix = kx; diff --git a/CBLAS/zhemv.c b/CBLAS/zhemv.c index 14e3961e..aab50097 100644 --- a/CBLAS/zhemv.c +++ b/CBLAS/zhemv.c @@ -6,8 +6,8 @@ #include #include "f2c.h" -/* Subroutine */ int zhemv_(char *uplo, integer *n, doublecomplex *alpha, - doublecomplex *a, integer *lda, doublecomplex *x, integer *incx, +/* Subroutine */ int zhemv_(char *uplo, integer *n, doublecomplex *alpha, + doublecomplex *a, integer *lda, doublecomplex *x, integer *incx, doublecomplex *beta, doublecomplex *y, integer *incy) { @@ -28,103 +28,103 @@ extern int input_error(char *, int *); -/* Purpose - ======= - - ZHEMV performs the matrix-vector operation - - y := alpha*A*x + beta*y, - - where alpha and beta are scalars, x and y are n element vectors and - A is an n by n hermitian matrix. - - Parameters - ========== - - UPLO - CHARACTER*1. - On entry, UPLO specifies whether the upper or lower - triangular part of the array A is to be referenced as - follows: - - UPLO = 'U' or 'u' Only the upper triangular part of A - is to be referenced. - - UPLO = 'L' or 'l' Only the lower triangular part of A - is to be referenced. - - Unchanged on exit. - - N - INTEGER. - On entry, N specifies the order of the matrix A. - N must be at least zero. - Unchanged on exit. - - ALPHA - COMPLEX*16 . - On entry, ALPHA specifies the scalar alpha. - Unchanged on exit. - - A - COMPLEX*16 array of DIMENSION ( LDA, n ). - Before entry with UPLO = 'U' or 'u', the leading n by n - upper triangular part of the array A must contain the upper - - triangular part of the hermitian matrix and the strictly - lower triangular part of A is not referenced. - Before entry with UPLO = 'L' or 'l', the leading n by n - lower triangular part of the array A must contain the lower - - triangular part of the hermitian matrix and the strictly - upper triangular part of A is not referenced. - Note that the imaginary parts of the diagonal elements need - - not be set and are assumed to be zero. - Unchanged on exit. - - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, n ). - Unchanged on exit. - - X - COMPLEX*16 array of dimension at least - ( 1 + ( n - 1 )*abs( INCX ) ). - Before entry, the incremented array X must contain the n - element vector x. - Unchanged on exit. - - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. - - BETA - COMPLEX*16 . - On entry, BETA specifies the scalar beta. When BETA is - supplied as zero then Y need not be set on input. - Unchanged on exit. - - Y - COMPLEX*16 array of dimension at least - ( 1 + ( n - 1 )*abs( INCY ) ). - Before entry, the incremented array Y must contain the n - element vector y. On exit, Y is overwritten by the updated - vector y. - - INCY - INTEGER. - On entry, INCY specifies the increment for the elements of - Y. INCY must not be zero. - Unchanged on exit. - - - Level 2 Blas routine. - - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. - - Test the input parameters. - - Parameter adjustments +/* Purpose + ======= + + ZHEMV performs the matrix-vector operation + + y := alpha*A*x + beta*y, + + where alpha and beta are scalars, x and y are n element vectors and + A is an n by n hermitian matrix. + + Parameters + ========== + + UPLO - CHARACTER*1. + On entry, UPLO specifies whether the upper or lower + triangular part of the array A is to be referenced as + follows: + + UPLO = 'U' or 'u' Only the upper triangular part of A + is to be referenced. + + UPLO = 'L' or 'l' Only the lower triangular part of A + is to be referenced. + + Unchanged on exit. + + N - INTEGER. + On entry, N specifies the order of the matrix A. + N must be at least zero. + Unchanged on exit. + + ALPHA - COMPLEX*16 . + On entry, ALPHA specifies the scalar alpha. + Unchanged on exit. + + A - COMPLEX*16 array of DIMENSION ( LDA, n ). + Before entry with UPLO = 'U' or 'u', the leading n by n + upper triangular part of the array A must contain the upper + + triangular part of the hermitian matrix and the strictly + lower triangular part of A is not referenced. + Before entry with UPLO = 'L' or 'l', the leading n by n + lower triangular part of the array A must contain the lower + + triangular part of the hermitian matrix and the strictly + upper triangular part of A is not referenced. + Note that the imaginary parts of the diagonal elements need + + not be set and are assumed to be zero. + Unchanged on exit. + + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared + + in the calling (sub) program. LDA must be at least + max( 1, n ). + Unchanged on exit. + + X - COMPLEX*16 array of dimension at least + ( 1 + ( n - 1 )*abs( INCX ) ). + Before entry, the incremented array X must contain the n + element vector x. + Unchanged on exit. + + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. + + BETA - COMPLEX*16 . + On entry, BETA specifies the scalar beta. When BETA is + supplied as zero then Y need not be set on input. + Unchanged on exit. + + Y - COMPLEX*16 array of dimension at least + ( 1 + ( n - 1 )*abs( INCY ) ). + Before entry, the incremented array Y must contain the n + element vector y. On exit, Y is overwritten by the updated + vector y. + + INCY - INTEGER. + On entry, INCY specifies the increment for the elements of + Y. INCY must not be zero. + Unchanged on exit. + + + Level 2 Blas routine. + + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. + + Test the input parameters. + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] #define Y(I) y[(I)-1] @@ -150,7 +150,7 @@ /* Quick return if possible. */ - if (*n == 0 || alpha->r == 0. && alpha->i == 0. && (beta->r == 1. && + if (*n == 0 || alpha->r == 0. && alpha->i == 0. && (beta->r == 1. && beta->i == 0.)) { return 0; } @@ -168,9 +168,9 @@ ky = 1 - (*n - 1) * *incy; } -/* Start the operations. In this version the elements of A are - accessed sequentially with one pass through the triangular part - of A. +/* Start the operations. In this version the elements of A are + accessed sequentially with one pass through the triangular part + of A. First form y := beta*y. */ @@ -188,7 +188,7 @@ for (i = 1; i <= *n; ++i) { i__2 = i; i__3 = i; - z__1.r = beta->r * Y(i).r - beta->i * Y(i).i, + z__1.r = beta->r * Y(i).r - beta->i * Y(i).i, z__1.i = beta->r * Y(i).i + beta->i * Y(i) .r; Y(i).r = z__1.r, Y(i).i = z__1.i; @@ -210,7 +210,7 @@ for (i = 1; i <= *n; ++i) { i__2 = iy; i__3 = iy; - z__1.r = beta->r * Y(iy).r - beta->i * Y(iy).i, + z__1.r = beta->r * Y(iy).r - beta->i * Y(iy).i, z__1.i = beta->r * Y(iy).i + beta->i * Y(iy) .r; Y(iy).r = z__1.r, Y(iy).i = z__1.i; @@ -240,7 +240,7 @@ i__3 = i; i__4 = i; i__5 = i + j * a_dim1; - z__2.r = temp1.r * A(i,j).r - temp1.i * A(i,j).i, + z__2.r = temp1.r * A(i,j).r - temp1.i * A(i,j).i, z__2.i = temp1.r * A(i,j).i + temp1.i * A(i,j) .r; z__1.r = Y(i).r + z__2.r, z__1.i = Y(i).i + z__2.i; @@ -259,7 +259,7 @@ d__1 = A(j,j).r; z__3.r = d__1 * temp1.r, z__3.i = d__1 * temp1.i; z__2.r = Y(j).r + z__3.r, z__2.i = Y(j).i + z__3.i; - z__4.r = alpha->r * temp2.r - alpha->i * temp2.i, z__4.i = + z__4.r = alpha->r * temp2.r - alpha->i * temp2.i, z__4.i = alpha->r * temp2.i + alpha->i * temp2.r; z__1.r = z__2.r + z__4.r, z__1.i = z__2.i + z__4.i; Y(j).r = z__1.r, Y(j).i = z__1.i; @@ -282,7 +282,7 @@ i__3 = iy; i__4 = iy; i__5 = i + j * a_dim1; - z__2.r = temp1.r * A(i,j).r - temp1.i * A(i,j).i, + z__2.r = temp1.r * A(i,j).r - temp1.i * A(i,j).i, z__2.i = temp1.r * A(i,j).i + temp1.i * A(i,j) .r; z__1.r = Y(iy).r + z__2.r, z__1.i = Y(iy).i + z__2.i; @@ -303,7 +303,7 @@ d__1 = A(j,j).r; z__3.r = d__1 * temp1.r, z__3.i = d__1 * temp1.i; z__2.r = Y(jy).r + z__3.r, z__2.i = Y(jy).i + z__3.i; - z__4.r = alpha->r * temp2.r - alpha->i * temp2.i, z__4.i = + z__4.r = alpha->r * temp2.r - alpha->i * temp2.i, z__4.i = alpha->r * temp2.i + alpha->i * temp2.r; z__1.r = z__2.r + z__4.r, z__1.i = z__2.i + z__4.i; Y(jy).r = z__1.r, Y(jy).i = z__1.i; @@ -336,7 +336,7 @@ i__3 = i; i__4 = i; i__5 = i + j * a_dim1; - z__2.r = temp1.r * A(i,j).r - temp1.i * A(i,j).i, + z__2.r = temp1.r * A(i,j).r - temp1.i * A(i,j).i, z__2.i = temp1.r * A(i,j).i + temp1.i * A(i,j) .r; z__1.r = Y(i).r + z__2.r, z__1.i = Y(i).i + z__2.i; @@ -351,7 +351,7 @@ } i__2 = j; i__3 = j; - z__2.r = alpha->r * temp2.r - alpha->i * temp2.i, z__2.i = + z__2.r = alpha->r * temp2.r - alpha->i * temp2.i, z__2.i = alpha->r * temp2.i + alpha->i * temp2.r; z__1.r = Y(j).r + z__2.r, z__1.i = Y(j).i + z__2.i; Y(j).r = z__1.r, Y(j).i = z__1.i; @@ -383,7 +383,7 @@ i__3 = iy; i__4 = iy; i__5 = i + j * a_dim1; - z__2.r = temp1.r * A(i,j).r - temp1.i * A(i,j).i, + z__2.r = temp1.r * A(i,j).r - temp1.i * A(i,j).i, z__2.i = temp1.r * A(i,j).i + temp1.i * A(i,j) .r; z__1.r = Y(iy).r + z__2.r, z__1.i = Y(iy).i + z__2.i; @@ -398,7 +398,7 @@ } i__2 = jy; i__3 = jy; - z__2.r = alpha->r * temp2.r - alpha->i * temp2.i, z__2.i = + z__2.r = alpha->r * temp2.r - alpha->i * temp2.i, z__2.i = alpha->r * temp2.i + alpha->i * temp2.r; z__1.r = Y(jy).r + z__2.r, z__1.i = Y(jy).i + z__2.i; Y(jy).r = z__1.r, Y(jy).i = z__1.i; diff --git a/CBLAS/zher2.c b/CBLAS/zher2.c index 098219a0..c0e3ef37 100644 --- a/CBLAS/zher2.c +++ b/CBLAS/zher2.c @@ -6,8 +6,8 @@ #include #include "f2c.h" -/* Subroutine */ int zher2_(char *uplo, integer *n, doublecomplex *alpha, - doublecomplex *x, integer *incx, doublecomplex *y, integer *incy, +/* Subroutine */ int zher2_(char *uplo, integer *n, doublecomplex *alpha, + doublecomplex *x, integer *incx, doublecomplex *y, integer *incy, doublecomplex *a, integer *lda) { @@ -28,106 +28,106 @@ extern int input_error(char *, int *); -/* Purpose - ======= - - ZHER2 performs the hermitian rank 2 operation - - A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A, - - where alpha is a scalar, x and y are n element vectors and A is an n - - by n hermitian matrix. - - Parameters - ========== - - UPLO - CHARACTER*1. - On entry, UPLO specifies whether the upper or lower - triangular part of the array A is to be referenced as - follows: - - UPLO = 'U' or 'u' Only the upper triangular part of A - is to be referenced. - - UPLO = 'L' or 'l' Only the lower triangular part of A - is to be referenced. - - Unchanged on exit. - - N - INTEGER. - On entry, N specifies the order of the matrix A. - N must be at least zero. - Unchanged on exit. - - ALPHA - COMPLEX*16 . - On entry, ALPHA specifies the scalar alpha. - Unchanged on exit. - - X - COMPLEX*16 array of dimension at least - ( 1 + ( n - 1 )*abs( INCX ) ). - Before entry, the incremented array X must contain the n - element vector x. - Unchanged on exit. - - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. - - Y - COMPLEX*16 array of dimension at least - ( 1 + ( n - 1 )*abs( INCY ) ). - Before entry, the incremented array Y must contain the n - element vector y. - Unchanged on exit. - - INCY - INTEGER. - On entry, INCY specifies the increment for the elements of - Y. INCY must not be zero. - Unchanged on exit. - - A - COMPLEX*16 array of DIMENSION ( LDA, n ). - Before entry with UPLO = 'U' or 'u', the leading n by n - upper triangular part of the array A must contain the upper - - triangular part of the hermitian matrix and the strictly - lower triangular part of A is not referenced. On exit, the - upper triangular part of the array A is overwritten by the - upper triangular part of the updated matrix. - Before entry with UPLO = 'L' or 'l', the leading n by n - lower triangular part of the array A must contain the lower - - triangular part of the hermitian matrix and the strictly - upper triangular part of A is not referenced. On exit, the - lower triangular part of the array A is overwritten by the - lower triangular part of the updated matrix. - Note that the imaginary parts of the diagonal elements need - - not be set, they are assumed to be zero, and on exit they - are set to zero. - - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, n ). - Unchanged on exit. - - - Level 2 Blas routine. - - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. - - - - Test the input parameters. - - - Parameter adjustments +/* Purpose + ======= + + ZHER2 performs the hermitian rank 2 operation + + A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A, + + where alpha is a scalar, x and y are n element vectors and A is an n + + by n hermitian matrix. + + Parameters + ========== + + UPLO - CHARACTER*1. + On entry, UPLO specifies whether the upper or lower + triangular part of the array A is to be referenced as + follows: + + UPLO = 'U' or 'u' Only the upper triangular part of A + is to be referenced. + + UPLO = 'L' or 'l' Only the lower triangular part of A + is to be referenced. + + Unchanged on exit. + + N - INTEGER. + On entry, N specifies the order of the matrix A. + N must be at least zero. + Unchanged on exit. + + ALPHA - COMPLEX*16 . + On entry, ALPHA specifies the scalar alpha. + Unchanged on exit. + + X - COMPLEX*16 array of dimension at least + ( 1 + ( n - 1 )*abs( INCX ) ). + Before entry, the incremented array X must contain the n + element vector x. + Unchanged on exit. + + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. + + Y - COMPLEX*16 array of dimension at least + ( 1 + ( n - 1 )*abs( INCY ) ). + Before entry, the incremented array Y must contain the n + element vector y. + Unchanged on exit. + + INCY - INTEGER. + On entry, INCY specifies the increment for the elements of + Y. INCY must not be zero. + Unchanged on exit. + + A - COMPLEX*16 array of DIMENSION ( LDA, n ). + Before entry with UPLO = 'U' or 'u', the leading n by n + upper triangular part of the array A must contain the upper + + triangular part of the hermitian matrix and the strictly + lower triangular part of A is not referenced. On exit, the + upper triangular part of the array A is overwritten by the + upper triangular part of the updated matrix. + Before entry with UPLO = 'L' or 'l', the leading n by n + lower triangular part of the array A must contain the lower + + triangular part of the hermitian matrix and the strictly + upper triangular part of A is not referenced. On exit, the + lower triangular part of the array A is overwritten by the + lower triangular part of the updated matrix. + Note that the imaginary parts of the diagonal elements need + + not be set, they are assumed to be zero, and on exit they + are set to zero. + + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared + + in the calling (sub) program. LDA must be at least + max( 1, n ). + Unchanged on exit. + + + Level 2 Blas routine. + + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. + + + + Test the input parameters. + + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] #define Y(I) y[(I)-1] @@ -157,8 +157,8 @@ return 0; } -/* Set up the start points in X and Y if the increments are not both - +/* Set up the start points in X and Y if the increments are not both + unity. */ if (*incx != 1 || *incy != 1) { @@ -176,8 +176,8 @@ jy = ky; } -/* Start the operations. In this version the elements of A are - accessed sequentially with one pass through the triangular part +/* Start the operations. In this version the elements of A are + accessed sequentially with one pass through the triangular part of A. */ if (strncmp(uplo, "U", 1)==0) { @@ -189,14 +189,14 @@ for (j = 1; j <= *n; ++j) { i__2 = j; i__3 = j; - if (X(j).r != 0. || X(j).i != 0. || (Y(j).r != 0. || + if (X(j).r != 0. || X(j).i != 0. || (Y(j).r != 0. || Y(j).i != 0.)) { d_cnjg(&z__2, &Y(j)); - z__1.r = alpha->r * z__2.r - alpha->i * z__2.i, z__1.i = + z__1.r = alpha->r * z__2.r - alpha->i * z__2.i, z__1.i = alpha->r * z__2.i + alpha->i * z__2.r; temp1.r = z__1.r, temp1.i = z__1.i; i__2 = j; - z__2.r = alpha->r * X(j).r - alpha->i * X(j).i, + z__2.r = alpha->r * X(j).r - alpha->i * X(j).i, z__2.i = alpha->r * X(j).i + alpha->i * X(j) .r; d_cnjg(&z__1, &z__2); @@ -206,14 +206,14 @@ i__3 = i + j * a_dim1; i__4 = i + j * a_dim1; i__5 = i; - z__3.r = X(i).r * temp1.r - X(i).i * temp1.i, - z__3.i = X(i).r * temp1.i + X(i).i * + z__3.r = X(i).r * temp1.r - X(i).i * temp1.i, + z__3.i = X(i).r * temp1.i + X(i).i * temp1.r; - z__2.r = A(i,j).r + z__3.r, z__2.i = A(i,j).i + + z__2.r = A(i,j).r + z__3.r, z__2.i = A(i,j).i + z__3.i; i__6 = i; - z__4.r = Y(i).r * temp2.r - Y(i).i * temp2.i, - z__4.i = Y(i).r * temp2.i + Y(i).i * + z__4.r = Y(i).r * temp2.r - Y(i).i * temp2.i, + z__4.i = Y(i).r * temp2.i + Y(i).i * temp2.r; z__1.r = z__2.r + z__4.r, z__1.i = z__2.i + z__4.i; A(i,j).r = z__1.r, A(i,j).i = z__1.i; @@ -222,12 +222,12 @@ i__2 = j + j * a_dim1; i__3 = j + j * a_dim1; i__4 = j; - z__2.r = X(j).r * temp1.r - X(j).i * temp1.i, - z__2.i = X(j).r * temp1.i + X(j).i * + z__2.r = X(j).r * temp1.r - X(j).i * temp1.i, + z__2.i = X(j).r * temp1.i + X(j).i * temp1.r; i__5 = j; - z__3.r = Y(j).r * temp2.r - Y(j).i * temp2.i, - z__3.i = Y(j).r * temp2.i + Y(j).i * + z__3.r = Y(j).r * temp2.r - Y(j).i * temp2.i, + z__3.i = Y(j).r * temp2.i + Y(j).i * temp2.r; z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i; d__1 = A(j,j).r + z__1.r; @@ -245,14 +245,14 @@ for (j = 1; j <= *n; ++j) { i__2 = jx; i__3 = jy; - if (X(jx).r != 0. || X(jx).i != 0. || (Y(jy).r != 0. || + if (X(jx).r != 0. || X(jx).i != 0. || (Y(jy).r != 0. || Y(jy).i != 0.)) { d_cnjg(&z__2, &Y(jy)); - z__1.r = alpha->r * z__2.r - alpha->i * z__2.i, z__1.i = + z__1.r = alpha->r * z__2.r - alpha->i * z__2.i, z__1.i = alpha->r * z__2.i + alpha->i * z__2.r; temp1.r = z__1.r, temp1.i = z__1.i; i__2 = jx; - z__2.r = alpha->r * X(jx).r - alpha->i * X(jx).i, + z__2.r = alpha->r * X(jx).r - alpha->i * X(jx).i, z__2.i = alpha->r * X(jx).i + alpha->i * X(jx) .r; d_cnjg(&z__1, &z__2); @@ -264,14 +264,14 @@ i__3 = i + j * a_dim1; i__4 = i + j * a_dim1; i__5 = ix; - z__3.r = X(ix).r * temp1.r - X(ix).i * temp1.i, - z__3.i = X(ix).r * temp1.i + X(ix).i * + z__3.r = X(ix).r * temp1.r - X(ix).i * temp1.i, + z__3.i = X(ix).r * temp1.i + X(ix).i * temp1.r; - z__2.r = A(i,j).r + z__3.r, z__2.i = A(i,j).i + + z__2.r = A(i,j).r + z__3.r, z__2.i = A(i,j).i + z__3.i; i__6 = iy; - z__4.r = Y(iy).r * temp2.r - Y(iy).i * temp2.i, - z__4.i = Y(iy).r * temp2.i + Y(iy).i * + z__4.r = Y(iy).r * temp2.r - Y(iy).i * temp2.i, + z__4.i = Y(iy).r * temp2.i + Y(iy).i * temp2.r; z__1.r = z__2.r + z__4.r, z__1.i = z__2.i + z__4.i; A(i,j).r = z__1.r, A(i,j).i = z__1.i; @@ -282,12 +282,12 @@ i__2 = j + j * a_dim1; i__3 = j + j * a_dim1; i__4 = jx; - z__2.r = X(jx).r * temp1.r - X(jx).i * temp1.i, - z__2.i = X(jx).r * temp1.i + X(jx).i * + z__2.r = X(jx).r * temp1.r - X(jx).i * temp1.i, + z__2.i = X(jx).r * temp1.i + X(jx).i * temp1.r; i__5 = jy; - z__3.r = Y(jy).r * temp2.r - Y(jy).i * temp2.i, - z__3.i = Y(jy).r * temp2.i + Y(jy).i * + z__3.r = Y(jy).r * temp2.r - Y(jy).i * temp2.i, + z__3.i = Y(jy).r * temp2.i + Y(jy).i * temp2.r; z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i; d__1 = A(j,j).r + z__1.r; @@ -312,14 +312,14 @@ for (j = 1; j <= *n; ++j) { i__2 = j; i__3 = j; - if (X(j).r != 0. || X(j).i != 0. || (Y(j).r != 0. || + if (X(j).r != 0. || X(j).i != 0. || (Y(j).r != 0. || Y(j).i != 0.)) { d_cnjg(&z__2, &Y(j)); - z__1.r = alpha->r * z__2.r - alpha->i * z__2.i, z__1.i = + z__1.r = alpha->r * z__2.r - alpha->i * z__2.i, z__1.i = alpha->r * z__2.i + alpha->i * z__2.r; temp1.r = z__1.r, temp1.i = z__1.i; i__2 = j; - z__2.r = alpha->r * X(j).r - alpha->i * X(j).i, + z__2.r = alpha->r * X(j).r - alpha->i * X(j).i, z__2.i = alpha->r * X(j).i + alpha->i * X(j) .r; d_cnjg(&z__1, &z__2); @@ -327,12 +327,12 @@ i__2 = j + j * a_dim1; i__3 = j + j * a_dim1; i__4 = j; - z__2.r = X(j).r * temp1.r - X(j).i * temp1.i, - z__2.i = X(j).r * temp1.i + X(j).i * + z__2.r = X(j).r * temp1.r - X(j).i * temp1.i, + z__2.i = X(j).r * temp1.i + X(j).i * temp1.r; i__5 = j; - z__3.r = Y(j).r * temp2.r - Y(j).i * temp2.i, - z__3.i = Y(j).r * temp2.i + Y(j).i * + z__3.r = Y(j).r * temp2.r - Y(j).i * temp2.i, + z__3.i = Y(j).r * temp2.i + Y(j).i * temp2.r; z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i; d__1 = A(j,j).r + z__1.r; @@ -342,14 +342,14 @@ i__3 = i + j * a_dim1; i__4 = i + j * a_dim1; i__5 = i; - z__3.r = X(i).r * temp1.r - X(i).i * temp1.i, - z__3.i = X(i).r * temp1.i + X(i).i * + z__3.r = X(i).r * temp1.r - X(i).i * temp1.i, + z__3.i = X(i).r * temp1.i + X(i).i * temp1.r; - z__2.r = A(i,j).r + z__3.r, z__2.i = A(i,j).i + + z__2.r = A(i,j).r + z__3.r, z__2.i = A(i,j).i + z__3.i; i__6 = i; - z__4.r = Y(i).r * temp2.r - Y(i).i * temp2.i, - z__4.i = Y(i).r * temp2.i + Y(i).i * + z__4.r = Y(i).r * temp2.r - Y(i).i * temp2.i, + z__4.i = Y(i).r * temp2.i + Y(i).i * temp2.r; z__1.r = z__2.r + z__4.r, z__1.i = z__2.i + z__4.i; A(i,j).r = z__1.r, A(i,j).i = z__1.i; @@ -368,14 +368,14 @@ for (j = 1; j <= *n; ++j) { i__2 = jx; i__3 = jy; - if (X(jx).r != 0. || X(jx).i != 0. || (Y(jy).r != 0. || + if (X(jx).r != 0. || X(jx).i != 0. || (Y(jy).r != 0. || Y(jy).i != 0.)) { d_cnjg(&z__2, &Y(jy)); - z__1.r = alpha->r * z__2.r - alpha->i * z__2.i, z__1.i = + z__1.r = alpha->r * z__2.r - alpha->i * z__2.i, z__1.i = alpha->r * z__2.i + alpha->i * z__2.r; temp1.r = z__1.r, temp1.i = z__1.i; i__2 = jx; - z__2.r = alpha->r * X(jx).r - alpha->i * X(jx).i, + z__2.r = alpha->r * X(jx).r - alpha->i * X(jx).i, z__2.i = alpha->r * X(jx).i + alpha->i * X(jx) .r; d_cnjg(&z__1, &z__2); @@ -383,12 +383,12 @@ i__2 = j + j * a_dim1; i__3 = j + j * a_dim1; i__4 = jx; - z__2.r = X(jx).r * temp1.r - X(jx).i * temp1.i, - z__2.i = X(jx).r * temp1.i + X(jx).i * + z__2.r = X(jx).r * temp1.r - X(jx).i * temp1.i, + z__2.i = X(jx).r * temp1.i + X(jx).i * temp1.r; i__5 = jy; - z__3.r = Y(jy).r * temp2.r - Y(jy).i * temp2.i, - z__3.i = Y(jy).r * temp2.i + Y(jy).i * + z__3.r = Y(jy).r * temp2.r - Y(jy).i * temp2.i, + z__3.i = Y(jy).r * temp2.i + Y(jy).i * temp2.r; z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i; d__1 = A(j,j).r + z__1.r; @@ -402,14 +402,14 @@ i__3 = i + j * a_dim1; i__4 = i + j * a_dim1; i__5 = ix; - z__3.r = X(ix).r * temp1.r - X(ix).i * temp1.i, - z__3.i = X(ix).r * temp1.i + X(ix).i * + z__3.r = X(ix).r * temp1.r - X(ix).i * temp1.i, + z__3.i = X(ix).r * temp1.i + X(ix).i * temp1.r; - z__2.r = A(i,j).r + z__3.r, z__2.i = A(i,j).i + + z__2.r = A(i,j).r + z__3.r, z__2.i = A(i,j).i + z__3.i; i__6 = iy; - z__4.r = Y(iy).r * temp2.r - Y(iy).i * temp2.i, - z__4.i = Y(iy).r * temp2.i + Y(iy).i * + z__4.r = Y(iy).r * temp2.r - Y(iy).i * temp2.i, + z__4.i = Y(iy).r * temp2.i + Y(iy).i * temp2.r; z__1.r = z__2.r + z__4.r, z__1.i = z__2.i + z__4.i; A(i,j).r = z__1.r, A(i,j).i = z__1.i; diff --git a/CBLAS/zscal.c b/CBLAS/zscal.c index b3d88bb8..cb5213b9 100644 --- a/CBLAS/zscal.c +++ b/CBLAS/zscal.c @@ -6,7 +6,7 @@ #include "f2c.h" -/* Subroutine */ int zscal_(integer *n, doublecomplex *za, doublecomplex *zx, +/* Subroutine */ int zscal_(integer *n, doublecomplex *za, doublecomplex *zx, integer *incx) { @@ -19,14 +19,14 @@ static integer i, ix; -/* scales a vector by a constant. - jack dongarra, 3/11/78. - modified 3/93 to return if incx .le. 0. - modified 12/3/93, array(1) declarations changed to array(*) +/* scales a vector by a constant. + jack dongarra, 3/11/78. + modified 3/93 to return if incx .le. 0. + modified 12/3/93, array(1) declarations changed to array(*) - - Parameter adjustments + + Parameter adjustments Function Body */ #define ZX(I) zx[(I)-1] diff --git a/CBLAS/zswap.c b/CBLAS/zswap.c index ff17cd20..a01e0e89 100644 --- a/CBLAS/zswap.c +++ b/CBLAS/zswap.c @@ -1,7 +1,7 @@ #include "f2c.h" /*#include "blaswrap.h"*/ -/* Subroutine */ int zswap_(integer *n, doublecomplex *zx, integer *incx, +/* Subroutine */ int zswap_(integer *n, doublecomplex *zx, integer *incx, doublecomplex *zy, integer *incy) { /* System generated locals */ diff --git a/CBLAS/ztrsv.c b/CBLAS/ztrsv.c index e8f04f77..6700e803 100644 --- a/CBLAS/ztrsv.c +++ b/CBLAS/ztrsv.c @@ -6,7 +6,7 @@ #include #include "f2c.h" -/* Subroutine */ int ztrsv_(char *uplo, char *trans, char *diag, integer *n, +/* Subroutine */ int ztrsv_(char *uplo, char *trans, char *diag, integer *n, doublecomplex *a, integer *lda, doublecomplex *x, integer *incx) { @@ -27,112 +27,112 @@ extern int input_error(char *, int *); -/* Purpose - ======= +/* Purpose + ======= - ZTRSV solves one of the systems of equations + ZTRSV solves one of the systems of equations - A*x = b, or A'*x = b, or conjg( A' )*x = b, + A*x = b, or A'*x = b, or conjg( A' )*x = b, - where b and x are n element vectors and A is an n by n unit, or - non-unit, upper or lower triangular matrix. + where b and x are n element vectors and A is an n by n unit, or + non-unit, upper or lower triangular matrix. - No test for singularity or near-singularity is included in this - routine. Such tests must be performed before calling this routine. + No test for singularity or near-singularity is included in this + routine. Such tests must be performed before calling this routine. - Parameters - ========== + Parameters + ========== - UPLO - CHARACTER*1. - On entry, UPLO specifies whether the matrix is an upper or - lower triangular matrix as follows: + UPLO - CHARACTER*1. + On entry, UPLO specifies whether the matrix is an upper or + lower triangular matrix as follows: - UPLO = 'U' or 'u' A is an upper triangular matrix. + UPLO = 'U' or 'u' A is an upper triangular matrix. - UPLO = 'L' or 'l' A is a lower triangular matrix. + UPLO = 'L' or 'l' A is a lower triangular matrix. - Unchanged on exit. + Unchanged on exit. - TRANS - CHARACTER*1. - On entry, TRANS specifies the equations to be solved as - follows: + TRANS - CHARACTER*1. + On entry, TRANS specifies the equations to be solved as + follows: - TRANS = 'N' or 'n' A*x = b. + TRANS = 'N' or 'n' A*x = b. - TRANS = 'T' or 't' A'*x = b. + TRANS = 'T' or 't' A'*x = b. - TRANS = 'C' or 'c' conjg( A' )*x = b. + TRANS = 'C' or 'c' conjg( A' )*x = b. - Unchanged on exit. + Unchanged on exit. - DIAG - CHARACTER*1. - On entry, DIAG specifies whether or not A is unit - triangular as follows: + DIAG - CHARACTER*1. + On entry, DIAG specifies whether or not A is unit + triangular as follows: - DIAG = 'U' or 'u' A is assumed to be unit triangular. + DIAG = 'U' or 'u' A is assumed to be unit triangular. - DIAG = 'N' or 'n' A is not assumed to be unit - triangular. + DIAG = 'N' or 'n' A is not assumed to be unit + triangular. - Unchanged on exit. + Unchanged on exit. - N - INTEGER. - On entry, N specifies the order of the matrix A. - N must be at least zero. - Unchanged on exit. + N - INTEGER. + On entry, N specifies the order of the matrix A. + N must be at least zero. + Unchanged on exit. - A - COMPLEX*16 array of DIMENSION ( LDA, n ). - Before entry with UPLO = 'U' or 'u', the leading n by n - upper triangular part of the array A must contain the upper - - triangular matrix and the strictly lower triangular part of - - A is not referenced. - Before entry with UPLO = 'L' or 'l', the leading n by n - lower triangular part of the array A must contain the lower - - triangular matrix and the strictly upper triangular part of - - A is not referenced. - Note that when DIAG = 'U' or 'u', the diagonal elements of - - A are not referenced either, but are assumed to be unity. - Unchanged on exit. + A - COMPLEX*16 array of DIMENSION ( LDA, n ). + Before entry with UPLO = 'U' or 'u', the leading n by n + upper triangular part of the array A must contain the upper - LDA - INTEGER. - On entry, LDA specifies the first dimension of A as declared - - in the calling (sub) program. LDA must be at least - max( 1, n ). - Unchanged on exit. + triangular matrix and the strictly lower triangular part of - X - COMPLEX*16 array of dimension at least - ( 1 + ( n - 1 )*abs( INCX ) ). - Before entry, the incremented array X must contain the n - element right-hand side vector b. On exit, X is overwritten - - with the solution vector x. + A is not referenced. + Before entry with UPLO = 'L' or 'l', the leading n by n + lower triangular part of the array A must contain the lower - INCX - INTEGER. - On entry, INCX specifies the increment for the elements of - X. INCX must not be zero. - Unchanged on exit. + triangular matrix and the strictly upper triangular part of + A is not referenced. + Note that when DIAG = 'U' or 'u', the diagonal elements of - Level 2 Blas routine. + A are not referenced either, but are assumed to be unity. + Unchanged on exit. - -- Written on 22-October-1986. - Jack Dongarra, Argonne National Lab. - Jeremy Du Croz, Nag Central Office. - Sven Hammarling, Nag Central Office. - Richard Hanson, Sandia National Labs. + LDA - INTEGER. + On entry, LDA specifies the first dimension of A as declared + in the calling (sub) program. LDA must be at least + max( 1, n ). + Unchanged on exit. + X - COMPLEX*16 array of dimension at least + ( 1 + ( n - 1 )*abs( INCX ) ). + Before entry, the incremented array X must contain the n + element right-hand side vector b. On exit, X is overwritten - Test the input parameters. + with the solution vector x. - - Parameter adjustments + INCX - INTEGER. + On entry, INCX specifies the increment for the elements of + X. INCX must not be zero. + Unchanged on exit. + + + Level 2 Blas routine. + + -- Written on 22-October-1986. + Jack Dongarra, Argonne National Lab. + Jeremy Du Croz, Nag Central Office. + Sven Hammarling, Nag Central Office. + Richard Hanson, Sandia National Labs. + + + + Test the input parameters. + + + Parameter adjustments Function Body */ #define X(I) x[(I)-1] @@ -167,7 +167,7 @@ noconj = (strncmp(trans, "T", 1)==0); nounit = (strncmp(diag, "N", 1)==0); -/* Set up the start point in X if the increment is not unity. This +/* Set up the start point in X if the increment is not unity. This will be ( N - 1 )*INCX too small for descending loops. */ if (*incx <= 0) { @@ -176,7 +176,7 @@ kx = 1; } -/* Start the operations. In this version the elements of A are +/* Start the operations. In this version the elements of A are accessed sequentially with one pass through A. */ if (strncmp(trans, "N", 1)==0) { @@ -199,9 +199,9 @@ i__1 = i; i__2 = i; i__3 = i + j * a_dim1; - z__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, + z__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, z__2.i = temp.r * A(i,j).i + temp.i * A(i,j).r; - z__1.r = X(i).r - z__2.r, z__1.i = X(i).i - + z__1.r = X(i).r - z__2.r, z__1.i = X(i).i - z__2.i; X(i).r = z__1.r, X(i).i = z__1.i; /* L10: */ @@ -227,9 +227,9 @@ i__1 = ix; i__2 = ix; i__3 = i + j * a_dim1; - z__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, + z__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, z__2.i = temp.r * A(i,j).i + temp.i * A(i,j).r; - z__1.r = X(ix).r - z__2.r, z__1.i = X(ix).i - + z__1.r = X(ix).r - z__2.r, z__1.i = X(ix).i - z__2.i; X(ix).r = z__1.r, X(ix).i = z__1.i; /* L30: */ @@ -257,9 +257,9 @@ i__3 = i; i__4 = i; i__5 = i + j * a_dim1; - z__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, + z__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, z__2.i = temp.r * A(i,j).i + temp.i * A(i,j).r; - z__1.r = X(i).r - z__2.r, z__1.i = X(i).i - + z__1.r = X(i).r - z__2.r, z__1.i = X(i).i - z__2.i; X(i).r = z__1.r, X(i).i = z__1.i; /* L50: */ @@ -287,9 +287,9 @@ i__3 = ix; i__4 = ix; i__5 = i + j * a_dim1; - z__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, + z__2.r = temp.r * A(i,j).r - temp.i * A(i,j).i, z__2.i = temp.r * A(i,j).i + temp.i * A(i,j).r; - z__1.r = X(ix).r - z__2.r, z__1.i = X(ix).i - + z__1.r = X(ix).r - z__2.r, z__1.i = X(ix).i - z__2.i; X(ix).r = z__1.r, X(ix).i = z__1.i; /* L70: */ @@ -316,9 +316,9 @@ i__3 = i + j * a_dim1; i__4 = i; z__2.r = A(i,j).r * X(i).r - A(i,j).i * X( - i).i, z__2.i = A(i,j).r * X(i).i + + i).i, z__2.i = A(i,j).r * X(i).i + A(i,j).i * X(i).r; - z__1.r = temp.r - z__2.r, z__1.i = temp.i - + z__1.r = temp.r - z__2.r, z__1.i = temp.i - z__2.i; temp.r = z__1.r, temp.i = z__1.i; /* L90: */ @@ -332,10 +332,10 @@ for (i = 1; i <= j-1; ++i) { d_cnjg(&z__3, &A(i,j)); i__3 = i; - z__2.r = z__3.r * X(i).r - z__3.i * X(i).i, + z__2.r = z__3.r * X(i).r - z__3.i * X(i).i, z__2.i = z__3.r * X(i).i + z__3.i * X( i).r; - z__1.r = temp.r - z__2.r, z__1.i = temp.i - + z__1.r = temp.r - z__2.r, z__1.i = temp.i - z__2.i; temp.r = z__1.r, temp.i = z__1.i; /* L100: */ @@ -363,9 +363,9 @@ i__3 = i + j * a_dim1; i__4 = ix; z__2.r = A(i,j).r * X(ix).r - A(i,j).i * X( - ix).i, z__2.i = A(i,j).r * X(ix).i + + ix).i, z__2.i = A(i,j).r * X(ix).i + A(i,j).i * X(ix).r; - z__1.r = temp.r - z__2.r, z__1.i = temp.i - + z__1.r = temp.r - z__2.r, z__1.i = temp.i - z__2.i; temp.r = z__1.r, temp.i = z__1.i; ix += *incx; @@ -380,10 +380,10 @@ for (i = 1; i <= j-1; ++i) { d_cnjg(&z__3, &A(i,j)); i__3 = ix; - z__2.r = z__3.r * X(ix).r - z__3.i * X(ix).i, + z__2.r = z__3.r * X(ix).r - z__3.i * X(ix).i, z__2.i = z__3.r * X(ix).i + z__3.i * X( ix).r; - z__1.r = temp.r - z__2.r, z__1.i = temp.i - + z__1.r = temp.r - z__2.r, z__1.i = temp.i - z__2.i; temp.r = z__1.r, temp.i = z__1.i; ix += *incx; @@ -412,9 +412,9 @@ i__2 = i + j * a_dim1; i__3 = i; z__2.r = A(i,j).r * X(i).r - A(i,j).i * X( - i).i, z__2.i = A(i,j).r * X(i).i + + i).i, z__2.i = A(i,j).r * X(i).i + A(i,j).i * X(i).r; - z__1.r = temp.r - z__2.r, z__1.i = temp.i - + z__1.r = temp.r - z__2.r, z__1.i = temp.i - z__2.i; temp.r = z__1.r, temp.i = z__1.i; /* L150: */ @@ -428,10 +428,10 @@ for (i = *n; i >= j+1; --i) { d_cnjg(&z__3, &A(i,j)); i__2 = i; - z__2.r = z__3.r * X(i).r - z__3.i * X(i).i, + z__2.r = z__3.r * X(i).r - z__3.i * X(i).i, z__2.i = z__3.r * X(i).i + z__3.i * X( i).r; - z__1.r = temp.r - z__2.r, z__1.i = temp.i - + z__1.r = temp.r - z__2.r, z__1.i = temp.i - z__2.i; temp.r = z__1.r, temp.i = z__1.i; /* L160: */ @@ -459,9 +459,9 @@ i__2 = i + j * a_dim1; i__3 = ix; z__2.r = A(i,j).r * X(ix).r - A(i,j).i * X( - ix).i, z__2.i = A(i,j).r * X(ix).i + + ix).i, z__2.i = A(i,j).r * X(ix).i + A(i,j).i * X(ix).r; - z__1.r = temp.r - z__2.r, z__1.i = temp.i - + z__1.r = temp.r - z__2.r, z__1.i = temp.i - z__2.i; temp.r = z__1.r, temp.i = z__1.i; ix -= *incx; @@ -476,10 +476,10 @@ for (i = *n; i >= j+1; --i) { d_cnjg(&z__3, &A(i,j)); i__2 = ix; - z__2.r = z__3.r * X(ix).r - z__3.i * X(ix).i, + z__2.r = z__3.r * X(ix).r - z__3.i * X(ix).i, z__2.i = z__3.r * X(ix).i + z__3.i * X( ix).r; - z__1.r = temp.r - z__2.r, z__1.i = temp.i - + z__1.r = temp.r - z__2.r, z__1.i = temp.i - z__2.i; temp.r = z__1.r, temp.i = z__1.i; ix -= *incx; diff --git a/CMakeLists.txt b/CMakeLists.txt index 62ead131..3eb57deb 100644 --- a/CMakeLists.txt +++ b/CMakeLists.txt @@ -7,7 +7,7 @@ # Required version cmake_minimum_required(VERSION 2.8.12) -# Project Version +# Project Version project(SuperLU NONE) set(VERSION_MAJOR "5") set(VERSION_MINOR "2") @@ -39,7 +39,7 @@ SET(CMAKE_SKIP_BUILD_RPATH FALSE) # when building, don't use the install RPATH already # (but later on when installing) -SET(CMAKE_BUILD_WITH_INSTALL_RPATH FALSE) +SET(CMAKE_BUILD_WITH_INSTALL_RPATH FALSE) # the RPATH to be used when installing set(CMAKE_INSTALL_RPATH "${CMAKE_INSTALL_PREFIX}/lib") @@ -49,15 +49,28 @@ set(CMAKE_INSTALL_RPATH "${CMAKE_INSTALL_PREFIX}/lib") SET(CMAKE_INSTALL_RPATH_USE_LINK_PATH TRUE) #---- +enable_language(C) +message("CMAKE_SHARED_LIBRARY_PREFIX - ${CMAKE_SHARED_LIBRARY_PREFIX}") +message("CMAKE_SHARED_LIBRARY_SUFFIX - ${CMAKE_SHARED_LIBRARY_SUFFIX}") +message("CMAKE_IMPORT_LIBRARY_PREFIX - ${CMAKE_IMPORT_LIBRARY_PREFIX}") +message("CMAKE_IMPORT_LIBRARY_SUFFIX - ${CMAKE_IMPORT_LIBRARY_SUFFIX}") +message("CMAKE_STATIC_LIBRARY_PREFIX - ${CMAKE_STATIC_LIBRARY_PREFIX}") +message("CMAKE_STATIC_LIBRARY_SUFFIX - ${CMAKE_STATIC_LIBRARY_SUFFIX}") + if (BUILD_SHARED_LIBS) message("-- SuperLU will be built as a shared library.") - set(PROJECT_NAME_LIB_EXPORT libsuperlu.so) + if (WIN32 OR CYGWIN OR MSYS) + # In Windows, you link to an associated import library, not directly to the shared library runtime (.dll) + set(PROJECT_NAME_LIB_EXPORT ${CMAKE_IMPORT_LIBRARY_PREFIX}superlu${CMAKE_IMPORT_LIBRARY_SUFFIX}) + else() + set(PROJECT_NAME_LIB_EXPORT ${CMAKE_SHARED_LIBRARY_PREFIX}superlu${CMAKE_SHARED_LIBRARY_SUFFIX}) + endif() else() message("-- SuperLU will be built as a static library.") - set(PROJECT_NAME_LIB_EXPORT libsuperlu.a) + set(PROJECT_NAME_LIB_EXPORT ${CMAKE_STATIC_LIBRARY_PREFIX}superlu${CMAKE_STATIC_LIBRARY_SUFFIX}) endif() -enable_language(C) + if (XSDK_ENABLE_Fortran) enable_language (Fortran) set(NOFORTRAN FALSE) @@ -77,15 +90,17 @@ if (NOT CMAKE_INSTALL_PREFIX) endif() # setup options -option(enable_blaslib "Build the CBLAS library" ${enable_blaslib_DEFAULT}) +option(enable_blaslib "Build the CBLAS library (requires f2c)" ${enable_blaslib_DEFAULT}) option(enable_matlabmex "Build the Matlab mex library" OFF) option(enable_tests "Build tests" ON) option(enable_doc "Build doxygen documentation" OFF) +option(enable_doc_html "Build HTML documentation" OFF) +option(enable_doc_man "Build Unix man pages" OFF) option(enable_single "Enable single precision library" ON) option(enable_double "Enable double precision library" ON) option(enable_complex "Enable complex precision library" ON) option(enable_complex16 "Enable complex16 precision library" ON) -# option(enable_examples "Build examples" ON) +option(enable_examples "Build examples" ON) # setup required compiler defines and options. ## add_definitions(-DPRNTlevel=0 -DAdd_) @@ -124,12 +139,26 @@ else() add_subdirectory(CBLAS) set(BLAS_LIB blas) if (BUILD_SHARED_LIBS) # export to be referenced by downstream makefile - set(BLAS_LIB_EXPORT ${CMAKE_INSTALL_PREFIX}/CBLAS/libblas.so) - else() - set(BLAS_LIB_EXPORT ${CMAKE_INSTALL_PREFIX}/CBLAS/libblas.a) + #This must always be a static library. + set(BLAS_LIB_EXPORT ${CMAKE_INSTALL_PREFIX}/CBLAS/${CMAKE_STATIC_LIBRARY_PREFIX}blas${CMAKE_STATIC_LIBRARY_SUFFIX}) endif() endif() +###################################################################### +# +# TMGLIB_EXPORT value +# +###################################################################### + if (BUILD_SHARED_LIBS) # export to be referenced by downstream makefile + if (WIN32 OR CYGWIN OR MSYS) + # In Windows, you link to an associated import library, not directly to the shared library runtime (.dll) + set(TMGLIB_EXPORT ${CMAKE_IMPORT_LIBRARY_PREFIX}tmglib${CMAKE_IMPORT_LIBRARY_SUFFIX}) + else() + set(TMGLIB_EXPORT ${CMAKE_SHARED_LIBRARY_PREFIX}tmglib${CMAKE_SHARED_LIBRARY_SUFFIX}) + endif() + else() + set(TMGLIB_EXPORT ${CMAKE_STATIC_LIBRARY_PREFIX}tmglib${CMAKE_STATIC_LIBRARY_SUFFIX}) + endif() ###################################################################### # @@ -138,6 +167,7 @@ endif() ###################################################################### include_directories(${CMAKE_SOURCE_DIR}/SRC) +include_directories(${CMAKE_SOURCE_DIR}/FORTRAN) ###################################################################### # @@ -146,6 +176,8 @@ include_directories(${CMAKE_SOURCE_DIR}/SRC) ###################################################################### add_subdirectory(SRC) +add_subdirectory(EXAMPLE) +add_subdirectory(FORTRAN) if(enable_matlabmex) add_subdirectory(MATLAB) @@ -157,15 +189,82 @@ if(enable_tests) endif() if(enable_doc) - message(FATAL_ERROR "Documentation build requested but not implemented.") +# message(FATAL_ERROR "Documentation build requested but not implemented.") #implement doxygen + +# check if Doxygen is installed + find_package(Doxygen) + if (DOXYGEN_FOUND) + include(GNUInstallDirs) + message(STATUS "doxygen ${DOXYGEN_EXECUTABLE}") + message(STATUS "doxygen version ${DOXYGEN_VERSION}") + #based from: https://vicrucann.github.io/tutorials/quick-cmake-doxygen/ + # set input and output files + set(DOXYGEN_IN ${CMAKE_CURRENT_SOURCE_DIR}/Doxyfile.in) + if(DOXYGEN_DOT_FOUND) + set(HAVE_DOT "YES") + set(DOT_EXECUTABLE ${DOXYGEN_DOT_EXECUTABLE}) + message(STATUS "Graphviz (dot) ${DOXYGEN_DOT_EXECUTABLE}") + else() + set(HAVE_DOT "NO") + unset(DOT_EXECUTABLE) + message(STATUS "Graphviz (dot) Not Found") + endif(DOXYGEN_DOT_FOUND) + set(DOXYGEN_OUT ${CMAKE_CURRENT_BINARY_DIR}/Doxyfile) + + # Optional - use mscgen + find_program(MSCGEN mscgen) + if(MSCGEN) + message(STATUS "mscgen ${MSCGEN}") + # Doxygen will use this dir to find mscgen + get_filename_component(MSCGEN_PATH ${MSCGEN} DIRECTORY) + else() + message(STATUS "mscgen Not Found") + unset(MSCGEN_PATH) + endif(MSCGEN) + # Optional - use dia + find_program(DIA dia) + if(DIA) + message(STATUS "dia ${DIA}") + # Doxygen will use this dir to find mscgen + get_filename_component(DIA_PATH ${DIA} DIRECTORY) + else() + message(STATUS "dia Not Found") + unset(DIA_PATH) + endif(DIA) + # note the option ALL which allows to build the docs together with the application + # We want to set up the docs in HTML format and the option for it in these conditionals + if(enable_doc_html) + set(d_enable_doc_html "YES") + install(DIRECTORY ${CMAKE_CURRENT_BINARY_DIR}/doc_doxygen/html DESTINATION ${CMAKE_INSTALL_DOCDIR}) + else() + set(d_enable_doc_html "NO") + endif(enable_doc_html) + if(enable_doc_man) + set(d_enable_doc_man "YES") + install(DIRECTORY ${CMAKE_CURRENT_BINARY_DIR}/doc_doxygen/man/ DESTINATION ${CMAKE_INSTALL_MANDIR}) + else() + set(d_enable_doc_man "NO") + endif(enable_doc_man) + # request to configure the file + configure_file(${DOXYGEN_IN} ${DOXYGEN_OUT} @ONLY) + add_custom_target( doc_doxygen ALL + COMMAND ${DOXYGEN_EXECUTABLE} ${DOXYGEN_OUT} + WORKING_DIRECTORY ${CMAKE_CURRENT_BINARY_DIR} + COMMENT "Generating API documentation with Doxygen" + VERBATIM ) + else (DOXYGEN_FOUND) + message("Doxygen need to be installed to generate the doxygen documentation") + endif (DOXYGEN_FOUND) endif() # file(WRITE "make.defs" "# can be exposed to users" # ${CMAKE_C_COMPILER} ) # configure_file(${CMAKE_SOURCE_DIR}/make.inc.in ${CMAKE_SOURCE_DIR}/make.inc) configure_file(${SuperLU_SOURCE_DIR}/make.inc.in ${SuperLU_SOURCE_DIR}/make.inc) - +# This is just here in case people compile the same code for different sitatuions. +file(COPY ${SuperLU_SOURCE_DIR}/make.inc DESTINATION ${CMAKE_CURRENT_BINARY_DIR}) + configure_file(${CMAKE_CURRENT_SOURCE_DIR}/superlu.pc.in ${CMAKE_CURRENT_BINARY_DIR}/superlu.pc @ONLY) install(FILES ${CMAKE_CURRENT_BINARY_DIR}/superlu.pc DESTINATION ${CMAKE_INSTALL_LIBDIR}/pkgconfig) diff --git a/Doxyfile.in b/Doxyfile.in new file mode 100644 index 00000000..f32682ee --- /dev/null +++ b/Doxyfile.in @@ -0,0 +1,2486 @@ +# Doxyfile 1.8.14 + +# This file describes the settings to be used by the documentation system +# doxygen (www.doxygen.org) for a project. +# +# All text after a double hash (##) is considered a comment and is placed in +# front of the TAG it is preceding. +# +# All text after a single hash (#) is considered a comment and will be ignored. +# The format is: +# TAG = value [value, ...] +# For lists, items can also be appended using: +# TAG += value [value, ...] +# Values that contain spaces should be placed between quotes (\" \"). + +#--------------------------------------------------------------------------- +# Project related configuration options +#--------------------------------------------------------------------------- + +# This tag specifies the encoding used for all characters in the config file +# that follow. The default is UTF-8 which is also the encoding used for all text +# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv +# built into libc) for the transcoding. See +# https://www.gnu.org/software/libiconv/ for the list of possible encodings. +# The default value is: UTF-8. + +DOXYFILE_ENCODING = UTF-8 + +# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by +# double-quotes, unless you are using Doxywizard) that should identify the +# project for which the documentation is generated. This name is used in the +# title of most generated pages and in a few other places. +# The default value is: My Project. + +PROJECT_NAME = "@PROJECT_NAME@" + +# The PROJECT_NUMBER tag can be used to enter a project or revision number. This +# could be handy for archiving the generated documentation or if some version +# control system is used. + +PROJECT_NUMBER = @PROJECT_VERSION@ + +# Using the PROJECT_BRIEF tag one can provide an optional one line description +# for a project that appears at the top of each page and should give viewer a +# quick idea about the purpose of the project. Keep the description short. + +PROJECT_BRIEF = @PROJECT_DESCRIPTION@ + +# With the PROJECT_LOGO tag one can specify a logo or an icon that is included +# in the documentation. The maximum height of the logo should not exceed 55 +# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy +# the logo to the output directory. + +PROJECT_LOGO = + +# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path +# into which the generated documentation will be written. If a relative path is +# entered, it will be relative to the location where doxygen was started. If +# left blank the current directory will be used. + +OUTPUT_DIRECTORY = @CMAKE_CURRENT_BINARY_DIR@/doc_doxygen/ + +# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub- +# directories (in 2 levels) under the output directory of each output format and +# will distribute the generated files over these directories. Enabling this +# option can be useful when feeding doxygen a huge amount of source files, where +# putting all generated files in the same directory would otherwise causes +# performance problems for the file system. +# The default value is: NO. + +CREATE_SUBDIRS = NO + +# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII +# characters to appear in the names of generated files. If set to NO, non-ASCII +# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode +# U+3044. +# The default value is: NO. + +ALLOW_UNICODE_NAMES = NO + +# The OUTPUT_LANGUAGE tag is used to specify the language in which all +# documentation generated by doxygen is written. Doxygen will use this +# information to generate all constant output in the proper language. +# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese, +# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States), +# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian, +# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages), +# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian, +# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian, +# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish, +# Ukrainian and Vietnamese. +# The default value is: English. + +OUTPUT_LANGUAGE = English + +# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member +# descriptions after the members that are listed in the file and class +# documentation (similar to Javadoc). Set to NO to disable this. +# The default value is: YES. + +BRIEF_MEMBER_DESC = YES + +# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief +# description of a member or function before the detailed description +# +# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the +# brief descriptions will be completely suppressed. +# The default value is: YES. + +REPEAT_BRIEF = YES + +# This tag implements a quasi-intelligent brief description abbreviator that is +# used to form the text in various listings. Each string in this list, if found +# as the leading text of the brief description, will be stripped from the text +# and the result, after processing the whole list, is used as the annotated +# text. Otherwise, the brief description is used as-is. If left blank, the +# following values are used ($name is automatically replaced with the name of +# the entity):The $name class, The $name widget, The $name file, is, provides, +# specifies, contains, represents, a, an and the. + +ABBREVIATE_BRIEF = "The $name class" \ + "The $name widget" \ + "The $name file" \ + is \ + provides \ + specifies \ + contains \ + represents \ + a \ + an \ + the + +# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then +# doxygen will generate a detailed section even if there is only a brief +# description. +# The default value is: NO. + +ALWAYS_DETAILED_SEC = NO + +# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all +# inherited members of a class in the documentation of that class as if those +# members were ordinary class members. Constructors, destructors and assignment +# operators of the base classes will not be shown. +# The default value is: NO. + +INLINE_INHERITED_MEMB = NO + +# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path +# before files name in the file list and in the header files. If set to NO the +# shortest path that makes the file name unique will be used +# The default value is: YES. + +FULL_PATH_NAMES = YES + +# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path. +# Stripping is only done if one of the specified strings matches the left-hand +# part of the path. The tag can be used to show relative paths in the file list. +# If left blank the directory from which doxygen is run is used as the path to +# strip. +# +# Note that you can specify absolute paths here, but also relative paths, which +# will be relative from the directory where doxygen is started. +# This tag requires that the tag FULL_PATH_NAMES is set to YES. + +STRIP_FROM_PATH = "@CMAKE_CURRENT_SOURCE_DIR@/" \ + "@CMake_BINARY_DIR@/" \ + "@CMAKE_CURRENT_BINARY_DIR@/doc_doxygen/" + +# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the +# path mentioned in the documentation of a class, which tells the reader which +# header file to include in order to use a class. If left blank only the name of +# the header file containing the class definition is used. Otherwise one should +# specify the list of include paths that are normally passed to the compiler +# using the -I flag. + +STRIP_FROM_INC_PATH = + +# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but +# less readable) file names. This can be useful is your file systems doesn't +# support long names like on DOS, Mac, or CD-ROM. +# The default value is: NO. + +SHORT_NAMES = NO + +# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the +# first line (until the first dot) of a Javadoc-style comment as the brief +# description. If set to NO, the Javadoc-style will behave just like regular Qt- +# style comments (thus requiring an explicit @brief command for a brief +# description.) +# The default value is: NO. + +JAVADOC_AUTOBRIEF = NO + +# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first +# line (until the first dot) of a Qt-style comment as the brief description. If +# set to NO, the Qt-style will behave just like regular Qt-style comments (thus +# requiring an explicit \brief command for a brief description.) +# The default value is: NO. + +QT_AUTOBRIEF = NO + +# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a +# multi-line C++ special comment block (i.e. a block of //! or /// comments) as +# a brief description. This used to be the default behavior. The new default is +# to treat a multi-line C++ comment block as a detailed description. Set this +# tag to YES if you prefer the old behavior instead. +# +# Note that setting this tag to YES also means that rational rose comments are +# not recognized any more. +# The default value is: NO. + +MULTILINE_CPP_IS_BRIEF = NO + +# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the +# documentation from any documented member that it re-implements. +# The default value is: YES. + +INHERIT_DOCS = YES + +# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new +# page for each member. If set to NO, the documentation of a member will be part +# of the file/class/namespace that contains it. +# The default value is: NO. + +SEPARATE_MEMBER_PAGES = NO + +# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen +# uses this value to replace tabs by spaces in code fragments. +# Minimum value: 1, maximum value: 16, default value: 4. + +TAB_SIZE = 4 + +# This tag can be used to specify a number of aliases that act as commands in +# the documentation. An alias has the form: +# name=value +# For example adding +# "sideeffect=@par Side Effects:\n" +# will allow you to put the command \sideeffect (or @sideeffect) in the +# documentation, which will result in a user-defined paragraph with heading +# "Side Effects:". You can put \n's in the value part of an alias to insert +# newlines (in the resulting output). You can put ^^ in the value part of an +# alias to insert a newline as if a physical newline was in the original file. + +ALIASES = + +# This tag can be used to specify a number of word-keyword mappings (TCL only). +# A mapping has the form "name=value". For example adding "class=itcl::class" +# will allow you to use the command class in the itcl::class meaning. + +TCL_SUBST = + +# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources +# only. Doxygen will then generate output that is more tailored for C. For +# instance, some of the names that are used will be different. The list of all +# members will be omitted, etc. +# The default value is: NO. + +OPTIMIZE_OUTPUT_FOR_C = NO + +# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or +# Python sources only. Doxygen will then generate output that is more tailored +# for that language. For instance, namespaces will be presented as packages, +# qualified scopes will look different, etc. +# The default value is: NO. + +OPTIMIZE_OUTPUT_JAVA = NO + +# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran +# sources. Doxygen will then generate output that is tailored for Fortran. +# The default value is: NO. + +OPTIMIZE_FOR_FORTRAN = NO + +# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL +# sources. Doxygen will then generate output that is tailored for VHDL. +# The default value is: NO. + +OPTIMIZE_OUTPUT_VHDL = NO + +# Doxygen selects the parser to use depending on the extension of the files it +# parses. With this tag you can assign which parser to use for a given +# extension. Doxygen has a built-in mapping, but you can override or extend it +# using this tag. The format is ext=language, where ext is a file extension, and +# language is one of the parsers supported by doxygen: IDL, Java, Javascript, +# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran: +# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran: +# Fortran. In the later case the parser tries to guess whether the code is fixed +# or free formatted code, this is the default for Fortran type files), VHDL. For +# instance to make doxygen treat .inc files as Fortran files (default is PHP), +# and .f files as C (default is Fortran), use: inc=Fortran f=C. +# +# Note: For files without extension you can use no_extension as a placeholder. +# +# Note that for custom extensions you also need to set FILE_PATTERNS otherwise +# the files are not read by doxygen. + +EXTENSION_MAPPING = + +# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments +# according to the Markdown format, which allows for more readable +# documentation. See http://daringfireball.net/projects/markdown/ for details. +# The output of markdown processing is further processed by doxygen, so you can +# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in +# case of backward compatibilities issues. +# The default value is: YES. + +MARKDOWN_SUPPORT = YES + +# When the TOC_INCLUDE_HEADINGS tag is set to a non-zero value, all headings up +# to that level are automatically included in the table of contents, even if +# they do not have an id attribute. +# Note: This feature currently applies only to Markdown headings. +# Minimum value: 0, maximum value: 99, default value: 0. +# This tag requires that the tag MARKDOWN_SUPPORT is set to YES. + +TOC_INCLUDE_HEADINGS = 0 + +# When enabled doxygen tries to link words that correspond to documented +# classes, or namespaces to their corresponding documentation. Such a link can +# be prevented in individual cases by putting a % sign in front of the word or +# globally by setting AUTOLINK_SUPPORT to NO. +# The default value is: YES. + +AUTOLINK_SUPPORT = YES + +# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want +# to include (a tag file for) the STL sources as input, then you should set this +# tag to YES in order to let doxygen match functions declarations and +# definitions whose arguments contain STL classes (e.g. func(std::string); +# versus func(std::string) {}). This also make the inheritance and collaboration +# diagrams that involve STL classes more complete and accurate. +# The default value is: NO. + +BUILTIN_STL_SUPPORT = NO + +# If you use Microsoft's C++/CLI language, you should set this option to YES to +# enable parsing support. +# The default value is: NO. + +CPP_CLI_SUPPORT = NO + +# Set the SIP_SUPPORT tag to YES if your project consists of sip (see: +# https://www.riverbankcomputing.com/software/sip/intro) sources only. Doxygen +# will parse them like normal C++ but will assume all classes use public instead +# of private inheritance when no explicit protection keyword is present. +# The default value is: NO. + +SIP_SUPPORT = NO + +# For Microsoft's IDL there are propget and propput attributes to indicate +# getter and setter methods for a property. Setting this option to YES will make +# doxygen to replace the get and set methods by a property in the documentation. +# This will only work if the methods are indeed getting or setting a simple +# type. If this is not the case, or you want to show the methods anyway, you +# should set this option to NO. +# The default value is: YES. + +IDL_PROPERTY_SUPPORT = YES + +# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC +# tag is set to YES then doxygen will reuse the documentation of the first +# member in the group (if any) for the other members of the group. By default +# all members of a group must be documented explicitly. +# The default value is: NO. + +DISTRIBUTE_GROUP_DOC = NO + +# If one adds a struct or class to a group and this option is enabled, then also +# any nested class or struct is added to the same group. By default this option +# is disabled and one has to add nested compounds explicitly via \ingroup. +# The default value is: NO. + +GROUP_NESTED_COMPOUNDS = NO + +# Set the SUBGROUPING tag to YES to allow class member groups of the same type +# (for instance a group of public functions) to be put as a subgroup of that +# type (e.g. under the Public Functions section). Set it to NO to prevent +# subgrouping. Alternatively, this can be done per class using the +# \nosubgrouping command. +# The default value is: YES. + +SUBGROUPING = YES + +# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions +# are shown inside the group in which they are included (e.g. using \ingroup) +# instead of on a separate page (for HTML and Man pages) or section (for LaTeX +# and RTF). +# +# Note that this feature does not work in combination with +# SEPARATE_MEMBER_PAGES. +# The default value is: NO. + +INLINE_GROUPED_CLASSES = NO + +# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions +# with only public data fields or simple typedef fields will be shown inline in +# the documentation of the scope in which they are defined (i.e. file, +# namespace, or group documentation), provided this scope is documented. If set +# to NO, structs, classes, and unions are shown on a separate page (for HTML and +# Man pages) or section (for LaTeX and RTF). +# The default value is: NO. + +INLINE_SIMPLE_STRUCTS = NO + +# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or +# enum is documented as struct, union, or enum with the name of the typedef. So +# typedef struct TypeS {} TypeT, will appear in the documentation as a struct +# with name TypeT. When disabled the typedef will appear as a member of a file, +# namespace, or class. And the struct will be named TypeS. This can typically be +# useful for C code in case the coding convention dictates that all compound +# types are typedef'ed and only the typedef is referenced, never the tag name. +# The default value is: NO. + +TYPEDEF_HIDES_STRUCT = NO + +# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This +# cache is used to resolve symbols given their name and scope. Since this can be +# an expensive process and often the same symbol appears multiple times in the +# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small +# doxygen will become slower. If the cache is too large, memory is wasted. The +# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range +# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536 +# symbols. At the end of a run doxygen will report the cache usage and suggest +# the optimal cache size from a speed point of view. +# Minimum value: 0, maximum value: 9, default value: 0. + +LOOKUP_CACHE_SIZE = 0 + +#--------------------------------------------------------------------------- +# Build related configuration options +#--------------------------------------------------------------------------- + +# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in +# documentation are documented, even if no documentation was available. Private +# class members and static file members will be hidden unless the +# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES. +# Note: This will also disable the warnings about undocumented members that are +# normally produced when WARNINGS is set to YES. +# The default value is: NO. + +EXTRACT_ALL = NO + +# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will +# be included in the documentation. +# The default value is: NO. + +EXTRACT_PRIVATE = NO + +# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal +# scope will be included in the documentation. +# The default value is: NO. + +EXTRACT_PACKAGE = NO + +# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be +# included in the documentation. +# The default value is: NO. + +EXTRACT_STATIC = NO + +# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined +# locally in source files will be included in the documentation. If set to NO, +# only classes defined in header files are included. Does not have any effect +# for Java sources. +# The default value is: YES. + +EXTRACT_LOCAL_CLASSES = YES + +# This flag is only useful for Objective-C code. If set to YES, local methods, +# which are defined in the implementation section but not in the interface are +# included in the documentation. If set to NO, only methods in the interface are +# included. +# The default value is: NO. + +EXTRACT_LOCAL_METHODS = NO + +# If this flag is set to YES, the members of anonymous namespaces will be +# extracted and appear in the documentation as a namespace called +# 'anonymous_namespace{file}', where file will be replaced with the base name of +# the file that contains the anonymous namespace. By default anonymous namespace +# are hidden. +# The default value is: NO. + +EXTRACT_ANON_NSPACES = NO + +# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all +# undocumented members inside documented classes or files. If set to NO these +# members will be included in the various overviews, but no documentation +# section is generated. This option has no effect if EXTRACT_ALL is enabled. +# The default value is: NO. + +HIDE_UNDOC_MEMBERS = NO + +# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all +# undocumented classes that are normally visible in the class hierarchy. If set +# to NO, these classes will be included in the various overviews. This option +# has no effect if EXTRACT_ALL is enabled. +# The default value is: NO. + +HIDE_UNDOC_CLASSES = NO + +# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend +# (class|struct|union) declarations. If set to NO, these declarations will be +# included in the documentation. +# The default value is: NO. + +HIDE_FRIEND_COMPOUNDS = NO + +# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any +# documentation blocks found inside the body of a function. If set to NO, these +# blocks will be appended to the function's detailed documentation block. +# The default value is: NO. + +HIDE_IN_BODY_DOCS = NO + +# The INTERNAL_DOCS tag determines if documentation that is typed after a +# \internal command is included. If the tag is set to NO then the documentation +# will be excluded. Set it to YES to include the internal documentation. +# The default value is: NO. + +INTERNAL_DOCS = NO + +# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file +# names in lower-case letters. If set to YES, upper-case letters are also +# allowed. This is useful if you have classes or files whose names only differ +# in case and if your file system supports case sensitive file names. Windows +# and Mac users are advised to set this option to NO. +# The default value is: system dependent. + +CASE_SENSE_NAMES = YES + +# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with +# their full class and namespace scopes in the documentation. If set to YES, the +# scope will be hidden. +# The default value is: NO. + +HIDE_SCOPE_NAMES = NO + +# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will +# append additional text to a page's title, such as Class Reference. If set to +# YES the compound reference will be hidden. +# The default value is: NO. + +HIDE_COMPOUND_REFERENCE= NO + +# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of +# the files that are included by a file in the documentation of that file. +# The default value is: YES. + +SHOW_INCLUDE_FILES = YES + +# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each +# grouped member an include statement to the documentation, telling the reader +# which file to include in order to use the member. +# The default value is: NO. + +SHOW_GROUPED_MEMB_INC = NO + +# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include +# files with double quotes in the documentation rather than with sharp brackets. +# The default value is: NO. + +FORCE_LOCAL_INCLUDES = NO + +# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the +# documentation for inline members. +# The default value is: YES. + +INLINE_INFO = YES + +# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the +# (detailed) documentation of file and class members alphabetically by member +# name. If set to NO, the members will appear in declaration order. +# The default value is: YES. + +SORT_MEMBER_DOCS = YES + +# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief +# descriptions of file, namespace and class members alphabetically by member +# name. If set to NO, the members will appear in declaration order. Note that +# this will also influence the order of the classes in the class list. +# The default value is: NO. + +SORT_BRIEF_DOCS = NO + +# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the +# (brief and detailed) documentation of class members so that constructors and +# destructors are listed first. If set to NO the constructors will appear in the +# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS. +# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief +# member documentation. +# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting +# detailed member documentation. +# The default value is: NO. + +SORT_MEMBERS_CTORS_1ST = NO + +# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy +# of group names into alphabetical order. If set to NO the group names will +# appear in their defined order. +# The default value is: NO. + +SORT_GROUP_NAMES = NO + +# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by +# fully-qualified names, including namespaces. If set to NO, the class list will +# be sorted only by class name, not including the namespace part. +# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES. +# Note: This option applies only to the class list, not to the alphabetical +# list. +# The default value is: NO. + +SORT_BY_SCOPE_NAME = NO + +# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper +# type resolution of all parameters of a function it will reject a match between +# the prototype and the implementation of a member function even if there is +# only one candidate or it is obvious which candidate to choose by doing a +# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still +# accept a match between prototype and implementation in such cases. +# The default value is: NO. + +STRICT_PROTO_MATCHING = NO + +# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo +# list. This list is created by putting \todo commands in the documentation. +# The default value is: YES. + +GENERATE_TODOLIST = YES + +# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test +# list. This list is created by putting \test commands in the documentation. +# The default value is: YES. + +GENERATE_TESTLIST = YES + +# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug +# list. This list is created by putting \bug commands in the documentation. +# The default value is: YES. + +GENERATE_BUGLIST = YES + +# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO) +# the deprecated list. This list is created by putting \deprecated commands in +# the documentation. +# The default value is: YES. + +GENERATE_DEPRECATEDLIST= YES + +# The ENABLED_SECTIONS tag can be used to enable conditional documentation +# sections, marked by \if ... \endif and \cond +# ... \endcond blocks. + +ENABLED_SECTIONS = + +# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the +# initial value of a variable or macro / define can have for it to appear in the +# documentation. If the initializer consists of more lines than specified here +# it will be hidden. Use a value of 0 to hide initializers completely. The +# appearance of the value of individual variables and macros / defines can be +# controlled using \showinitializer or \hideinitializer command in the +# documentation regardless of this setting. +# Minimum value: 0, maximum value: 10000, default value: 30. + +MAX_INITIALIZER_LINES = 30 + +# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at +# the bottom of the documentation of classes and structs. If set to YES, the +# list will mention the files that were used to generate the documentation. +# The default value is: YES. + +SHOW_USED_FILES = YES + +# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This +# will remove the Files entry from the Quick Index and from the Folder Tree View +# (if specified). +# The default value is: YES. + +SHOW_FILES = YES + +# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces +# page. This will remove the Namespaces entry from the Quick Index and from the +# Folder Tree View (if specified). +# The default value is: YES. + +SHOW_NAMESPACES = YES + +# The FILE_VERSION_FILTER tag can be used to specify a program or script that +# doxygen should invoke to get the current version for each file (typically from +# the version control system). Doxygen will invoke the program by executing (via +# popen()) the command command input-file, where command is the value of the +# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided +# by doxygen. Whatever the program writes to standard output is used as the file +# version. For an example see the documentation. + +FILE_VERSION_FILTER = + +# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed +# by doxygen. The layout file controls the global structure of the generated +# output files in an output format independent way. To create the layout file +# that represents doxygen's defaults, run doxygen with the -l option. You can +# optionally specify a file name after the option, if omitted DoxygenLayout.xml +# will be used as the name of the layout file. +# +# Note that if you run doxygen from a directory containing a file called +# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE +# tag is left empty. + +LAYOUT_FILE = + +# The CITE_BIB_FILES tag can be used to specify one or more bib files containing +# the reference definitions. This must be a list of .bib files. The .bib +# extension is automatically appended if omitted. This requires the bibtex tool +# to be installed. See also https://en.wikipedia.org/wiki/BibTeX for more info. +# For LaTeX the style of the bibliography can be controlled using +# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the +# search path. See also \cite for info how to create references. + +CITE_BIB_FILES = + +#--------------------------------------------------------------------------- +# Configuration options related to warning and progress messages +#--------------------------------------------------------------------------- + +# The QUIET tag can be used to turn on/off the messages that are generated to +# standard output by doxygen. If QUIET is set to YES this implies that the +# messages are off. +# The default value is: NO. + +QUIET = NO + +# The WARNINGS tag can be used to turn on/off the warning messages that are +# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES +# this implies that the warnings are on. +# +# Tip: Turn warnings on while writing the documentation. +# The default value is: YES. + +WARNINGS = YES + +# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate +# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag +# will automatically be disabled. +# The default value is: YES. + +WARN_IF_UNDOCUMENTED = YES + +# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for +# potential errors in the documentation, such as not documenting some parameters +# in a documented function, or documenting parameters that don't exist or using +# markup commands wrongly. +# The default value is: YES. + +WARN_IF_DOC_ERROR = YES + +# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that +# are documented, but have no documentation for their parameters or return +# value. If set to NO, doxygen will only warn about wrong or incomplete +# parameter documentation, but not about the absence of documentation. +# The default value is: NO. + +WARN_NO_PARAMDOC = NO + +# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when +# a warning is encountered. +# The default value is: NO. + +WARN_AS_ERROR = NO + +# The WARN_FORMAT tag determines the format of the warning messages that doxygen +# can produce. The string should contain the $file, $line, and $text tags, which +# will be replaced by the file and line number from which the warning originated +# and the warning text. Optionally the format may contain $version, which will +# be replaced by the version of the file (if it could be obtained via +# FILE_VERSION_FILTER) +# The default value is: $file:$line: $text. + +WARN_FORMAT = "$file:$line: $text" + +# The WARN_LOGFILE tag can be used to specify a file to which warning and error +# messages should be written. If left blank the output is written to standard +# error (stderr). + +WARN_LOGFILE = + +#--------------------------------------------------------------------------- +# Configuration options related to the input files +#--------------------------------------------------------------------------- + +# The INPUT tag is used to specify the files and/or directories that contain +# documented source files. You may enter file names like myfile.cpp or +# directories like /usr/src/myproject. Separate the files or directories with +# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING +# Note: If this tag is empty the current directory is searched. + +INPUT = "@CMAKE_CURRENT_SOURCE_DIR@/SRC/" \ + "@CMAKE_CURRENT_SOURCE_DIR@/EXAMPLE/" \ + "@CMAKE_CURRENT_SOURCE_DIR@/FORTRAN/" + +# This tag can be used to specify the character encoding of the source files +# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses +# libiconv (or the iconv built into libc) for the transcoding. See the libiconv +# documentation (see: https://www.gnu.org/software/libiconv/) for the list of +# possible encodings. +# The default value is: UTF-8. + +INPUT_ENCODING = UTF-8 + +# If the value of the INPUT tag contains directories, you can use the +# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and +# *.h) to filter out the source-files in the directories. +# +# Note that for custom extensions or not directly supported extensions you also +# need to set EXTENSION_MAPPING for the extension otherwise the files are not +# read by doxygen. +# +# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp, +# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h, +# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc, +# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f95, *.f03, *.f08, +# *.f, *.for, *.tcl, *.vhd, *.vhdl, *.ucf and *.qsf. + +FILE_PATTERNS = *.c \ + *.cc \ + *.cxx \ + *.cpp \ + *.c++ \ + *.java \ + *.ii \ + *.ixx \ + *.ipp \ + *.i++ \ + *.inl \ + *.idl \ + *.ddl \ + *.odl \ + *.h \ + *.hh \ + *.hxx \ + *.hpp \ + *.h++ \ + *.cs \ + *.d \ + *.php \ + *.php4 \ + *.php5 \ + *.phtml \ + *.inc \ + *.m \ + *.markdown \ + *.md \ + *.mm \ + *.dox \ + *.py \ + *.pyw \ + *.f90 \ + *.f95 \ + *.f03 \ + *.f08 \ + *.f \ + *.for \ + *.tcl \ + *.vhd \ + *.vhdl \ + *.ucf \ + *.qsf + +# The RECURSIVE tag can be used to specify whether or not subdirectories should +# be searched for input files as well. +# The default value is: NO. + +RECURSIVE = NO + +# The EXCLUDE tag can be used to specify files and/or directories that should be +# excluded from the INPUT source files. This way you can easily exclude a +# subdirectory from a directory tree whose root is specified with the INPUT tag. +# +# Note that relative paths are relative to the directory from which doxygen is +# run. + +EXCLUDE = + +# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or +# directories that are symbolic links (a Unix file system feature) are excluded +# from the input. +# The default value is: NO. + +EXCLUDE_SYMLINKS = NO + +# If the value of the INPUT tag contains directories, you can use the +# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude +# certain files from those directories. +# +# Note that the wildcards are matched against the file with absolute path, so to +# exclude all test directories for example use the pattern */test/* + +EXCLUDE_PATTERNS = + +# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names +# (namespaces, classes, functions, etc.) that should be excluded from the +# output. The symbol name can be a fully qualified name, a word, or if the +# wildcard * is used, a substring. Examples: ANamespace, AClass, +# AClass::ANamespace, ANamespace::*Test +# +# Note that the wildcards are matched against the file with absolute path, so to +# exclude all test directories use the pattern */test/* + +EXCLUDE_SYMBOLS = + +# The EXAMPLE_PATH tag can be used to specify one or more files or directories +# that contain example code fragments that are included (see the \include +# command). + +EXAMPLE_PATH = + +# If the value of the EXAMPLE_PATH tag contains directories, you can use the +# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and +# *.h) to filter out the source-files in the directories. If left blank all +# files are included. + +EXAMPLE_PATTERNS = * + +# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be +# searched for input files to be used with the \include or \dontinclude commands +# irrespective of the value of the RECURSIVE tag. +# The default value is: NO. + +EXAMPLE_RECURSIVE = NO + +# The IMAGE_PATH tag can be used to specify one or more files or directories +# that contain images that are to be included in the documentation (see the +# \image command). + +IMAGE_PATH = + +# The INPUT_FILTER tag can be used to specify a program that doxygen should +# invoke to filter for each input file. Doxygen will invoke the filter program +# by executing (via popen()) the command: +# +# +# +# where is the value of the INPUT_FILTER tag, and is the +# name of an input file. Doxygen will then use the output that the filter +# program writes to standard output. If FILTER_PATTERNS is specified, this tag +# will be ignored. +# +# Note that the filter must not add or remove lines; it is applied before the +# code is scanned, but not when the output code is generated. If lines are added +# or removed, the anchors will not be placed correctly. +# +# Note that for custom extensions or not directly supported extensions you also +# need to set EXTENSION_MAPPING for the extension otherwise the files are not +# properly processed by doxygen. + +INPUT_FILTER = + +# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern +# basis. Doxygen will compare the file name with each pattern and apply the +# filter if there is a match. The filters are a list of the form: pattern=filter +# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how +# filters are used. If the FILTER_PATTERNS tag is empty or if none of the +# patterns match the file name, INPUT_FILTER is applied. +# +# Note that for custom extensions or not directly supported extensions you also +# need to set EXTENSION_MAPPING for the extension otherwise the files are not +# properly processed by doxygen. + +FILTER_PATTERNS = + +# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using +# INPUT_FILTER) will also be used to filter the input files that are used for +# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES). +# The default value is: NO. + +FILTER_SOURCE_FILES = NO + +# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file +# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and +# it is also possible to disable source filtering for a specific pattern using +# *.ext= (so without naming a filter). +# This tag requires that the tag FILTER_SOURCE_FILES is set to YES. + +FILTER_SOURCE_PATTERNS = + +# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that +# is part of the input, its contents will be placed on the main page +# (index.html). This can be useful if you have a project on for instance GitHub +# and want to reuse the introduction page also for the doxygen output. + +USE_MDFILE_AS_MAINPAGE = + +#--------------------------------------------------------------------------- +# Configuration options related to source browsing +#--------------------------------------------------------------------------- + +# If the SOURCE_BROWSER tag is set to YES then a list of source files will be +# generated. Documented entities will be cross-referenced with these sources. +# +# Note: To get rid of all source code in the generated output, make sure that +# also VERBATIM_HEADERS is set to NO. +# The default value is: NO. + +SOURCE_BROWSER = NO + +# Setting the INLINE_SOURCES tag to YES will include the body of functions, +# classes and enums directly into the documentation. +# The default value is: NO. + +INLINE_SOURCES = NO + +# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any +# special comment blocks from generated source code fragments. Normal C, C++ and +# Fortran comments will always remain visible. +# The default value is: YES. + +STRIP_CODE_COMMENTS = YES + +# If the REFERENCED_BY_RELATION tag is set to YES then for each documented +# function all documented functions referencing it will be listed. +# The default value is: NO. + +REFERENCED_BY_RELATION = NO + +# If the REFERENCES_RELATION tag is set to YES then for each documented function +# all documented entities called/used by that function will be listed. +# The default value is: NO. + +REFERENCES_RELATION = NO + +# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set +# to YES then the hyperlinks from functions in REFERENCES_RELATION and +# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will +# link to the documentation. +# The default value is: YES. + +REFERENCES_LINK_SOURCE = YES + +# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the +# source code will show a tooltip with additional information such as prototype, +# brief description and links to the definition and documentation. Since this +# will make the HTML file larger and loading of large files a bit slower, you +# can opt to disable this feature. +# The default value is: YES. +# This tag requires that the tag SOURCE_BROWSER is set to YES. + +SOURCE_TOOLTIPS = YES + +# If the USE_HTAGS tag is set to YES then the references to source code will +# point to the HTML generated by the htags(1) tool instead of doxygen built-in +# source browser. The htags tool is part of GNU's global source tagging system +# (see https://www.gnu.org/software/global/global.html). You will need version +# 4.8.6 or higher. +# +# To use it do the following: +# - Install the latest version of global +# - Enable SOURCE_BROWSER and USE_HTAGS in the config file +# - Make sure the INPUT points to the root of the source tree +# - Run doxygen as normal +# +# Doxygen will invoke htags (and that will in turn invoke gtags), so these +# tools must be available from the command line (i.e. in the search path). +# +# The result: instead of the source browser generated by doxygen, the links to +# source code will now point to the output of htags. +# The default value is: NO. +# This tag requires that the tag SOURCE_BROWSER is set to YES. + +USE_HTAGS = NO + +# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a +# verbatim copy of the header file for each class for which an include is +# specified. Set to NO to disable this. +# See also: Section \class. +# The default value is: YES. + +VERBATIM_HEADERS = YES + +#--------------------------------------------------------------------------- +# Configuration options related to the alphabetical class index +#--------------------------------------------------------------------------- + +# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all +# compounds will be generated. Enable this if the project contains a lot of +# classes, structs, unions or interfaces. +# The default value is: YES. + +ALPHABETICAL_INDEX = YES + +# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in +# which the alphabetical index list will be split. +# Minimum value: 1, maximum value: 20, default value: 5. +# This tag requires that the tag ALPHABETICAL_INDEX is set to YES. + +COLS_IN_ALPHA_INDEX = 5 + +# In case all classes in a project start with a common prefix, all classes will +# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag +# can be used to specify a prefix (or a list of prefixes) that should be ignored +# while generating the index headers. +# This tag requires that the tag ALPHABETICAL_INDEX is set to YES. + +IGNORE_PREFIX = + +#--------------------------------------------------------------------------- +# Configuration options related to the HTML output +#--------------------------------------------------------------------------- + +# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output +# The default value is: YES. + +GENERATE_HTML = @d_enable_doc_html@ + +# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a +# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of +# it. +# The default directory is: html. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_OUTPUT = html + +# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each +# generated HTML page (for example: .htm, .php, .asp). +# The default value is: .html. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_FILE_EXTENSION = .html + +# The HTML_HEADER tag can be used to specify a user-defined HTML header file for +# each generated HTML page. If the tag is left blank doxygen will generate a +# standard header. +# +# To get valid HTML the header file that includes any scripts and style sheets +# that doxygen needs, which is dependent on the configuration options used (e.g. +# the setting GENERATE_TREEVIEW). It is highly recommended to start with a +# default header using +# doxygen -w html new_header.html new_footer.html new_stylesheet.css +# YourConfigFile +# and then modify the file new_header.html. See also section "Doxygen usage" +# for information on how to generate the default header that doxygen normally +# uses. +# Note: The header is subject to change so you typically have to regenerate the +# default header when upgrading to a newer version of doxygen. For a description +# of the possible markers and block names see the documentation. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_HEADER = + +# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each +# generated HTML page. If the tag is left blank doxygen will generate a standard +# footer. See HTML_HEADER for more information on how to generate a default +# footer and what special commands can be used inside the footer. See also +# section "Doxygen usage" for information on how to generate the default footer +# that doxygen normally uses. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_FOOTER = + +# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style +# sheet that is used by each HTML page. It can be used to fine-tune the look of +# the HTML output. If left blank doxygen will generate a default style sheet. +# See also section "Doxygen usage" for information on how to generate the style +# sheet that doxygen normally uses. +# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as +# it is more robust and this tag (HTML_STYLESHEET) will in the future become +# obsolete. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_STYLESHEET = + +# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined +# cascading style sheets that are included after the standard style sheets +# created by doxygen. Using this option one can overrule certain style aspects. +# This is preferred over using HTML_STYLESHEET since it does not replace the +# standard style sheet and is therefore more robust against future updates. +# Doxygen will copy the style sheet files to the output directory. +# Note: The order of the extra style sheet files is of importance (e.g. the last +# style sheet in the list overrules the setting of the previous ones in the +# list). For an example see the documentation. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_EXTRA_STYLESHEET = + +# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or +# other source files which should be copied to the HTML output directory. Note +# that these files will be copied to the base HTML output directory. Use the +# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these +# files. In the HTML_STYLESHEET file, use the file name only. Also note that the +# files will be copied as-is; there are no commands or markers available. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_EXTRA_FILES = + +# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen +# will adjust the colors in the style sheet and background images according to +# this color. Hue is specified as an angle on a colorwheel, see +# https://en.wikipedia.org/wiki/Hue for more information. For instance the value +# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300 +# purple, and 360 is red again. +# Minimum value: 0, maximum value: 359, default value: 220. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_COLORSTYLE_HUE = 220 + +# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors +# in the HTML output. For a value of 0 the output will use grayscales only. A +# value of 255 will produce the most vivid colors. +# Minimum value: 0, maximum value: 255, default value: 100. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_COLORSTYLE_SAT = 100 + +# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the +# luminance component of the colors in the HTML output. Values below 100 +# gradually make the output lighter, whereas values above 100 make the output +# darker. The value divided by 100 is the actual gamma applied, so 80 represents +# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not +# change the gamma. +# Minimum value: 40, maximum value: 240, default value: 80. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_COLORSTYLE_GAMMA = 80 + +# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML +# page will contain the date and time when the page was generated. Setting this +# to YES can help to show when doxygen was last run and thus if the +# documentation is up to date. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_TIMESTAMP = NO + +# If the HTML_DYNAMIC_MENUS tag is set to YES then the generated HTML +# documentation will contain a main index with vertical navigation menus that +# are dynamically created via Javascript. If disabled, the navigation index will +# consists of multiple levels of tabs that are statically embedded in every HTML +# page. Disable this option to support browsers that do not have Javascript, +# like the Qt help browser. +# The default value is: YES. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_DYNAMIC_MENUS = YES + +# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML +# documentation will contain sections that can be hidden and shown after the +# page has loaded. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_DYNAMIC_SECTIONS = NO + +# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries +# shown in the various tree structured indices initially; the user can expand +# and collapse entries dynamically later on. Doxygen will expand the tree to +# such a level that at most the specified number of entries are visible (unless +# a fully collapsed tree already exceeds this amount). So setting the number of +# entries 1 will produce a full collapsed tree by default. 0 is a special value +# representing an infinite number of entries and will result in a full expanded +# tree by default. +# Minimum value: 0, maximum value: 9999, default value: 100. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_INDEX_NUM_ENTRIES = 100 + +# If the GENERATE_DOCSET tag is set to YES, additional index files will be +# generated that can be used as input for Apple's Xcode 3 integrated development +# environment (see: https://developer.apple.com/tools/xcode/), introduced with +# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a +# Makefile in the HTML output directory. Running make will produce the docset in +# that directory and running make install will install the docset in +# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at +# startup. See https://developer.apple.com/tools/creatingdocsetswithdoxygen.html +# for more information. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +GENERATE_DOCSET = NO + +# This tag determines the name of the docset feed. A documentation feed provides +# an umbrella under which multiple documentation sets from a single provider +# (such as a company or product suite) can be grouped. +# The default value is: Doxygen generated docs. +# This tag requires that the tag GENERATE_DOCSET is set to YES. + +DOCSET_FEEDNAME = "Doxygen generated docs" + +# This tag specifies a string that should uniquely identify the documentation +# set bundle. This should be a reverse domain-name style string, e.g. +# com.mycompany.MyDocSet. Doxygen will append .docset to the name. +# The default value is: org.doxygen.Project. +# This tag requires that the tag GENERATE_DOCSET is set to YES. + +DOCSET_BUNDLE_ID = org.doxygen.Project + +# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify +# the documentation publisher. This should be a reverse domain-name style +# string, e.g. com.mycompany.MyDocSet.documentation. +# The default value is: org.doxygen.Publisher. +# This tag requires that the tag GENERATE_DOCSET is set to YES. + +DOCSET_PUBLISHER_ID = org.doxygen.Publisher + +# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher. +# The default value is: Publisher. +# This tag requires that the tag GENERATE_DOCSET is set to YES. + +DOCSET_PUBLISHER_NAME = Publisher + +# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three +# additional HTML index files: index.hhp, index.hhc, and index.hhk. The +# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop +# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on +# Windows. +# +# The HTML Help Workshop contains a compiler that can convert all HTML output +# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML +# files are now used as the Windows 98 help format, and will replace the old +# Windows help format (.hlp) on all Windows platforms in the future. Compressed +# HTML files also contain an index, a table of contents, and you can search for +# words in the documentation. The HTML workshop also contains a viewer for +# compressed HTML files. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +GENERATE_HTMLHELP = NO + +# The CHM_FILE tag can be used to specify the file name of the resulting .chm +# file. You can add a path in front of the file if the result should not be +# written to the html output directory. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +CHM_FILE = + +# The HHC_LOCATION tag can be used to specify the location (absolute path +# including file name) of the HTML help compiler (hhc.exe). If non-empty, +# doxygen will try to run the HTML help compiler on the generated index.hhp. +# The file has to be specified with full path. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +HHC_LOCATION = + +# The GENERATE_CHI flag controls if a separate .chi index file is generated +# (YES) or that it should be included in the master .chm file (NO). +# The default value is: NO. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +GENERATE_CHI = NO + +# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc) +# and project file content. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +CHM_INDEX_ENCODING = + +# The BINARY_TOC flag controls whether a binary table of contents is generated +# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it +# enables the Previous and Next buttons. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +BINARY_TOC = NO + +# The TOC_EXPAND flag can be set to YES to add extra items for group members to +# the table of contents of the HTML help documentation and to the tree view. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +TOC_EXPAND = NO + +# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and +# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that +# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help +# (.qch) of the generated HTML documentation. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +GENERATE_QHP = NO + +# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify +# the file name of the resulting .qch file. The path specified is relative to +# the HTML output folder. +# This tag requires that the tag GENERATE_QHP is set to YES. + +QCH_FILE = + +# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help +# Project output. For more information please see Qt Help Project / Namespace +# (see: http://doc.qt.io/qt-4.8/qthelpproject.html#namespace). +# The default value is: org.doxygen.Project. +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHP_NAMESPACE = org.doxygen.Project + +# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt +# Help Project output. For more information please see Qt Help Project / Virtual +# Folders (see: http://doc.qt.io/qt-4.8/qthelpproject.html#virtual-folders). +# The default value is: doc. +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHP_VIRTUAL_FOLDER = doc + +# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom +# filter to add. For more information please see Qt Help Project / Custom +# Filters (see: http://doc.qt.io/qt-4.8/qthelpproject.html#custom-filters). +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHP_CUST_FILTER_NAME = + +# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the +# custom filter to add. For more information please see Qt Help Project / Custom +# Filters (see: http://doc.qt.io/qt-4.8/qthelpproject.html#custom-filters). +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHP_CUST_FILTER_ATTRS = + +# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this +# project's filter section matches. Qt Help Project / Filter Attributes (see: +# http://doc.qt.io/qt-4.8/qthelpproject.html#filter-attributes). +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHP_SECT_FILTER_ATTRS = + +# The QHG_LOCATION tag can be used to specify the location of Qt's +# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the +# generated .qhp file. +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHG_LOCATION = + +# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be +# generated, together with the HTML files, they form an Eclipse help plugin. To +# install this plugin and make it available under the help contents menu in +# Eclipse, the contents of the directory containing the HTML and XML files needs +# to be copied into the plugins directory of eclipse. The name of the directory +# within the plugins directory should be the same as the ECLIPSE_DOC_ID value. +# After copying Eclipse needs to be restarted before the help appears. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +GENERATE_ECLIPSEHELP = NO + +# A unique identifier for the Eclipse help plugin. When installing the plugin +# the directory name containing the HTML and XML files should also have this +# name. Each documentation set should have its own identifier. +# The default value is: org.doxygen.Project. +# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES. + +ECLIPSE_DOC_ID = org.doxygen.Project + +# If you want full control over the layout of the generated HTML pages it might +# be necessary to disable the index and replace it with your own. The +# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top +# of each HTML page. A value of NO enables the index and the value YES disables +# it. Since the tabs in the index contain the same information as the navigation +# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +DISABLE_INDEX = NO + +# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index +# structure should be generated to display hierarchical information. If the tag +# value is set to YES, a side panel will be generated containing a tree-like +# index structure (just like the one that is generated for HTML Help). For this +# to work a browser that supports JavaScript, DHTML, CSS and frames is required +# (i.e. any modern browser). Windows users are probably better off using the +# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can +# further fine-tune the look of the index. As an example, the default style +# sheet generated by doxygen has an example that shows how to put an image at +# the root of the tree instead of the PROJECT_NAME. Since the tree basically has +# the same information as the tab index, you could consider setting +# DISABLE_INDEX to YES when enabling this option. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +GENERATE_TREEVIEW = NO + +# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that +# doxygen will group on one line in the generated HTML documentation. +# +# Note that a value of 0 will completely suppress the enum values from appearing +# in the overview section. +# Minimum value: 0, maximum value: 20, default value: 4. +# This tag requires that the tag GENERATE_HTML is set to YES. + +ENUM_VALUES_PER_LINE = 4 + +# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used +# to set the initial width (in pixels) of the frame in which the tree is shown. +# Minimum value: 0, maximum value: 1500, default value: 250. +# This tag requires that the tag GENERATE_HTML is set to YES. + +TREEVIEW_WIDTH = 250 + +# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to +# external symbols imported via tag files in a separate window. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +EXT_LINKS_IN_WINDOW = NO + +# Use this tag to change the font size of LaTeX formulas included as images in +# the HTML documentation. When you change the font size after a successful +# doxygen run you need to manually remove any form_*.png images from the HTML +# output directory to force them to be regenerated. +# Minimum value: 8, maximum value: 50, default value: 10. +# This tag requires that the tag GENERATE_HTML is set to YES. + +FORMULA_FONTSIZE = 10 + +# Use the FORMULA_TRANSPARENT tag to determine whether or not the images +# generated for formulas are transparent PNGs. Transparent PNGs are not +# supported properly for IE 6.0, but are supported on all modern browsers. +# +# Note that when changing this option you need to delete any form_*.png files in +# the HTML output directory before the changes have effect. +# The default value is: YES. +# This tag requires that the tag GENERATE_HTML is set to YES. + +FORMULA_TRANSPARENT = YES + +# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see +# https://www.mathjax.org) which uses client side Javascript for the rendering +# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX +# installed or if you want to formulas look prettier in the HTML output. When +# enabled you may also need to install MathJax separately and configure the path +# to it using the MATHJAX_RELPATH option. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +USE_MATHJAX = NO + +# When MathJax is enabled you can set the default output format to be used for +# the MathJax output. See the MathJax site (see: +# http://docs.mathjax.org/en/latest/output.html) for more details. +# Possible values are: HTML-CSS (which is slower, but has the best +# compatibility), NativeMML (i.e. MathML) and SVG. +# The default value is: HTML-CSS. +# This tag requires that the tag USE_MATHJAX is set to YES. + +MATHJAX_FORMAT = HTML-CSS + +# When MathJax is enabled you need to specify the location relative to the HTML +# output directory using the MATHJAX_RELPATH option. The destination directory +# should contain the MathJax.js script. For instance, if the mathjax directory +# is located at the same level as the HTML output directory, then +# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax +# Content Delivery Network so you can quickly see the result without installing +# MathJax. However, it is strongly recommended to install a local copy of +# MathJax from https://www.mathjax.org before deployment. +# The default value is: https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.2/. +# This tag requires that the tag USE_MATHJAX is set to YES. + +MATHJAX_RELPATH = https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.2/ + +# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax +# extension names that should be enabled during MathJax rendering. For example +# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols +# This tag requires that the tag USE_MATHJAX is set to YES. + +MATHJAX_EXTENSIONS = + +# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces +# of code that will be used on startup of the MathJax code. See the MathJax site +# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an +# example see the documentation. +# This tag requires that the tag USE_MATHJAX is set to YES. + +MATHJAX_CODEFILE = + +# When the SEARCHENGINE tag is enabled doxygen will generate a search box for +# the HTML output. The underlying search engine uses javascript and DHTML and +# should work on any modern browser. Note that when using HTML help +# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET) +# there is already a search function so this one should typically be disabled. +# For large projects the javascript based search engine can be slow, then +# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to +# search using the keyboard; to jump to the search box use + S +# (what the is depends on the OS and browser, but it is typically +# , /