| 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 20 matching lines...) Expand all Loading... |
| 31 #include "config.h" | 31 #include "config.h" |
| 32 #include "core/css/invalidation/DescendantInvalidationSet.h" | 32 #include "core/css/invalidation/DescendantInvalidationSet.h" |
| 33 | 33 |
| 34 #include "core/css/resolver/StyleResolver.h" | 34 #include "core/css/resolver/StyleResolver.h" |
| 35 #include "core/dom/Element.h" | 35 #include "core/dom/Element.h" |
| 36 | 36 |
| 37 namespace WebCore { | 37 namespace WebCore { |
| 38 | 38 |
| 39 DescendantInvalidationSet::DescendantInvalidationSet() | 39 DescendantInvalidationSet::DescendantInvalidationSet() |
| 40 : m_allDescendantsMightBeInvalid(false) | 40 : m_allDescendantsMightBeInvalid(false) |
| 41 , m_customPseudoInvalid(false) |
| 41 { | 42 { |
| 42 } | 43 } |
| 43 | 44 |
| 44 void DescendantInvalidationSet::combine(const DescendantInvalidationSet& other) | 45 void DescendantInvalidationSet::combine(const DescendantInvalidationSet& other) |
| 45 { | 46 { |
| 46 // No longer bother combining data structures, since the whole subtree is de
emed invalid. | 47 // No longer bother combining data structures, since the whole subtree is de
emed invalid. |
| 47 if (wholeSubtreeInvalid()) | 48 if (wholeSubtreeInvalid()) |
| 48 return; | 49 return; |
| 49 | 50 |
| 50 if (other.wholeSubtreeInvalid()) { | 51 if (other.wholeSubtreeInvalid()) { |
| 51 setWholeSubtreeInvalid(); | 52 setWholeSubtreeInvalid(); |
| 52 return; | 53 return; |
| 53 } | 54 } |
| 54 | 55 |
| 56 if (other.customPseudoInvalid()) |
| 57 setCustomPseudoInvalid(); |
| 58 |
| 55 if (other.m_classes) { | 59 if (other.m_classes) { |
| 56 HashSet<AtomicString>::const_iterator end = other.m_classes->end(); | 60 HashSet<AtomicString>::const_iterator end = other.m_classes->end(); |
| 57 for (HashSet<AtomicString>::const_iterator it = other.m_classes->begin()
; it != end; ++it) | 61 for (HashSet<AtomicString>::const_iterator it = other.m_classes->begin()
; it != end; ++it) |
| 58 addClass(*it); | 62 addClass(*it); |
| 59 } | 63 } |
| 60 | 64 |
| 61 if (other.m_ids) { | 65 if (other.m_ids) { |
| 62 HashSet<AtomicString>::const_iterator end = other.m_ids->end(); | 66 HashSet<AtomicString>::const_iterator end = other.m_ids->end(); |
| 63 for (HashSet<AtomicString>::const_iterator it = other.m_ids->begin(); it
!= end; ++it) | 67 for (HashSet<AtomicString>::const_iterator it = other.m_ids->begin(); it
!= end; ++it) |
| 64 addId(*it); | 68 addId(*it); |
| (...skipping 90 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 155 return; | 159 return; |
| 156 | 160 |
| 157 m_allDescendantsMightBeInvalid = true; | 161 m_allDescendantsMightBeInvalid = true; |
| 158 m_classes = nullptr; | 162 m_classes = nullptr; |
| 159 m_ids = nullptr; | 163 m_ids = nullptr; |
| 160 m_tagNames = nullptr; | 164 m_tagNames = nullptr; |
| 161 m_attributes = nullptr; | 165 m_attributes = nullptr; |
| 162 } | 166 } |
| 163 | 167 |
| 164 } // namespace WebCore | 168 } // namespace WebCore |
| OLD | NEW |