Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | * Copyright (c) 2003, 2007-14 Matteo Frigo |
3 | | * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology |
4 | | * |
5 | | * This program is free software; you can redistribute it and/or modify |
6 | | * it under the terms of the GNU General Public License as published by |
7 | | * the Free Software Foundation; either version 2 of the License, or |
8 | | * (at your option) any later version. |
9 | | * |
10 | | * This program is distributed in the hope that it will be useful, |
11 | | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
13 | | * GNU General Public License for more details. |
14 | | * |
15 | | * You should have received a copy of the GNU General Public License |
16 | | * along with this program; if not, write to the Free Software |
17 | | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
18 | | * |
19 | | */ |
20 | | |
21 | | |
22 | | #include "rdft/rdft.h" |
23 | | |
24 | | /* use the apply() operation for RDFT problems */ |
25 | | void X(rdft_solve)(const plan *ego_, const problem *p_) |
26 | 0 | { |
27 | 0 | const plan_rdft *ego = (const plan_rdft *) ego_; |
28 | 0 | const problem_rdft *p = (const problem_rdft *) p_; |
29 | 0 | ego->apply(ego_, UNTAINT(p->I), UNTAINT(p->O)); |
30 | 0 | } |