Section 3: library functions
NAME stgevc.f – SYNOPSIS Functions/Subroutines subroutine stgevc (SIDE, HOWMNY, SELECT, N, S, LDS, P, LDP, VL, LDVL, VR, LDVR, MM, M, WORK, INFO) STGEVC Function/Subroutine Documentation subroutine stgevc (characterSIDE, characterHOWMNY, logical, dimension( * )SELECT, integerN, real, dimension( lds, * )S, integerLDS, real, dimension( ldp, * )P, integerLDP, real, dimension( ldvl, * )VL, integerLDVL, real, dimension(…
NAME stfttr.f – SYNOPSIS Functions/Subroutines subroutine stfttr (TRANSR, UPLO, N, ARF, A, LDA, INFO) STFTTR copies a triangular matrix from the rectangular full packed format (TF) to the standard full format (TR). Function/Subroutine Documentation subroutine stfttr (characterTRANSR, characterUPLO, integerN, real, dimension( 0: * )ARF, real, dimension( 0: lda-1, 0: * )A, integerLDA, integerINFO) STFTTR copies…
NAME stfttp.f – SYNOPSIS Functions/Subroutines subroutine stfttp (TRANSR, UPLO, N, ARF, AP, INFO) STFTTP copies a triangular matrix from the rectangular full packed format (TF) to the standard packed format (TP). Function/Subroutine Documentation subroutine stfttp (characterTRANSR, characterUPLO, integerN, real, dimension( 0: * )ARF, real, dimension( 0: * )AP, integerINFO) STFTTP copies a triangular matrix from…
NAME stftri.f – SYNOPSIS Functions/Subroutines subroutine stftri (TRANSR, UPLO, DIAG, N, A, INFO) STFTRI Function/Subroutine Documentation subroutine stftri (characterTRANSR, characterUPLO, characterDIAG, integerN, real, dimension( 0: * )A, integerINFO) STFTRI Purpose: STFTRI computes the inverse of a triangular matrix A stored in RFP format. This is a Level 3 BLAS version of the algorithm. Parameters:…
NAME stfsm.f – SYNOPSIS Functions/Subroutines subroutine stfsm (TRANSR, SIDE, UPLO, TRANS, DIAG, M, N, ALPHA, A, B, LDB) STFSM solves a matrix equation (one operand is a triangular matrix in RFP format). Function/Subroutine Documentation subroutine stfsm (characterTRANSR, characterSIDE, characterUPLO, characterTRANS, characterDIAG, integerM, integerN, realALPHA, real, dimension( 0: * )A, real, dimension( 0: ldb-1, 0: *…
NAME stbtrs.f – SYNOPSIS Functions/Subroutines subroutine stbtrs (UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B, LDB, INFO) STBTRS Function/Subroutine Documentation subroutine stbtrs (characterUPLO, characterTRANS, characterDIAG, integerN, integerKD, integerNRHS, real, dimension( ldab, * )AB, integerLDAB, real, dimension( ldb, * )B, integerLDB, integerINFO) STBTRS Purpose: STBTRS solves a triangular system of the form A * X…
NAME stbsv.f – SYNOPSIS Functions/Subroutines subroutine stbsv (UPLO, TRANS, DIAG, N, K, A, LDA, X, INCX) STBSV Function/Subroutine Documentation subroutine stbsv (characterUPLO, characterTRANS, characterDIAG, integerN, integerK, real, dimension(lda,*)A, integerLDA, real, dimension(*)X, integerINCX) STBSV Purpose: STBSV solves one of the systems of equations A*x = b, or A**T*x = b, where b and x are n…
NAME stbrfs.f – SYNOPSIS Functions/Subroutines subroutine stbrfs (UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B, LDB, X, LDX, FERR, BERR, WORK, IWORK, INFO) STBRFS Function/Subroutine Documentation subroutine stbrfs (characterUPLO, characterTRANS, characterDIAG, integerN, integerKD, integerNRHS, real, dimension( ldab, * )AB, integerLDAB, real, dimension( ldb, * )B, integerLDB, real, dimension( ldx, * )X, integerLDX, real, dimension(…
NAME stbmv.f – SYNOPSIS Functions/Subroutines subroutine stbmv (UPLO, TRANS, DIAG, N, K, A, LDA, X, INCX) STBMV Function/Subroutine Documentation subroutine stbmv (characterUPLO, characterTRANS, characterDIAG, integerN, integerK, real, dimension(lda,*)A, integerLDA, real, dimension(*)X, integerINCX) STBMV Purpose: STBMV performs one of the matrix-vector operations x := A*x, or x := A**T*x, where x is an n element vector…
NAME stbcon.f – SYNOPSIS Functions/Subroutines subroutine stbcon (NORM, UPLO, DIAG, N, KD, AB, LDAB, RCOND, WORK, IWORK, INFO) STBCON Function/Subroutine Documentation subroutine stbcon (characterNORM, characterUPLO, characterDIAG, integerN, integerKD, real, dimension( ldab, * )AB, integerLDAB, realRCOND, real, dimension( * )WORK, integer, dimension( * )IWORK, integerINFO) STBCON Purpose: STBCON estimates the reciprocal of the condition number of…
STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis #include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD…
STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis #include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD…
STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis #include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD…
STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis #include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD…
STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis #include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD…
STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis #include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD…
STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis #include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD…
STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis #include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD…
STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis #include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD…
STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis #include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD…