Chris@10: Next: Generating your own code, Chris@10: Previous: Installation on non-Unix systems, Chris@10: Up: Installation and Customization Chris@10:
Chris@10: FFTW's planner actually executes and times different possible FFT Chris@10: algorithms in order to pick the fastest plan for a given n. In Chris@10: order to do this in as short a time as possible, however, the timer must Chris@10: have a very high resolution, and to accomplish this we employ the Chris@10: hardware cycle counters that are available on most CPUs. Chris@10: Currently, FFTW supports the cycle counters on x86, PowerPC/POWER, Alpha, Chris@10: UltraSPARC (SPARC v9), IA64, PA-RISC, and MIPS processors. Chris@10: Chris@10:
Access to the cycle counters, unfortunately, is a compiler and/or
Chris@10: operating-system dependent task, often requiring inline assembly
Chris@10: language, and it may be that your compiler is not supported. If you are
Chris@10: not supported, FFTW will by default fall back on its estimator
Chris@10: (effectively using FFTW_ESTIMATE for all plans).
Chris@10:
Chris@10: You can add support by editing the file kernel/cycle.h; normally,
Chris@10: this will involve adapting one of the examples already present in order
Chris@10: to use the inline-assembler syntax for your C compiler, and will only
Chris@10: require a couple of lines of code. Anyone adding support for a new
Chris@10: system to cycle.h is encouraged to email us at fftw@fftw.org.
Chris@10:
Chris@10:
If a cycle counter is not available on your system (e.g. some embedded
Chris@10: processor), and you don't want to use estimated plans, as a last resort
Chris@10: you can use the --with-slow-timer option to configure (on
Chris@10: Unix) or #define WITH_SLOW_TIMER in config.h (elsewhere).
Chris@10: This will use the much lower-resolution gettimeofday function, or even
Chris@10: clock if the former is unavailable, and planning will be
Chris@10: extremely slow.
Chris@10:
Chris@10:
Chris@10:
Chris@10: