Home
last modified time | relevance | path

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

/external/v8/test/cctest/
Dtest-types.cc60 using Type::BitsetType::IsInhabited;
88 using HeapType::BitsetType::IsInhabited;
732 CHECK(!type->Is(T.Integer) || !type->IsInhabited() || in MinMax()
872 !type1->IsInhabited()); in Is1()
1225 CHECK(type->Maybe(T.Any) == type->IsInhabited()); in Maybe()
1237 CHECK(type->Maybe(type) == type->IsInhabited()); in Maybe()
1255 (type1->IsInhabited() && type2->IsInhabited())); in Maybe()
1265 CHECK(!type1->Maybe(type2) || intersect12->IsInhabited()); in Maybe()
1274 CHECK(!(type1->Is(type2) && type1->IsInhabited()) || in Maybe()
1789 CHECK(T.Intersect(T.ObjectConstant1, T.ObjectClass)->IsInhabited()); // !!! in Intersect()
[all …]
/external/v8/src/crankshaft/
Dhydrogen-types.cc18 if (!type->IsInhabited()) return HType::None(); in FromType()
Dtyping.cc709 !l.lower->IsInhabited() || !r.lower->IsInhabited() ? in VisitBinaryOperation()
Dhydrogen.cc10937 if (!left_type->IsInhabited() && right->IsConstant() && in BuildBinaryOperation()
10942 if (!right_type->IsInhabited() && left->IsConstant() && in BuildBinaryOperation()
10956 if (!left_type->IsInhabited()) { in BuildBinaryOperation()
10965 if (!right_type->IsInhabited()) { in BuildBinaryOperation()
11519 if (!combined_type->IsInhabited()) { in BuildCompareInstruction()
/external/v8/src/
Dtypes.h453 bool IsInhabited() { return BitsetType::IsInhabited(this->BitsetLub()); } in IsInhabited() function
666 static bool IsInhabited(bitset bits) { in IsInhabited() function
Dtypes.cc621 if (!BitsetType::IsInhabited(this->BitsetLub() & that->BitsetLub())) in Maybe()
/external/v8/src/compiler/
Dtyper.cc329 return input->IsInhabited() ? f(input, typer_) : Type::None(); in TypeUnaryOp()
336 return left->IsInhabited() && right->IsInhabited() ? f(left, right, typer_) in TypeBinaryOp()
343 DCHECK(type->IsInhabited()); in Invert()