| 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 203 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 214 visitor->trace(m_ids); | 214 visitor->trace(m_ids); |
| 215 visitor->trace(m_tagNames); | 215 visitor->trace(m_tagNames); |
| 216 visitor->trace(m_attributes); | 216 visitor->trace(m_attributes); |
| 217 #endif | 217 #endif |
| 218 } | 218 } |
| 219 | 219 |
| 220 void DescendantInvalidationSet::toTracedValue(TracedValue* value) const | 220 void DescendantInvalidationSet::toTracedValue(TracedValue* value) const |
| 221 { | 221 { |
| 222 value->beginDictionary(); | 222 value->beginDictionary(); |
| 223 | 223 |
| 224 value->setString("id", descendantInvalidationSetToIdString(*this)); |
| 225 |
| 224 if (m_allDescendantsMightBeInvalid) | 226 if (m_allDescendantsMightBeInvalid) |
| 225 value->setBoolean("allDescendantsMightBeInvalid", true); | 227 value->setBoolean("allDescendantsMightBeInvalid", true); |
| 226 if (m_customPseudoInvalid) | 228 if (m_customPseudoInvalid) |
| 227 value->setBoolean("customPseudoInvalid", true); | 229 value->setBoolean("customPseudoInvalid", true); |
| 228 if (m_treeBoundaryCrossing) | 230 if (m_treeBoundaryCrossing) |
| 229 value->setBoolean("treeBoundaryCrossing", true); | 231 value->setBoolean("treeBoundaryCrossing", true); |
| 230 if (m_insertionPointCrossing) | 232 if (m_insertionPointCrossing) |
| 231 value->setBoolean("insertionPointCrossing", true); | 233 value->setBoolean("insertionPointCrossing", true); |
| 232 | 234 |
| 233 if (m_ids) { | 235 if (m_ids) { |
| (...skipping 32 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 266 { | 268 { |
| 267 RefPtr<TracedValue> value = TracedValue::create(); | 269 RefPtr<TracedValue> value = TracedValue::create(); |
| 268 value->beginArray("DescendantInvalidationSet"); | 270 value->beginArray("DescendantInvalidationSet"); |
| 269 toTracedValue(value.get()); | 271 toTracedValue(value.get()); |
| 270 value->endArray(); | 272 value->endArray(); |
| 271 fprintf(stderr, "%s\n", value->asTraceFormat().ascii().data()); | 273 fprintf(stderr, "%s\n", value->asTraceFormat().ascii().data()); |
| 272 } | 274 } |
| 273 #endif // NDEBUG | 275 #endif // NDEBUG |
| 274 | 276 |
| 275 } // namespace blink | 277 } // namespace blink |
| OLD | NEW |