| /external/v8/src/compiler/ |
| D | common-operator.h | 28 enum class BranchHint : uint8_t { kNone, kTrue, kFalse }; enum
30 inline BranchHint NegateBranchHint(BranchHint hint) { in NegateBranchHint()
32 case BranchHint::kNone: in NegateBranchHint()
34 case BranchHint::kTrue: in NegateBranchHint()
35 return BranchHint::kFalse; in NegateBranchHint()
36 case BranchHint::kFalse: in NegateBranchHint()
37 return BranchHint::kTrue; in NegateBranchHint()
43 inline size_t hash_value(BranchHint hint) { return static_cast<size_t>(hint); } in hash_value()
45 V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream&, BranchHint);
47 V8_EXPORT_PRIVATE BranchHint BranchHintOf(const Operator* const);
[all …]
|
| D | control-builders.h | 48 void If(Node* condition, BranchHint hint = BranchHint::kNone);
141 void BreakWhen(Node* condition, BranchHint = BranchHint::kNone);
142 void BreakUnless(Node* condition, BranchHint hint = BranchHint::kNone);
|
| D | common-operator.cc | 21 std::ostream& operator<<(std::ostream& os, BranchHint hint) { in operator <<()
23 case BranchHint::kNone: in operator <<()
25 case BranchHint::kTrue: in operator <<()
27 case BranchHint::kFalse: in operator <<()
35 BranchHint BranchHintOf(const Operator* const op) { in BranchHintOf()
37 return OpParameter<BranchHint>(op); in BranchHintOf()
539 template <BranchHint kBranchHint>
540 struct BranchOperator final : public Operator1<BranchHint> {
542 : Operator1<BranchHint>( // -- in BranchOperator()
548 BranchOperator<BranchHint::kNone> kBranchNoneOperator;
[all …]
|
| D | control-builders.cc | 14 void IfBuilder::If(Node* condition, BranchHint hint) { in If()
160 void BlockBuilder::BreakWhen(Node* condition, BranchHint hint) { in BreakWhen()
170 void BlockBuilder::BreakUnless(Node* condition, BranchHint hint) { in BreakUnless()
|
| D | diamond.h | 26 BranchHint hint = BranchHint::kNone) {
|
| D | graph-assembler.h | 405 BranchHint hint = in GotoIf()
406 label->IsDeferred() ? BranchHint::kFalse : BranchHint::kNone; in GotoIf()
419 BranchHint hint = label->IsDeferred() ? BranchHint::kTrue : BranchHint::kNone; in GotoUnless()
|
| D | graph-assembler.cc | 185 BranchHint hint = BranchHint::kNone; in Branch()
187 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()
97 if (BranchHintOf(branch1->op()) != BranchHint::kNone) break; in TryBuildSwitch()
|
| D | js-builtin-reducer.cc | 361 graph()->NewNode(common()->Branch(BranchHint::kFalse), check0, control); in ReduceFastArrayIteratorNext()
379 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceFastArrayIteratorNext()
514 graph()->NewNode(common()->Branch(BranchHint::kFalse), check0, control); in ReduceTypedArrayIteratorNext()
553 Node* branch2 = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceTypedArrayIteratorNext()
754 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceArrayPop()
1653 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceStringCharAt()
1707 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceStringCharCodeAt()
1822 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); in ReduceStringIteratorNext()
1839 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kFalse), in ReduceStringIteratorNext()
1849 Node* branch2 = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceStringIteratorNext()
[all …]
|
| D | bytecode-graph-builder.h | 92 Node* NewBranch(Node* condition, BranchHint hint = BranchHint::kNone) {
|
| D | wasm-compiler.cc | 248 BranchHint hint = iftrue ? BranchHint::kFalse : BranchHint::kTrue; in BuildTrapIf()
497 Diamond stack_check(graph(), jsgraph()->common(), check, BranchHint::kTrue); in StackCheck()
1066 Node* control, BranchHint hint) { in Branch()
1080 BranchHint::kNone); in BranchNoHint()
1086 BranchHint::kTrue); in BranchExpectTrue()
1092 BranchHint::kFalse); in BranchExpectFalse()
1796 BranchHint::kTrue); in GrowMemory()
1911 BranchHint::kFalse); in BuildI32RemS()
1958 BranchHint::kFalse); in BuildI32AsmjsDivS()
1964 BranchHint::kFalse); in BuildI32AsmjsDivS()
[all …]
|
| D | js-typed-lowering.cc | 708 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceCreateConsString()
1251 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceJSToObject()
1481 graph()->NewNode(common()->Branch(BranchHint::kFalse), check0, control); in ReduceJSOrdinaryHasInstance()
1515 graph()->NewNode(common()->Branch(BranchHint::kFalse), check1, control); in ReduceJSOrdinaryHasInstance()
1528 graph()->NewNode(common()->Branch(BranchHint::kTrue), check10, if_true1); in ReduceJSOrdinaryHasInstance()
1766 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceJSConvertReceiver()
1804 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); in ReduceJSConvertReceiver()
1812 graph()->NewNode(common()->Branch(BranchHint::kFalse), check1, if_false0); in ReduceJSConvertReceiver()
1820 graph()->NewNode(common()->Branch(BranchHint::kFalse), check2, if_false1); in ReduceJSConvertReceiver()
2225 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); in ReduceJSForInNext()
|
| D | ast-graph-builder.h | 52 Node* NewBranch(Node* condition, BranchHint hint = BranchHint::kNone) {
|
| D | simplified-lowering.cc | 2849 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); in DoJSToNumberTruncatesToFloat64()
2933 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); in DoJSToNumberTruncatesToWord32()
3017 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in DoLoadBuffer()
3149 Node* branch0 = graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, in Int32Div()
3227 Node* branch0 = graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, in Int32Mod()
3245 Node* branch2 = graph()->NewNode(common()->Branch(BranchHint::kFalse), in Int32Mod()
3270 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kTrue), in Int32Mod()
3316 Diamond d(graph(), common(), check, BranchHint::kFalse); in Uint32Div()
3353 Node* branch0 = graph()->NewNode(common()->Branch(BranchHint::kTrue), rhs, in Uint32Mod()
|
| D | scheduler.cc | 447 case BranchHint::kNone: in ConnectBranch()
449 case BranchHint::kTrue: in ConnectBranch()
452 case BranchHint::kFalse: in ConnectBranch()
|
| D | js-intrinsic-lowering.cc | 345 common()->Select(MachineRepresentation::kTagged, BranchHint::kFalse), in ReduceArrayBufferViewField()
|
| D | machine-operator-reducer.cc | 57 BranchHint::kFalse); in Float64PowHalf()
875 BranchHint::kFalse); in ReduceInt32Mod()
|
| D | js-generic-lowering.cc | 661 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in LowerJSStackCheck()
|
| D | js-native-context-specialization.cc | 1852 common()->Select(MachineRepresentation::kTagged, BranchHint::kFalse), in BuildElementAccess()
1899 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in BuildElementAccess()
|
| D | js-create-lowering.cc | 636 graph()->NewNode(common()->Branch(BranchHint::kFalse), equal, control); in ReduceNewArrayToStubCall()
|
| D | effect-control-linearizer.cc | 240 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) {
|