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