OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2010 Google, Inc. All Rights Reserved. | 2 * Copyright (C) 2010 Google, Inc. All Rights Reserved. |
3 * Copyright (C) 2011 Apple Inc. All rights reserved. | 3 * Copyright (C) 2011 Apple Inc. All rights reserved. |
4 * | 4 * |
5 * Redistribution and use in source and binary forms, with or without | 5 * Redistribution and use in source and binary forms, with or without |
6 * modification, are permitted provided that the following conditions | 6 * modification, are permitted provided that the following conditions |
7 * are met: | 7 * are met: |
8 * 1. Redistributions of source code must retain the above copyright | 8 * 1. 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 * 2. Redistributions in binary form must reproduce the above copyright | 10 * 2. Redistributions in binary form must reproduce the above copyright |
(...skipping 335 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
346 HTMLConstructionSite::~HTMLConstructionSite() | 346 HTMLConstructionSite::~HTMLConstructionSite() |
347 { | 347 { |
348 // Depending on why we're being destroyed it might be OK | 348 // Depending on why we're being destroyed it might be OK |
349 // to forget queued tasks, but currently we don't expect to. | 349 // to forget queued tasks, but currently we don't expect to. |
350 ASSERT(m_taskQueue.isEmpty()); | 350 ASSERT(m_taskQueue.isEmpty()); |
351 // Currently we assume that text will never be the last token in the | 351 // Currently we assume that text will never be the last token in the |
352 // document and that we'll always queue some additional task to cause it to
flush. | 352 // document and that we'll always queue some additional task to cause it to
flush. |
353 ASSERT(m_pendingText.isEmpty()); | 353 ASSERT(m_pendingText.isEmpty()); |
354 } | 354 } |
355 | 355 |
356 void HTMLConstructionSite::trace(Visitor* visitor) | 356 DEFINE_TRACE(HTMLConstructionSite) |
357 { | 357 { |
358 visitor->trace(m_document); | 358 visitor->trace(m_document); |
359 visitor->trace(m_attachmentRoot); | 359 visitor->trace(m_attachmentRoot); |
360 visitor->trace(m_head); | 360 visitor->trace(m_head); |
361 visitor->trace(m_form); | 361 visitor->trace(m_form); |
362 visitor->trace(m_openElements); | 362 visitor->trace(m_openElements); |
363 visitor->trace(m_activeFormattingElements); | 363 visitor->trace(m_activeFormattingElements); |
364 visitor->trace(m_taskQueue); | 364 visitor->trace(m_taskQueue); |
365 visitor->trace(m_pendingText); | 365 visitor->trace(m_pendingText); |
366 } | 366 } |
(...skipping 504 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
871 | 871 |
872 void HTMLConstructionSite::fosterParent(PassRefPtrWillBeRawPtr<Node> node) | 872 void HTMLConstructionSite::fosterParent(PassRefPtrWillBeRawPtr<Node> node) |
873 { | 873 { |
874 HTMLConstructionSiteTask task(HTMLConstructionSiteTask::Insert); | 874 HTMLConstructionSiteTask task(HTMLConstructionSiteTask::Insert); |
875 findFosterSite(task); | 875 findFosterSite(task); |
876 task.child = node; | 876 task.child = node; |
877 ASSERT(task.parent); | 877 ASSERT(task.parent); |
878 queueTask(task); | 878 queueTask(task); |
879 } | 879 } |
880 | 880 |
881 void HTMLConstructionSite::PendingText::trace(Visitor* visitor) | 881 DEFINE_TRACE(HTMLConstructionSite::PendingText) |
882 { | 882 { |
883 visitor->trace(parent); | 883 visitor->trace(parent); |
884 visitor->trace(nextChild); | 884 visitor->trace(nextChild); |
885 } | 885 } |
886 | 886 |
887 | 887 |
888 } | 888 } |
OLD | NEW |