78   Node* NewOsrPhi(Node* loop, Node* incoming, int osr_value, Node* back1 = NULL,  in NewOsrPhi()  argument
84     CHECK_EQ(loop->InputCount(), count);  in NewOsrPhi()
85     CHECK_EQ(osr_loop_entry, loop->InputAt(1));  in NewOsrPhi()
93     inputs[count] = loop;  in NewOsrPhi()
100     Node* loop = graph.NewNode(common.Loop(1), entry);  in NewLoop()  local
102       loop->AppendInput(graph.zone(), osr_loop_entry);  in NewLoop()
105       loop->AppendInput(graph.zone(), loop);  in NewLoop()
107     NodeProperties::ChangeOp(loop, common.Loop(loop->InputCount()));  in NewLoop()
108     return loop;  in NewLoop()
136   Node* loop = T.NewOsrLoop(1);  in TEST()  local
138   T.graph.SetEnd(loop);  in TEST()
142   CheckInputs(loop, T.start, loop);  in TEST()
149   Node* loop = T.NewOsrLoop(1);  in TEST()  local
151       T.NewOsrPhi(loop, T.jsgraph.OneConstant(), 0, T.jsgraph.ZeroConstant());  in TEST()
153   Node* ret = T.graph.NewNode(T.common.Return(), osr_phi, T.start, loop);  in TEST()
158   CheckInputs(loop, T.start, loop);  in TEST()
159   CheckInputs(osr_phi, T.osr_values[0], T.jsgraph.ZeroConstant(), loop);  in TEST()
160   CheckInputs(ret, osr_phi, T.start, loop);  in TEST()
169   Node* loop = T.NewOsrLoop(1, d.merge);  in TEST()  local
171       T.NewOsrPhi(loop, T.jsgraph.OneConstant(), 0, T.jsgraph.ZeroConstant());  in TEST()
173   Node* ret = T.graph.NewNode(T.common.Return(), osr_phi, T.start, loop);  in TEST()
178   CheckInputs(loop, T.start, loop);  in TEST()
179   CheckInputs(osr_phi, T.osr_values[0], T.jsgraph.ZeroConstant(), loop);  in TEST()
180   CheckInputs(ret, osr_phi, T.start, loop);  in TEST()
194   Node* loop = T.NewOsrLoop(1);  in TEST()  local
196   Node* branch = T.graph.NewNode(T.common.Branch(), T.p0, loop);  in TEST()
199   loop->ReplaceInput(2, if_true);  in TEST()
202       T.NewOsrPhi(loop, T.jsgraph.OneConstant(), 0, T.jsgraph.ZeroConstant());  in TEST()
209   CheckInputs(loop, T.start, if_true);  in TEST()
210   CheckInputs(branch, T.p0, loop);  in TEST()
213   CheckInputs(osr_phi, T.osr_values[0], T.jsgraph.ZeroConstant(), loop);  in TEST()
221   Node* loop = T.NewOsrLoop(1);  in TEST()  local
224   Node* branch1 = T.graph.NewNode(T.common.Branch(), T.p0, loop);  in TEST()
231   loop->ReplaceInput(2, if_true2);  in TEST()
234       T.NewOsrPhi(loop, T.jsgraph.OneConstant(), 0, T.jsgraph.ZeroConstant());  in TEST()
242   CheckInputs(loop, T.start, if_true2);  in TEST()
243   CheckInputs(branch1, T.p0, loop);  in TEST()
250   CheckInputs(osr_phi, T.osr_values[0], T.jsgraph.ZeroConstant(), loop);  in TEST()
259   Node* loop = T.NewOsrLoop(2);  in TEST()  local
262   Node* branch1 = T.graph.NewNode(T.common.Branch(), T.p0, loop);  in TEST()
269   loop->ReplaceInput(2, if_false1);  in TEST()
270   loop->ReplaceInput(3, if_true2);  in TEST()
273       T.NewOsrPhi(loop, T.jsgraph.OneConstant(), 0, T.jsgraph.ZeroConstant(),  in TEST()
281   CheckInputs(loop, T.start, if_false1, if_true2);  in TEST()
282   CheckInputs(branch1, T.p0, loop);  in TEST()
290               T.jsgraph.ZeroConstant(), loop);  in TEST()
300   Node* loop;  member
304     loop = t.NewLoop(is_osr, backedges);  in While()
305     branch = t.graph.NewNode(t.common.Branch(), cond, loop);  in While()
308     loop->ReplaceInput(loop->InputCount() - 1, if_true);  in While()
312     that.loop->ReplaceInput(that.loop->InputCount() - 1, exit);  in Nest()
313     this->loop->ReplaceInput(0, that.if_true);  in Nest()
317     if (loop->InputCount() == 2) {  in Phi()
319                              i1, i2, loop);  in Phi()
322                              i1, i2, i3, loop);  in Phi()
361   CheckInputs(inner.loop, T.start, inner.if_true);  in TEST()
362   CheckInputs(osr_phi, T.osr_values[0], T.jsgraph.FalseConstant(), inner.loop);  in TEST()
367   CHECK_NE(new_outer_loop, outer.loop);  in TEST()
416   outer.loop->ReplaceInput(1, x_true);  in TEST()
417   outer.loop->ReplaceInput(2, x_false);  in TEST()
428   CheckInputs(inner.loop, T.start, inner.if_true);  in TEST()
429   CheckInputs(osr_phi, T.osr_values[0], T.jsgraph.FalseConstant(), inner.loop);  in TEST()
438   CHECK_NE(new_outer_loop, outer.loop);  in TEST()
470 Node* MakeCounter(JSGraph* jsgraph, Node* start, Node* loop) {  in MakeCounter()  argument
471   int count = loop->InputCount();  in MakeCounter()
476   tmp_inputs.push_back(loop);  in MakeCounter()
495   Node* loop0_cntr = MakeCounter(&T.jsgraph, T.p0, loop0.loop);  in TEST()
506   loop2.loop->ReplaceInput(0, loop1);  in TEST()
508   Node* loop2_cntr = MakeCounter(&T.jsgraph, loop1_phi, loop2.loop);  in TEST()
522   loop0.loop->ReplaceInput(1, if_true);  in TEST()
535   CheckInputs(loop2.loop, T.start, loop2.if_true);  in TEST()
536   CheckInputs(osr_phi, T.osr_values[0], loop2_inc, loop2.loop);  in TEST()
537   CheckInputs(loop2.branch, osr_phi, loop2.loop);  in TEST()