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 175 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
186 void DescendantInvalidationSet::trace(Visitor* visitor) | 186 void DescendantInvalidationSet::trace(Visitor* visitor) |
187 { | 187 { |
188 #if ENABLE(OILPAN) | 188 #if ENABLE(OILPAN) |
189 visitor->trace(m_classes); | 189 visitor->trace(m_classes); |
190 visitor->trace(m_ids); | 190 visitor->trace(m_ids); |
191 visitor->trace(m_tagNames); | 191 visitor->trace(m_tagNames); |
192 visitor->trace(m_attributes); | 192 visitor->trace(m_attributes); |
193 #endif | 193 #endif |
194 } | 194 } |
195 | 195 |
| 196 #ifndef NDEBUG |
| 197 void DescendantInvalidationSet::show() const |
| 198 { |
| 199 fprintf(stderr, "DescendantInvalidationSet { "); |
| 200 if (m_allDescendantsMightBeInvalid) |
| 201 fprintf(stderr, "* "); |
| 202 if (m_customPseudoInvalid) |
| 203 fprintf(stderr, "::custom "); |
| 204 if (m_treeBoundaryCrossing) |
| 205 fprintf(stderr, "::shadow/deep/ "); |
| 206 if (m_ids) { |
| 207 for (WillBeHeapHashSet<AtomicString>::const_iterator it = m_ids->begin()
; it != m_ids->end(); ++it) |
| 208 fprintf(stderr, "#%s ", (*it).ascii().data()); |
| 209 } |
| 210 if (m_classes) { |
| 211 for (WillBeHeapHashSet<AtomicString>::const_iterator it = m_classes->beg
in(); it != m_classes->end(); ++it) |
| 212 fprintf(stderr, ".%s ", (*it).ascii().data()); |
| 213 } |
| 214 if (m_tagNames) { |
| 215 for (WillBeHeapHashSet<AtomicString>::const_iterator it = m_tagNames->be
gin(); it != m_tagNames->end(); ++it) |
| 216 fprintf(stderr, "<%s> ", (*it).ascii().data()); |
| 217 } |
| 218 if (m_attributes) { |
| 219 for (WillBeHeapHashSet<AtomicString>::const_iterator it = m_attributes->
begin(); it != m_attributes->end(); ++it) |
| 220 fprintf(stderr, "[%s] ", (*it).ascii().data()); |
| 221 } |
| 222 fprintf(stderr, "}\n"); |
| 223 } |
| 224 #endif // NDEBUG |
| 225 |
196 } // namespace WebCore | 226 } // namespace WebCore |
OLD | NEW |