Move Partition Allocator into Chromium base.

base/allocator/partition_allocator/partitions.h

-/*
- * Copyright (C) 2013 Google Inc. 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 with the
- * distribution.
- *     * Neither the name of Google Inc. nor the names of its
- * contributors may be used to endorse or promote products derived from
- * this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
+// Copyright (c) 2013 The Chromium Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
 
-#ifndef Partitions_h
-#define Partitions_h
+#ifndef BASE_ALLOCATOR_PARTITION_ALLOCATOR_PARTITIONS_H
+#define BASE_ALLOCATOR_PARTITION_ALLOCATOR_PARTITIONS_H
 
-#include "wtf/WTF.h"
-#include "wtf/WTFExport.h"
-#include "wtf/allocator/PartitionAlloc.h"
 #include <string.h>
 
-namespace WTF {
+#include "base/allocator/partition_allocator/partition_alloc.h"
+#include "base/base_export.h"
 
-class WTF_EXPORT Partitions {
+namespace base {
+
+class BASE_EXPORT Partitions {
  public:
   typedef void (*ReportPartitionAllocSizeFunction)(size_t);
 
   // Name of allocator used by tracing for marking sub-allocations while take
   // memory snapshots.
   static const char* const kAllocatedObjectPoolName;
 
   static void initialize(ReportPartitionAllocSizeFunction);
   static void shutdown();
   ALWAYS_INLINE static PartitionRootGeneric* bufferPartition() {

[haraken, 2016/11/22 03:55:11]

These methods are Blink-specific things, so I'd keep them in wtf/.

Note that core/ and modules/ are not allowed to depend on base/, so we anyway
need a thin abstraction layer in wtf/ (which is the Partitions class).

[palmer, 2016/11/24 01:05:56]

Done.

-    ASSERT(s_initialized);
+    DCHECK(s_initialized);
     return m_bufferAllocator.root();
   }
 
   ALWAYS_INLINE static PartitionRootGeneric* fastMallocPartition() {
-    ASSERT(s_initialized);
+    DCHECK(s_initialized);
     return m_fastMallocAllocator.root();
   }
 
   ALWAYS_INLINE static PartitionRoot* nodePartition() {
-    ASSERT_NOT_REACHED();
+    NOTREACHED();
     return nullptr;
   }
   ALWAYS_INLINE static PartitionRoot* layoutPartition() {
-    ASSERT(s_initialized);
+    DCHECK(s_initialized);
     return m_layoutAllocator.root();
   }
 
   static size_t currentDOMMemoryUsage() {
-    ASSERT(s_initialized);
-    ASSERT_NOT_REACHED();
+    DCHECK(s_initialized);
+    NOTREACHED();
     return 0;
   }
 
   static size_t totalSizeOfCommittedPages() {
     size_t totalSize = 0;
     totalSize += m_fastMallocAllocator.root()->totalSizeOfCommittedPages;
     totalSize += m_bufferAllocator.root()->totalSizeOfCommittedPages;
     totalSize += m_layoutAllocator.root()->totalSizeOfCommittedPages;
     return totalSize;
   }
@@ skipping 31 matching lines @@
     return partitionReallocGeneric(Partitions::fastMallocPartition(), p, n,
                                    typeName);
   }
   static void fastFree(void* p) {
     partitionFreeGeneric(Partitions::fastMallocPartition(), p);
   }
 
   static void handleOutOfMemory();
 
  private:
-  static SpinLock s_initializationLock;
+  static subtle::SpinLock s_initializationLock;
   static bool s_initialized;
 
   // We have the following four partitions.
   //   - LayoutObject partition: A partition to allocate LayoutObjects.
   //     We prepare a dedicated partition for LayoutObjects because they
   //     are likely to be a source of use-after-frees. Another reason
   //     is for performance: As LayoutObjects are guaranteed to only be used
   //     by the main thread, we can bypass acquiring a lock. Also we can
   //     improve memory locality by putting LayoutObjects together.
   //   - Buffer partition: A partition to allocate objects that have a strong
   //     risk where the length and/or the contents are exploited from user
   //     scripts. Vectors, HashTables, ArrayBufferContents and Strings are
   //     allocated in the buffer partition.
   //   - Fast malloc partition: A partition to allocate all other objects.
   static PartitionAllocatorGeneric m_fastMallocAllocator;
   static PartitionAllocatorGeneric m_bufferAllocator;
   static SizeSpecificPartitionAllocator<1024> m_layoutAllocator;
   static ReportPartitionAllocSizeFunction m_reportSizeFunction;
 };
 
-}  // namespace WTF
+}  // namespace base
 
-#endif  // Partitions_h
+#endif  // BASE_ALLOCATOR_PARTITION_ALLOCATOR_PARTITIONS_H