Add fast path for querySelector(All)

Source/core/dom/SelectorQuery.h

Index: Source/core/dom/SelectorQuery.h
diff --git a/Source/core/dom/SelectorQuery.h b/Source/core/dom/SelectorQuery.h
index 22063039ce3aeae1625aa9acfc91a051fe1a7dc1..2e3bbe47a2bc5f55d7407abbfc4b25b486e300d3 100644
--- a/Source/core/dom/SelectorQuery.h
+++ b/Source/core/dom/SelectorQuery.h
@@ -40,6 +40,8 @@ class Document;
 class Element;
 class Node;
 class NodeList;
+class SimpleNodeList;
+class SpaceSplitString;
 
 class SelectorDataList {
 public:
@@ -55,10 +57,18 @@ private:
         bool isFastCheckable;
     };
 
+    bool canUseFastQuery(Node* rootNode) const;
     bool selectorMatches(const SelectorData&, Element*, const Node*) const;
-    std::pair<bool, Node*> findTraverseRoot(Node* traverseRoot) const;
-    template <bool firstMatchOnly>
-    void execute(Node* rootNode, Vector<RefPtr<Node> >&) const;
+    void collectElementsByClassName(Node* rootNode, const AtomicString& className, Vector<RefPtr<Node> >&) const;
+    Element* findElementByClassName(Node* rootNode, const AtomicString& className) const;
+    void collectElementsByTagName(Node* rootNode, const QualifiedName& tagName, Vector<RefPtr<Node> >&) const;
+    Element* findElementByTagName(Node* rootNode, const QualifiedName& tagName) const;
+    PassOwnPtr<SimpleNodeList> findTraverseRoots(Node* rootNode, bool& matchTraverseRoots) const;
+    void executeSlowQueryAll(Node* rootNode, Vector<RefPtr<Node> >& matchedElements) const;
+    void executeQueryAll(Node* rootNode, Vector<RefPtr<Node> >& matchedElements) const;
+    Node* findTraverseRoot(Node* rootNode, bool& matchTraverseRoot) const;
+    Element* executeSlowQueryFirst(Node* rootNode) const;
+    Element* executeQueryFirst(Node* rootNode) const;
 
     Vector<SelectorData> m_selectors;
 };