Various ASan exemptions to allow Oilpan pre-sweep poisoning of unmarkeds.

Source/wtf/LinkedHashSet.h

 /*
  * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights reserved.
  * Copyright (C) 2011, Benjamin Poulain <ikipou@gmail.com>
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
  * This library is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  * Library General Public License for more details.
  *
  * You should have received a copy of the GNU Library General Public License
  * along with this library; see the file COPYING.LIB.  If not, write to
  * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
  * Boston, MA 02110-1301, USA.
  *
  */
 
 #ifndef WTF_LinkedHashSet_h
 #define WTF_LinkedHashSet_h
 
+#include "platform/heap/AddressSanitizer.h"
 #include "wtf/DefaultAllocator.h"
 #include "wtf/HashSet.h"
 #include "wtf/OwnPtr.h"
 #include "wtf/PassOwnPtr.h"
 
 namespace WTF {
 
 // LinkedHashSet: Just like HashSet, this class provides a Set
 // interface - a collection of unique objects with O(1) insertion,
 // removal and test for containership. However, it also has an
@@ skipping 11 matching lines @@
 template<typename LinkedHashSet> class LinkedHashSetConstReverseIterator;
 
 template<typename Value, typename HashFunctions, typename Allocator> struct LinkedHashSetTranslator;
 template<typename Value, typename Allocator> struct LinkedHashSetExtractor;
 template<typename Value, typename ValueTraits, typename Allocator> struct LinkedHashSetTraits;
 
 class LinkedHashSetNodeBase {
 public:
     LinkedHashSetNodeBase() : m_prev(this), m_next(this) { }
 
+    NO_SANITIZE_ADDRESS

[haraken, 2015/05/01 15:12:32]

This looks valid.

     void unlink()
     {
         if (!m_next)
             return;
         ASSERT(m_prev);
         ASSERT(m_next->m_prev == this);
         ASSERT(m_prev->m_next == this);
         m_next->m_prev = m_prev;
         m_prev->m_next = m_next;
     }
@@ skipping 670 matching lines @@
 struct NeedsTracing<LinkedHashSet<T, U, V>> {
     static const bool value = false;
 };
 #endif
 
 }
 
 using WTF::LinkedHashSet;
 
 #endif /* WTF_LinkedHashSet_h */