Lines Matching refs:NewNode
71 Node* effect = graph()->NewNode(common()->ValueEffect(1), value);
77 Node* heap_number = graph()->NewNode(
81 Node* store = graph()->NewNode(
84 return graph()->NewNode(common()->Finish(1), heap_number, store);
89 value = graph()->NewNode(machine()->WordSar(), value, SmiShiftBitsConstant());
91 value = graph()->NewNode(machine()->TruncateInt64ToInt32(), value);
98 return graph()->NewNode(machine()->Load(kMachFloat64), value,
100 graph()->NewNode(common()->ControlEffect(), control));
105 Node* branch = graph()->NewNode(common()->Branch(), val, control);
107 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
110 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
113 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
114 Node* phi = graph()->NewNode(
124 graph()->NewNode(machine()->WordEqual(), val, jsgraph()->TrueConstant()));
136 graph()->NewNode(machine()->Word64Shl(),
137 graph()->NewNode(machine()->ChangeInt32ToInt64(), val),
141 Node* add = graph()->NewNode(machine()->Int32AddWithOverflow(), val, val);
142 Node* ovf = graph()->NewNode(common()->Projection(1), add);
144 Node* branch = graph()->NewNode(common()->Branch(), ovf, control);
146 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
148 graph()->NewNode(machine()->ChangeInt32ToFloat64(), val), if_true);
150 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
151 Node* smi = graph()->NewNode(common()->Projection(0), add);
153 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
154 Node* phi = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), heap_number,
166 Node* tag = graph()->NewNode(machine()->WordAnd(), val,
168 Node* branch = graph()->NewNode(common()->Branch(), tag, control);
170 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
174 Node* change = graph()->NewNode(op, LoadHeapNumberValue(val, if_true));
176 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
179 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
180 Node* phi = graph()->NewNode(
192 Node* tag = graph()->NewNode(machine()->WordAnd(), val,
194 Node* branch = graph()->NewNode(common()->Branch(), tag, control);
196 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
199 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
200 Node* number = graph()->NewNode(machine()->ChangeInt32ToFloat64(),
203 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
205 graph()->NewNode(common()->Phi(kMachFloat64, 2), load, number, merge);
215 Node* cmp = graph()->NewNode(machine()->Uint32LessThanOrEqual(), val,
217 Node* branch = graph()->NewNode(common()->Branch(), cmp, control);
219 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
220 Node* smi = graph()->NewNode(
223 ? graph()->NewNode(machine()->ChangeUint32ToUint64(), val)
227 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
229 graph()->NewNode(machine()->ChangeUint32ToFloat64(), val), if_false);
231 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
232 Node* phi = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), smi,
