Mercurial > hg > sv-dependency-builds

annotate src/fftw-3.3.5/rdft/direct-r2r.c @ 84:08ae793730bd

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Add null config files
author Chris Cannam
date Mon, 02 Mar 2020 14:03:47 +0000
parents 2cd0e3b3e1fd
children
rev   line source
Chris@42 1 /*
Chris@42 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@42 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@42 4 *
Chris@42 5 * This program is free software; you can redistribute it and/or modify
Chris@42 6 * it under the terms of the GNU General Public License as published by
Chris@42 7 * the Free Software Foundation; either version 2 of the License, or
Chris@42 8 * (at your option) any later version.
Chris@42 9 *
Chris@42 10 * This program is distributed in the hope that it will be useful,
Chris@42 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@42 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@42 13 * GNU General Public License for more details.
Chris@42 14 *
Chris@42 15 * You should have received a copy of the GNU General Public License
Chris@42 16 * along with this program; if not, write to the Free Software
Chris@42 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@42 18 *
Chris@42 19 */
Chris@42 20
Chris@42 21
Chris@42 22 /* direct RDFT solver, using r2r codelets */
Chris@42 23
Chris@42 24 #include "rdft.h"
Chris@42 25
Chris@42 26 typedef struct {
Chris@42 27 solver super;
Chris@42 28 const kr2r_desc *desc;
Chris@42 29 kr2r k;
Chris@42 30 } S;
Chris@42 31
Chris@42 32 typedef struct {
Chris@42 33 plan_rdft super;
Chris@42 34
Chris@42 35 INT vl, ivs, ovs;
Chris@42 36 stride is, os;
Chris@42 37 kr2r k;
Chris@42 38 const S *slv;
Chris@42 39 } P;
Chris@42 40
Chris@42 41 static void apply(const plan *ego_, R *I, R *O)
Chris@42 42 {
Chris@42 43 const P *ego = (const P *) ego_;
Chris@42 44 ASSERT_ALIGNED_DOUBLE;
Chris@42 45 ego->k(I, O, ego->is, ego->os, ego->vl, ego->ivs, ego->ovs);
Chris@42 46 }
Chris@42 47
Chris@42 48 static void destroy(plan *ego_)
Chris@42 49 {
Chris@42 50 P *ego = (P *) ego_;
Chris@42 51 X(stride_destroy)(ego->is);
Chris@42 52 X(stride_destroy)(ego->os);
Chris@42 53 }
Chris@42 54
Chris@42 55 static void print(const plan *ego_, printer *p)
Chris@42 56 {
Chris@42 57 const P *ego = (const P *) ego_;
Chris@42 58 const S *s = ego->slv;
Chris@42 59
Chris@42 60 p->print(p, "(rdft-%s-direct-r2r-%D%v \"%s\")",
Chris@42 61 X(rdft_kind_str)(s->desc->kind), s->desc->n,
Chris@42 62 ego->vl, s->desc->nam);
Chris@42 63 }
Chris@42 64
Chris@42 65 static int applicable(const solver *ego_, const problem *p_)
Chris@42 66 {
Chris@42 67 const S *ego = (const S *) ego_;
Chris@42 68 const problem_rdft *p = (const problem_rdft *) p_;
Chris@42 69 INT vl;
Chris@42 70 INT ivs, ovs;
Chris@42 71
Chris@42 72 return (
Chris@42 73 1
Chris@42 74 && p->sz->rnk == 1
Chris@42 75 && p->vecsz->rnk <= 1
Chris@42 76 && p->sz->dims[0].n == ego->desc->n
Chris@42 77 && p->kind[0] == ego->desc->kind
Chris@42 78
Chris@42 79 /* check strides etc */
Chris@42 80 && X(tensor_tornk1)(p->vecsz, &vl, &ivs, &ovs)
Chris@42 81
Chris@42 82 && (0
Chris@42 83 /* can operate out-of-place */
Chris@42 84 || p->I != p->O
Chris@42 85
Chris@42 86 /* computing one transform */
Chris@42 87 || vl == 1
Chris@42 88
Chris@42 89 /* can operate in-place as long as strides are the same */
Chris@42 90 || X(tensor_inplace_strides2)(p->sz, p->vecsz)
Chris@42 91 )
Chris@42 92 );
Chris@42 93 }
Chris@42 94
Chris@42 95 static plan *mkplan(const solver *ego_, const problem *p_, planner *plnr)
Chris@42 96 {
Chris@42 97 const S *ego = (const S *) ego_;
Chris@42 98 P *pln;
Chris@42 99 const problem_rdft *p;
Chris@42 100 iodim *d;
Chris@42 101
Chris@42 102 static const plan_adt padt = {
Chris@42 103 X(rdft_solve), X(null_awake), print, destroy
Chris@42 104 };
Chris@42 105
Chris@42 106 UNUSED(plnr);
Chris@42 107
Chris@42 108 if (!applicable(ego_, p_))
Chris@42 109 return (plan *)0;
Chris@42 110
Chris@42 111 p = (const problem_rdft *) p_;
Chris@42 112
Chris@42 113
Chris@42 114 pln = MKPLAN_RDFT(P, &padt, apply);
Chris@42 115
Chris@42 116 d = p->sz->dims;
Chris@42 117
Chris@42 118 pln->k = ego->k;
Chris@42 119
Chris@42 120 pln->is = X(mkstride)(d->n, d->is);
Chris@42 121 pln->os = X(mkstride)(d->n, d->os);
Chris@42 122
Chris@42 123 X(tensor_tornk1)(p->vecsz, &pln->vl, &pln->ivs, &pln->ovs);
Chris@42 124
Chris@42 125 pln->slv = ego;
Chris@42 126 X(ops_zero)(&pln->super.super.ops);
Chris@42 127 X(ops_madd2)(pln->vl / ego->desc->genus->vl,
Chris@42 128 &ego->desc->ops,
Chris@42 129 &pln->super.super.ops);
Chris@42 130
Chris@42 131 pln->super.super.could_prune_now_p = 1;
Chris@42 132
Chris@42 133 return &(pln->super.super);
Chris@42 134 }
Chris@42 135
Chris@42 136 /* constructor */
Chris@42 137 solver *X(mksolver_rdft_r2r_direct)(kr2r k, const kr2r_desc *desc)
Chris@42 138 {
Chris@42 139 static const solver_adt sadt = { PROBLEM_RDFT, mkplan, 0 };
Chris@42 140 S *slv = MKSOLVER(S, &sadt);
Chris@42 141 slv->k = k;
Chris@42 142 slv->desc = desc;
Chris@42 143 return &(slv->super);
Chris@42 144 }
Chris@42 145