Move cc::DisplayItemList and related classes into cc/paint/

cc/base/contiguous_container.h

 // Copyright 2015 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 CC_BASE_CONTIGUOUS_CONTAINER_H_
 #define CC_BASE_CONTIGUOUS_CONTAINER_H_
 
 #include <stddef.h>
 
 #include <memory>
 #include <utility>
 #include <vector>
 
 #include "base/compiler_specific.h"
 #include "base/logging.h"
 #include "base/macros.h"
-#include "cc/base/cc_export.h"
+#include "cc/base/base_export.h"
 
 namespace cc {
 
 // ContiguousContainer is a container which stores a list of heterogeneous
 // objects (in particular, of varying sizes), packed next to one another in
 // memory. Objects are never relocated, so it is safe to store pointers to them
 // for the lifetime of the container (unless the object is removed).
 //
 // Memory is allocated in a series of buffers (with exponential growth). When an
 // object is allocated, it is given only the space it requires (possibly with
 // enough padding to preserve alignment), rather than the maximum possible size.
 // This allows small and large objects to coexist without wasting much space.
 //
 // Since it stores pointers to all of the objects it allocates in a vector, it
 // supports efficient iteration and indexing. However, for mutation the
 // supported operations are limited to appending to, and removing from, the end
 // of the list.
 //
 // Clients should instantiate ContiguousContainer; ContiguousContainerBase is an
 // artifact of the implementation.
 
-class CC_EXPORT ContiguousContainerBase {
+class CC_BASE_EXPORT ContiguousContainerBase {
  protected:
   explicit ContiguousContainerBase(size_t max_object_size);
   ContiguousContainerBase(size_t max_object_size, size_t initial_size_bytes);
   ~ContiguousContainerBase();
 
   size_t size() const { return elements_.size(); }
   bool empty() const { return !size(); }
   size_t GetCapacityInBytes() const;
   size_t UsedCapacityInBytes() const;
   size_t MemoryUsageInBytes() const;
@@ skipping 131 matching lines @@
     DCHECK_EQ(aligned_size % alignment, 0u);
     DCHECK_GE(aligned_size, size);
     DCHECK_LT(aligned_size, size + alignment);
     return aligned_size;
   }
 };
 
 }  // namespace cc
 
 #endif  // CC_BASE_CONTIGUOUS_CONTAINER_H_