.TH "rsb-spblas.h" 3 "Version 1.3.0.2" "librsb" \" -*- nroff -*- .ad l .nh .SH NAME librsb - rsb-spblas.h \- The Sparse BLAS interface to librsb (blas_sparse\&.h, rsb_blas_sparse\&.F90) .SH DESCRIPTION .PP \- A Sparse BLAS interface (see http://www.netlib.org/blas/blast-forum/) to \fClibrsb\fP\&. Level 1 (vector-vector operations) is supported in a basic way\&. Level 2 (sparse matrix-dense vector operations) is supported fully\&. Level 3 (sparse matrix-dense matrix operations) is supported as a wrapper around Level 2\&. .SH SYNOPSIS .br .PP .SS "Functions" .in +1c .ti -1c .RI "\fBint\fP \fBBLAS_susdot\fP (\fBconst\fP \fBenum\fP \fBblas_conj_type\fP \fBconj\fP, \fBconst\fP \fBint\fP nnz, \fBconst\fP \fBfloat\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBfloat\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBfloat\fP *\fBr\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_susdot_\fP (\fBconst\fP \fBenum\fP \fBblas_conj_type\fP *\fBconj\fP, \fBconst\fP \fBint\fP *nnz, \fBconst\fP \fBfloat\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBfloat\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBfloat\fP *\fBr\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dusdot\fP (\fBconst\fP \fBenum\fP \fBblas_conj_type\fP \fBconj\fP, \fBconst\fP \fBint\fP nnz, \fBconst\fP \fBdouble\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBdouble\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBdouble\fP *\fBr\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dusdot_\fP (\fBconst\fP \fBenum\fP \fBblas_conj_type\fP *\fBconj\fP, \fBconst\fP \fBint\fP *nnz, \fBconst\fP \fBdouble\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBdouble\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBdouble\fP *\fBr\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cusdot\fP (\fBconst\fP \fBenum\fP \fBblas_conj_type\fP \fBconj\fP, \fBconst\fP \fBint\fP nnz, \fBconst\fP \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBvoid\fP *\fBr\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cusdot_\fP (\fBconst\fP \fBenum\fP \fBblas_conj_type\fP *\fBconj\fP, \fBconst\fP \fBint\fP *nnz, \fBconst\fP \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBvoid\fP *\fBr\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zusdot\fP (\fBconst\fP \fBenum\fP \fBblas_conj_type\fP \fBconj\fP, \fBconst\fP \fBint\fP nnz, \fBconst\fP \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBvoid\fP *\fBr\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zusdot_\fP (\fBconst\fP \fBenum\fP \fBblas_conj_type\fP *\fBconj\fP, \fBconst\fP \fBint\fP *nnz, \fBconst\fP \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBvoid\fP *\fBr\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_susaxpy\fP (\fBconst\fP \fBint\fP nnz, \fBfloat\fP \fBalpha\fP, \fBconst\fP \fBfloat\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBfloat\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_susaxpy_\fP (\fBconst\fP \fBint\fP *nnz, \fBfloat\fP *\fBalpha\fP, \fBconst\fP \fBfloat\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBfloat\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dusaxpy\fP (\fBconst\fP \fBint\fP nnz, \fBdouble\fP \fBalpha\fP, \fBconst\fP \fBdouble\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBdouble\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dusaxpy_\fP (\fBconst\fP \fBint\fP *nnz, \fBdouble\fP *\fBalpha\fP, \fBconst\fP \fBdouble\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBdouble\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cusaxpy\fP (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cusaxpy_\fP (\fBconst\fP \fBint\fP *nnz, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zusaxpy\fP (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zusaxpy_\fP (\fBconst\fP \fBint\fP *nnz, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_susga\fP (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBfloat\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBfloat\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_susga_\fP (\fBconst\fP \fBint\fP *nnz, \fBconst\fP \fBfloat\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBfloat\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dusga\fP (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBdouble\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBdouble\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dusga_\fP (\fBconst\fP \fBint\fP *nnz, \fBconst\fP \fBdouble\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBdouble\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cusga\fP (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cusga_\fP (\fBconst\fP \fBint\fP *nnz, \fBconst\fP \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zusga\fP (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zusga_\fP (\fBconst\fP \fBint\fP *nnz, \fBconst\fP \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_susgz\fP (\fBconst\fP \fBint\fP nnz, \fBfloat\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBfloat\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_susgz_\fP (\fBconst\fP \fBint\fP *nnz, \fBfloat\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBfloat\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dusgz\fP (\fBconst\fP \fBint\fP nnz, \fBdouble\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBdouble\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dusgz_\fP (\fBconst\fP \fBint\fP *nnz, \fBdouble\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBdouble\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cusgz\fP (\fBconst\fP \fBint\fP nnz, \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cusgz_\fP (\fBconst\fP \fBint\fP *nnz, \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zusgz\fP (\fBconst\fP \fBint\fP nnz, \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zusgz_\fP (\fBconst\fP \fBint\fP *nnz, \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_sussc\fP (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBfloat\fP *\fBx\fP, \fBfloat\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_sussc_\fP (\fBconst\fP \fBint\fP *nnz, \fBconst\fP \fBfloat\fP *\fBx\fP, \fBfloat\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dussc\fP (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBdouble\fP *\fBx\fP, \fBdouble\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dussc_\fP (\fBconst\fP \fBint\fP *nnz, \fBconst\fP \fBdouble\fP *\fBx\fP, \fBdouble\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cussc\fP (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBvoid\fP *\fBx\fP, \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cussc_\fP (\fBconst\fP \fBint\fP *nnz, \fBconst\fP \fBvoid\fP *\fBx\fP, \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zussc\fP (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBvoid\fP *\fBx\fP, \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP \fBindex_base\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zussc_\fP (\fBconst\fP \fBint\fP *nnz, \fBconst\fP \fBvoid\fP *\fBx\fP, \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBenum\fP \fBblas_base_type\fP *\fBindex_base\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_susmv\fP (\fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtransA\fP, \fBfloat\fP \fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBfloat\fP *\fBx\fP, \fBconst\fP \fBint\fP \fBincx\fP, \fBfloat\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_susmv_\fP (\fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtransA\fP, \fBfloat\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBfloat\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBincx\fP, \fBfloat\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dusmv\fP (\fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtransA\fP, \fBdouble\fP \fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBdouble\fP *\fBx\fP, \fBconst\fP \fBint\fP \fBincx\fP, \fBdouble\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dusmv_\fP (\fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtransA\fP, \fBdouble\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBdouble\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBincx\fP, \fBdouble\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cusmv\fP (\fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtransA\fP, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP \fBincx\fP, \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cusmv_\fP (\fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtransA\fP, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBincx\fP, \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zusmv\fP (\fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtransA\fP, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP \fBincx\fP, \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP \fBincy\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zusmv_\fP (\fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtransA\fP, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBincx\fP, \fBvoid\fP *\fBy\fP, \fBconst\fP \fBint\fP *\fBincy\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_sussv\fP (\fBenum\fP \fBblas_trans_type\fP \fBtransT\fP, \fBfloat\fP \fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP \fBT\fP, \fBfloat\fP *\fBx\fP, \fBconst\fP \fBint\fP \fBincx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_sussv_\fP (\fBenum\fP \fBblas_trans_type\fP *\fBtransT\fP, \fBfloat\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP *\fBT\fP, \fBfloat\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBincx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dussv\fP (\fBenum\fP \fBblas_trans_type\fP \fBtransT\fP, \fBdouble\fP \fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP \fBT\fP, \fBdouble\fP *\fBx\fP, \fBconst\fP \fBint\fP \fBincx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dussv_\fP (\fBenum\fP \fBblas_trans_type\fP *\fBtransT\fP, \fBdouble\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP *\fBT\fP, \fBdouble\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBincx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cussv\fP (\fBenum\fP \fBblas_trans_type\fP \fBtransT\fP, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP \fBT\fP, \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP \fBincx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cussv_\fP (\fBenum\fP \fBblas_trans_type\fP *\fBtransT\fP, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP *\fBT\fP, \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBincx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zussv\fP (\fBenum\fP \fBblas_trans_type\fP \fBtransT\fP, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP \fBT\fP, \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP \fBincx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zussv_\fP (\fBenum\fP \fBblas_trans_type\fP *\fBtransT\fP, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP *\fBT\fP, \fBvoid\fP *\fBx\fP, \fBconst\fP \fBint\fP *\fBincx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_susmm\fP (\fBconst\fP \fBenum\fP \fBblas_order_type\fP \fBorder\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtransA\fP, \fBconst\fP \fBint\fP \fBnrhs\fP, \fBfloat\fP \fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBfloat\fP *\fBb\fP, \fBconst\fP \fBint\fP \fBldb\fP, \fBfloat\fP *\fBc\fP, \fBconst\fP \fBint\fP \fBldc\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_susmm_\fP (\fBconst\fP \fBenum\fP \fBblas_order_type\fP *\fBorder\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtransA\fP, \fBconst\fP \fBint\fP *\fBnrhs\fP, \fBfloat\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBfloat\fP *\fBb\fP, \fBconst\fP \fBint\fP *\fBldb\fP, \fBfloat\fP *\fBc\fP, \fBconst\fP \fBint\fP *\fBldc\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dusmm\fP (\fBconst\fP \fBenum\fP \fBblas_order_type\fP \fBorder\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtransA\fP, \fBconst\fP \fBint\fP \fBnrhs\fP, \fBdouble\fP \fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBdouble\fP *\fBb\fP, \fBconst\fP \fBint\fP \fBldb\fP, \fBdouble\fP *\fBc\fP, \fBconst\fP \fBint\fP \fBldc\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dusmm_\fP (\fBconst\fP \fBenum\fP \fBblas_order_type\fP *\fBorder\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtransA\fP, \fBconst\fP \fBint\fP *\fBnrhs\fP, \fBdouble\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBdouble\fP *\fBb\fP, \fBconst\fP \fBint\fP *\fBldb\fP, \fBdouble\fP *\fBc\fP, \fBconst\fP \fBint\fP *\fBldc\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cusmm\fP (\fBconst\fP \fBenum\fP \fBblas_order_type\fP \fBorder\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtransA\fP, \fBconst\fP \fBint\fP \fBnrhs\fP, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBvoid\fP *\fBb\fP, \fBconst\fP \fBint\fP \fBldb\fP, \fBvoid\fP *\fBc\fP, \fBconst\fP \fBint\fP \fBldc\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cusmm_\fP (\fBconst\fP \fBenum\fP \fBblas_order_type\fP *\fBorder\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtransA\fP, \fBconst\fP \fBint\fP *\fBnrhs\fP, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBvoid\fP *\fBb\fP, \fBconst\fP \fBint\fP *\fBldb\fP, \fBvoid\fP *\fBc\fP, \fBconst\fP \fBint\fP *\fBldc\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zusmm\fP (\fBconst\fP \fBenum\fP \fBblas_order_type\fP \fBorder\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtransA\fP, \fBconst\fP \fBint\fP \fBnrhs\fP, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBvoid\fP *\fBb\fP, \fBconst\fP \fBint\fP \fBldb\fP, \fBvoid\fP *\fBc\fP, \fBconst\fP \fBint\fP \fBldc\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zusmm_\fP (\fBconst\fP \fBenum\fP \fBblas_order_type\fP *\fBorder\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtransA\fP, \fBconst\fP \fBint\fP *\fBnrhs\fP, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBvoid\fP *\fBb\fP, \fBconst\fP \fBint\fP *\fBldb\fP, \fBvoid\fP *\fBc\fP, \fBconst\fP \fBint\fP *\fBldc\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_sussm\fP (\fBconst\fP \fBenum\fP \fBblas_order_type\fP \fBorder\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtransT\fP, \fBconst\fP \fBint\fP \fBnrhs\fP, \fBfloat\fP \fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP \fBT\fP, \fBfloat\fP *\fBb\fP, \fBconst\fP \fBint\fP \fBldb\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_sussm_\fP (\fBconst\fP \fBenum\fP \fBblas_order_type\fP *\fBorder\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtransT\fP, \fBconst\fP \fBint\fP *\fBnrhs\fP, \fBfloat\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP *\fBT\fP, \fBfloat\fP *\fBb\fP, \fBconst\fP \fBint\fP *\fBldb\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dussm\fP (\fBconst\fP \fBenum\fP \fBblas_order_type\fP \fBorder\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtransT\fP, \fBconst\fP \fBint\fP \fBnrhs\fP, \fBdouble\fP \fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP \fBT\fP, \fBdouble\fP *\fBb\fP, \fBconst\fP \fBint\fP \fBldb\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dussm_\fP (\fBconst\fP \fBenum\fP \fBblas_order_type\fP *\fBorder\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtransT\fP, \fBconst\fP \fBint\fP *\fBnrhs\fP, \fBdouble\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP *\fBT\fP, \fBdouble\fP *\fBb\fP, \fBconst\fP \fBint\fP *\fBldb\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cussm\fP (\fBconst\fP \fBenum\fP \fBblas_order_type\fP \fBorder\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtransT\fP, \fBconst\fP \fBint\fP \fBnrhs\fP, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP \fBT\fP, \fBvoid\fP *\fBb\fP, \fBconst\fP \fBint\fP \fBldb\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cussm_\fP (\fBconst\fP \fBenum\fP \fBblas_order_type\fP *\fBorder\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtransT\fP, \fBconst\fP \fBint\fP *\fBnrhs\fP, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP *\fBT\fP, \fBvoid\fP *\fBb\fP, \fBconst\fP \fBint\fP *\fBldb\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zussm\fP (\fBconst\fP \fBenum\fP \fBblas_order_type\fP \fBorder\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtransT\fP, \fBconst\fP \fBint\fP \fBnrhs\fP, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP \fBT\fP, \fBvoid\fP *\fBb\fP, \fBconst\fP \fBint\fP \fBldb\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zussm_\fP (\fBconst\fP \fBenum\fP \fBblas_order_type\fP *\fBorder\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtransT\fP, \fBconst\fP \fBint\fP *\fBnrhs\fP, \fBconst\fP \fBvoid\fP *\fBalpha\fP, \fBconst\fP \fBblas_sparse_matrix\fP *\fBT\fP, \fBvoid\fP *\fBb\fP, \fBconst\fP \fBint\fP *\fBldb\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBblas_sparse_matrix\fP \fBBLAS_suscr_begin\fP (\fBint\fP \fBm\fP, \fBint\fP \fBn\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_suscr_begin_\fP (\fBint\fP *\fBm\fP, \fBint\fP *\fBn\fP, \fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBblas_sparse_matrix\fP \fBBLAS_duscr_begin\fP (\fBint\fP \fBm\fP, \fBint\fP \fBn\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_duscr_begin_\fP (\fBint\fP *\fBm\fP, \fBint\fP *\fBn\fP, \fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBblas_sparse_matrix\fP \fBBLAS_cuscr_begin\fP (\fBint\fP \fBm\fP, \fBint\fP \fBn\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cuscr_begin_\fP (\fBint\fP *\fBm\fP, \fBint\fP *\fBn\fP, \fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBblas_sparse_matrix\fP \fBBLAS_zuscr_begin\fP (\fBint\fP \fBm\fP, \fBint\fP \fBn\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zuscr_begin_\fP (\fBint\fP *\fBm\fP, \fBint\fP *\fBn\fP, \fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBblas_sparse_matrix\fP \fBBLAS_suscr_block_begin\fP (\fBint\fP \fBMb\fP, \fBint\fP \fBNb\fP, \fBint\fP \fBk\fP, \fBint\fP \fBl\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_suscr_block_begin_\fP (\fBint\fP *\fBMb\fP, \fBint\fP *\fBNb\fP, \fBint\fP *\fBk\fP, \fBint\fP *\fBl\fP, \fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBblas_sparse_matrix\fP \fBBLAS_duscr_block_begin\fP (\fBint\fP \fBMb\fP, \fBint\fP \fBNb\fP, \fBint\fP \fBk\fP, \fBint\fP \fBl\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_duscr_block_begin_\fP (\fBint\fP *\fBMb\fP, \fBint\fP *\fBNb\fP, \fBint\fP *\fBk\fP, \fBint\fP *\fBl\fP, \fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBblas_sparse_matrix\fP \fBBLAS_cuscr_block_begin\fP (\fBint\fP \fBMb\fP, \fBint\fP \fBNb\fP, \fBint\fP \fBk\fP, \fBint\fP \fBl\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cuscr_block_begin_\fP (\fBint\fP *\fBMb\fP, \fBint\fP *\fBNb\fP, \fBint\fP *\fBk\fP, \fBint\fP *\fBl\fP, \fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBblas_sparse_matrix\fP \fBBLAS_zuscr_block_begin\fP (\fBint\fP \fBMb\fP, \fBint\fP \fBNb\fP, \fBint\fP \fBk\fP, \fBint\fP \fBl\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zuscr_block_begin_\fP (\fBint\fP *\fBMb\fP, \fBint\fP *\fBNb\fP, \fBint\fP *\fBk\fP, \fBint\fP *\fBl\fP, \fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBblas_sparse_matrix\fP \fBBLAS_suscr_variable_block_begin\fP (\fBint\fP \fBMb\fP, \fBint\fP \fBNb\fP, \fBconst\fP \fBint\fP *\fBK\fP, \fBconst\fP \fBint\fP *\fBL\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_suscr_variable_block_begin_\fP (\fBint\fP *\fBMb\fP, \fBint\fP *\fBNb\fP, \fBconst\fP \fBint\fP *\fBK\fP, \fBconst\fP \fBint\fP *\fBL\fP, \fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBblas_sparse_matrix\fP \fBBLAS_duscr_variable_block_begin\fP (\fBint\fP \fBMb\fP, \fBint\fP \fBNb\fP, \fBconst\fP \fBint\fP *\fBK\fP, \fBconst\fP \fBint\fP *\fBL\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_duscr_variable_block_begin_\fP (\fBint\fP *\fBMb\fP, \fBint\fP *\fBNb\fP, \fBconst\fP \fBint\fP *\fBK\fP, \fBconst\fP \fBint\fP *\fBL\fP, \fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBblas_sparse_matrix\fP \fBBLAS_cuscr_variable_block_begin\fP (\fBint\fP \fBMb\fP, \fBint\fP \fBNb\fP, \fBconst\fP \fBint\fP *\fBK\fP, \fBconst\fP \fBint\fP *\fBL\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cuscr_variable_block_begin_\fP (\fBint\fP *\fBMb\fP, \fBint\fP *\fBNb\fP, \fBconst\fP \fBint\fP *\fBK\fP, \fBconst\fP \fBint\fP *\fBL\fP, \fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBblas_sparse_matrix\fP \fBBLAS_zuscr_variable_block_begin\fP (\fBint\fP \fBMb\fP, \fBint\fP \fBNb\fP, \fBconst\fP \fBint\fP *\fBK\fP, \fBconst\fP \fBint\fP *\fBL\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zuscr_variable_block_begin_\fP (\fBint\fP *\fBMb\fP, \fBint\fP *\fBNb\fP, \fBconst\fP \fBint\fP *\fBK\fP, \fBconst\fP \fBint\fP *\fBL\fP, \fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_suscr_end\fP (\fBblas_sparse_matrix\fP \fBA\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_suscr_end_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_duscr_end\fP (\fBblas_sparse_matrix\fP \fBA\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_duscr_end_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cuscr_end\fP (\fBblas_sparse_matrix\fP \fBA\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cuscr_end_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zuscr_end\fP (\fBblas_sparse_matrix\fP \fBA\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zuscr_end_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_suscr_insert_entry\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBfloat\fP \fBval\fP, \fBint\fP \fBi\fP, \fBint\fP \fBj\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_suscr_insert_entry_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBfloat\fP *\fBval\fP, \fBint\fP *\fBi\fP, \fBint\fP *\fBj\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_duscr_insert_entry\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBdouble\fP \fBval\fP, \fBint\fP \fBi\fP, \fBint\fP \fBj\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_duscr_insert_entry_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBdouble\fP *\fBval\fP, \fBint\fP *\fBi\fP, \fBint\fP *\fBj\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cuscr_insert_entry\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBint\fP \fBi\fP, \fBint\fP \fBj\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cuscr_insert_entry_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBint\fP *\fBi\fP, \fBint\fP *\fBj\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zuscr_insert_entry\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBint\fP \fBi\fP, \fBint\fP \fBj\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zuscr_insert_entry_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBint\fP *\fBi\fP, \fBint\fP *\fBj\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_suscr_insert_entries\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBint\fP nnz, \fBconst\fP \fBfloat\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBint\fP *\fBjndx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_suscr_insert_entries_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *nnz, \fBconst\fP \fBfloat\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBint\fP *\fBjndx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_duscr_insert_entries\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBint\fP nnz, \fBconst\fP \fBdouble\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBint\fP *\fBjndx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_duscr_insert_entries_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *nnz, \fBconst\fP \fBdouble\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBint\fP *\fBjndx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cuscr_insert_entries\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBint\fP nnz, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBint\fP *\fBjndx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cuscr_insert_entries_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *nnz, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBint\fP *\fBjndx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zuscr_insert_entries\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBint\fP nnz, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBint\fP *\fBjndx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zuscr_insert_entries_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *nnz, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBint\fP *\fBjndx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_suscr_insert_col\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBint\fP \fBj\fP, \fBint\fP nnz, \fBconst\fP \fBfloat\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_suscr_insert_col_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBj\fP, \fBint\fP *nnz, \fBconst\fP \fBfloat\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_duscr_insert_col\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBint\fP \fBj\fP, \fBint\fP nnz, \fBconst\fP \fBdouble\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_duscr_insert_col_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBj\fP, \fBint\fP *nnz, \fBconst\fP \fBdouble\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cuscr_insert_col\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBint\fP \fBj\fP, \fBint\fP nnz, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cuscr_insert_col_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBj\fP, \fBint\fP *nnz, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zuscr_insert_col\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBint\fP \fBj\fP, \fBint\fP nnz, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zuscr_insert_col_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBj\fP, \fBint\fP *nnz, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_suscr_insert_row\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBint\fP \fBi\fP, \fBint\fP nnz, \fBconst\fP \fBfloat\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_suscr_insert_row_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBi\fP, \fBint\fP *nnz, \fBconst\fP \fBfloat\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_duscr_insert_row\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBint\fP \fBi\fP, \fBint\fP nnz, \fBconst\fP \fBdouble\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_duscr_insert_row_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBi\fP, \fBint\fP *nnz, \fBconst\fP \fBdouble\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cuscr_insert_row\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBint\fP \fBi\fP, \fBint\fP nnz, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cuscr_insert_row_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBi\fP, \fBint\fP *nnz, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zuscr_insert_row\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBint\fP \fBi\fP, \fBint\fP nnz, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zuscr_insert_row_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBi\fP, \fBint\fP *nnz, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_suscr_insert_clique\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP \fBk\fP, \fBconst\fP \fBint\fP \fBl\fP, \fBconst\fP \fBfloat\fP *\fBval\fP, \fBconst\fP \fBint\fP \fBrow_stride\fP, \fBconst\fP \fBint\fP \fBcol_stride\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBint\fP *\fBjndx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_suscr_insert_clique_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBk\fP, \fBconst\fP \fBint\fP *\fBl\fP, \fBconst\fP \fBfloat\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBrow_stride\fP, \fBconst\fP \fBint\fP *\fBcol_stride\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBint\fP *\fBjndx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_duscr_insert_clique\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP \fBk\fP, \fBconst\fP \fBint\fP \fBl\fP, \fBconst\fP \fBdouble\fP *\fBval\fP, \fBconst\fP \fBint\fP \fBrow_stride\fP, \fBconst\fP \fBint\fP \fBcol_stride\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBint\fP *\fBjndx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_duscr_insert_clique_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBk\fP, \fBconst\fP \fBint\fP *\fBl\fP, \fBconst\fP \fBdouble\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBrow_stride\fP, \fBconst\fP \fBint\fP *\fBcol_stride\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBint\fP *\fBjndx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cuscr_insert_clique\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP \fBk\fP, \fBconst\fP \fBint\fP \fBl\fP, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBconst\fP \fBint\fP \fBrow_stride\fP, \fBconst\fP \fBint\fP \fBcol_stride\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBint\fP *\fBjndx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cuscr_insert_clique_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBk\fP, \fBconst\fP \fBint\fP *\fBl\fP, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBrow_stride\fP, \fBconst\fP \fBint\fP *\fBcol_stride\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBint\fP *\fBjndx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zuscr_insert_clique\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP \fBk\fP, \fBconst\fP \fBint\fP \fBl\fP, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBconst\fP \fBint\fP \fBrow_stride\fP, \fBconst\fP \fBint\fP \fBcol_stride\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBint\fP *\fBjndx\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zuscr_insert_clique_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBk\fP, \fBconst\fP \fBint\fP *\fBl\fP, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBconst\fP \fBint\fP *\fBrow_stride\fP, \fBconst\fP \fBint\fP *\fBcol_stride\fP, \fBconst\fP \fBint\fP *\fBindx\fP, \fBconst\fP \fBint\fP *\fBjndx\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_suscr_insert_block\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBfloat\fP *\fBval\fP, \fBint\fP \fBrow_stride\fP, \fBint\fP \fBcol_stride\fP, \fBint\fP \fBi\fP, \fBint\fP \fBj\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_suscr_insert_block_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBfloat\fP *\fBval\fP, \fBint\fP *\fBrow_stride\fP, \fBint\fP *\fBcol_stride\fP, \fBint\fP *\fBi\fP, \fBint\fP *\fBj\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_duscr_insert_block\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBdouble\fP *\fBval\fP, \fBint\fP \fBrow_stride\fP, \fBint\fP \fBcol_stride\fP, \fBint\fP \fBi\fP, \fBint\fP \fBj\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_duscr_insert_block_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBdouble\fP *\fBval\fP, \fBint\fP *\fBrow_stride\fP, \fBint\fP *\fBcol_stride\fP, \fBint\fP *\fBi\fP, \fBint\fP *\fBj\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cuscr_insert_block\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBint\fP \fBrow_stride\fP, \fBint\fP \fBcol_stride\fP, \fBint\fP \fBi\fP, \fBint\fP \fBj\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cuscr_insert_block_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBint\fP *\fBrow_stride\fP, \fBint\fP *\fBcol_stride\fP, \fBint\fP *\fBi\fP, \fBint\fP *\fBj\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zuscr_insert_block\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBint\fP \fBrow_stride\fP, \fBint\fP \fBcol_stride\fP, \fBint\fP \fBi\fP, \fBint\fP \fBj\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zuscr_insert_block_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBvoid\fP *\fBval\fP, \fBint\fP *\fBrow_stride\fP, \fBint\fP *\fBcol_stride\fP, \fBint\fP *\fBi\fP, \fBint\fP *\fBj\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_uscr_end\fP (\fBblas_sparse_matrix\fP \fBA\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_uscr_end_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_usds\fP (\fBblas_sparse_matrix\fP \fBA\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_usds_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_susrows_scale\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBfloat\fP *\fBd\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtrans\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_susrows_scale_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBfloat\fP *\fBd\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtrans\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dusrows_scale\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBdouble\fP *\fBd\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtrans\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dusrows_scale_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBdouble\fP *\fBd\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtrans\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cusrows_scale\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBvoid\fP *\fBd\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtrans\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cusrows_scale_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBvoid\fP *\fBd\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtrans\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zusrows_scale\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBvoid\fP *\fBd\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtrans\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zusrows_scale_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBvoid\fP *\fBd\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtrans\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_susget_diag\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBfloat\fP *\fBd\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_susget_diag_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBfloat\fP *\fBd\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dusget_diag\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBdouble\fP *\fBd\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dusget_diag_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBdouble\fP *\fBd\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cusget_diag\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBvoid\fP *\fBd\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cusget_diag_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBvoid\fP *\fBd\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zusget_diag\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBvoid\fP *\fBd\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zusget_diag_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBvoid\fP *\fBd\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_susget_rows_nnz\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP \fBfr\fP, \fBconst\fP \fBint\fP \fBlr\fP, \fBint\fP *\fBnnzp\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_susget_rows_nnz_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBfr\fP, \fBconst\fP \fBint\fP *\fBlr\fP, \fBint\fP *\fBnnzp\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dusget_rows_nnz\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP \fBfr\fP, \fBconst\fP \fBint\fP \fBlr\fP, \fBint\fP *\fBnnzp\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dusget_rows_nnz_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBfr\fP, \fBconst\fP \fBint\fP *\fBlr\fP, \fBint\fP *\fBnnzp\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cusget_rows_nnz\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP \fBfr\fP, \fBconst\fP \fBint\fP \fBlr\fP, \fBint\fP *\fBnnzp\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cusget_rows_nnz_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBfr\fP, \fBconst\fP \fBint\fP *\fBlr\fP, \fBint\fP *\fBnnzp\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zusget_rows_nnz\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP \fBfr\fP, \fBconst\fP \fBint\fP \fBlr\fP, \fBint\fP *\fBnnzp\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zusget_rows_nnz_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBfr\fP, \fBconst\fP \fBint\fP *\fBlr\fP, \fBint\fP *\fBnnzp\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_susget_rows_sparse\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBfloat\fP *\fBVA\fP, \fBint\fP *\fBIA\fP, \fBint\fP *\fBJA\fP, \fBint\fP *nnz, \fBconst\fP \fBint\fP \fBfr\fP, \fBconst\fP \fBint\fP \fBlr\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_susget_rows_sparse_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBfloat\fP *\fBVA\fP, \fBint\fP *\fBIA\fP, \fBint\fP *\fBJA\fP, \fBint\fP *nnz, \fBconst\fP \fBint\fP *\fBfr\fP, \fBconst\fP \fBint\fP *\fBlr\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dusget_rows_sparse\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBdouble\fP *\fBVA\fP, \fBint\fP *\fBIA\fP, \fBint\fP *\fBJA\fP, \fBint\fP *nnz, \fBconst\fP \fBint\fP \fBfr\fP, \fBconst\fP \fBint\fP \fBlr\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dusget_rows_sparse_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBdouble\fP *\fBVA\fP, \fBint\fP *\fBIA\fP, \fBint\fP *\fBJA\fP, \fBint\fP *nnz, \fBconst\fP \fBint\fP *\fBfr\fP, \fBconst\fP \fBint\fP *\fBlr\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cusget_rows_sparse\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBvoid\fP *\fBVA\fP, \fBint\fP *\fBIA\fP, \fBint\fP *\fBJA\fP, \fBint\fP *nnz, \fBconst\fP \fBint\fP \fBfr\fP, \fBconst\fP \fBint\fP \fBlr\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cusget_rows_sparse_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBvoid\fP *\fBVA\fP, \fBint\fP *\fBIA\fP, \fBint\fP *\fBJA\fP, \fBint\fP *nnz, \fBconst\fP \fBint\fP *\fBfr\fP, \fBconst\fP \fBint\fP *\fBlr\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zusget_rows_sparse\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBvoid\fP *\fBVA\fP, \fBint\fP *\fBIA\fP, \fBint\fP *\fBJA\fP, \fBint\fP *nnz, \fBconst\fP \fBint\fP \fBfr\fP, \fBconst\fP \fBint\fP \fBlr\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zusget_rows_sparse_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBvoid\fP *\fBVA\fP, \fBint\fP *\fBIA\fP, \fBint\fP *\fBJA\fP, \fBint\fP *nnz, \fBconst\fP \fBint\fP *\fBfr\fP, \fBconst\fP \fBint\fP *\fBlr\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_susget_matrix_nnz\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBint\fP *nnz)" .br .ti -1c .RI "\fBvoid\fP \fBblas_susget_matrix_nnz_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *nnz, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dusget_matrix_nnz\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBint\fP *nnz)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dusget_matrix_nnz_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *nnz, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cusget_matrix_nnz\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBint\fP *nnz)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cusget_matrix_nnz_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *nnz, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zusget_matrix_nnz\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBint\fP *nnz)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zusget_matrix_nnz_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBint\fP *nnz, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_susget_infinity_norm\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBfloat\fP *\fBin\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtrans\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_susget_infinity_norm_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBfloat\fP *\fBin\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtrans\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dusget_infinity_norm\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBdouble\fP *\fBin\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtrans\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dusget_infinity_norm_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBdouble\fP *\fBin\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtrans\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cusget_infinity_norm\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBvoid\fP *\fBin\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtrans\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cusget_infinity_norm_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBvoid\fP *\fBin\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtrans\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zusget_infinity_norm\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBvoid\fP *\fBin\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP \fBtrans\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zusget_infinity_norm_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBvoid\fP *\fBin\fP, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP *\fBtrans\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_susset_elements\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP *\fBia\fP, \fBconst\fP \fBint\fP *\fBja\fP, \fBconst\fP \fBfloat\fP *\fBva\fP, \fBconst\fP \fBint\fP nnz)" .br .ti -1c .RI "\fBvoid\fP \fBblas_susset_elements_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBia\fP, \fBconst\fP \fBint\fP *\fBja\fP, \fBconst\fP \fBfloat\fP *\fBva\fP, \fBconst\fP \fBint\fP *nnz, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dusset_elements\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP *\fBia\fP, \fBconst\fP \fBint\fP *\fBja\fP, \fBconst\fP \fBdouble\fP *\fBva\fP, \fBconst\fP \fBint\fP nnz)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dusset_elements_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBia\fP, \fBconst\fP \fBint\fP *\fBja\fP, \fBconst\fP \fBdouble\fP *\fBva\fP, \fBconst\fP \fBint\fP *nnz, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cusset_elements\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP *\fBia\fP, \fBconst\fP \fBint\fP *\fBja\fP, \fBconst\fP \fBvoid\fP *\fBva\fP, \fBconst\fP \fBint\fP nnz)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cusset_elements_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBia\fP, \fBconst\fP \fBint\fP *\fBja\fP, \fBconst\fP \fBvoid\fP *\fBva\fP, \fBconst\fP \fBint\fP *nnz, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zusset_elements\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP *\fBia\fP, \fBconst\fP \fBint\fP *\fBja\fP, \fBconst\fP \fBvoid\fP *\fBva\fP, \fBconst\fP \fBint\fP nnz)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zusset_elements_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBia\fP, \fBconst\fP \fBint\fP *\fBja\fP, \fBconst\fP \fBvoid\fP *\fBva\fP, \fBconst\fP \fBint\fP *nnz, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_susset_element\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP \fBi\fP, \fBconst\fP \fBint\fP \fBj\fP, \fBfloat\fP *\fBv\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_susset_element_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBi\fP, \fBconst\fP \fBint\fP *\fBj\fP, \fBfloat\fP *\fBv\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dusset_element\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP \fBi\fP, \fBconst\fP \fBint\fP \fBj\fP, \fBdouble\fP *\fBv\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dusset_element_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBi\fP, \fBconst\fP \fBint\fP *\fBj\fP, \fBdouble\fP *\fBv\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cusset_element\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP \fBi\fP, \fBconst\fP \fBint\fP \fBj\fP, \fBvoid\fP *\fBv\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cusset_element_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBi\fP, \fBconst\fP \fBint\fP *\fBj\fP, \fBvoid\fP *\fBv\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zusset_element\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP \fBi\fP, \fBconst\fP \fBint\fP \fBj\fP, \fBvoid\fP *\fBv\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zusset_element_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBi\fP, \fBconst\fP \fBint\fP *\fBj\fP, \fBvoid\fP *\fBv\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_susget_element\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP \fBi\fP, \fBconst\fP \fBint\fP \fBj\fP, \fBfloat\fP *\fBv\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_susget_element_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBi\fP, \fBconst\fP \fBint\fP *\fBj\fP, \fBfloat\fP *\fBv\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_dusget_element\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP \fBi\fP, \fBconst\fP \fBint\fP \fBj\fP, \fBdouble\fP *\fBv\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_dusget_element_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBi\fP, \fBconst\fP \fBint\fP *\fBj\fP, \fBdouble\fP *\fBv\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_cusget_element\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP \fBi\fP, \fBconst\fP \fBint\fP \fBj\fP, \fBvoid\fP *\fBv\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_cusget_element_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBi\fP, \fBconst\fP \fBint\fP *\fBj\fP, \fBvoid\fP *\fBv\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_zusget_element\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBconst\fP \fBint\fP \fBi\fP, \fBconst\fP \fBint\fP \fBj\fP, \fBvoid\fP *\fBv\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_zusget_element_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBconst\fP \fBint\fP *\fBi\fP, \fBconst\fP \fBint\fP *\fBj\fP, \fBvoid\fP *\fBv\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_usgp\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBrsb_blas_pname_t\fP \fBpname\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_usgp_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBrsb_blas_pname_t\fP *\fBpname\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBvoid\fP \fBblas_ussp_\fP (\fBblas_sparse_matrix\fP *\fBA\fP, \fBrsb_blas_pname_t\fP *\fBpname\fP, \fBint\fP *\fBistat\fP)" .br .ti -1c .RI "\fBint\fP \fBBLAS_ussp\fP (\fBblas_sparse_matrix\fP \fBA\fP, \fBrsb_blas_pname_t\fP \fBpname\fP)" .br .ti -1c .RI "\fBblas_sparse_matrix\fP \fBrsb_blas_file_mtx_load\fP (\fBconst\fP \fBrsb_char_t\fP *\fBfilename\fP, \fBrsb_type_t\fP \fBtypecode\fP)" .br .ti -1c .RI "\fBstruct\fP \fBrsb_mtx_t\fP * \fBrsb_blas_get_mtx\fP (\fBblas_sparse_matrix\fP \fBA\fP)" .br .in -1c .SH "Detailed Description" .PP A Sparse BLAS interface (see http://www.netlib.org/blas/blast-forum/) to \fClibrsb\fP\&. Level 1 (vector-vector operations) is supported in a basic way\&. Level 2 (sparse matrix-dense vector operations) is supported fully\&. Level 3 (sparse matrix-dense matrix operations) is supported as a wrapper around Level 2\&. We also implement a number of useful extra functions as custom extensions, giving access to other \fClibrsb\fP functionality\&. .PP The usage pattern of this interface matches that of the Sparse BLAS standard, exception made for the necessity of initialization/finalization of \fClibrsb\fP\&. The Sparse BLAS interface is also available for Fortran: see \fBrsb_blas_sparse\&.F90\fP\&. .PP The user should be aware of the following: .PD 0 .IP "\(bu" 1 Because this Sparse BLAS implementation is built around \fClibrsb\fP, initialization with \fBrsb_lib_init()\fP and finalization with \fBrsb_lib_exit()\fP is necessary\&. Inclusion of the \fC\fBrsb\&.h\fP\fP header is necessary\&. .IP "\(bu" 1 \fClibrsb\fP gives users freedom of in/out arbitrarily BLAS types support at configure/build time\&. Hence, while all the interface functions are always included the Sparse BLAS header file, they may return an error code\&. Be sure of having configured correctly the library at configure time (and see the \fBblas_sparse\&.h\fP header file for types configured in the current build)\&. .IP "\(bu" 1 According to the standard, the complex type functions for C accept scalar values by reference rather than by copy; equivalent functions for other types do not do so, so this may cause confusion\&. Be careful\&. .IP "\(bu" 1 Error checking is weak; so for instance, passing a function the handle of a matrix of mismatching type will not be detected as an error, although it's incorrect\&. .IP "\(bu" 1 According to the standard, VBR and BCSR styled constructors are supported, although these are interfaces for \fClibrsb's\fP own matrix representation\&. .IP "\(bu" 1 Here functions for both Fortran and C are listed\&. The Fortran functions are declared and documented with the C notation\&. We may provide a better documentation in a future release\&. .IP "\(bu" 1 Each identifier documented here suffixed by \fC_\fP (e\&.g\&.: \fBblas_susdot_()\fP) can be used from Fortran with the name stripped by that suffix (so in this case, \fCblas_susdot\fP)\&. We may provide a proper fix to this inconvenience in a subsequent release\&. .IP "\(bu" 1 Each Fortran program using \fClibrsb's\fP Sparse BLAS Implementation shall \fCuse\fP modules \fC\fBblas_sparse\fP\fP and \fCrsb\fP\&. .IP "\(bu" 1 Also Fortran programs have to call \fBrsb_lib_init()\fP and \fBrsb_lib_exit()\fP e\&.g\&.: .PP .nf USE blas_sparse ! module implementing the Sparse BLAS on the top of librsb USE rsb ! rsb module \&.\&.\&. INTEGER :: istat ! integer variable \&.\&.\&. istat = rsb_lib_init(RSB_NULL_INIT_OPTIONS) ! please note that this is not part of Sparse BLAS but it is needed by librsb if(istat\&.NE\&.0)STOP ! a value different than zero signals an error \&.\&.\&. ! code calling Sparse BLAS routines \&.\&.\&. istat = rsb_lib_exit(RSB_NULL_EXIT_OPTIONS) ! please note that this is not part of Sparse BLAS but it is needed by librsb if(istat\&.NE\&.0)STOP ! a value different than zero signals an error \&.\&.\&. .fi .PP .IP "\(bu" 1 For Fortran, more procedures exist, although they are not documented here\&. According to the Sparse BLAS (http://www.netlib.org/blas/blast-forum/), for almost each subroutine whose identifier prefixed with \fCblas_X\fP (with \fCX\fP being one of S,D,C,Z), a corresponding generic modern Fortran version exists\&. Please note how not all of the certain procedures identifier prefixes include the type character\&. .PP E\&.g\&.: .PP .nf ! the following code ('d' stays for 'double precision'): CALL blas_duscr_begin(nr,nc,A,istat) CALL blas_ussp(A,blas_lower_symmetric,istat) CALL blas_duscr_insert_entries(A,nnz,VA,IA,JA,istat) CALL blas_duscr_end(A,istat) CALL blas_dusmv(transT,alpha,A,X,incX,B,incB,istat) CALL blas_dusds(A,istat) ! is equivalent to: CALL duscr_begin(nr,nc,A,istat) ! here, 'd' must be retained for avoiding ambiguity CALL ussp(A,blas_lower_symmetric,istat) CALL uscr_insert_entries(A,nnz,VA,IA,JA,istat) CALL uscr_end(A,istat) CALL usmv(transT,alpha,A,X,incX,B,incB,istat) CALL usds(A,istat) .fi .PP .SH "Function Documentation" .PP .SS "\fBint\fP BLAS_cusaxpy (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBvoid\fP * x, \fBconst\fP \fBint\fP * indx, \fBvoid\fP * y, \fBconst\fP \fBint\fP incy, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse vector update: $Y <- alpha X + Y$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&. .br \fIalpha\fP Will scale values of $X$ before accumulating to $Y$\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_cusaxpy_ (\fBconst\fP \fBint\fP * nnz, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBvoid\fP * x, \fBconst\fP \fBint\fP * indx, \fBvoid\fP * y, \fBconst\fP \fBint\fP * incy, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse vector update: $Y <- alpha X + Y$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&. .br \fIalpha\fP Will scale values of $X$ before accumulating to $Y$\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBblas_sparse_matrix\fP BLAS_cuscr_begin (\fBint\fP m, \fBint\fP n)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIm\fP Is the count of rows\&. .br \fIn\fP Is the count of columns\&. .RE .PP \fBReturns\fP .RS 4 A matrix handle in case of success, or -1 on error\&. .RE .PP .SS "\fBvoid\fP blas_cuscr_begin_ (\fBint\fP * m, \fBint\fP * n, \fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIm\fP Is the count of rows\&. .br \fIn\fP Is the count of columns\&. .br \fIA\fP A valid pointer to an empty matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br Will assign a valid matrix handle to $A$ in case of success, or set it to -1 on error\&. .RE .PP .SS "\fBblas_sparse_matrix\fP BLAS_cuscr_block_begin (\fBint\fP Mb, \fBint\fP Nb, \fBint\fP k, \fBint\fP l)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIk,l\fP Are row and column dimensions when specifying a matrix as BCSR\&. .br \fIMb\fP Block rows count\&. .br \fINb\fP Block columns count\&. .RE .PP \fBReturns\fP .RS 4 A matrix handle in case of success, or -1 on error\&. .RE .PP .SS "\fBvoid\fP blas_cuscr_block_begin_ (\fBint\fP * Mb, \fBint\fP * Nb, \fBint\fP * k, \fBint\fP * l, \fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIk,l\fP Are row and column dimensions when specifying a matrix as BCSR\&. .br \fIMb\fP Block rows count\&. .br \fINb\fP Block columns count\&. .br \fIA\fP A valid pointer to an empty matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br Will assign a valid matrix handle to $A$ in case of success, or set it to -1 on error\&. .RE .PP .SS "\fBint\fP BLAS_cuscr_end (\fBblas_sparse_matrix\fP A)" Makes an assembled matrix out of a matrix in build state\&. After this, it is not possible anymore to insert nonzeroes, but computational routines\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cuscr_end_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Makes an assembled matrix out of a matrix in build state\&. After this, it is not possible anymore to insert nonzeroes, but computational routines\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cuscr_insert_block (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBvoid\fP * val, \fBint\fP row_stride, \fBint\fP col_stride, \fBint\fP i, \fBint\fP j)" Inserts a whole block in a matrix, assuming it is in build state\&. The block size is assumed to be the one specified when calling the (type) corresponding matrix blocked \fCbegin\fP function\&. If not called a blocked \fCbegin\fP function, will assume 1x1 (that is, no) blocking\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIval\fP Array of values\&. .br \fIrow_stride,col_stride\fP Row and column strides in accessing \fCval\fP\&. .br \fIi,j\fP Block row/column indices\&. .RE .PP \fBWarning\fP .RS 4 Signature of this routine for Fortran does not agree to the standard\&. This shall be corrected in a future release\&. .RE .PP \fBSee also\fP .RS 4 \fBBLAS_cuscr_block_begin\fP, \fBBLAS_cuscr_block_begin\fP, \fBBLAS_duscr_block_begin\fP, \fBBLAS_zuscr_block_begin\fP, \fBBLAS_cuscr_begin\fP, \fBBLAS_suscr_begin\fP, \fBBLAS_duscr_begin\fP, \fBBLAS_zuscr_begin\fP\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cuscr_insert_block_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBvoid\fP * val, \fBint\fP * row_stride, \fBint\fP * col_stride, \fBint\fP * i, \fBint\fP * j, \fBint\fP * istat)" Inserts a whole block in a matrix, assuming it is in build state\&. The block size is assumed to be the one specified when calling the (type) corresponding matrix blocked \fCbegin\fP function\&. If not called a blocked \fCbegin\fP function, will assume 1x1 (that is, no) blocking\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIval\fP Array of values\&. .br \fIrow_stride,col_stride\fP Row and column strides in accessing \fCval\fP\&. .br \fIi,j\fP Block row/column indices\&. .RE .PP \fBWarning\fP .RS 4 Signature of this routine for Fortran does not agree to the standard\&. This shall be corrected in a future release\&. .RE .PP \fBSee also\fP .RS 4 \fBBLAS_cuscr_block_begin\fP, \fBBLAS_cuscr_block_begin\fP, \fBBLAS_duscr_block_begin\fP, \fBBLAS_zuscr_block_begin\fP, \fBBLAS_cuscr_begin\fP, \fBBLAS_suscr_begin\fP, \fBBLAS_duscr_begin\fP, \fBBLAS_zuscr_begin\fP\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cuscr_insert_clique (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP k, \fBconst\fP \fBint\fP l, \fBconst\fP \fBvoid\fP * val, \fBconst\fP \fBint\fP row_stride, \fBconst\fP \fBint\fP col_stride, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBint\fP * jndx)" Inserts a whole clique in a matrix, assuming this is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIk,l\fP Clique rows and columns count\&. .br \fIval\fP Array of values\&. .br \fIrow_stride,col_stride\fP Row/columns stride in accessing the clique\&. .br \fIindx,jndx\fP Row/column indices arrays\&. .RE .PP \fBWarning\fP .RS 4 Signature of this routine for Fortran does not agree to the standard\&. This shall be corrected in a future release\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cuscr_insert_clique_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * k, \fBconst\fP \fBint\fP * l, \fBconst\fP \fBvoid\fP * val, \fBconst\fP \fBint\fP * row_stride, \fBconst\fP \fBint\fP * col_stride, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBint\fP * jndx, \fBint\fP * istat)" Inserts a whole clique in a matrix, assuming this is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIk,l\fP Clique rows and columns count\&. .br \fIval\fP Array of values\&. .br \fIrow_stride,col_stride\fP Row/columns stride in accessing the clique\&. .br \fIindx,jndx\fP Row/column indices arrays\&. .RE .PP \fBWarning\fP .RS 4 Signature of this routine for Fortran does not agree to the standard\&. This shall be corrected in a future release\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cuscr_insert_col (\fBblas_sparse_matrix\fP A, \fBint\fP j, \fBint\fP nnz, \fBconst\fP \fBvoid\fP * val, \fBconst\fP \fBint\fP * indx)" Inserts a whole column in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIj\fP Column index\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row indices array\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cuscr_insert_col_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * j, \fBint\fP * nnz, \fBconst\fP \fBvoid\fP * val, \fBconst\fP \fBint\fP * indx, \fBint\fP * istat)" Inserts a whole column in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIj\fP Column index\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row indices array\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cuscr_insert_entries (\fBblas_sparse_matrix\fP A, \fBint\fP nnz, \fBconst\fP \fBvoid\fP * val, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBint\fP * jndx)" Inserts entries in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row indices array\&. .br \fIjndx\fP Column indices array\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cuscr_insert_entries_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * nnz, \fBconst\fP \fBvoid\fP * val, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBint\fP * jndx, \fBint\fP * istat)" Inserts entries in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row indices array\&. .br \fIjndx\fP Column indices array\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cuscr_insert_entry (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBvoid\fP * val, \fBint\fP i, \fBint\fP j)" Inserts an entry in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIval\fP Array of values\&. .br \fIval\fP Array of values\&. .br \fIi,j\fP Row and column indices\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cuscr_insert_entry_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBvoid\fP * val, \fBint\fP * i, \fBint\fP * j, \fBint\fP * istat)" Inserts an entry in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIval\fP Array of values\&. .br \fIval\fP Array of values\&. .br \fIi,j\fP Row and column indices\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cuscr_insert_row (\fBblas_sparse_matrix\fP A, \fBint\fP i, \fBint\fP nnz, \fBconst\fP \fBvoid\fP * val, \fBconst\fP \fBint\fP * indx)" Inserts a whole row in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row index\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cuscr_insert_row_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * i, \fBint\fP * nnz, \fBconst\fP \fBvoid\fP * val, \fBconst\fP \fBint\fP * indx, \fBint\fP * istat)" Inserts a whole row in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row index\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBblas_sparse_matrix\fP BLAS_cuscr_variable_block_begin (\fBint\fP Mb, \fBint\fP Nb, \fBconst\fP \fBint\fP * K, \fBconst\fP \fBint\fP * L)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIK,L\fP Are arrays specifying row/column block sizes when specifying a matrix as VBR\&. .br \fIMb\fP Block rows count\&. .br \fINb\fP Block columns count\&. .RE .PP \fBReturns\fP .RS 4 A matrix handle in case of success, or -1 on error\&. .RE .PP .SS "\fBvoid\fP blas_cuscr_variable_block_begin_ (\fBint\fP * Mb, \fBint\fP * Nb, \fBconst\fP \fBint\fP * K, \fBconst\fP \fBint\fP * L, \fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIK,L\fP Are arrays specifying row/column block sizes when specifying a matrix as VBR\&. .br \fIMb\fP Block rows count\&. .br \fINb\fP Block columns count\&. .br \fIA\fP A valid pointer to an empty matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br Will assign a valid matrix handle to $A$ in case of success, or set it to -1 on error\&. .RE .PP .SS "\fBint\fP BLAS_cusdot (\fBconst\fP \fBenum\fP \fBblas_conj_type\fP conj, \fBconst\fP \fBint\fP nnz, \fBconst\fP \fBvoid\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBvoid\fP * y, \fBconst\fP \fBint\fP incy, \fBvoid\fP * r, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse dot product\&. $r <- X^T Y,$ $r <- X^H Y$ .PP \fBParameters\fP .RS 4 \fIr\fP Sparse dot result array\&. .br \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&. .br \fIconj\fP If \fBblas_conj\fP, values of X will be considered conjugated\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_cusdot_ (\fBconst\fP \fBenum\fP \fBblas_conj_type\fP * conj, \fBconst\fP \fBint\fP * nnz, \fBconst\fP \fBvoid\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBvoid\fP * y, \fBconst\fP \fBint\fP * incy, \fBvoid\fP * r, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse dot product\&. $r <- X^T Y,$ $r <- X^H Y$ .PP \fBParameters\fP .RS 4 \fIr\fP Sparse dot result array\&. .br \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&. .br \fIconj\fP If \fBblas_conj\fP, values of X will be considered conjugated\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBint\fP BLAS_cusga (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBvoid\fP * y, \fBconst\fP \fBint\fP incy, \fBvoid\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse gather\&. $X <- Y |_x$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_cusga_ (\fBconst\fP \fBint\fP * nnz, \fBconst\fP \fBvoid\fP * y, \fBconst\fP \fBint\fP * incy, \fBvoid\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse gather\&. $X <- Y |_x$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBint\fP BLAS_cusget_diag (\fBblas_sparse_matrix\fP A, \fBvoid\fP * d)" Get matrix diagonal\&. $d <- diag(A)$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fId\fP Array for the diagonal entries\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cusget_diag_ (\fBblas_sparse_matrix\fP * A, \fBvoid\fP * d, \fBint\fP * istat)" Get matrix diagonal\&. $d <- diag(A)$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fId\fP Array for the diagonal entries\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cusget_element (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP i, \fBconst\fP \fBint\fP j, \fBvoid\fP * v)" Get a single matrix nonzero coefficient $A_{i,j}$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fIj\fP Column index\&. .br \fIv\fP Value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cusget_element_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * i, \fBconst\fP \fBint\fP * j, \fBvoid\fP * v, \fBint\fP * istat)" Get a single matrix nonzero coefficient $A_{i,j}$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fIj\fP Column index\&. .br \fIv\fP Value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cusget_infinity_norm (\fBblas_sparse_matrix\fP A, \fBvoid\fP * in, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP trans)" Get infinity norm of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIin\fP Infinity norm pointer\&. .br \fItrans\fP Transposition parameter\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cusget_infinity_norm_ (\fBblas_sparse_matrix\fP * A, \fBvoid\fP * in, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP * trans, \fBint\fP * istat)" Get infinity norm of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIin\fP Infinity norm pointer\&. .br \fItrans\fP Transposition parameter\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cusget_matrix_nnz (\fBblas_sparse_matrix\fP A, \fBint\fP * nnz)" Get nnz count of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fInnz\fP Output value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cusget_matrix_nnz_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * nnz, \fBint\fP * istat)" Get nnz count of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fInnz\fP Output value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cusget_rows_nnz (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP fr, \fBconst\fP \fBint\fP lr, \fBint\fP * nnzp)" Get nnz count of matrix row interval\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIfr\fP First row\&. .br \fIlr\fP Last row\&. .br \fInnzp\fP Pointer to the nonzeroes variable\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cusget_rows_nnz_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * fr, \fBconst\fP \fBint\fP * lr, \fBint\fP * nnzp, \fBint\fP * istat)" Get nnz count of matrix row interval\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIfr\fP First row\&. .br \fIlr\fP Last row\&. .br \fInnzp\fP Pointer to the nonzeroes variable\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cusget_rows_sparse (\fBblas_sparse_matrix\fP A, \fBvoid\fP * VA, \fBint\fP * IA, \fBint\fP * JA, \fBint\fP * nnz, \fBconst\fP \fBint\fP fr, \fBconst\fP \fBint\fP lr)" Get sparse rows of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIVA\fP pointer to values\&. .br \fIIA\fP Row indices array\&. .br \fIJA\fP Column indices array\&. .br \fInnz\fP Obtained nonzeroes\&. .br \fIfr\fP first row\&. .br \fIlr\fP Last row\&. .br .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cusget_rows_sparse_ (\fBblas_sparse_matrix\fP * A, \fBvoid\fP * VA, \fBint\fP * IA, \fBint\fP * JA, \fBint\fP * nnz, \fBconst\fP \fBint\fP * fr, \fBconst\fP \fBint\fP * lr, \fBint\fP * istat)" Get sparse rows of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIVA\fP pointer to values\&. .br \fIIA\fP Row indices array\&. .br \fIJA\fP Column indices array\&. .br \fInnz\fP Obtained nonzeroes\&. .br \fIfr\fP first row\&. .br \fIlr\fP Last row\&. .br .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cusgz (\fBconst\fP \fBint\fP nnz, \fBvoid\fP * y, \fBconst\fP \fBint\fP incy, \fBvoid\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse gather and zero\&. $X <- Y |_x;Y|_x <- 0$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_cusgz_ (\fBconst\fP \fBint\fP * nnz, \fBvoid\fP * y, \fBconst\fP \fBint\fP * incy, \fBvoid\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse gather and zero\&. $X <- Y |_x;Y|_x <- 0$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBint\fP BLAS_cusmm (\fBconst\fP \fBenum\fP \fBblas_order_type\fP order, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP transA, \fBconst\fP \fBint\fP nrhs, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP A, \fBconst\fP \fBvoid\fP * b, \fBconst\fP \fBint\fP ldb, \fBvoid\fP * c, \fBconst\fP \fBint\fP ldc)" Multiply by a dense matrix (aka multi-vector)\&. Either of $C <- alpha AB+C,$ $C <- alpha A^T B+C,$ $C <- alpha A^H B+C$, depending on the value of \fCtransA\fP\&. .PP \fBParameters\fP .RS 4 \fIorder\fP layour of the dense array\&. .br \fItransA\fP Transposition operator for matrix \fIA\fP\&. .br \fInrhs\fP Number of right hand side columns\&. .br \fIA\fP A valid matrix handle\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIb\fP Dense vector \fIb\fP\&. .br \fIldb\fP Leading dimension of \fIb\fP\&. .br \fIc\fP Dense vector \fIc\fP\&. .br \fIldc\fP Leading dimension of \fIc\fP\&. .RE .PP \fBNote\fP .RS 4 .PP .PP By setting the \fC\fBblas_rsb_autotune_next_operation\fP\fP property via \fBBLAS_ussp\fP (at any time) the next multiplication routine call (either of \fBBLAS_dusmv\fP, \fBBLAS_susmv\fP, \fBBLAS_zusmv\fP, \fBBLAS_cusmv\fP, \fBBLAS_dusmm\fP, \fBBLAS_susmm\fP, \fBBLAS_zusmm\fP, \fBBLAS_cusmm\fP) will invoke autotuning before carrying out the effective operation\&. The tuning will take in account parameters like transposition, number of right hand sides, and scaling constants\&. By setting the \fC\fBblas_rsb_spmv_autotuning_on\fP\fP property via \fBBLAS_ussp\fP, the default number of executing threads for this matrix will be determined once, at matrix assembly time, and employed irrespective of the default threads count (different values for transposed and untransposed multiply)\&. This can be overridden only by setting the \fCRSB_NUM_THREADS\fP environment variable\&. .RE .PP \fBSee also\fP .RS 4 \fBOn\fP \fBthe\fP \fBtopic\fP \fBof\fP \fBautotuning\fP, \fBsee\fP \fBalso\fP \fBrsb_tune_spmm\fP\&.\\nIf \fC--enable-rsb-num-threads\fP \fBhas\fP \fBbeen\fP \fBspecified\fP \fBat\fP configure \fBtime\fP, \fBthe\fP \fC\fBRSB_NUM_THREADS\fP\fP \fBenvironment\fP \fBvariable\fP \fBwill\fP \fBoverride\fP \fBthe\fP \fBnumber\fP \fBof\fP \fBexecuting\fP \fBthreads\fP \fBspecified\fP \fBby\fP \fC\fBOMP_NUM_THREADS\fP\fP\&. (\fBSee\fP \fBalso\fP \fBRSB_IO_WANT_EXECUTING_THREADS\fP)\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cusmm_ (\fBconst\fP \fBenum\fP \fBblas_order_type\fP * order, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP * transA, \fBconst\fP \fBint\fP * nrhs, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP * A, \fBconst\fP \fBvoid\fP * b, \fBconst\fP \fBint\fP * ldb, \fBvoid\fP * c, \fBconst\fP \fBint\fP * ldc, \fBint\fP * istat)" Multiply by a dense matrix (aka multi-vector)\&. Either of $C <- alpha AB+C,$ $C <- alpha A^T B+C,$ $C <- alpha A^H B+C$, depending on the value of \fCtransA\fP\&. .PP \fBParameters\fP .RS 4 \fIorder\fP layour of the dense array\&. .br \fItransA\fP Transposition operator for matrix \fIA\fP\&. .br \fInrhs\fP Number of right hand side columns\&. .br \fIA\fP A valid matrix handle\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIb\fP Dense vector \fIb\fP\&. .br \fIldb\fP Leading dimension of \fIb\fP\&. .br \fIc\fP Dense vector \fIc\fP\&. .br \fIldc\fP Leading dimension of \fIc\fP\&. .RE .PP \fBNote\fP .RS 4 .PP .PP By setting the \fC\fBblas_rsb_autotune_next_operation\fP\fP property via \fBBLAS_ussp\fP (at any time) the next multiplication routine call (either of \fBBLAS_dusmv\fP, \fBBLAS_susmv\fP, \fBBLAS_zusmv\fP, \fBBLAS_cusmv\fP, \fBBLAS_dusmm\fP, \fBBLAS_susmm\fP, \fBBLAS_zusmm\fP, \fBBLAS_cusmm\fP) will invoke autotuning before carrying out the effective operation\&. The tuning will take in account parameters like transposition, number of right hand sides, and scaling constants\&. By setting the \fC\fBblas_rsb_spmv_autotuning_on\fP\fP property via \fBBLAS_ussp\fP, the default number of executing threads for this matrix will be determined once, at matrix assembly time, and employed irrespective of the default threads count (different values for transposed and untransposed multiply)\&. This can be overridden only by setting the \fCRSB_NUM_THREADS\fP environment variable\&. .RE .PP \fBSee also\fP .RS 4 \fBOn\fP \fBthe\fP \fBtopic\fP \fBof\fP \fBautotuning\fP, \fBsee\fP \fBalso\fP \fBrsb_tune_spmm\fP\&.\\nIf \fC--enable-rsb-num-threads\fP \fBhas\fP \fBbeen\fP \fBspecified\fP \fBat\fP configure \fBtime\fP, \fBthe\fP \fC\fBRSB_NUM_THREADS\fP\fP \fBenvironment\fP \fBvariable\fP \fBwill\fP \fBoverride\fP \fBthe\fP \fBnumber\fP \fBof\fP \fBexecuting\fP \fBthreads\fP \fBspecified\fP \fBby\fP \fC\fBOMP_NUM_THREADS\fP\fP\&. (\fBSee\fP \fBalso\fP \fBRSB_IO_WANT_EXECUTING_THREADS\fP)\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cusmv (\fBconst\fP \fBenum\fP \fBblas_trans_type\fP transA, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP A, \fBconst\fP \fBvoid\fP * x, \fBconst\fP \fBint\fP incx, \fBvoid\fP * y, \fBconst\fP \fBint\fP incy)" Multiply by a dense vector\&. Either of $Y <- alpha A X + Y ,$ .br $Y <- alpha A^T X + Y,$ .br $Y <- alpha A^H X + Y$, depending on the value of \fCtransA\fP\&. .PP \fBParameters\fP .RS 4 \fItransA\fP Transposition operator for matrix \fIA\fP\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIA\fP A valid matrix handle\&. .br \fIx\fP Dense vector \fIx\fP\&. .br \fIincx\fP Stride of \fIx\fP\&. .br \fIy\fP Dense vector \fIy\fP\&. .br \fIincy\fP Stride of \fIy\fP\&. .RE .PP \fBNote\fP .RS 4 .PP .PP By setting the \fC\fBblas_rsb_autotune_next_operation\fP\fP property via \fBBLAS_ussp\fP (at any time) the next multiplication routine call (either of \fBBLAS_dusmv\fP, \fBBLAS_susmv\fP, \fBBLAS_zusmv\fP, \fBBLAS_cusmv\fP, \fBBLAS_dusmm\fP, \fBBLAS_susmm\fP, \fBBLAS_zusmm\fP, \fBBLAS_cusmm\fP) will invoke autotuning before carrying out the effective operation\&. The tuning will take in account parameters like transposition, number of right hand sides, and scaling constants\&. By setting the \fC\fBblas_rsb_spmv_autotuning_on\fP\fP property via \fBBLAS_ussp\fP, the default number of executing threads for this matrix will be determined once, at matrix assembly time, and employed irrespective of the default threads count (different values for transposed and untransposed multiply)\&. This can be overridden only by setting the \fCRSB_NUM_THREADS\fP environment variable\&. .RE .PP \fBSee also\fP .RS 4 \fBOn\fP \fBthe\fP \fBtopic\fP \fBof\fP \fBautotuning\fP, \fBsee\fP \fBalso\fP \fBrsb_tune_spmm\fP\&. .br \fBIf\fP \fC--enable-rsb-num-threads\fP \fBhas\fP \fBbeen\fP \fBspecified\fP \fBat\fP configure \fBtime\fP, \fBthe\fP \fC\fBRSB_NUM_THREADS\fP\fP \fBenvironment\fP \fBvariable\fP \fBwill\fP \fBoverride\fP \fBthe\fP \fBnumber\fP \fBof\fP \fBexecuting\fP \fBthreads\fP \fBspecified\fP \fBby\fP \fC\fBOMP_NUM_THREADS\fP\fP\&. (\fBSee\fP \fBalso\fP \fBRSB_IO_WANT_EXECUTING_THREADS\fP)\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cusmv_ (\fBconst\fP \fBenum\fP \fBblas_trans_type\fP * transA, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP * A, \fBconst\fP \fBvoid\fP * x, \fBconst\fP \fBint\fP * incx, \fBvoid\fP * y, \fBconst\fP \fBint\fP * incy, \fBint\fP * istat)" Multiply by a dense vector\&. Either of $Y <- alpha A X + Y ,$ .br $Y <- alpha A^T X + Y,$ .br $Y <- alpha A^H X + Y$, depending on the value of \fCtransA\fP\&. .PP \fBParameters\fP .RS 4 \fItransA\fP Transposition operator for matrix \fIA\fP\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIA\fP A valid matrix handle\&. .br \fIx\fP Dense vector \fIx\fP\&. .br \fIincx\fP Stride of \fIx\fP\&. .br \fIy\fP Dense vector \fIy\fP\&. .br \fIincy\fP Stride of \fIy\fP\&. .RE .PP \fBNote\fP .RS 4 .PP .PP By setting the \fC\fBblas_rsb_autotune_next_operation\fP\fP property via \fBBLAS_ussp\fP (at any time) the next multiplication routine call (either of \fBBLAS_dusmv\fP, \fBBLAS_susmv\fP, \fBBLAS_zusmv\fP, \fBBLAS_cusmv\fP, \fBBLAS_dusmm\fP, \fBBLAS_susmm\fP, \fBBLAS_zusmm\fP, \fBBLAS_cusmm\fP) will invoke autotuning before carrying out the effective operation\&. The tuning will take in account parameters like transposition, number of right hand sides, and scaling constants\&. By setting the \fC\fBblas_rsb_spmv_autotuning_on\fP\fP property via \fBBLAS_ussp\fP, the default number of executing threads for this matrix will be determined once, at matrix assembly time, and employed irrespective of the default threads count (different values for transposed and untransposed multiply)\&. This can be overridden only by setting the \fCRSB_NUM_THREADS\fP environment variable\&. .RE .PP \fBSee also\fP .RS 4 \fBOn\fP \fBthe\fP \fBtopic\fP \fBof\fP \fBautotuning\fP, \fBsee\fP \fBalso\fP \fBrsb_tune_spmm\fP\&. .br \fBIf\fP \fC--enable-rsb-num-threads\fP \fBhas\fP \fBbeen\fP \fBspecified\fP \fBat\fP configure \fBtime\fP, \fBthe\fP \fC\fBRSB_NUM_THREADS\fP\fP \fBenvironment\fP \fBvariable\fP \fBwill\fP \fBoverride\fP \fBthe\fP \fBnumber\fP \fBof\fP \fBexecuting\fP \fBthreads\fP \fBspecified\fP \fBby\fP \fC\fBOMP_NUM_THREADS\fP\fP\&. (\fBSee\fP \fBalso\fP \fBRSB_IO_WANT_EXECUTING_THREADS\fP)\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cusrows_scale (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBvoid\fP * d, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP trans)" Scale rows interval of matrix by specified factor\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fId\fP Rows scaling vector\&. .br \fItrans\fP Transposition parameter (if transposed will scale columns)\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cusrows_scale_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBvoid\fP * d, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP * trans, \fBint\fP * istat)" Scale rows interval of matrix by specified factor\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fId\fP Rows scaling vector\&. .br \fItrans\fP Transposition parameter (if transposed will scale columns)\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cussc (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBvoid\fP * x, \fBvoid\fP * y, \fBconst\fP \fBint\fP incy, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse scatter: $Y |_x <- X$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_cussc_ (\fBconst\fP \fBint\fP * nnz, \fBconst\fP \fBvoid\fP * x, \fBvoid\fP * y, \fBconst\fP \fBint\fP * incy, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse scatter: $Y |_x <- X$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBint\fP BLAS_cusset_element (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP i, \fBconst\fP \fBint\fP j, \fBvoid\fP * v)" Set a single (existing) matrix nonzero coefficient $A_{i,j}$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fIj\fP Column index\&. .br \fIv\fP Value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cusset_element_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * i, \fBconst\fP \fBint\fP * j, \fBvoid\fP * v, \fBint\fP * istat)" Set a single (existing) matrix nonzero coefficient $A_{i,j}$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fIj\fP Column index\&. .br \fIv\fP Value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cusset_elements (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP * ia, \fBconst\fP \fBint\fP * ja, \fBconst\fP \fBvoid\fP * va, \fBconst\fP \fBint\fP nnz)" Set individual matrix nonzero coefficients values\&. The operation is pattern preserving, that is, nonzeroes must already exist\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIia\fP Row indices array\&. .br \fIja\fP Column indices array\&. .br \fIva\fP Values array\&. .br \fInnz\fP Length of the \fCia\fP,ja,va arrays\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&.\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cusset_elements_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * ia, \fBconst\fP \fBint\fP * ja, \fBconst\fP \fBvoid\fP * va, \fBconst\fP \fBint\fP * nnz, \fBint\fP * istat)" Set individual matrix nonzero coefficients values\&. The operation is pattern preserving, that is, nonzeroes must already exist\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIia\fP Row indices array\&. .br \fIja\fP Column indices array\&. .br \fIva\fP Values array\&. .br \fInnz\fP Length of the \fCia\fP,ja,va arrays\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&.\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cussm (\fBconst\fP \fBenum\fP \fBblas_order_type\fP order, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP transT, \fBconst\fP \fBint\fP nrhs, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP T, \fBvoid\fP * b, \fBconst\fP \fBint\fP ldb)" Triangular solve, by a dense matrix (aka multi-vector)\&. Either of $B <- alpha T^{-1} B,$ $B <- alpha T^{-T} B,$ $B <- alpha T^{-H} B$, depending on the value of \fCtransT\fP\&. .PP \fBParameters\fP .RS 4 \fIorder\fP layour of the dense array\&. .br \fItransT\fP Transposition operator for matrix \fIT\fP\&. .br \fInrhs\fP Number of right hand side columns\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIT\fP A valid triangular matrix handle\&. .br \fIb\fP Dense vector \fIb\fP\&. .br \fIldb\fP Leading dimension of \fIb\fP\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cussm_ (\fBconst\fP \fBenum\fP \fBblas_order_type\fP * order, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP * transT, \fBconst\fP \fBint\fP * nrhs, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP * T, \fBvoid\fP * b, \fBconst\fP \fBint\fP * ldb, \fBint\fP * istat)" Triangular solve, by a dense matrix (aka multi-vector)\&. Either of $B <- alpha T^{-1} B,$ $B <- alpha T^{-T} B,$ $B <- alpha T^{-H} B$, depending on the value of \fCtransT\fP\&. .PP \fBParameters\fP .RS 4 \fIorder\fP layour of the dense array\&. .br \fItransT\fP Transposition operator for matrix \fIT\fP\&. .br \fInrhs\fP Number of right hand side columns\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIT\fP A valid triangular matrix handle\&. .br \fIb\fP Dense vector \fIb\fP\&. .br \fIldb\fP Leading dimension of \fIb\fP\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_cussv (\fBenum\fP \fBblas_trans_type\fP transT, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP T, \fBvoid\fP * x, \fBconst\fP \fBint\fP incx)" Triangular solve, by a dense vector\&. Either of $X <- alpha T^{-1}X,$ $X <- alpha T^{-T}X,$ $X <- alpha T^{-H}X$, depending on the value of \fCtransT\fP\&. .PP \fBParameters\fP .RS 4 \fItransT\fP Transposition operator for matrix \fIT\fP\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIT\fP A valid triangular matrix handle\&. .br \fIx\fP Dense vector \fIx\fP\&. .br \fIincx\fP Stride of \fIx\fP\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_cussv_ (\fBenum\fP \fBblas_trans_type\fP * transT, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP * T, \fBvoid\fP * x, \fBconst\fP \fBint\fP * incx, \fBint\fP * istat)" Triangular solve, by a dense vector\&. Either of $X <- alpha T^{-1}X,$ $X <- alpha T^{-T}X,$ $X <- alpha T^{-H}X$, depending on the value of \fCtransT\fP\&. .PP \fBParameters\fP .RS 4 \fItransT\fP Transposition operator for matrix \fIT\fP\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIT\fP A valid triangular matrix handle\&. .br \fIx\fP Dense vector \fIx\fP\&. .br \fIincx\fP Stride of \fIx\fP\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_dusaxpy (\fBconst\fP \fBint\fP nnz, \fBdouble\fP alpha, \fBconst\fP \fBdouble\fP * x, \fBconst\fP \fBint\fP * indx, \fBdouble\fP * y, \fBconst\fP \fBint\fP incy, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse vector update: $Y <- alpha X + Y$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&. .br \fIalpha\fP Will scale values of $X$ before accumulating to $Y$\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_dusaxpy_ (\fBconst\fP \fBint\fP * nnz, \fBdouble\fP * alpha, \fBconst\fP \fBdouble\fP * x, \fBconst\fP \fBint\fP * indx, \fBdouble\fP * y, \fBconst\fP \fBint\fP * incy, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse vector update: $Y <- alpha X + Y$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&. .br \fIalpha\fP Will scale values of $X$ before accumulating to $Y$\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBblas_sparse_matrix\fP BLAS_duscr_begin (\fBint\fP m, \fBint\fP n)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIm\fP Is the count of rows\&. .br \fIn\fP Is the count of columns\&. .RE .PP \fBReturns\fP .RS 4 A matrix handle in case of success, or -1 on error\&. .RE .PP .SS "\fBvoid\fP blas_duscr_begin_ (\fBint\fP * m, \fBint\fP * n, \fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIm\fP Is the count of rows\&. .br \fIn\fP Is the count of columns\&. .br \fIA\fP A valid pointer to an empty matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br Will assign a valid matrix handle to $A$ in case of success, or set it to -1 on error\&. .RE .PP .SS "\fBblas_sparse_matrix\fP BLAS_duscr_block_begin (\fBint\fP Mb, \fBint\fP Nb, \fBint\fP k, \fBint\fP l)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIk,l\fP Are row and column dimensions when specifying a matrix as BCSR\&. .br \fIMb\fP Block rows count\&. .br \fINb\fP Block columns count\&. .RE .PP \fBReturns\fP .RS 4 A matrix handle in case of success, or -1 on error\&. .RE .PP .SS "\fBvoid\fP blas_duscr_block_begin_ (\fBint\fP * Mb, \fBint\fP * Nb, \fBint\fP * k, \fBint\fP * l, \fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIk,l\fP Are row and column dimensions when specifying a matrix as BCSR\&. .br \fIMb\fP Block rows count\&. .br \fINb\fP Block columns count\&. .br \fIA\fP A valid pointer to an empty matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br Will assign a valid matrix handle to $A$ in case of success, or set it to -1 on error\&. .RE .PP .SS "\fBint\fP BLAS_duscr_end (\fBblas_sparse_matrix\fP A)" Makes an assembled matrix out of a matrix in build state\&. After this, it is not possible anymore to insert nonzeroes, but computational routines\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_duscr_end_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Makes an assembled matrix out of a matrix in build state\&. After this, it is not possible anymore to insert nonzeroes, but computational routines\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_duscr_insert_block (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBdouble\fP * val, \fBint\fP row_stride, \fBint\fP col_stride, \fBint\fP i, \fBint\fP j)" Inserts a whole block in a matrix, assuming it is in build state\&. The block size is assumed to be the one specified when calling the (type) corresponding matrix blocked \fCbegin\fP function\&. If not called a blocked \fCbegin\fP function, will assume 1x1 (that is, no) blocking\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIval\fP Array of values\&. .br \fIrow_stride,col_stride\fP Row and column strides in accessing \fCval\fP\&. .br \fIi,j\fP Block row/column indices\&. .RE .PP \fBWarning\fP .RS 4 Signature of this routine for Fortran does not agree to the standard\&. This shall be corrected in a future release\&. .RE .PP \fBSee also\fP .RS 4 \fBBLAS_cuscr_block_begin\fP, \fBBLAS_cuscr_block_begin\fP, \fBBLAS_duscr_block_begin\fP, \fBBLAS_zuscr_block_begin\fP, \fBBLAS_cuscr_begin\fP, \fBBLAS_suscr_begin\fP, \fBBLAS_duscr_begin\fP, \fBBLAS_zuscr_begin\fP\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_duscr_insert_block_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBdouble\fP * val, \fBint\fP * row_stride, \fBint\fP * col_stride, \fBint\fP * i, \fBint\fP * j, \fBint\fP * istat)" Inserts a whole block in a matrix, assuming it is in build state\&. The block size is assumed to be the one specified when calling the (type) corresponding matrix blocked \fCbegin\fP function\&. If not called a blocked \fCbegin\fP function, will assume 1x1 (that is, no) blocking\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIval\fP Array of values\&. .br \fIrow_stride,col_stride\fP Row and column strides in accessing \fCval\fP\&. .br \fIi,j\fP Block row/column indices\&. .RE .PP \fBWarning\fP .RS 4 Signature of this routine for Fortran does not agree to the standard\&. This shall be corrected in a future release\&. .RE .PP \fBSee also\fP .RS 4 \fBBLAS_cuscr_block_begin\fP, \fBBLAS_cuscr_block_begin\fP, \fBBLAS_duscr_block_begin\fP, \fBBLAS_zuscr_block_begin\fP, \fBBLAS_cuscr_begin\fP, \fBBLAS_suscr_begin\fP, \fBBLAS_duscr_begin\fP, \fBBLAS_zuscr_begin\fP\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_duscr_insert_clique (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP k, \fBconst\fP \fBint\fP l, \fBconst\fP \fBdouble\fP * val, \fBconst\fP \fBint\fP row_stride, \fBconst\fP \fBint\fP col_stride, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBint\fP * jndx)" Inserts a whole clique in a matrix, assuming this is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIk,l\fP Clique rows and columns count\&. .br \fIval\fP Array of values\&. .br \fIrow_stride,col_stride\fP Row/columns stride in accessing the clique\&. .br \fIindx,jndx\fP Row/column indices arrays\&. .RE .PP \fBWarning\fP .RS 4 Signature of this routine for Fortran does not agree to the standard\&. This shall be corrected in a future release\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_duscr_insert_clique_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * k, \fBconst\fP \fBint\fP * l, \fBconst\fP \fBdouble\fP * val, \fBconst\fP \fBint\fP * row_stride, \fBconst\fP \fBint\fP * col_stride, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBint\fP * jndx, \fBint\fP * istat)" Inserts a whole clique in a matrix, assuming this is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIk,l\fP Clique rows and columns count\&. .br \fIval\fP Array of values\&. .br \fIrow_stride,col_stride\fP Row/columns stride in accessing the clique\&. .br \fIindx,jndx\fP Row/column indices arrays\&. .RE .PP \fBWarning\fP .RS 4 Signature of this routine for Fortran does not agree to the standard\&. This shall be corrected in a future release\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_duscr_insert_col (\fBblas_sparse_matrix\fP A, \fBint\fP j, \fBint\fP nnz, \fBconst\fP \fBdouble\fP * val, \fBconst\fP \fBint\fP * indx)" Inserts a whole column in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIj\fP Column index\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row indices array\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_duscr_insert_col_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * j, \fBint\fP * nnz, \fBconst\fP \fBdouble\fP * val, \fBconst\fP \fBint\fP * indx, \fBint\fP * istat)" Inserts a whole column in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIj\fP Column index\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row indices array\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_duscr_insert_entries (\fBblas_sparse_matrix\fP A, \fBint\fP nnz, \fBconst\fP \fBdouble\fP * val, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBint\fP * jndx)" Inserts entries in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row indices array\&. .br \fIjndx\fP Column indices array\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_duscr_insert_entries_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * nnz, \fBconst\fP \fBdouble\fP * val, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBint\fP * jndx, \fBint\fP * istat)" Inserts entries in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row indices array\&. .br \fIjndx\fP Column indices array\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_duscr_insert_entry (\fBblas_sparse_matrix\fP A, \fBdouble\fP val, \fBint\fP i, \fBint\fP j)" Inserts an entry in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIval\fP Array of values\&. .br \fIval\fP Array of values\&. .br \fIi,j\fP Row and column indices\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_duscr_insert_entry_ (\fBblas_sparse_matrix\fP * A, \fBdouble\fP * val, \fBint\fP * i, \fBint\fP * j, \fBint\fP * istat)" Inserts an entry in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIval\fP Array of values\&. .br \fIval\fP Array of values\&. .br \fIi,j\fP Row and column indices\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_duscr_insert_row (\fBblas_sparse_matrix\fP A, \fBint\fP i, \fBint\fP nnz, \fBconst\fP \fBdouble\fP * val, \fBconst\fP \fBint\fP * indx)" Inserts a whole row in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row index\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_duscr_insert_row_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * i, \fBint\fP * nnz, \fBconst\fP \fBdouble\fP * val, \fBconst\fP \fBint\fP * indx, \fBint\fP * istat)" Inserts a whole row in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row index\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBblas_sparse_matrix\fP BLAS_duscr_variable_block_begin (\fBint\fP Mb, \fBint\fP Nb, \fBconst\fP \fBint\fP * K, \fBconst\fP \fBint\fP * L)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIK,L\fP Are arrays specifying row/column block sizes when specifying a matrix as VBR\&. .br \fIMb\fP Block rows count\&. .br \fINb\fP Block columns count\&. .RE .PP \fBReturns\fP .RS 4 A matrix handle in case of success, or -1 on error\&. .RE .PP .SS "\fBvoid\fP blas_duscr_variable_block_begin_ (\fBint\fP * Mb, \fBint\fP * Nb, \fBconst\fP \fBint\fP * K, \fBconst\fP \fBint\fP * L, \fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIK,L\fP Are arrays specifying row/column block sizes when specifying a matrix as VBR\&. .br \fIMb\fP Block rows count\&. .br \fINb\fP Block columns count\&. .br \fIA\fP A valid pointer to an empty matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br Will assign a valid matrix handle to $A$ in case of success, or set it to -1 on error\&. .RE .PP .SS "\fBint\fP BLAS_dusdot (\fBconst\fP \fBenum\fP \fBblas_conj_type\fP conj, \fBconst\fP \fBint\fP nnz, \fBconst\fP \fBdouble\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBdouble\fP * y, \fBconst\fP \fBint\fP incy, \fBdouble\fP * r, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse dot product\&. $r <- X^T Y,$ $r <- X^H Y$ .PP \fBParameters\fP .RS 4 \fIr\fP Sparse dot result array\&. .br \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&. .br \fIconj\fP If \fBblas_conj\fP, values of X will be considered conjugated\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_dusdot_ (\fBconst\fP \fBenum\fP \fBblas_conj_type\fP * conj, \fBconst\fP \fBint\fP * nnz, \fBconst\fP \fBdouble\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBdouble\fP * y, \fBconst\fP \fBint\fP * incy, \fBdouble\fP * r, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse dot product\&. $r <- X^T Y,$ $r <- X^H Y$ .PP \fBParameters\fP .RS 4 \fIr\fP Sparse dot result array\&. .br \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&. .br \fIconj\fP If \fBblas_conj\fP, values of X will be considered conjugated\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBint\fP BLAS_dusga (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBdouble\fP * y, \fBconst\fP \fBint\fP incy, \fBdouble\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse gather\&. $X <- Y |_x$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_dusga_ (\fBconst\fP \fBint\fP * nnz, \fBconst\fP \fBdouble\fP * y, \fBconst\fP \fBint\fP * incy, \fBdouble\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse gather\&. $X <- Y |_x$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBint\fP BLAS_dusget_diag (\fBblas_sparse_matrix\fP A, \fBdouble\fP * d)" Get matrix diagonal\&. $d <- diag(A)$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fId\fP Array for the diagonal entries\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_dusget_diag_ (\fBblas_sparse_matrix\fP * A, \fBdouble\fP * d, \fBint\fP * istat)" Get matrix diagonal\&. $d <- diag(A)$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fId\fP Array for the diagonal entries\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_dusget_element (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP i, \fBconst\fP \fBint\fP j, \fBdouble\fP * v)" Get a single matrix nonzero coefficient $A_{i,j}$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fIj\fP Column index\&. .br \fIv\fP Value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_dusget_element_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * i, \fBconst\fP \fBint\fP * j, \fBdouble\fP * v, \fBint\fP * istat)" Get a single matrix nonzero coefficient $A_{i,j}$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fIj\fP Column index\&. .br \fIv\fP Value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_dusget_infinity_norm (\fBblas_sparse_matrix\fP A, \fBdouble\fP * in, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP trans)" Get infinity norm of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIin\fP Infinity norm pointer\&. .br \fItrans\fP Transposition parameter\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_dusget_infinity_norm_ (\fBblas_sparse_matrix\fP * A, \fBdouble\fP * in, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP * trans, \fBint\fP * istat)" Get infinity norm of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIin\fP Infinity norm pointer\&. .br \fItrans\fP Transposition parameter\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_dusget_matrix_nnz (\fBblas_sparse_matrix\fP A, \fBint\fP * nnz)" Get nnz count of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fInnz\fP Output value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_dusget_matrix_nnz_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * nnz, \fBint\fP * istat)" Get nnz count of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fInnz\fP Output value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_dusget_rows_nnz (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP fr, \fBconst\fP \fBint\fP lr, \fBint\fP * nnzp)" Get nnz count of matrix row interval\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIfr\fP First row\&. .br \fIlr\fP Last row\&. .br \fInnzp\fP Pointer to the nonzeroes variable\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_dusget_rows_nnz_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * fr, \fBconst\fP \fBint\fP * lr, \fBint\fP * nnzp, \fBint\fP * istat)" Get nnz count of matrix row interval\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIfr\fP First row\&. .br \fIlr\fP Last row\&. .br \fInnzp\fP Pointer to the nonzeroes variable\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_dusget_rows_sparse (\fBblas_sparse_matrix\fP A, \fBdouble\fP * VA, \fBint\fP * IA, \fBint\fP * JA, \fBint\fP * nnz, \fBconst\fP \fBint\fP fr, \fBconst\fP \fBint\fP lr)" Get sparse rows of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIVA\fP pointer to values\&. .br \fIIA\fP Row indices array\&. .br \fIJA\fP Column indices array\&. .br \fInnz\fP Obtained nonzeroes\&. .br \fIfr\fP first row\&. .br \fIlr\fP Last row\&. .br .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_dusget_rows_sparse_ (\fBblas_sparse_matrix\fP * A, \fBdouble\fP * VA, \fBint\fP * IA, \fBint\fP * JA, \fBint\fP * nnz, \fBconst\fP \fBint\fP * fr, \fBconst\fP \fBint\fP * lr, \fBint\fP * istat)" Get sparse rows of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIVA\fP pointer to values\&. .br \fIIA\fP Row indices array\&. .br \fIJA\fP Column indices array\&. .br \fInnz\fP Obtained nonzeroes\&. .br \fIfr\fP first row\&. .br \fIlr\fP Last row\&. .br .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_dusgz (\fBconst\fP \fBint\fP nnz, \fBdouble\fP * y, \fBconst\fP \fBint\fP incy, \fBdouble\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse gather and zero\&. $X <- Y |_x;Y|_x <- 0$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_dusgz_ (\fBconst\fP \fBint\fP * nnz, \fBdouble\fP * y, \fBconst\fP \fBint\fP * incy, \fBdouble\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse gather and zero\&. $X <- Y |_x;Y|_x <- 0$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBint\fP BLAS_dusmm (\fBconst\fP \fBenum\fP \fBblas_order_type\fP order, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP transA, \fBconst\fP \fBint\fP nrhs, \fBdouble\fP alpha, \fBconst\fP \fBblas_sparse_matrix\fP A, \fBconst\fP \fBdouble\fP * b, \fBconst\fP \fBint\fP ldb, \fBdouble\fP * c, \fBconst\fP \fBint\fP ldc)" Multiply by a dense matrix (aka multi-vector)\&. Either of $C <- alpha AB+C,$ $C <- alpha A^T B+C,$ $C <- alpha A^H B+C$, depending on the value of \fCtransA\fP\&. .PP \fBParameters\fP .RS 4 \fIorder\fP layour of the dense array\&. .br \fItransA\fP Transposition operator for matrix \fIA\fP\&. .br \fInrhs\fP Number of right hand side columns\&. .br \fIA\fP A valid matrix handle\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIb\fP Dense vector \fIb\fP\&. .br \fIldb\fP Leading dimension of \fIb\fP\&. .br \fIc\fP Dense vector \fIc\fP\&. .br \fIldc\fP Leading dimension of \fIc\fP\&. .RE .PP \fBNote\fP .RS 4 .PP .PP By setting the \fC\fBblas_rsb_autotune_next_operation\fP\fP property via \fBBLAS_ussp\fP (at any time) the next multiplication routine call (either of \fBBLAS_dusmv\fP, \fBBLAS_susmv\fP, \fBBLAS_zusmv\fP, \fBBLAS_cusmv\fP, \fBBLAS_dusmm\fP, \fBBLAS_susmm\fP, \fBBLAS_zusmm\fP, \fBBLAS_cusmm\fP) will invoke autotuning before carrying out the effective operation\&. The tuning will take in account parameters like transposition, number of right hand sides, and scaling constants\&. By setting the \fC\fBblas_rsb_spmv_autotuning_on\fP\fP property via \fBBLAS_ussp\fP, the default number of executing threads for this matrix will be determined once, at matrix assembly time, and employed irrespective of the default threads count (different values for transposed and untransposed multiply)\&. This can be overridden only by setting the \fCRSB_NUM_THREADS\fP environment variable\&. .RE .PP \fBSee also\fP .RS 4 \fBOn\fP \fBthe\fP \fBtopic\fP \fBof\fP \fBautotuning\fP, \fBsee\fP \fBalso\fP \fBrsb_tune_spmm\fP\&.\\nIf \fC--enable-rsb-num-threads\fP \fBhas\fP \fBbeen\fP \fBspecified\fP \fBat\fP configure \fBtime\fP, \fBthe\fP \fC\fBRSB_NUM_THREADS\fP\fP \fBenvironment\fP \fBvariable\fP \fBwill\fP \fBoverride\fP \fBthe\fP \fBnumber\fP \fBof\fP \fBexecuting\fP \fBthreads\fP \fBspecified\fP \fBby\fP \fC\fBOMP_NUM_THREADS\fP\fP\&. (\fBSee\fP \fBalso\fP \fBRSB_IO_WANT_EXECUTING_THREADS\fP)\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_dusmm_ (\fBconst\fP \fBenum\fP \fBblas_order_type\fP * order, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP * transA, \fBconst\fP \fBint\fP * nrhs, \fBdouble\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP * A, \fBconst\fP \fBdouble\fP * b, \fBconst\fP \fBint\fP * ldb, \fBdouble\fP * c, \fBconst\fP \fBint\fP * ldc, \fBint\fP * istat)" Multiply by a dense matrix (aka multi-vector)\&. Either of $C <- alpha AB+C,$ $C <- alpha A^T B+C,$ $C <- alpha A^H B+C$, depending on the value of \fCtransA\fP\&. .PP \fBParameters\fP .RS 4 \fIorder\fP layour of the dense array\&. .br \fItransA\fP Transposition operator for matrix \fIA\fP\&. .br \fInrhs\fP Number of right hand side columns\&. .br \fIA\fP A valid matrix handle\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIb\fP Dense vector \fIb\fP\&. .br \fIldb\fP Leading dimension of \fIb\fP\&. .br \fIc\fP Dense vector \fIc\fP\&. .br \fIldc\fP Leading dimension of \fIc\fP\&. .RE .PP \fBNote\fP .RS 4 .PP .PP By setting the \fC\fBblas_rsb_autotune_next_operation\fP\fP property via \fBBLAS_ussp\fP (at any time) the next multiplication routine call (either of \fBBLAS_dusmv\fP, \fBBLAS_susmv\fP, \fBBLAS_zusmv\fP, \fBBLAS_cusmv\fP, \fBBLAS_dusmm\fP, \fBBLAS_susmm\fP, \fBBLAS_zusmm\fP, \fBBLAS_cusmm\fP) will invoke autotuning before carrying out the effective operation\&. The tuning will take in account parameters like transposition, number of right hand sides, and scaling constants\&. By setting the \fC\fBblas_rsb_spmv_autotuning_on\fP\fP property via \fBBLAS_ussp\fP, the default number of executing threads for this matrix will be determined once, at matrix assembly time, and employed irrespective of the default threads count (different values for transposed and untransposed multiply)\&. This can be overridden only by setting the \fCRSB_NUM_THREADS\fP environment variable\&. .RE .PP \fBSee also\fP .RS 4 \fBOn\fP \fBthe\fP \fBtopic\fP \fBof\fP \fBautotuning\fP, \fBsee\fP \fBalso\fP \fBrsb_tune_spmm\fP\&.\\nIf \fC--enable-rsb-num-threads\fP \fBhas\fP \fBbeen\fP \fBspecified\fP \fBat\fP configure \fBtime\fP, \fBthe\fP \fC\fBRSB_NUM_THREADS\fP\fP \fBenvironment\fP \fBvariable\fP \fBwill\fP \fBoverride\fP \fBthe\fP \fBnumber\fP \fBof\fP \fBexecuting\fP \fBthreads\fP \fBspecified\fP \fBby\fP \fC\fBOMP_NUM_THREADS\fP\fP\&. (\fBSee\fP \fBalso\fP \fBRSB_IO_WANT_EXECUTING_THREADS\fP)\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_dusmv (\fBconst\fP \fBenum\fP \fBblas_trans_type\fP transA, \fBdouble\fP alpha, \fBconst\fP \fBblas_sparse_matrix\fP A, \fBconst\fP \fBdouble\fP * x, \fBconst\fP \fBint\fP incx, \fBdouble\fP * y, \fBconst\fP \fBint\fP incy)" Multiply by a dense vector\&. Either of $Y <- alpha A X + Y ,$ .br $Y <- alpha A^T X + Y,$ .br $Y <- alpha A^H X + Y$, depending on the value of \fCtransA\fP\&. .PP \fBParameters\fP .RS 4 \fItransA\fP Transposition operator for matrix \fIA\fP\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIA\fP A valid matrix handle\&. .br \fIx\fP Dense vector \fIx\fP\&. .br \fIincx\fP Stride of \fIx\fP\&. .br \fIy\fP Dense vector \fIy\fP\&. .br \fIincy\fP Stride of \fIy\fP\&. .RE .PP \fBNote\fP .RS 4 .PP .PP By setting the \fC\fBblas_rsb_autotune_next_operation\fP\fP property via \fBBLAS_ussp\fP (at any time) the next multiplication routine call (either of \fBBLAS_dusmv\fP, \fBBLAS_susmv\fP, \fBBLAS_zusmv\fP, \fBBLAS_cusmv\fP, \fBBLAS_dusmm\fP, \fBBLAS_susmm\fP, \fBBLAS_zusmm\fP, \fBBLAS_cusmm\fP) will invoke autotuning before carrying out the effective operation\&. The tuning will take in account parameters like transposition, number of right hand sides, and scaling constants\&. By setting the \fC\fBblas_rsb_spmv_autotuning_on\fP\fP property via \fBBLAS_ussp\fP, the default number of executing threads for this matrix will be determined once, at matrix assembly time, and employed irrespective of the default threads count (different values for transposed and untransposed multiply)\&. This can be overridden only by setting the \fCRSB_NUM_THREADS\fP environment variable\&. .RE .PP \fBSee also\fP .RS 4 \fBOn\fP \fBthe\fP \fBtopic\fP \fBof\fP \fBautotuning\fP, \fBsee\fP \fBalso\fP \fBrsb_tune_spmm\fP\&. .br \fBIf\fP \fC--enable-rsb-num-threads\fP \fBhas\fP \fBbeen\fP \fBspecified\fP \fBat\fP configure \fBtime\fP, \fBthe\fP \fC\fBRSB_NUM_THREADS\fP\fP \fBenvironment\fP \fBvariable\fP \fBwill\fP \fBoverride\fP \fBthe\fP \fBnumber\fP \fBof\fP \fBexecuting\fP \fBthreads\fP \fBspecified\fP \fBby\fP \fC\fBOMP_NUM_THREADS\fP\fP\&. (\fBSee\fP \fBalso\fP \fBRSB_IO_WANT_EXECUTING_THREADS\fP)\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_dusmv_ (\fBconst\fP \fBenum\fP \fBblas_trans_type\fP * transA, \fBdouble\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP * A, \fBconst\fP \fBdouble\fP * x, \fBconst\fP \fBint\fP * incx, \fBdouble\fP * y, \fBconst\fP \fBint\fP * incy, \fBint\fP * istat)" Multiply by a dense vector\&. Either of $Y <- alpha A X + Y ,$ .br $Y <- alpha A^T X + Y,$ .br $Y <- alpha A^H X + Y$, depending on the value of \fCtransA\fP\&. .PP \fBParameters\fP .RS 4 \fItransA\fP Transposition operator for matrix \fIA\fP\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIA\fP A valid matrix handle\&. .br \fIx\fP Dense vector \fIx\fP\&. .br \fIincx\fP Stride of \fIx\fP\&. .br \fIy\fP Dense vector \fIy\fP\&. .br \fIincy\fP Stride of \fIy\fP\&. .RE .PP \fBNote\fP .RS 4 .PP .PP By setting the \fC\fBblas_rsb_autotune_next_operation\fP\fP property via \fBBLAS_ussp\fP (at any time) the next multiplication routine call (either of \fBBLAS_dusmv\fP, \fBBLAS_susmv\fP, \fBBLAS_zusmv\fP, \fBBLAS_cusmv\fP, \fBBLAS_dusmm\fP, \fBBLAS_susmm\fP, \fBBLAS_zusmm\fP, \fBBLAS_cusmm\fP) will invoke autotuning before carrying out the effective operation\&. The tuning will take in account parameters like transposition, number of right hand sides, and scaling constants\&. By setting the \fC\fBblas_rsb_spmv_autotuning_on\fP\fP property via \fBBLAS_ussp\fP, the default number of executing threads for this matrix will be determined once, at matrix assembly time, and employed irrespective of the default threads count (different values for transposed and untransposed multiply)\&. This can be overridden only by setting the \fCRSB_NUM_THREADS\fP environment variable\&. .RE .PP \fBSee also\fP .RS 4 \fBOn\fP \fBthe\fP \fBtopic\fP \fBof\fP \fBautotuning\fP, \fBsee\fP \fBalso\fP \fBrsb_tune_spmm\fP\&. .br \fBIf\fP \fC--enable-rsb-num-threads\fP \fBhas\fP \fBbeen\fP \fBspecified\fP \fBat\fP configure \fBtime\fP, \fBthe\fP \fC\fBRSB_NUM_THREADS\fP\fP \fBenvironment\fP \fBvariable\fP \fBwill\fP \fBoverride\fP \fBthe\fP \fBnumber\fP \fBof\fP \fBexecuting\fP \fBthreads\fP \fBspecified\fP \fBby\fP \fC\fBOMP_NUM_THREADS\fP\fP\&. (\fBSee\fP \fBalso\fP \fBRSB_IO_WANT_EXECUTING_THREADS\fP)\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_dusrows_scale (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBdouble\fP * d, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP trans)" Scale rows interval of matrix by specified factor\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fId\fP Rows scaling vector\&. .br \fItrans\fP Transposition parameter (if transposed will scale columns)\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_dusrows_scale_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBdouble\fP * d, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP * trans, \fBint\fP * istat)" Scale rows interval of matrix by specified factor\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fId\fP Rows scaling vector\&. .br \fItrans\fP Transposition parameter (if transposed will scale columns)\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_dussc (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBdouble\fP * x, \fBdouble\fP * y, \fBconst\fP \fBint\fP incy, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse scatter: $Y |_x <- X$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_dussc_ (\fBconst\fP \fBint\fP * nnz, \fBconst\fP \fBdouble\fP * x, \fBdouble\fP * y, \fBconst\fP \fBint\fP * incy, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse scatter: $Y |_x <- X$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBint\fP BLAS_dusset_element (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP i, \fBconst\fP \fBint\fP j, \fBdouble\fP * v)" Set a single (existing) matrix nonzero coefficient $A_{i,j}$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fIj\fP Column index\&. .br \fIv\fP Value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_dusset_element_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * i, \fBconst\fP \fBint\fP * j, \fBdouble\fP * v, \fBint\fP * istat)" Set a single (existing) matrix nonzero coefficient $A_{i,j}$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fIj\fP Column index\&. .br \fIv\fP Value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_dusset_elements (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP * ia, \fBconst\fP \fBint\fP * ja, \fBconst\fP \fBdouble\fP * va, \fBconst\fP \fBint\fP nnz)" Set individual matrix nonzero coefficients values\&. The operation is pattern preserving, that is, nonzeroes must already exist\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIia\fP Row indices array\&. .br \fIja\fP Column indices array\&. .br \fIva\fP Values array\&. .br \fInnz\fP Length of the \fCia\fP,ja,va arrays\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&.\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_dusset_elements_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * ia, \fBconst\fP \fBint\fP * ja, \fBconst\fP \fBdouble\fP * va, \fBconst\fP \fBint\fP * nnz, \fBint\fP * istat)" Set individual matrix nonzero coefficients values\&. The operation is pattern preserving, that is, nonzeroes must already exist\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIia\fP Row indices array\&. .br \fIja\fP Column indices array\&. .br \fIva\fP Values array\&. .br \fInnz\fP Length of the \fCia\fP,ja,va arrays\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&.\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_dussm (\fBconst\fP \fBenum\fP \fBblas_order_type\fP order, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP transT, \fBconst\fP \fBint\fP nrhs, \fBdouble\fP alpha, \fBconst\fP \fBblas_sparse_matrix\fP T, \fBdouble\fP * b, \fBconst\fP \fBint\fP ldb)" Triangular solve, by a dense matrix (aka multi-vector)\&. Either of $B <- alpha T^{-1} B,$ $B <- alpha T^{-T} B,$ $B <- alpha T^{-H} B$, depending on the value of \fCtransT\fP\&. .PP \fBParameters\fP .RS 4 \fIorder\fP layour of the dense array\&. .br \fItransT\fP Transposition operator for matrix \fIT\fP\&. .br \fInrhs\fP Number of right hand side columns\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIT\fP A valid triangular matrix handle\&. .br \fIb\fP Dense vector \fIb\fP\&. .br \fIldb\fP Leading dimension of \fIb\fP\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_dussm_ (\fBconst\fP \fBenum\fP \fBblas_order_type\fP * order, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP * transT, \fBconst\fP \fBint\fP * nrhs, \fBdouble\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP * T, \fBdouble\fP * b, \fBconst\fP \fBint\fP * ldb, \fBint\fP * istat)" Triangular solve, by a dense matrix (aka multi-vector)\&. Either of $B <- alpha T^{-1} B,$ $B <- alpha T^{-T} B,$ $B <- alpha T^{-H} B$, depending on the value of \fCtransT\fP\&. .PP \fBParameters\fP .RS 4 \fIorder\fP layour of the dense array\&. .br \fItransT\fP Transposition operator for matrix \fIT\fP\&. .br \fInrhs\fP Number of right hand side columns\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIT\fP A valid triangular matrix handle\&. .br \fIb\fP Dense vector \fIb\fP\&. .br \fIldb\fP Leading dimension of \fIb\fP\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_dussv (\fBenum\fP \fBblas_trans_type\fP transT, \fBdouble\fP alpha, \fBconst\fP \fBblas_sparse_matrix\fP T, \fBdouble\fP * x, \fBconst\fP \fBint\fP incx)" Triangular solve, by a dense vector\&. Either of $X <- alpha T^{-1}X,$ $X <- alpha T^{-T}X,$ $X <- alpha T^{-H}X$, depending on the value of \fCtransT\fP\&. .PP \fBParameters\fP .RS 4 \fItransT\fP Transposition operator for matrix \fIT\fP\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIT\fP A valid triangular matrix handle\&. .br \fIx\fP Dense vector \fIx\fP\&. .br \fIincx\fP Stride of \fIx\fP\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_dussv_ (\fBenum\fP \fBblas_trans_type\fP * transT, \fBdouble\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP * T, \fBdouble\fP * x, \fBconst\fP \fBint\fP * incx, \fBint\fP * istat)" Triangular solve, by a dense vector\&. Either of $X <- alpha T^{-1}X,$ $X <- alpha T^{-T}X,$ $X <- alpha T^{-H}X$, depending on the value of \fCtransT\fP\&. .PP \fBParameters\fP .RS 4 \fItransT\fP Transposition operator for matrix \fIT\fP\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIT\fP A valid triangular matrix handle\&. .br \fIx\fP Dense vector \fIx\fP\&. .br \fIincx\fP Stride of \fIx\fP\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_susaxpy (\fBconst\fP \fBint\fP nnz, \fBfloat\fP alpha, \fBconst\fP \fBfloat\fP * x, \fBconst\fP \fBint\fP * indx, \fBfloat\fP * y, \fBconst\fP \fBint\fP incy, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse vector update: $Y <- alpha X + Y$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&. .br \fIalpha\fP Will scale values of $X$ before accumulating to $Y$\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_susaxpy_ (\fBconst\fP \fBint\fP * nnz, \fBfloat\fP * alpha, \fBconst\fP \fBfloat\fP * x, \fBconst\fP \fBint\fP * indx, \fBfloat\fP * y, \fBconst\fP \fBint\fP * incy, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse vector update: $Y <- alpha X + Y$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&. .br \fIalpha\fP Will scale values of $X$ before accumulating to $Y$\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBblas_sparse_matrix\fP BLAS_suscr_begin (\fBint\fP m, \fBint\fP n)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIm\fP Is the count of rows\&. .br \fIn\fP Is the count of columns\&. .RE .PP \fBReturns\fP .RS 4 A matrix handle in case of success, or -1 on error\&. .RE .PP .SS "\fBvoid\fP blas_suscr_begin_ (\fBint\fP * m, \fBint\fP * n, \fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIm\fP Is the count of rows\&. .br \fIn\fP Is the count of columns\&. .br \fIA\fP A valid pointer to an empty matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br Will assign a valid matrix handle to $A$ in case of success, or set it to -1 on error\&. .RE .PP .SS "\fBblas_sparse_matrix\fP BLAS_suscr_block_begin (\fBint\fP Mb, \fBint\fP Nb, \fBint\fP k, \fBint\fP l)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIk,l\fP Are row and column dimensions when specifying a matrix as BCSR\&. .br \fIMb\fP Block rows count\&. .br \fINb\fP Block columns count\&. .RE .PP \fBReturns\fP .RS 4 A matrix handle in case of success, or -1 on error\&. .RE .PP .SS "\fBvoid\fP blas_suscr_block_begin_ (\fBint\fP * Mb, \fBint\fP * Nb, \fBint\fP * k, \fBint\fP * l, \fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIk,l\fP Are row and column dimensions when specifying a matrix as BCSR\&. .br \fIMb\fP Block rows count\&. .br \fINb\fP Block columns count\&. .br \fIA\fP A valid pointer to an empty matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br Will assign a valid matrix handle to $A$ in case of success, or set it to -1 on error\&. .RE .PP .SS "\fBint\fP BLAS_suscr_end (\fBblas_sparse_matrix\fP A)" Makes an assembled matrix out of a matrix in build state\&. After this, it is not possible anymore to insert nonzeroes, but computational routines\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_suscr_end_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Makes an assembled matrix out of a matrix in build state\&. After this, it is not possible anymore to insert nonzeroes, but computational routines\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_suscr_insert_block (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBfloat\fP * val, \fBint\fP row_stride, \fBint\fP col_stride, \fBint\fP i, \fBint\fP j)" Inserts a whole block in a matrix, assuming it is in build state\&. The block size is assumed to be the one specified when calling the (type) corresponding matrix blocked \fCbegin\fP function\&. If not called a blocked \fCbegin\fP function, will assume 1x1 (that is, no) blocking\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIval\fP Array of values\&. .br \fIrow_stride,col_stride\fP Row and column strides in accessing \fCval\fP\&. .br \fIi,j\fP Block row/column indices\&. .RE .PP \fBWarning\fP .RS 4 Signature of this routine for Fortran does not agree to the standard\&. This shall be corrected in a future release\&. .RE .PP \fBSee also\fP .RS 4 \fBBLAS_cuscr_block_begin\fP, \fBBLAS_cuscr_block_begin\fP, \fBBLAS_duscr_block_begin\fP, \fBBLAS_zuscr_block_begin\fP, \fBBLAS_cuscr_begin\fP, \fBBLAS_suscr_begin\fP, \fBBLAS_duscr_begin\fP, \fBBLAS_zuscr_begin\fP\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_suscr_insert_block_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBfloat\fP * val, \fBint\fP * row_stride, \fBint\fP * col_stride, \fBint\fP * i, \fBint\fP * j, \fBint\fP * istat)" Inserts a whole block in a matrix, assuming it is in build state\&. The block size is assumed to be the one specified when calling the (type) corresponding matrix blocked \fCbegin\fP function\&. If not called a blocked \fCbegin\fP function, will assume 1x1 (that is, no) blocking\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIval\fP Array of values\&. .br \fIrow_stride,col_stride\fP Row and column strides in accessing \fCval\fP\&. .br \fIi,j\fP Block row/column indices\&. .RE .PP \fBWarning\fP .RS 4 Signature of this routine for Fortran does not agree to the standard\&. This shall be corrected in a future release\&. .RE .PP \fBSee also\fP .RS 4 \fBBLAS_cuscr_block_begin\fP, \fBBLAS_cuscr_block_begin\fP, \fBBLAS_duscr_block_begin\fP, \fBBLAS_zuscr_block_begin\fP, \fBBLAS_cuscr_begin\fP, \fBBLAS_suscr_begin\fP, \fBBLAS_duscr_begin\fP, \fBBLAS_zuscr_begin\fP\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_suscr_insert_clique (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP k, \fBconst\fP \fBint\fP l, \fBconst\fP \fBfloat\fP * val, \fBconst\fP \fBint\fP row_stride, \fBconst\fP \fBint\fP col_stride, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBint\fP * jndx)" Inserts a whole clique in a matrix, assuming this is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIk,l\fP Clique rows and columns count\&. .br \fIval\fP Array of values\&. .br \fIrow_stride,col_stride\fP Row/columns stride in accessing the clique\&. .br \fIindx,jndx\fP Row/column indices arrays\&. .RE .PP \fBWarning\fP .RS 4 Signature of this routine for Fortran does not agree to the standard\&. This shall be corrected in a future release\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_suscr_insert_clique_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * k, \fBconst\fP \fBint\fP * l, \fBconst\fP \fBfloat\fP * val, \fBconst\fP \fBint\fP * row_stride, \fBconst\fP \fBint\fP * col_stride, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBint\fP * jndx, \fBint\fP * istat)" Inserts a whole clique in a matrix, assuming this is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIk,l\fP Clique rows and columns count\&. .br \fIval\fP Array of values\&. .br \fIrow_stride,col_stride\fP Row/columns stride in accessing the clique\&. .br \fIindx,jndx\fP Row/column indices arrays\&. .RE .PP \fBWarning\fP .RS 4 Signature of this routine for Fortran does not agree to the standard\&. This shall be corrected in a future release\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_suscr_insert_col (\fBblas_sparse_matrix\fP A, \fBint\fP j, \fBint\fP nnz, \fBconst\fP \fBfloat\fP * val, \fBconst\fP \fBint\fP * indx)" Inserts a whole column in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIj\fP Column index\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row indices array\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_suscr_insert_col_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * j, \fBint\fP * nnz, \fBconst\fP \fBfloat\fP * val, \fBconst\fP \fBint\fP * indx, \fBint\fP * istat)" Inserts a whole column in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIj\fP Column index\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row indices array\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_suscr_insert_entries (\fBblas_sparse_matrix\fP A, \fBint\fP nnz, \fBconst\fP \fBfloat\fP * val, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBint\fP * jndx)" Inserts entries in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row indices array\&. .br \fIjndx\fP Column indices array\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_suscr_insert_entries_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * nnz, \fBconst\fP \fBfloat\fP * val, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBint\fP * jndx, \fBint\fP * istat)" Inserts entries in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row indices array\&. .br \fIjndx\fP Column indices array\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_suscr_insert_entry (\fBblas_sparse_matrix\fP A, \fBfloat\fP val, \fBint\fP i, \fBint\fP j)" Inserts an entry in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIval\fP Array of values\&. .br \fIval\fP Array of values\&. .br \fIi,j\fP Row and column indices\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_suscr_insert_entry_ (\fBblas_sparse_matrix\fP * A, \fBfloat\fP * val, \fBint\fP * i, \fBint\fP * j, \fBint\fP * istat)" Inserts an entry in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIval\fP Array of values\&. .br \fIval\fP Array of values\&. .br \fIi,j\fP Row and column indices\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_suscr_insert_row (\fBblas_sparse_matrix\fP A, \fBint\fP i, \fBint\fP nnz, \fBconst\fP \fBfloat\fP * val, \fBconst\fP \fBint\fP * indx)" Inserts a whole row in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row index\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_suscr_insert_row_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * i, \fBint\fP * nnz, \fBconst\fP \fBfloat\fP * val, \fBconst\fP \fBint\fP * indx, \fBint\fP * istat)" Inserts a whole row in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row index\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBblas_sparse_matrix\fP BLAS_suscr_variable_block_begin (\fBint\fP Mb, \fBint\fP Nb, \fBconst\fP \fBint\fP * K, \fBconst\fP \fBint\fP * L)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIK,L\fP Are arrays specifying row/column block sizes when specifying a matrix as VBR\&. .br \fIMb\fP Block rows count\&. .br \fINb\fP Block columns count\&. .RE .PP \fBReturns\fP .RS 4 A matrix handle in case of success, or -1 on error\&. .RE .PP .SS "\fBvoid\fP blas_suscr_variable_block_begin_ (\fBint\fP * Mb, \fBint\fP * Nb, \fBconst\fP \fBint\fP * K, \fBconst\fP \fBint\fP * L, \fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIK,L\fP Are arrays specifying row/column block sizes when specifying a matrix as VBR\&. .br \fIMb\fP Block rows count\&. .br \fINb\fP Block columns count\&. .br \fIA\fP A valid pointer to an empty matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br Will assign a valid matrix handle to $A$ in case of success, or set it to -1 on error\&. .RE .PP .SS "\fBint\fP BLAS_susdot (\fBconst\fP \fBenum\fP \fBblas_conj_type\fP conj, \fBconst\fP \fBint\fP nnz, \fBconst\fP \fBfloat\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBfloat\fP * y, \fBconst\fP \fBint\fP incy, \fBfloat\fP * r, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse dot product\&. $r <- X^T Y,$ $r <- X^H Y$ .PP \fBParameters\fP .RS 4 \fIr\fP Sparse dot result array\&. .br \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&. .br \fIconj\fP If \fBblas_conj\fP, values of X will be considered conjugated\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_susdot_ (\fBconst\fP \fBenum\fP \fBblas_conj_type\fP * conj, \fBconst\fP \fBint\fP * nnz, \fBconst\fP \fBfloat\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBfloat\fP * y, \fBconst\fP \fBint\fP * incy, \fBfloat\fP * r, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse dot product\&. $r <- X^T Y,$ $r <- X^H Y$ .PP \fBParameters\fP .RS 4 \fIr\fP Sparse dot result array\&. .br \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&. .br \fIconj\fP If \fBblas_conj\fP, values of X will be considered conjugated\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBint\fP BLAS_susga (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBfloat\fP * y, \fBconst\fP \fBint\fP incy, \fBfloat\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse gather\&. $X <- Y |_x$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_susga_ (\fBconst\fP \fBint\fP * nnz, \fBconst\fP \fBfloat\fP * y, \fBconst\fP \fBint\fP * incy, \fBfloat\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse gather\&. $X <- Y |_x$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBint\fP BLAS_susget_diag (\fBblas_sparse_matrix\fP A, \fBfloat\fP * d)" Get matrix diagonal\&. $d <- diag(A)$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fId\fP Array for the diagonal entries\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_susget_diag_ (\fBblas_sparse_matrix\fP * A, \fBfloat\fP * d, \fBint\fP * istat)" Get matrix diagonal\&. $d <- diag(A)$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fId\fP Array for the diagonal entries\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_susget_element (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP i, \fBconst\fP \fBint\fP j, \fBfloat\fP * v)" Get a single matrix nonzero coefficient $A_{i,j}$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fIj\fP Column index\&. .br \fIv\fP Value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_susget_element_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * i, \fBconst\fP \fBint\fP * j, \fBfloat\fP * v, \fBint\fP * istat)" Get a single matrix nonzero coefficient $A_{i,j}$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fIj\fP Column index\&. .br \fIv\fP Value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_susget_infinity_norm (\fBblas_sparse_matrix\fP A, \fBfloat\fP * in, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP trans)" Get infinity norm of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIin\fP Infinity norm pointer\&. .br \fItrans\fP Transposition parameter\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_susget_infinity_norm_ (\fBblas_sparse_matrix\fP * A, \fBfloat\fP * in, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP * trans, \fBint\fP * istat)" Get infinity norm of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIin\fP Infinity norm pointer\&. .br \fItrans\fP Transposition parameter\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_susget_matrix_nnz (\fBblas_sparse_matrix\fP A, \fBint\fP * nnz)" Get nnz count of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fInnz\fP Output value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_susget_matrix_nnz_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * nnz, \fBint\fP * istat)" Get nnz count of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fInnz\fP Output value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_susget_rows_nnz (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP fr, \fBconst\fP \fBint\fP lr, \fBint\fP * nnzp)" Get nnz count of matrix row interval\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIfr\fP First row\&. .br \fIlr\fP Last row\&. .br \fInnzp\fP Pointer to the nonzeroes variable\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_susget_rows_nnz_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * fr, \fBconst\fP \fBint\fP * lr, \fBint\fP * nnzp, \fBint\fP * istat)" Get nnz count of matrix row interval\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIfr\fP First row\&. .br \fIlr\fP Last row\&. .br \fInnzp\fP Pointer to the nonzeroes variable\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_susget_rows_sparse (\fBblas_sparse_matrix\fP A, \fBfloat\fP * VA, \fBint\fP * IA, \fBint\fP * JA, \fBint\fP * nnz, \fBconst\fP \fBint\fP fr, \fBconst\fP \fBint\fP lr)" Get sparse rows of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIVA\fP pointer to values\&. .br \fIIA\fP Row indices array\&. .br \fIJA\fP Column indices array\&. .br \fInnz\fP Obtained nonzeroes\&. .br \fIfr\fP first row\&. .br \fIlr\fP Last row\&. .br .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_susget_rows_sparse_ (\fBblas_sparse_matrix\fP * A, \fBfloat\fP * VA, \fBint\fP * IA, \fBint\fP * JA, \fBint\fP * nnz, \fBconst\fP \fBint\fP * fr, \fBconst\fP \fBint\fP * lr, \fBint\fP * istat)" Get sparse rows of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIVA\fP pointer to values\&. .br \fIIA\fP Row indices array\&. .br \fIJA\fP Column indices array\&. .br \fInnz\fP Obtained nonzeroes\&. .br \fIfr\fP first row\&. .br \fIlr\fP Last row\&. .br .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_susgz (\fBconst\fP \fBint\fP nnz, \fBfloat\fP * y, \fBconst\fP \fBint\fP incy, \fBfloat\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse gather and zero\&. $X <- Y |_x;Y|_x <- 0$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_susgz_ (\fBconst\fP \fBint\fP * nnz, \fBfloat\fP * y, \fBconst\fP \fBint\fP * incy, \fBfloat\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse gather and zero\&. $X <- Y |_x;Y|_x <- 0$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBint\fP BLAS_susmm (\fBconst\fP \fBenum\fP \fBblas_order_type\fP order, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP transA, \fBconst\fP \fBint\fP nrhs, \fBfloat\fP alpha, \fBconst\fP \fBblas_sparse_matrix\fP A, \fBconst\fP \fBfloat\fP * b, \fBconst\fP \fBint\fP ldb, \fBfloat\fP * c, \fBconst\fP \fBint\fP ldc)" Multiply by a dense matrix (aka multi-vector)\&. Either of $C <- alpha AB+C,$ $C <- alpha A^T B+C,$ $C <- alpha A^H B+C$, depending on the value of \fCtransA\fP\&. .PP \fBParameters\fP .RS 4 \fIorder\fP layour of the dense array\&. .br \fItransA\fP Transposition operator for matrix \fIA\fP\&. .br \fInrhs\fP Number of right hand side columns\&. .br \fIA\fP A valid matrix handle\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIb\fP Dense vector \fIb\fP\&. .br \fIldb\fP Leading dimension of \fIb\fP\&. .br \fIc\fP Dense vector \fIc\fP\&. .br \fIldc\fP Leading dimension of \fIc\fP\&. .RE .PP \fBNote\fP .RS 4 .PP .PP By setting the \fC\fBblas_rsb_autotune_next_operation\fP\fP property via \fBBLAS_ussp\fP (at any time) the next multiplication routine call (either of \fBBLAS_dusmv\fP, \fBBLAS_susmv\fP, \fBBLAS_zusmv\fP, \fBBLAS_cusmv\fP, \fBBLAS_dusmm\fP, \fBBLAS_susmm\fP, \fBBLAS_zusmm\fP, \fBBLAS_cusmm\fP) will invoke autotuning before carrying out the effective operation\&. The tuning will take in account parameters like transposition, number of right hand sides, and scaling constants\&. By setting the \fC\fBblas_rsb_spmv_autotuning_on\fP\fP property via \fBBLAS_ussp\fP, the default number of executing threads for this matrix will be determined once, at matrix assembly time, and employed irrespective of the default threads count (different values for transposed and untransposed multiply)\&. This can be overridden only by setting the \fCRSB_NUM_THREADS\fP environment variable\&. .RE .PP \fBSee also\fP .RS 4 \fBOn\fP \fBthe\fP \fBtopic\fP \fBof\fP \fBautotuning\fP, \fBsee\fP \fBalso\fP \fBrsb_tune_spmm\fP\&.\\nIf \fC--enable-rsb-num-threads\fP \fBhas\fP \fBbeen\fP \fBspecified\fP \fBat\fP configure \fBtime\fP, \fBthe\fP \fC\fBRSB_NUM_THREADS\fP\fP \fBenvironment\fP \fBvariable\fP \fBwill\fP \fBoverride\fP \fBthe\fP \fBnumber\fP \fBof\fP \fBexecuting\fP \fBthreads\fP \fBspecified\fP \fBby\fP \fC\fBOMP_NUM_THREADS\fP\fP\&. (\fBSee\fP \fBalso\fP \fBRSB_IO_WANT_EXECUTING_THREADS\fP)\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_susmm_ (\fBconst\fP \fBenum\fP \fBblas_order_type\fP * order, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP * transA, \fBconst\fP \fBint\fP * nrhs, \fBfloat\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP * A, \fBconst\fP \fBfloat\fP * b, \fBconst\fP \fBint\fP * ldb, \fBfloat\fP * c, \fBconst\fP \fBint\fP * ldc, \fBint\fP * istat)" Multiply by a dense matrix (aka multi-vector)\&. Either of $C <- alpha AB+C,$ $C <- alpha A^T B+C,$ $C <- alpha A^H B+C$, depending on the value of \fCtransA\fP\&. .PP \fBParameters\fP .RS 4 \fIorder\fP layour of the dense array\&. .br \fItransA\fP Transposition operator for matrix \fIA\fP\&. .br \fInrhs\fP Number of right hand side columns\&. .br \fIA\fP A valid matrix handle\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIb\fP Dense vector \fIb\fP\&. .br \fIldb\fP Leading dimension of \fIb\fP\&. .br \fIc\fP Dense vector \fIc\fP\&. .br \fIldc\fP Leading dimension of \fIc\fP\&. .RE .PP \fBNote\fP .RS 4 .PP .PP By setting the \fC\fBblas_rsb_autotune_next_operation\fP\fP property via \fBBLAS_ussp\fP (at any time) the next multiplication routine call (either of \fBBLAS_dusmv\fP, \fBBLAS_susmv\fP, \fBBLAS_zusmv\fP, \fBBLAS_cusmv\fP, \fBBLAS_dusmm\fP, \fBBLAS_susmm\fP, \fBBLAS_zusmm\fP, \fBBLAS_cusmm\fP) will invoke autotuning before carrying out the effective operation\&. The tuning will take in account parameters like transposition, number of right hand sides, and scaling constants\&. By setting the \fC\fBblas_rsb_spmv_autotuning_on\fP\fP property via \fBBLAS_ussp\fP, the default number of executing threads for this matrix will be determined once, at matrix assembly time, and employed irrespective of the default threads count (different values for transposed and untransposed multiply)\&. This can be overridden only by setting the \fCRSB_NUM_THREADS\fP environment variable\&. .RE .PP \fBSee also\fP .RS 4 \fBOn\fP \fBthe\fP \fBtopic\fP \fBof\fP \fBautotuning\fP, \fBsee\fP \fBalso\fP \fBrsb_tune_spmm\fP\&.\\nIf \fC--enable-rsb-num-threads\fP \fBhas\fP \fBbeen\fP \fBspecified\fP \fBat\fP configure \fBtime\fP, \fBthe\fP \fC\fBRSB_NUM_THREADS\fP\fP \fBenvironment\fP \fBvariable\fP \fBwill\fP \fBoverride\fP \fBthe\fP \fBnumber\fP \fBof\fP \fBexecuting\fP \fBthreads\fP \fBspecified\fP \fBby\fP \fC\fBOMP_NUM_THREADS\fP\fP\&. (\fBSee\fP \fBalso\fP \fBRSB_IO_WANT_EXECUTING_THREADS\fP)\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_susmv (\fBconst\fP \fBenum\fP \fBblas_trans_type\fP transA, \fBfloat\fP alpha, \fBconst\fP \fBblas_sparse_matrix\fP A, \fBconst\fP \fBfloat\fP * x, \fBconst\fP \fBint\fP incx, \fBfloat\fP * y, \fBconst\fP \fBint\fP incy)" Multiply by a dense vector\&. Either of $Y <- alpha A X + Y ,$ .br $Y <- alpha A^T X + Y,$ .br $Y <- alpha A^H X + Y$, depending on the value of \fCtransA\fP\&. .PP \fBParameters\fP .RS 4 \fItransA\fP Transposition operator for matrix \fIA\fP\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIA\fP A valid matrix handle\&. .br \fIx\fP Dense vector \fIx\fP\&. .br \fIincx\fP Stride of \fIx\fP\&. .br \fIy\fP Dense vector \fIy\fP\&. .br \fIincy\fP Stride of \fIy\fP\&. .RE .PP \fBNote\fP .RS 4 .PP .PP By setting the \fC\fBblas_rsb_autotune_next_operation\fP\fP property via \fBBLAS_ussp\fP (at any time) the next multiplication routine call (either of \fBBLAS_dusmv\fP, \fBBLAS_susmv\fP, \fBBLAS_zusmv\fP, \fBBLAS_cusmv\fP, \fBBLAS_dusmm\fP, \fBBLAS_susmm\fP, \fBBLAS_zusmm\fP, \fBBLAS_cusmm\fP) will invoke autotuning before carrying out the effective operation\&. The tuning will take in account parameters like transposition, number of right hand sides, and scaling constants\&. By setting the \fC\fBblas_rsb_spmv_autotuning_on\fP\fP property via \fBBLAS_ussp\fP, the default number of executing threads for this matrix will be determined once, at matrix assembly time, and employed irrespective of the default threads count (different values for transposed and untransposed multiply)\&. This can be overridden only by setting the \fCRSB_NUM_THREADS\fP environment variable\&. .RE .PP \fBSee also\fP .RS 4 \fBOn\fP \fBthe\fP \fBtopic\fP \fBof\fP \fBautotuning\fP, \fBsee\fP \fBalso\fP \fBrsb_tune_spmm\fP\&. .br \fBIf\fP \fC--enable-rsb-num-threads\fP \fBhas\fP \fBbeen\fP \fBspecified\fP \fBat\fP configure \fBtime\fP, \fBthe\fP \fC\fBRSB_NUM_THREADS\fP\fP \fBenvironment\fP \fBvariable\fP \fBwill\fP \fBoverride\fP \fBthe\fP \fBnumber\fP \fBof\fP \fBexecuting\fP \fBthreads\fP \fBspecified\fP \fBby\fP \fC\fBOMP_NUM_THREADS\fP\fP\&. (\fBSee\fP \fBalso\fP \fBRSB_IO_WANT_EXECUTING_THREADS\fP)\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_susmv_ (\fBconst\fP \fBenum\fP \fBblas_trans_type\fP * transA, \fBfloat\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP * A, \fBconst\fP \fBfloat\fP * x, \fBconst\fP \fBint\fP * incx, \fBfloat\fP * y, \fBconst\fP \fBint\fP * incy, \fBint\fP * istat)" Multiply by a dense vector\&. Either of $Y <- alpha A X + Y ,$ .br $Y <- alpha A^T X + Y,$ .br $Y <- alpha A^H X + Y$, depending on the value of \fCtransA\fP\&. .PP \fBParameters\fP .RS 4 \fItransA\fP Transposition operator for matrix \fIA\fP\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIA\fP A valid matrix handle\&. .br \fIx\fP Dense vector \fIx\fP\&. .br \fIincx\fP Stride of \fIx\fP\&. .br \fIy\fP Dense vector \fIy\fP\&. .br \fIincy\fP Stride of \fIy\fP\&. .RE .PP \fBNote\fP .RS 4 .PP .PP By setting the \fC\fBblas_rsb_autotune_next_operation\fP\fP property via \fBBLAS_ussp\fP (at any time) the next multiplication routine call (either of \fBBLAS_dusmv\fP, \fBBLAS_susmv\fP, \fBBLAS_zusmv\fP, \fBBLAS_cusmv\fP, \fBBLAS_dusmm\fP, \fBBLAS_susmm\fP, \fBBLAS_zusmm\fP, \fBBLAS_cusmm\fP) will invoke autotuning before carrying out the effective operation\&. The tuning will take in account parameters like transposition, number of right hand sides, and scaling constants\&. By setting the \fC\fBblas_rsb_spmv_autotuning_on\fP\fP property via \fBBLAS_ussp\fP, the default number of executing threads for this matrix will be determined once, at matrix assembly time, and employed irrespective of the default threads count (different values for transposed and untransposed multiply)\&. This can be overridden only by setting the \fCRSB_NUM_THREADS\fP environment variable\&. .RE .PP \fBSee also\fP .RS 4 \fBOn\fP \fBthe\fP \fBtopic\fP \fBof\fP \fBautotuning\fP, \fBsee\fP \fBalso\fP \fBrsb_tune_spmm\fP\&. .br \fBIf\fP \fC--enable-rsb-num-threads\fP \fBhas\fP \fBbeen\fP \fBspecified\fP \fBat\fP configure \fBtime\fP, \fBthe\fP \fC\fBRSB_NUM_THREADS\fP\fP \fBenvironment\fP \fBvariable\fP \fBwill\fP \fBoverride\fP \fBthe\fP \fBnumber\fP \fBof\fP \fBexecuting\fP \fBthreads\fP \fBspecified\fP \fBby\fP \fC\fBOMP_NUM_THREADS\fP\fP\&. (\fBSee\fP \fBalso\fP \fBRSB_IO_WANT_EXECUTING_THREADS\fP)\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_susrows_scale (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBfloat\fP * d, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP trans)" Scale rows interval of matrix by specified factor\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fId\fP Rows scaling vector\&. .br \fItrans\fP Transposition parameter (if transposed will scale columns)\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_susrows_scale_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBfloat\fP * d, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP * trans, \fBint\fP * istat)" Scale rows interval of matrix by specified factor\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fId\fP Rows scaling vector\&. .br \fItrans\fP Transposition parameter (if transposed will scale columns)\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_sussc (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBfloat\fP * x, \fBfloat\fP * y, \fBconst\fP \fBint\fP incy, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse scatter: $Y |_x <- X$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_sussc_ (\fBconst\fP \fBint\fP * nnz, \fBconst\fP \fBfloat\fP * x, \fBfloat\fP * y, \fBconst\fP \fBint\fP * incy, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse scatter: $Y |_x <- X$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBint\fP BLAS_susset_element (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP i, \fBconst\fP \fBint\fP j, \fBfloat\fP * v)" Set a single (existing) matrix nonzero coefficient $A_{i,j}$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fIj\fP Column index\&. .br \fIv\fP Value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_susset_element_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * i, \fBconst\fP \fBint\fP * j, \fBfloat\fP * v, \fBint\fP * istat)" Set a single (existing) matrix nonzero coefficient $A_{i,j}$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fIj\fP Column index\&. .br \fIv\fP Value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_susset_elements (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP * ia, \fBconst\fP \fBint\fP * ja, \fBconst\fP \fBfloat\fP * va, \fBconst\fP \fBint\fP nnz)" Set individual matrix nonzero coefficients values\&. The operation is pattern preserving, that is, nonzeroes must already exist\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIia\fP Row indices array\&. .br \fIja\fP Column indices array\&. .br \fIva\fP Values array\&. .br \fInnz\fP Length of the \fCia\fP,ja,va arrays\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&.\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_susset_elements_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * ia, \fBconst\fP \fBint\fP * ja, \fBconst\fP \fBfloat\fP * va, \fBconst\fP \fBint\fP * nnz, \fBint\fP * istat)" Set individual matrix nonzero coefficients values\&. The operation is pattern preserving, that is, nonzeroes must already exist\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIia\fP Row indices array\&. .br \fIja\fP Column indices array\&. .br \fIva\fP Values array\&. .br \fInnz\fP Length of the \fCia\fP,ja,va arrays\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&.\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_sussm (\fBconst\fP \fBenum\fP \fBblas_order_type\fP order, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP transT, \fBconst\fP \fBint\fP nrhs, \fBfloat\fP alpha, \fBconst\fP \fBblas_sparse_matrix\fP T, \fBfloat\fP * b, \fBconst\fP \fBint\fP ldb)" Triangular solve, by a dense matrix (aka multi-vector)\&. Either of $B <- alpha T^{-1} B,$ $B <- alpha T^{-T} B,$ $B <- alpha T^{-H} B$, depending on the value of \fCtransT\fP\&. .PP \fBParameters\fP .RS 4 \fIorder\fP layour of the dense array\&. .br \fItransT\fP Transposition operator for matrix \fIT\fP\&. .br \fInrhs\fP Number of right hand side columns\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIT\fP A valid triangular matrix handle\&. .br \fIb\fP Dense vector \fIb\fP\&. .br \fIldb\fP Leading dimension of \fIb\fP\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_sussm_ (\fBconst\fP \fBenum\fP \fBblas_order_type\fP * order, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP * transT, \fBconst\fP \fBint\fP * nrhs, \fBfloat\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP * T, \fBfloat\fP * b, \fBconst\fP \fBint\fP * ldb, \fBint\fP * istat)" Triangular solve, by a dense matrix (aka multi-vector)\&. Either of $B <- alpha T^{-1} B,$ $B <- alpha T^{-T} B,$ $B <- alpha T^{-H} B$, depending on the value of \fCtransT\fP\&. .PP \fBParameters\fP .RS 4 \fIorder\fP layour of the dense array\&. .br \fItransT\fP Transposition operator for matrix \fIT\fP\&. .br \fInrhs\fP Number of right hand side columns\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIT\fP A valid triangular matrix handle\&. .br \fIb\fP Dense vector \fIb\fP\&. .br \fIldb\fP Leading dimension of \fIb\fP\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_sussv (\fBenum\fP \fBblas_trans_type\fP transT, \fBfloat\fP alpha, \fBconst\fP \fBblas_sparse_matrix\fP T, \fBfloat\fP * x, \fBconst\fP \fBint\fP incx)" Triangular solve, by a dense vector\&. Either of $X <- alpha T^{-1}X,$ $X <- alpha T^{-T}X,$ $X <- alpha T^{-H}X$, depending on the value of \fCtransT\fP\&. .PP \fBParameters\fP .RS 4 \fItransT\fP Transposition operator for matrix \fIT\fP\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIT\fP A valid triangular matrix handle\&. .br \fIx\fP Dense vector \fIx\fP\&. .br \fIincx\fP Stride of \fIx\fP\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_sussv_ (\fBenum\fP \fBblas_trans_type\fP * transT, \fBfloat\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP * T, \fBfloat\fP * x, \fBconst\fP \fBint\fP * incx, \fBint\fP * istat)" Triangular solve, by a dense vector\&. Either of $X <- alpha T^{-1}X,$ $X <- alpha T^{-T}X,$ $X <- alpha T^{-H}X$, depending on the value of \fCtransT\fP\&. .PP \fBParameters\fP .RS 4 \fItransT\fP Transposition operator for matrix \fIT\fP\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIT\fP A valid triangular matrix handle\&. .br \fIx\fP Dense vector \fIx\fP\&. .br \fIincx\fP Stride of \fIx\fP\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_uscr_end (\fBblas_sparse_matrix\fP A)" Makes an assembled matrix out of a matrix in build state\&. After this, it is not possible anymore to insert nonzeroes, but computational routines\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_uscr_end_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Makes an assembled matrix out of a matrix in build state\&. After this, it is not possible anymore to insert nonzeroes, but computational routines\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_usds (\fBblas_sparse_matrix\fP A)" Destroys a matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_usds_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Destroys a matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_usgp (\fBblas_sparse_matrix\fP A, \fBrsb_blas_pname_t\fP pname)" Get a matrix property\&. .PP \fBParameters\fP .RS 4 \fIA\fP A is the matrix to apply the property\&. .br \fIpname\fP The desired matrix property\&. For valid matrix properties, see \fBblas_rsb_ext_type\fP, \fBblas_uplo_type\fP, \fBblas_diag_type\fP, \fBblas_conj_type\fP, \fBblas_base_type\fP, \fBblas_symmetry_type\fP, \fBblas_field_type\fP, \fBblas_size_type\fP, \fBblas_sparsity_optimization_type\fP\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_usgp_ (\fBblas_sparse_matrix\fP * A, \fBrsb_blas_pname_t\fP * pname, \fBint\fP * istat)" Get a matrix property\&. .PP \fBParameters\fP .RS 4 \fIA\fP A is the matrix to apply the property\&. .br \fIpname\fP The desired matrix property\&. For valid matrix properties, see \fBblas_rsb_ext_type\fP, \fBblas_uplo_type\fP, \fBblas_diag_type\fP, \fBblas_conj_type\fP, \fBblas_base_type\fP, \fBblas_symmetry_type\fP, \fBblas_field_type\fP, \fBblas_size_type\fP, \fBblas_sparsity_optimization_type\fP\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_ussp (\fBblas_sparse_matrix\fP A, \fBrsb_blas_pname_t\fP pname)" Set a matrix property\&. Should be called just after creation, before nonzeroes insertion\&. .PP \fBParameters\fP .RS 4 \fIA\fP A is the matrix to apply the property\&. .br \fIpname\fP The desired matrix property\&. For valid matrix properties, see \fBblas_rsb_ext_type\fP, \fBblas_uplo_type\fP, \fBblas_diag_type\fP, \fBblas_conj_type\fP, \fBblas_base_type\fP, \fBblas_symmetry_type\fP, \fBblas_field_type\fP, \fBblas_size_type\fP, \fBblas_sparsity_optimization_type\fP\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_ussp_ (\fBblas_sparse_matrix\fP * A, \fBrsb_blas_pname_t\fP * pname, \fBint\fP * istat)" Set a matrix property\&. Should be called just after creation, before nonzeroes insertion\&. .PP \fBParameters\fP .RS 4 \fIA\fP A is the matrix to apply the property\&. .br \fIpname\fP The desired matrix property\&. For valid matrix properties, see \fBblas_rsb_ext_type\fP, \fBblas_uplo_type\fP, \fBblas_diag_type\fP, \fBblas_conj_type\fP, \fBblas_base_type\fP, \fBblas_symmetry_type\fP, \fBblas_field_type\fP, \fBblas_size_type\fP, \fBblas_sparsity_optimization_type\fP\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zusaxpy (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBvoid\fP * x, \fBconst\fP \fBint\fP * indx, \fBvoid\fP * y, \fBconst\fP \fBint\fP incy, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse vector update: $Y <- alpha X + Y$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&. .br \fIalpha\fP Will scale values of $X$ before accumulating to $Y$\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_zusaxpy_ (\fBconst\fP \fBint\fP * nnz, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBvoid\fP * x, \fBconst\fP \fBint\fP * indx, \fBvoid\fP * y, \fBconst\fP \fBint\fP * incy, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse vector update: $Y <- alpha X + Y$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&. .br \fIalpha\fP Will scale values of $X$ before accumulating to $Y$\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBblas_sparse_matrix\fP BLAS_zuscr_begin (\fBint\fP m, \fBint\fP n)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIm\fP Is the count of rows\&. .br \fIn\fP Is the count of columns\&. .RE .PP \fBReturns\fP .RS 4 A matrix handle in case of success, or -1 on error\&. .RE .PP .SS "\fBvoid\fP blas_zuscr_begin_ (\fBint\fP * m, \fBint\fP * n, \fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIm\fP Is the count of rows\&. .br \fIn\fP Is the count of columns\&. .br \fIA\fP A valid pointer to an empty matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br Will assign a valid matrix handle to $A$ in case of success, or set it to -1 on error\&. .RE .PP .SS "\fBblas_sparse_matrix\fP BLAS_zuscr_block_begin (\fBint\fP Mb, \fBint\fP Nb, \fBint\fP k, \fBint\fP l)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIk,l\fP Are row and column dimensions when specifying a matrix as BCSR\&. .br \fIMb\fP Block rows count\&. .br \fINb\fP Block columns count\&. .RE .PP \fBReturns\fP .RS 4 A matrix handle in case of success, or -1 on error\&. .RE .PP .SS "\fBvoid\fP blas_zuscr_block_begin_ (\fBint\fP * Mb, \fBint\fP * Nb, \fBint\fP * k, \fBint\fP * l, \fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIk,l\fP Are row and column dimensions when specifying a matrix as BCSR\&. .br \fIMb\fP Block rows count\&. .br \fINb\fP Block columns count\&. .br \fIA\fP A valid pointer to an empty matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br Will assign a valid matrix handle to $A$ in case of success, or set it to -1 on error\&. .RE .PP .SS "\fBint\fP BLAS_zuscr_end (\fBblas_sparse_matrix\fP A)" Makes an assembled matrix out of a matrix in build state\&. After this, it is not possible anymore to insert nonzeroes, but computational routines\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zuscr_end_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Makes an assembled matrix out of a matrix in build state\&. After this, it is not possible anymore to insert nonzeroes, but computational routines\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zuscr_insert_block (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBvoid\fP * val, \fBint\fP row_stride, \fBint\fP col_stride, \fBint\fP i, \fBint\fP j)" Inserts a whole block in a matrix, assuming it is in build state\&. The block size is assumed to be the one specified when calling the (type) corresponding matrix blocked \fCbegin\fP function\&. If not called a blocked \fCbegin\fP function, will assume 1x1 (that is, no) blocking\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIval\fP Array of values\&. .br \fIrow_stride,col_stride\fP Row and column strides in accessing \fCval\fP\&. .br \fIi,j\fP Block row/column indices\&. .RE .PP \fBWarning\fP .RS 4 Signature of this routine for Fortran does not agree to the standard\&. This shall be corrected in a future release\&. .RE .PP \fBSee also\fP .RS 4 \fBBLAS_cuscr_block_begin\fP, \fBBLAS_cuscr_block_begin\fP, \fBBLAS_duscr_block_begin\fP, \fBBLAS_zuscr_block_begin\fP, \fBBLAS_cuscr_begin\fP, \fBBLAS_suscr_begin\fP, \fBBLAS_duscr_begin\fP, \fBBLAS_zuscr_begin\fP\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zuscr_insert_block_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBvoid\fP * val, \fBint\fP * row_stride, \fBint\fP * col_stride, \fBint\fP * i, \fBint\fP * j, \fBint\fP * istat)" Inserts a whole block in a matrix, assuming it is in build state\&. The block size is assumed to be the one specified when calling the (type) corresponding matrix blocked \fCbegin\fP function\&. If not called a blocked \fCbegin\fP function, will assume 1x1 (that is, no) blocking\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIval\fP Array of values\&. .br \fIrow_stride,col_stride\fP Row and column strides in accessing \fCval\fP\&. .br \fIi,j\fP Block row/column indices\&. .RE .PP \fBWarning\fP .RS 4 Signature of this routine for Fortran does not agree to the standard\&. This shall be corrected in a future release\&. .RE .PP \fBSee also\fP .RS 4 \fBBLAS_cuscr_block_begin\fP, \fBBLAS_cuscr_block_begin\fP, \fBBLAS_duscr_block_begin\fP, \fBBLAS_zuscr_block_begin\fP, \fBBLAS_cuscr_begin\fP, \fBBLAS_suscr_begin\fP, \fBBLAS_duscr_begin\fP, \fBBLAS_zuscr_begin\fP\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zuscr_insert_clique (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP k, \fBconst\fP \fBint\fP l, \fBconst\fP \fBvoid\fP * val, \fBconst\fP \fBint\fP row_stride, \fBconst\fP \fBint\fP col_stride, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBint\fP * jndx)" Inserts a whole clique in a matrix, assuming this is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIk,l\fP Clique rows and columns count\&. .br \fIval\fP Array of values\&. .br \fIrow_stride,col_stride\fP Row/columns stride in accessing the clique\&. .br \fIindx,jndx\fP Row/column indices arrays\&. .RE .PP \fBWarning\fP .RS 4 Signature of this routine for Fortran does not agree to the standard\&. This shall be corrected in a future release\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zuscr_insert_clique_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * k, \fBconst\fP \fBint\fP * l, \fBconst\fP \fBvoid\fP * val, \fBconst\fP \fBint\fP * row_stride, \fBconst\fP \fBint\fP * col_stride, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBint\fP * jndx, \fBint\fP * istat)" Inserts a whole clique in a matrix, assuming this is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIk,l\fP Clique rows and columns count\&. .br \fIval\fP Array of values\&. .br \fIrow_stride,col_stride\fP Row/columns stride in accessing the clique\&. .br \fIindx,jndx\fP Row/column indices arrays\&. .RE .PP \fBWarning\fP .RS 4 Signature of this routine for Fortran does not agree to the standard\&. This shall be corrected in a future release\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zuscr_insert_col (\fBblas_sparse_matrix\fP A, \fBint\fP j, \fBint\fP nnz, \fBconst\fP \fBvoid\fP * val, \fBconst\fP \fBint\fP * indx)" Inserts a whole column in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIj\fP Column index\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row indices array\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zuscr_insert_col_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * j, \fBint\fP * nnz, \fBconst\fP \fBvoid\fP * val, \fBconst\fP \fBint\fP * indx, \fBint\fP * istat)" Inserts a whole column in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIj\fP Column index\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row indices array\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zuscr_insert_entries (\fBblas_sparse_matrix\fP A, \fBint\fP nnz, \fBconst\fP \fBvoid\fP * val, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBint\fP * jndx)" Inserts entries in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row indices array\&. .br \fIjndx\fP Column indices array\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zuscr_insert_entries_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * nnz, \fBconst\fP \fBvoid\fP * val, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBint\fP * jndx, \fBint\fP * istat)" Inserts entries in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row indices array\&. .br \fIjndx\fP Column indices array\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zuscr_insert_entry (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBvoid\fP * val, \fBint\fP i, \fBint\fP j)" Inserts an entry in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIval\fP Array of values\&. .br \fIval\fP Array of values\&. .br \fIi,j\fP Row and column indices\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zuscr_insert_entry_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBvoid\fP * val, \fBint\fP * i, \fBint\fP * j, \fBint\fP * istat)" Inserts an entry in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIval\fP Array of values\&. .br \fIval\fP Array of values\&. .br \fIi,j\fP Row and column indices\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zuscr_insert_row (\fBblas_sparse_matrix\fP A, \fBint\fP i, \fBint\fP nnz, \fBconst\fP \fBvoid\fP * val, \fBconst\fP \fBint\fP * indx)" Inserts a whole row in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row index\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zuscr_insert_row_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * i, \fBint\fP * nnz, \fBconst\fP \fBvoid\fP * val, \fBconst\fP \fBint\fP * indx, \fBint\fP * istat)" Inserts a whole row in a matrix, assuming it is in build state\&. By default, duplicate entries will be summed together\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fInnz\fP Number of nonzeroes to insert\&. .br \fIval\fP Array of values\&. .br \fIindx\fP Row index\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBblas_sparse_matrix\fP BLAS_zuscr_variable_block_begin (\fBint\fP Mb, \fBint\fP Nb, \fBconst\fP \fBint\fP * K, \fBconst\fP \fBint\fP * L)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIK,L\fP Are arrays specifying row/column block sizes when specifying a matrix as VBR\&. .br \fIMb\fP Block rows count\&. .br \fINb\fP Block columns count\&. .RE .PP \fBReturns\fP .RS 4 A matrix handle in case of success, or -1 on error\&. .RE .PP .SS "\fBvoid\fP blas_zuscr_variable_block_begin_ (\fBint\fP * Mb, \fBint\fP * Nb, \fBconst\fP \fBint\fP * K, \fBconst\fP \fBint\fP * L, \fBblas_sparse_matrix\fP * A, \fBint\fP * istat)" Allocates an empty matrix (A) and leaves it in build state\&. .PP \fBParameters\fP .RS 4 \fIK,L\fP Are arrays specifying row/column block sizes when specifying a matrix as VBR\&. .br \fIMb\fP Block rows count\&. .br \fINb\fP Block columns count\&. .br \fIA\fP A valid pointer to an empty matrix handle\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br Will assign a valid matrix handle to $A$ in case of success, or set it to -1 on error\&. .RE .PP .SS "\fBint\fP BLAS_zusdot (\fBconst\fP \fBenum\fP \fBblas_conj_type\fP conj, \fBconst\fP \fBint\fP nnz, \fBconst\fP \fBvoid\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBvoid\fP * y, \fBconst\fP \fBint\fP incy, \fBvoid\fP * r, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse dot product\&. $r <- X^T Y,$ $r <- X^H Y$ .PP \fBParameters\fP .RS 4 \fIr\fP Sparse dot result array\&. .br \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&. .br \fIconj\fP If \fBblas_conj\fP, values of X will be considered conjugated\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_zusdot_ (\fBconst\fP \fBenum\fP \fBblas_conj_type\fP * conj, \fBconst\fP \fBint\fP * nnz, \fBconst\fP \fBvoid\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBvoid\fP * y, \fBconst\fP \fBint\fP * incy, \fBvoid\fP * r, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse dot product\&. $r <- X^T Y,$ $r <- X^H Y$ .PP \fBParameters\fP .RS 4 \fIr\fP Sparse dot result array\&. .br \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&. .br \fIconj\fP If \fBblas_conj\fP, values of X will be considered conjugated\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBint\fP BLAS_zusga (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBvoid\fP * y, \fBconst\fP \fBint\fP incy, \fBvoid\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse gather\&. $X <- Y |_x$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_zusga_ (\fBconst\fP \fBint\fP * nnz, \fBconst\fP \fBvoid\fP * y, \fBconst\fP \fBint\fP * incy, \fBvoid\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse gather\&. $X <- Y |_x$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBint\fP BLAS_zusget_diag (\fBblas_sparse_matrix\fP A, \fBvoid\fP * d)" Get matrix diagonal\&. $d <- diag(A)$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fId\fP Array for the diagonal entries\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zusget_diag_ (\fBblas_sparse_matrix\fP * A, \fBvoid\fP * d, \fBint\fP * istat)" Get matrix diagonal\&. $d <- diag(A)$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fId\fP Array for the diagonal entries\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zusget_element (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP i, \fBconst\fP \fBint\fP j, \fBvoid\fP * v)" Get a single matrix nonzero coefficient $A_{i,j}$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fIj\fP Column index\&. .br \fIv\fP Value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zusget_element_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * i, \fBconst\fP \fBint\fP * j, \fBvoid\fP * v, \fBint\fP * istat)" Get a single matrix nonzero coefficient $A_{i,j}$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fIj\fP Column index\&. .br \fIv\fP Value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zusget_infinity_norm (\fBblas_sparse_matrix\fP A, \fBvoid\fP * in, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP trans)" Get infinity norm of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIin\fP Infinity norm pointer\&. .br \fItrans\fP Transposition parameter\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zusget_infinity_norm_ (\fBblas_sparse_matrix\fP * A, \fBvoid\fP * in, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP * trans, \fBint\fP * istat)" Get infinity norm of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIin\fP Infinity norm pointer\&. .br \fItrans\fP Transposition parameter\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zusget_matrix_nnz (\fBblas_sparse_matrix\fP A, \fBint\fP * nnz)" Get nnz count of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fInnz\fP Output value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zusget_matrix_nnz_ (\fBblas_sparse_matrix\fP * A, \fBint\fP * nnz, \fBint\fP * istat)" Get nnz count of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fInnz\fP Output value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zusget_rows_nnz (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP fr, \fBconst\fP \fBint\fP lr, \fBint\fP * nnzp)" Get nnz count of matrix row interval\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIfr\fP First row\&. .br \fIlr\fP Last row\&. .br \fInnzp\fP Pointer to the nonzeroes variable\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zusget_rows_nnz_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * fr, \fBconst\fP \fBint\fP * lr, \fBint\fP * nnzp, \fBint\fP * istat)" Get nnz count of matrix row interval\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIfr\fP First row\&. .br \fIlr\fP Last row\&. .br \fInnzp\fP Pointer to the nonzeroes variable\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zusget_rows_sparse (\fBblas_sparse_matrix\fP A, \fBvoid\fP * VA, \fBint\fP * IA, \fBint\fP * JA, \fBint\fP * nnz, \fBconst\fP \fBint\fP fr, \fBconst\fP \fBint\fP lr)" Get sparse rows of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIVA\fP pointer to values\&. .br \fIIA\fP Row indices array\&. .br \fIJA\fP Column indices array\&. .br \fInnz\fP Obtained nonzeroes\&. .br \fIfr\fP first row\&. .br \fIlr\fP Last row\&. .br .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zusget_rows_sparse_ (\fBblas_sparse_matrix\fP * A, \fBvoid\fP * VA, \fBint\fP * IA, \fBint\fP * JA, \fBint\fP * nnz, \fBconst\fP \fBint\fP * fr, \fBconst\fP \fBint\fP * lr, \fBint\fP * istat)" Get sparse rows of matrix\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIVA\fP pointer to values\&. .br \fIIA\fP Row indices array\&. .br \fIJA\fP Column indices array\&. .br \fInnz\fP Obtained nonzeroes\&. .br \fIfr\fP first row\&. .br \fIlr\fP Last row\&. .br .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zusgz (\fBconst\fP \fBint\fP nnz, \fBvoid\fP * y, \fBconst\fP \fBint\fP incy, \fBvoid\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse gather and zero\&. $X <- Y |_x;Y|_x <- 0$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_zusgz_ (\fBconst\fP \fBint\fP * nnz, \fBvoid\fP * y, \fBconst\fP \fBint\fP * incy, \fBvoid\fP * x, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse gather and zero\&. $X <- Y |_x;Y|_x <- 0$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBint\fP BLAS_zusmm (\fBconst\fP \fBenum\fP \fBblas_order_type\fP order, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP transA, \fBconst\fP \fBint\fP nrhs, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP A, \fBconst\fP \fBvoid\fP * b, \fBconst\fP \fBint\fP ldb, \fBvoid\fP * c, \fBconst\fP \fBint\fP ldc)" Multiply by a dense matrix (aka multi-vector)\&. Either of $C <- alpha AB+C,$ $C <- alpha A^T B+C,$ $C <- alpha A^H B+C$, depending on the value of \fCtransA\fP\&. .PP \fBParameters\fP .RS 4 \fIorder\fP layour of the dense array\&. .br \fItransA\fP Transposition operator for matrix \fIA\fP\&. .br \fInrhs\fP Number of right hand side columns\&. .br \fIA\fP A valid matrix handle\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIb\fP Dense vector \fIb\fP\&. .br \fIldb\fP Leading dimension of \fIb\fP\&. .br \fIc\fP Dense vector \fIc\fP\&. .br \fIldc\fP Leading dimension of \fIc\fP\&. .RE .PP \fBNote\fP .RS 4 .PP .PP By setting the \fC\fBblas_rsb_autotune_next_operation\fP\fP property via \fBBLAS_ussp\fP (at any time) the next multiplication routine call (either of \fBBLAS_dusmv\fP, \fBBLAS_susmv\fP, \fBBLAS_zusmv\fP, \fBBLAS_cusmv\fP, \fBBLAS_dusmm\fP, \fBBLAS_susmm\fP, \fBBLAS_zusmm\fP, \fBBLAS_cusmm\fP) will invoke autotuning before carrying out the effective operation\&. The tuning will take in account parameters like transposition, number of right hand sides, and scaling constants\&. By setting the \fC\fBblas_rsb_spmv_autotuning_on\fP\fP property via \fBBLAS_ussp\fP, the default number of executing threads for this matrix will be determined once, at matrix assembly time, and employed irrespective of the default threads count (different values for transposed and untransposed multiply)\&. This can be overridden only by setting the \fCRSB_NUM_THREADS\fP environment variable\&. .RE .PP \fBSee also\fP .RS 4 \fBOn\fP \fBthe\fP \fBtopic\fP \fBof\fP \fBautotuning\fP, \fBsee\fP \fBalso\fP \fBrsb_tune_spmm\fP\&.\\nIf \fC--enable-rsb-num-threads\fP \fBhas\fP \fBbeen\fP \fBspecified\fP \fBat\fP configure \fBtime\fP, \fBthe\fP \fC\fBRSB_NUM_THREADS\fP\fP \fBenvironment\fP \fBvariable\fP \fBwill\fP \fBoverride\fP \fBthe\fP \fBnumber\fP \fBof\fP \fBexecuting\fP \fBthreads\fP \fBspecified\fP \fBby\fP \fC\fBOMP_NUM_THREADS\fP\fP\&. (\fBSee\fP \fBalso\fP \fBRSB_IO_WANT_EXECUTING_THREADS\fP)\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zusmm_ (\fBconst\fP \fBenum\fP \fBblas_order_type\fP * order, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP * transA, \fBconst\fP \fBint\fP * nrhs, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP * A, \fBconst\fP \fBvoid\fP * b, \fBconst\fP \fBint\fP * ldb, \fBvoid\fP * c, \fBconst\fP \fBint\fP * ldc, \fBint\fP * istat)" Multiply by a dense matrix (aka multi-vector)\&. Either of $C <- alpha AB+C,$ $C <- alpha A^T B+C,$ $C <- alpha A^H B+C$, depending on the value of \fCtransA\fP\&. .PP \fBParameters\fP .RS 4 \fIorder\fP layour of the dense array\&. .br \fItransA\fP Transposition operator for matrix \fIA\fP\&. .br \fInrhs\fP Number of right hand side columns\&. .br \fIA\fP A valid matrix handle\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIb\fP Dense vector \fIb\fP\&. .br \fIldb\fP Leading dimension of \fIb\fP\&. .br \fIc\fP Dense vector \fIc\fP\&. .br \fIldc\fP Leading dimension of \fIc\fP\&. .RE .PP \fBNote\fP .RS 4 .PP .PP By setting the \fC\fBblas_rsb_autotune_next_operation\fP\fP property via \fBBLAS_ussp\fP (at any time) the next multiplication routine call (either of \fBBLAS_dusmv\fP, \fBBLAS_susmv\fP, \fBBLAS_zusmv\fP, \fBBLAS_cusmv\fP, \fBBLAS_dusmm\fP, \fBBLAS_susmm\fP, \fBBLAS_zusmm\fP, \fBBLAS_cusmm\fP) will invoke autotuning before carrying out the effective operation\&. The tuning will take in account parameters like transposition, number of right hand sides, and scaling constants\&. By setting the \fC\fBblas_rsb_spmv_autotuning_on\fP\fP property via \fBBLAS_ussp\fP, the default number of executing threads for this matrix will be determined once, at matrix assembly time, and employed irrespective of the default threads count (different values for transposed and untransposed multiply)\&. This can be overridden only by setting the \fCRSB_NUM_THREADS\fP environment variable\&. .RE .PP \fBSee also\fP .RS 4 \fBOn\fP \fBthe\fP \fBtopic\fP \fBof\fP \fBautotuning\fP, \fBsee\fP \fBalso\fP \fBrsb_tune_spmm\fP\&.\\nIf \fC--enable-rsb-num-threads\fP \fBhas\fP \fBbeen\fP \fBspecified\fP \fBat\fP configure \fBtime\fP, \fBthe\fP \fC\fBRSB_NUM_THREADS\fP\fP \fBenvironment\fP \fBvariable\fP \fBwill\fP \fBoverride\fP \fBthe\fP \fBnumber\fP \fBof\fP \fBexecuting\fP \fBthreads\fP \fBspecified\fP \fBby\fP \fC\fBOMP_NUM_THREADS\fP\fP\&. (\fBSee\fP \fBalso\fP \fBRSB_IO_WANT_EXECUTING_THREADS\fP)\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zusmv (\fBconst\fP \fBenum\fP \fBblas_trans_type\fP transA, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP A, \fBconst\fP \fBvoid\fP * x, \fBconst\fP \fBint\fP incx, \fBvoid\fP * y, \fBconst\fP \fBint\fP incy)" Multiply by a dense vector\&. Either of $Y <- alpha A X + Y ,$ .br $Y <- alpha A^T X + Y,$ .br $Y <- alpha A^H X + Y$, depending on the value of \fCtransA\fP\&. .PP \fBParameters\fP .RS 4 \fItransA\fP Transposition operator for matrix \fIA\fP\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIA\fP A valid matrix handle\&. .br \fIx\fP Dense vector \fIx\fP\&. .br \fIincx\fP Stride of \fIx\fP\&. .br \fIy\fP Dense vector \fIy\fP\&. .br \fIincy\fP Stride of \fIy\fP\&. .RE .PP \fBNote\fP .RS 4 .PP .PP By setting the \fC\fBblas_rsb_autotune_next_operation\fP\fP property via \fBBLAS_ussp\fP (at any time) the next multiplication routine call (either of \fBBLAS_dusmv\fP, \fBBLAS_susmv\fP, \fBBLAS_zusmv\fP, \fBBLAS_cusmv\fP, \fBBLAS_dusmm\fP, \fBBLAS_susmm\fP, \fBBLAS_zusmm\fP, \fBBLAS_cusmm\fP) will invoke autotuning before carrying out the effective operation\&. The tuning will take in account parameters like transposition, number of right hand sides, and scaling constants\&. By setting the \fC\fBblas_rsb_spmv_autotuning_on\fP\fP property via \fBBLAS_ussp\fP, the default number of executing threads for this matrix will be determined once, at matrix assembly time, and employed irrespective of the default threads count (different values for transposed and untransposed multiply)\&. This can be overridden only by setting the \fCRSB_NUM_THREADS\fP environment variable\&. .RE .PP \fBSee also\fP .RS 4 \fBOn\fP \fBthe\fP \fBtopic\fP \fBof\fP \fBautotuning\fP, \fBsee\fP \fBalso\fP \fBrsb_tune_spmm\fP\&. .br \fBIf\fP \fC--enable-rsb-num-threads\fP \fBhas\fP \fBbeen\fP \fBspecified\fP \fBat\fP configure \fBtime\fP, \fBthe\fP \fC\fBRSB_NUM_THREADS\fP\fP \fBenvironment\fP \fBvariable\fP \fBwill\fP \fBoverride\fP \fBthe\fP \fBnumber\fP \fBof\fP \fBexecuting\fP \fBthreads\fP \fBspecified\fP \fBby\fP \fC\fBOMP_NUM_THREADS\fP\fP\&. (\fBSee\fP \fBalso\fP \fBRSB_IO_WANT_EXECUTING_THREADS\fP)\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zusmv_ (\fBconst\fP \fBenum\fP \fBblas_trans_type\fP * transA, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP * A, \fBconst\fP \fBvoid\fP * x, \fBconst\fP \fBint\fP * incx, \fBvoid\fP * y, \fBconst\fP \fBint\fP * incy, \fBint\fP * istat)" Multiply by a dense vector\&. Either of $Y <- alpha A X + Y ,$ .br $Y <- alpha A^T X + Y,$ .br $Y <- alpha A^H X + Y$, depending on the value of \fCtransA\fP\&. .PP \fBParameters\fP .RS 4 \fItransA\fP Transposition operator for matrix \fIA\fP\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIA\fP A valid matrix handle\&. .br \fIx\fP Dense vector \fIx\fP\&. .br \fIincx\fP Stride of \fIx\fP\&. .br \fIy\fP Dense vector \fIy\fP\&. .br \fIincy\fP Stride of \fIy\fP\&. .RE .PP \fBNote\fP .RS 4 .PP .PP By setting the \fC\fBblas_rsb_autotune_next_operation\fP\fP property via \fBBLAS_ussp\fP (at any time) the next multiplication routine call (either of \fBBLAS_dusmv\fP, \fBBLAS_susmv\fP, \fBBLAS_zusmv\fP, \fBBLAS_cusmv\fP, \fBBLAS_dusmm\fP, \fBBLAS_susmm\fP, \fBBLAS_zusmm\fP, \fBBLAS_cusmm\fP) will invoke autotuning before carrying out the effective operation\&. The tuning will take in account parameters like transposition, number of right hand sides, and scaling constants\&. By setting the \fC\fBblas_rsb_spmv_autotuning_on\fP\fP property via \fBBLAS_ussp\fP, the default number of executing threads for this matrix will be determined once, at matrix assembly time, and employed irrespective of the default threads count (different values for transposed and untransposed multiply)\&. This can be overridden only by setting the \fCRSB_NUM_THREADS\fP environment variable\&. .RE .PP \fBSee also\fP .RS 4 \fBOn\fP \fBthe\fP \fBtopic\fP \fBof\fP \fBautotuning\fP, \fBsee\fP \fBalso\fP \fBrsb_tune_spmm\fP\&. .br \fBIf\fP \fC--enable-rsb-num-threads\fP \fBhas\fP \fBbeen\fP \fBspecified\fP \fBat\fP configure \fBtime\fP, \fBthe\fP \fC\fBRSB_NUM_THREADS\fP\fP \fBenvironment\fP \fBvariable\fP \fBwill\fP \fBoverride\fP \fBthe\fP \fBnumber\fP \fBof\fP \fBexecuting\fP \fBthreads\fP \fBspecified\fP \fBby\fP \fC\fBOMP_NUM_THREADS\fP\fP\&. (\fBSee\fP \fBalso\fP \fBRSB_IO_WANT_EXECUTING_THREADS\fP)\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zusrows_scale (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBvoid\fP * d, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP trans)" Scale rows interval of matrix by specified factor\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fId\fP Rows scaling vector\&. .br \fItrans\fP Transposition parameter (if transposed will scale columns)\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zusrows_scale_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBvoid\fP * d, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP * trans, \fBint\fP * istat)" Scale rows interval of matrix by specified factor\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fId\fP Rows scaling vector\&. .br \fItrans\fP Transposition parameter (if transposed will scale columns)\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zussc (\fBconst\fP \fBint\fP nnz, \fBconst\fP \fBvoid\fP * x, \fBvoid\fP * y, \fBconst\fP \fBint\fP incy, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP index_base)" Sparse scatter: $Y |_x <- X$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBvoid\fP blas_zussc_ (\fBconst\fP \fBint\fP * nnz, \fBconst\fP \fBvoid\fP * x, \fBvoid\fP * y, \fBconst\fP \fBint\fP * incy, \fBconst\fP \fBint\fP * indx, \fBconst\fP \fBenum\fP \fBblas_base_type\fP * index_base, \fBint\fP * istat)" Sparse scatter: $Y |_x <- X$\&. .PP \fBParameters\fP .RS 4 \fIy\fP Array for $Y$ vector\&. .br \fIx\fP Array for $X$ vector\&. .br \fInnz\fP Size of $X$ \fIand\fP \fI$Y$\fP vectors\&. .br \fIindx\fP Is the array of indices at which sparse vector $X$ will be accessed\&. .br \fIindex_base\fP Specifies the contents of \fCindx\fP, either \fBblas_one_base\fP or \fBblas_one_base\fP\&. .br \fIincy\fP The distance between consecutive \fCy\fP array elements\&.\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP \fBWarning\fP .RS 4 Sparse BLAS Level 1 has been implemented, although not with performance in mind\&. .RE .PP .SS "\fBint\fP BLAS_zusset_element (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP i, \fBconst\fP \fBint\fP j, \fBvoid\fP * v)" Set a single (existing) matrix nonzero coefficient $A_{i,j}$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fIj\fP Column index\&. .br \fIv\fP Value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zusset_element_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * i, \fBconst\fP \fBint\fP * j, \fBvoid\fP * v, \fBint\fP * istat)" Set a single (existing) matrix nonzero coefficient $A_{i,j}$\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIi\fP Row index\&. .br \fIj\fP Column index\&. .br \fIv\fP Value pointer\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zusset_elements (\fBblas_sparse_matrix\fP A, \fBconst\fP \fBint\fP * ia, \fBconst\fP \fBint\fP * ja, \fBconst\fP \fBvoid\fP * va, \fBconst\fP \fBint\fP nnz)" Set individual matrix nonzero coefficients values\&. The operation is pattern preserving, that is, nonzeroes must already exist\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIia\fP Row indices array\&. .br \fIja\fP Column indices array\&. .br \fIva\fP Values array\&. .br \fInnz\fP Length of the \fCia\fP,ja,va arrays\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&.\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zusset_elements_ (\fBblas_sparse_matrix\fP * A, \fBconst\fP \fBint\fP * ia, \fBconst\fP \fBint\fP * ja, \fBconst\fP \fBvoid\fP * va, \fBconst\fP \fBint\fP * nnz, \fBint\fP * istat)" Set individual matrix nonzero coefficients values\&. The operation is pattern preserving, that is, nonzeroes must already exist\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .br \fIia\fP Row indices array\&. .br \fIja\fP Column indices array\&. .br \fIva\fP Values array\&. .br \fInnz\fP Length of the \fCia\fP,ja,va arrays\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&.\&. .RE .PP \fBParameters\fP .RS 4 \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zussm (\fBconst\fP \fBenum\fP \fBblas_order_type\fP order, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP transT, \fBconst\fP \fBint\fP nrhs, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP T, \fBvoid\fP * b, \fBconst\fP \fBint\fP ldb)" Triangular solve, by a dense matrix (aka multi-vector)\&. Either of $B <- alpha T^{-1} B,$ $B <- alpha T^{-T} B,$ $B <- alpha T^{-H} B$, depending on the value of \fCtransT\fP\&. .PP \fBParameters\fP .RS 4 \fIorder\fP layour of the dense array\&. .br \fItransT\fP Transposition operator for matrix \fIT\fP\&. .br \fInrhs\fP Number of right hand side columns\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIT\fP A valid triangular matrix handle\&. .br \fIb\fP Dense vector \fIb\fP\&. .br \fIldb\fP Leading dimension of \fIb\fP\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zussm_ (\fBconst\fP \fBenum\fP \fBblas_order_type\fP * order, \fBconst\fP \fBenum\fP \fBblas_trans_type\fP * transT, \fBconst\fP \fBint\fP * nrhs, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP * T, \fBvoid\fP * b, \fBconst\fP \fBint\fP * ldb, \fBint\fP * istat)" Triangular solve, by a dense matrix (aka multi-vector)\&. Either of $B <- alpha T^{-1} B,$ $B <- alpha T^{-T} B,$ $B <- alpha T^{-H} B$, depending on the value of \fCtransT\fP\&. .PP \fBParameters\fP .RS 4 \fIorder\fP layour of the dense array\&. .br \fItransT\fP Transposition operator for matrix \fIT\fP\&. .br \fInrhs\fP Number of right hand side columns\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIT\fP A valid triangular matrix handle\&. .br \fIb\fP Dense vector \fIb\fP\&. .br \fIldb\fP Leading dimension of \fIb\fP\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBint\fP BLAS_zussv (\fBenum\fP \fBblas_trans_type\fP transT, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP T, \fBvoid\fP * x, \fBconst\fP \fBint\fP incx)" Triangular solve, by a dense vector\&. Either of $X <- alpha T^{-1}X,$ $X <- alpha T^{-T}X,$ $X <- alpha T^{-H}X$, depending on the value of \fCtransT\fP\&. .PP \fBParameters\fP .RS 4 \fItransT\fP Transposition operator for matrix \fIT\fP\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIT\fP A valid triangular matrix handle\&. .br \fIx\fP Dense vector \fIx\fP\&. .br \fIincx\fP Stride of \fIx\fP\&. .RE .PP \fBReturns\fP .RS 4 On success, 0 is returned; on error, -1\&. .RE .PP .SS "\fBvoid\fP blas_zussv_ (\fBenum\fP \fBblas_trans_type\fP * transT, \fBconst\fP \fBvoid\fP * alpha, \fBconst\fP \fBblas_sparse_matrix\fP * T, \fBvoid\fP * x, \fBconst\fP \fBint\fP * incx, \fBint\fP * istat)" Triangular solve, by a dense vector\&. Either of $X <- alpha T^{-1}X,$ $X <- alpha T^{-T}X,$ $X <- alpha T^{-H}X$, depending on the value of \fCtransT\fP\&. .PP \fBParameters\fP .RS 4 \fItransT\fP Transposition operator for matrix \fIT\fP\&. .br \fIalpha\fP Value for $ alpha $\&. .br \fIT\fP A valid triangular matrix handle\&. .br \fIx\fP Dense vector \fIx\fP\&. .br \fIincx\fP Stride of \fIx\fP\&. .br \fIistat\fP If non \fCNULL\fP, \fC*istat\fP will be set to the return code, either 0 (success) or -1 (failure)\&. .RE .PP \fBReturns\fP .RS 4 This is a subroutine for Fortran, so it does not return any value\&. .br .RE .PP .SS "\fBblas_sparse_matrix\fP rsb_blas_file_mtx_load (\fBconst\fP \fBrsb_char_t\fP * filename, \fBrsb_type_t\fP typecode)" Load Matrix Market matrix file of specified type to a matrix, and return Sparse BLAS handler\&. .PP \fBParameters\fP .RS 4 \fIfilename\fP The specified matrix file name (cannot be \fCNULL\fP)\&. .br \fItypecode\fP A valid type code for the desired output matrix (see \fBmatrix_type_symbols_section\fP)\&. .RE .PP \fBReturns\fP .RS 4 On success, a valid matrix handle will be returned\&. On error, \fBblas_invalid_handle\fP will be returned\&. .RE .PP .br .SS "\fBstruct\fP \fBrsb_mtx_t\fP * rsb_blas_get_mtx (\fBblas_sparse_matrix\fP A)" Given a valid Sparse BLAS handle, returns a pointer to the inner rsb_mtx_t structure\&. Then, this can be used for many of the \fBrsb\&.h\fP functions\&. This is an experimental function, so we recommend to use it with functions not modifying the matrix (ones that take \fCconst\fP \fCstruct\fP \fCrsb_mtx_t*mtxAp\fP)\&. You can use this function from either Fortran or C\&. .PP \fBParameters\fP .RS 4 \fIA\fP A valid matrix handle\&. .RE .PP \fBReturns\fP .RS 4 On success, a valid pointer to the inner matrix structure (\fCstruct\fP \fCrsb_mtx_t*\fP); on error, \fCNULL\fP\&. .RE .PP .br An example using Fortran: .PP .nf \&.\&.\&. USE blas_sparse USE rsb IMPLICIT NONE TYPE(C_PTR),TARGET :: mtxAp = C_NULL_PTR ! matrix pointer INTEGER :: A ! blas_sparse_matrix handle INTEGER, TARGET :: istat = 0 \&.\&.\&. ! begin, populate and finalize A, e\&.g\&. using BLAS_duscr_begin, BLAS_duscr_insert_entries, BLAS_uscr_end ! get pointer to rsb structure: mtxAp = rsb_blas_get_mtx(A) ! Now one can use it with any rsb\&.h/rsb\&.F90 function, e\&.g\&.: istat = rsb_file_mtx_save(mtxAp, C_NULL_PTR) ! write to stdout .fi .PP .PP \fBSee also\fP .RS 4 \fBrsb_mtx_get_coo\fP, \fBrsb_mtx_get_csr\fP, \fBrsb_mtx_get_rows_sparse\fP, \fBrsb_mtx_get_coo_block\fP, \fBrsb_mtx_get_prec\fP, \fBrsb_mtx_get_nrm\fP, \fBrsb_mtx_get_vec\fP, \fBrsb_file_mtx_get_dims\fP, \fBrsb_mtx_get_vals\fP, .PP \fBrsb_mtx_upd_vals\fP, \fBrsb_mtx_set_vals\fP, .PP \fBrsb_spmsp_to_dense\fP, \fBrsb_sppsp\fP, \fBrsb_spmsp\fP, \fBrsb_mtx_add_to_dense\fP, .PP \fBrsb_mtx_rndr\fP, \fBrsb_file_mtx_rndr\fP, .PP \fBrsb_mtx_get_info\fP, \fBrsb_mtx_get_info_str\fP, \fBrsb_file_mtx_save\fP, \fBrsb_file_vec_load\fP, \fBrsb_file_mtx_load\fP\&. .RE .PP \fBNote\fP .RS 4 This function is an extension implemented by \fClibrsb\fP and thus it is not part of the standard\&. Do not rely on it, as it may change! Please contact the library maintainers if you need its functionality\&. .RE .PP .SH "Author" .PP librsb was written by Michele Martone; this documentation has been generated by Doxygen. .SH "SEE ALSO" .B rsb-examples .B rsb-spblas.h .B rsb.h .B rsb.hpp