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