diff options
| author | Andrew MacLeod <amacleod@redhat.com> | 2013-10-17 17:41:07 +0000 |
|---|---|---|
| committer | Andrew Macleod <amacleod@gcc.gnu.org> | 2013-10-17 17:41:07 +0000 |
| commit | 0645c1a22d29fcbe12ee8f774709b20b1bc3f594 (patch) | |
| tree | 7581ded8e73540ef06a21726e484e189f067777a /gcc/tree-parloops.c | |
| parent | 6f1abb55073c46b93155e13eb5308aee7f13dd5e (diff) | |
| download | gcc-0645c1a22d29fcbe12ee8f774709b20b1bc3f594.zip gcc-0645c1a22d29fcbe12ee8f774709b20b1bc3f594.tar.gz gcc-0645c1a22d29fcbe12ee8f774709b20b1bc3f594.tar.bz2 | |
tree-flow.h (struct omp_region): Move to omp-low.c.
* tree-flow.h (struct omp_region): Move to omp-low.c.
Remove omp_ prototypes and variables.
* gimple.h (omp_reduction_init): Move prototype to omp-low.h.
(copy_var_decl): Relocate prototype from tree-flow.h.
* gimple.c (copy_var_decl): Relocate from omp-low.c.
* tree.h: Move prototype to omp-low.h.
* omp-low.h: New File. Relocate prototypes here.
* omp-low.c (struct omp_region): Make local here.
(root_omp_region): Make static.
(copy_var_decl) Move to gimple.c.
(new_omp_region): Make static.
(make_gimple_omp_edges): New. Refactored from tree-cfg.c make_edges.
* tree-cfg.c: Include omp-low.h.
(make_edges): Factor out OMP specific bits to make_gimple_omp_edges.
* gimplify.c: Include omp-low.h.
* tree-parloops.c: Likewise.
c
* c-parser.c: Include omp-low.h.
* c-typeck.c: Likewise.
cp
* parser.c: Include omp-low.h.
* semantics.c: Likewise.
fortran
* trans-openmp.c: Include omp-low.h.
From-SVN: r203786
Diffstat (limited to 'gcc/tree-parloops.c')
| -rw-r--r-- | gcc/tree-parloops.c | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/gcc/tree-parloops.c b/gcc/tree-parloops.c index 056950d..cdef5c6 100644 --- a/gcc/tree-parloops.c +++ b/gcc/tree-parloops.c @@ -32,6 +32,7 @@ along with GCC; see the file COPYING3. If not see #include "tree-vectorizer.h" #include "tree-hasher.h" #include "tree-parloops.h" +#include "omp-low.h" /* This pass tries to distribute iterations of loops into several threads. The implementation is straightforward -- for each loop we test whether its |