Oilpan: introduce eager finalization.

Source/platform/heap/ThreadState.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
@@ skipping 126 matching lines @@
 //
 // To create a new typed heap add a H(<ClassName>) to the
 // FOR_EACH_TYPED_HEAP macro below.
 #define FOR_EACH_TYPED_HEAP(H)              \
     H(Node)                                 \
     H(CSSValue)
 
 #define TypedHeapEnumName(Type) Type##HeapIndex,
 
 enum HeapIndices {
-    NormalPage1HeapIndex = 0,
+    EagerSweepHeapIndex = 0,
+    NormalPage1HeapIndex,
     NormalPage2HeapIndex,
     NormalPage3HeapIndex,
     NormalPage4HeapIndex,
-    EagerSweepHeapIndex,
     Vector1HeapIndex,
     Vector2HeapIndex,
     Vector3HeapIndex,
     Vector4HeapIndex,
     InlineVectorHeapIndex,
     HashTableHeapIndex,
     FOR_EACH_TYPED_HEAP(TypedHeapEnumName)
     LargeObjectHeapIndex,
     // Values used for iteration of heap segments.
     NumberOfHeaps,
 };
 
+#if defined(ADDRESS_SANITIZER)
+// Heaps can have their object payloads be poisoned, or cleared
+// of their poisoning.
+enum Poisoning {
+    SetPoison,
+    ClearPoison,
+};
+
+enum ObjectsToPoison {
+    UnmarkedOnly,
+    MarkedAndUnmarked,
+};
+#endif
+
 #if ENABLE(GC_PROFILING)
 const size_t numberOfGenerationsToTrack = 8;
 const size_t maxHeapObjectAge = numberOfGenerationsToTrack - 1;
 
 struct AgeCounts {
     int ages[numberOfGenerationsToTrack];
     AgeCounts() { std::fill(ages, ages + numberOfGenerationsToTrack, 0); }
 };
 typedef HashMap<String, AgeCounts> ClassAgeCountsMap;
 #endif
@@ skipping 465 matching lines @@
     // record that we should garbage collect the next time we return
     // to the event loop. If both return false, we don't need to
     // collect garbage at this point.
     bool shouldScheduleIdleGC();
     bool shouldSchedulePreciseGC();
     bool shouldForceConservativeGC();
     void runScheduledGC(StackState);
 
     void eagerSweep();
 
+#if defined(ADDRESS_SANITIZER)
+    void poisonEagerHeap(Poisoning);
+    void poisonAllHeaps();
+#endif
+
     // When ThreadState is detaching from non-main thread its
     // heap is expected to be empty (because it is going away).
     // Perform registered cleanup tasks and garbage collection
     // to sweep away any objects that are left on this heap.
     // We assert that nothing must remain after this cleanup.
     // If assertion does not hold we crash as we are potentially
     // in the dangling pointer situation.
     void cleanup();
     void cleanupPages();
 
@@ skipping 85 matching lines @@
 };
 
 template<> class ThreadStateFor<AnyThread> {
 public:
     static ThreadState* state() { return ThreadState::current(); }
 };
 
 } // namespace blink
 
 #endif // ThreadState_h