From a57275e7beac2afef159f985cb133aaa2ca40a1e Mon Sep 17 00:00:00 2001
From: edoapra <edoardo.apra@gmail.com>
Date: Tue, 24 Oct 2023 22:11:54 -0700
Subject: [PATCH] fix broken 64_to_32 conversion

---
 src/fft/pfft1.0/pfft/dcopy.F | 83 ------------------------------------
 1 file changed, 83 deletions(-)
 delete mode 100644 src/fft/pfft1.0/pfft/dcopy.F

diff --git a/src/fft/pfft1.0/pfft/dcopy.F b/src/fft/pfft1.0/pfft/dcopy.F
deleted file mode 100644
index 207a068dbf..0000000000
--- a/src/fft/pfft1.0/pfft/dcopy.F
+++ /dev/null
@@ -1,83 +0,0 @@
-*
-* $Id$
-*
-*======================================================================
-*
-* DISCLAIMER
-*
-* This material was prepared as an account of work sponsored by an
-* agency of the United States Government.  Neither the United States
-* Government nor the United States Department of Energy, nor Battelle,
-* nor any of their employees, MAKES ANY WARRANTY, EXPRESS OR IMPLIED, OR
-* ASSUMES ANY LEGAL LIABILITY OR RESPONSIBILITY FOR THE ACCURACY,
-* COMPLETENESS, OR USEFULNESS OF ANY INFORMATION, APPARATUS, PRODUCT,
-* SOFTWARE, OR PROCESS DISCLOSED, OR REPRESENTS THAT ITS USE WOULD NOT
-* INFRINGE PRIVATELY OWNED RIGHTS.
-*
-* ACKNOWLEDGMENT
-*
-* This software and its documentation were produced with Government
-* support under Contract Number DE-AC06-76RLO-1830 awarded by the United
-* States Department of Energy.  The Government retains a paid-up
-* non-exclusive, irrevocable worldwide license to reproduce, prepare
-* derivative works, perform publicly and display publicly by or for the
-* Government, including the right to distribute to other Government
-* contractors.
-*
-*======================================================================
-*
-*  -- PFFT routine (version 1.0) --
-*     Pacific Northwest Laboratory
-*     April 5, 1995
-*
-*======================================================================
-      subroutine  dcopy(n,dx,incx,dy,incy)
-c
-c     copies a vector, x, to a vector, y.
-c     uses unrolled loops for increments equal to one.
-c     jack dongarra, linpack, 3/11/78.
-c     modified 12/3/93, array(1) declarations changed to array(*)
-c
-      double precision dx(*),dy(*)
-      integer i,incx,incy,ix,iy,m,mp1,n
-c
-      if(n.le.0)return
-      if(incx.eq.1.and.incy.eq.1)go to 20
-c
-c        code for unequal increments or equal increments
-c          not equal to 1
-c
-      ix = 1
-      iy = 1
-      if(incx.lt.0)ix = (-n+1)*incx + 1
-      if(incy.lt.0)iy = (-n+1)*incy + 1
-      do 10 i = 1,n
-        dy(iy) = dx(ix)
-        ix = ix + incx
-        iy = iy + incy
-   10 continue
-      return
-c
-c        code for both increments equal to 1
-c
-c
-c        clean-up loop
-c
-   20 m = mod(n,7)
-      if( m .eq. 0 ) go to 40
-      do 30 i = 1,m
-        dy(i) = dx(i)
-   30 continue
-      if( n .lt. 7 ) return
-   40 mp1 = m + 1
-      do 50 i = mp1,n,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)
-   50 continue
-      return
-      end