|
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 #ifndef __THREADS_H__
|
|
Chris@42
|
22 #define __THREADS_H__
|
|
Chris@42
|
23
|
|
Chris@42
|
24 #include "ifftw.h"
|
|
Chris@42
|
25 #include "ct.h"
|
|
Chris@42
|
26 #include "hc2hc.h"
|
|
Chris@42
|
27
|
|
Chris@42
|
28 typedef struct {
|
|
Chris@42
|
29 int min, max, thr_num;
|
|
Chris@42
|
30 void *data;
|
|
Chris@42
|
31 } spawn_data;
|
|
Chris@42
|
32
|
|
Chris@42
|
33 typedef void *(*spawn_function) (spawn_data *);
|
|
Chris@42
|
34
|
|
Chris@42
|
35 void X(spawn_loop)(int loopmax, int nthreads,
|
|
Chris@42
|
36 spawn_function proc, void *data);
|
|
Chris@42
|
37 int X(ithreads_init)(void);
|
|
Chris@42
|
38 void X(threads_cleanup)(void);
|
|
Chris@42
|
39
|
|
Chris@42
|
40 /* configurations */
|
|
Chris@42
|
41
|
|
Chris@42
|
42 void X(dft_thr_vrank_geq1_register)(planner *p);
|
|
Chris@42
|
43 void X(rdft_thr_vrank_geq1_register)(planner *p);
|
|
Chris@42
|
44 void X(rdft2_thr_vrank_geq1_register)(planner *p);
|
|
Chris@42
|
45
|
|
Chris@42
|
46 ct_solver *X(mksolver_ct_threads)(size_t size, INT r, int dec,
|
|
Chris@42
|
47 ct_mkinferior mkcldw,
|
|
Chris@42
|
48 ct_force_vrecursion force_vrecursionp);
|
|
Chris@42
|
49 hc2hc_solver *X(mksolver_hc2hc_threads)(size_t size, INT r, hc2hc_mkinferior mkcldw);
|
|
Chris@42
|
50
|
|
Chris@42
|
51 void X(threads_conf_standard)(planner *p);
|
|
Chris@42
|
52 void X(threads_register_hooks)(void);
|
|
Chris@42
|
53 void X(threads_unregister_hooks)(void);
|
|
Chris@42
|
54 void X(threads_register_planner_hooks)(void);
|
|
Chris@42
|
55
|
|
Chris@42
|
56 #endif /* __THREADS_H__ */
|
