37 #ifndef TEMPLATE_BLAS_TRSV_HEADER 38 #define TEMPLATE_BLAS_TRSV_HEADER 46 integer a_dim1, a_offset, i__1, i__2;
53 #define a_ref(a_1,a_2) a[(a_2)*a_dim1 + a_1] 123 a_offset = 1 + a_dim1 * 1;
142 }
else if (*incx == 0) {
157 kx = 1 - (*n - 1) * *incx;
158 }
else if (*incx != 1) {
167 for (j = *n; j >= 1; --j) {
173 for (i__ = j - 1; i__ >= 1; --i__) {
174 x[i__] -= temp *
a_ref(i__, j);
181 jx = kx + (*n - 1) * *incx;
182 for (j = *n; j >= 1; --j) {
185 x[jx] /=
a_ref(j, j);
189 for (i__ = j - 1; i__ >= 1; --i__) {
191 x[ix] -= temp *
a_ref(i__, j);
202 for (j = 1; j <= i__1; ++j) {
209 for (i__ = j + 1; i__ <= i__2; ++i__) {
210 x[i__] -= temp *
a_ref(i__, j);
219 for (j = 1; j <= i__1; ++j) {
222 x[jx] /=
a_ref(j, j);
227 for (i__ = j + 1; i__ <= i__2; ++i__) {
229 x[ix] -= temp *
a_ref(i__, j);
243 for (j = 1; j <= i__1; ++j) {
246 for (i__ = 1; i__ <= i__2; ++i__) {
247 temp -=
a_ref(i__, j) * x[i__];
259 for (j = 1; j <= i__1; ++j) {
263 for (i__ = 1; i__ <= i__2; ++i__) {
264 temp -=
a_ref(i__, j) * x[ix];
278 for (j = *n; j >= 1; --j) {
281 for (i__ = *n; i__ >= i__1; --i__) {
282 temp -=
a_ref(i__, j) * x[i__];
292 kx += (*n - 1) * *incx;
294 for (j = *n; j >= 1; --j) {
298 for (i__ = *n; i__ >= i__1; --i__) {
299 temp -=
a_ref(i__, j) * x[ix];
int integer
Definition: template_blas_common.h:40
#define maxMACRO(a, b)
Definition: template_blas_common.h:45
int template_blas_erbla(const char *srname, integer *info)
Definition: template_blas_common.cc:146
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:42
bool logical
Definition: template_blas_common.h:41
logical template_blas_lsame(const char *ca, const char *cb)
Definition: template_blas_common.cc:46