Fix some m_instVar instances in wtf/

third_party/WebKit/Source/platform/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.
  *
@@ skipping 394 matching lines @@
     return HashFunctions::Equal(a.value_, b.value_);
   }
   template <typename IncomingValueType>
   static void Translate(Node& location,
                         IncomingValueType&& key,
                         NodeBase* anchor) {
     anchor->InsertBefore(location);
     location.value_ = std::forward<IncomingValueType>(key);
   }
 
-  // Empty (or deleted) slots have the m_next pointer set to null, but we
+  // Empty (or deleted) slots have the next_ pointer set to null, but we
   // don't do anything to the other fields, which may contain junk.
   // Therefore you can't compare a newly constructed empty value with a
   // slot and get the right answer.
   static const bool safe_to_compare_to_empty_or_deleted = false;
 };
 
 template <typename Value, typename Allocator>
 struct LinkedHashSetExtractor {
   STATIC_ONLY(LinkedHashSetExtractor);
   static const Value& Extract(const LinkedHashSetNode<Value, Allocator>& node) {
     return node.value_;
   }
 };
 
 template <typename Value, typename ValueTraitsArg, typename Allocator>
 struct LinkedHashSetTraits
     : public SimpleClassHashTraits<LinkedHashSetNode<Value, Allocator>> {
   STATIC_ONLY(LinkedHashSetTraits);
   typedef LinkedHashSetNode<Value, Allocator> Node;
   typedef ValueTraitsArg ValueTraits;
 
-  // The slot is empty when the m_next field is zero so it's safe to zero
+  // The slot is empty when the next_ field is zero so it's safe to zero
   // the backing.
   static const bool kEmptyValueIsZero = true;
 
   static const bool kHasIsEmptyValueFunction = true;
   static bool IsEmptyValue(const Node& node) { return !node.next_; }
 
   static const int kDeletedValue = -1;
 
   static void ConstructDeletedValue(Node& slot, bool) {
     slot.next_ = reinterpret_cast<Node*>(kDeletedValue);
@@ skipping 238 matching lines @@
 }
 
 template <typename T, typename U, typename V, typename W>
 inline void LinkedHashSet<T, U, V, W>::Swap(LinkedHashSet& other) {
   impl_.swap(other.impl_);
   SwapAnchor(anchor_, other.anchor_);
 }
 
 template <typename T, typename U, typename V, typename Allocator>
 inline LinkedHashSet<T, U, V, Allocator>::~LinkedHashSet() {
-  // The destructor of m_anchor will implicitly be called here, which will
+  // The destructor of anchor_ will implicitly be called here, which will
   // unlink the anchor from the collection.
 }
 
 template <typename T, typename U, typename V, typename W>
 inline T& LinkedHashSet<T, U, V, W>::front() {
   DCHECK(!IsEmpty());
   return FirstNode()->value_;
 }
 
 template <typename T, typename U, typename V, typename W>
 inline const T& LinkedHashSet<T, U, V, W>::front() const {
   DCHECK(!IsEmpty());
-  return FirstNode()->m_value;
+  return FirstNode()->value_;
 }
 
 template <typename T, typename U, typename V, typename W>
 inline void LinkedHashSet<T, U, V, W>::RemoveFirst() {
   DCHECK(!IsEmpty());
   impl_.erase(static_cast<Node*>(anchor_.next_));
 }
 
 template <typename T, typename U, typename V, typename W>
 inline T& LinkedHashSet<T, U, V, W>::back() {
   DCHECK(!IsEmpty());
   return LastNode()->value_;
 }
 
 template <typename T, typename U, typename V, typename W>
 inline const T& LinkedHashSet<T, U, V, W>::back() const {
   DCHECK(!IsEmpty());
-  return LastNode()->m_value;
+  return LastNode()->value_;
 }
 
 template <typename T, typename U, typename V, typename W>
 inline void LinkedHashSet<T, U, V, W>::pop_back() {
   DCHECK(!IsEmpty());
   impl_.erase(static_cast<Node*>(anchor_.prev_));
 }
 
 template <typename T, typename U, typename V, typename W>
 inline typename LinkedHashSet<T, U, V, W>::iterator
@@ skipping 192 matching lines @@
   swap(static_cast<Base&>(a), static_cast<Base&>(b));
   swap(a.value_, b.value_);
   Allocator::LeaveGCForbiddenScope();
 }
 
 }  // namespace WTF
 
 using WTF::LinkedHashSet;
 
 #endif /* WTF_LinkedHashSet_h */