* testsuite/lib/libstdc++.exp: Load target-supports-dg.exp.

[pf3gnuchains/gcc-fork.git] / gcc / tree-data-ref.h

diff --git a/gcc/tree-data-ref.h b/gcc/tree-data-ref.h
index bc069c1..ea3bb7d 100644 (file)
--- a/gcc/tree-data-ref.h
+++ b/gcc/tree-data-ref.h
@@ -22,11 +22,10 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA
 #ifndef GCC_TREE_DATA_REF_H
 #define GCC_TREE_DATA_REF_H
 
-struct data_reference GTY(())
+#include "lambda.h"
+
+struct data_reference
 {
-  /* An identifier.  */
-  unsigned int id;
-  
   /* A pointer to the statement that contains this DR.  */
   tree stmt;
   
@@ -47,7 +46,6 @@ struct data_reference GTY(())
 
 };
 
-#define DR_ID(DR) DR->id
 #define DR_STMT(DR) DR->stmt
 #define DR_REF(DR) DR->ref
 #define DR_BASE_NAME(DR) DR->base_name
@@ -74,46 +72,42 @@ enum data_dependence_direction {
    are stored in the data_dependence_relation structure under the form
    of an array of subscripts.  */
 
-struct subscript GTY(()) 
+struct subscript
 {
   /* A description of the iterations for which the elements are
      accessed twice.  */
   tree conflicting_iterations_in_a;
   tree conflicting_iterations_in_b;
   
-  /* These fields store the information about the iteration domain
+  /* This field stores the information about the iteration domain
      validity of the dependence relation.  */
-  tree last_conflict_in_a;
-  tree last_conflict_in_b;
+  tree last_conflict;
   
   /* Distance from the iteration that access a conflicting element in
      A to the iteration that access this same conflicting element in
-     B.  The distance is a tree scalar expression, ie. a constant or a
+     B.  The distance is a tree scalar expression, i.e. a constant or a
      symbolic expression, but certainly not a chrec function.  */
   tree distance;
-  
-  /* Direction (or sign) of the distance.  This more abstract (less
-     precise) information is extracted from the distance field, for
-     the convenience of some analyzers.  */
-  enum data_dependence_direction direction;
 };
 
 #define SUB_CONFLICTS_IN_A(SUB) SUB->conflicting_iterations_in_a
 #define SUB_CONFLICTS_IN_B(SUB) SUB->conflicting_iterations_in_b
-#define SUB_LAST_CONFLICT_IN_A(SUB) SUB->last_conflict_in_a
-#define SUB_LAST_CONFLICT_IN_B(SUB) SUB->last_conflict_in_b
+#define SUB_LAST_CONFLICT(SUB) SUB->last_conflict
 #define SUB_DISTANCE(SUB) SUB->distance
-#define SUB_DIRECTION(SUB) SUB->direction
 
 /* A data_dependence_relation represents a relation between two
    data_references A and B.  */
 
-struct data_dependence_relation GTY(())
+struct data_dependence_relation
 {
   
   struct data_reference *a;
   struct data_reference *b;
 
+  /* When the dependence relation is affine, it can be represented by
+     a distance vector.  */
+  bool affine_p;
+
   /* A "yes/no/maybe" field for the dependence relation:
      
      - when "ARE_DEPENDENT == NULL_TREE", there exist a dependence
@@ -131,29 +125,45 @@ struct data_dependence_relation GTY(())
      this array.  This is the attribute that labels the edge A->B of
      the data_dependence_relation.  */
   varray_type subscripts;
+
+  /* The size of the direction/distance vectors.  */
+  int size_vect;
+
+  /* The classic direction vector.  */
+  lambda_vector dir_vect;
+
+  /* The classic distance vector.  */
+  lambda_vector dist_vect;
 };
 
 #define DDR_A(DDR) DDR->a
 #define DDR_B(DDR) DDR->b
+#define DDR_AFFINE_P(DDR) DDR->affine_p
 #define DDR_ARE_DEPENDENT(DDR) DDR->are_dependent
 #define DDR_SUBSCRIPTS(DDR) DDR->subscripts
 #define DDR_SUBSCRIPTS_VECTOR_INIT(DDR, N) \
   VARRAY_GENERIC_PTR_INIT (DDR_SUBSCRIPTS (DDR), N, "subscripts_vector");
 #define DDR_SUBSCRIPT(DDR, I) VARRAY_GENERIC_PTR (DDR_SUBSCRIPTS (DDR), I)
 #define DDR_NUM_SUBSCRIPTS(DDR) VARRAY_ACTIVE_SIZE (DDR_SUBSCRIPTS (DDR))
+#define DDR_SIZE_VECT(DDR) DDR->size_vect
+#define DDR_DIR_VECT(DDR) DDR->dir_vect
+#define DDR_DIST_VECT(DDR) DDR->dist_vect
 
 \f
 
-struct data_dependence_relation *initialize_data_dependence_relation 
+extern tree find_data_references_in_loop (struct loop *, varray_type *);
+extern struct data_dependence_relation *initialize_data_dependence_relation 
 (struct data_reference *, struct data_reference *);
-void compute_affine_dependence (struct data_dependence_relation *);
+extern void compute_affine_dependence (struct data_dependence_relation *);
 extern void analyze_all_data_dependences (struct loops *);
 extern void compute_data_dependences_for_loop (unsigned, struct loop *, 
-                                              varray_type *, varray_type *, 
                                               varray_type *, varray_type *);
 extern struct data_reference * init_data_ref (tree, tree, tree, tree, bool);
 extern struct data_reference *analyze_array (tree, tree, bool);
 
+extern void dump_subscript (FILE *, struct subscript *);
+extern void dump_ddrs (FILE *, varray_type);
+extern void dump_dist_dir_vectors (FILE *, varray_type);
 extern void dump_data_reference (FILE *, struct data_reference *);
 extern void dump_data_references (FILE *, varray_type);
 extern void dump_data_dependence_relation (FILE *, 
@@ -162,7 +172,11 @@ extern void dump_data_dependence_relations (FILE *, varray_type);
 extern void dump_data_dependence_direction (FILE *, 
                                            enum data_dependence_direction);
 extern bool array_base_name_differ_p (struct data_reference *, 
-                                     struct data_reference *, bool *p);
+                                     struct data_reference *, bool *);
+extern void free_dependence_relation (struct data_dependence_relation *);
+extern void free_dependence_relations (varray_type);
+extern void free_data_refs (varray_type);
+
 
 \f