cpet/openbsd-ports
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
openbsd-ports/math/fftw/Makefile

36 lines
683 B
Makefile
Raw Normal View History

replace simple PERMIT_PACKAGE_CDROM=Yes with PERMIT_PACKAGE=Yes
2019-07-12 20:46:54 +00:00
# $OpenBSD: Makefile,v 1.23 2019/07/12 20:47:40 sthen Exp $
Add portroach annotation
2014-11-10 08:14:34 +00:00
PORTROACH= limit:^2\.
initial port of fftw-2.1.3: -- FFTW is a free collection of fast C routines for computing the Discrete Fourier Transform in one or more dimensions. It includes complex, real, and parallel transforms, and can handle arbitrary array sizes efficiently. FFTW is typically faster than other publically-available FFT implementations, and is even competitive with vendor-tuned libraries. (See our web page for extensive benchmarks.) To achieve this performance, FFTW uses novel code-generation and runtime self-optimization techniques (along with many other tricks). WWW: http://www.fftw.org/ Submitted by Nikolay Sturm <Nikolay.Sturm@desy.de>
2001-07-01 23:10:44 +00:00
remove quotes from COMMENT/PERMIT*/BROKEN
2007-09-15 18:44:36 +00:00
COMMENT= C routines for computing the Discrete Fourier Transform
initial port of fftw-2.1.3: -- FFTW is a free collection of fast C routines for computing the Discrete Fourier Transform in one or more dimensions. It includes complex, real, and parallel transforms, and can handle arbitrary array sizes efficiently. FFTW is typically faster than other publically-available FFT implementations, and is even competitive with vendor-tuned libraries. (See our web page for extensive benchmarks.) To achieve this performance, FFTW uses novel code-generation and runtime self-optimization techniques (along with many other tricks). WWW: http://www.fftw.org/ Submitted by Nikolay Sturm <Nikolay.Sturm@desy.de>
2001-07-01 23:10:44 +00:00
update to last release of fftw2, 2.1.5 USE_LIBTOOL while here from steven.mestdagh at esat.kuleuven.be
2005-10-03 12:53:33 +00:00
DISTNAME= fftw-2.1.5
fold lib-only PFRAG.shared into PLIST, regen PLIST, and bump
2015-03-16 18:07:34 +00:00
REVISION= 3
SHARED_LIBS ok sturm@
2005-12-25 18:54:32 +00:00
SHARED_LIBS= fftw 2.7 \
rfftw 2.7
initial port of fftw-2.1.3: -- FFTW is a free collection of fast C routines for computing the Discrete Fourier Transform in one or more dimensions. It includes complex, real, and parallel transforms, and can handle arbitrary array sizes efficiently. FFTW is typically faster than other publically-available FFT implementations, and is even competitive with vendor-tuned libraries. (See our web page for extensive benchmarks.) To achieve this performance, FFTW uses novel code-generation and runtime self-optimization techniques (along with many other tricks). WWW: http://www.fftw.org/ Submitted by Nikolay Sturm <Nikolay.Sturm@desy.de>
2001-07-01 23:10:44 +00:00
CATEGORIES= math
HOMEPAGE= http://www.fftw.org/
# GPL
replace simple PERMIT_PACKAGE_CDROM=Yes with PERMIT_PACKAGE=Yes
2019-07-12 20:46:54 +00:00
PERMIT_PACKAGE= Yes
Add WANTLIB markers
2004-12-27 07:16:44 +00:00
WANTLIB= m
initial port of fftw-2.1.3: -- FFTW is a free collection of fast C routines for computing the Discrete Fourier Transform in one or more dimensions. It includes complex, real, and parallel transforms, and can handle arbitrary array sizes efficiently. FFTW is typically faster than other publically-available FFT implementations, and is even competitive with vendor-tuned libraries. (See our web page for extensive benchmarks.) To achieve this performance, FFTW uses novel code-generation and runtime self-optimization techniques (along with many other tricks). WWW: http://www.fftw.org/ Submitted by Nikolay Sturm <Nikolay.Sturm@desy.de>
2001-07-01 23:10:44 +00:00
Update mirrors.
2015-06-18 07:13:04 +00:00
MASTER_SITES= http://fftw.org/ \
ftp://ftp.fftw.org/pub/fftw/ \
ftp://ftp.fftw.org/pub/fftw/old/
initial port of fftw-2.1.3: -- FFTW is a free collection of fast C routines for computing the Discrete Fourier Transform in one or more dimensions. It includes complex, real, and parallel transforms, and can handle arbitrary array sizes efficiently. FFTW is typically faster than other publically-available FFT implementations, and is even competitive with vendor-tuned libraries. (See our web page for extensive benchmarks.) To achieve this performance, FFTW uses novel code-generation and runtime self-optimization techniques (along with many other tricks). WWW: http://www.fftw.org/ Submitted by Nikolay Sturm <Nikolay.Sturm@desy.de>
2001-07-01 23:10:44 +00:00
CONFIGURE_STYLE= gnu
.if ${MACHINE_ARCH} == "i386"
CONFIGURE_ARGS+= --enable-i386-hacks
make configure test for correct stack alignment evaluate to no on i386 (it was returning a pretty much random test result) go ahead sturm@
2006-01-17 07:18:23 +00:00
PATCH_LIST= gcc-* patch-*
initial port of fftw-2.1.3: -- FFTW is a free collection of fast C routines for computing the Discrete Fourier Transform in one or more dimensions. It includes complex, real, and parallel transforms, and can handle arbitrary array sizes efficiently. FFTW is typically faster than other publically-available FFT implementations, and is even competitive with vendor-tuned libraries. (See our web page for extensive benchmarks.) To achieve this performance, FFTW uses novel code-generation and runtime self-optimization techniques (along with many other tricks). WWW: http://www.fftw.org/ Submitted by Nikolay Sturm <Nikolay.Sturm@desy.de>
2001-07-01 23:10:44 +00:00
.endif
post-install:
${INSTALL_DATA_DIR} ${PREFIX}/share/doc/fftw
${INSTALL_DATA} ${WRKSRC}/doc/fftw.ps ${PREFIX}/share/doc/fftw
.include <bsd.port.mk>
Reference in New Issue Copy Permalink