| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2014 Google Inc. All rights reserved. | 2 * Copyright (C) 2014 Google Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 60 void addId(const AtomicString& id); | 60 void addId(const AtomicString& id); |
| 61 void addTagName(const AtomicString& tagName); | 61 void addTagName(const AtomicString& tagName); |
| 62 void addAttribute(const AtomicString& attributeLocalName); | 62 void addAttribute(const AtomicString& attributeLocalName); |
| 63 | 63 |
| 64 void setWholeSubtreeInvalid(); | 64 void setWholeSubtreeInvalid(); |
| 65 bool wholeSubtreeInvalid() const { return m_allDescendantsMightBeInvalid; } | 65 bool wholeSubtreeInvalid() const { return m_allDescendantsMightBeInvalid; } |
| 66 | 66 |
| 67 void setTreeBoundaryCrossing() { m_treeBoundaryCrossing = true; } | 67 void setTreeBoundaryCrossing() { m_treeBoundaryCrossing = true; } |
| 68 bool treeBoundaryCrossing() const { return m_treeBoundaryCrossing; } | 68 bool treeBoundaryCrossing() const { return m_treeBoundaryCrossing; } |
| 69 | 69 |
| 70 void setInsertionPointCrossing() { m_insertionPointCrossing = true; } |
| 71 bool insertionPointCrossing() const { return m_insertionPointCrossing; } |
| 72 |
| 70 void setCustomPseudoInvalid() { m_customPseudoInvalid = true; } | 73 void setCustomPseudoInvalid() { m_customPseudoInvalid = true; } |
| 71 bool customPseudoInvalid() const { return m_customPseudoInvalid; } | 74 bool customPseudoInvalid() const { return m_customPseudoInvalid; } |
| 72 | 75 |
| 73 bool isEmpty() const { return !m_classes && !m_ids && !m_tagNames && !m_attr
ibutes; } | 76 bool isEmpty() const { return !m_classes && !m_ids && !m_tagNames && !m_attr
ibutes; } |
| 74 | 77 |
| 75 void trace(Visitor*); | 78 void trace(Visitor*); |
| 76 | 79 |
| 77 #ifndef NDEBUG | 80 #ifndef NDEBUG |
| 78 void show() const; | 81 void show() const; |
| 79 #endif | 82 #endif |
| (...skipping 13 matching lines...) Expand all Loading... |
| 93 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString> > m_attributes; | 96 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString> > m_attributes; |
| 94 | 97 |
| 95 // If true, all descendants might be invalidated, so a full subtree recalc i
s required. | 98 // If true, all descendants might be invalidated, so a full subtree recalc i
s required. |
| 96 unsigned m_allDescendantsMightBeInvalid : 1; | 99 unsigned m_allDescendantsMightBeInvalid : 1; |
| 97 | 100 |
| 98 // If true, all descendants which are custom pseudo elements must be invalid
ated. | 101 // If true, all descendants which are custom pseudo elements must be invalid
ated. |
| 99 unsigned m_customPseudoInvalid : 1; | 102 unsigned m_customPseudoInvalid : 1; |
| 100 | 103 |
| 101 // If true, the invalidation must traverse into ShadowRoots with this set. | 104 // If true, the invalidation must traverse into ShadowRoots with this set. |
| 102 unsigned m_treeBoundaryCrossing : 1; | 105 unsigned m_treeBoundaryCrossing : 1; |
| 106 |
| 107 // If true, insertion point descendants must be invalidated. |
| 108 unsigned m_insertionPointCrossing : 1; |
| 103 }; | 109 }; |
| 104 | 110 |
| 105 } // namespace blink | 111 } // namespace blink |
| 106 | 112 |
| 107 #endif // DescendantInvalidationSet_h | 113 #endif // DescendantInvalidationSet_h |
| OLD | NEW |