contrib/gcc/tree-ssa-structalias.c

118   1. Each constraint variable x has a solution set associated with it,
138   6. The graph is then walked, and solution sets are
144   appropriate variables to the solution set.
146   8. The process of walking the graph is iterated until no solution
241   /* True if this is a special variable whose solution set should not be
255   bitmap solution;
381   ret->solution = BITMAP_ALLOC (&pta_obstack);
606        For each outgoing edge from n, propagate the solution from n to
702 /* Take a solution set SET, add OFFSET to each member of the set, and
755 /* Union solution sets TO and FROM, and add INC to each member of FROM in the
1078 	  bitmap_set_bit (get_varinfo (lhsvar)->solution, rhsvar);
1236   /* If the solution changes because of the merging, we need to mark
1238   if (bitmap_ior_into (get_varinfo (to)->solution,
1239 		       get_varinfo (from)->solution))
1248   BITMAP_FREE (get_varinfo (from)->solution);
1368 	  sol = get_varinfo (t)->solution;
1386    starting solution.  */
1394   bitmap sol = get_varinfo (lhs)->solution;
1424 	    flag |= bitmap_ior_into (sol, get_varinfo (t)->solution);
1426 	    flag |= bitmap_ior_into (sol, get_varinfo (t)->solution);
1434   /* If the LHS solution changed, mark the var as changed.  */
1437       get_varinfo (lhs)->solution = sol;
1453   bitmap sol = get_varinfo (rhs)->solution;
1472 	 if (!bitmap_bit_p (get_varinfo (t)->solution, anything_id))
1474 	     bitmap_set_bit (get_varinfo (t)->solution, anything_id);
1501 	  tmp = get_varinfo (t)->solution;
1505 	      get_varinfo (t)->solution = tmp;
1507 		sol = get_varinfo (rhs)->solution;
1548       bitmap solution;
1554       solution = get_varinfo (t)->solution;
1556       tmp = get_varinfo (t)->solution;
1558       flag = set_union_with_increment (tmp, solution, c->rhs.offset);
1562 	  get_varinfo (t)->solution = tmp;
1990       && !bitmap_empty_p (get_varinfo (node)->solution))
1998       /* We can't touch the solution set and call unify_nodes
2002       EXECUTE_IF_SET_IN_BITMAP (get_varinfo (node)->solution, 0, i, bi)
2045       if (find (i) == i && !bitmap_empty_p (ivi->solution)
2087 	      bitmap solution;
2094 	      /* Compute the changed set of solution bits.  */
2095 	      bitmap_and_compl (pts, get_varinfo (i)->solution,
2103 	      solution = get_varinfo (i)->solution;
2104 	      solution_empty = bitmap_empty_p (solution);
2110 		     solution to non-empty, given an empty solution,
2117 	      solution_empty = bitmap_empty_p (solution);
2123 		  /* Propagate solution to all successors.  */
2131 		      tmp = get_varinfo (to)->solution;
2142 			  get_varinfo (to)->solution = tmp;
3163 	 One solution would be to have count_uses_and_derefs consider
4232 /* Print out the points-to solution for VAR to FILE.  */
4249       EXECUTE_IF_SET_IN_BITMAP (vi->solution, 0, i, bi)
4257 /* Print the points-to solution for VAR to stdout.  */
4353 /* Structure used to put solution bitmaps in a hashtable so they can
4422 /* Set bits in INTO corresponding to the variable uids in solution set
4541 	  EXECUTE_IF_SET_IN_BITMAP (vi->solution, 0, i, bi)
4567 	  set_uids_in_ptset (vi->decl, finished_solution, vi->solution);