Skip to content

V
V8
Commit 648ac440 authored by mvstanton's avatar mvstanton Committed by Commit bot
Browse files
Options

[turbofan] Cleanup: Type only has a semantic dimension. 

BUG=

Review-Url: https://codereview.chromium.org/2366433003
Cr-Commit-Position: refs/heads/master@{#39666}
parent 01cd881b
Show whitespace changes
Inline Side-by-side
Showing with 55 additions and 129 deletions
src/compiler/representation-change.cc
View file @ 648ac440
...@@ -196,7 +196,7 @@ Node* RepresentationChanger::GetTaggedSignedRepresentationFor( ...@@ -196,7 +196,7 @@ Node* RepresentationChanger::GetTaggedSignedRepresentationFor(
} }
// Select the correct X -> Tagged operator. // Select the correct X -> Tagged operator.
const Operator* op; const Operator* op;
if (Type::Semantic(output_type, jsgraph()->zone())->Is(Type::None())) { if (output_type->Is(Type::None())) {
// This is an impossible value; it should not be used at runtime. // This is an impossible value; it should not be used at runtime.
// We just provide a dummy value here. // We just provide a dummy value here.
return jsgraph()->Constant(0); return jsgraph()->Constant(0);
...@@ -293,7 +293,7 @@ Node* RepresentationChanger::GetTaggedPointerRepresentationFor( ...@@ -293,7 +293,7 @@ Node* RepresentationChanger::GetTaggedPointerRepresentationFor(
break; break;
} }
// Select the correct X -> Tagged operator. // Select the correct X -> Tagged operator.
if (Type::Semantic(output_type, jsgraph()->zone())->Is(Type::None())) { if (output_type->Is(Type::None())) {
// This is an impossible value; it should not be used at runtime. // This is an impossible value; it should not be used at runtime.
// We just provide a dummy value here. // We just provide a dummy value here.
return jsgraph()->TheHoleConstant(); return jsgraph()->TheHoleConstant();
...@@ -338,7 +338,7 @@ Node* RepresentationChanger::GetTaggedRepresentationFor( ...@@ -338,7 +338,7 @@ Node* RepresentationChanger::GetTaggedRepresentationFor(
} }
// Select the correct X -> Tagged operator. // Select the correct X -> Tagged operator.
const Operator* op; const Operator* op;
if (Type::Semantic(output_type, jsgraph()->zone())->Is(Type::None())) { if (output_type->Is(Type::None())) {
// This is an impossible value; it should not be used at runtime. // This is an impossible value; it should not be used at runtime.
// We just provide a dummy value here. // We just provide a dummy value here.
return jsgraph()->TheHoleConstant(); return jsgraph()->TheHoleConstant();
...@@ -420,7 +420,7 @@ Node* RepresentationChanger::GetFloat32RepresentationFor( ...@@ -420,7 +420,7 @@ Node* RepresentationChanger::GetFloat32RepresentationFor(
} }
// Select the correct X -> Float32 operator. // Select the correct X -> Float32 operator.
const Operator* op = nullptr; const Operator* op = nullptr;
if (Type::Semantic(output_type, jsgraph()->zone())->Is(Type::None())) { if (output_type->Is(Type::None())) {
// This is an impossible value; it should not be used at runtime. // This is an impossible value; it should not be used at runtime.
// We just provide a dummy value here. // We just provide a dummy value here.
return jsgraph()->Float32Constant(0.0f); return jsgraph()->Float32Constant(0.0f);
...@@ -490,7 +490,7 @@ Node* RepresentationChanger::GetFloat64RepresentationFor( ...@@ -490,7 +490,7 @@ Node* RepresentationChanger::GetFloat64RepresentationFor(
} }
// Select the correct X -> Float64 operator. // Select the correct X -> Float64 operator.
const Operator* op = nullptr; const Operator* op = nullptr;
if (Type::Semantic(output_type, jsgraph()->zone())->Is(Type::None())) { if (output_type->Is(Type::None())) {
// This is an impossible value; it should not be used at runtime. // This is an impossible value; it should not be used at runtime.
// We just provide a dummy value here. // We just provide a dummy value here.
return jsgraph()->Float64Constant(0.0); return jsgraph()->Float64Constant(0.0);
...@@ -576,7 +576,7 @@ Node* RepresentationChanger::GetWord32RepresentationFor( ...@@ -576,7 +576,7 @@ Node* RepresentationChanger::GetWord32RepresentationFor(
// Select the correct X -> Word32 operator. // Select the correct X -> Word32 operator.
const Operator* op = nullptr; const Operator* op = nullptr;
if (Type::Semantic(output_type, jsgraph()->zone())->Is(Type::None())) { if (output_type->Is(Type::None())) {
// This is an impossible value; it should not be used at runtime. // This is an impossible value; it should not be used at runtime.
// We just provide a dummy value here. // We just provide a dummy value here.
return jsgraph()->Int32Constant(0); return jsgraph()->Int32Constant(0);
...@@ -698,7 +698,7 @@ Node* RepresentationChanger::GetBitRepresentationFor( ...@@ -698,7 +698,7 @@ Node* RepresentationChanger::GetBitRepresentationFor(
} }
// Select the correct X -> Bit operator. // Select the correct X -> Bit operator.
const Operator* op; const Operator* op;
if (Type::Semantic(output_type, jsgraph()->zone())->Is(Type::None())) { if (output_type->Is(Type::None())) {
// This is an impossible value; it should not be used at runtime. // This is an impossible value; it should not be used at runtime.
// We just provide a dummy value here. // We just provide a dummy value here.
return jsgraph()->Int32Constant(0); return jsgraph()->Int32Constant(0);
...@@ -737,7 +737,7 @@ Node* RepresentationChanger::GetBitRepresentationFor( ...@@ -737,7 +737,7 @@ Node* RepresentationChanger::GetBitRepresentationFor(
Node* RepresentationChanger::GetWord64RepresentationFor( Node* RepresentationChanger::GetWord64RepresentationFor(
Node* node, MachineRepresentation output_rep, Type* output_type) { Node* node, MachineRepresentation output_rep, Type* output_type) {
if (Type::Semantic(output_type, jsgraph()->zone())->Is(Type::None())) { if (output_type->Is(Type::None())) {
// This is an impossible value; it should not be used at runtime. // This is an impossible value; it should not be used at runtime.
// We just provide a dummy value here. // We just provide a dummy value here.
return jsgraph()->Int64Constant(0); return jsgraph()->Int64Constant(0);
......
src/compiler/types.cc
View file @ 648ac440
...@@ -72,7 +72,7 @@ bool Type::Contains(RangeType* range, i::Object* val) { ...@@ -72,7 +72,7 @@ bool Type::Contains(RangeType* range, i::Object* val) {
// Min and Max computation. // Min and Max computation.
double Type::Min() { double Type::Min() {
DCHECK(this->SemanticIs(Number())); DCHECK(this->Is(Number()));
if (this->IsBitset()) return BitsetType::Min(this->AsBitset()); if (this->IsBitset()) return BitsetType::Min(this->AsBitset());
if (this->IsUnion()) { if (this->IsUnion()) {
double min = +V8_INFINITY; double min = +V8_INFINITY;
...@@ -88,7 +88,7 @@ double Type::Min() { ...@@ -88,7 +88,7 @@ double Type::Min() {
} }
double Type::Max() { double Type::Max() {
DCHECK(this->SemanticIs(Number())); DCHECK(this->Is(Number()));
if (this->IsBitset()) return BitsetType::Max(this->AsBitset()); if (this->IsBitset()) return BitsetType::Max(this->AsBitset());
if (this->IsUnion()) { if (this->IsUnion()) {
double max = -V8_INFINITY; double max = -V8_INFINITY;
...@@ -115,10 +115,10 @@ Type::bitset BitsetType::Glb(Type* type) { ...@@ -115,10 +115,10 @@ Type::bitset BitsetType::Glb(Type* type) {
} else if (type->IsUnion()) { } else if (type->IsUnion()) {
SLOW_DCHECK(type->AsUnion()->Wellformed()); SLOW_DCHECK(type->AsUnion()->Wellformed());
return type->AsUnion()->Get(0)->BitsetGlb() | return type->AsUnion()->Get(0)->BitsetGlb() |
SEMANTIC(type->AsUnion()->Get(1)->BitsetGlb()); // Shortcut. type->AsUnion()->Get(1)->BitsetGlb(); // Shortcut.
} else if (type->IsRange()) { } else if (type->IsRange()) {
bitset glb = SEMANTIC( bitset glb =
BitsetType::Glb(type->AsRange()->Min(), type->AsRange()->Max())); BitsetType::Glb(type->AsRange()->Min(), type->AsRange()->Max());
return glb; return glb;
} else { } else {
return kNone; return kNone;
...@@ -135,7 +135,7 @@ Type::bitset BitsetType::Lub(Type* type) { ...@@ -135,7 +135,7 @@ Type::bitset BitsetType::Lub(Type* type) {
int bitset = type->AsUnion()->Get(0)->BitsetLub(); int bitset = type->AsUnion()->Get(0)->BitsetLub();
for (int i = 0, n = type->AsUnion()->Length(); i < n; ++i) { for (int i = 0, n = type->AsUnion()->Length(); i < n; ++i) {
// Other elements only contribute their semantic part. // Other elements only contribute their semantic part.
bitset |= SEMANTIC(type->AsUnion()->Get(i)->BitsetLub()); bitset |= type->AsUnion()->Get(i)->BitsetLub();
} }
return bitset; return bitset;
} }
...@@ -315,12 +315,11 @@ size_t BitsetType::BoundariesSize() { ...@@ -315,12 +315,11 @@ size_t BitsetType::BoundariesSize() {
Type::bitset BitsetType::ExpandInternals(Type::bitset bits) { Type::bitset BitsetType::ExpandInternals(Type::bitset bits) {
DisallowHeapAllocation no_allocation; DisallowHeapAllocation no_allocation;
if (!(bits & SEMANTIC(kPlainNumber))) return bits; // Shortcut. if (!(bits & kPlainNumber)) return bits; // Shortcut.
const Boundary* boundaries = Boundaries(); const Boundary* boundaries = Boundaries();
for (size_t i = 0; i < BoundariesSize(); ++i) { for (size_t i = 0; i < BoundariesSize(); ++i) {
DCHECK(BitsetType::Is(boundaries[i].internal, boundaries[i].external)); DCHECK(BitsetType::Is(boundaries[i].internal, boundaries[i].external));
if (bits & SEMANTIC(boundaries[i].internal)) if (bits & boundaries[i].internal) bits |= boundaries[i].external;
bits |= SEMANTIC(boundaries[i].external);
} }
return bits; return bits;
} }
...@@ -339,9 +338,7 @@ Type::bitset BitsetType::Lub(double min, double max) { ...@@ -339,9 +338,7 @@ Type::bitset BitsetType::Lub(double min, double max) {
return lub | mins[BoundariesSize() - 1].internal; return lub | mins[BoundariesSize() - 1].internal;
} }
Type::bitset BitsetType::NumberBits(bitset bits) { Type::bitset BitsetType::NumberBits(bitset bits) { return bits & kPlainNumber; }
return SEMANTIC(bits & kPlainNumber);
}
Type::bitset BitsetType::Glb(double min, double max) { Type::bitset BitsetType::Glb(double min, double max) {
DisallowHeapAllocation no_allocation; DisallowHeapAllocation no_allocation;
...@@ -359,16 +356,16 @@ Type::bitset BitsetType::Glb(double min, double max) { ...@@ -359,16 +356,16 @@ Type::bitset BitsetType::Glb(double min, double max) {
} }
// OtherNumber also contains float numbers, so it can never be // OtherNumber also contains float numbers, so it can never be
// in the greatest lower bound. // in the greatest lower bound.
return glb & ~(SEMANTIC(kOtherNumber)); return glb & ~(kOtherNumber);
} }
double BitsetType::Min(bitset bits) { double BitsetType::Min(bitset bits) {
DisallowHeapAllocation no_allocation; DisallowHeapAllocation no_allocation;
DCHECK(Is(SEMANTIC(bits), kNumber)); DCHECK(Is(bits, kNumber));
const Boundary* mins = Boundaries(); const Boundary* mins = Boundaries();
bool mz = SEMANTIC(bits & kMinusZero); bool mz = bits & kMinusZero;
for (size_t i = 0; i < BoundariesSize(); ++i) { for (size_t i = 0; i < BoundariesSize(); ++i) {
if (Is(SEMANTIC(mins[i].internal), bits)) { if (Is(mins[i].internal, bits)) {
return mz ? std::min(0.0, mins[i].min) : mins[i].min; return mz ? std::min(0.0, mins[i].min) : mins[i].min;
} }
} }
...@@ -378,14 +375,14 @@ double BitsetType::Min(bitset bits) { ...@@ -378,14 +375,14 @@ double BitsetType::Min(bitset bits) {
double BitsetType::Max(bitset bits) { double BitsetType::Max(bitset bits) {
DisallowHeapAllocation no_allocation; DisallowHeapAllocation no_allocation;
DCHECK(Is(SEMANTIC(bits), kNumber)); DCHECK(Is(bits, kNumber));
const Boundary* mins = Boundaries(); const Boundary* mins = Boundaries();
bool mz = SEMANTIC(bits & kMinusZero); bool mz = bits & kMinusZero;
if (BitsetType::Is(SEMANTIC(mins[BoundariesSize() - 1].internal), bits)) { if (BitsetType::Is(mins[BoundariesSize() - 1].internal, bits)) {
return +V8_INFINITY; return +V8_INFINITY;
} }
for (size_t i = BoundariesSize() - 1; i-- > 0;) { for (size_t i = BoundariesSize() - 1; i-- > 0;) {
if (Is(SEMANTIC(mins[i].internal), bits)) { if (Is(mins[i].internal, bits)) {
return mz ? std::max(0.0, mins[i + 1].min - 1) : mins[i + 1].min - 1; return mz ? std::max(0.0, mins[i + 1].min - 1) : mins[i + 1].min - 1;
} }
} }
...@@ -431,28 +428,10 @@ bool Type::SlowIs(Type* that) { ...@@ -431,28 +428,10 @@ bool Type::SlowIs(Type* that) {
return BitsetType::Is(this->AsBitset(), that->BitsetGlb()); return BitsetType::Is(this->AsBitset(), that->BitsetGlb());
} }
// Check the semantic part.
return SemanticIs(that);
}
// Check if SEMANTIC([this]) <= SEMANTIC([that]). The result of the method
// should be independent of the representation axis of the types.
bool Type::SemanticIs(Type* that) {
DisallowHeapAllocation no_allocation;
if (this == that) return true;
if (that->IsBitset()) {
return BitsetType::Is(SEMANTIC(this->BitsetLub()), that->AsBitset());
}
if (this->IsBitset()) {
return BitsetType::Is(SEMANTIC(this->AsBitset()), that->BitsetGlb());
}
// (T1 \/ ... \/ Tn) <= T if (T1 <= T) /\ ... /\ (Tn <= T) // (T1 \/ ... \/ Tn) <= T if (T1 <= T) /\ ... /\ (Tn <= T)
if (this->IsUnion()) { if (this->IsUnion()) {
for (int i = 0, n = this->AsUnion()->Length(); i < n; ++i) { for (int i = 0, n = this->AsUnion()->Length(); i < n; ++i) {
if (!this->AsUnion()->Get(i)->SemanticIs(that)) return false; if (!this->AsUnion()->Get(i)->Is(that)) return false;
} }
return true; return true;
} }
...@@ -460,7 +439,7 @@ bool Type::SemanticIs(Type* that) { ...@@ -460,7 +439,7 @@ bool Type::SemanticIs(Type* that) {
// T <= (T1 \/ ... \/ Tn) if (T <= T1) \/ ... \/ (T <= Tn) // T <= (T1 \/ ... \/ Tn) if (T <= T1) \/ ... \/ (T <= Tn)
if (that->IsUnion()) { if (that->IsUnion()) {
for (int i = 0, n = that->AsUnion()->Length(); i < n; ++i) { for (int i = 0, n = that->AsUnion()->Length(); i < n; ++i) {
if (this->SemanticIs(that->AsUnion()->Get(i))) return true; if (this->Is(that->AsUnion()->Get(i))) return true;
if (i > 1 && this->IsRange()) return false; // Shortcut. if (i > 1 && this->IsRange()) return false; // Shortcut.
} }
return false; return false;
...@@ -480,21 +459,13 @@ bool Type::SemanticIs(Type* that) { ...@@ -480,21 +459,13 @@ bool Type::SemanticIs(Type* that) {
bool Type::Maybe(Type* that) { bool Type::Maybe(Type* that) {
DisallowHeapAllocation no_allocation; DisallowHeapAllocation no_allocation;
// Take care of the representation part (and also approximate
// the semantic part).
if (!BitsetType::IsInhabited(this->BitsetLub() & that->BitsetLub())) if (!BitsetType::IsInhabited(this->BitsetLub() & that->BitsetLub()))
return false; return false;
return SemanticMaybe(that);
}
bool Type::SemanticMaybe(Type* that) {
DisallowHeapAllocation no_allocation;
// (T1 \/ ... \/ Tn) overlaps T if (T1 overlaps T) \/ ... \/ (Tn overlaps T) // (T1 \/ ... \/ Tn) overlaps T if (T1 overlaps T) \/ ... \/ (Tn overlaps T)
if (this->IsUnion()) { if (this->IsUnion()) {
for (int i = 0, n = this->AsUnion()->Length(); i < n; ++i) { for (int i = 0, n = this->AsUnion()->Length(); i < n; ++i) {
if (this->AsUnion()->Get(i)->SemanticMaybe(that)) return true; if (this->AsUnion()->Get(i)->Maybe(that)) return true;
} }
return false; return false;
} }
...@@ -502,14 +473,11 @@ bool Type::SemanticMaybe(Type* that) { ...@@ -502,14 +473,11 @@ bool Type::SemanticMaybe(Type* that) {
// T overlaps (T1 \/ ... \/ Tn) if (T overlaps T1) \/ ... \/ (T overlaps Tn) // T overlaps (T1 \/ ... \/ Tn) if (T overlaps T1) \/ ... \/ (T overlaps Tn)
if (that->IsUnion()) { if (that->IsUnion()) {
for (int i = 0, n = that->AsUnion()->Length(); i < n; ++i) { for (int i = 0, n = that->AsUnion()->Length(); i < n; ++i) {
if (this->SemanticMaybe(that->AsUnion()->Get(i))) return true; if (this->Maybe(that->AsUnion()->Get(i))) return true;
} }
return false; return false;
} }
if (!BitsetType::SemanticIsInhabited(this->BitsetLub() & that->BitsetLub()))
return false;
if (this->IsBitset() && that->IsBitset()) return true; if (this->IsBitset() && that->IsBitset()) return true;
if (this->IsRange()) { if (this->IsRange()) {
...@@ -530,7 +498,7 @@ bool Type::SemanticMaybe(Type* that) { ...@@ -530,7 +498,7 @@ bool Type::SemanticMaybe(Type* that) {
} }
} }
if (that->IsRange()) { if (that->IsRange()) {
return that->SemanticMaybe(this); // This case is handled above. return that->Maybe(this); // This case is handled above.
} }
if (this->IsBitset() || that->IsBitset()) return true; if (this->IsBitset() || that->IsBitset()) return true;
...@@ -578,8 +546,7 @@ bool UnionType::Wellformed() { ...@@ -578,8 +546,7 @@ bool UnionType::Wellformed() {
if (i != 1) DCHECK(!this->Get(i)->IsRange()); // (3) if (i != 1) DCHECK(!this->Get(i)->IsRange()); // (3)
DCHECK(!this->Get(i)->IsUnion()); // (4) DCHECK(!this->Get(i)->IsUnion()); // (4)
for (int j = 0; j < this->Length(); ++j) { for (int j = 0; j < this->Length(); ++j) {
if (i != j && i != 0) if (i != j && i != 0) DCHECK(!this->Get(i)->Is(this->Get(j))); // (5)
DCHECK(!this->Get(i)->SemanticIs(this->Get(j))); // (5)
} }
} }
DCHECK(!this->Get(1)->IsRange() || DCHECK(!this->Get(1)->IsRange() ||
...@@ -614,13 +581,13 @@ Type* Type::Intersect(Type* type1, Type* type2, Zone* zone) { ...@@ -614,13 +581,13 @@ Type* Type::Intersect(Type* type1, Type* type2, Zone* zone) {
// Semantic subtyping check - this is needed for consistency with the // Semantic subtyping check - this is needed for consistency with the
// semi-fast case above. // semi-fast case above.
if (type1->SemanticIs(type2)) { if (type1->Is(type2)) {
type2 = Any(); type2 = Any();
} else if (type2->SemanticIs(type1)) { } else if (type2->Is(type1)) {
type1 = Any(); type1 = Any();
} }
bitset bits = SEMANTIC(type1->BitsetGlb() & type2->BitsetGlb()); bitset bits = type1->BitsetGlb() & type2->BitsetGlb();
int size1 = type1->IsUnion() ? type1->AsUnion()->Length() : 1; int size1 = type1->IsUnion() ? type1->AsUnion()->Length() : 1;
int size2 = type2->IsUnion() ? type2->AsUnion()->Length() : 1; int size2 = type2->IsUnion() ? type2->AsUnion()->Length() : 1;
if (!AddIsSafe(size1, size2)) return Any(); if (!AddIsSafe(size1, size2)) return Any();
...@@ -661,7 +628,7 @@ int Type::UpdateRange(Type* range, UnionType* result, int size, Zone* zone) { ...@@ -661,7 +628,7 @@ int Type::UpdateRange(Type* range, UnionType* result, int size, Zone* zone) {
// Remove any components that just got subsumed. // Remove any components that just got subsumed.
for (int i = 2; i < size;) { for (int i = 2; i < size;) {
if (result->Get(i)->SemanticIs(range)) { if (result->Get(i)->Is(range)) {
result->Set(i, result->Get(--size)); result->Set(i, result->Get(--size));
} else { } else {
++i; ++i;
...@@ -705,7 +672,7 @@ int Type::IntersectAux(Type* lhs, Type* rhs, UnionType* result, int size, ...@@ -705,7 +672,7 @@ int Type::IntersectAux(Type* lhs, Type* rhs, UnionType* result, int size,
return size; return size;
} }
if (!BitsetType::SemanticIsInhabited(lhs->BitsetLub() & rhs->BitsetLub())) { if (!BitsetType::IsInhabited(lhs->BitsetLub() & rhs->BitsetLub())) {
return size; return size;
} }
...@@ -757,7 +724,7 @@ Type* Type::NormalizeRangeAndBitset(Type* range, bitset* bits, Zone* zone) { ...@@ -757,7 +724,7 @@ Type* Type::NormalizeRangeAndBitset(Type* range, bitset* bits, Zone* zone) {
// If the range is semantically contained within the bitset, return None and // If the range is semantically contained within the bitset, return None and
// leave the bitset untouched. // leave the bitset untouched.
bitset range_lub = SEMANTIC(range->BitsetLub()); bitset range_lub = range->BitsetLub();
if (BitsetType::Is(range_lub, *bits)) { if (BitsetType::Is(range_lub, *bits)) {
return None(); return None();
} }
...@@ -814,7 +781,7 @@ Type* Type::Union(Type* type1, Type* type2, Zone* zone) { ...@@ -814,7 +781,7 @@ Type* Type::Union(Type* type1, Type* type2, Zone* zone) {
size = 0; size = 0;
// Compute the new bitset. // Compute the new bitset.
bitset new_bitset = SEMANTIC(type1->BitsetGlb() | type2->BitsetGlb()); bitset new_bitset = type1->BitsetGlb() | type2->BitsetGlb();
// Deal with ranges. // Deal with ranges.
Type* range = None(); Type* range = None();
...@@ -831,7 +798,6 @@ Type* Type::Union(Type* type1, Type* type2, Zone* zone) { ...@@ -831,7 +798,6 @@ Type* Type::Union(Type* type1, Type* type2, Zone* zone) {
} else if (range2 != NULL) { } else if (range2 != NULL) {
range = NormalizeRangeAndBitset(range2, &new_bitset, zone); range = NormalizeRangeAndBitset(range2, &new_bitset, zone);
} }
new_bitset = SEMANTIC(new_bitset);
Type* bits = BitsetType::New(new_bitset); Type* bits = BitsetType::New(new_bitset);
result->Set(size++, bits); result->Set(size++, bits);
if (!range->IsNone()) result->Set(size++, range); if (!range->IsNone()) result->Set(size++, range);
...@@ -852,7 +818,7 @@ int Type::AddToUnion(Type* type, UnionType* result, int size, Zone* zone) { ...@@ -852,7 +818,7 @@ int Type::AddToUnion(Type* type, UnionType* result, int size, Zone* zone) {
return size; return size;
} }
for (int i = 0; i < size; ++i) { for (int i = 0; i < size; ++i) {
if (type->SemanticIs(result->Get(i))) return size; if (type->Is(result->Get(i))) return size;
} }
result->Set(size++, type); result->Set(size++, type);
return size; return size;
...@@ -868,7 +834,7 @@ Type* Type::NormalizeUnion(Type* union_type, int size, Zone* zone) { ...@@ -868,7 +834,7 @@ Type* Type::NormalizeUnion(Type* union_type, int size, Zone* zone) {
} }
bitset bits = unioned->Get(0)->AsBitset(); bitset bits = unioned->Get(0)->AsBitset();
// If the union only consists of a range, we can get rid of the union. // If the union only consists of a range, we can get rid of the union.
if (size == 2 && SEMANTIC(bits) == BitsetType::kNone) { if (size == 2 && bits == BitsetType::kNone) {
if (unioned->Get(1)->IsRange()) { if (unioned->Get(1)->IsRange()) {
return RangeType::New(unioned->Get(1)->AsRange()->Min(), return RangeType::New(unioned->Get(1)->AsRange()->Min(),
unioned->Get(1)->AsRange()->Max(), zone); unioned->Get(1)->AsRange()->Max(), zone);
...@@ -879,14 +845,6 @@ Type* Type::NormalizeUnion(Type* union_type, int size, Zone* zone) { ...@@ -879,14 +845,6 @@ Type* Type::NormalizeUnion(Type* union_type, int size, Zone* zone) {
return union_type; return union_type;
} }
// -----------------------------------------------------------------------------
// Component extraction
// static
Type* Type::Semantic(Type* t, Zone* zone) {
return Intersect(t, BitsetType::New(BitsetType::kSemantic), zone);
}
// ----------------------------------------------------------------------------- // -----------------------------------------------------------------------------
// Iteration. // Iteration.
...@@ -956,12 +914,12 @@ void Type::Iterator<T>::Advance() { ...@@ -956,12 +914,12 @@ void Type::Iterator<T>::Advance() {
const char* BitsetType::Name(bitset bits) { const char* BitsetType::Name(bitset bits) {
switch (bits) { switch (bits) {
#define RETURN_NAMED_SEMANTIC_TYPE(type, value) \ #define RETURN_NAMED_TYPE(type, value) \
case SEMANTIC(k##type): \ case k##type: \
return #type; return #type;
SEMANTIC_BITSET_TYPE_LIST(RETURN_NAMED_SEMANTIC_TYPE) PROPER_BITSET_TYPE_LIST(RETURN_NAMED_TYPE)
INTERNAL_BITSET_TYPE_LIST(RETURN_NAMED_SEMANTIC_TYPE) INTERNAL_BITSET_TYPE_LIST(RETURN_NAMED_TYPE)
#undef RETURN_NAMED_SEMANTIC_TYPE #undef RETURN_NAMED_TYPE
default: default:
return NULL; return NULL;
...@@ -979,9 +937,9 @@ void BitsetType::Print(std::ostream& os, // NOLINT ...@@ -979,9 +937,9 @@ void BitsetType::Print(std::ostream& os, // NOLINT
// clang-format off // clang-format off
static const bitset named_bitsets[] = { static const bitset named_bitsets[] = {
#define BITSET_CONSTANT(type, value) SEMANTIC(k##type), #define BITSET_CONSTANT(type, value) k##type,
INTERNAL_BITSET_TYPE_LIST(BITSET_CONSTANT) INTERNAL_BITSET_TYPE_LIST(BITSET_CONSTANT)
SEMANTIC_BITSET_TYPE_LIST(BITSET_CONSTANT) PROPER_BITSET_TYPE_LIST(BITSET_CONSTANT)
#undef BITSET_CONSTANT #undef BITSET_CONSTANT
}; };
// clang-format on // clang-format on
...@@ -1004,7 +962,7 @@ void BitsetType::Print(std::ostream& os, // NOLINT ...@@ -1004,7 +962,7 @@ void BitsetType::Print(std::ostream& os, // NOLINT
void Type::PrintTo(std::ostream& os) { void Type::PrintTo(std::ostream& os) {
DisallowHeapAllocation no_allocation; DisallowHeapAllocation no_allocation;
if (this->IsBitset()) { if (this->IsBitset()) {
BitsetType::Print(os, SEMANTIC(this->AsBitset())); BitsetType::Print(os, this->AsBitset());
} else if (this->IsConstant()) { } else if (this->IsConstant()) {
os << "Constant(" << Brief(*this->AsConstant()->Value()) << ")"; os << "Constant(" << Brief(*this->AsConstant()->Value()) << ")";
} else if (this->IsRange()) { } else if (this->IsRange()) {
......
src/compiler/types.h
View file @ 648ac440
...@@ -22,13 +22,7 @@ namespace compiler { ...@@ -22,13 +22,7 @@ namespace compiler {
// can express class types (a.k.a. specific maps) and singleton types (i.e., // can express class types (a.k.a. specific maps) and singleton types (i.e.,
// concrete constants). // concrete constants).
// //
// Types consist of two dimensions: semantic (value range) and representation. // The following equations and inequations hold:
// Both are related through subtyping.
//
//
// SEMANTIC DIMENSION
//
// The following equations and inequations hold for the semantic axis:
// //
// None <= T // None <= T
// T <= Any // T <= Any
...@@ -40,7 +34,6 @@ namespace compiler { ...@@ -40,7 +34,6 @@ namespace compiler {
// InternalizedString < String // InternalizedString < String
// //
// Receiver = Object \/ Proxy // Receiver = Object \/ Proxy
// RegExp < Object
// OtherUndetectable < Object // OtherUndetectable < Object
// DetectableReceiver = Receiver - OtherUndetectable // DetectableReceiver = Receiver - OtherUndetectable
// //
...@@ -103,18 +96,13 @@ namespace compiler { ...@@ -103,18 +96,13 @@ namespace compiler {
// clang-format off // clang-format off
#define MASK_BITSET_TYPE_LIST(V) \
V(Semantic, 0xfffffffeu)
#define SEMANTIC(k) ((k) & BitsetType::kSemantic)
#define INTERNAL_BITSET_TYPE_LIST(V) \ #define INTERNAL_BITSET_TYPE_LIST(V) \
V(OtherUnsigned31, 1u << 1) \ V(OtherUnsigned31, 1u << 1) \
V(OtherUnsigned32, 1u << 2) \ V(OtherUnsigned32, 1u << 2) \
V(OtherSigned32, 1u << 3) \ V(OtherSigned32, 1u << 3) \
V(OtherNumber, 1u << 4) \ V(OtherNumber, 1u << 4) \
#define SEMANTIC_BITSET_TYPE_LIST(V) \ #define PROPER_BITSET_TYPE_LIST(V) \
V(None, 0u) \ V(None, 0u) \
V(Negative31, 1u << 5) \ V(Negative31, 1u << 5) \
V(Null, 1u << 6) \ V(Null, 1u << 6) \
...@@ -193,13 +181,9 @@ namespace compiler { ...@@ -193,13 +181,9 @@ namespace compiler {
* occur as part of PlainNumber. * occur as part of PlainNumber.
*/ */
#define PROPER_BITSET_TYPE_LIST(V) \
SEMANTIC_BITSET_TYPE_LIST(V)
#define BITSET_TYPE_LIST(V) \ #define BITSET_TYPE_LIST(V) \
MASK_BITSET_TYPE_LIST(V) \
INTERNAL_BITSET_TYPE_LIST(V) \ INTERNAL_BITSET_TYPE_LIST(V) \
SEMANTIC_BITSET_TYPE_LIST(V) PROPER_BITSET_TYPE_LIST(V)
class Type; class Type;
...@@ -224,11 +208,7 @@ class BitsetType { ...@@ -224,11 +208,7 @@ class BitsetType {
return static_cast<bitset>(reinterpret_cast<uintptr_t>(this) ^ 1u); return static_cast<bitset>(reinterpret_cast<uintptr_t>(this) ^ 1u);
} }
static bool IsInhabited(bitset bits) { return SemanticIsInhabited(bits); } static bool IsInhabited(bitset bits) { return bits != kNone; }
static bool SemanticIsInhabited(bitset bits) {
return SEMANTIC(bits) != kNone;
}
static bool Is(bitset bits1, bitset bits2) { static bool Is(bitset bits1, bitset bits2) {
return (bits1 | bits2) == bits2; return (bits1 | bits2) == bits2;
...@@ -371,7 +351,7 @@ class RangeType : public TypeBase { ...@@ -371,7 +351,7 @@ class RangeType : public TypeBase {
static Type* New(Limits lim, Zone* zone) { static Type* New(Limits lim, Zone* zone) {
DCHECK(IsInteger(lim.min) && IsInteger(lim.max)); DCHECK(IsInteger(lim.min) && IsInteger(lim.max));
DCHECK(lim.min <= lim.max); DCHECK(lim.min <= lim.max);
BitsetType::bitset bits = SEMANTIC(BitsetType::Lub(lim.min, lim.max)); BitsetType::bitset bits = BitsetType::Lub(lim.min, lim.max);
return AsType(new (zone->New(sizeof(RangeType))) RangeType(bits, lim)); return AsType(new (zone->New(sizeof(RangeType))) RangeType(bits, lim));
} }
...@@ -526,9 +506,6 @@ class Type { ...@@ -526,9 +506,6 @@ class Type {
} }
static Type* For(i::Handle<i::Map> map) { return For(*map); } static Type* For(i::Handle<i::Map> map) { return For(*map); }
// Extraction of components.
static Type* Semantic(Type* t, Zone* zone);
// Predicates. // Predicates.
bool IsInhabited() { return BitsetType::IsInhabited(this->BitsetLub()); } bool IsInhabited() { return BitsetType::IsInhabited(this->BitsetLub()); }
...@@ -627,14 +604,10 @@ class Type { ...@@ -627,14 +604,10 @@ class Type {
} }
UnionType* AsUnion() { return UnionType::cast(this); } UnionType* AsUnion() { return UnionType::cast(this); }
// Auxiliary functions.
bool SemanticMaybe(Type* that);
bitset BitsetGlb() { return BitsetType::Glb(this); } bitset BitsetGlb() { return BitsetType::Glb(this); }
bitset BitsetLub() { return BitsetType::Lub(this); } bitset BitsetLub() { return BitsetType::Lub(this); }
bool SlowIs(Type* that); bool SlowIs(Type* that);
bool SemanticIs(Type* that);
static bool Overlap(RangeType* lhs, RangeType* rhs); static bool Overlap(RangeType* lhs, RangeType* rhs);
static bool Contains(RangeType* lhs, RangeType* rhs); static bool Contains(RangeType* lhs, RangeType* rhs);
......
test/cctest/types-fuzz.h
View file @ 648ac440
...@@ -108,9 +108,6 @@ class Types { ...@@ -108,9 +108,6 @@ class Types {
PROPER_BITSET_TYPE_LIST(DECLARE_TYPE) PROPER_BITSET_TYPE_LIST(DECLARE_TYPE)
#undef DECLARE_TYPE #undef DECLARE_TYPE
#define DECLARE_TYPE(name, value) Type* Mask##name##ForTesting;
MASK_BITSET_TYPE_LIST(DECLARE_TYPE)
#undef DECLARE_TYPE
Type* SignedSmall; Type* SignedSmall;
Type* UnsignedSmall; Type* UnsignedSmall;
...@@ -142,8 +139,6 @@ class Types { ...@@ -142,8 +139,6 @@ class Types {
Type* Intersect(Type* t1, Type* t2) { return Type::Intersect(t1, t2, zone_); } Type* Intersect(Type* t1, Type* t2) { return Type::Intersect(t1, t2, zone_); }
Type* Semantic(Type* t) { return Type::Semantic(t, zone_); }
Type* Random() { Type* Random() {
return types[rng_->NextInt(static_cast<int>(types.size()))]; return types[rng_->NextInt(static_cast<int>(types.size()))];
} }
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment