/* Graphite polyhedral representation.
- Copyright (C) 2009 Free Software Foundation, Inc.
+ Copyright (C) 2009, 2010 Free Software Foundation, Inc.
Contributed by Sebastian Pop <sebastian.pop@amd.com> and
Tobias Grosser <grosser@fim.uni-passau.de>.
void new_poly_dr (poly_bb_p, int, ppl_Pointset_Powerset_C_Polyhedron_t,
enum poly_dr_type, void *, graphite_dim_t);
void free_poly_dr (poly_dr_p);
-void debug_pdr (poly_dr_p);
-void print_pdr (FILE *, poly_dr_p);
+void debug_pdr (poly_dr_p, int);
+void print_pdr (FILE *, poly_dr_p, int);
static inline scop_p pdr_scop (poly_dr_p pdr);
/* The dimension of the PDR_ACCESSES polyhedron of PDR. */
struct poly_scattering
{
- /* The scattering function containing the transformations. */
+ /* The scattering function containing the transformations: the
+ layout of this polyhedron is: T|I|G with T the transform
+ scattering, I the iteration domain, G the context parameters. */
ppl_Polyhedron_t scattering;
/* The number of local variables. */
struct poly_bb
{
+ /* Pointer to a basic block or a statement in the compiler. */
void *black_box;
+ /* Pointer to the SCOP containing this PBB. */
scop_p scop;
- /* The iteration domain of this bb.
+ /* The iteration domain of this bb. The layout of this polyhedron
+ is I|G with I the iteration domain, G the context parameters.
+
Example:
for (i = a - 7*b + 8; i <= 3*a + 13*b + 20; i++)
extern void free_poly_bb (poly_bb_p);
extern void debug_loop_vec (poly_bb_p);
extern void schedule_to_scattering (poly_bb_p, int);
-extern void print_pbb_domain (FILE *, poly_bb_p);
-extern void print_pbb (FILE *, poly_bb_p);
-extern void print_scop_context (FILE *, scop_p);
-extern void print_scop (FILE *, scop_p);
-extern void debug_pbb_domain (poly_bb_p);
-extern void debug_pbb (poly_bb_p);
-extern void print_pdrs (FILE *, poly_bb_p);
-extern void debug_pdrs (poly_bb_p);
-extern void debug_scop_context (scop_p);
-extern void debug_scop (scop_p);
-extern void print_scop_params (FILE *, scop_p);
-extern void debug_scop_params (scop_p);
-extern void print_iteration_domain (FILE *, poly_bb_p);
-extern void print_iteration_domains (FILE *, scop_p);
-extern void debug_iteration_domain (poly_bb_p);
-extern void debug_iteration_domains (scop_p);
+extern void print_pbb_domain (FILE *, poly_bb_p, int);
+extern void print_pbb (FILE *, poly_bb_p, int);
+extern void print_scop_context (FILE *, scop_p, int);
+extern void print_scop (FILE *, scop_p, int);
+extern void print_cloog (FILE *, scop_p, int);
+extern void debug_pbb_domain (poly_bb_p, int);
+extern void debug_pbb (poly_bb_p, int);
+extern void print_pdrs (FILE *, poly_bb_p, int);
+extern void debug_pdrs (poly_bb_p, int);
+extern void debug_scop_context (scop_p, int);
+extern void debug_scop (scop_p, int);
+extern void debug_cloog (scop_p, int);
+extern void print_scop_params (FILE *, scop_p, int);
+extern void debug_scop_params (scop_p, int);
+extern void print_iteration_domain (FILE *, poly_bb_p, int);
+extern void print_iteration_domains (FILE *, scop_p, int);
+extern void debug_iteration_domain (poly_bb_p, int);
+extern void debug_iteration_domains (scop_p, int);
extern bool scop_do_interchange (scop_p);
extern bool scop_do_strip_mine (scop_p);
-extern void pbb_number_of_iterations (poly_bb_p, graphite_dim_t, Value);
-extern void pbb_number_of_iterations_at_time (poly_bb_p, graphite_dim_t, Value);
+extern bool scop_do_block (scop_p);
+extern void pbb_number_of_iterations (poly_bb_p, graphite_dim_t, mpz_t);
+extern void pbb_number_of_iterations_at_time (poly_bb_p, graphite_dim_t, mpz_t);
extern void pbb_remove_duplicate_pdrs (poly_bb_p);
/* Return the number of write data references in PBB. */
return res;
}
+/* The basic block of the PBB. */
+
+static inline basic_block
+pbb_bb (poly_bb_p pbb)
+{
+ return GBB_BB (PBB_BLACK_BOX (pbb));
+}
+
/* The index of the PBB. */
static inline int
pbb_index (poly_bb_p pbb)
{
- return GBB_BB (PBB_BLACK_BOX (pbb))->index;
+ return pbb_bb (pbb)->index;
}
/* The loop of the PBB. */
/* A pointer to the loop that contains this node. */
lst_p loop_father;
+ /* The sum of all the memory strides for an LST loop. */
+ mpz_t memory_strides;
+
/* Loop nodes contain a sequence SEQ of LST nodes, statements
contain a pointer to their polyhedral representation PBB. */
union {
#define LST_LOOP_FATHER(LST) ((LST)->loop_father)
#define LST_PBB(LST) ((LST)->node.pbb)
#define LST_SEQ(LST) ((LST)->node.seq)
+#define LST_LOOP_MEMORY_STRIDES(LST) ((LST)->memory_strides)
void scop_to_lst (scop_p);
void print_lst (FILE *, lst_p, int);
LST_LOOP_P (lst) = true;
LST_SEQ (lst) = seq;
LST_LOOP_FATHER (lst) = NULL;
+ mpz_init (LST_LOOP_MEMORY_STRIDES (lst));
+ mpz_set_si (LST_LOOP_MEMORY_STRIDES (lst), -1);
for (i = 0; VEC_iterate (lst_p, seq, i, l); i++)
LST_LOOP_FATHER (l) = lst;
for (i = 0; VEC_iterate (lst_p, LST_SEQ (lst), i, l); i++)
free_lst (l);
+ mpz_clear (LST_LOOP_MEMORY_STRIDES (lst));
VEC_free (lst_p, heap, LST_SEQ (lst));
}
return lst_dewey_number_at_depth (LST_LOOP_FATHER (lst), depth);
}
+/* Returns the predecessor of LST in the sequence of its loop father.
+ Returns NULL if LST is the first statement in the sequence. */
+
+static inline lst_p
+lst_pred (lst_p lst)
+{
+ int dewey;
+ lst_p father;
+
+ if (!lst || !LST_LOOP_FATHER (lst))
+ return NULL;
+
+ dewey = lst_dewey_number (lst);
+ if (dewey == 0)
+ return NULL;
+
+ father = LST_LOOP_FATHER (lst);
+ return VEC_index (lst_p, LST_SEQ (father), dewey - 1);
+}
+
+/* Returns the successor of LST in the sequence of its loop father.
+ Returns NULL if there is none. */
+
+static inline lst_p
+lst_succ (lst_p lst)
+{
+ int dewey;
+ lst_p father;
+
+ if (!lst || !LST_LOOP_FATHER (lst))
+ return NULL;
+
+ dewey = lst_dewey_number (lst);
+ father = LST_LOOP_FATHER (lst);
+
+ if (VEC_length (lst_p, LST_SEQ (father)) == (unsigned) dewey + 1)
+ return NULL;
+
+ return VEC_index (lst_p, LST_SEQ (father), dewey + 1);
+}
+
+
/* Return the LST node corresponding to PBB. */
static inline lst_p
return res;
}
- gcc_unreachable ();
return NULL;
}
+/* Returns true when LST is a loop that does not contains
+ statements. */
+
+static inline bool
+lst_empty_p (lst_p lst)
+{
+ return !lst_find_first_pbb (lst);
+}
+
/* Return the last lst representing a PBB statement in LST. */
static inline lst_p
static inline void
lst_insert_in_sequence (lst_p lst1, lst_p lst2, bool before)
{
- lst_p father = LST_LOOP_FATHER (lst2);
- int dewey = lst_dewey_number (lst2);
+ lst_p father;
+ int dewey;
+
+ /* Do not insert empty loops. */
+ if (!lst1 || lst_empty_p (lst1))
+ return;
- gcc_assert (lst1 && lst2 && father && dewey >= 0);
+ father = LST_LOOP_FATHER (lst2);
+ dewey = lst_dewey_number (lst2);
+
+ gcc_assert (lst2 && father && dewey >= 0);
VEC_safe_insert (lst_p, heap, LST_SEQ (father), before ? dewey : dewey + 1,
lst1);
LST_LOOP_FATHER (lst1) = father;
}
+/* Replaces LST1 with LST2. */
+
+static inline void
+lst_replace (lst_p lst1, lst_p lst2)
+{
+ lst_p father;
+ int dewey;
+
+ if (!lst2 || lst_empty_p (lst2))
+ return;
+
+ father = LST_LOOP_FATHER (lst1);
+ dewey = lst_dewey_number (lst1);
+ LST_LOOP_FATHER (lst2) = father;
+ VEC_replace (lst_p, LST_SEQ (father), dewey, lst2);
+}
+
+/* Returns a copy of ROOT where LST has been replaced by a copy of the
+ LSTs A B C in this sequence. */
+
+static inline lst_p
+lst_substitute_3 (lst_p root, lst_p lst, lst_p a, lst_p b, lst_p c)
+{
+ int i;
+ lst_p l;
+ VEC (lst_p, heap) *seq;
+
+ if (!root)
+ return NULL;
+
+ gcc_assert (lst && root != lst);
+
+ if (!LST_LOOP_P (root))
+ return new_lst_stmt (LST_PBB (root));
+
+ seq = VEC_alloc (lst_p, heap, 5);
+
+ for (i = 0; VEC_iterate (lst_p, LST_SEQ (root), i, l); i++)
+ if (l != lst)
+ VEC_safe_push (lst_p, heap, seq, lst_substitute_3 (l, lst, a, b, c));
+ else
+ {
+ if (!lst_empty_p (a))
+ VEC_safe_push (lst_p, heap, seq, copy_lst (a));
+ if (!lst_empty_p (b))
+ VEC_safe_push (lst_p, heap, seq, copy_lst (b));
+ if (!lst_empty_p (c))
+ VEC_safe_push (lst_p, heap, seq, copy_lst (c));
+ }
+
+ return new_lst_loop (seq);
+}
+
/* Moves LST before LOOP if BEFORE is true, and after the LOOP if
BEFORE is false. */
/* A hashtable of the data dependence relations for the original
scattering. */
htab_t original_pddrs;
+
+ /* True when the scop has been converted to its polyhedral
+ representation. */
+ bool poly_scop_p;
};
#define SCOP_BBS(S) (S->bbs)
#define SCOP_ORIGINAL_SCHEDULE(S) (S->original_schedule)
#define SCOP_TRANSFORMED_SCHEDULE(S) (S->transformed_schedule)
#define SCOP_SAVED_SCHEDULE(S) (S->saved_schedule)
+#define POLY_SCOP_P(S) (S->poly_scop_p)
extern scop_p new_scop (void *);
extern void free_scop (scop_p);
extern void free_scops (VEC (scop_p, heap) *);
extern void print_generated_program (FILE *, scop_p);
extern void debug_generated_program (scop_p);
-extern void print_scattering_function (FILE *, poly_bb_p);
-extern void print_scattering_functions (FILE *, scop_p);
-extern void debug_scattering_function (poly_bb_p);
-extern void debug_scattering_functions (scop_p);
+extern void print_scattering_function (FILE *, poly_bb_p, int);
+extern void print_scattering_functions (FILE *, scop_p, int);
+extern void debug_scattering_function (poly_bb_p, int);
+extern void debug_scattering_functions (scop_p, int);
extern int scop_max_loop_depth (scop_p);
extern int unify_scattering_dimensions (scop_p);
extern bool apply_poly_transforms (scop_p);
restore_lst_schedule (scop);
}
+/* For a given PBB, add to RES the scop context, the iteration domain,
+ the original scattering when ORIGINAL_P is true, otherwise add the
+ transformed scattering. */
+
+static inline void
+combine_context_id_scat (ppl_Pointset_Powerset_C_Polyhedron_t *res,
+ poly_bb_p pbb, bool original_p)
+{
+ ppl_Pointset_Powerset_C_Polyhedron_t context;
+ ppl_Pointset_Powerset_C_Polyhedron_t id;
+
+ ppl_new_Pointset_Powerset_C_Polyhedron_from_C_Polyhedron
+ (res, original_p ?
+ PBB_ORIGINAL_SCATTERING (pbb) : PBB_TRANSFORMED_SCATTERING (pbb));
+
+ ppl_new_Pointset_Powerset_C_Polyhedron_from_Pointset_Powerset_C_Polyhedron
+ (&context, SCOP_CONTEXT (PBB_SCOP (pbb)));
+
+ ppl_new_Pointset_Powerset_C_Polyhedron_from_Pointset_Powerset_C_Polyhedron
+ (&id, PBB_DOMAIN (pbb));
+
+ /* Extend the context and the iteration domain to the dimension of
+ the scattering: T|I|G. */
+ {
+ ppl_dimension_type gdim, tdim, idim;
+
+ ppl_Pointset_Powerset_C_Polyhedron_space_dimension (*res, &tdim);
+ ppl_Pointset_Powerset_C_Polyhedron_space_dimension (context, &gdim);
+ ppl_Pointset_Powerset_C_Polyhedron_space_dimension (id, &idim);
+
+ if (tdim > gdim)
+ ppl_insert_dimensions_pointset (context, 0, tdim - gdim);
+
+ if (tdim > idim)
+ ppl_insert_dimensions_pointset (id, 0, tdim - idim);
+ }
+
+ /* Add the context and the iteration domain to the result. */
+ ppl_Pointset_Powerset_C_Polyhedron_intersection_assign (*res, context);
+ ppl_Pointset_Powerset_C_Polyhedron_intersection_assign (*res, id);
+
+ ppl_delete_Pointset_Powerset_C_Polyhedron (context);
+ ppl_delete_Pointset_Powerset_C_Polyhedron (id);
+}
+
#endif