/external/v8/src/compiler/ |
H A D | common-operator.h | 27 enum class BranchHint : uint8_t { kNone, kTrue, kFalse }; class in namespace:v8::internal::compiler 29 inline BranchHint NegateBranchHint(BranchHint hint) { 31 case BranchHint::kNone: 33 case BranchHint::kTrue: 34 return BranchHint::kFalse; 35 case BranchHint::kFalse: 36 return BranchHint::kTrue; 42 inline size_t hash_value(BranchHint hint) { return static_cast<size_t>(hint); } 44 V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream&, BranchHint); 84 SelectParameters(MachineRepresentation representation, BranchHint hint = BranchHint::kNone) argument [all...] |
H A 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);
|
H A D | diamond.h | 26 BranchHint hint = BranchHint::kNone) { 25 Diamond(Graph* g, CommonOperatorBuilder* b, Node* cond, BranchHint hint = BranchHint::kNone) argument
|
H A D | common-operator.cc | 19 std::ostream& operator<<(std::ostream& os, BranchHint hint) { 21 case BranchHint::kNone: 23 case BranchHint::kTrue: 25 case BranchHint::kFalse: 33 BranchHint BranchHintOf(const Operator* const op) { 35 return OpParameter<BranchHint>(op); 418 template <BranchHint kBranchHint> 419 struct BranchOperator final : public Operator1<BranchHint> { 421 : Operator1<BranchHint>( // -- 427 BranchOperator<BranchHint [all...] |
H A D | control-flow-optimizer.cc | 74 if (BranchHintOf(branch->op()) != BranchHint::kNone) return false; 97 if (BranchHintOf(branch1->op()) != BranchHint::kNone) break;
|
H A D | control-builders.cc | 12 void IfBuilder::If(Node* condition, BranchHint hint) { 158 void BlockBuilder::BreakWhen(Node* condition, BranchHint hint) { 168 void BlockBuilder::BreakUnless(Node* condition, BranchHint hint) {
|
H A D | effect-control-linearizer.cc | 238 BranchHint const hint = BranchHintOf(branch->op()); 866 graph()->NewNode(common()->Branch(BranchHint::kFalse), ovf, control); 892 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); 943 Node* branch_smi = graph()->NewNode(common()->Branch(BranchHint::kFalse), 972 Node* branch_oddball = graph()->NewNode(common()->Branch(BranchHint::kTrue), 1077 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); 1109 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); 1147 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); 1233 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); 1346 graph()->NewNode(common()->Branch(BranchHint [all...] |
H A D | bytecode-graph-builder.h | 95 Node* NewBranch(Node* condition, BranchHint hint = BranchHint::kNone) { argument
|
H A D | js-builtin-reducer.cc | 373 graph()->NewNode(common()->Branch(BranchHint::kFalse), check0, control); 391 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kTrue), 521 graph()->NewNode(common()->Branch(BranchHint::kFalse), check0, control); 551 Node* branch2 = graph()->NewNode(common()->Branch(BranchHint::kTrue), 752 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); 1544 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), 1595 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), 1681 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); 1698 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kFalse), 1708 Node* branch2 = graph()->NewNode(common()->Branch(BranchHint [all...] |
H A D | wasm-compiler.cc | 180 BranchHint hint = iftrue ? BranchHint::kFalse : BranchHint::kTrue; 433 Diamond stack_check(graph(), jsgraph()->common(), check, BranchHint::kTrue); 998 Node* control, BranchHint hint) { 1012 BranchHint::kNone); 1018 BranchHint::kTrue); 1024 BranchHint::kFalse); 1720 BranchHint::kTrue); 1849 BranchHint [all...] |
H A D | ast-graph-builder.h | 54 Node* NewBranch(Node* condition, BranchHint hint = BranchHint::kNone) { argument
|
H A D | memory-optimizer.cc | 214 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); 282 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control);
|
H A D | js-typed-lowering.cc | 640 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); 1135 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); 1348 graph()->NewNode(common()->Branch(BranchHint::kFalse), check0, control); 1382 graph()->NewNode(common()->Branch(BranchHint::kFalse), check1, control); 1395 graph()->NewNode(common()->Branch(BranchHint::kTrue), check10, if_true1); 1631 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); 1668 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); 1676 graph()->NewNode(common()->Branch(BranchHint::kFalse), check1, if_false0); 1684 graph()->NewNode(common()->Branch(BranchHint::kFalse), check2, if_false1); 2048 graph()->NewNode(common()->Branch(BranchHint [all...] |
H A D | simplified-lowering.cc | 2723 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); 2807 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); 2891 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); 3023 Node* branch0 = graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, 3101 Node* branch0 = graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, 3119 Node* branch2 = graph()->NewNode(common()->Branch(BranchHint::kFalse), 3144 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kTrue), 3190 Diamond d(graph(), common(), check, BranchHint::kFalse); 3227 Node* branch0 = graph()->NewNode(common()->Branch(BranchHint::kTrue), rhs,
|
H A D | scheduler.cc | 447 case BranchHint::kNone: 449 case BranchHint::kTrue: 452 case BranchHint::kFalse:
|
H A D | ast-graph-builder.cc | 1365 for_block.BreakWhen(is_null_cond, BranchHint::kFalse); 1369 for_block.BreakWhen(is_undefined_cond, BranchHint::kFalse); 1419 test_value.If(test_value_cond, BranchHint::kFalse); 3883 fast_block.BreakUnless(check, BranchHint::kTrue); 3930 fast_block.BreakUnless(check, BranchHint::kTrue);
|
H A D | js-native-context-specialization.cc | 1286 common()->Select(MachineRepresentation::kTagged, BranchHint::kFalse), 1340 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue),
|
H A D | machine-operator-reducer.cc | 54 common()->Select(MachineRepresentation::kFloat64, BranchHint::kFalse), 851 common()->Select(MachineRepresentation::kWord32, BranchHint::kFalse));
|
H A D | js-generic-lowering.cc | 669 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control);
|
H A D | js-create-lowering.cc | 547 graph()->NewNode(common()->Branch(BranchHint::kFalse), equal, control);
|
/external/vixl/src/aarch32/ |
H A D | constants-aarch32.h | 101 enum BranchHint { kNear, kFar, kBranchWithoutHint }; enum in namespace:vixl::aarch32
|
H A D | macro-assembler-aarch32.h | 1389 void B(Condition cond, Label* label, BranchHint hint = kBranchWithoutHint) { 1404 void B(Label* label, BranchHint hint = kBranchWithoutHint) {
|