2 * This file is part of the GROMACS molecular simulation package.
4 * Copyright (c) 2012,2013, by the GROMACS development team, led by
5 * David van der Spoel, Berk Hess, Erik Lindahl, and including many
6 * others, as listed in the AUTHORS file in the top-level source
7 * directory and at http://www.gromacs.org.
9 * GROMACS is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU Lesser General Public License
11 * as published by the Free Software Foundation; either version 2.1
12 * of the License, or (at your option) any later version.
14 * GROMACS is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * Lesser General Public License for more details.
19 * You should have received a copy of the GNU Lesser General Public
20 * License along with GROMACS; if not, see
21 * http://www.gnu.org/licenses, or write to the Free Software Foundation,
22 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
24 * If you want to redistribute modifications to GROMACS, please
25 * consider that scientific software is very special. Version
26 * control is crucial - bugs must be traceable. We will be happy to
27 * consider code for inclusion in the official distribution, but
28 * derived work must not be called official GROMACS. Details are found
29 * in the README & COPYING files - if they are missing, get the
30 * official version at http://www.gromacs.org.
32 * To help us fund GROMACS development, we humbly ask that you cite
33 * the research papers on the package. Check out http://www.gromacs.org.
37 #include <types/simple.h>
41 F77_FUNC(strmv,STRMV)(const char *uplo,
50 int a_dim1, a_offset, i__1, i__2;
52 int i__, j, ix, jx, kx, info;
61 a_offset = 1 + a_dim1;
71 nounit = (*diag=='n' || *diag=='N');
74 kx = 1 - (n - 1) * incx;
79 if (*trans=='N' || *trans=='n') {
81 if (*uplo=='U' || *uplo=='u') {
84 for (j = 1; j <= i__1; ++j) {
85 if (fabs(x[j])>GMX_FLOAT_MIN) {
88 for (i__ = 1; i__ <= i__2; ++i__) {
89 x[i__] += temp * a[i__ + j * a_dim1];
92 x[j] *= a[j + j * a_dim1];
99 for (j = 1; j <= i__1; ++j) {
100 if (fabs(x[jx])>GMX_FLOAT_MIN) {
104 for (i__ = 1; i__ <= i__2; ++i__) {
105 x[ix] += temp * a[i__ + j * a_dim1];
109 x[jx] *= a[j + j * a_dim1];
117 for (j = n; j >= 1; --j) {
118 if (fabs(x[j])>GMX_FLOAT_MIN) {
121 for (i__ = n; i__ >= i__1; --i__) {
122 x[i__] += temp * a[i__ + j * a_dim1];
125 x[j] *= a[j + j * a_dim1];
130 kx += (n - 1) * incx;
132 for (j = n; j >= 1; --j) {
133 if (fabs(x[jx])>GMX_FLOAT_MIN) {
137 for (i__ = n; i__ >= i__1; --i__) {
138 x[ix] += temp * a[i__ + j * a_dim1];
142 x[jx] *= a[j + j * a_dim1];
151 if (*uplo=='U' || *uplo=='u') {
153 for (j = n; j >= 1; --j) {
156 temp *= a[j + j * a_dim1];
158 for (i__ = j - 1; i__ >= 1; --i__) {
159 temp += a[i__ + j * a_dim1] * x[i__];
164 jx = kx + (n - 1) * incx;
165 for (j = n; j >= 1; --j) {
169 temp *= a[j + j * a_dim1];
171 for (i__ = j - 1; i__ >= 1; --i__) {
173 temp += a[i__ + j * a_dim1] * x[ix];
182 for (j = 1; j <= i__1; ++j) {
185 temp *= a[j + j * a_dim1];
188 for (i__ = j + 1; i__ <= i__2; ++i__) {
189 temp += a[i__ + j * a_dim1] * x[i__];
196 for (j = 1; j <= i__1; ++j) {
200 temp *= a[j + j * a_dim1];
203 for (i__ = j + 1; i__ <= i__2; ++i__) {
205 temp += a[i__ + j * a_dim1] * x[ix];