• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    公众号

C++ REGISTER_SOLVER函数代码示例

原作者: [db:作者] 来自: [db:来源] 收藏 邀请

本文整理汇总了C++中REGISTER_SOLVER函数的典型用法代码示例。如果您正苦于以下问题:C++ REGISTER_SOLVER函数的具体用法?C++ REGISTER_SOLVER怎么用?C++ REGISTER_SOLVER使用的例子?那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。



在下文中一共展示了REGISTER_SOLVER函数的20个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的C++代码示例。

示例1: XM

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"));
     }
}
开发者ID:Aegisub,项目名称:fftw3,代码行数:8,代码来源:transpose-recurse.c


示例2: regsolver

static void regsolver(planner *plnr, INT r, int dec)
{
     S *slv = (S *)X(mksolver_ct)(sizeof(S), r, dec, mkcldw);
     REGISTER_SOLVER(plnr, &(slv->super));
     if (X(mksolver_ct_hook)) {
	  slv = (S *)X(mksolver_ct_hook)(sizeof(S), r, dec, mkcldw);
	  REGISTER_SOLVER(plnr, &(slv->super));
     }
}
开发者ID:exic,项目名称:last.fm-dbus,代码行数:9,代码来源:dftw-generic.c


示例3: regsolver

static void regsolver(planner *plnr, INT r)
{
     S *slv = (S *)X(mksolver_hc2hc)(sizeof(S), r, mkcldw);
     REGISTER_SOLVER(plnr, &(slv->super));
     if (X(mksolver_hc2hc_hook)) {
	  slv = (S *)X(mksolver_hc2hc_hook)(sizeof(S), r, mkcldw);
	  REGISTER_SOLVER(plnr, &(slv->super));
     }
}
开发者ID:8cH9azbsFifZ,项目名称:wspr,代码行数:9,代码来源:hc2hc-generic.c


示例4: X

void X(regsolver_hc2hc_direct)(planner *plnr, khc2hc codelet,
                               const hc2hc_desc *desc)
{
    S *slv = (S *)X(mksolver_hc2hc)(sizeof(S), desc->radix, mkcldw);
    slv->k = codelet;
    slv->desc = desc;
    REGISTER_SOLVER(plnr, &(slv->super.super));
    if (X(mksolver_hc2hc_hook)) {
        slv = (S *)X(mksolver_hc2hc_hook)(sizeof(S), desc->radix, mkcldw);
        slv->k = codelet;
        slv->desc = desc;
        REGISTER_SOLVER(plnr, &(slv->super.super));
    }
}
开发者ID:kjarosz,项目名称:cuda_udat,代码行数:14,代码来源:hc2hc-direct.c


示例5: regone

static void regone(planner *plnr, kdftwsq codelet,
		   const ct_desc *desc, int dec)
{
     S *slv = (S *)X(mksolver_ct)(sizeof(S), desc->radix, dec, mkcldw, 0);
     slv->k = codelet;
     slv->desc = desc;
     REGISTER_SOLVER(plnr, &(slv->super.super));
     if (X(mksolver_ct_hook)) {
	  slv = (S *)X(mksolver_ct_hook)(sizeof(S), desc->radix, dec,
					 mkcldw, 0);
	  slv->k = codelet;
	  slv->desc = desc;
	  REGISTER_SOLVER(plnr, &(slv->super.super));
     }
}
开发者ID:376473984,项目名称:fftw3,代码行数:15,代码来源:dftw-directsq.c


示例6: regone

static void regone(planner *plnr, khc2hc codelet, const hc2hc_desc *desc,
		   int bufferedp)
{
     S *slv = (S *)X(mksolver_hc2hc)(sizeof(S), desc->radix, mkcldw);
     slv->k = codelet;
     slv->desc = desc;
     slv->bufferedp = bufferedp;
     REGISTER_SOLVER(plnr, &(slv->super.super));
     if (X(mksolver_hc2hc_hook)) {
	  slv = (S *)X(mksolver_hc2hc_hook)(sizeof(S), desc->radix, mkcldw);
	  slv->k = codelet;
	  slv->desc = desc;
	  slv->bufferedp = bufferedp;
	  REGISTER_SOLVER(plnr, &(slv->super.super));
     }
}
开发者ID:Aegisub,项目名称:fftw3,代码行数:16,代码来源:hc2hc-direct.c


示例7: XM

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));
}
开发者ID:376473984,项目名称:fftw3,代码行数:8,代码来源:rdft-rank1-bigvec.c


示例8: X

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)));
}
开发者ID:RutulPandya,项目名称:fftw3,代码行数:9,代码来源:vrank-geq1.c


示例9: X

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]));
}
开发者ID:376473984,项目名称:fftw3,代码行数:10,代码来源:indirect.c


示例10: X

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]));
}
开发者ID:abrahamneben,项目名称:orbcomm_beam_mapping,代码行数:10,代码来源:rank0.c


示例11: X

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. */
}
开发者ID:8cH9azbsFifZ,项目名称:wspr,代码行数:12,代码来源:rank-geq2.c


示例12: X

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));
}
开发者ID:dpl0,项目名称:bioinformatics,代码行数:12,代码来源:dft-vrank-geq1.c


示例13: X

void X(rdft_rank0_register)(planner *p)
{
     unsigned i;
     static struct {
	  rdftapply apply;
	  int (*applicable)(const P *, const problem_rdft *);
	  const char *nam;
     } tab[] = {
	  { apply_memcpy,   applicable_memcpy,   "rdft-rank0-memcpy" },
	  { apply_memcpy_loop,   applicable_memcpy_loop,  
	    "rdft-rank0-memcpy-loop" },
	  { apply_iter,     applicable_iter,     "rdft-rank0-iter-ci" },
	  { apply_cpy2dco,  applicable_cpy2dco,  "rdft-rank0-iter-co" },
	  { apply_tiled,    applicable_tiled,    "rdft-rank0-tiled" },
	  { apply_tiledbuf, applicable_tiledbuf, "rdft-rank0-tiledbuf" },
	  { apply_ip_sq,    applicable_ip_sq,    "rdft-rank0-ip-sq" },
#if HAVE_CELL
	  { apply_cell,     applicable_cell,     "rdft-rank0-cell" },
	  { apply_ip_cell,  applicable_ip_cell,  "rdft-rank0-ip-cell" },
#endif
	  { 
	       apply_ip_sq_tiled,
	       applicable_ip_sq_tiled,
	       "rdft-rank0-ip-sq-tiled" 
	  },
	  { 
	       apply_ip_sq_tiledbuf,
	       applicable_ip_sq_tiledbuf,
	       "rdft-rank0-ip-sq-tiledbuf" 
	  },
     };

     for (i = 0; i < sizeof(tab) / sizeof(tab[0]); ++i) {
	  static const solver_adt sadt = { PROBLEM_RDFT, mkplan, 0 };
	  S *slv = MKSOLVER(S, &sadt);
	  slv->apply = tab[i].apply;
	  slv->applicable = tab[i].applicable;
	  slv->nam = tab[i].nam;
	  REGISTER_SOLVER(p, &(slv->super));
     }
}
开发者ID:8cH9azbsFifZ,项目名称:wspr,代码行数:41,代码来源:rank0.c


示例14: X

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.
     */
}
开发者ID:OS2World,项目名称:MM-SOUND-PM123,代码行数:21,代码来源:rank_geq2.c


示例15: X

void X(redft00e_r2hc_register)(planner *p)
{
     REGISTER_SOLVER(p, mksolver());
}
开发者ID:8cH9azbsFifZ,项目名称:wspr,代码行数:4,代码来源:redft00e-r2hc.c


示例16: X

void X(kr2r_register)(planner *p, kr2r codelet, const kr2r_desc *desc)
{
     REGISTER_SOLVER(p, X(mksolver_rdft_r2r_direct)(codelet, desc));
}
开发者ID:8cH9azbsFifZ,项目名称:wspr,代码行数:4,代码来源:kr2r.c


示例17: X

void X(dft_buffered_register)(planner *p)
{
     size_t i;
     for (i = 0; i < NELEM(maxnbufs); ++i)
	  REGISTER_SOLVER(p, mksolver(i));
}
开发者ID:Aegisub,项目名称:fftw3,代码行数:6,代码来源:buffered.c


示例18: X

void X(kdft_difsq_register)(planner *p, kdftwsq k, const ct_desc *desc)
{
     REGISTER_SOLVER(p, X(mksolver_ctsq)(k, desc, DECDIF));
}
开发者ID:exic,项目名称:last.fm-dbus,代码行数:4,代码来源:kdft-difsq.c


示例19: fftwf_dht_r2hc_register

void fftwf_dht_r2hc_register(planner *p)
{
     REGISTER_SOLVER(p, mksolver());
}
开发者ID:Rudrj2,项目名称:FFTW3_MOD-for-Android,代码行数:4,代码来源:dht-r2hc.c


示例20: X

void X(dft_nop_register)(planner *p)
{
     REGISTER_SOLVER(p, mksolver());
}
开发者ID:dstuck,项目名称:tinker_integrated_PIMC,代码行数:4,代码来源:nop.c



注:本文中的REGISTER_SOLVER函数示例由纯净天空整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。


鲜花

握手

雷人

路过

鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
上一篇:
C++ REGULATOR_SUPPLY函数代码示例发布时间:2022-05-30
下一篇:
C++ REGISTER_MIB函数代码示例发布时间:2022-05-30
热门推荐
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服(服务时间 9:00~18:00)

在线QQ客服
地址:深圳市南山区西丽大学城创智工业园
电邮:jeky_zhao#qq.com
移动电话:139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap