Searched refs:IsBitset (Results 1 – 4 of 4) sorted by relevance
80 if (this->IsBitset()) return BitsetType::Min(this->AsBitset()); in Min()98 if (this->IsBitset()) return BitsetType::Max(this->AsBitset()); in Max()122 if (type->IsBitset()) { in Glb()139 if (type->IsBitset()) return type->AsBitset(); in Lub()437 if (that->IsBitset()) { in SlowIs()440 if (this->IsBitset()) { in SlowIs()527 if (this->IsBitset() || that->IsBitset()) return true; in Maybe()586 if (i != 0) DCHECK(!this->Get(i)->IsBitset()); // (2) in Wellformed()615 if (type1->IsBitset() && type2->IsBitset()) { in Intersect()703 if (rhs->IsBitset() || rhs->IsClass()) { in IntersectAux()[all …]
461 if (this->IsBitset()) return Iterator<i::Map>(); in Classes()465 if (this->IsBitset()) return Iterator<i::Object>(); in Constants()505 bool IsBitset() { return Config::is_bitset(this); } in IsBitset() function509 DCHECK(this->IsBitset()); in AsBitset()
22 DCHECK(t->IsBitset() || t->IsClass() || t->IsConstant() || t->IsRange() || in cast()
21 return !IsBitset(t) && reinterpret_cast<intptr_t>(AsStruct(t)[0]) == tag; in IsStruct()23 static bool IsBitset(Type* t) { return reinterpret_cast<uintptr_t>(t) & 1; } in IsBitset() function56 static bool IsBitset(Handle<HeapType> t) { return t->IsSmi(); } in IsBitset() function357 this->IsBitset(type1) == this->IsBitset(type2) && in Equal()361 (!this->IsBitset(type1) || in Equal()375 if (this->IsBitset(type1) && this->IsBitset(type2)) { in CheckSub()383 if (this->IsBitset(type1) && this->IsBitset(type2)) { in CheckUnordered()404 this->IsBitset(t) + t->IsClass() + t->IsConstant() + t->IsRange() + in IsSomeType()411 CHECK(this->IsBitset(T.None)); in Bitset()412 CHECK(this->IsBitset(T.Any)); in Bitset()[all …]