relaxed checking for compound graph paht: the path

can now also be built backwards.

[r5013]

diff --git a/ir/tr/entity.c b/ir/tr/entity.c
index a46ac02..51fd0e6 100644 (file)
--- a/ir/tr/entity.c
+++ b/ir/tr/entity.c
@@ -615,6 +615,9 @@ int is_proper_compound_graph_path(compound_graph_path *gr, int pos) {
   type *owner = gr->tp;
   for (i = 0; i <= pos; i++) {
     node = get_compound_graph_path_node(gr, i);
+    if (node == NULL)
+      /* Path not yet complete. */
+      return true;
     if (get_entity_owner(node) != owner) return false;
     owner = get_entity_type(node);
   }

diff --git a/ir/tr/entity.h b/ir/tr/entity.h
index b6910ee..e078614 100644 (file)
--- a/ir/tr/entity.h
+++ b/ir/tr/entity.h
@@ -376,6 +376,10 @@ void    set_compound_graph_path_node(compound_graph_path *gr, int pos, entity *n
 int     get_compound_graph_path_array_index(compound_graph_path *gr, int pos);
 void    set_compound_graph_path_array_index(compound_graph_path *gr, int pos, int index);
 
+/** Checks wether the path up to pos is correct. If the path contains a NULL,
+ *  assumes the path is not complete and returns 'true'. */
+int is_proper_compound_graph_path(compound_graph_path *gr, int pos);
+
 /* A value of a compound entity is a pair of a value and the description of the
    corresponding access path to the member of the compound.  */
 void     add_compound_ent_value_w_path(entity *ent, ir_node *val, compound_graph_path *path);