Home
last modified time | relevance | path

Searched refs:IsInhabited (Results 1 – 5 of 5) sorted by relevance

/external/v8/test/cctest/
Dtest-types.cc45 using Type::BitsetType::IsInhabited;
72 using HeapType::BitsetType::IsInhabited;
473 (Rep::BitsetType::IsInhabited(bits) ? bits : 0) == in Bitset()
1252 CHECK(type->Maybe(T.Any) == type->IsInhabited()); in Maybe()
1264 CHECK(type->Maybe(type) == type->IsInhabited()); in Maybe()
1282 (type1->IsInhabited() && type2->IsInhabited())); in Maybe()
1292 CHECK(!type1->Maybe(type2) || intersect12->IsInhabited()); in Maybe()
1301 CHECK(!(type1->Is(type2) && type1->IsInhabited()) || in Maybe()
1800 ->IsInhabited()); in Intersect()
1803 CHECK(T.Intersect(T.ObjectConstant1, T.ObjectClass)->IsInhabited()); // !!! in Intersect()
[all …]
/external/v8/src/
Dtypes.h388 bool IsInhabited() { return BitsetType::IsInhabited(this->BitsetLub()); } in IsInhabited() function
578 DCHECK(bits == kNone || IsInhabited(bits)); in New()
582 DCHECK(bits == kNone || IsInhabited(bits)); in New()
588 static bool IsInhabited(bitset bits) { in IsInhabited() function
Dtypes.cc525 if (!BitsetType::IsInhabited(this->BitsetLub() & that->BitsetLub())) in Maybe()
612 if (!BitsetType::IsInhabited(bits)) bits = BitsetType::kNone; in Intersect()
698 if (!BitsetType::IsInhabited(lhs->BitsetLub() & rhs->BitsetLub())) { in IntersectAux()
Dtyping.cc679 !l.lower->IsInhabited() || !r.lower->IsInhabited() ? in VisitBinaryOperation()
Dhydrogen.cc10281 if (!left_type->IsInhabited()) { in BuildBinaryOperation()
10292 if (!right_type->IsInhabited()) { in BuildBinaryOperation()
10789 if (!combined_type->IsInhabited()) { in BuildCompareInstruction()