Remove base's ALIGNOF/ALIGNAS in favor of alignof/alignas.

content/renderer/devtools/lock_free_circular_queue.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 CONTENT_RENDERER_DEVTOOLS_LOCK_FREE_CIRCULAR_QUEUE_H_
 #define CONTENT_RENDERER_DEVTOOLS_LOCK_FREE_CIRCULAR_QUEUE_H_
 
 #include <stddef.h>
 
 #include "base/atomicops.h"
 #include "base/macros.h"
 #include "base/memory/aligned_memory.h"
 
-#define CACHELINE_ALIGNED ALIGNAS(64)
+#define CACHELINE_ALIGNED alignas(64)
 
 namespace content {
 
 MSVC_PUSH_DISABLE_WARNING(4324)  // structure was padded due to align
 
 // Lock-free cache-friendly sampling circular queue for large
 // records. Intended for fast transfer of large records between a
 // single producer and a single consumer. If the queue is full,
 // StartEnqueue will return nullptr. The queue is designed with
 // a goal in mind to evade cache lines thrashing by preventing
@@ skipping 93 matching lines @@
     Entry* entry) {
   Entry* next = entry + 1;
   if (next == &buffer_[L])
     return buffer_;
   return next;
 }
 
 template <typename T, unsigned L>
 void* LockFreeCircularQueue<T, L>::operator new(size_t size) {
   typedef LockFreeCircularQueue<T, L> QueueTypeAlias;
-  return base::AlignedAlloc(size, ALIGNOF(QueueTypeAlias));
+  return base::AlignedAlloc(size, alignof(QueueTypeAlias));
 }
 
 template <typename T, unsigned L>
 void LockFreeCircularQueue<T, L>::operator delete(void* ptr) {
   base::AlignedFree(ptr);
 }
 
 }  // namespace content
 
 #endif  // CONTENT_RENDERER_DEVTOOLS_LOCK_FREE_CIRCULAR_QUEUE_H_