123 lines
2.9 KiB
C
123 lines
2.9 KiB
C
/*BHEADER**********************************************************************
|
|
* Copyright (c) 2007, Lawrence Livermore National Security, LLC.
|
|
* Produced at the Lawrence Livermore National Laboratory.
|
|
* Written by the HYPRE team. UCRL-CODE-222953.
|
|
* All rights reserved.
|
|
*
|
|
* This file is part of HYPRE (see http://www.llnl.gov/CASC/hypre/).
|
|
* Please see the COPYRIGHT_and_LICENSE file for the copyright notice,
|
|
* disclaimer, contact information and the GNU Lesser General Public License.
|
|
*
|
|
* HYPRE is free software; you can redistribute it and/or modify it under the
|
|
* terms of the GNU General Public License (as published by the Free Software
|
|
* Foundation) version 2.1 dated February 1999.
|
|
*
|
|
* HYPRE is distributed in the hope that it will be useful, but WITHOUT ANY
|
|
* WARRANTY; without even the IMPLIED WARRANTY OF MERCHANTABILITY or FITNESS
|
|
* FOR A PARTICULAR PURPOSE. See the terms and conditions of the GNU General
|
|
* Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
* along with this program; if not, write to the Free Software Foundation,
|
|
* Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
*
|
|
* $Revision$
|
|
***********************************************************************EHEADER*/
|
|
|
|
|
|
|
|
|
|
/* dcopy.f -- translated by f2c (version 19960315).
|
|
You must link the resulting object file with the libraries:
|
|
-lf2c -lm (in that order)
|
|
*/
|
|
|
|
#include "f2c.h"
|
|
#include "hypre_blas.h"
|
|
|
|
/* Subroutine */ int dcopy_(n, dx, incx, dy, incy)
|
|
integer *n;
|
|
doublereal *dx;
|
|
integer *incx;
|
|
doublereal *dy;
|
|
integer *incy;
|
|
{
|
|
/* System generated locals */
|
|
integer i__1;
|
|
|
|
/* Local variables */
|
|
static integer i__, m, ix, iy, mp1;
|
|
|
|
|
|
/* copies a vector, x, to a vector, y. */
|
|
/* uses unrolled loops for increments equal to one. */
|
|
/* jack dongarra, linpack, 3/11/78. */
|
|
|
|
|
|
/* Parameter adjustments */
|
|
--dy;
|
|
--dx;
|
|
|
|
/* Function Body */
|
|
if (*n <= 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;
|
|
}
|
|
i__1 = *n;
|
|
for (i__ = 1; i__ <= i__1; ++i__) {
|
|
dy[iy] = dx[ix];
|
|
ix += *incx;
|
|
iy += *incy;
|
|
/* L10: */
|
|
}
|
|
return 0;
|
|
|
|
/* code for both increments equal to 1 */
|
|
|
|
|
|
/* clean-up loop */
|
|
|
|
L20:
|
|
m = *n % 7;
|
|
if (m == 0) {
|
|
goto L40;
|
|
}
|
|
i__1 = m;
|
|
for (i__ = 1; i__ <= i__1; ++i__) {
|
|
dy[i__] = dx[i__];
|
|
/* L30: */
|
|
}
|
|
if (*n < 7) {
|
|
return 0;
|
|
}
|
|
L40:
|
|
mp1 = m + 1;
|
|
i__1 = *n;
|
|
for (i__ = mp1; i__ <= i__1; i__ += 7) {
|
|
dy[i__] = dx[i__];
|
|
dy[i__ + 1] = dx[i__ + 1];
|
|
dy[i__ + 2] = dx[i__ + 2];
|
|
dy[i__ + 3] = dx[i__ + 3];
|
|
dy[i__ + 4] = dx[i__ + 4];
|
|
dy[i__ + 5] = dx[i__ + 5];
|
|
dy[i__ + 6] = dx[i__ + 6];
|
|
/* L50: */
|
|
}
|
|
return 0;
|
|
} /* dcopy_ */
|
|
|