+2009-01-31 Richard Guenther <rguenther@suse.de>
+
+ PR tree-optimization/38937
+ * tree-ssa-structalias.c (do_sd_constraint): Do not shortcut
+ computing the transitive closure.
+
2009-01-30 Richard Guenther <rguenther@suse.de>
PR tree-optimization/39041
unsigned int j;
bitmap_iterator bi;
- if (bitmap_bit_p (delta, anything_id))
- {
- flag |= bitmap_set_bit (sol, anything_id);
- goto done;
- }
-
/* For x = *ESCAPED and x = *CALLUSED we want to compute the
reachability set of the rhs var. As a pointer to a sub-field
of a variable can also reach all other fields of the variable
}
}
+ if (bitmap_bit_p (delta, anything_id))
+ {
+ flag |= bitmap_set_bit (sol, anything_id);
+ goto done;
+ }
+
/* For each variable j in delta (Sol(y)), add
an edge in the graph from j to x, and union Sol(j) into Sol(x). */
EXECUTE_IF_SET_IN_BITMAP (delta, 0, j, bi)