Lines Matching refs:at
99 // all possible gain (a "do not align at all" heuristic has a
412 // at the beginning when idx == 0.
456 // i.e., it splits at the source (via an IF or SWITCH) and merges
457 // at the destination (via a many-input Region).
473 // Check if it the fist node pushed on stack at the beginning.
559 // Check for NeverBranch at block end. This needs to become a GOTO to the
674 // Check for NeverBranch at block end. This needs to become a GOTO to the
919 // Uses must follow their definition if they are at the same block.
976 // Force the Union-Find mapping to be at least this large
1034 CFGEdge *e = edges->at(i);
1036 edges->at(i)->dump();
1111 // The trace of connector blocks goes at the end;
1143 // All connector blocks should be at the end of the list
1189 assert(b->is_connector(), "connector blocks at the end");
1231 CFGEdge *e = edges->at(i);
1249 // If the edge in question can join two traces at their ends,
1273 // Walk the edge list a another time, looking at unprocessed edges.
1276 CFGEdge *e = edges->at(i);
1317 // then make a policy on merging this trace at the fork or join.
1319 // trace at the join point if the "src" trace ends in a two-way, but
1334 // But leave root entry at the beginning of the block list.
1346 // jumps at the end of each block.
1408 // Grow traces at their ends via most frequent edges.
1411 // Merge one trace into another, but only at fall-through points.
1435 assert(last_block() == src_block, "loop discovery at back branch");