Rename a few Member and Persistent methods to make the transition

Source/heap/Heap.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 1464 matching lines @@
 template<bool isWeak, bool markWeakMembersStrongly, typename Key, typename Value, typename Traits>
 struct CollectionBackingTraceTrait<true, isWeak, markWeakMembersStrongly, WTF::KeyValuePair<Key, Value>, Traits> : public BaseVisitKeyValuePairTrait<markWeakMembersStrongly, Key, Value, Traits> {
 };
 
 
 // TFX (member)
 template<bool markWeakMembersStrongly, typename T, typename Traits>
 struct CollectionBackingTraceTrait<true, false, markWeakMembersStrongly, Member<T>, Traits> {
     static void mark(WebCore::Visitor* visitor, Member<T> self)
     {
-        visitor->mark(self.raw());
+        visitor->mark(self.get());
     }
 };
 
 // FTT (weak member)
 template<typename T, typename Traits>
 struct CollectionBackingTraceTrait<false, true, true, WeakMember<T>, Traits> {
     static void mark(WebCore::Visitor* visitor, WeakMember<T> self)
     {
         // This can mark weak members as if they were strong. The reason we
         // need this is that we don't do weak processing unless we reach the
         // backing only through the hash table. Reaching it in any other way
         // makes it impossible to update the size and deleted slot count of the
         // table, and exposes us to weak processing during iteration issues.
-        visitor->mark(self.raw());
+        visitor->mark(self.get());
     }
 };
 
 // Catch-all for things that have a way to trace. For things that contain weak
 // pointers they will generally be visited weakly even if
 // markWeakMembersStrongly is true. This is what you want.
 template<bool isWeak, bool markWeakMembersStrongly, typename T, typename Traits>
 struct CollectionBackingTraceTrait<true, isWeak, markWeakMembersStrongly, T, Traits> {
     static void mark(WebCore::Visitor* visitor, T& t)
     {
@@ skipping 56 matching lines @@
 struct IfWeakMember;
 
 template<typename T>
 struct IfWeakMember {
     template<typename U>
     static bool isDead(Visitor*, const U&) { return false; }
 };
 
 template<typename T>
 struct IfWeakMember<WeakMember<T> > {
-    static bool isDead(Visitor* visitor, const WeakMember<T>& t) { return !visitor->isAlive(t.raw()); }
+    static bool isDead(Visitor* visitor, const WeakMember<T>& t) { return !visitor->isAlive(t.get()); }
 };
 
 template<typename K, typename V, typename HashFunctions, typename KeyTraits, typename ValueTraits>
 void processWeakOffHeapHashMap(Visitor* visitor, void* self)
 {
     typedef HashMap<K, V, WTF::DefaultAllocator, HashFunctions, KeyTraits, ValueTraits> Map;
     Map* map = reinterpret_cast<Map*>(self);
     // Collect up keys here because we can't modify a hash map while iterating
     // over it.
     Vector<K> deletionKeys;
@@ skipping 44 matching lines @@
 // to export. This forces it to export all the methods from ThreadHeap.
 template<> void ThreadHeap<FinalizedHeapObjectHeader>::addPageToHeap(const GCInfo*);
 template<> void ThreadHeap<HeapObjectHeader>::addPageToHeap(const GCInfo*);
 extern template class HEAP_EXPORT ThreadHeap<FinalizedHeapObjectHeader>;
 extern template class HEAP_EXPORT ThreadHeap<HeapObjectHeader>;
 #endif
 
 }
 
 #endif // Heap_h