35 #ifndef TEMPLATE_BLAS_TRSV_HEADER 36 #define TEMPLATE_BLAS_TRSV_HEADER 44 integer a_dim1, a_offset, i__1, i__2;
51 #define a_ref(a_1,a_2) a[(a_2)*a_dim1 + a_1] 121 a_offset = 1 + a_dim1 * 1;
140 }
else if (*incx == 0) {
155 kx = 1 - (*n - 1) * *incx;
156 }
else if (*incx != 1) {
165 for (j = *n; j >= 1; --j) {
171 for (i__ = j - 1; i__ >= 1; --i__) {
172 x[i__] -= temp *
a_ref(i__, j);
179 jx = kx + (*n - 1) * *incx;
180 for (j = *n; j >= 1; --j) {
183 x[jx] /=
a_ref(j, j);
187 for (i__ = j - 1; i__ >= 1; --i__) {
189 x[ix] -= temp *
a_ref(i__, j);
200 for (j = 1; j <= i__1; ++j) {
207 for (i__ = j + 1; i__ <= i__2; ++i__) {
208 x[i__] -= temp *
a_ref(i__, j);
217 for (j = 1; j <= i__1; ++j) {
220 x[jx] /=
a_ref(j, j);
225 for (i__ = j + 1; i__ <= i__2; ++i__) {
227 x[ix] -= temp *
a_ref(i__, j);
241 for (j = 1; j <= i__1; ++j) {
244 for (i__ = 1; i__ <= i__2; ++i__) {
245 temp -=
a_ref(i__, j) * x[i__];
257 for (j = 1; j <= i__1; ++j) {
261 for (i__ = 1; i__ <= i__2; ++i__) {
262 temp -=
a_ref(i__, j) * x[ix];
276 for (j = *n; j >= 1; --j) {
279 for (i__ = *n; i__ >= i__1; --i__) {
280 temp -=
a_ref(i__, j) * x[i__];
290 kx += (*n - 1) * *incx;
292 for (j = *n; j >= 1; --j) {
296 for (i__ = *n; i__ >= i__1; --i__) {
297 temp -=
a_ref(i__, j) * x[ix];
int integer
Definition: template_blas_common.h:38
#define maxMACRO(a, b)
Definition: template_blas_common.h:43
int template_blas_erbla(const char *srname, integer *info)
Definition: template_blas_common.cc:144
int template_blas_trsv(const char *uplo, const char *trans, const char *diag, const integer *n, const Treal *a, const integer *lda, Treal *x, const integer *incx)
Definition: template_blas_trsv.h:40
bool logical
Definition: template_blas_common.h:39
logical template_blas_lsame(const char *ca, const char *cb)
Definition: template_blas_common.cc:44