head 1.4; access; symbols pkgsrc-2013Q2:1.4.0.54 pkgsrc-2013Q2-base:1.4 pkgsrc-2012Q4:1.4.0.52 pkgsrc-2012Q4-base:1.4 pkgsrc-2011Q4:1.4.0.50 pkgsrc-2011Q4-base:1.4 pkgsrc-2011Q2:1.4.0.48 pkgsrc-2011Q2-base:1.4 pkgsrc-2009Q4:1.4.0.46 pkgsrc-2009Q4-base:1.4 pkgsrc-2008Q4:1.4.0.44 pkgsrc-2008Q4-base:1.4 pkgsrc-2008Q3:1.4.0.42 pkgsrc-2008Q3-base:1.4 cube-native-xorg:1.4.0.40 cube-native-xorg-base:1.4 pkgsrc-2008Q2:1.4.0.38 pkgsrc-2008Q2-base:1.4 pkgsrc-2008Q1:1.4.0.36 pkgsrc-2008Q1-base:1.4 pkgsrc-2007Q4:1.4.0.34 pkgsrc-2007Q4-base:1.4 pkgsrc-2007Q3:1.4.0.32 pkgsrc-2007Q3-base:1.4 pkgsrc-2007Q2:1.4.0.30 pkgsrc-2007Q2-base:1.4 pkgsrc-2007Q1:1.4.0.28 pkgsrc-2007Q1-base:1.4 pkgsrc-2006Q4:1.4.0.26 pkgsrc-2006Q4-base:1.4 pkgsrc-2006Q3:1.4.0.24 pkgsrc-2006Q3-base:1.4 pkgsrc-2006Q2:1.4.0.22 pkgsrc-2006Q2-base:1.4 pkgsrc-2006Q1:1.4.0.20 pkgsrc-2006Q1-base:1.4 pkgsrc-2005Q4:1.4.0.18 pkgsrc-2005Q4-base:1.4 pkgsrc-2005Q3:1.4.0.16 pkgsrc-2005Q3-base:1.4 pkgsrc-2005Q2:1.4.0.14 pkgsrc-2005Q2-base:1.4 pkgsrc-2005Q1:1.4.0.12 pkgsrc-2005Q1-base:1.4 pkgsrc-2004Q4:1.4.0.10 pkgsrc-2004Q4-base:1.4 pkgsrc-2004Q3:1.4.0.8 pkgsrc-2004Q3-base:1.4 pkgsrc-2004Q2:1.4.0.6 pkgsrc-2004Q2-base:1.4 pkgsrc-2004Q1:1.4.0.4 pkgsrc-2004Q1-base:1.4 pkgsrc-2003Q4:1.4.0.2 pkgsrc-2003Q4-base:1.4 netbsd-1-6-1:1.1.0.6 netbsd-1-6-1-base:1.1 netbsd-1-6:1.1.0.8 netbsd-1-6-RELEASE-base:1.1 pkgviews:1.1.0.4 pkgviews-base:1.1 buildlink2:1.1.0.2 buildlink2-base:1.1 netbsd-1-5-PATCH003:1.1 netbsd-1-5-PATCH001:1.1; locks; strict; comment @# @; 1.4 date 2003.07.08.14.05.30; author wiz; state dead; branches; next 1.3; 1.3 date 2003.06.05.21.41.42; author wiz; state Exp; branches; next 1.2; 1.2 date 2003.04.29.22.48.46; author jtb; state dead; branches; next 1.1; 1.1 date 2001.03.03.07.33.47; author toshii; state Exp; branches; next ; desc @@ 1.4 log @Update to 3.0.1: * Some speed improvements in SIMD code. * --without-cycle-counter option is removed. If no cycle counter is found, then the estimator is always used. A --with-slow-timer option is provided to force the use of lower-resolution timers. * Added missing static keyword that prevented simultaneous linkage of different-precision versions; thanks to Rasmus Larson for the bug report. * Corrected accidental omission of f77_wisdom.f file; thanks to Alan Watson. * Removed non-portable use of 'tempfile' in fftw-wisdom-to-conf script; thanks to Nicolas Decoster for the patch. * Added 'make smallcheck' target in tests/ directory, at the request of James Treacy. @ text @$NetBSD: patch-aa,v 1.3 2003/06/05 21:41:42 wiz Exp $ --- doc/fftw3.texi.orig Tue Apr 15 20:53:44 2003 +++ doc/fftw3.texi @@@@ -90,7 +90,7 @@@@ approved by the Free Software Foundation @@dircategory Texinfo documentation system @@direntry -* fftw3: (fftw3)FFTW User's Manual. +* fftw3: (fftw3). FFTW User's Manual. @@end direntry @@titlepage @ 1.3 log @Add patch to make 'info fftw3' work. Noted broken by Jeremy C. Reed. PKGREVISION++ @ text @d1 1 a1 1 $NetBSD$ @ 1.2 log @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. @ text @d1 1 a1 1 $NetBSD: patch-aa,v 1.1 2001/03/03 07:33:47 toshii Exp $ d3 3 a5 5 --- doc/fftw.texi.orig Sat Mar 3 16:17:10 2001 +++ doc/fftw.texi @@@@ -5,6 +5,11 @@@@ @@settitle FFTW @@c %**end of header d7 7 a13 8 +@@dircategory Libraries +@@direntry +* FFTW: (fftw). Collection of fast C routines to compute DFTs. +@@end direntry + @@include version.texi @@setchapternewpage odd @@c define constant index (ct) @ 1.1 log @Add an info dir entry for fftw.info. @ text @d1 1 a1 1 $NetBSD$ @