Home | History | Annotate | Download | only in gcc

Lines Matching refs:laterin

202 /* later(p,s) is dependent on the calculation of laterin(p).
203    laterin(p) is dependent on the calculation of later(p2,p).
205      laterin(ENTRY) is defined as all 0's
206      later(ENTRY, succs(ENTRY)) are defined using laterin(ENTRY)
207      laterin(succs(ENTRY)) is defined by later(ENTRY, succs(ENTRY)).
222      block is never on the worklist.  Thus, LATERIN is neither used nor
226      use nor compute LATERIN for the exit block.  Edges which reach the
228      the insertion/deletion computation needs LATERIN(EXIT), so we have
233 		 sbitmap *antloc, sbitmap *later, sbitmap *laterin)
256      to the loop are set, then LATERIN will be set for the head of the
302       /* Compute the intersection of LATERIN for each incoming edge to B.  */
303       bitmap_ones (laterin[bb->index]);
305 	bitmap_and (laterin[bb->index], laterin[bb->index],
312 				  laterin[bb->index],
326   /* Computation of insertion and deletion points requires computing LATERIN
327      for the EXIT block.  We allocated an extra entry in the LATERIN array
329   bitmap_ones (laterin[last_basic_block_for_fn (cfun)]);
331     bitmap_and (laterin[last_basic_block_for_fn (cfun)],
332 		laterin[last_basic_block_for_fn (cfun)],
343 		       sbitmap *later, sbitmap *laterin, sbitmap *insert,
351 			laterin[bb->index]);
359 			  laterin[last_basic_block_for_fn (cfun)]);
361 	bitmap_and_compl (insert[x], later[x], laterin[b->index]);
376   sbitmap *later, *laterin;
432   /* Allocate an extra element for the exit block in the laterin vector.  */
433   laterin = sbitmap_vector_alloc (last_basic_block_for_fn (cfun) + 1,
435   compute_laterin (edge_list, earliest, antloc, later, laterin);
440       dump_bitmap_vector (dump_file, "laterin", "", laterin,
452   compute_insert_delete (edge_list, antloc, later, laterin, *insert, *del);
454   sbitmap_vector_free (laterin);