cannam@127: cannam@127: cannam@127: cannam@127: cannam@127:
cannam@127:cannam@127: Next: Real-data DFTs, Previous: Complex DFTs, Up: Basic Interface [Contents][Index]
cannam@127:All of the planner routines in FFTW accept an integer flags
cannam@127: argument, which is a bitwise OR (‘|’) of zero or more of the flag
cannam@127: constants defined below.  These flags control the rigor (and time) of
cannam@127: the planning process, and can also impose (or lift) restrictions on the
cannam@127: type of transform algorithm that is employed.
cannam@127: 
Important: the planner overwrites the input array during
cannam@127: planning unless a saved plan (see Wisdom) is available for that
cannam@127: problem, so you should initialize your input data after creating the
cannam@127: plan.  The only exceptions to this are the FFTW_ESTIMATE and
cannam@127: FFTW_WISDOM_ONLY flags, as mentioned below.
cannam@127: 
In all  cases, if  wisdom is  available for the  given problem  that was
cannam@127: created  with equal-or-greater  planning rigor,  then the  more rigorous
cannam@127: wisdom is used.  For example, in FFTW_ESTIMATE mode any available
cannam@127: wisdom is used, whereas  in FFTW_PATIENT mode only wisdom created
cannam@127: in patient or exhaustive mode can be used.  See Words of Wisdom-Saving Plans.
cannam@127: 
FFTW_ESTIMATE specifies that, instead of actual measurements of
cannam@127: different algorithms, a simple heuristic is used to pick a (probably
cannam@127: sub-optimal) plan quickly.  With this flag, the input/output arrays are
cannam@127: not overwritten during planning.
cannam@127: 
cannam@127: FFTW_MEASURE tells FFTW to find an optimized plan by actually
cannam@127: computing several FFTs and measuring their execution time.
cannam@127: Depending on your machine, this can take some time (often a few
cannam@127: seconds).  FFTW_MEASURE is the default planning option.
cannam@127: 
cannam@127: FFTW_PATIENT is like FFTW_MEASURE, but considers a wider
cannam@127: range of algorithms and often produces a “more optimal” plan
cannam@127: (especially for large transforms), but at the expense of several times
cannam@127: longer planning time (especially for large transforms).
cannam@127: 
cannam@127: FFTW_EXHAUSTIVE is like FFTW_PATIENT, but considers an
cannam@127: even wider range of algorithms, including many that we think are
cannam@127: unlikely to be fast, to produce the most optimal plan but with a
cannam@127: substantially increased planning time.
cannam@127: 
cannam@127: FFTW_WISDOM_ONLY is a special planning mode in which the plan
cannam@127: is only created if wisdom is available for the given problem, and
cannam@127: otherwise a NULL plan is returned.  This can be combined with
cannam@127: other flags, e.g. ‘FFTW_WISDOM_ONLY | FFTW_PATIENT’ creates a
cannam@127: plan only if wisdom is available that was created in
cannam@127: FFTW_PATIENT or FFTW_EXHAUSTIVE mode.  The
cannam@127: FFTW_WISDOM_ONLY flag is intended for users who need to detect
cannam@127: whether wisdom is available; for example, if wisdom is not available
cannam@127: one may wish to allocate new arrays for planning so that user data is
cannam@127: not overwritten.
cannam@127: 
cannam@127: FFTW_DESTROY_INPUT specifies that an out-of-place transform is
cannam@127: allowed to overwrite its input array with arbitrary data; this
cannam@127: can sometimes allow more efficient algorithms to be employed.
cannam@127: 
cannam@127: 
cannam@127: FFTW_PRESERVE_INPUT specifies that an out-of-place transform must
cannam@127: not change its input array.  This is ordinarily the
cannam@127: default, except for c2r and hc2r (i.e. complex-to-real)
cannam@127: transforms for which FFTW_DESTROY_INPUT is the default.  In the
cannam@127: latter cases, passing FFTW_PRESERVE_INPUT will attempt to use
cannam@127: algorithms that do not destroy the input, at the expense of worse
cannam@127: performance; for multi-dimensional c2r transforms, however, no
cannam@127: input-preserving algorithms are implemented and the planner will return
cannam@127: NULL if one is requested.
cannam@127: 
cannam@127: 
cannam@127: 
cannam@127: FFTW_UNALIGNED specifies that the algorithm may not impose any
cannam@127: unusual alignment requirements on the input/output arrays (i.e. no
cannam@127: SIMD may be used).  This flag is normally not necessary, since
cannam@127: the planner automatically detects misaligned arrays.  The only use for
cannam@127: this flag is if you want to use the new-array execute interface to
cannam@127: execute a given plan on a different array that may not be aligned like
cannam@127: the original.  (Using fftw_malloc makes this flag unnecessary
cannam@127: even then.  You can also use fftw_alignment_of to detect
cannam@127: whether two arrays are equivalently aligned.)
cannam@127: 
cannam@127: extern void fftw_set_timelimit(double seconds); cannam@127:
This function instructs FFTW to spend at most seconds seconds
cannam@127: (approximately) in the planner.  If seconds ==
cannam@127: FFTW_NO_TIMELIMIT (the default value, which is negative), then
cannam@127: planning time is unbounded.  Otherwise, FFTW plans with a
cannam@127: progressively wider range of algorithms until the the given time limit
cannam@127: is reached or the given range of algorithms is explored, returning the
cannam@127: best available plan.
cannam@127: 
cannam@127: 
For example, specifying FFTW_PATIENT first plans in
cannam@127: FFTW_ESTIMATE mode, then in FFTW_MEASURE mode, then
cannam@127: finally (time permitting) in FFTW_PATIENT.  If
cannam@127: FFTW_EXHAUSTIVE is specified instead, the planner will further
cannam@127: progress to FFTW_EXHAUSTIVE mode.
cannam@127: 
Note that the seconds argument specifies only a rough limit; in
cannam@127: practice, the planner may use somewhat more time if the time limit is
cannam@127: reached when the planner is in the middle of an operation that cannot
cannam@127: be interrupted.  At the very least, the planner will complete planning
cannam@127: in FFTW_ESTIMATE mode (which is thus equivalent to a time limit
cannam@127: of 0).
cannam@127: 
cannam@127: Next: Real-data DFTs, Previous: Complex DFTs, Up: Basic Interface [Contents][Index]
cannam@127: