Expose a lower bound of malloc'd memory via heap statistics

test/cctest/compiler/test-node.cc

 // Copyright 2013 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include <functional>
 
 #include "src/compiler/graph.h"
 #include "src/compiler/node.h"
 #include "src/compiler/operator.h"
 #include "test/cctest/cctest.h"
@@ skipping 123 matching lines @@
 #define CHECK_INPUTS(node, ...)                                        \
   do {                                                                 \
     Node* __array[] = {__VA_ARGS__};                                   \
     int __size =                                                       \
         __array[0] != NONE ? static_cast<int>(arraysize(__array)) : 0; \
     CheckInputs(node, __array, __size);                                \
   } while (false)
 
 
 TEST(NodeUseIteratorReplaceUses) {
-  Zone zone;
+  base::AccountingAllocator allocator;
+  Zone zone(&allocator);
   Graph graph(&zone);
   Node* n0 = graph.NewNode(&dummy_operator0);
   Node* n1 = graph.NewNode(&dummy_operator1, n0);
   Node* n2 = graph.NewNode(&dummy_operator1, n0);
   Node* n3 = graph.NewNode(&dummy_operator0);
 
   CHECK_USES(n0, n1, n2);
 
   CHECK_INPUTS(n1, n0);
   CHECK_INPUTS(n2, n0);
 
   n0->ReplaceUses(n3);
 
   CHECK_USES(n0, NONE);
   CHECK_USES(n1, NONE);
   CHECK_USES(n2, NONE);
   CHECK_USES(n3, n1, n2);
 
   CHECK_INPUTS(n1, n3);
   CHECK_INPUTS(n2, n3);
 }
 
 
 TEST(NodeUseIteratorReplaceUsesSelf) {
-  Zone zone;
+  base::AccountingAllocator allocator;
+  Zone zone(&allocator);
   Graph graph(&zone);
   Node* n0 = graph.NewNode(&dummy_operator0);
   Node* n1 = graph.NewNode(&dummy_operator1, n0);
 
   CHECK_USES(n0, n1);
   CHECK_USES(n1, NONE);
 
   n1->ReplaceInput(0, n1);  // Create self-reference.
 
   CHECK_USES(n0, NONE);
   CHECK_USES(n1, n1);
 
   Node* n2 = graph.NewNode(&dummy_operator0);
 
   n1->ReplaceUses(n2);
 
   CHECK_USES(n0, NONE);
   CHECK_USES(n1, NONE);
   CHECK_USES(n2, n1);
 }
 
 
 TEST(ReplaceInput) {
-  Zone zone;
+  base::AccountingAllocator allocator;
+  Zone zone(&allocator);
   Graph graph(&zone);
   Node* n0 = graph.NewNode(&dummy_operator0);
   Node* n1 = graph.NewNode(&dummy_operator0);
   Node* n2 = graph.NewNode(&dummy_operator0);
   Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2);
   Node* n4 = graph.NewNode(&dummy_operator0);
 
   CHECK_USES(n0, n3);
   CHECK_USES(n1, n3);
   CHECK_USES(n2, n3);
   CHECK_USES(n3, NONE);
   CHECK_USES(n4, NONE);
 
   CHECK_INPUTS(n3, n0, n1, n2);
 
   n3->ReplaceInput(1, n4);
 
   CHECK_USES(n1, NONE);
   CHECK_USES(n4, n3);
 
   CHECK_INPUTS(n3, n0, n4, n2);
 }
 
 
 TEST(OwnedBy) {
-  Zone zone;
+  base::AccountingAllocator allocator;
+  Zone zone(&allocator);
   Graph graph(&zone);
 
   {
     Node* n0 = graph.NewNode(&dummy_operator0);
     Node* n1 = graph.NewNode(&dummy_operator0);
 
     CHECK(!n0->OwnedBy(n1));
     CHECK(!n1->OwnedBy(n0));
 
     Node* n2 = graph.NewNode(&dummy_operator1, n0);
@@ skipping 29 matching lines @@
     CHECK(!n1->OwnedBy(n2));
     CHECK(!n2->OwnedBy(n0));
     CHECK(!n2->OwnedBy(n1));
     CHECK(n3->OwnedBy(n2));
     CHECK(!n2->OwnedBy(n3));
   }
 }
 
 
 TEST(Uses) {
-  Zone zone;
+  base::AccountingAllocator allocator;
+  Zone zone(&allocator);
   Graph graph(&zone);
 
   Node* n0 = graph.NewNode(&dummy_operator0);
   Node* n1 = graph.NewNode(&dummy_operator1, n0);
 
   CHECK_USES(n0, n1);
   CHECK_USES(n1, NONE);
 
   Node* n2 = graph.NewNode(&dummy_operator1, n0);
 
   CHECK_USES(n0, n1, n2);
   CHECK_USES(n2, NONE);
 
   Node* n3 = graph.NewNode(&dummy_operator1, n0);
 
   CHECK_USES(n0, n1, n2, n3);
   CHECK_USES(n3, NONE);
 }
 
 
 TEST(Inputs) {
-  Zone zone;
+  base::AccountingAllocator allocator;
+  Zone zone(&allocator);
   Graph graph(&zone);
 
   Node* n0 = graph.NewNode(&dummy_operator0);
   Node* n1 = graph.NewNode(&dummy_operator1, n0);
   Node* n2 = graph.NewNode(&dummy_operator1, n0);
   Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2);
 
   CHECK_INPUTS(n3, n0, n1, n2);
 
   Node* n4 = graph.NewNode(&dummy_operator3, n0, n1, n2);
   n3->AppendInput(graph.zone(), n4);
 
   CHECK_INPUTS(n3, n0, n1, n2, n4);
   CHECK_USES(n4, n3);
 
   n3->AppendInput(graph.zone(), n4);
 
   CHECK_INPUTS(n3, n0, n1, n2, n4, n4);
   CHECK_USES(n4, n3, n3);
 
   Node* n5 = graph.NewNode(&dummy_operator1, n4);
 
   CHECK_USES(n4, n3, n3, n5);
 }
 
 
 TEST(RemoveInput) {
-  Zone zone;
+  base::AccountingAllocator allocator;
+  Zone zone(&allocator);
   Graph graph(&zone);
 
   Node* n0 = graph.NewNode(&dummy_operator0);
   Node* n1 = graph.NewNode(&dummy_operator1, n0);
   Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
 
   CHECK_INPUTS(n0, NONE);
   CHECK_INPUTS(n1, n0);
   CHECK_INPUTS(n2, n0, n1);
   CHECK_USES(n0, n1, n2);
 
   n1->RemoveInput(0);
   CHECK_INPUTS(n1, NONE);
   CHECK_USES(n0, n2);
 
   n2->RemoveInput(0);
   CHECK_INPUTS(n2, n1);
   CHECK_USES(n0, NONE);
   CHECK_USES(n1, n2);
 
   n2->RemoveInput(0);
   CHECK_INPUTS(n2, NONE);
   CHECK_USES(n0, NONE);
   CHECK_USES(n1, NONE);
   CHECK_USES(n2, NONE);
 }
 
 
 TEST(AppendInputsAndIterator) {
-  Zone zone;
+  base::AccountingAllocator allocator;
+  Zone zone(&allocator);
   Graph graph(&zone);
 
   Node* n0 = graph.NewNode(&dummy_operator0);
   Node* n1 = graph.NewNode(&dummy_operator1, n0);
   Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
 
   CHECK_INPUTS(n0, NONE);
   CHECK_INPUTS(n1, n0);
   CHECK_INPUTS(n2, n0, n1);
   CHECK_USES(n0, n1, n2);
 
   Node* n3 = graph.NewNode(&dummy_operator0);
 
   n2->AppendInput(graph.zone(), n3);
 
   CHECK_INPUTS(n2, n0, n1, n3);
   CHECK_USES(n3, n2);
 }
 
 
 TEST(NullInputsSimple) {
-  Zone zone;
+  base::AccountingAllocator allocator;
+  Zone zone(&allocator);
   Graph graph(&zone);
 
   Node* n0 = graph.NewNode(&dummy_operator0);
   Node* n1 = graph.NewNode(&dummy_operator1, n0);
   Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
 
   CHECK_INPUTS(n0, NONE);
   CHECK_INPUTS(n1, n0);
   CHECK_INPUTS(n2, n0, n1);
   CHECK_USES(n0, n1, n2);
 
   n2->ReplaceInput(0, nullptr);
 
   CHECK_INPUTS(n2, NULL, n1);
 
   CHECK_USES(n0, n1);
 
   n2->ReplaceInput(1, nullptr);
 
   CHECK_INPUTS(n2, NULL, NULL);
 
   CHECK_USES(n1, NONE);
 }
 
 
 TEST(NullInputsAppended) {
-  Zone zone;
+  base::AccountingAllocator allocator;
+  Zone zone(&allocator);
   Graph graph(&zone);
 
   Node* n0 = graph.NewNode(&dummy_operator0);
   Node* n1 = graph.NewNode(&dummy_operator1, n0);
   Node* n2 = graph.NewNode(&dummy_operator1, n0);
   Node* n3 = graph.NewNode(&dummy_operator1, n0);
   n3->AppendInput(graph.zone(), n1);
   n3->AppendInput(graph.zone(), n2);
 
   CHECK_INPUTS(n3, n0, n1, n2);
   CHECK_USES(n0, n1, n2, n3);
   CHECK_USES(n1, n3);
   CHECK_USES(n2, n3);
 
   n3->ReplaceInput(1, NULL);
   CHECK_USES(n1, NONE);
 
   CHECK_INPUTS(n3, n0, NULL, n2);
 }
 
 
 TEST(ReplaceUsesFromAppendedInputs) {
-  Zone zone;
+  base::AccountingAllocator allocator;
+  Zone zone(&allocator);
   Graph graph(&zone);
 
   Node* n0 = graph.NewNode(&dummy_operator0);
   Node* n1 = graph.NewNode(&dummy_operator1, n0);
   Node* n2 = graph.NewNode(&dummy_operator1, n0);
   Node* n3 = graph.NewNode(&dummy_operator0);
 
   CHECK_INPUTS(n2, n0);
 
   n2->AppendInput(graph.zone(), n1);
   CHECK_INPUTS(n2, n0, n1);
   CHECK_USES(n1, n2);
 
   n2->AppendInput(graph.zone(), n0);
   CHECK_INPUTS(n2, n0, n1, n0);
   CHECK_USES(n1, n2);
   CHECK_USES(n0, n2, n1, n2);
 
   n0->ReplaceUses(n3);
 
   CHECK_USES(n0, NONE);
   CHECK_INPUTS(n2, n3, n1, n3);
   CHECK_USES(n3, n2, n1, n2);
 }
 
 
 TEST(ReplaceInputMultipleUses) {
-  Zone zone;
+  base::AccountingAllocator allocator;
+  Zone zone(&allocator);
   Graph graph(&zone);
 
   Node* n0 = graph.NewNode(&dummy_operator0);
   Node* n1 = graph.NewNode(&dummy_operator0);
   Node* n2 = graph.NewNode(&dummy_operator1, n0);
   n2->ReplaceInput(0, n1);
   CHECK_EQ(0, n0->UseCount());
   CHECK_EQ(1, n1->UseCount());
 
   Node* n3 = graph.NewNode(&dummy_operator1, n0);
   n3->ReplaceInput(0, n1);
   CHECK_EQ(0, n0->UseCount());
   CHECK_EQ(2, n1->UseCount());
 }
 
 
 TEST(TrimInputCountInline) {
-  Zone zone;
+  base::AccountingAllocator allocator;
+  Zone zone(&allocator);
   Graph graph(&zone);
 
   {
     Node* n0 = graph.NewNode(&dummy_operator0);
     Node* n1 = graph.NewNode(&dummy_operator1, n0);
     n1->TrimInputCount(1);
     CHECK_INPUTS(n1, n0);
     CHECK_USES(n0, n1);
   }
 
@@ skipping 47 matching lines @@
     Node* n0 = graph.NewNode(&dummy_operator0);
     Node* n2 = graph.NewNode(&dummy_operator2, n0, n0);
     n2->TrimInputCount(0);
     CHECK_INPUTS(n2, NONE);
     CHECK_USES(n0, NONE);
   }
 }
 
 
 TEST(TrimInputCountOutOfLine1) {
-  Zone zone;
+  base::AccountingAllocator allocator;
+  Zone zone(&allocator);
   Graph graph(&zone);
 
   {
     Node* n0 = graph.NewNode(&dummy_operator0);
     Node* n1 = graph.NewNode(&dummy_operator0);
     n1->AppendInput(graph.zone(), n0);
     CHECK_INPUTS(n1, n0);
     CHECK_USES(n0, n1);
 
     n1->TrimInputCount(1);
@@ skipping 73 matching lines @@
     CHECK_INPUTS(n2, n0, n0);
     CHECK_USES(n0, n2, n2);
     n2->TrimInputCount(0);
     CHECK_INPUTS(n2, NONE);
     CHECK_USES(n0, NONE);
   }
 }
 
 
 TEST(TrimInputCountOutOfLine2) {
-  Zone zone;
+  base::AccountingAllocator allocator;
+  Zone zone(&allocator);
   Graph graph(&zone);
 
   {
     Node* n0 = graph.NewNode(&dummy_operator0);
     Node* n1 = graph.NewNode(&dummy_operator0);
     Node* n2 = graph.NewNode(&dummy_operator1, n0);
     n2->AppendInput(graph.zone(), n1);
     CHECK_INPUTS(n2, n0, n1);
     n2->TrimInputCount(2);
     CHECK_INPUTS(n2, n0, n1);
@@ skipping 48 matching lines @@
     CHECK_EQ(2, n0->UseCount());
     n2->TrimInputCount(0);
     CHECK_EQ(0, n2->InputCount());
     CHECK_EQ(0, n0->UseCount());
     CHECK_EQ(0, n2->UseCount());
   }
 }
 
 
 TEST(NullAllInputs) {
-  Zone zone;
+  base::AccountingAllocator allocator;
+  Zone zone(&allocator);
   Graph graph(&zone);
 
   for (int i = 0; i < 2; i++) {
     Node* n0 = graph.NewNode(&dummy_operator0);
     Node* n1 = graph.NewNode(&dummy_operator1, n0);
     Node* n2;
     if (i == 0) {
       n2 = graph.NewNode(&dummy_operator2, n0, n1);
       CHECK_INPUTS(n2, n0, n1);
     } else {
@@ skipping 31 matching lines @@
 
     CHECK_INPUTS(n0, NONE);
     CHECK_INPUTS(n1, NULL);
     CHECK_USES(n0, NONE);
     CHECK_USES(n1, NONE);
   }
 }
 
 
 TEST(AppendAndTrim) {
-  Zone zone;
+  base::AccountingAllocator allocator;
+  Zone zone(&allocator);
   Graph graph(&zone);
 
   Node* nodes[] = {
       graph.NewNode(&dummy_operator0), graph.NewNode(&dummy_operator0),
       graph.NewNode(&dummy_operator0), graph.NewNode(&dummy_operator0),
       graph.NewNode(&dummy_operator0)};
 
   int max = static_cast<int>(arraysize(nodes));
 
   Node* last = graph.NewNode(&dummy_operator0);
@@ skipping 19 matching lines @@
       if (j >= i) CHECK_USES(nodes[j], NONE);
     }
 
     CHECK_USES(last, NONE);
   }
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8