Commit c44a69d9 authored by ulan@chromium.org's avatar ulan@chromium.org

Revert r23916, r23917 for breaking 64-bit tests.

"Use unsigned type bitsets to limit undefined behaviour".

TBR=rossberg@chromium.org

Review URL: https://codereview.chromium.org/563283003

git-svn-id: https://v8.googlecode.com/svn/branches/bleeding_edge@23922 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
parent dcf84d88
...@@ -70,7 +70,7 @@ T* ZoneTypeConfig::cast(Type* type) { ...@@ -70,7 +70,7 @@ T* ZoneTypeConfig::cast(Type* type) {
// static // static
bool ZoneTypeConfig::is_bitset(Type* type) { bool ZoneTypeConfig::is_bitset(Type* type) {
return reinterpret_cast<uintptr_t>(type) & 1; return reinterpret_cast<intptr_t>(type) & 1;
} }
...@@ -87,9 +87,9 @@ bool ZoneTypeConfig::is_class(Type* type) { ...@@ -87,9 +87,9 @@ bool ZoneTypeConfig::is_class(Type* type) {
// static // static
ZoneTypeConfig::Type::bitset ZoneTypeConfig::as_bitset(Type* type) { int ZoneTypeConfig::as_bitset(Type* type) {
DCHECK(is_bitset(type)); DCHECK(is_bitset(type));
return reinterpret_cast<Type::bitset>(type) ^ 1u; return static_cast<int>(reinterpret_cast<intptr_t>(type) >> 1);
} }
...@@ -108,14 +108,13 @@ i::Handle<i::Map> ZoneTypeConfig::as_class(Type* type) { ...@@ -108,14 +108,13 @@ i::Handle<i::Map> ZoneTypeConfig::as_class(Type* type) {
// static // static
ZoneTypeConfig::Type* ZoneTypeConfig::from_bitset(Type::bitset bitset) { ZoneTypeConfig::Type* ZoneTypeConfig::from_bitset(int bitset) {
return reinterpret_cast<Type*>(bitset | 1u); return reinterpret_cast<Type*>((bitset << 1) | 1);
} }
// static // static
ZoneTypeConfig::Type* ZoneTypeConfig::from_bitset( ZoneTypeConfig::Type* ZoneTypeConfig::from_bitset(int bitset, Zone* Zone) {
Type::bitset bitset, Zone* Zone) {
return from_bitset(bitset); return from_bitset(bitset);
} }
...@@ -230,9 +229,8 @@ bool HeapTypeConfig::is_struct(Type* type, int tag) { ...@@ -230,9 +229,8 @@ bool HeapTypeConfig::is_struct(Type* type, int tag) {
// static // static
HeapTypeConfig::Type::bitset HeapTypeConfig::as_bitset(Type* type) { int HeapTypeConfig::as_bitset(Type* type) {
// TODO(rossberg): Breaks the Smi abstraction. Fix once there is a better way. return i::Smi::cast(type)->value();
return reinterpret_cast<Type::bitset>(type);
} }
...@@ -249,15 +247,14 @@ i::Handle<HeapTypeConfig::Struct> HeapTypeConfig::as_struct(Type* type) { ...@@ -249,15 +247,14 @@ i::Handle<HeapTypeConfig::Struct> HeapTypeConfig::as_struct(Type* type) {
// static // static
HeapTypeConfig::Type* HeapTypeConfig::from_bitset(Type::bitset bitset) { HeapTypeConfig::Type* HeapTypeConfig::from_bitset(int bitset) {
// TODO(rossberg): Breaks the Smi abstraction. Fix once there is a better way. return Type::cast(i::Smi::FromInt(bitset));
return reinterpret_cast<Type*>(bitset);
} }
// static // static
i::Handle<HeapTypeConfig::Type> HeapTypeConfig::from_bitset( i::Handle<HeapTypeConfig::Type> HeapTypeConfig::from_bitset(
Type::bitset bitset, Isolate* isolate) { int bitset, Isolate* isolate) {
return i::handle(from_bitset(bitset), isolate); return i::handle(from_bitset(bitset), isolate);
} }
......
This diff is collapsed.
This diff is collapsed.
...@@ -12,22 +12,20 @@ ...@@ -12,22 +12,20 @@
using namespace v8::internal; using namespace v8::internal;
// Testing auxiliaries (breaking the Type abstraction). // Testing auxiliaries (breaking the Type abstraction).
typedef uintptr_t bitset;
struct ZoneRep { struct ZoneRep {
typedef void* Struct; typedef void* Struct;
static bool IsStruct(Type* t, int tag) { static bool IsStruct(Type* t, int tag) {
return !IsBitset(t) && reinterpret_cast<intptr_t>(AsStruct(t)[0]) == tag; return !IsBitset(t) && reinterpret_cast<intptr_t>(AsStruct(t)[0]) == tag;
} }
static bool IsBitset(Type* t) { return reinterpret_cast<bitset>(t) & 1; } static bool IsBitset(Type* t) { return reinterpret_cast<intptr_t>(t) & 1; }
static bool IsUnion(Type* t) { return IsStruct(t, 6); } static bool IsUnion(Type* t) { return IsStruct(t, 6); }
static Struct* AsStruct(Type* t) { static Struct* AsStruct(Type* t) {
return reinterpret_cast<Struct*>(t); return reinterpret_cast<Struct*>(t);
} }
static bitset AsBitset(Type* t) { static int AsBitset(Type* t) {
return reinterpret_cast<bitset>(t) ^ 1u; return static_cast<int>(reinterpret_cast<intptr_t>(t) >> 1);
} }
static Struct* AsUnion(Type* t) { static Struct* AsUnion(Type* t) {
return AsStruct(t); return AsStruct(t);
...@@ -57,9 +55,7 @@ struct HeapRep { ...@@ -57,9 +55,7 @@ struct HeapRep {
static bool IsUnion(Handle<HeapType> t) { return IsStruct(t, 6); } static bool IsUnion(Handle<HeapType> t) { return IsStruct(t, 6); }
static Struct* AsStruct(Handle<HeapType> t) { return FixedArray::cast(*t); } static Struct* AsStruct(Handle<HeapType> t) { return FixedArray::cast(*t); }
static bitset AsBitset(Handle<HeapType> t) { static int AsBitset(Handle<HeapType> t) { return Smi::cast(*t)->value(); }
return reinterpret_cast<bitset>(*t);
}
static Struct* AsUnion(Handle<HeapType> t) { return AsStruct(t); } static Struct* AsUnion(Handle<HeapType> t) { return AsStruct(t); }
static int Length(Struct* structured) { return structured->length() - 1; } static int Length(Struct* structured) { return structured->length() - 1; }
...@@ -70,11 +66,9 @@ struct HeapRep { ...@@ -70,11 +66,9 @@ struct HeapRep {
using HeapType::BitsetType::Glb; using HeapType::BitsetType::Glb;
using HeapType::BitsetType::Lub; using HeapType::BitsetType::Lub;
using HeapType::BitsetType::InherentLub; using HeapType::BitsetType::InherentLub;
static bitset Glb(Handle<HeapType> type) { return Glb(*type); } static int Glb(Handle<HeapType> type) { return Glb(*type); }
static bitset Lub(Handle<HeapType> type) { return Lub(*type); } static int Lub(Handle<HeapType> type) { return Lub(*type); }
static bitset InherentLub(Handle<HeapType> type) { static int InherentLub(Handle<HeapType> type) { return InherentLub(*type); }
return InherentLub(*type);
}
}; };
}; };
...@@ -371,7 +365,7 @@ struct Tests : Rep { ...@@ -371,7 +365,7 @@ struct Tests : Rep {
CHECK(type1->Is(type2)); CHECK(type1->Is(type2));
CHECK(!type2->Is(type1)); CHECK(!type2->Is(type1));
if (Rep::IsBitset(type1) && Rep::IsBitset(type2)) { if (Rep::IsBitset(type1) && Rep::IsBitset(type2)) {
CHECK(Rep::AsBitset(type1) != Rep::AsBitset(type2)); CHECK_NE(Rep::AsBitset(type1), Rep::AsBitset(type2));
} }
} }
...@@ -379,7 +373,7 @@ struct Tests : Rep { ...@@ -379,7 +373,7 @@ struct Tests : Rep {
CHECK(!type1->Is(type2)); CHECK(!type1->Is(type2));
CHECK(!type2->Is(type1)); CHECK(!type2->Is(type1));
if (Rep::IsBitset(type1) && Rep::IsBitset(type2)) { if (Rep::IsBitset(type1) && Rep::IsBitset(type2)) {
CHECK(Rep::AsBitset(type1) != Rep::AsBitset(type2)); CHECK_NE(Rep::AsBitset(type1), Rep::AsBitset(type2));
} }
} }
...@@ -387,8 +381,8 @@ struct Tests : Rep { ...@@ -387,8 +381,8 @@ struct Tests : Rep {
CHECK(type1->Maybe(type2)); CHECK(type1->Maybe(type2));
CHECK(type2->Maybe(type1)); CHECK(type2->Maybe(type1));
if (Rep::IsBitset(type1) && Rep::IsBitset(type2)) { if (Rep::IsBitset(type1) && Rep::IsBitset(type2)) {
CHECK(0 != CHECK_NE(0,
(Rep::AsBitset(type1) & Rep::AsBitset(type2) & Rep::AsBitset(mask))); Rep::AsBitset(type1) & Rep::AsBitset(type2) & Rep::AsBitset(mask));
} }
} }
...@@ -398,8 +392,8 @@ struct Tests : Rep { ...@@ -398,8 +392,8 @@ struct Tests : Rep {
CHECK(!type1->Maybe(type2)); CHECK(!type1->Maybe(type2));
CHECK(!type2->Maybe(type1)); CHECK(!type2->Maybe(type1));
if (Rep::IsBitset(type1) && Rep::IsBitset(type2)) { if (Rep::IsBitset(type1) && Rep::IsBitset(type2)) {
CHECK(0 == CHECK_EQ(0,
(Rep::AsBitset(type1) & Rep::AsBitset(type2) & Rep::AsBitset(mask))); Rep::AsBitset(type1) & Rep::AsBitset(type2) & Rep::AsBitset(mask));
} }
} }
...@@ -408,8 +402,8 @@ struct Tests : Rep { ...@@ -408,8 +402,8 @@ struct Tests : Rep {
CHECK(this->IsBitset(T.None)); CHECK(this->IsBitset(T.None));
CHECK(this->IsBitset(T.Any)); CHECK(this->IsBitset(T.Any));
CHECK(0 == this->AsBitset(T.None)); CHECK_EQ(0, this->AsBitset(T.None));
CHECK(0xfffffffeu == this->AsBitset(T.Any)); CHECK_EQ(-1, this->AsBitset(T.Any));
// Union(T1, T2) is bitset for bitsets T1,T2 // Union(T1, T2) is bitset for bitsets T1,T2
for (TypeIterator it1 = T.types.begin(); it1 != T.types.end(); ++it1) { for (TypeIterator it1 = T.types.begin(); it1 != T.types.end(); ++it1) {
...@@ -451,8 +445,8 @@ struct Tests : Rep { ...@@ -451,8 +445,8 @@ struct Tests : Rep {
TypeHandle type2 = *it2; TypeHandle type2 = *it2;
TypeHandle union12 = T.Union(type1, type2); TypeHandle union12 = T.Union(type1, type2);
if (this->IsBitset(type1) && this->IsBitset(type2)) { if (this->IsBitset(type1) && this->IsBitset(type2)) {
CHECK( CHECK_EQ(
(this->AsBitset(type1) | this->AsBitset(type2)) == this->AsBitset(type1) | this->AsBitset(type2),
this->AsBitset(union12)); this->AsBitset(union12));
} }
} }
...@@ -465,8 +459,8 @@ struct Tests : Rep { ...@@ -465,8 +459,8 @@ struct Tests : Rep {
TypeHandle type2 = *it2; TypeHandle type2 = *it2;
TypeHandle intersect12 = T.Intersect(type1, type2); TypeHandle intersect12 = T.Intersect(type1, type2);
if (this->IsBitset(type1) && this->IsBitset(type2)) { if (this->IsBitset(type1) && this->IsBitset(type2)) {
CHECK( CHECK_EQ(
(this->AsBitset(type1) & this->AsBitset(type2)) == this->AsBitset(type1) & this->AsBitset(type2),
this->AsBitset(intersect12)); this->AsBitset(intersect12));
} }
} }
......
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