Lines Matching defs:loop
490 // This is a degenerated loop.
495 // Only the first entry into the looploop. All other
514 // Only loop header blocks can have a predecessor added after
578 // loop. Exploit the fact that blocks are sorted in reverse post order. When
579 // the loop is visited in increasing block id order, if the number of
580 // non-loop-exiting successor edges at the dominator_candidate block doesn't
582 // path from the loop header to any block with higher id that doesn't go
601 // If more successors than predecessors have been seen in the loop up to
604 // that those paths through loop that don't go through the current block
605 // contain all of the loop's dependencies. Also be careful to record
606 // dominator information about the current loop that's being processed,
618 // Only count successors that remain inside the loop and don't loop back
619 // to a loop header.
622 // Backwards edges must land on loop headers.
2234 LoopBuilder loop(this, context(), LoopBuilder::kPostIncrement);
2235 HValue* index = loop.BeginBody(graph()->GetConstant0(), length, Token::LT);
2243 loop.EndBody();
2814 // Special loop unfolding case
2833 // Carefully loop backwards so that the "from" remains live through the loop
2924 // Unroll the loop for small elements kinds.
3036 LoopBuilder loop(this);
3037 loop.BeginBody(2); // Drop script_context and depth from last environment
3053 loop.Break();
3060 loop.EndBody();
3065 // Unroll the above loop.
3185 // Build a new loop header block and set it as the current block.
3279 // if (block has already been visited or is of another loop) return;
3281 // if (block is a loop header) {
3291 // foreach (block b in block loop members) {
3293 // if (b is loop header) VisitLoopMembers(b);
3312 // recursion, and particularly keeps the state of the loop (iteration) of the
3324 HLoopInformation* loop() { return loop_; }
3392 HLoopInformation* loop,
3396 loop_ = loop;
3404 HLoopInformation* loop,
3408 loop_ = loop;
3530 // The following two methods implement a "foreach b in loop members" cycle.
3599 // Only the first predecessor of a loop header is from outside the loop.
3600 // All others are back edges, and thus cannot dominate the loop header.
4642 // 2. Loop over the clauses and the linked list of tests in lockstep,
4934 // Reload the values to ensure we have up-to-date values inside of the loop.
4974 // over the loop body in case of undefined result from %ForInFilter,
8811 LoopBuilder loop(this, context(), LoopBuilder::kPostIncrement);
8813 HValue* new_key = loop.BeginBody(
8826 loop.EndBody();
9268 LoopBuilder loop(this, context(), direction);
9270 HValue* index = loop.BeginBody(initial, terminating, token);
9280 loop.Break();
9284 loop.EndBody();
9290 LoopBuilder loop(this, context(), direction);
9292 HValue* index = loop.BeginBody(initial, terminating, token);
9303 loop.Break();
9307 loop.EndBody();
9320 LoopBuilder loop(this, context(), direction);
9322 HValue* index = loop.BeginBody(initial, terminating, token);
9342 loop.Break();
9348 loop.EndBody();
9352 LoopBuilder loop(this, context(), direction);
9354 HValue* index = loop.BeginBody(initial, terminating, token);
9364 loop.Break();
9368 loop.EndBody();
9599 // valid range for unrolled loop initialization.
12785 trace_.Add(" \"dom-loop-succ\"");
