| /external/v8/src/compiler/ |
| D | common-operator.h | 30 enum class BranchHint : uint8_t { kNone, kTrue, kFalse }; enum
32 inline BranchHint NegateBranchHint(BranchHint hint) { in NegateBranchHint()
34 case BranchHint::kNone: in NegateBranchHint()
36 case BranchHint::kTrue: in NegateBranchHint()
37 return BranchHint::kFalse; in NegateBranchHint()
38 case BranchHint::kFalse: in NegateBranchHint()
39 return BranchHint::kTrue; in NegateBranchHint()
44 inline size_t hash_value(BranchHint hint) { return static_cast<size_t>(hint); } in hash_value()
46 V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream&, BranchHint);
76 BranchHint hint;
[all …]
|
| D | diamond.h | 26 BranchHint hint = BranchHint::kNone) {
|
| D | graph-assembler.h | 399 BranchHint hint = in GotoIf()
400 label->IsDeferred() ? BranchHint::kFalse : BranchHint::kNone; in GotoIf()
414 BranchHint hint = label->IsDeferred() ? BranchHint::kTrue : BranchHint::kNone; in GotoIfNot()
|
| D | graph-assembler.cc | 231 BranchHint hint = BranchHint::kNone; in Branch()
233 hint = if_false->IsDeferred() ? BranchHint::kTrue : BranchHint::kFalse; in Branch()
|
| D | control-flow-optimizer.cc | 74 if (BranchHintOf(branch->op()) != BranchHint::kNone) return false; in TryBuildSwitch()
98 if (BranchHintOf(branch1->op()) != BranchHint::kNone) break; in TryBuildSwitch()
|
| D | common-operator.cc | 20 std::ostream& operator<<(std::ostream& os, BranchHint hint) { in operator <<()
22 case BranchHint::kNone: in operator <<()
24 case BranchHint::kTrue: in operator <<()
26 case BranchHint::kFalse: in operator <<()
72 BranchHint BranchHintOf(const Operator* const op) { in BranchHintOf()
639 template <BranchHint hint, IsSafetyCheck is_safety_check>
649 BranchOperator<BranchHint::k##Hint, IsSafetyCheck::k##IsCheck> \
918 const Operator* CommonOperatorBuilder::Branch(BranchHint hint, in Branch()
921 if (hint == BranchHint::k##Hint && \ in Branch()
1224 BranchHint hint) { in Select()
|
| D | js-call-reducer.cc | 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()
[all …]
|
| D | wasm-compiler.cc | 267 Diamond stack_check(graph(), mcgraph()->common(), check, BranchHint::kTrue); in StackCheck()
881 Node** false_node, Node* control, BranchHint hint) { in Branch()
895 BranchHint::kNone); in BranchNoHint()
901 BranchHint::kTrue); in BranchExpectTrue()
907 BranchHint::kFalse); in BranchExpectFalse()
1697 Diamond tl_d(graph(), mcgraph()->common(), test, BranchHint::kFalse); in BuildIntConvertFloat()
1700 Diamond nan_d(graph(), mcgraph()->common(), nan_test, BranchHint::kFalse); in BuildIntConvertFloat()
1703 Diamond sat_d(graph(), mcgraph()->common(), neg_test, BranchHint::kNone); in BuildIntConvertFloat()
1985 Diamond tl_d(graph(), mcgraph()->common(), test, BranchHint::kFalse); in BuildCcallConvertFloat()
1988 Diamond nan_d(graph(), mcgraph()->common(), nan_test, BranchHint::kFalse); in BuildCcallConvertFloat()
[all …]
|
| D | bytecode-graph-builder.h | 109 Node* NewBranch(Node* condition, BranchHint hint = BranchHint::kNone,
|
| D | js-typed-lowering.cc | 707 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceCreateConsString()
1116 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceJSToObject()
1198 graph()->NewNode(common()->Branch(BranchHint::kFalse), check0, control); in ReduceJSHasInPrototypeChain()
1230 graph()->NewNode(common()->Branch(BranchHint::kFalse), check1, control); in ReduceJSHasInPrototypeChain()
1243 graph()->NewNode(common()->Branch(BranchHint::kTrue), check10, if_true1); in ReduceJSHasInPrototypeChain()
1831 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceJSForInNext()
1933 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceJSForInPrepare()
2180 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceObjectIsArray()
2214 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceObjectIsArray()
|
| D | simplified-lowering.cc | 3311 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); in DoJSToNumberOrNumericTruncatesToFloat64()
3413 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); in DoJSToNumberOrNumericTruncatesToWord32()
3576 Node* branch0 = graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, in Int32Div()
3653 Node* branch0 = graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, in Int32Mod()
3671 Node* branch2 = graph()->NewNode(common()->Branch(BranchHint::kFalse), in Int32Mod()
3696 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kTrue), in Int32Mod()
3742 Diamond d(graph(), common(), check, BranchHint::kFalse); in Uint32Div()
3779 Node* branch0 = graph()->NewNode(common()->Branch(BranchHint::kFalse), check0, in Uint32Mod()
|
| D | scheduler.cc | 475 case BranchHint::kNone: in ConnectBranch()
477 case BranchHint::kTrue: in ConnectBranch()
480 case BranchHint::kFalse: in ConnectBranch()
|
| D | js-native-context-specialization.cc | 2305 common()->Select(MachineRepresentation::kTagged, BranchHint::kFalse), in BuildElementAccess()
2338 common()->Branch(BranchHint::kTrue, in BuildElementAccess()
2397 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in BuildElementAccess()
2513 common()->Branch(BranchHint::kTrue, in BuildElementAccess()
2715 graph()->NewNode(common()->Branch(BranchHint::kTrue, in BuildIndexedStringLoad()
|
| D | bytecode-graph-builder.cc | 2086 NewBranch(condition, BranchHint::kFalse); in BuildHoleCheckAndThrow()
3105 NewBranch(condition, BranchHint::kNone, IsSafetyCheck::kNoSafetyCheck); in BuildJumpIf()
3115 NewBranch(condition, BranchHint::kNone, IsSafetyCheck::kNoSafetyCheck); in BuildJumpIfNot()
3139 NewBranch(environment()->LookupAccumulator(), BranchHint::kNone, in BuildJumpIfFalse()
3152 NewBranch(environment()->LookupAccumulator(), BranchHint::kNone, in BuildJumpIfTrue()
|
| D | raw-machine-assembler.cc | 102 common()->Branch(BranchHint::kNone, IsSafetyCheck::kNoSafetyCheck), 1, in Branch()
|
| D | machine-operator-reducer.cc | 57 BranchHint::kFalse); in Float64PowHalf()
872 BranchHint::kFalse); in ReduceInt32Mod()
|
| D | js-generic-lowering.cc | 789 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in LowerJSStackCheck()
|
| D | effect-control-linearizer.cc | 260 BranchHint const hint = BranchHintOf(branch->op()); in TryCloneBranch()
|
| /external/vixl/src/aarch32/ |
| D | constants-aarch32.h | 101 enum BranchHint { kNear, kFar, kBranchWithoutHint }; enum
|
| D | macro-assembler-aarch32.h | 1296 void B(Condition cond, Label* label, BranchHint hint = kBranchWithoutHint) {
1315 void B(Label* label, BranchHint hint = kBranchWithoutHint) {
|