Home
last modified time | relevance | path

Searched refs:kFalse (Results 1 – 24 of 24) sorted by relevance

/external/v8/src/compiler/
Dsimplified-operator-reducer.cc24 return IsSmiDouble(m.Value()) ? Decision::kTrue : Decision::kFalse; in DecideObjectIsSmi()
26 if (m.IsAllocate()) return Decision::kFalse; in DecideObjectIsSmi()
27 if (m.IsChangeBitToTagged()) return Decision::kFalse; in DecideObjectIsSmi()
29 if (m.IsHeapConstant()) return Decision::kFalse; in DecideObjectIsSmi()
168 if (DecideObjectIsSmi(input) == Decision::kFalse) { in Reduce()
200 case Decision::kFalse: in Reduce()
Dcommon-operator-reducer.cc26 return mcond.Value() ? Decision::kTrue : Decision::kFalse; in DecideCondition()
30 return mcond.Value()->BooleanValue() ? Decision::kTrue : Decision::kFalse; in DecideCondition()
84 DecideCondition(cond->InputAt(1)) == Decision::kFalse && in ReduceBranch()
116 Replace(use, (decision == Decision::kFalse) ? control : dead()); in ReduceBranch()
381 case Decision::kFalse: in ReduceSelect()
Dcommon-operator.h28 enum class BranchHint : uint8_t { kNone, kTrue, kFalse }; enumerator
35 return BranchHint::kFalse; in NegateBranchHint()
36 case BranchHint::kFalse: in NegateBranchHint()
Dwasm-compiler.cc248 BranchHint hint = iftrue ? BranchHint::kFalse : BranchHint::kTrue; in BuildTrapIf()
1092 BranchHint::kFalse); in BranchExpectFalse()
1911 BranchHint::kFalse); in BuildI32RemS()
1958 BranchHint::kFalse); in BuildI32AsmjsDivS()
1964 BranchHint::kFalse); in BuildI32AsmjsDivS()
2033 graph()->NewNode(c->Branch(BranchHint::kFalse), check2, if_false1); in BuildI32AsmjsRemS()
2085 BranchHint::kFalse); in BuildI32AsmjsDivU()
2099 BranchHint::kFalse); in BuildI32AsmjsRemU()
2389 Node* branch = graph()->NewNode(common->Branch(BranchHint::kFalse), ovf, in BuildChangeInt32ToTagged()
2425 graph()->NewNode(common->Branch(BranchHint::kFalse), check_zero, if_smi); in BuildChangeFloat64ToTagged()
[all …]
Dcommon-operator.cc27 case BranchHint::kFalse: in operator <<()
550 BranchOperator<BranchHint::kFalse> kBranchFalseOperator;
821 case BranchHint::kFalse: in Branch()
Dgraph-assembler.cc187 hint = if_false->IsDeferred() ? BranchHint::kTrue : BranchHint::kFalse; in Branch()
Djs-builtin-reducer.cc361 graph()->NewNode(common()->Branch(BranchHint::kFalse), check0, control); in ReduceFastArrayIteratorNext()
514 graph()->NewNode(common()->Branch(BranchHint::kFalse), check0, control); in ReduceTypedArrayIteratorNext()
754 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control); in ReduceArrayPop()
1839 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kFalse), in ReduceStringIteratorNext()
1969 common()->Select(MachineRepresentation::kTagged, BranchHint::kFalse), in ReduceArrayBufferViewAccessor()
Dgraph-assembler.h406 label->IsDeferred() ? BranchHint::kFalse : BranchHint::kNone; in GotoIf()
Djs-intrinsic-lowering.cc345 common()->Select(MachineRepresentation::kTagged, BranchHint::kFalse), in ReduceArrayBufferViewField()
Djs-typed-lowering.cc1481 graph()->NewNode(common()->Branch(BranchHint::kFalse), check0, control); in ReduceJSOrdinaryHasInstance()
1515 graph()->NewNode(common()->Branch(BranchHint::kFalse), check1, control); in ReduceJSOrdinaryHasInstance()
1812 graph()->NewNode(common()->Branch(BranchHint::kFalse), check1, if_false0); in ReduceJSConvertReceiver()
1820 graph()->NewNode(common()->Branch(BranchHint::kFalse), check2, if_false1); in ReduceJSConvertReceiver()
Dmachine-operator-reducer.cc57 BranchHint::kFalse); in Float64PowHalf()
875 BranchHint::kFalse); in ReduceInt32Mod()
Dscheduler.cc452 case BranchHint::kFalse: in ConnectBranch()
Djs-create-lowering.cc636 graph()->NewNode(common()->Branch(BranchHint::kFalse), equal, control); in ReduceNewArrayToStubCall()
Dsimplified-lowering.cc3245 Node* branch2 = graph()->NewNode(common()->Branch(BranchHint::kFalse), in Int32Mod()
3316 Diamond d(graph(), common(), check, BranchHint::kFalse); in Uint32Div()
Djs-native-context-specialization.cc1852 common()->Select(MachineRepresentation::kTagged, BranchHint::kFalse), in BuildElementAccess()
/external/v8/tools/clang/blink_gc_plugin/
DRecordInfo.cpp177 is_eagerly_finalized_ = kFalse; in IsEagerlyFinalized()
209 is_stack_allocated_ = kFalse; in IsStackAllocated()
244 is_non_newable_ = (deleted && all_deleted) ? kTrue : kFalse; in IsNonNewable()
264 is_only_placement_newable_ = (placement && new_deleted) ? kTrue : kFalse; in IsOnlyPlacementNewable()
348 is_declaring_local_trace_ = trace_method_ ? kTrue : kFalse; in DeclaresLocalTraceMethod()
481 has_adjust_and_mark && has_is_heap_object_alive ? kTrue : kFalse; in DetermineTracingMethods()
518 record_->hasNonTrivialDestructor() ? kTrue : kFalse; in NeedsFinalization()
540 does_need_finalization_ = kFalse; in NeedsFinalization()
DRecordInfo.h141 enum CachedBool { kFalse = 0, kTrue = 1, kNotComputed = 2 }; enumerator
/external/skia/bench/
DBenchmark.h39 kFalse enumerator
/external/boringssl/src/crypto/bytestring/
Dbytestring_test.cc222 static const uint8_t kFalse[] = {0x0a, 3, CBS_ASN1_BOOLEAN, 1, 0x00}; in TEST() local
236 CBS_init(&data, kFalse, sizeof(kFalse)); in TEST()
/external/v8/src/
Dglobals.h518 enum class Decision : uint8_t { kUnknown, kTrue, kFalse }; enumerator
530 case Decision::kFalse:
Dvalue-serializer.cc60 kFalse = 'F', enumerator
359 case Oddball::kFalse: in WriteOddball()
360 tag = SerializationTag::kFalse; in WriteOddball()
1092 case SerializationTag::kFalse: in ReadObjectInternal()
Djson-stringifier.cc305 case Oddball::kFalse: in Serialize_()
Dobjects.h10127 static const byte kFalse = 0; variable
/external/v8/src/heap/
Dheap.cc2450 Oddball::cast(obj)->set_kind(Oddball::kFalse); in CreateInitialMaps()
2663 Oddball::kFalse); in CreateInitialObjects()