2005-01-12 16:31:58 +01:00
|
|
|
# $NetBSD: Makefile,v 1.17 2005/01/12 15:32:01 jlam Exp $
|
1998-10-21 21:16:45 +02:00
|
|
|
|
2003-05-02 20:04:47 +02:00
|
|
|
.if (${MACHINE_ARCH} == "powerpc")
|
2003-07-08 16:05:29 +02:00
|
|
|
DISTNAME= fftw-3.0.1-fma
|
2003-05-02 20:04:47 +02:00
|
|
|
.else
|
2003-07-08 16:05:29 +02:00
|
|
|
DISTNAME= fftw-3.0.1
|
2003-05-02 20:04:47 +02:00
|
|
|
.endif
|
2003-07-08 16:05:29 +02:00
|
|
|
PKGNAME= fftw-3.0.1
|
2004-10-03 02:12:51 +02:00
|
|
|
PKGREVISION= 1
|
1998-10-21 21:16:45 +02:00
|
|
|
CATEGORIES= math
|
Update to version 3.0.
Major goals of this release:
* Speed: often 20% or more faster than FFTW 2.x, even without SIMD (see below).
* Complete rewrite, to make it easier to add new algorithms and transforms.
* New API, to support more general semantics.
Other enhancements:
* SIMD acceleration on supporting CPUs (SSE, SSE2, 3DNow!, and AltiVec).
(With special thanks to Franz Franchetti for many experimental prototypes
and to Stefan Kral for the vectorizing generator from fftwgel.)
* True in-place 1d transforms of large sizes (as well as compressed
twiddle tables for additional memory/cache savings).
* More arbitrary placement of real & imaginary data, e.g. including
interleaved (as in FFTW 2.x) as well as separate real/imag arrays.
* Efficient prime-size transforms of real data.
* Multidimensional transforms can operate on a subset of a larger matrix,
and/or transform selected dimensions of a multidimensional array.
* By popular demand, simultaneous linking to double precision (fftw),
single precision (fftwf), and long-double precision (fftwl) versions
of FFTW is now supported.
* Cycle counters (on all modern CPUs) are exploited to speed planning.
* Efficient transforms of real even/odd arrays, a.k.a. discrete
cosine/sine transforms (types I-IV). (Currently work via pre/post
processing of real transforms, ala FFTPACK, so are not optimal.)
* DHTs (Discrete Hartley Transforms), again via post-processing
of real transforms (and thus suboptimal, for now).
* Support for linking to just those parts of FFTW that you need,
greatly reducing the size of statically linked programs when
only a limited set of transform sizes/types are required.
* Canonical global wisdom file (/etc/fftw/wisdom) on Unix, along
with a command-line tool (fftw-wisdom) to generate/update it.
* Fortran API can be used with both g77 and non-g77 compilers
simultaneously.
* Multi-threaded version has optional OpenMP support.
* Authors' good looks have greatly improved with age.
2003-04-30 00:48:45 +02:00
|
|
|
MASTER_SITES= ftp://ftp.fftw.org/pub/fftw/ \
|
|
|
|
|
http://www.fftw.org/
|
|
|
|
|
|
1998-10-21 21:16:45 +02:00
|
|
|
MAINTAINER= root@garbled.net
|
2000-01-27 19:45:15 +01:00
|
|
|
HOMEPAGE= http://www.fftw.org/
|
2001-02-17 18:52:59 +01:00
|
|
|
COMMENT= Collection of fast C routines to compute DFTs
|
1998-10-21 21:16:45 +02:00
|
|
|
|
Update to version 3.0.
Major goals of this release:
* Speed: often 20% or more faster than FFTW 2.x, even without SIMD (see below).
* Complete rewrite, to make it easier to add new algorithms and transforms.
* New API, to support more general semantics.
Other enhancements:
* SIMD acceleration on supporting CPUs (SSE, SSE2, 3DNow!, and AltiVec).
(With special thanks to Franz Franchetti for many experimental prototypes
and to Stefan Kral for the vectorizing generator from fftwgel.)
* True in-place 1d transforms of large sizes (as well as compressed
twiddle tables for additional memory/cache savings).
* More arbitrary placement of real & imaginary data, e.g. including
interleaved (as in FFTW 2.x) as well as separate real/imag arrays.
* Efficient prime-size transforms of real data.
* Multidimensional transforms can operate on a subset of a larger matrix,
and/or transform selected dimensions of a multidimensional array.
* By popular demand, simultaneous linking to double precision (fftw),
single precision (fftwf), and long-double precision (fftwl) versions
of FFTW is now supported.
* Cycle counters (on all modern CPUs) are exploited to speed planning.
* Efficient transforms of real even/odd arrays, a.k.a. discrete
cosine/sine transforms (types I-IV). (Currently work via pre/post
processing of real transforms, ala FFTPACK, so are not optimal.)
* DHTs (Discrete Hartley Transforms), again via post-processing
of real transforms (and thus suboptimal, for now).
* Support for linking to just those parts of FFTW that you need,
greatly reducing the size of statically linked programs when
only a limited set of transform sizes/types are required.
* Canonical global wisdom file (/etc/fftw/wisdom) on Unix, along
with a command-line tool (fftw-wisdom) to generate/update it.
* Fortran API can be used with both g77 and non-g77 compilers
simultaneously.
* Multi-threaded version has optional OpenMP support.
* Authors' good looks have greatly improved with age.
2003-04-30 00:48:45 +02:00
|
|
|
USE_LIBTOOL= yes
|
2004-02-14 19:26:26 +01:00
|
|
|
PKGCONFIG_OVERRIDE+= fftw.pc.in
|
1998-10-21 21:16:45 +02:00
|
|
|
GNU_CONFIGURE= yes
|
2000-01-27 19:45:15 +01:00
|
|
|
CONFIGURE_ARGS= --enable-shared
|
2005-01-12 16:31:58 +01:00
|
|
|
USE_LANGUAGES= fortran
|
2004-01-24 14:51:13 +01:00
|
|
|
USE_GNU_TOOLS+= make
|
Update to version 3.0.
Major goals of this release:
* Speed: often 20% or more faster than FFTW 2.x, even without SIMD (see below).
* Complete rewrite, to make it easier to add new algorithms and transforms.
* New API, to support more general semantics.
Other enhancements:
* SIMD acceleration on supporting CPUs (SSE, SSE2, 3DNow!, and AltiVec).
(With special thanks to Franz Franchetti for many experimental prototypes
and to Stefan Kral for the vectorizing generator from fftwgel.)
* True in-place 1d transforms of large sizes (as well as compressed
twiddle tables for additional memory/cache savings).
* More arbitrary placement of real & imaginary data, e.g. including
interleaved (as in FFTW 2.x) as well as separate real/imag arrays.
* Efficient prime-size transforms of real data.
* Multidimensional transforms can operate on a subset of a larger matrix,
and/or transform selected dimensions of a multidimensional array.
* By popular demand, simultaneous linking to double precision (fftw),
single precision (fftwf), and long-double precision (fftwl) versions
of FFTW is now supported.
* Cycle counters (on all modern CPUs) are exploited to speed planning.
* Efficient transforms of real even/odd arrays, a.k.a. discrete
cosine/sine transforms (types I-IV). (Currently work via pre/post
processing of real transforms, ala FFTPACK, so are not optimal.)
* DHTs (Discrete Hartley Transforms), again via post-processing
of real transforms (and thus suboptimal, for now).
* Support for linking to just those parts of FFTW that you need,
greatly reducing the size of statically linked programs when
only a limited set of transform sizes/types are required.
* Canonical global wisdom file (/etc/fftw/wisdom) on Unix, along
with a command-line tool (fftw-wisdom) to generate/update it.
* Fortran API can be used with both g77 and non-g77 compilers
simultaneously.
* Multi-threaded version has optional OpenMP support.
* Authors' good looks have greatly improved with age.
2003-04-30 00:48:45 +02:00
|
|
|
INFO_FILES= fftw3.info
|
1998-10-21 21:16:45 +02:00
|
|
|
|
2003-07-08 16:05:29 +02:00
|
|
|
TEST_TARGET= check
|
|
|
|
|
|
1998-10-21 21:16:45 +02:00
|
|
|
.include "../../mk/bsd.pkg.mk"
|
