92 lines
1.6 KiB
C
92 lines
1.6 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"
|
|
#include "hypre_blas.h"
|
|
|
|
/* Subroutine */ int daxpy_(integer *n, doublereal *da, doublereal *dx,
|
|
integer *incx, doublereal *dy, integer *incy)
|
|
{
|
|
|
|
|
|
/* System generated locals */
|
|
|
|
/* Local variables */
|
|
static integer i, m, ix, iy, mp1;
|
|
|
|
|
|
/* constant times a vector plus a vector.
|
|
uses unrolled loops for increments equal to one.
|
|
jack dongarra, linpack, 3/11/78.
|
|
modified 12/3/93, array(1) declarations changed to array(*)
|
|
|
|
|
|
|
|
Parameter adjustments
|
|
Function Body */
|
|
#define DY(I) dy[(I)-1]
|
|
#define DX(I) dx[(I)-1]
|
|
|
|
|
|
if (*n <= 0) {
|
|
return 0;
|
|
}
|
|
if (*da == 0.) {
|
|
return 0;
|
|
}
|
|
if (*incx == 1 && *incy == 1) {
|
|
goto L20;
|
|
}
|
|
|
|
/* code for unequal increments or equal increments
|
|
not equal to 1 */
|
|
|
|
ix = 1;
|
|
iy = 1;
|
|
if (*incx < 0) {
|
|
ix = (-(*n) + 1) * *incx + 1;
|
|
}
|
|
if (*incy < 0) {
|
|
iy = (-(*n) + 1) * *incy + 1;
|
|
}
|
|
for (i = 1; i <= *n; ++i) {
|
|
DY(iy) += *da * DX(ix);
|
|
ix += *incx;
|
|
iy += *incy;
|
|
/* L10: */
|
|
}
|
|
return 0;
|
|
|
|
/* code for both increments equal to 1
|
|
|
|
|
|
clean-up loop */
|
|
|
|
L20:
|
|
m = *n % 4;
|
|
if (m == 0) {
|
|
goto L40;
|
|
}
|
|
for (i = 1; i <= m; ++i) {
|
|
DY(i) += *da * DX(i);
|
|
/* L30: */
|
|
}
|
|
if (*n < 4) {
|
|
return 0;
|
|
}
|
|
L40:
|
|
mp1 = m + 1;
|
|
for (i = mp1; i <= *n; i += 4) {
|
|
DY(i) += *da * DX(i);
|
|
DY(i + 1) += *da * DX(i + 1);
|
|
DY(i + 2) += *da * DX(i + 2);
|
|
DY(i + 3) += *da * DX(i + 3);
|
|
/* L50: */
|
|
}
|
|
return 0;
|
|
} /* daxpy_ */
|
|
|