root / src / blas / daxpy.f @ 4
Historique | Voir | Annoter | Télécharger (1,42 ko)
| 1 | 1 | equemene | SUBROUTINE DAXPY(N,DA,DX,INCX,DY,INCY) |
|---|---|---|---|
| 2 | 1 | equemene | * .. Scalar Arguments .. |
| 3 | 1 | equemene | DOUBLE PRECISION DA |
| 4 | 1 | equemene | INTEGER INCX,INCY,N |
| 5 | 1 | equemene | * .. |
| 6 | 1 | equemene | * .. Array Arguments .. |
| 7 | 1 | equemene | DOUBLE PRECISION DX(*),DY(*) |
| 8 | 1 | equemene | * .. |
| 9 | 1 | equemene | * |
| 10 | 1 | equemene | * Purpose |
| 11 | 1 | equemene | * ======= |
| 12 | 1 | equemene | * |
| 13 | 1 | equemene | * constant times a vector plus a vector. |
| 14 | 1 | equemene | * uses unrolled loops for increments equal to one. |
| 15 | 1 | equemene | * jack dongarra, linpack, 3/11/78. |
| 16 | 1 | equemene | * modified 12/3/93, array(1) declarations changed to array(*) |
| 17 | 1 | equemene | * |
| 18 | 1 | equemene | * |
| 19 | 1 | equemene | * .. Local Scalars .. |
| 20 | 1 | equemene | INTEGER I,IX,IY,M,MP1 |
| 21 | 1 | equemene | * .. |
| 22 | 1 | equemene | * .. Intrinsic Functions .. |
| 23 | 1 | equemene | INTRINSIC MOD |
| 24 | 1 | equemene | * .. |
| 25 | 1 | equemene | IF (N.LE.0) RETURN |
| 26 | 1 | equemene | IF (DA.EQ.0.0d0) RETURN |
| 27 | 1 | equemene | IF (INCX.EQ.1 .AND. INCY.EQ.1) GO TO 20 |
| 28 | 1 | equemene | * |
| 29 | 1 | equemene | * code for unequal increments or equal increments |
| 30 | 1 | equemene | * not equal to 1 |
| 31 | 1 | equemene | * |
| 32 | 1 | equemene | IX = 1 |
| 33 | 1 | equemene | IY = 1 |
| 34 | 1 | equemene | IF (INCX.LT.0) IX = (-N+1)*INCX + 1 |
| 35 | 1 | equemene | IF (INCY.LT.0) IY = (-N+1)*INCY + 1 |
| 36 | 1 | equemene | DO 10 I = 1,N |
| 37 | 1 | equemene | DY(IY) = DY(IY) + DA*DX(IX) |
| 38 | 1 | equemene | IX = IX + INCX |
| 39 | 1 | equemene | IY = IY + INCY |
| 40 | 1 | equemene | 10 CONTINUE |
| 41 | 1 | equemene | RETURN |
| 42 | 1 | equemene | * |
| 43 | 1 | equemene | * code for both increments equal to 1 |
| 44 | 1 | equemene | * |
| 45 | 1 | equemene | * |
| 46 | 1 | equemene | * clean-up loop |
| 47 | 1 | equemene | * |
| 48 | 1 | equemene | 20 M = MOD(N,4) |
| 49 | 1 | equemene | IF (M.EQ.0) GO TO 40 |
| 50 | 1 | equemene | DO 30 I = 1,M |
| 51 | 1 | equemene | DY(I) = DY(I) + DA*DX(I) |
| 52 | 1 | equemene | 30 CONTINUE |
| 53 | 1 | equemene | IF (N.LT.4) RETURN |
| 54 | 1 | equemene | 40 MP1 = M + 1 |
| 55 | 1 | equemene | DO 50 I = MP1,N,4 |
| 56 | 1 | equemene | DY(I) = DY(I) + DA*DX(I) |
| 57 | 1 | equemene | DY(I+1) = DY(I+1) + DA*DX(I+1) |
| 58 | 1 | equemene | DY(I+2) = DY(I+2) + DA*DX(I+2) |
| 59 | 1 | equemene | DY(I+3) = DY(I+3) + DA*DX(I+3) |
| 60 | 1 | equemene | 50 CONTINUE |
| 61 | 1 | equemene | RETURN |
| 62 | 1 | equemene | END |