Make HeapObjectHeader::checkHeader private.

third_party/WebKit/Source/platform/heap/TraceTraits.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 TraceTraits_h
 #define TraceTraits_h
 
 #include "platform/heap/GCInfo.h"
 #include "platform/heap/Heap.h"
 #include "platform/heap/StackFrameDepth.h"
@@ skipping 189 matching lines @@
   template <typename VisitorDispatcher>
   static void mark(VisitorDispatcher visitor, const T* t) {
     AdjustAndMarkTrait<T>::mark(visitor, t);
   }
 
  private:
   static const T* ToWrapperTracingType(const void* t) {
     static_assert(!NeedsAdjustAndMark<T>::value,
                   "wrapper tracing is not supported within mixins");
 #if DCHECK_IS_ON()
-    HeapObjectHeader::fromPayload(t)->checkHeader();
+    // |fromPayload| checks the integrity of the |HeapObjectHeader|.
+    (void)HeapObjectHeader::fromPayload(t);
 #endif
     return reinterpret_cast<const T*>(t);
   }
 };
 
 template <typename T>
 class TraceTrait<const T> : public TraceTrait<T> {};
 
 template <typename T>
 void TraceTrait<T>::trace(Visitor* visitor, void* self) {
@@ skipping 281 matching lines @@
 
     // This trace method is instantiated for vectors where
     // IsTraceableInCollectionTrait<Traits>::value is false, but the trace
     // method should not be called. Thus we cannot static-assert
     // IsTraceableInCollectionTrait<Traits>::value but should runtime-assert it.
     DCHECK(IsTraceableInCollectionTrait<Traits>::value);
 
     T* array = reinterpret_cast<T*>(self);
     blink::HeapObjectHeader* header =
         blink::HeapObjectHeader::fromPayload(self);
-    header->checkHeader();
     // Use the payload size as recorded by the heap to determine how many
     // elements to trace.
     size_t length = header->payloadSize() / sizeof(T);
 #ifdef ANNOTATE_CONTIGUOUS_CONTAINER
     // As commented above, HeapVectorBacking can trace unused slots
     // (which are already zeroed out).
     ANNOTATE_CHANGE_SIZE(array, length, 0, length);
 #endif
     if (std::is_polymorphic<T>::value) {
       char* pointer = reinterpret_cast<char*>(array);
@@ skipping 27 matching lines @@
   template <typename VisitorDispatcher>
   static bool trace(VisitorDispatcher visitor, void* self) {
     static_assert(strongify == WTF::WeakPointersActStrong,
                   "An on-stack HeapHashTable needs to be visited strongly.");
 
     DCHECK(IsTraceableInCollectionTrait<Traits>::value ||
            Traits::weakHandlingFlag == WeakHandlingInCollections);
     Value* array = reinterpret_cast<Value*>(self);
     blink::HeapObjectHeader* header =
         blink::HeapObjectHeader::fromPayload(self);
-    header->checkHeader();
     // Use the payload size as recorded by the heap to determine how many
     // elements to trace.
     size_t length = header->payloadSize() / sizeof(Value);
     for (size_t i = 0; i < length; ++i) {
       if (!HashTableHelper<
               Value, typename Table::ExtractorType,
               typename Table::KeyTraitsType>::isEmptyOrDeletedBucket(array[i]))
         blink::TraceCollectionIfEnabled<
             IsTraceableInCollectionTrait<Traits>::value,
             Traits::weakHandlingFlag, strongify, Value,
@@ skipping 33 matching lines @@
   using Node =
       ListHashSetNode<NodeContents,
                       blink::HeapListHashSetAllocator<T, inlineCapacity>>;
   using Table = HashTable<Node*, U, V, W, X, Y, blink::HeapAllocator>;
 
   template <typename VisitorDispatcher>
   static bool trace(VisitorDispatcher visitor, void* self) {
     Node** array = reinterpret_cast<Node**>(self);
     blink::HeapObjectHeader* header =
         blink::HeapObjectHeader::fromPayload(self);
-    header->checkHeader();
     size_t length = header->payloadSize() / sizeof(Node*);
     for (size_t i = 0; i < length; ++i) {
       if (!HashTableHelper<Node*, typename Table::ExtractorType,
                            typename Table::KeyTraitsType>::
               isEmptyOrDeletedBucket(array[i])) {
         traceListHashSetValue(visitor, array[i]->m_value);
         // Just mark the node without tracing because we already traced
         // the contents, and there is no need to trace the next and
         // prev fields since iterating over the hash table backing will
         // find the whole chain.
@@ skipping 156 matching lines @@
     // since iterating over the hash table backing will find the whole
     // chain.
     visitor->markNoTracing(node);
     return false;
   }
 };
 
 }  // namespace WTF
 
 #endif