1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
/*
* Copyright (c) 2003 Matteo Frigo
* Copyright (c) 2003 Massachusetts Institute of Technology
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include "api.h"
apiplan *X(mkapiplan)(int sign, unsigned flags, problem *prb)
WITH_ALIGNED_STACK({
plan *pln;
plan *pln0;
apiplan *p = 0;
planner *plnr = X(the_planner)();
/* map API flags into FFTW flags */
X(mapflags)(plnr, flags);
/* create plan */
plnr->planner_flags &= ~BLESSING;
pln = plnr->adt->mkplan(plnr, prb);
if (pln) {
AWAKE(pln, 1);
/* build apiplan */
p = (apiplan *) MALLOC(sizeof(apiplan), PLANS);
p->pln = pln;
p->prb = prb;
p->sign = sign; /* cache for execute_dft */
/* blessing protocol */
plnr->planner_flags |= BLESSING;
pln0 = plnr->adt->mkplan(plnr, prb);
X(plan_destroy_internal)(pln0);
} else {
X(problem_destroy)(prb);
}
/* discard all information not necessary to reconstruct the
plan */
plnr->adt->forget(plnr, FORGET_ACCURSED);
return p;
})
void X(destroy_plan)(X(plan) p)
{
if (p) {
AWAKE(p->pln, 0);
X(plan_destroy_internal)(p->pln);
X(problem_destroy)(p->prb);
X(ifree)(p);
}
}
|
