Home
last modified time | relevance | path

Searched refs:kTrue (Results 1 – 25 of 27) sorted by relevance

12

/external/dbus-binding-generator/chromeos-dbus-bindings/
Dxml_interface_parser.cc37 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()
Dxml_interface_parser.h62 static const char kTrue[]; variable
/external/v8/src/compiler/
Dcommon-operator-reducer.cc22 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()
Dcommon-operator.h32 enum class BranchHint : uint8_t { kNone, kTrue, kFalse }; enumerator
38 case BranchHint::kTrue: in NegateBranchHint()
41 return BranchHint::kTrue; in NegateBranchHint()
Djs-native-context-specialization.cc104 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 …]
Djs-call-reducer.cc332 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()
Djs-global-object-specialization.cc189 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceJSStoreGlobal()
230 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceJSStoreGlobal()
Dcommon-operator.cc23 case BranchHint::kTrue: in operator <<()
321 BranchOperator<BranchHint::kTrue> kBranchTrueOperator;
481 case BranchHint::kTrue: in Branch()
Djs-generic-lowering.cc652 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()
Dsimplified-lowering.cc1532 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()
Dchange-lowering.cc406 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ChangeUint32ToTagged()
Djs-typed-lowering.cc916 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()
Dscheduler.cc441 case BranchHint::kTrue: in ConnectBranch()
Dwasm-compiler.cc157 BranchHint hint = iftrue ? BranchHint::kFalse : BranchHint::kTrue; in AddTrapIf()
Dast-graph-builder.cc3916 fast_block.BreakUnless(check, BranchHint::kTrue); in TryLoadDynamicVariable()
3958 fast_block.BreakUnless(check, BranchHint::kTrue); in TryLoadDynamicVariable()
/external/v8/test/unittests/compiler/
Ddiamond-unittest.cc136 Diamond dt(graph(), common(), Parameter(0), BranchHint::kTrue); in TEST_F()
137 CHECK(BranchHint::kTrue == BranchHintOf(dt.branch->op())); in TEST_F()
Dcommon-operator-unittest.cc167 const BranchHint kBranchHints[] = {BranchHint::kNone, BranchHint::kTrue,
Ddead-code-elimination-unittest.cc74 BranchHint const kHints[] = {BranchHint::kNone, BranchHint::kTrue, in TEST_F()
Dcommon-operator-reducer-unittest.cc55 BranchHint::kTrue};
Dscheduler-unittest.cc1006 Node* br = graph()->NewNode(common()->Branch(BranchHint::kTrue), p0, start); in TARGET_TEST_F()
/external/skia/bench/
DBenchmark.cpp69 paint->setDither(SkTriState::kTrue == fDither); in setupPaint()
DBenchmark.h38 kTrue, enumerator
/external/boringssl/src/crypto/bytestring/
Dbytestring_test.cc234 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/
Djson-stringifier.h322 case Oddball::kTrue: in Serialize_()
/external/v8/src/heap/
Dheap.cc2649 "boolean", Oddball::kTrue)); in CreateInitialObjects()

12