• Home
  • Raw
  • Download

Lines Matching refs:BranchHint

315       control = graph()->NewNode(common()->Branch(BranchHint::kFalse),  in ReduceFunctionPrototypeApply()
324 control = graph()->NewNode(common()->Branch(BranchHint::kFalse), in ReduceFunctionPrototypeApply()
846 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceReflectGet()
922 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceReflectHas()
1094 Node* continue_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArrayForEach()
1137 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceArrayForEach()
1322 Node* hole_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArrayReduce()
1355 Node* continue_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArrayReduce()
1394 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kFalse), in ReduceArrayReduce()
1569 Node* continue_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArrayMap()
1611 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceArrayMap()
1802 Node* continue_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArrayFilter()
1851 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceArrayFilter()
2050 common()->Branch(BranchHint::kTrue), continue_test, control); in ReduceArrayFind()
2125 Node* found_branch = graph()->NewNode(common()->Branch(BranchHint::kFalse), in ReduceArrayFind()
2167 Node* boolean_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in DoFilterPostCallbackWork()
2227 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, *control); in WireInCallbackIsCallableCheck()
2377 Node* continue_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArrayEvery()
2425 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceArrayEvery()
2471 Node* boolean_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArrayEvery()
2615 common()->Select(MachineRepresentation::kTagged, BranchHint::kFalse), in ReduceArrayIndexOfIncludes()
2733 Node* continue_branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArraySome()
2781 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceArraySome()
2828 common()->Branch(BranchHint::kFalse), check_boolean_result, control); in ReduceArraySome()
3154 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceCallOrConstructWithArrayLikeOrSpread()
4035 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceStringPrototypeSubstring()
4101 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceStringPrototypeSlice()
4119 common()->Select(MachineRepresentation::kTagged, BranchHint::kFalse), in ReduceStringPrototypeSlice()
4133 common()->Select(MachineRepresentation::kTagged, BranchHint::kFalse), in ReduceStringPrototypeSlice()
4151 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceStringPrototypeSlice()
4202 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceStringPrototypeSubstr()
4220 common()->Select(MachineRepresentation::kTagged, BranchHint::kFalse), in ReduceStringPrototypeSubstr()
4253 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceStringPrototypeSubstr()
4513 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceArrayPrototypePop()
4632 graph()->NewNode(common()->Branch(BranchHint::kFalse), check0, control); in ReduceArrayPrototypeShift()
4646 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceArrayPrototypeShift()
5050 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceArrayIteratorPrototypeNext()
5395 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); in ReduceStringIteratorPrototypeNext()
5918 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReducePromisePrototypeFinally()
6069 common()->Select(MachineRepresentation::kTagged, BranchHint::kTrue), in ReducePromisePrototypeThen()
6075 common()->Select(MachineRepresentation::kTagged, BranchHint::kTrue), in ReducePromisePrototypeThen()
6183 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceTypedArrayPrototypeToStringTag()
6484 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceCollectionIteratorPrototypeNext()
6578 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, loop); in ReduceCollectionIteratorPrototypeNext()
6617 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kFalse), in ReduceCollectionIteratorPrototypeNext()
6745 common()->Select(MachineRepresentation::kTagged, BranchHint::kFalse), in ReduceArrayBufferViewAccessor()