OLD | NEW |
(Empty) | |
| 1 // Copyright 2015 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. |
| 4 |
| 5 #include "config.h" |
| 6 #include "core/css/RuleFeature.h" |
| 7 |
| 8 #include "core/css/CSSSelectorList.h" |
| 9 #include "core/css/RuleSet.h" |
| 10 #include "core/css/StylePropertySet.h" |
| 11 #include "core/css/StyleRule.h" |
| 12 #include "core/css/invalidation/InvalidationSet.h" |
| 13 #include "core/css/parser/CSSParser.h" |
| 14 #include "core/dom/ElementTraversal.h" |
| 15 #include "core/html/HTMLBodyElement.h" |
| 16 #include "core/html/HTMLDocument.h" |
| 17 #include "core/html/HTMLElement.h" |
| 18 #include "core/html/HTMLHtmlElement.h" |
| 19 #include <gtest/gtest.h> |
| 20 |
| 21 namespace blink { |
| 22 |
| 23 class RuleFeatureSetTest : public ::testing::Test { |
| 24 public: |
| 25 RuleFeatureSetTest() |
| 26 { |
| 27 } |
| 28 |
| 29 void SetUp() |
| 30 { |
| 31 m_document = HTMLDocument::create(); |
| 32 RefPtrWillBeRawPtr<HTMLHtmlElement> html = HTMLHtmlElement::create(*m_do
cument); |
| 33 html->appendChild(HTMLBodyElement::create(*m_document)); |
| 34 m_document->appendChild(html.release()); |
| 35 |
| 36 m_document->body()->setInnerHTML("<b><i></i></b>", ASSERT_NO_EXCEPTION); |
| 37 } |
| 38 |
| 39 void updateInvalidationSets(const String& selectorText) |
| 40 { |
| 41 CSSSelectorList selectorList; |
| 42 CSSParser::parseSelector(strictCSSParserContext(), selectorText, selecto
rList); |
| 43 |
| 44 RefPtrWillBeRawPtr<StyleRule> styleRule = StyleRule::create(selectorList
, MutableStylePropertySet::create(HTMLStandardMode)); |
| 45 RuleData ruleData(styleRule.get(), 0, 0, RuleHasNoSpecialState); |
| 46 m_ruleFeatureSet.updateInvalidationSets(ruleData); |
| 47 } |
| 48 |
| 49 void collectInvalidationSetsForClass(InvalidationLists& invalidationLists, c
onst AtomicString& className) const |
| 50 { |
| 51 Element* element = Traversal<HTMLElement>::firstChild(*Traversal<HTMLEle
ment>::firstChild(*m_document->body())); |
| 52 m_ruleFeatureSet.collectInvalidationSetsForClass(invalidationLists, *ele
ment, className); |
| 53 } |
| 54 |
| 55 WillBeHeapHashSet<AtomicString>& classSet(InvalidationSet& invalidationSet) |
| 56 { |
| 57 ASSERT(invalidationSet.m_classes); |
| 58 return *invalidationSet.m_classes; |
| 59 } |
| 60 |
| 61 void expectNoInvalidation(InvalidationSetVector& invalidationSets) |
| 62 { |
| 63 EXPECT_EQ(0u, invalidationSets.size()); |
| 64 } |
| 65 |
| 66 void expectSelfInvalidation(InvalidationSetVector& invalidationSets) |
| 67 { |
| 68 EXPECT_EQ(1u, invalidationSets.size()); |
| 69 EXPECT_TRUE(invalidationSets[0]->invalidatesSelf()); |
| 70 } |
| 71 |
| 72 void expectClassInvalidation(const AtomicString& className, InvalidationSetV
ector& invalidationSets) |
| 73 { |
| 74 EXPECT_EQ(1u, invalidationSets.size()); |
| 75 WillBeHeapHashSet<AtomicString> classes = classSet(*invalidationSets[0])
; |
| 76 EXPECT_EQ(1u, classes.size()); |
| 77 EXPECT_TRUE(classes.contains(className)); |
| 78 } |
| 79 |
| 80 void expectSiblingInvalidation(unsigned maxDirectAdjacentSelectors, const At
omicString& siblingName, InvalidationSetVector& invalidationSets) |
| 81 { |
| 82 EXPECT_EQ(1u, invalidationSets.size()); |
| 83 WillBeHeapHashSet<AtomicString> classes = classSet(*invalidationSets[0])
; |
| 84 EXPECT_EQ(1u, classes.size()); |
| 85 EXPECT_TRUE(classes.contains(siblingName)); |
| 86 EXPECT_EQ(maxDirectAdjacentSelectors, invalidationSets[0]->maxDirectAdja
centSelectors()); |
| 87 } |
| 88 |
| 89 void expectSiblingDescendantInvalidation(unsigned maxDirectAdjacentSelectors
, const AtomicString& siblingName, const AtomicString& descendantName, Invalidat
ionSetVector& invalidationSets) |
| 90 { |
| 91 EXPECT_EQ(1u, invalidationSets.size()); |
| 92 WillBeHeapHashSet<AtomicString> classes = classSet(*invalidationSets[0])
; |
| 93 EXPECT_EQ(1u, classes.size()); |
| 94 EXPECT_TRUE(classes.contains(siblingName)); |
| 95 EXPECT_EQ(maxDirectAdjacentSelectors, invalidationSets[0]->maxDirectAdja
centSelectors()); |
| 96 |
| 97 WillBeHeapHashSet<AtomicString> descendantClasses = classSet(invalidatio
nSets[0]->ensureDescendantInvalidationSet()); |
| 98 EXPECT_EQ(1u, descendantClasses.size()); |
| 99 EXPECT_TRUE(descendantClasses.contains(descendantName)); |
| 100 } |
| 101 |
| 102 void expectClassesInvalidation(const AtomicString& firstClassName, const Ato
micString& secondClassName, InvalidationSetVector& invalidationSets) |
| 103 { |
| 104 EXPECT_EQ(1u, invalidationSets.size()); |
| 105 WillBeHeapHashSet<AtomicString> classes = classSet(*invalidationSets[0])
; |
| 106 EXPECT_EQ(2u, classes.size()); |
| 107 EXPECT_TRUE(classes.contains(firstClassName)); |
| 108 EXPECT_TRUE(classes.contains(secondClassName)); |
| 109 } |
| 110 |
| 111 DEFINE_INLINE_TRACE() |
| 112 { |
| 113 #if ENABLE(OILPAN) |
| 114 visitor->trace(m_ruleFeatureSet); |
| 115 visitor->trace(m_document); |
| 116 #endif |
| 117 } |
| 118 |
| 119 private: |
| 120 RuleFeatureSet m_ruleFeatureSet; |
| 121 RefPtrWillBePersistent<Document> m_document; |
| 122 }; |
| 123 |
| 124 TEST_F(RuleFeatureSetTest, interleavedDescendantSibling1) |
| 125 { |
| 126 updateInvalidationSets(".p"); |
| 127 |
| 128 InvalidationLists invalidationLists; |
| 129 collectInvalidationSetsForClass(invalidationLists, "p"); |
| 130 expectSelfInvalidation(invalidationLists.descendants); |
| 131 expectNoInvalidation(invalidationLists.siblings); |
| 132 } |
| 133 |
| 134 TEST_F(RuleFeatureSetTest, interleavedDescendantSibling2) |
| 135 { |
| 136 updateInvalidationSets(".o + .p"); |
| 137 |
| 138 InvalidationLists invalidationLists; |
| 139 collectInvalidationSetsForClass(invalidationLists, "o"); |
| 140 expectNoInvalidation(invalidationLists.descendants); |
| 141 expectSiblingInvalidation(1, "p", invalidationLists.siblings); |
| 142 } |
| 143 |
| 144 TEST_F(RuleFeatureSetTest, interleavedDescendantSibling3) |
| 145 { |
| 146 updateInvalidationSets(".n .o + .p"); |
| 147 |
| 148 InvalidationLists invalidationLists; |
| 149 collectInvalidationSetsForClass(invalidationLists, "n"); |
| 150 expectClassInvalidation("p", invalidationLists.descendants); |
| 151 expectNoInvalidation(invalidationLists.siblings); |
| 152 } |
| 153 |
| 154 TEST_F(RuleFeatureSetTest, interleavedDescendantSibling4) |
| 155 { |
| 156 updateInvalidationSets(".m + .n .o + .p"); |
| 157 |
| 158 InvalidationLists invalidationLists; |
| 159 collectInvalidationSetsForClass(invalidationLists, "m"); |
| 160 expectNoInvalidation(invalidationLists.descendants); |
| 161 expectSiblingDescendantInvalidation(1, "n", "p", invalidationLists.siblings)
; |
| 162 } |
| 163 |
| 164 TEST_F(RuleFeatureSetTest, interleavedDescendantSibling5) |
| 165 { |
| 166 updateInvalidationSets(".l ~ .m + .n .o + .p"); |
| 167 |
| 168 InvalidationLists invalidationLists; |
| 169 collectInvalidationSetsForClass(invalidationLists, "l"); |
| 170 expectNoInvalidation(invalidationLists.descendants); |
| 171 expectSiblingDescendantInvalidation(std::numeric_limits<unsigned>::max(), "n
", "p", invalidationLists.siblings); |
| 172 } |
| 173 |
| 174 TEST_F(RuleFeatureSetTest, interleavedDescendantSibling6) |
| 175 { |
| 176 updateInvalidationSets(".k > .l ~ .m + .n .o + .p"); |
| 177 |
| 178 InvalidationLists invalidationLists; |
| 179 collectInvalidationSetsForClass(invalidationLists, "k"); |
| 180 expectClassInvalidation("p", invalidationLists.descendants); |
| 181 expectNoInvalidation(invalidationLists.siblings); |
| 182 } |
| 183 |
| 184 |
| 185 TEST_F(RuleFeatureSetTest, anySibling) |
| 186 { |
| 187 updateInvalidationSets(":-webkit-any(.q, .r) ~ .s .t"); |
| 188 |
| 189 InvalidationLists invalidationLists; |
| 190 collectInvalidationSetsForClass(invalidationLists, "q"); |
| 191 expectNoInvalidation(invalidationLists.descendants); |
| 192 expectSiblingDescendantInvalidation(std::numeric_limits<unsigned>::max(), "s
", "t", invalidationLists.siblings); |
| 193 } |
| 194 |
| 195 TEST_F(RuleFeatureSetTest, any) |
| 196 { |
| 197 updateInvalidationSets(":-webkit-any(.w, .x)"); |
| 198 |
| 199 InvalidationLists invalidationLists; |
| 200 collectInvalidationSetsForClass(invalidationLists, "w"); |
| 201 expectSelfInvalidation(invalidationLists.descendants); |
| 202 expectNoInvalidation(invalidationLists.siblings); |
| 203 } |
| 204 |
| 205 TEST_F(RuleFeatureSetTest, siblingAny) |
| 206 { |
| 207 updateInvalidationSets(".v ~ :-webkit-any(.w, .x)"); |
| 208 |
| 209 InvalidationLists invalidationLists; |
| 210 collectInvalidationSetsForClass(invalidationLists, "v"); |
| 211 expectNoInvalidation(invalidationLists.descendants); |
| 212 expectClassesInvalidation("w", "x", invalidationLists.siblings); |
| 213 } |
| 214 |
| 215 TEST_F(RuleFeatureSetTest, descendantSiblingAny) |
| 216 { |
| 217 updateInvalidationSets(".u .v ~ :-webkit-any(.w, .x)"); |
| 218 |
| 219 InvalidationLists invalidationLists; |
| 220 collectInvalidationSetsForClass(invalidationLists, "u"); |
| 221 expectClassesInvalidation("w", "x", invalidationLists.descendants); |
| 222 expectNoInvalidation(invalidationLists.siblings); |
| 223 } |
| 224 |
| 225 } // namespace blink |
OLD | NEW |