/ /

/

/

/ /

/

/

* This processes one or more 64-byte data blocks, but does NOT update * the bit counters. There are no alignment requirements. */

! @brief Initialize a clfftSetupData struct for the client * @details clfftSetupData is passed to clfftSetup to control behavior of the FFT runtime

/

/

/

Small snippet of code that multiplies the twiddle factors into the butterfiles. It is only emitted if the plan tells the generator that it wants the

Small snippet of code that multiplies the twiddle factors into the butterfiles. It is only emitted if the plan tells the generator that it wants the

/

Find the smallest power of 2 that is >= n; return its power of 2 factor e.g., CeilPo2 (7) returns 3 : (2^3 >= 7)

If the function succeeds, the return value is nonzero. If the function fails, the return value is zero.

This takes a shared module handle returned from LoadSharedLibrary, and a text string of a symbol to load from the module, and returns a pointer to tha

SweepRegs is to iterate through the registers to do the three basic operations: reading, twiddle multiplication, writing

Returns CLFFT_SUCCESS if the fp64 is present, CLFFT_DEVICE_NO_DOUBLE if it is not found.

generate transepose kernel with sqaure 2d matrix of row major with arbitrary batch size Below is a matrix(row major) containing three sqaure sub matri

OpenCL does not take unicode strings as input, so this routine returns only ASCII strings Feed this generator the FFTPlan, and it returns the generate

Compute reference output using fftw for float type

-> get_cycles function gets the swapping logic required for given row x col matrix. -> cycle_map[0] holds the total number of cycles required. -> cycl

/

/

/

/

Calculates a 3 point average of other_buffer and multiplies with buffer only real layout is supported for other_buffer currently

calculate the permutation cycles consumed in swap kernels. each cycle is strored in a vecotor. hopfully there are mutliple independent vectors thus we