gcc/graphite-clast-to-gimple.h

   1 /* Translation of CLAST (CLooG AST) to Gimple.
   2    Copyright (C) 2009-2013 Free Software Foundation, Inc.
   3    Contributed by Sebastian Pop <sebastian.pop@amd.com>.
   4
   5 This file is part of GCC.
   6
   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.
  11
  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.
  16
  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/>.  */
  20
  21 #ifndef GCC_GRAPHITE_CLAST_TO_GIMPLE_H
  22 #define GCC_GRAPHITE_CLAST_TO_GIMPLE_H
  23
  24 extern CloogState *cloog_state;
  25
  26 /* Data structure for CLooG program representation.  */
  27
  28 typedef struct cloog_prog_clast {
  29   CloogProgram *prog;
  30   struct clast_stmt *stmt;
  31 } cloog_prog_clast;
  32
  33 /* Stores BB's related PBB.  */
  34
  35 typedef struct bb_pbb_def
  36 {
  37   basic_block bb;
  38   poly_bb_p pbb;
  39 } bb_pbb_def;
  40
  41 extern bool gloog (scop_p, htab_t);
  42 extern void debug_clast_stmt (struct clast_stmt *);
  43 extern void print_clast_stmt (FILE *, struct clast_stmt *);
  44
  45 /* Hash function for data base element BB_PBB.  */
  46
  47 static inline hashval_t
  48 bb_pbb_map_hash (const void *bb_pbb)
  49 {
  50   return (hashval_t)(((const bb_pbb_def *)bb_pbb)->bb->index);
  51 }
  52
  53 /* Compare data base element BB_PBB1 and BB_PBB2.  */
  54
  55 static inline int
  56 eq_bb_pbb_map (const void *bb_pbb1, const void *bb_pbb2)
  57 {
  58   const bb_pbb_def *bp1 = (const bb_pbb_def *) bb_pbb1;
  59   const bb_pbb_def *bp2 = (const bb_pbb_def *) bb_pbb2;
  60   return (bp1->bb->index == bp2->bb->index);
  61 }
  62
  63 #endif