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

41 lines
972 B
Makefile
Raw Normal View History

remove MODGNU_SHARED_LIBS
2006-01-06 13:30:40 -05:00
# $OpenBSD: Makefile,v 1.10 2006/01/06 18:30:40 steven Exp $
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 19:10:44 -04:00
# $FreeBSD: ports/math/fftw/Makefile,v 1.11 2000/06/16 21:51:38 asami Exp $
# Original from: Lars Koeller <Lars.Koeller@Uni-Bielefeld.DE>
COMMENT= "C routines for computing the Discrete Fourier Transform"
update to last release of fftw2, 2.1.5 USE_LIBTOOL while here from steven.mestdagh at esat.kuleuven.be
2005-10-03 08:53:33 -04:00
DISTNAME= fftw-2.1.5
SHARED_LIBS ok sturm@
2005-12-25 13:54:32 -05: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 19:10:44 -04:00
CATEGORIES= math
HOMEPAGE= http://www.fftw.org/
set MAINTAINER to sturm@openbsd.org naddy@ OK
2002-11-22 11:43:44 -05:00
MAINTAINER= Nikolay Sturm <sturm@openbsd.org>
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 19:10:44 -04:00
# GPL
PERMIT_PACKAGE_CDROM= Yes
PERMIT_PACKAGE_FTP= Yes
PERMIT_DISTFILES_CDROM= Yes
PERMIT_DISTFILES_FTP= Yes
Add WANTLIB markers
2004-12-27 02:16:44 -05: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 19:10:44 -04:00
MASTER_SITES= ftp://ftp.fftw.org/pub/fftw/ \
update to last release of fftw2, 2.1.5 USE_LIBTOOL while here from steven.mestdagh at esat.kuleuven.be
2005-10-03 08:53:33 -04:00
ftp://ftp.kusastro.kyoto-u.ac.jp/pub/src/GNU/fftw/ \
http://fftw.mirror.fr/
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 19:10:44 -04:00
update to last release of fftw2, 2.1.5 USE_LIBTOOL while here from steven.mestdagh at esat.kuleuven.be
2005-10-03 08:53:33 -04:00
USE_LIBTOOL= Yes
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 19:10:44 -04:00
CONFIGURE_STYLE= gnu
.if ${MACHINE_ARCH} == "i386"
CONFIGURE_ARGS+= --enable-i386-hacks
.endif
CONFIGURE_ARGS+= ${CONFIGURE_SHARED}
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