Home | History | Annotate | Download | only in compiler

Lines Matching defs:if_true

189   Node* if_true;
196 if_true = t.graph.NewNode(t.common.IfTrue(), branch);
198 loop->ReplaceInput(1, if_true);
204 this->loop->ReplaceInput(0, that.if_true);
261 Node* body[] = {w.branch, w.if_true};
278 Node* body[] = {w.branch, w.if_true};
294 Node* body[] = {w.branch, w.if_true, c.add};
310 Node* body[] = {w.branch, w.if_true, c.store};
327 Node* body[] = {w.branch, w.if_true, c1.add, c2.add};
345 Node* body[] = {w1.branch, w1.if_true};
354 Node* body[] = {w2.branch, w2.if_true};
375 Node* body[] = {w1.branch, w1.if_true, c1.add};
384 Node* body[] = {w2.branch, w2.if_true, c2.add};
410 Node* body[] = {w1.branch, w1.if_true, c1.add};
419 Node* body[] = {w2.branch, w2.if_true, c2.add};
438 Node* b1[] = {w1.branch, w1.if_true, w2.loop, w2.branch, w2.if_true, w2.exit};
442 Node* b2[] = {w2.branch, w2.if_true};
462 Node* b1[] = {w1.branch, w1.if_true, w2.loop, w2.branch, w2.if_true,
467 Node* b2[] = {w2.branch, w2.if_true, c2.add};
497 Node* b1[] = {w1.branch, w1.if_true, w2.loop, p2a,
498 p2b, w2.branch, w2.if_true, w2.exit};
502 Node* b2[] = {w2.branch, w2.if_true};
525 Node* b1[] = {w1.branch, w1.if_true, w2.loop, w2.branch, w2.if_true,
526 w2.exit, w3.loop, w3.branch, w3.if_true, w3.exit};
530 Node* b2[] = {w2.branch, w2.if_true};
534 Node* b3[] = {w3.branch, w3.if_true};
545 w2.loop->ReplaceInput(0, w1.if_true);
546 w3.loop->ReplaceInput(0, w2.if_true);
555 Node* b1[] = {w1.branch, w1.if_true, w2.loop, w2.branch, w2.if_true,
556 w2.exit, w3.loop, w3.branch, w3.if_true, w3.exit};
560 Node* b2[] = {w2.branch, w2.if_true, w3.loop, w3.branch, w3.if_true, w3.exit};
564 Node* b3[] = {w3.branch, w3.if_true};
578 w2.loop->ReplaceInput(0, w1.if_true);
579 w3.loop->ReplaceInput(0, w2.if_true);
591 Node* b1[] = {w1.branch, w1.if_true, c1.add, c2.add, c2.add,
592 c2.phi, c3.phi, w2.loop, w2.branch, w2.if_true,
593 w2.exit, w3.loop, w3.branch, w3.if_true, w3.exit};
597 Node* b2[] = {w2.branch, w2.if_true, c2.add, c3.add, c3.phi,
598 w3.loop, w3.branch, w3.if_true, w3.exit};
602 Node* b3[] = {w3.branch, w3.if_true, c3.add};
624 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch);
626 last = if_true;
629 body[body_count++] = if_true;
661 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch);
666 body[body_count++] = if_true;
669 loop->ReplaceInput(1 + b, if_true);
696 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch);
698 loop->ReplaceInput(1, if_true);
708 Node* body[] = {cond, branch, if_true};
934 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch);
936 loop->ReplaceInput(1, if_true);
941 nodes[i * 4 + 3] = if_true;
970 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch);
977 nodes[i * 5 + 4] = if_true; // body
988 entry = if_true;