SysTutorials Posts

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…

NAME sla_wwaddw.f – SYNOPSIS Functions/Subroutines subroutine sla_wwaddw (N, X, Y, W) SLA_WWADDW adds a vector into a doubled-single vector. Function/Subroutine Documentation subroutine sla_wwaddw (integerN, real, dimension( * )X, real, dimension( * )Y, real, dimension( * )W) SLA_WWADDW adds a vector into a doubled-single vector. Purpose: SLA_WWADDW adds a vector W into a doubled-single vector (X,…

NAME sla_syrpvgrw.f – SYNOPSIS Functions/Subroutines REAL function sla_syrpvgrw (UPLO, N, INFO, A, LDA, AF, LDAF, IPIV, WORK) SLA_SYRPVGRW computes the reciprocal pivot growth factor norm(A)/norm(U) for a symmetric indefinite matrix. Function/Subroutine Documentation REAL function sla_syrpvgrw (character*1UPLO, integerN, integerINFO, real, dimension( lda, * )A, integerLDA, real, dimension( ldaf, * )AF, integerLDAF, integer, dimension( * )IPIV, real,…

NAME sla_syamv.f – SYNOPSIS Functions/Subroutines subroutine sla_syamv (UPLO, N, ALPHA, A, LDA, X, INCX, BETA, Y, INCY) SLA_SYAMV computes a matrix-vector product using a symmetric indefinite matrix to calculate error bounds. Function/Subroutine Documentation subroutine sla_syamv (integerUPLO, integerN, realALPHA, real, dimension( lda, * )A, integerLDA, real, dimension( * )X, integerINCX, realBETA, real, dimension( * )Y, integerINCY)…

NAME sla_porpvgrw.f – SYNOPSIS Functions/Subroutines REAL function sla_porpvgrw (UPLO, NCOLS, A, LDA, AF, LDAF, WORK) SLA_PORPVGRW computes the reciprocal pivot growth factor norm(A)/norm(U) for a symmetric or Hermitian positive-definite matrix. Function/Subroutine Documentation REAL function sla_porpvgrw (character*1UPLO, integerNCOLS, real, dimension( lda, * )A, integerLDA, real, dimension( ldaf, * )AF, integerLDAF, real, dimension( * )WORK) SLA_PORPVGRW computes…

NAME sla_porfsx_extended.f – SYNOPSIS Functions/Subroutines subroutine sla_porfsx_extended (PREC_TYPE, UPLO, N, NRHS, A, LDA, AF, LDAF, COLEQU, C, B, LDB, Y, LDY, BERR_OUT, N_NORMS, ERR_BNDS_NORM, ERR_BNDS_COMP, RES, AYB, DY, Y_TAIL, RCOND, ITHRESH, RTHRESH, DZ_UB, IGNORE_CWISE, INFO) SLA_PORFSX_EXTENDED improves the computed solution to a system of linear equations for symmetric or Hermitian positive-definite matrices by performing extra-precise…

NAME sla_porcond.f – SYNOPSIS Functions/Subroutines REAL function sla_porcond (UPLO, N, A, LDA, AF, LDAF, CMODE, C, INFO, WORK, IWORK) SLA_PORCOND estimates the Skeel condition number for a symmetric positive-definite matrix. Function/Subroutine Documentation REAL function sla_porcond (characterUPLO, integerN, real, dimension( lda, * )A, integerLDA, real, dimension( ldaf, * )AF, integerLDAF, integerCMODE, real, dimension( * )C, integerINFO,…

NAME sla_lin_berr.f – SYNOPSIS Functions/Subroutines subroutine sla_lin_berr (N, NZ, NRHS, RES, AYB, BERR) SLA_LIN_BERR computes a component-wise relative backward error. Function/Subroutine Documentation subroutine sla_lin_berr (integerN, integerNZ, integerNRHS, real, dimension( n, nrhs )RES, real, dimension( n, nrhs )AYB, real, dimension( nrhs )BERR) SLA_LIN_BERR computes a component-wise relative backward error. Purpose: SLA_LIN_BERR computes componentwise relative backward error…

NAME sla_gerpvgrw.f – SYNOPSIS Functions/Subroutines REAL function sla_gerpvgrw (N, NCOLS, A, LDA, AF, LDAF) SLA_GERPVGRW Function/Subroutine Documentation REAL function sla_gerpvgrw (integerN, integerNCOLS, real, dimension( lda, * )A, integerLDA, real, dimension( ldaf, * )AF, integerLDAF) SLA_GERPVGRW Purpose: SLA_GERPVGRW computes the reciprocal pivot growth factor norm(A)/norm(U). The "max absolute element" norm is used. If this is much…