2011-11-29 Dodji Seketeli <dodji@redhat.com>
[official-gcc.git] / gcc / graphite-clast-to-gimple.h
blobb5affd989f0acb72c697f427cd4014013067fa5e
1 /* Translation of CLAST (CLooG AST) to Gimple.
2 Copyright (C) 2009, 2010 Free Software Foundation, Inc.
3 Contributed by Sebastian Pop <sebastian.pop@amd.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 #ifndef GCC_GRAPHITE_CLAST_TO_GIMPLE_H
22 #define GCC_GRAPHITE_CLAST_TO_GIMPLE_H
24 #include "graphite-cloog-util.h"
26 extern CloogState *cloog_state;
28 /* Data structure for CLooG program representation. */
30 typedef struct cloog_prog_clast {
31 CloogProgram *prog;
32 struct clast_stmt *stmt;
33 } cloog_prog_clast;
35 /* Stores BB's related PBB. */
37 typedef struct bb_pbb_def
39 basic_block bb;
40 poly_bb_p pbb;
41 } bb_pbb_def;
43 extern bool gloog (scop_p, htab_t);
44 extern cloog_prog_clast scop_to_clast (scop_p);
45 extern void debug_clast_stmt (struct clast_stmt *);
46 extern void print_clast_stmt (FILE *, struct clast_stmt *);
48 /* Hash function for data base element BB_PBB. */
50 static inline hashval_t
51 bb_pbb_map_hash (const void *bb_pbb)
53 return (hashval_t)(((const bb_pbb_def *)bb_pbb)->bb->index);
56 /* Compare data base element BB_PBB1 and BB_PBB2. */
58 static inline int
59 eq_bb_pbb_map (const void *bb_pbb1, const void *bb_pbb2)
61 const bb_pbb_def *bp1 = (const bb_pbb_def *) bb_pbb1;
62 const bb_pbb_def *bp2 = (const bb_pbb_def *) bb_pbb2;
63 return (bp1->bb->index == bp2->bb->index);
66 #endif