Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 /* | |
| 2 * Copyright (C) 2014 Google Inc. All rights reserved. | |
| 3 * | |
| 4 * Redistribution and use in source and binary forms, with or without | |
| 5 * modification, are permitted provided that the following conditions are | |
| 6 * met: | |
| 7 * | |
| 8 * * Redistributions of source code must retain the above copyright | |
| 9 * notice, this list of conditions and the following disclaimer. | |
| 10 * * Redistributions in binary form must reproduce the above | |
| 11 * copyright notice, this list of conditions and the following disclaimer | |
| 12 * in the documentation and/or other materials provided with the | |
| 13 * distribution. | |
| 14 * * Neither the name of Google Inc. nor the names of its | |
| 15 * contributors may be used to endorse or promote products derived from | |
| 16 * this software without specific prior written permission. | |
| 17 * | |
| 18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| 19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| 20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 29 */ | |
| 30 | |
| 31 #include "config.h" | |
| 32 #include "core/css/analyzer/DescendantInvalidationSet.h" | |
| 33 | |
| 34 #include "core/css/resolver/StyleResolver.h" | |
| 35 #include "core/dom/Element.h" | |
| 36 | |
| 37 namespace WebCore { | |
| 38 | |
| 39 DescendantInvalidationSet::DescendantInvalidationSet() | |
| 40 : allDescendantsMightBeInvalid(false) | |
| 41 { | |
| 42 } | |
| 43 | |
| 44 void DescendantInvalidationSet::combine(const DescendantInvalidationSet& other) | |
| 45 { | |
| 46 HashSet<AtomicString>::const_iterator end = other.m_classes.end(); | |
| 47 for (HashSet<AtomicString>::const_iterator it = other.m_classes.begin(); it != end; ++it) | |
| 48 addClass(*it); | |
| 49 | |
| 50 end = other.m_ids.end(); | |
| 51 for (HashSet<AtomicString>::const_iterator it = other.m_ids.begin(); it != e nd; ++it) | |
| 52 addId(*it); | |
| 53 | |
| 54 end = other.m_tagNames.end(); | |
| 55 for (HashSet<AtomicString>::const_iterator it = other.m_tagNames.begin(); it != end; ++it) | |
| 56 addTagName(*it); | |
|
esprehn
2014/01/14 21:32:56
If allDescendantsMightBeInvalid is true we should
chrishtr
2014/01/14 23:33:00
Done.
| |
| 57 allDescendantsMightBeInvalid = allDescendantsMightBeInvalid || other.allDesc endantsMightBeInvalid; | |
| 58 } | |
| 59 | |
| 60 void DescendantInvalidationSet::invalidateElementSubtree(Element* element) | |
| 61 { | |
| 62 if (allDescendantsMightBeInvalid) { | |
|
esprehn
2014/01/14 21:32:56
Braces are not needed.
chrishtr
2014/01/14 23:33:00
Done.
| |
| 63 element->setNeedsStyleRecalc(SubtreeStyleChange); | |
| 64 } else { | |
| 65 invalidateElementSubtreeInternal(element); | |
| 66 } | |
| 67 } | |
| 68 | |
| 69 bool DescendantInvalidationSet::invalidateElementSubtreeInternal(Element* elemen t) | |
| 70 { | |
| 71 bool shouldRecalcThisElement = false; | |
| 72 | |
| 73 if (element->hasClass()) { | |
| 74 for (HashSet<AtomicString>::const_iterator it = m_classes.begin(); it != m_classes.end(); ++it) { | |
| 75 if (element->classNames().contains(*it)) { | |
|
esprehn
2014/01/14 21:32:56
Braces are not needed and this should be a return
chrishtr
2014/01/14 23:33:00
Done.
| |
| 76 shouldRecalcThisElement = true; | |
| 77 } | |
| 78 } | |
| 79 } | |
| 80 | |
| 81 if (m_tagNames.contains(element->tagQName().localName())) | |
| 82 shouldRecalcThisElement = true; | |
|
esprehn
2014/01/14 21:32:56
This function needs to be split and have an early
chrishtr
2014/01/14 23:33:00
Done.
| |
| 83 | |
| 84 if (element->hasID() && m_ids.contains(element->idForStyleResolution())) | |
| 85 shouldRecalcThisElement = true; | |
| 86 | |
| 87 for (Node* child = element->firstChild(); child; child = child->nextSibling( )) { | |
|
esprehn
2014/01/14 21:32:56
This doesn't handle ShadowRoots, but I think we al
chrishtr
2014/01/14 23:33:00
Done.
| |
| 88 if (child->isElementNode()) { | |
| 89 Element* childElement = toElement(child); | |
| 90 bool elementDidRecalc = invalidateElementSubtreeInternal(childElemen t); | |
| 91 shouldRecalcThisElement = shouldRecalcThisElement || elementDidRecal c; | |
| 92 } | |
| 93 } | |
|
esprehn
2014/01/14 21:32:56
This function needs to be split, you want
bool in
chrishtr
2014/01/14 23:33:00
Done.
| |
| 94 if (shouldRecalcThisElement) { | |
| 95 element->setNeedsStyleRecalc(LocalStyleChange); | |
| 96 } else if (element->supportsStyleSharing()) { | |
| 97 // FIXME: this doesn't really belong here. Style sharing needs to be cle anly separated | |
| 98 // somehow from style recalc invalidation. | |
| 99 element->document().ensureStyleResolver().addToStyleSharingList(*element ); | |
|
esprehn
2014/01/14 21:32:56
Remove this, you shouldn't be messing with the sty
chrishtr
2014/01/14 23:33:00
Done.
| |
| 100 } | |
| 101 | |
| 102 return shouldRecalcThisElement; | |
| 103 } | |
| 104 | |
| 105 void DescendantInvalidationSet::addClass(const AtomicString& className) | |
| 106 { | |
| 107 m_classes.add(className); | |
| 108 } | |
| 109 | |
| 110 void DescendantInvalidationSet::addId(const AtomicString& id) | |
| 111 { | |
| 112 m_ids.add(id); | |
| 113 } | |
| 114 | |
| 115 void DescendantInvalidationSet::addTagName(const AtomicString& tagName) | |
| 116 { | |
| 117 m_tagNames.add(tagName); | |
| 118 } | |
| 119 | |
| 120 } // namespace WebCore | |
| OLD | NEW |