Mercurial > hg > sv-dependency-builds

annotate src/fftw-3.3.5/rdft/direct2.c @ 55:284acf908dcd

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Add source for PortAudio stable v190600_20161030
author Chris Cannam
date Tue, 03 Jan 2017 13:44:07 +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 RDFT2 R2HC/HC2R solver, if we have a codelet */
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 kr2c_desc *desc;
Chris@42 29 kr2c k;
Chris@42 30 } S;
Chris@42 31
Chris@42 32 typedef struct {
Chris@42 33 plan_rdft2 super;
Chris@42 34
Chris@42 35 stride rs, cs;
Chris@42 36 INT vl;
Chris@42 37 INT ivs, ovs;
Chris@42 38 kr2c k;
Chris@42 39 const S *slv;
Chris@42 40 INT ilast;
Chris@42 41 } P;
Chris@42 42
Chris@42 43 static void apply(const plan *ego_, R *r0, R *r1, R *cr, R *ci)
Chris@42 44 {
Chris@42 45 const P *ego = (const P *) ego_;
Chris@42 46 ASSERT_ALIGNED_DOUBLE;
Chris@42 47 ego->k(r0, r1, cr, ci,
Chris@42 48 ego->rs, ego->cs, ego->cs,
Chris@42 49 ego->vl, ego->ivs, ego->ovs);
Chris@42 50 }
Chris@42 51
Chris@42 52 static void apply_r2hc(const plan *ego_, R *r0, R *r1, R *cr, R *ci)
Chris@42 53 {
Chris@42 54 const P *ego = (const P *) ego_;
Chris@42 55 INT i, vl = ego->vl, ovs = ego->ovs;
Chris@42 56 ASSERT_ALIGNED_DOUBLE;
Chris@42 57 ego->k(r0, r1, cr, ci,
Chris@42 58 ego->rs, ego->cs, ego->cs,
Chris@42 59 vl, ego->ivs, ovs);
Chris@42 60 for (i = 0; i < vl; ++i, ci += ovs)
Chris@42 61 ci[0] = ci[ego->ilast] = 0;
Chris@42 62 }
Chris@42 63
Chris@42 64 static void destroy(plan *ego_)
Chris@42 65 {
Chris@42 66 P *ego = (P *) ego_;
Chris@42 67 X(stride_destroy)(ego->rs);
Chris@42 68 X(stride_destroy)(ego->cs);
Chris@42 69 }
Chris@42 70
Chris@42 71 static void print(const plan *ego_, printer *p)
Chris@42 72 {
Chris@42 73 const P *ego = (const P *) ego_;
Chris@42 74 const S *s = ego->slv;
Chris@42 75
Chris@42 76 p->print(p, "(rdft2-%s-direct-%D%v \"%s\")",
Chris@42 77 X(rdft_kind_str)(s->desc->genus->kind), s->desc->n,
Chris@42 78 ego->vl, s->desc->nam);
Chris@42 79 }
Chris@42 80
Chris@42 81 static int applicable(const solver *ego_, const problem *p_)
Chris@42 82 {
Chris@42 83 const S *ego = (const S *) ego_;
Chris@42 84 const kr2c_desc *desc = ego->desc;
Chris@42 85 const problem_rdft2 *p = (const problem_rdft2 *) p_;
Chris@42 86 INT vl;
Chris@42 87 INT ivs, ovs;
Chris@42 88
Chris@42 89 return (
Chris@42 90 1
Chris@42 91 && p->sz->rnk == 1
Chris@42 92 && p->vecsz->rnk <= 1
Chris@42 93 && p->sz->dims[0].n == desc->n
Chris@42 94 && p->kind == desc->genus->kind
Chris@42 95
Chris@42 96 /* check strides etc */
Chris@42 97 && X(tensor_tornk1)(p->vecsz, &vl, &ivs, &ovs)
Chris@42 98
Chris@42 99 && (0
Chris@42 100 /* can operate out-of-place */
Chris@42 101 || p->r0 != p->cr
Chris@42 102
Chris@42 103 /*
Chris@42 104 * can compute one transform in-place, no matter
Chris@42 105 * what the strides are.
Chris@42 106 */
Chris@42 107 || p->vecsz->rnk == 0
Chris@42 108
Chris@42 109 /* can operate in-place as long as strides are the same */
Chris@42 110 || X(rdft2_inplace_strides)(p, RNK_MINFTY)
Chris@42 111 )
Chris@42 112 );
Chris@42 113 }
Chris@42 114
Chris@42 115 static plan *mkplan(const solver *ego_, const problem *p_, planner *plnr)
Chris@42 116 {
Chris@42 117 const S *ego = (const S *) ego_;
Chris@42 118 P *pln;
Chris@42 119 const problem_rdft2 *p;
Chris@42 120 iodim *d;
Chris@42 121 int r2hc_kindp;
Chris@42 122
Chris@42 123 static const plan_adt padt = {
Chris@42 124 X(rdft2_solve), X(null_awake), print, destroy
Chris@42 125 };
Chris@42 126
Chris@42 127 UNUSED(plnr);
Chris@42 128
Chris@42 129 if (!applicable(ego_, p_))
Chris@42 130 return (plan *)0;
Chris@42 131
Chris@42 132 p = (const problem_rdft2 *) p_;
Chris@42 133
Chris@42 134 r2hc_kindp = R2HC_KINDP(p->kind);
Chris@42 135 A(r2hc_kindp || HC2R_KINDP(p->kind));
Chris@42 136
Chris@42 137 pln = MKPLAN_RDFT2(P, &padt, p->kind == R2HC ? apply_r2hc : apply);
Chris@42 138
Chris@42 139 d = p->sz->dims;
Chris@42 140
Chris@42 141 pln->k = ego->k;
Chris@42 142
Chris@42 143 pln->rs = X(mkstride)(d->n, r2hc_kindp ? d->is : d->os);
Chris@42 144 pln->cs = X(mkstride)(d->n, r2hc_kindp ? d->os : d->is);
Chris@42 145
Chris@42 146 X(tensor_tornk1)(p->vecsz, &pln->vl, &pln->ivs, &pln->ovs);
Chris@42 147
Chris@42 148 /* Nyquist freq., if any */
Chris@42 149 pln->ilast = (d->n % 2) ? 0 : (d->n/2) * d->os;
Chris@42 150
Chris@42 151 pln->slv = ego;
Chris@42 152 X(ops_zero)(&pln->super.super.ops);
Chris@42 153 X(ops_madd2)(pln->vl / ego->desc->genus->vl,
Chris@42 154 &ego->desc->ops,
Chris@42 155 &pln->super.super.ops);
Chris@42 156 if (p->kind == R2HC)
Chris@42 157 pln->super.super.ops.other += 2 * pln->vl; /* + 2 stores */
Chris@42 158
Chris@42 159 pln->super.super.could_prune_now_p = 1;
Chris@42 160 return &(pln->super.super);
Chris@42 161 }
Chris@42 162
Chris@42 163 /* constructor */
Chris@42 164 solver *X(mksolver_rdft2_direct)(kr2c k, const kr2c_desc *desc)
Chris@42 165 {
Chris@42 166 static const solver_adt sadt = { PROBLEM_RDFT2, mkplan, 0 };
Chris@42 167 S *slv = MKSOLVER(S, &sadt);
Chris@42 168 slv->k = k;
Chris@42 169 slv->desc = desc;
Chris@42 170 return &(slv->super);
Chris@42 171 }