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