NFFT Logo 3.2.3
kernel/nfsft/api.h
1 /*
2  * Copyright (c) 2002, 2012 Jens Keiner, Stefan Kunis, Daniel Potts
3  *
4  * This program is free software; you can redistribute it and/or modify it under
5  * the terms of the GNU General Public License as published by the Free Software
6  * Foundation; either version 2 of the License, or (at your option) any later
7  * version.
8  *
9  * This program is distributed in the hope that it will be useful, but WITHOUT
10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
11  * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
12  * details.
13  *
14  * You should have received a copy of the GNU General Public License along with
15  * this program; if not, write to the Free Software Foundation, Inc., 51
16  * Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
17  */
18 
19 /* $Id: api.h 3775 2012-06-02 16:39:48Z keiner $ */
20 
26 #ifndef API_H
27 #define API_H
28 
29 #include "config.h"
30 #include "nfft3.h"
31 
36 /* "Default exponent of maximum bandwidth" */
37 #define BWEXP_MAX 10
38 
39 /* "Default maximum bandwidth" */
40 #define BW_MAX 1024
41 
42 #define ROW(k) (k*(wisdom.N_MAX+2))
43 #define ROWK(k) (k*(wisdom.N_MAX+2)+k)
44 
45 #ifdef HAVE_STDBOOL_H
46  #include <stdbool.h>
47 #else
48  typedef enum {false = 0,true = 1} bool;
49 #endif
50 
51 //#define FIRST_L (int)floor(ntilde/(double)plength)
52 //#define LAST_L (int)ceil((Mtilde+1)/(double)plength)-1
53 
54 
59 {
62  unsigned int flags;
65  int N_MAX;
67  int T_MAX;
68 
69  /* Data for the direct algorithms */
70 
76  double *alpha;
82  double *beta;
88  double *gamma;
89 
90  /* Data for fast algorithms. */
91 
93  double threshold;
94 #ifdef _OPENMP
95  int nthreads;
96  fpt_set *set_threads;
97 #else
98 
99  fpt_set set;
100 #endif
101 };
102 /* \} */
103 #endif
104 

Generated on Tue Apr 30 2013 by Doxygen 1.8.1