Split Distributivity test

test/cctest/test-types.cc

 // Copyright 2013 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 1707 matching lines @@
     CheckEqual(
         T.Intersect(
             T.Union(
                 T.Union(T.ObjectConstant2, T.ObjectConstant1), T.ArrayClass),
             T.Union(
                 T.ObjectConstant1,
                 T.Union(T.ArrayConstant, T.ObjectConstant2))),
         T.Union(T.ObjectConstant2, T.ObjectConstant1));
   }
 
-  void Distributivity() {
+  void Distributivity1() {
     // Distributivity:
     // Union(T1, Intersect(T2, T3)) = Intersect(Union(T1, T2), Union(T1, T3))
     for (TypeIterator it1 = T.types.begin(); it1 != T.types.end(); ++it1) {
       for (TypeIterator it2 = T.types.begin(); it2 != T.types.end(); ++it2) {
         for (TypeIterator it3 = T.types.begin(); it3 != T.types.end(); ++it3) {
           TypeHandle type1 = *it1;
           TypeHandle type2 = *it2;
           TypeHandle type3 = *it3;
           TypeHandle union12 = T.Union(type1, type2);
           TypeHandle union13 = T.Union(type1, type3);
           TypeHandle intersect23 = T.Intersect(type2, type3);
           TypeHandle union1_23 = T.Union(type1, intersect23);
           TypeHandle intersect12_13 = T.Intersect(union12, union13);
           CHECK(Equal(union1_23, intersect12_13));
         }
       }
     }
+  }
 
+  void Distributivity2() {
     // Distributivity:
     // Intersect(T1, Union(T2, T3)) = Union(Intersect(T1, T2), Intersect(T1,T3))
     for (TypeIterator it1 = T.types.begin(); it1 != T.types.end(); ++it1) {
       for (TypeIterator it2 = T.types.begin(); it2 != T.types.end(); ++it2) {
         for (TypeIterator it3 = T.types.begin(); it3 != T.types.end(); ++it3) {
           TypeHandle type1 = *it1;
           TypeHandle type2 = *it2;
           TypeHandle type3 = *it3;
           TypeHandle intersect12 = T.Intersect(type1, type2);
           TypeHandle intersect13 = T.Intersect(type1, type3);
@@ skipping 135 matching lines @@
 }
 
 
 TEST(Intersect2) {
   CcTest::InitializeVM();
   ZoneTests().Intersect2();
   HeapTests().Intersect2();
 }
 
 
-TEST(Distributivity) {
+TEST(Distributivity1) {
   CcTest::InitializeVM();
-  ZoneTests().Distributivity();
-  HeapTests().Distributivity();
+  ZoneTests().Distributivity1();
+  HeapTests().Distributivity1();
 }
 
 
+TEST(Distributivity2) {
+  CcTest::InitializeVM();
+  ZoneTests().Distributivity2();
+  HeapTests().Distributivity2();
+}
+
+
 TEST(Convert) {
   CcTest::InitializeVM();
   ZoneTests().Convert<HeapType, Handle<HeapType>, Isolate, HeapRep>();
   HeapTests().Convert<Type, Type*, Zone, ZoneRep>();
 }