Lines Matching refs:type2

45 static void CheckEqual(Handle<Type> type1, Handle<Type> type2) {
46 CHECK_EQ(IsBitset(*type1), IsBitset(*type2));
47 CHECK_EQ(IsClass(*type1), IsClass(*type2));
48 CHECK_EQ(IsConstant(*type1), IsConstant(*type2));
49 CHECK_EQ(IsUnion(*type1), IsUnion(*type2));
50 CHECK_EQ(type1->NumClasses(), type2->NumClasses());
51 CHECK_EQ(type1->NumConstants(), type2->NumConstants());
53 CHECK_EQ(AsBitset(*type1), AsBitset(*type2));
55 CHECK_EQ(AsClass(*type1), AsClass(*type2));
57 CHECK_EQ(AsConstant(*type1), AsConstant(*type2));
59 CHECK_EQ(AsUnion(*type1)->length(), AsUnion(*type2)->length());
61 CHECK(type1->Is(type2));
62 CHECK(type2->Is(type1));
66 static void CheckSub(Handle<Type> type1, Handle<Type> type2) {
67 CHECK(type1->Is(type2));
68 CHECK(!type2->Is(type1));
69 if (IsBitset(*type1) && IsBitset(*type2)) {
70 CHECK_NE(AsBitset(*type1), AsBitset(*type2));
75 static void CheckUnordered(Handle<Type> type1, Handle<Type> type2) {
76 CHECK(!type1->Is(type2));
77 CHECK(!type2->Is(type1));
78 if (IsBitset(*type1) && IsBitset(*type2)) {
79 CHECK_NE(AsBitset(*type1), AsBitset(*type2));
84 static void CheckOverlap(Handle<Type> type1, Handle<Type> type2) {
85 CHECK(type1->Maybe(type2));
86 CHECK(type2->Maybe(type1));
87 if (IsBitset(*type1) && IsBitset(*type2)) {
88 CHECK_NE(0, AsBitset(*type1) & AsBitset(*type2));
93 static void CheckDisjoint(Handle<Type> type1, Handle<Type> type2) {
94 CHECK(!type1->Is(type2));
95 CHECK(!type2->Is(type1));
96 CHECK(!type1->Maybe(type2));
97 CHECK(!type2->Maybe(type1));
98 if (IsBitset(*type1) && IsBitset(*type2)) {
99 CHECK_EQ(0, AsBitset(*type1) & AsBitset(*type2));
181 Handle<Type> Union(Handle<Type> type1, Handle<Type> type2) {
182 return handle(Type::Union(type1, type2), isolate_);
184 Handle<Type> Intersect(Handle<Type> type1, Handle<Type> type2) {
185 return handle(Type::Intersect(type1, type2), isolate_);