Lines Matching defs:later
8 Software Foundation; either version 3, or (at your option) any later
202 /* later(p,s) is dependent on the calculation of laterin(p).
203 laterin(p) is dependent on the calculation of later(p2,p).
206 later(ENTRY, succs(ENTRY)) are defined using laterin(ENTRY)
207 laterin(succs(ENTRY)) is defined by later(ENTRY, succs(ENTRY)).
210 in the work list, anytime we change later(bb), we need to add
220 We optimistically initialize LATER. That is the only time this routine
221 will compute LATER for an edge out of the entry block since the entry
233 sbitmap *antloc, sbitmap *later, sbitmap *laterin)
253 /* We want a maximal solution, so initially consider LATER true for
255 loop edge will have LATER set, so if all the other incoming edges
259 If the optimistic setting of LATER on that edge was incorrect (for
263 bitmap_vector_ones (later, num_edges);
265 /* Note that even though we want an optimistic setting of LATER, we
267 the entry block. That edge should always have a LATER value the
270 bitmap_copy (later[(size_t) e->aux], earliest[(size_t) e->aux]);
273 the loop given our optimistic initialization of LATER above. */
306 later[(size_t)e->aux]);
308 /* Calculate LATER for all outgoing edges. */
310 if (bitmap_ior_and_compl (later[(size_t) e->aux],
314 /* If LATER for an outgoing edge was changed, then we need
333 later[(size_t) e->aux]);
343 sbitmap *later, sbitmap *laterin, sbitmap *insert,
358 bitmap_and_compl (insert[x], later[x],
361 bitmap_and_compl (insert[x], later[x], laterin[b->index]);
376 sbitmap *later, *laterin;
430 later = sbitmap_vector_alloc (num_edges, n_exprs);
435 compute_laterin (edge_list, earliest, antloc, later, laterin);
442 dump_bitmap_vector (dump_file, "later", "", later, num_edges);
452 compute_insert_delete (edge_list, antloc, later, laterin, *insert, *del);
455 sbitmap_vector_free (later);
Indexes created Thu Apr 02 00:23:07 UTC 2026