Oilpan: Remove most WillBe types from the code base

third_party/WebKit/Source/core/html/parser/HTMLElementStack.h

 /*
  * Copyright (C) 2010 Google, Inc. All Rights Reserved.
  * Copyright (C) 2011 Apple 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:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
@@ skipping 31 matching lines @@
 
 // NOTE: The HTML5 spec uses a backwards (grows downward) stack.  We're using
 // more standard (grows upwards) stack terminology here.
 class HTMLElementStack {
     WTF_MAKE_NONCOPYABLE(HTMLElementStack);
     DISALLOW_NEW();
 public:
     HTMLElementStack();
     ~HTMLElementStack();
 
-    class ElementRecord final : public NoBaseWillBeGarbageCollected<ElementRecord> {
-        WTF_MAKE_NONCOPYABLE(ElementRecord); USING_FAST_MALLOC_WILL_BE_REMOVED(ElementRecord);
+    class ElementRecord final : public GarbageCollected<ElementRecord> {
+        WTF_MAKE_NONCOPYABLE(ElementRecord);
     public:
 #if !ENABLE(OILPAN)
         ~ElementRecord(); // Public for ~PassOwnPtr()
 #endif
 
         Element* element() const { return m_item->element(); }
         ContainerNode* node() const { return m_item->node(); }
         const AtomicString& namespaceURI() const { return m_item->namespaceURI(); }
-        PassRefPtrWillBeRawPtr<HTMLStackItem> stackItem() const { return m_item; }
-        void replaceElement(PassRefPtrWillBeRawPtr<HTMLStackItem>);
+        RawPtr<HTMLStackItem> stackItem() const { return m_item; }
+        void replaceElement(RawPtr<HTMLStackItem>);
 
         bool isAbove(ElementRecord*) const;
 
         ElementRecord* next() const { return m_next.get(); }
 
         DECLARE_TRACE();
     private:
         friend class HTMLElementStack;
 
-        ElementRecord(PassRefPtrWillBeRawPtr<HTMLStackItem>, PassOwnPtrWillBeRawPtr<ElementRecord>);
+        ElementRecord(RawPtr<HTMLStackItem>, RawPtr<ElementRecord>);
 
-        PassOwnPtrWillBeRawPtr<ElementRecord> releaseNext() { return m_next.release(); }
-        void setNext(PassOwnPtrWillBeRawPtr<ElementRecord> next) { m_next = next; }
+        RawPtr<ElementRecord> releaseNext() { return m_next.release(); }
+        void setNext(RawPtr<ElementRecord> next) { m_next = next; }
 
-        RefPtrWillBeMember<HTMLStackItem> m_item;
-        OwnPtrWillBeMember<ElementRecord> m_next;
+        Member<HTMLStackItem> m_item;
+        Member<ElementRecord> m_next;
     };
 
     unsigned stackDepth() const { return m_stackDepth; }
 
     // Inlining this function is a (small) performance win on the parsing
     // benchmark.
     Element* top() const
     {
         ASSERT(m_top->element());
         return m_top->element();
@@ skipping 10 matching lines @@
         ASSERT(m_top->stackItem());
         return m_top->stackItem().get();
     }
 
     HTMLStackItem* oneBelowTop() const;
     ElementRecord* topRecord() const;
     ElementRecord* find(Element*) const;
     ElementRecord* furthestBlockForFormattingElement(Element*) const;
     ElementRecord* topmost(const AtomicString& tagName) const;
 
-    void insertAbove(PassRefPtrWillBeRawPtr<HTMLStackItem>, ElementRecord*);
+    void insertAbove(RawPtr<HTMLStackItem>, ElementRecord*);
 
-    void push(PassRefPtrWillBeRawPtr<HTMLStackItem>);
-    void pushRootNode(PassRefPtrWillBeRawPtr<HTMLStackItem>);
-    void pushHTMLHtmlElement(PassRefPtrWillBeRawPtr<HTMLStackItem>);
-    void pushHTMLHeadElement(PassRefPtrWillBeRawPtr<HTMLStackItem>);
-    void pushHTMLBodyElement(PassRefPtrWillBeRawPtr<HTMLStackItem>);
+    void push(RawPtr<HTMLStackItem>);
+    void pushRootNode(RawPtr<HTMLStackItem>);
+    void pushHTMLHtmlElement(RawPtr<HTMLStackItem>);
+    void pushHTMLHeadElement(RawPtr<HTMLStackItem>);
+    void pushHTMLBodyElement(RawPtr<HTMLStackItem>);
 
     void pop();
     void popUntil(const AtomicString& tagName);
     void popUntil(Element*);
     void popUntilPopped(const AtomicString& tagName);
     void popUntilPopped(const QualifiedName& tagName) { popUntilPopped(tagName.localName()); }
 
     void popUntilPopped(Element*);
     void popUntilNumberedHeaderElementPopped();
     void popUntilTableScopeMarker(); // "clear the stack back to a table context" in the spec.
@@ skipping 36 matching lines @@
 
     ContainerNode* rootNode() const;
 
     DECLARE_TRACE();
 
 #ifndef NDEBUG
     void show();
 #endif
 
 private:
-    void pushCommon(PassRefPtrWillBeRawPtr<HTMLStackItem>);
-    void pushRootNodeCommon(PassRefPtrWillBeRawPtr<HTMLStackItem>);
+    void pushCommon(RawPtr<HTMLStackItem>);
+    void pushRootNodeCommon(RawPtr<HTMLStackItem>);
     void popCommon();
     void removeNonTopCommon(Element*);
 
-    OwnPtrWillBeMember<ElementRecord> m_top;
+    Member<ElementRecord> m_top;
 
     // We remember the root node, <head> and <body> as they are pushed. Their
     // ElementRecords keep them alive. The root node is never popped.
     // FIXME: We don't currently require type-specific information about
     // these elements so we haven't yet bothered to plumb the types all the
     // way down through createElement, etc.
-    RawPtrWillBeMember<ContainerNode> m_rootNode;
-    RawPtrWillBeMember<Element> m_headElement;
-    RawPtrWillBeMember<Element> m_bodyElement;
+    Member<ContainerNode> m_rootNode;
+    Member<Element> m_headElement;
+    Member<Element> m_bodyElement;
     unsigned m_stackDepth;
 };
 
 WILL_NOT_BE_EAGERLY_TRACED_CLASS(HTMLElementStack::ElementRecord);
 
 } // namespace blink
 
 #endif // HTMLElementStack_h