contrib/gcc/lcm.c

178 /* Compute the earliest vector for edge based lcm.  */
183 		  sbitmap *earliest)
199 	sbitmap_copy (earliest[x], antin[succ->index]);
203 	    sbitmap_zero (earliest[x]);
209 	      sbitmap_a_and_b_or_c (earliest[x], difference,
249 compute_laterin (struct edge_list *edge_list, sbitmap *earliest,
287     sbitmap_copy (later[(size_t) e->aux], earliest[(size_t) e->aux]);
322 				      earliest[(size_t) e->aux],
384   sbitmap *antin, *antout, *earliest;
426   earliest = sbitmap_vector_alloc (num_edges, n_exprs);
427   compute_earliest (edge_list, n_exprs, antin, antout, avout, kill, earliest);
431     dump_sbitmap_vector (dump_file, "earliest", "", earliest, num_edges);
442   compute_laterin (edge_list, earliest, antloc, later, laterin);
452   sbitmap_vector_free (earliest);