return PDR_TYPE (pdr) == PDR_MAY_WRITE;
}
+/* Return true when PDR1 and PDR2 are similar data accesses: they have
+ the same base array, and the same access functions. */
+
+static inline bool
+same_pdr_p (poly_dr_p pdr1, poly_dr_p pdr2)
+{
+ return PDR_TYPE (pdr1) == PDR_TYPE (pdr2)
+ && PDR_NB_SUBSCRIPTS (pdr1) == PDR_NB_SUBSCRIPTS (pdr2)
+ && PDR_BASE_OBJECT_SET (pdr1) == PDR_BASE_OBJECT_SET (pdr2);
+}
+
typedef struct poly_scattering *poly_scattering_p;
struct poly_scattering
/* True when the PDR duplicates have already been removed. */
bool pdr_duplicates_removed;
+
+ /* True when this PBB contains only a reduction statement. */
+ bool is_reduction;
};
#define PBB_BLACK_BOX(PBB) ((gimple_bb_p) PBB->black_box)
#define PBB_NB_LOCAL_VARIABLES(PBB) (PBB->transformed->nb_local_variables)
#define PBB_NB_SCATTERING_TRANSFORM(PBB) (PBB->transformed->nb_scattering)
#define PBB_PDR_DUPLICATES_REMOVED(PBB) (PBB->pdr_duplicates_removed)
+#define PBB_IS_REDUCTION(PBB) (PBB->is_reduction)
-extern void new_poly_bb (scop_p, void *);
+extern void new_poly_bb (scop_p, void *, bool);
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 pbb_number_of_iterations_at_time (poly_bb_p, graphite_dim_t, Value);
extern void pbb_remove_duplicate_pdrs (poly_bb_p);
+/* Return the number of write data references in PBB. */
+
+static inline int
+number_of_write_pdrs (poly_bb_p pbb)
+{
+ int res = 0;
+ int i;
+ poly_dr_p pdr;
+
+ for (i = 0; VEC_iterate (poly_dr_p, PBB_DRS (pbb), i, pdr); i++)
+ if (PDR_TYPE (pdr) == PDR_WRITE)
+ res++;
+
+ return res;
+}
+
/* The index of the PBB. */
static inline int
PBB_NB_SCATTERING_TRANSFORM (pbb) += 1;
}
+typedef struct lst *lst_p;
+DEF_VEC_P(lst_p);
+DEF_VEC_ALLOC_P (lst_p, heap);
+
+/* Loops and Statements Tree. */
+struct lst {
+
+ /* LOOP_P is true when an LST node is a loop. */
+ bool loop_p;
+
+ /* A pointer to the loop that contains this node. */
+ lst_p loop_father;
+
+ /* Loop nodes contain a sequence SEQ of LST nodes, statements
+ contain a pointer to their polyhedral representation PBB. */
+ union {
+ poly_bb_p pbb;
+ VEC (lst_p, heap) *seq;
+ } node;
+};
+
+#define LST_LOOP_P(LST) ((LST)->loop_p)
+#define LST_LOOP_FATHER(LST) ((LST)->loop_father)
+#define LST_PBB(LST) ((LST)->node.pbb)
+#define LST_SEQ(LST) ((LST)->node.seq)
+
+void scop_to_lst (scop_p);
+void print_lst (FILE *, lst_p, int);
+void debug_lst (lst_p);
+void dot_lst (lst_p);
+
+/* Creates a new LST loop with SEQ. */
+
+static inline lst_p
+new_lst_loop (VEC (lst_p, heap) *seq)
+{
+ lst_p lst = XNEW (struct lst);
+ int i;
+ lst_p l;
+
+ LST_LOOP_P (lst) = true;
+ LST_SEQ (lst) = seq;
+ LST_LOOP_FATHER (lst) = NULL;
+
+ for (i = 0; VEC_iterate (lst_p, seq, i, l); i++)
+ LST_LOOP_FATHER (l) = lst;
+
+ return lst;
+}
+
+/* Creates a new LST statement with PBB. */
+
+static inline lst_p
+new_lst_stmt (poly_bb_p pbb)
+{
+ lst_p lst = XNEW (struct lst);
+
+ LST_LOOP_P (lst) = false;
+ LST_PBB (lst) = pbb;
+ LST_LOOP_FATHER (lst) = NULL;
+ return lst;
+}
+
+/* Returns a copy of LST. */
+
+static inline lst_p
+copy_lst (lst_p lst)
+{
+ if (!lst)
+ return NULL;
+
+ if (LST_LOOP_P (lst))
+ {
+ int i;
+ lst_p l;
+ VEC (lst_p, heap) *seq = VEC_alloc (lst_p, heap, 5);
+
+ for (i = 0; VEC_iterate (lst_p, LST_SEQ (lst), i, l); i++)
+ VEC_safe_push (lst_p, heap, seq, copy_lst (l));
+
+ return new_lst_loop (seq);
+ }
+
+ return new_lst_stmt (LST_PBB (lst));
+}
+
+/* Returns the loop depth of LST. */
+
+static inline int
+lst_depth (lst_p lst)
+{
+ if (!lst)
+ return -1;
+
+ return lst_depth (LST_LOOP_FATHER (lst)) + 1;
+}
+
+/* Returns the Dewey number for LST. */
+
+static inline int
+lst_dewey_number (lst_p lst)
+{
+ int i;
+ lst_p l;
+
+ if (!lst)
+ return -1;
+
+ if (!LST_LOOP_FATHER (lst))
+ return 0;
+
+ for (i = 0; VEC_iterate (lst_p, LST_SEQ (LST_LOOP_FATHER (lst)), i, l); i++)
+ if (l == lst)
+ return i;
+
+ return -1;
+}
+
+/* Return the LST node corresponding to PBB. */
+
+static inline lst_p
+lst_find_pbb (lst_p lst, poly_bb_p pbb)
+{
+ int i;
+ lst_p l;
+
+ if (!lst)
+ return NULL;
+
+ if (LST_LOOP_P (lst))
+ for (i = 0; VEC_iterate (lst_p, LST_SEQ (lst), i, l); i++)
+ {
+ lst_p res = lst_find_pbb (l, pbb);
+ if (res)
+ return res;
+ }
+ else if (pbb == LST_PBB (lst))
+ return lst;
+
+ return NULL;
+}
+
+/* Return the LST node corresponding to the loop around STMT at depth
+ LOOP_DEPTH. */
+
+static inline lst_p
+find_lst_loop (lst_p stmt, int loop_depth)
+{
+ lst_p loop = LST_LOOP_FATHER (stmt);
+
+ gcc_assert (loop_depth >= 0);
+
+ while (loop_depth < lst_depth (loop))
+ loop = LST_LOOP_FATHER (loop);
+
+ return loop;
+}
+
+
/* A SCOP is a Static Control Part of the program, simple enough to be
represented in polyhedral form. */
struct scop
representation. */
VEC (poly_bb_p, heap) *bbs;
- /* Data dependence graph for this SCoP. */
- struct graph *dep_graph;
+ /* Original and transformed schedules. */
+ lst_p original_schedule, transformed_schedule;
/* The context describes known restrictions concerning the parameters
and relations in between the parameters.
#define SCOP_BBS(S) (S->bbs)
#define SCOP_REGION(S) ((sese) S->region)
-#define SCOP_DEP_GRAPH(S) (S->dep_graph)
#define SCOP_CONTEXT(S) (S->context)
#define SCOP_ORIGINAL_PDDRS(S) (S->original_pddrs)
+#define SCOP_ORIGINAL_SCHEDULE(S) (S->original_schedule)
+#define SCOP_TRANSFORMED_SCHEDULE(S) (S->transformed_schedule)
extern scop_p new_scop (void *);
extern void free_scop (scop_p);
OSDN Git Service
