bfb9e6ea13
djbfft is an extremely fast library for floating-point convolution. The current version holds most of the speed records for double-precision FFTs on general-purpose computers. djbfft provides power-of-2 complex FFTs, real FFTs at twice the speed, and fast multiplication of complex arrays. Single precision and double precision are equally supported.
35 lines
1.3 KiB
Text
35 lines
1.3 KiB
Text
$NetBSD: patch-ac,v 1.1.1.1 2003/07/24 16:47:52 jschauma Exp $
|
|
|
|
--- hier.c.orig Thu Sep 30 21:25:58 1999
|
|
+++ hier.c
|
|
@@ -2,19 +2,16 @@
|
|
|
|
void hier()
|
|
{
|
|
- h(auto_home,-1,-1,02755);
|
|
+ c(auto_home,"lib","libdjbfft.a",-1,-1,0644);
|
|
|
|
- d(auto_home,"lib",-1,-1,02755);
|
|
- c(auto_home,"lib","djbfft.a",-1,-1,0644);
|
|
-
|
|
- d(auto_home,"include",-1,-1,02755);
|
|
- c(auto_home,"include","real4.h",-1,-1,0644);
|
|
- c(auto_home,"include","real8.h",-1,-1,0644);
|
|
- c(auto_home,"include","complex4.h",-1,-1,0644);
|
|
- c(auto_home,"include","complex8.h",-1,-1,0644);
|
|
- c(auto_home,"include","fftc4.h",-1,-1,0644);
|
|
- c(auto_home,"include","fftc8.h",-1,-1,0644);
|
|
- c(auto_home,"include","fftr4.h",-1,-1,0644);
|
|
- c(auto_home,"include","fftr8.h",-1,-1,0644);
|
|
- c(auto_home,"include","fftfreq.h",-1,-1,0644);
|
|
+ d(auto_home,"include/djbfft",-1,-1,0755);
|
|
+ c(auto_home,"include/djbfft","real4.h",-1,-1,0644);
|
|
+ c(auto_home,"include/djbfft","real8.h",-1,-1,0644);
|
|
+ c(auto_home,"include/djbfft","complex4.h",-1,-1,0644);
|
|
+ c(auto_home,"include/djbfft","complex8.h",-1,-1,0644);
|
|
+ c(auto_home,"include/djbfft","fftc4.h",-1,-1,0644);
|
|
+ c(auto_home,"include/djbfft","fftc8.h",-1,-1,0644);
|
|
+ c(auto_home,"include/djbfft","fftr4.h",-1,-1,0644);
|
|
+ c(auto_home,"include/djbfft","fftr8.h",-1,-1,0644);
|
|
+ c(auto_home,"include/djbfft","fftfreq.h",-1,-1,0644);
|
|
}
|