Lines Matching defs:common
171 Replace(graph()->NewNode(common()->DelayedStringConstant(base)));
348 Node* reduced = graph()->NewNode(common()->DelayedStringConstant(cons));
1179 Node* branch = graph()->NewNode(common()->Branch(), check, control);
1181 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
1184 Control if_false{graph()->NewNode(common()->IfFalse(), branch)};
1189 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
1191 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
1241 Node* branch = graph()->NewNode(common()->Branch(), check, control);
1242 control = graph()->NewNode(common()->IfFalse(), branch);
1243 receiverissmi_control = graph()->NewNode(common()->IfTrue(), branch);
1288 graph()->NewNode(common()->Branch(), check, this_control);
1289 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch);
1290 this_control = graph()->NewNode(common()->IfTrue(), branch);
1299 this_control = graph()->NewNode(common()->Merge(2), this_control,
1301 this_effect = graph()->NewNode(common()->EffectPhi(2), this_effect,
1329 graph()->NewNode(common()->TypeGuard(Type::String()),
1363 control = graph()->NewNode(common()->Merge(control_count), control_count,
1367 common()->Phi(MachineRepresentation::kTagged, control_count),
1370 effect = graph()->NewNode(common()->EffectPhi(control_count),
1380 Node* merge = graph()->NewNode(common()->Merge(if_exception_count),
1384 graph()->NewNode(common()->EffectPhi(if_exception_count),
1387 common()->Phi(MachineRepresentation::kTagged, if_exception_count),
1485 graph()->NewNode(common()->IfException(), effect, control);
1486 Node* if_success = graph()->NewNode(common()->IfSuccess(), control);
1492 graph()->NewNode(common()->Merge(2), dead_node, exception_node);
1493 Node* effect_phi = graph()->NewNode(common()->EffectPhi(2), dead_node,
1496 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
1511 common()->Checkpoint(), eager_deopt_frame_state, effect, control);
1680 // common case of Array or Object prototype only and therefore avoids
1745 graph()->NewNode(common()->Checkpoint(), frame_state, effect, control);
1808 graph()->NewNode(common()->Branch(), check, fallthrough_control);
1809 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch);
1810 this_control = graph()->NewNode(common()->IfTrue(), branch);
1837 control = graph()->NewNode(common()->Merge(control_count), control_count,
1841 common()->Phi(MachineRepresentation::kTagged, control_count),
1844 effect = graph()->NewNode(common()->EffectPhi(control_count),
1986 graph()->NewNode(common()->Deoptimize(reason, FeedbackSource()),
1989 NodeProperties::MergeControlToEnd(graph(), common(), deoptimize);
1992 NodeProperties::ChangeOp(node, common()->Dead());
2185 graph()->NewNode(common()->IfException(), *control, *effect);
2186 Node* const if_success = graph()->NewNode(common()->IfSuccess(), *control);
2219 graph()->NewNode(common()->IfException(), *control, *effect);
2220 Node* const if_success = graph()->NewNode(common()->IfSuccess(), *control);
2251 graph()->NewNode(common()->ExternalConstant(ExternalReference::Create(
2272 graph()->NewNode(common()->Call(call_descriptor), index, inputs);
2563 common()->BeginRegion(RegionObservability::kObservable), effect);
2569 effect = graph()->NewNode(common()->FinishRegion(),
2764 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue),
2767 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
2788 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
2796 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
2798 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
2800 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
2836 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue),
2839 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
2859 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
2865 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
2867 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
2976 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue),
2979 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
3016 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
3024 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
3026 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
3028 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
3073 Node* branch = graph()->NewNode(common()->Branch(), value, control);
3075 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
3087 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
3130 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
3132 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
3134 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
3208 Node* branch = graph()->NewNode(common()->Branch(), check, control);
3210 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
3217 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
3230 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
3232 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
3261 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, *control);
3263 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
3276 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
3279 *control = graph()->NewNode(common()->Merge(2), if_true, if_false);
3281 graph()->NewNode(common()->EffectPhi(2), etrue, *effect, *control);
3282 return graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
3332 common()->Select(MachineRepresentation::kTaggedSigned),
3335 hash = effect = graph()->NewNode(common()->TypeGuard(Type::SignedSmall()),
3352 graph()->NewNode(common()->TypeGuard(Type::SignedSmall()),
3459 CommonOperatorBuilder* JSNativeContextSpecialization::common() const {
3460 return jsgraph()->common();