Use C++11 alignment primitives

cc/base/contiguous_container_unittest.cc

 // 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.
 
 #include <stddef.h>
 
 #include <iterator>
 
 #include "cc/base/contiguous_container.h"
 #include "testing/gmock/include/gmock/gmock.h"
@@ skipping 198 matching lines @@
   list2.AllocateAndConstruct<Point2D>();
 
   // Same object was created in both lists, but their memory usages grew
   // differently, based on initial_size values lists were created with.
   EXPECT_NE(list1.MemoryUsageInBytes(), list2.MemoryUsageInBytes());
   EXPECT_GE(list1.MemoryUsageInBytes(), memory_usage1 + initial_size1);
   EXPECT_GE(list2.MemoryUsageInBytes(), memory_usage2 + initial_size2);
 }
 
 TEST(ContiguousContainerTest, Alignment) {
-  const size_t max_align = ALIGNOF(long double);
+  const size_t max_align = alignof(long double);
   ContiguousContainer<Point2D, max_align> list(kMaxPointSize);
 
   list.AllocateAndConstruct<Point2D>();
   EXPECT_EQ(0u, reinterpret_cast<intptr_t>(&list.last()) & (max_align - 1));
   list.AllocateAndConstruct<Point2D>();
   EXPECT_EQ(0u, reinterpret_cast<intptr_t>(&list.last()) & (max_align - 1));
   list.AllocateAndConstruct<Point3D>();
   EXPECT_EQ(0u, reinterpret_cast<intptr_t>(&list.last()) & (max_align - 1));
   list.AllocateAndConstruct<Point3D>();
   EXPECT_EQ(0u, reinterpret_cast<intptr_t>(&list.last()) & (max_align - 1));
   list.AllocateAndConstruct<Point2D>();
   EXPECT_EQ(0u, reinterpret_cast<intptr_t>(&list.last()) & (max_align - 1));
 }
 
 }  // namespace
 }  // namespace cc