summaryrefslogtreecommitdiffstats
path: root/Source/WebKit/android/jni/WebViewCore.cpp
diff options
context:
space:
mode:
authorNaiem Shaik <snaiem@codeaurora.org>2012-07-19 10:45:56 -0700
committerSteve Kondik <shade@chemlab.org>2013-01-20 18:38:33 -0800
commit0f5d4355d7a384679722338d55f65bbb92350cfc (patch)
treedf4a638aa4e81152ee68f0d523ed706128a251ff /Source/WebKit/android/jni/WebViewCore.cpp
parent8f6cf525ead3381029545c1d292c8586ec45ddb0 (diff)
downloadexternal_webkit-0f5d4355d7a384679722338d55f65bbb92350cfc.zip
external_webkit-0f5d4355d7a384679722338d55f65bbb92350cfc.tar.gz
external_webkit-0f5d4355d7a384679722338d55f65bbb92350cfc.tar.bz2
DOM Optimizations
DOM traversal optimizations DOM Core optimizations Prefetch optimization for DOM Tree Traversal Conflicts: Source/WebKit/android/jni/WebViewCore.cpp Change-Id: Icbb8a7229ee9cff1a5401b57c8181f18b9a6d6e0
Diffstat (limited to 'Source/WebKit/android/jni/WebViewCore.cpp')
-rw-r--r--Source/WebKit/android/jni/WebViewCore.cpp6
1 files changed, 3 insertions, 3 deletions
diff --git a/Source/WebKit/android/jni/WebViewCore.cpp b/Source/WebKit/android/jni/WebViewCore.cpp
index 5f3390b..23bd873 100644
--- a/Source/WebKit/android/jni/WebViewCore.cpp
+++ b/Source/WebKit/android/jni/WebViewCore.cpp
@@ -1,6 +1,6 @@
/*
* Copyright 2006, The Android Open Source Project
- * Copyright (C) 2011, 2012 Code Aurora Forum. All rights reserved.
+ * Copyright (C) 2011, 2012 The Linux Foundation All rights reserved.
* Copyright (C) 2012 Sony Ericsson Mobile Communications AB.
* Copyright (C) 2012 Sony Mobile Communications AB
*
@@ -2576,7 +2576,7 @@ Node* WebViewCore::getNextAnchorNode(Node* anchorNode, bool ignoreFirstNode, int
|| isContentInputElement(currentNode))
return currentNode;
if (direction == DIRECTION_FORWARD)
- currentNode = currentNode->traverseNextNode();
+ currentNode = currentNode->traverseNextNodeFastPath();
else
currentNode = currentNode->traversePreviousNodePostOrder(body);
}
@@ -2698,7 +2698,7 @@ Node* WebViewCore::getIntermediaryInputElement(Node* fromNode, Node* toNode, int
while (currentNode && currentNode != toNode) {
if (isContentInputElement(currentNode))
return currentNode;
- currentNode = currentNode->traverseNextNode();
+ currentNode = currentNode->traverseNextNodeFastPath();
}
} else {
Node* currentNode = fromNode->traversePreviousNode();