Index: Source/core/dom/Element.cpp |
diff --git a/Source/core/dom/Element.cpp b/Source/core/dom/Element.cpp |
index e619ef16315ae1a1456f24379b7a8bce9cafab9f..e73011b2c9270d7a651f539fda4246b3786c684c 100644 |
--- a/Source/core/dom/Element.cpp |
+++ b/Source/core/dom/Element.cpp |
@@ -3039,9 +3039,9 @@ void Element::clearHasPendingResources() |
struct PresentationAttributeCacheKey { |
PresentationAttributeCacheKey() : tagName(0) { } |
- AtomicStringImpl* tagName; |
+ StringImpl* tagName; |
// Only the values need refcounting. |
- Vector<pair<AtomicStringImpl*, AtomicString>, 3> attributesAndValues; |
+ Vector<pair<StringImpl*, AtomicString>, 3> attributesAndValues; |
}; |
struct PresentationAttributeCacheEntry { |
@@ -3261,7 +3261,7 @@ void Element::addSubresourceAttributeURLs(ListHashSet<KURL>& urls) const |
inlineStyle->addSubresourceStyleURLs(urls, document()->elementSheet()->contents()); |
} |
-static inline bool attributeNameSort(const pair<AtomicStringImpl*, AtomicString>& p1, const pair<AtomicStringImpl*, AtomicString>& p2) |
+static inline bool attributeNameSort(const pair<StringImpl*, AtomicString>& p1, const pair<StringImpl*, AtomicString>& p2) |
{ |
// Sort based on the attribute name pointers. It doesn't matter what the order is as long as it is always the same. |
return p1.first < p2.first; |