Add a new driver to data reference analysis.

2009-07-30  Sebastian Pop  <sebastian.pop@amd.com>

	* tree-data-ref.c (graphite_find_data_references_in_stmt): New.
	* tree-data-ref.h (graphite_find_data_references_in_stmt): Declared.

From-SVN: r150297

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 23613f6f9d58e7e18131ab2a8e93088449fcba48..c15abd70b0c5e03fdd0b34d5a99ddb16e2fb4570 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,8 @@
+2009-07-30  Sebastian Pop  <sebastian.pop@amd.com>
+
+       * tree-data-ref.c (graphite_find_data_references_in_stmt): New.
+       * tree-data-ref.h (graphite_find_data_references_in_stmt): Declared.
+
 2009-07-30  Sebastian Pop  <sebastian.pop@amd.com>
 
        * tree-data-ref.c (debug_data_references): New.

diff --git a/gcc/tree-data-ref.c b/gcc/tree-data-ref.c
index 2e515bfe0f69ad2749f5c05b70adaddd54f574c1..ae0a06814792407228567727570dca391bf2da59 100644 (file)
--- a/gcc/tree-data-ref.c
+++ b/gcc/tree-data-ref.c
@@ -4158,6 +4158,37 @@ find_data_references_in_stmt (struct loop *nest, gimple stmt,
   return ret;
 }
 
+/* Stores the data references in STMT to DATAREFS.  If there is an unanalyzable
+   reference, returns false, otherwise returns true.  NEST is the outermost
+   loop of the loop nest in which the references should be analyzed.  */
+
+bool
+graphite_find_data_references_in_stmt (struct loop *nest, gimple stmt,
+                                      VEC (data_reference_p, heap) **datarefs)
+{
+  unsigned i;
+  VEC (data_ref_loc, heap) *references;
+  data_ref_loc *ref;
+  bool ret = true;
+  data_reference_p dr;
+
+  if (get_references_in_stmt (stmt, &references))
+    {
+      VEC_free (data_ref_loc, heap, references);
+      return false;
+    }
+
+  for (i = 0; VEC_iterate (data_ref_loc, references, i, ref); i++)
+    {
+      dr = create_data_ref (nest, *ref->pos, stmt, ref->is_read);
+      gcc_assert (dr != NULL);
+      VEC_safe_push (data_reference_p, heap, *datarefs, dr);
+    }
+
+  VEC_free (data_ref_loc, heap, references);
+  return ret;
+}
+
 /* Search the data references in LOOP, and record the information into
    DATAREFS.  Returns chrec_dont_know when failing to analyze a
    difficult case, returns NULL_TREE otherwise.  */

diff --git a/gcc/tree-data-ref.h b/gcc/tree-data-ref.h
index ce604e3bbb79b2d0df70d145b54346bbdbc38d7e..fe79faea40f78ef612166db70d9b69950a0b750a 100644 (file)
--- a/gcc/tree-data-ref.h
+++ b/gcc/tree-data-ref.h
@@ -405,6 +405,8 @@ extern void free_data_ref (data_reference_p);
 extern void free_data_refs (VEC (data_reference_p, heap) *);
 extern bool find_data_references_in_stmt (struct loop *, gimple,
                                          VEC (data_reference_p, heap) **);
+extern bool graphite_find_data_references_in_stmt (struct loop *, gimple,
+                                                  VEC (data_reference_p, heap) **);
 struct data_reference *create_data_ref (struct loop *, tree, gimple, bool);
 extern bool find_loop_nest (struct loop *, VEC (loop_p, heap) **);
 extern void compute_all_dependences (VEC (data_reference_p, heap) *,