ergo
|
00001 /* Ergo, version 3.2, a program for linear scaling electronic structure 00002 * calculations. 00003 * Copyright (C) 2012 Elias Rudberg, Emanuel H. Rubensson, and Pawel Salek. 00004 * 00005 * This program is free software: you can redistribute it and/or modify 00006 * it under the terms of the GNU General Public License as published by 00007 * the Free Software Foundation, either version 3 of the License, or 00008 * (at your option) any later version. 00009 * 00010 * This program is distributed in the hope that it will be useful, 00011 * but WITHOUT ANY WARRANTY; without even the implied warranty of 00012 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00013 * GNU General Public License for more details. 00014 * 00015 * You should have received a copy of the GNU General Public License 00016 * along with this program. If not, see <http://www.gnu.org/licenses/>. 00017 * 00018 * Primary academic reference: 00019 * KohnâSham Density Functional Theory Electronic Structure Calculations 00020 * with Linearly Scaling Computational Time and Memory Usage, 00021 * Elias Rudberg, Emanuel H. Rubensson, and Pawel Salek, 00022 * J. Chem. Theory Comput. 7, 340 (2011), 00023 * <http://dx.doi.org/10.1021/ct100611z> 00024 * 00025 * For further information about Ergo, see <http://www.ergoscf.org>. 00026 */ 00027 00028 /* This file belongs to the template_lapack part of the Ergo source 00029 * code. The source files in the template_lapack directory are modified 00030 * versions of files originally distributed as CLAPACK, see the 00031 * Copyright/license notice in the file template_lapack/COPYING. 00032 */ 00033 00034 00035 #ifndef TEMPLATE_BLAS_COPY_HEADER 00036 #define TEMPLATE_BLAS_COPY_HEADER 00037 00038 00039 template<class Treal> 00040 int template_blas_copy(const integer *n, const Treal *dx, const integer *incx, 00041 Treal *dy, const integer *incy) 00042 { 00043 /* System generated locals */ 00044 integer i__1; 00045 /* Local variables */ 00046 integer i__, m, ix, iy, mp1; 00047 /* copies a vector, x, to a vector, y. 00048 uses unrolled loops for increments equal to one. 00049 jack dongarra, linpack, 3/11/78. 00050 modified 12/3/93, array(1) declarations changed to array(*) 00051 Parameter adjustments */ 00052 --dy; 00053 --dx; 00054 /* Function Body */ 00055 if (*n <= 0) { 00056 return 0; 00057 } 00058 if (*incx == 1 && *incy == 1) { 00059 goto L20; 00060 } 00061 /* code for unequal increments or equal increments 00062 not equal to 1 */ 00063 ix = 1; 00064 iy = 1; 00065 if (*incx < 0) { 00066 ix = (-(*n) + 1) * *incx + 1; 00067 } 00068 if (*incy < 0) { 00069 iy = (-(*n) + 1) * *incy + 1; 00070 } 00071 i__1 = *n; 00072 for (i__ = 1; i__ <= i__1; ++i__) { 00073 dy[iy] = dx[ix]; 00074 ix += *incx; 00075 iy += *incy; 00076 /* L10: */ 00077 } 00078 return 0; 00079 /* code for both increments equal to 1 00080 clean-up loop */ 00081 L20: 00082 m = *n % 7; 00083 if (m == 0) { 00084 goto L40; 00085 } 00086 i__1 = m; 00087 for (i__ = 1; i__ <= i__1; ++i__) { 00088 dy[i__] = dx[i__]; 00089 /* L30: */ 00090 } 00091 if (*n < 7) { 00092 return 0; 00093 } 00094 L40: 00095 mp1 = m + 1; 00096 i__1 = *n; 00097 for (i__ = mp1; i__ <= i__1; i__ += 7) { 00098 dy[i__] = dx[i__]; 00099 dy[i__ + 1] = dx[i__ + 1]; 00100 dy[i__ + 2] = dx[i__ + 2]; 00101 dy[i__ + 3] = dx[i__ + 3]; 00102 dy[i__ + 4] = dx[i__ + 4]; 00103 dy[i__ + 5] = dx[i__ + 5]; 00104 dy[i__ + 6] = dx[i__ + 6]; 00105 /* L50: */ 00106 } 00107 return 0; 00108 } /* dcopy_ */ 00109 00110 #endif