Fix ListHashSet::AddResult storing a Node* instead of a ValueType*.

third_party/WebKit/Source/wtf/ListHashSet.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,
@@ skipping 69 matching lines @@
     typedef ListHashSetIterator<ListHashSet> iterator;
     typedef ListHashSetConstIterator<ListHashSet> const_iterator;
     friend class ListHashSetIterator<ListHashSet>;
     friend class ListHashSetConstIterator<ListHashSet>;
 
     typedef ListHashSetReverseIterator<ListHashSet> reverse_iterator;
     typedef ListHashSetConstReverseIterator<ListHashSet> const_reverse_iterator;
     friend class ListHashSetReverseIterator<ListHashSet>;
     friend class ListHashSetConstReverseIterator<ListHashSet>;
 
-    template <typename ValueType> struct HashTableAddResult final {
+    struct AddResult final {
         STACK_ALLOCATED();
-        HashTableAddResult(Node* storedValue, bool isNewEntry) : storedValue(storedValue), isNewEntry(isNewEntry) { }
-        Node* storedValue;
+        friend class ListHashSet<ValueArg, inlineCapacity, HashArg, AllocatorArg>;
+        AddResult(Node* node, bool isNewEntry)
+            : storedValue(&node->m_value)
+            , isNewEntry(isNewEntry)
+            , m_node(node) { }
+        ValueType* storedValue;
         bool isNewEntry;
+    private:
+        Node* m_node;
     };
-    typedef HashTableAddResult<ValueType> AddResult;
 
     ListHashSet();
     ListHashSet(const ListHashSet&);
     ListHashSet(ListHashSet&&);
     ListHashSet& operator=(const ListHashSet&);
     ListHashSet& operator=(ListHashSet&&);
     void finalize();
 
     void swap(ListHashSet&);
 
@@ skipping 727 matching lines @@
     // actually changes when it does allocations.
     auto result = m_impl.template add<BaseTranslator>(value, *this->allocator());
     if (result.isNewEntry)
         appendNode(*result.storedValue);
     return AddResult(*result.storedValue, result.isNewEntry);
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 typename ListHashSet<T, inlineCapacity, U, V>::iterator ListHashSet<T, inlineCapacity, U, V>::addReturnIterator(ValuePassInType value)
 {
-    return makeIterator(add(value).storedValue);
+    return makeIterator(add(value).m_node);
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 typename ListHashSet<T, inlineCapacity, U, V>::AddResult ListHashSet<T, inlineCapacity, U, V>::appendOrMoveToLast(ValuePassInType value)
 {
     createAllocatorIfNeeded();
     auto result = m_impl.template add<BaseTranslator>(value, *this->allocator());
     Node* node = *result.storedValue;
     if (!result.isNewEntry)
         unlink(node);
@@ skipping 178 matching lines @@
 struct NeedsTracing<ListHashSet<T, U, V>> {
     static const bool value = false;
 };
 #endif
 
 } // namespace WTF
 
 using WTF::ListHashSet;
 
 #endif // WTF_ListHashSet_h