| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
| 4 * (C) 2001 Dirk Mueller (mueller@kde.org) | 4 * (C) 2001 Dirk Mueller (mueller@kde.org) |
| 5 * (C) 2006 Alexey Proskuryakov (ap@webkit.org) | 5 * (C) 2006 Alexey Proskuryakov (ap@webkit.org) |
| 6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2011, 2012 Apple Inc. All r
ights reserved. | 6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2011, 2012 Apple Inc. All r
ights reserved. |
| 7 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) | 7 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) |
| 8 * Copyright (C) 2008, 2009, 2011 Google Inc. All rights reserved. | 8 * Copyright (C) 2008, 2009, 2011 Google Inc. All rights reserved. |
| 9 * Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies) | 9 * Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies) |
| 10 * Copyright (C) Research In Motion Limited 2010-2011. All rights reserved. | 10 * Copyright (C) Research In Motion Limited 2010-2011. All rights reserved. |
| (...skipping 3846 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3857 { | 3857 { |
| 3858 if (m_cssTarget) | 3858 if (m_cssTarget) |
| 3859 m_cssTarget->setNeedsStyleRecalc(); | 3859 m_cssTarget->setNeedsStyleRecalc(); |
| 3860 m_cssTarget = n; | 3860 m_cssTarget = n; |
| 3861 if (n) | 3861 if (n) |
| 3862 n->setNeedsStyleRecalc(); | 3862 n->setNeedsStyleRecalc(); |
| 3863 } | 3863 } |
| 3864 | 3864 |
| 3865 void Document::registerDynamicSubtreeNodeList(DynamicSubtreeNodeList* list) | 3865 void Document::registerDynamicSubtreeNodeList(DynamicSubtreeNodeList* list) |
| 3866 { | 3866 { |
| 3867 ensureRareData()->ensureNodeLists(this)->m_listsInvalidatedAtDocument.add(li
st); | 3867 m_listsInvalidatedAtDocument.add(list); |
| 3868 } | 3868 } |
| 3869 | 3869 |
| 3870 void Document::unregisterDynamicSubtreeNodeList(DynamicSubtreeNodeList* list) | 3870 void Document::unregisterDynamicSubtreeNodeList(DynamicSubtreeNodeList* list) |
| 3871 { | 3871 { |
| 3872 ASSERT(hasRareData()); | 3872 m_listsInvalidatedAtDocument.remove(list); |
| 3873 ASSERT(rareData()->nodeLists()); | 3873 } |
| 3874 rareData()->nodeLists()->m_listsInvalidatedAtDocument.remove(list); | 3874 |
| 3875 void Document::clearNodeListCaches() |
| 3876 { |
| 3877 HashSet<DynamicSubtreeNodeList*>::iterator end = m_listsInvalidatedAtDocumen
t.end(); |
| 3878 for (HashSet<DynamicSubtreeNodeList*>::iterator it = m_listsInvalidatedAtDoc
ument.begin(); it != end; ++it) |
| 3879 (*it)->invalidateCache(); |
| 3875 } | 3880 } |
| 3876 | 3881 |
| 3877 void Document::attachNodeIterator(NodeIterator* ni) | 3882 void Document::attachNodeIterator(NodeIterator* ni) |
| 3878 { | 3883 { |
| 3879 m_nodeIterators.add(ni); | 3884 m_nodeIterators.add(ni); |
| 3880 } | 3885 } |
| 3881 | 3886 |
| 3882 void Document::detachNodeIterator(NodeIterator* ni) | 3887 void Document::detachNodeIterator(NodeIterator* ni) |
| 3883 { | 3888 { |
| 3884 // The node iterator can be detached without having been attached if its roo
t node didn't have a document | 3889 // The node iterator can be detached without having been attached if its roo
t node didn't have a document |
| (...skipping 2129 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 6014 #if ENABLE(UNDO_MANAGER) | 6019 #if ENABLE(UNDO_MANAGER) |
| 6015 PassRefPtr<UndoManager> Document::undoManager() | 6020 PassRefPtr<UndoManager> Document::undoManager() |
| 6016 { | 6021 { |
| 6017 if (!m_undoManager) | 6022 if (!m_undoManager) |
| 6018 m_undoManager = UndoManager::create(this); | 6023 m_undoManager = UndoManager::create(this); |
| 6019 return m_undoManager; | 6024 return m_undoManager; |
| 6020 } | 6025 } |
| 6021 #endif | 6026 #endif |
| 6022 | 6027 |
| 6023 } // namespace WebCore | 6028 } // namespace WebCore |
| OLD | NEW |