Remove the dependency of Zone on Isolate

test/cctest/test-unique.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 125 matching lines @@
   CHECK(HO == HA);
   CHECK_EQ(*HO.handle(), *HA.handle());
 }
 
 
 TEST(UniqueSet_Add) {
   CcTest::InitializeVM();
   MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
   MAKE_UNIQUES_A_B_C;
 
-  Zone zone(isolate);
+  Zone zone;
 
   UniqueSet<String>* set = new(&zone) UniqueSet<String>();
 
   CHECK_EQ(0, set->size());
   set->Add(A, &zone);
   CHECK_EQ(1, set->size());
   set->Add(A, &zone);
   CHECK_EQ(1, set->size());
   set->Add(B, &zone);
   CHECK_EQ(2, set->size());
   set->Add(C, &zone);
   CHECK_EQ(3, set->size());
   set->Add(C, &zone);
   CHECK_EQ(3, set->size());
   set->Add(B, &zone);
   CHECK_EQ(3, set->size());
   set->Add(A, &zone);
   CHECK_EQ(3, set->size());
 }
 
 
 TEST(UniqueSet_Remove) {
   CcTest::InitializeVM();
   MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
   MAKE_UNIQUES_A_B_C;
 
-  Zone zone(isolate);
+  Zone zone;
 
   UniqueSet<String>* set = new(&zone) UniqueSet<String>();
 
   set->Add(A, &zone);
   set->Add(B, &zone);
   set->Add(C, &zone);
   CHECK_EQ(3, set->size());
 
   set->Remove(A);
   CHECK_EQ(2, set->size());
@@ skipping 19 matching lines @@
   CHECK(!set->Contains(B));
   CHECK(!set->Contains(C));
 }
 
 
 TEST(UniqueSet_Contains) {
   CcTest::InitializeVM();
   MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
   MAKE_UNIQUES_A_B_C;
 
-  Zone zone(isolate);
+  Zone zone;
 
   UniqueSet<String>* set = new(&zone) UniqueSet<String>();
 
   CHECK_EQ(0, set->size());
   set->Add(A, &zone);
   CHECK(set->Contains(A));
   CHECK(!set->Contains(B));
   CHECK(!set->Contains(C));
 
   set->Add(A, &zone);
@@ skipping 10 matching lines @@
   CHECK(set->Contains(B));
   CHECK(set->Contains(C));
 }
 
 
 TEST(UniqueSet_At) {
   CcTest::InitializeVM();
   MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
   MAKE_UNIQUES_A_B_C;
 
-  Zone zone(isolate);
+  Zone zone;
 
   UniqueSet<String>* set = new(&zone) UniqueSet<String>();
 
   CHECK_EQ(0, set->size());
   set->Add(A, &zone);
   CHECK(A == set->at(0));
 
   set->Add(A, &zone);
   CHECK(A == set->at(0));
 
@@ skipping 16 matching lines @@
   CHECK(expected == set1->Equals(set2));
   CHECK(expected == set2->Equals(set1));
 }
 
 
 TEST(UniqueSet_Equals) {
   CcTest::InitializeVM();
   MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
   MAKE_UNIQUES_A_B_C;
 
-  Zone zone(isolate);
+  Zone zone;
 
   UniqueSet<String>* set1 = new(&zone) UniqueSet<String>();
   UniqueSet<String>* set2 = new(&zone) UniqueSet<String>();
 
   CHECK_SETS(set1, set2, true);
 
   set1->Add(A, &zone);
 
   CHECK_SETS(set1, set2, false);
 
@@ skipping 17 matching lines @@
 
   CHECK_SETS(set1, set2, true);
 }
 
 
 TEST(UniqueSet_IsSubset1) {
   CcTest::InitializeVM();
   MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
   MAKE_UNIQUES_A_B_C;
 
-  Zone zone(isolate);
+  Zone zone;
 
   UniqueSet<String>* set1 = new(&zone) UniqueSet<String>();
   UniqueSet<String>* set2 = new(&zone) UniqueSet<String>();
 
   CHECK(set1->IsSubset(set2));
   CHECK(set2->IsSubset(set1));
 
   set1->Add(A, &zone);
 
   CHECK(!set1->IsSubset(set2));
@@ skipping 14 matching lines @@
   CHECK(set1->IsSubset(set2));
   CHECK(set2->IsSubset(set1));
 }
 
 
 TEST(UniqueSet_IsSubset2) {
   CcTest::InitializeVM();
   MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
   MAKE_UNIQUES_A_B_C_D_E_F_G;
 
-  Zone zone(isolate);
+  Zone zone;
 
   UniqueSet<String>* set1 = new(&zone) UniqueSet<String>();
   UniqueSet<String>* set2 = new(&zone) UniqueSet<String>();
 
   set1->Add(A, &zone);
   set1->Add(C, &zone);
   set1->Add(E, &zone);
 
   set2->Add(A, &zone);
   set2->Add(B, &zone);
@@ skipping 22 matching lines @@
 }
 
 
 TEST(UniqueSet_IsSubsetExhaustive) {
   const int kSetSize = 6;
 
   CcTest::InitializeVM();
   MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
   MAKE_UNIQUES_A_B_C_D_E_F_G;
 
-  Zone zone(isolate);
+  Zone zone;
 
   Unique<String> elements[] = {
     A, B, C, D, E, F, G
   };
 
   // Exhaustively test all sets with <= 6 elements.
   for (int i = 0; i < (1 << kSetSize); i++) {
     for (int j = 0; j < (1 << kSetSize); j++) {
       UniqueSet<String>* set1 = MakeSet(&zone, i, elements);
       UniqueSet<String>* set2 = MakeSet(&zone, j, elements);
 
       CHECK(((i & j) == i) == set1->IsSubset(set2));
     }
   }
 }
 
 
 TEST(UniqueSet_Intersect1) {
   CcTest::InitializeVM();
   MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
   MAKE_UNIQUES_A_B_C;
 
-  Zone zone(isolate);
+  Zone zone;
 
   UniqueSet<String>* set1 = new(&zone) UniqueSet<String>();
   UniqueSet<String>* set2 = new(&zone) UniqueSet<String>();
   UniqueSet<String>* result;
 
   CHECK(set1->IsSubset(set2));
   CHECK(set2->IsSubset(set1));
 
   set1->Add(A, &zone);
 
@@ skipping 20 matching lines @@
 }
 
 
 TEST(UniqueSet_IntersectExhaustive) {
   const int kSetSize = 6;
 
   CcTest::InitializeVM();
   MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
   MAKE_UNIQUES_A_B_C_D_E_F_G;
 
-  Zone zone(isolate);
+  Zone zone;
 
   Unique<String> elements[] = {
     A, B, C, D, E, F, G
   };
 
   // Exhaustively test all sets with <= 6 elements.
   for (int i = 0; i < (1 << kSetSize); i++) {
     for (int j = 0; j < (1 << kSetSize); j++) {
       UniqueSet<String>* set1 = MakeSet(&zone, i, elements);
       UniqueSet<String>* set2 = MakeSet(&zone, j, elements);
 
       UniqueSet<String>* result = set1->Intersect(set2, &zone);
       UniqueSet<String>* expected = MakeSet(&zone, i & j, elements);
 
       CHECK(result->Equals(expected));
       CHECK(expected->Equals(result));
     }
   }
 }
 
 
 TEST(UniqueSet_Union1) {
   CcTest::InitializeVM();
   MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
   MAKE_UNIQUES_A_B_C;
 
-  Zone zone(isolate);
+  Zone zone;
 
   UniqueSet<String>* set1 = new(&zone) UniqueSet<String>();
   UniqueSet<String>* set2 = new(&zone) UniqueSet<String>();
   UniqueSet<String>* result;
 
   CHECK(set1->IsSubset(set2));
   CHECK(set2->IsSubset(set1));
 
   set1->Add(A, &zone);
 
@@ skipping 20 matching lines @@
 }
 
 
 TEST(UniqueSet_UnionExhaustive) {
   const int kSetSize = 6;
 
   CcTest::InitializeVM();
   MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
   MAKE_UNIQUES_A_B_C_D_E_F_G;
 
-  Zone zone(isolate);
+  Zone zone;
 
   Unique<String> elements[] = {
     A, B, C, D, E, F, G
   };
 
   // Exhaustively test all sets with <= 6 elements.
   for (int i = 0; i < (1 << kSetSize); i++) {
     for (int j = 0; j < (1 << kSetSize); j++) {
       UniqueSet<String>* set1 = MakeSet(&zone, i, elements);
       UniqueSet<String>* set2 = MakeSet(&zone, j, elements);
 
       UniqueSet<String>* result = set1->Union(set2, &zone);
       UniqueSet<String>* expected = MakeSet(&zone, i | j, elements);
 
       CHECK(result->Equals(expected));
       CHECK(expected->Equals(result));
     }
   }
 }