/external/dbus-binding-generator/chromeos-dbus-bindings/ |
D | xml_interface_parser.cc | 37 const char XmlInterfaceParser::kTrue[] = "true"; member in chromeos_dbus_bindings::XmlInterfaceParser 158 CHECK(value == kTrue || value == kFalse); in OnOpenElement() 159 method.is_const = (value == kTrue); in OnOpenElement() 161 CHECK(value == kTrue || value == kFalse); in OnOpenElement() 162 method.include_dbus_message = (value == kTrue); in OnOpenElement()
|
D | xml_interface_parser.h | 62 static const char kTrue[]; variable
|
/external/v8/src/compiler/ |
D | common-operator-reducer.cc | 22 enum class Decision { kUnknown, kTrue, kFalse }; enumerator 28 return mcond.Value() ? Decision::kTrue : Decision::kFalse; in DecideCondition() 32 return mcond.Value() ? Decision::kTrue : Decision::kFalse; in DecideCondition() 36 return mcond.Value()->BooleanValue() ? Decision::kTrue : Decision::kFalse; in DecideCondition() 114 Replace(use, (decision == Decision::kTrue) ? control : dead()); in ReduceBranch() 314 case Decision::kTrue: in ReduceSelect()
|
D | common-operator.h | 32 enum class BranchHint : uint8_t { kNone, kTrue, kFalse }; enumerator 38 case BranchHint::kTrue: in NegateBranchHint() 41 return BranchHint::kTrue; in NegateBranchHint()
|
D | js-native-context-specialization.cc | 104 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceNamedAccess() 211 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceNamedAccess() 278 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceNamedAccess() 321 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceNamedAccess() 346 branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceNamedAccess() 639 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceElementAccess() 654 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceElementAccess() 679 branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), check, in ReduceElementAccess() 699 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), check, in ReduceElementAccess() 803 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceElementAccess() [all …]
|
D | js-call-reducer.cc | 332 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceJSCallFunction() 357 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceJSCallFunction() 475 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceJSCallConstruct() 506 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceJSCallConstruct()
|
D | js-global-object-specialization.cc | 189 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceJSStoreGlobal() 230 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceJSStoreGlobal()
|
D | common-operator.cc | 23 case BranchHint::kTrue: in operator <<() 321 BranchOperator<BranchHint::kTrue> kBranchTrueOperator; 481 case BranchHint::kTrue: in Branch()
|
D | js-generic-lowering.cc | 652 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); in LowerJSForInPrepare() 673 graph()->NewNode(common()->Branch(BranchHint::kTrue), check1, if_true0); in LowerJSForInPrepare() 830 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in LowerJSStackCheck()
|
D | simplified-lowering.cc | 1532 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in DoLoadBuffer() 1667 Node* branch0 = graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, in Int32Div() 1745 Node* branch0 = graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, in Int32Mod() 1788 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kTrue), in Int32Mod() 1856 Node* branch0 = graph()->NewNode(common()->Branch(BranchHint::kTrue), rhs, in Uint32Mod()
|
D | change-lowering.cc | 406 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ChangeUint32ToTagged()
|
D | js-typed-lowering.cc | 916 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceJSToObject() 2301 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); in ReduceJSForInPrepare() 2321 graph()->NewNode(common()->Branch(BranchHint::kTrue), check1, if_true0); in ReduceJSForInPrepare() 2451 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); in ReduceJSForInNext()
|
D | scheduler.cc | 441 case BranchHint::kTrue: in ConnectBranch()
|
D | wasm-compiler.cc | 157 BranchHint hint = iftrue ? BranchHint::kFalse : BranchHint::kTrue; in AddTrapIf()
|
D | ast-graph-builder.cc | 3916 fast_block.BreakUnless(check, BranchHint::kTrue); in TryLoadDynamicVariable() 3958 fast_block.BreakUnless(check, BranchHint::kTrue); in TryLoadDynamicVariable()
|
/external/v8/test/unittests/compiler/ |
D | diamond-unittest.cc | 136 Diamond dt(graph(), common(), Parameter(0), BranchHint::kTrue); in TEST_F() 137 CHECK(BranchHint::kTrue == BranchHintOf(dt.branch->op())); in TEST_F()
|
D | common-operator-unittest.cc | 167 const BranchHint kBranchHints[] = {BranchHint::kNone, BranchHint::kTrue,
|
D | dead-code-elimination-unittest.cc | 74 BranchHint const kHints[] = {BranchHint::kNone, BranchHint::kTrue, in TEST_F()
|
D | common-operator-reducer-unittest.cc | 55 BranchHint::kTrue};
|
D | scheduler-unittest.cc | 1006 Node* br = graph()->NewNode(common()->Branch(BranchHint::kTrue), p0, start); in TARGET_TEST_F()
|
/external/skia/bench/ |
D | Benchmark.cpp | 69 paint->setDither(SkTriState::kTrue == fDither); in setupPaint()
|
D | Benchmark.h | 38 kTrue, enumerator
|
/external/boringssl/src/crypto/bytestring/ |
D | bytestring_test.cc | 234 static const uint8_t kTrue[] = {0x0a, 3, CBS_ASN1_BOOLEAN, 1, 0xff}; in TestGetOptionalASN1Bool() local 246 CBS_init(&data, kTrue, sizeof(kTrue)); in TestGetOptionalASN1Bool()
|
/external/v8/src/ |
D | json-stringifier.h | 322 case Oddball::kTrue: in Serialize_()
|
/external/v8/src/heap/ |
D | heap.cc | 2649 "boolean", Oddball::kTrue)); in CreateInitialObjects()
|