C++ (Cpp) mksolver Examples

Example #1

File: transpose-recurse.c Project: Aegisub/fftw3

void XM(transpose_recurse_register)(planner *p)
{
     int preserve_input;
     for (preserve_input = 0; preserve_input <= 1; ++preserve_input) {
	  REGISTER_SOLVER(p, mksolver(preserve_input, radix_sqrt, "sqrt"));
	  REGISTER_SOLVER(p, mksolver(preserve_input, radix_first, "first"));
     }
}

Example #2

File: rdft-rank1-bigvec.c Project: 376473984/fftw3

void XM(rdft_rank1_bigvec_register)(planner *p)
{
     rearrangement rearrange;
     int preserve_input;
     FORALL_REARRANGE(rearrange)
	  for (preserve_input = 0; preserve_input <= 1; ++preserve_input)
	       REGISTER_SOLVER(p, mksolver(rearrange, preserve_input));
}

Example #3

File: vrank-geq1.c Project: RutulPandya/fftw3

void X(dft_vrank_geq1_register)(planner *p)
{
     /* FIXME: Should we try other vecloop_dim values? */
     static const int buddies[] = { 1, -1 };
     size_t i;
     
     for (i = 0; i < NELEM(buddies); ++i)
          REGISTER_SOLVER(p, mksolver(buddies[i], buddies, NELEM(buddies)));
}

Example #4

File: indirect.c Project: 376473984/fftw3

void X(rdft_indirect_register)(planner *p)
{
     unsigned i;
     static const ndrct_adt *const adts[] = {
	  &adt_before, &adt_after
     };

     for (i = 0; i < sizeof(adts) / sizeof(adts[0]); ++i)
          REGISTER_SOLVER(p, mksolver(adts[i]));
}

Example #5

File: rank0.c Project: abrahamneben/orbcomm_beam_mapping

void X(dft_rank0_register)(planner *p)
{
     unsigned i;
     static const rnk0adt *const adts[] = {
	  &adt_cpy1, &adt_vec, &adt_io1, &adt_io2r, &adt_io2i
     };

     for (i = 0; i < sizeof(adts) / sizeof(adts[0]); ++i)
          REGISTER_SOLVER(p, mksolver(adts[i]));
}

Example #6

File: dft-vrank-geq1.c Project: dpl0/bioinformatics

void X(dft_thr_vrank_geq1_register)(planner *p)
{
     int i;

     /* FIXME: Should we try other vecloop_dim values? */
     static const int buddies[] = { 1, -1 };

     const int nbuddies = (int)(sizeof(buddies) / sizeof(buddies[0]));

     for (i = 0; i < nbuddies; ++i)
          REGISTER_SOLVER(p, mksolver(buddies[i], buddies, nbuddies));
}

Example #7

File: rank-geq2.c Project: 8cH9azbsFifZ/wspr

void X(rdft_rank_geq2_register)(planner *p)
{
     int i;
     static const int buddies[] = { 1, 0, -2 };

     const int nbuddies = (int)(sizeof(buddies) / sizeof(buddies[0]));

     for (i = 0; i < nbuddies; ++i)
          REGISTER_SOLVER(p, mksolver(buddies[i], buddies, nbuddies));

     /* FIXME: Should we try more buddies?  See also dft/rank-geq2. */
}

Example #8

File: rank_geq2.c Project: OS2World/MM-SOUND-PM123

void X(dft_rank_geq2_register)(planner *p)
{
     int i;
     static const int buddies[] = { 0, 1, -2 };

     const int nbuddies = sizeof(buddies) / sizeof(buddies[0]);

     for (i = 0; i < nbuddies; ++i)
          REGISTER_SOLVER(p, mksolver(buddies[i], buddies, nbuddies));

     /* FIXME:

        Should we try more buddies? 

        Another possible variant is to swap cld1 and cld2 (or rather,
        to swap their problems; they are not interchangeable because
        cld2 must be in-place).  In past versions of FFTW, however, I
        seem to recall that such rearrangements have made little or no
        difference.
     */
}

Example #9

File: nop.c Project: dstuck/tinker_integrated_PIMC

void X(dft_nop_register)(planner *p)
{
     REGISTER_SOLVER(p, mksolver());
}

Example #10

File: transpose-pairwise.c Project: 376473984/fftw3

void XM(transpose_pairwise_register)(planner *p)
{
     int preserve_input;
     for (preserve_input = 0; preserve_input <= 1; ++preserve_input)
	  REGISTER_SOLVER(p, mksolver(preserve_input));
}

Example #11

File: dft-serial.c Project: DougBurke/sherpa

void XM(dft_serial_register)(planner *p)
{
     REGISTER_SOLVER(p, mksolver());
}

Example #12

File: buffered2.c Project: phillipstanleymarbell/sunflower-simulator

void X(rdft2_buffered_register)(planner *p)
{
     REGISTER_SOLVER(p, mksolver());
}

Example #13

File: nop.c Project: Rudrj2/FFTW3_MOD-for-Android

void fftwf_rdft_nop_register(planner *p)
{
     REGISTER_SOLVER(p, mksolver());
}

Example #14

File: transpose-alltoall.c Project: phillipstanleymarbell/sunflower-simulator

void XM(transpose_alltoall_register)(planner *p)
{
     int cti;
     for (cti = 0; cti <= 1; ++cti)
	  REGISTER_SOLVER(p, mksolver(cti));
}

Example #15

File: reodft11e-r2hc-odd.c Project: Aegisub/fftw3

void X(reodft11e_r2hc_odd_register)(planner *p)
{
     REGISTER_SOLVER(p, mksolver());
}

Example #16

File: dht-rader.c Project: DougBurke/sherpa

void X(dht_rader_register)(planner *p)
{
     REGISTER_SOLVER(p, mksolver(0));
     REGISTER_SOLVER(p, mksolver(1));
}

Example #17

File: buffered.c Project: Aegisub/fftw3

void X(dft_buffered_register)(planner *p)
{
     size_t i;
     for (i = 0; i < NELEM(maxnbufs); ++i)
	  REGISTER_SOLVER(p, mksolver(i));
}

Example #18

File: direct-r2c.c Project: DougBurke/sherpa

solver *X(mksolver_rdft_r2c_directbuf)(kr2c k, const kr2c_desc *desc)
{
     return mksolver(k, desc, 1);
}

Example #19

File: vrank2-transpose.c Project: abrahamneben/orbcomm_beam_mapping

void X(dft_vrank2_transpose_register)(planner *p)
{
     REGISTER_SOLVER(p, mksolver());
}

Example #20

File: rdft2-rank-geq2-transposed.c Project: Aegisub/fftw3

void XM(rdft2_rank_geq2_transposed_register)(planner *p)
{
     int preserve_input;
     for (preserve_input = 0; preserve_input <= 1; ++preserve_input)
	  REGISTER_SOLVER(p, mksolver(preserve_input));
}

Example #21

File: reodft00e-splitradix.c Project: 376473984/fftw3

void X(reodft00e_splitradix_register)(planner *p)
{
     REGISTER_SOLVER(p, mksolver());
}

Example #22

File: rank0-rdft2.c Project: 376473984/fftw3

void X(rdft2_rank0_register)(planner *p)
{
     REGISTER_SOLVER(p, mksolver());
}

Example #23

File: dht-r2hc.c Project: Rudrj2/FFTW3_MOD-for-Android

void fftwf_dht_r2hc_register(planner *p)
{
     REGISTER_SOLVER(p, mksolver());
}

Example #24

File: redft00e-r2hc.c Project: 8cH9azbsFifZ/wspr

void X(redft00e_r2hc_register)(planner *p)
{
     REGISTER_SOLVER(p, mksolver());
}

Example #25

File: direct.c Project: 376473984/fftw3

solver *X(mksolver_dft_directbuf)(kdft k, const kdft_desc *desc)
{
     return mksolver(k, desc, 1);
}

Example #26

File: bluestein.c Project: DougBurke/sherpa

void X(dft_bluestein_register)(planner *p)
{
     REGISTER_SOLVER(p, mksolver());
}

Example #27

File: rader.c Project: OS2World/MM-SOUND-PM123

void X(dft_rader_register)(planner *p)
{
     REGISTER_SOLVER(p, mksolver());
     REGISTER_SOLVER(p, mksolver_dit());
}