89 lines
1.8 KiB
C
89 lines
1.8 KiB
C
|
|
/* -- translated by f2c (version 19940927).
|
|
You must link the resulting object file with the libraries:
|
|
-lf2c -lm (in that order)
|
|
*/
|
|
|
|
#include "f2c.h"
|
|
|
|
real sasum_(integer *n, real *sx, integer *incx)
|
|
{
|
|
|
|
|
|
/* System generated locals */
|
|
integer i__1, i__2;
|
|
real ret_val, r__1, r__2, r__3, r__4, r__5, r__6;
|
|
|
|
/* Local variables */
|
|
static integer i, m, nincx;
|
|
static real stemp;
|
|
static integer mp1;
|
|
|
|
|
|
/* takes the sum of the absolute values.
|
|
uses unrolled loops for increment equal to one.
|
|
jack dongarra, linpack, 3/11/78.
|
|
modified 3/93 to return if incx .le. 0.
|
|
modified 12/3/93, array(1) declarations changed to array(*)
|
|
|
|
|
|
|
|
Parameter adjustments
|
|
Function Body */
|
|
#define SX(I) sx[(I)-1]
|
|
|
|
|
|
ret_val = 0.f;
|
|
stemp = 0.f;
|
|
if (*n <= 0 || *incx <= 0) {
|
|
return ret_val;
|
|
}
|
|
if (*incx == 1) {
|
|
goto L20;
|
|
}
|
|
|
|
/* code for increment not equal to 1 */
|
|
|
|
nincx = *n * *incx;
|
|
i__1 = nincx;
|
|
i__2 = *incx;
|
|
for (i = 1; *incx < 0 ? i >= nincx : i <= nincx; i += *incx) {
|
|
stemp += (r__1 = SX(i), dabs(r__1));
|
|
/* L10: */
|
|
}
|
|
ret_val = stemp;
|
|
return ret_val;
|
|
|
|
/* code for increment equal to 1
|
|
|
|
|
|
clean-up loop */
|
|
|
|
L20:
|
|
m = *n % 6;
|
|
if (m == 0) {
|
|
goto L40;
|
|
}
|
|
i__2 = m;
|
|
for (i = 1; i <= m; ++i) {
|
|
stemp += (r__1 = SX(i), dabs(r__1));
|
|
/* L30: */
|
|
}
|
|
if (*n < 6) {
|
|
goto L60;
|
|
}
|
|
L40:
|
|
mp1 = m + 1;
|
|
i__2 = *n;
|
|
for (i = mp1; i <= *n; i += 6) {
|
|
stemp = stemp + (r__1 = SX(i), dabs(r__1)) + (r__2 = SX(i + 1), dabs(
|
|
r__2)) + (r__3 = SX(i + 2), dabs(r__3)) + (r__4 = SX(i + 3),
|
|
dabs(r__4)) + (r__5 = SX(i + 4), dabs(r__5)) + (r__6 = SX(i +
|
|
5), dabs(r__6));
|
|
/* L50: */
|
|
}
|
|
L60:
|
|
ret_val = stemp;
|
|
return ret_val;
|
|
} /* sasum_ */
|
|
|