OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2005, 2008 Apple Inc. All rights reserved. | 2 * Copyright (C) 2005, 2008 Apple 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 | 5 * modification, are permitted provided that the following conditions |
6 * are met: | 6 * are met: |
7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
11 * documentation and/or other materials provided with the distribution. | 11 * documentation and/or other materials provided with the distribution. |
12 * | 12 * |
13 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY | 13 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY |
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | 14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | 15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR | 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR |
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | 17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | 18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | 19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY | 20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
24 */ | 24 */ |
25 | 25 |
26 #include "core/editing/commands/RemoveNodeCommand.h" | 26 #include "core/editing/commands/RemoveNodeCommand.h" |
27 | 27 |
28 #include "bindings/core/v8/ExceptionStatePlaceholder.h" | 28 #include "bindings/core/v8/ExceptionStatePlaceholder.h" |
29 #include "core/dom/Node.h" | 29 #include "core/dom/Node.h" |
| 30 #include "core/editing/commands/EditingState.h" |
30 #include "wtf/Assertions.h" | 31 #include "wtf/Assertions.h" |
31 | 32 |
32 namespace blink { | 33 namespace blink { |
33 | 34 |
34 RemoveNodeCommand::RemoveNodeCommand(PassRefPtrWillBeRawPtr<Node> node, ShouldAs
sumeContentIsAlwaysEditable shouldAssumeContentIsAlwaysEditable) | 35 RemoveNodeCommand::RemoveNodeCommand(PassRefPtrWillBeRawPtr<Node> node, ShouldAs
sumeContentIsAlwaysEditable shouldAssumeContentIsAlwaysEditable) |
35 : SimpleEditCommand(node->document()) | 36 : SimpleEditCommand(node->document()) |
36 , m_node(node) | 37 , m_node(node) |
37 , m_shouldAssumeContentIsAlwaysEditable(shouldAssumeContentIsAlwaysEditable) | 38 , m_shouldAssumeContentIsAlwaysEditable(shouldAssumeContentIsAlwaysEditable) |
38 { | 39 { |
39 ASSERT(m_node); | 40 ASSERT(m_node); |
40 ASSERT(m_node->parentNode()); | 41 ASSERT(m_node->parentNode()); |
41 } | 42 } |
42 | 43 |
43 void RemoveNodeCommand::doApply(EditingState*) | 44 void RemoveNodeCommand::doApply(EditingState* editingState) |
44 { | 45 { |
45 ContainerNode* parent = m_node->parentNode(); | 46 ContainerNode* parent = m_node->parentNode(); |
46 if (!parent || (m_shouldAssumeContentIsAlwaysEditable == DoNotAssumeContentI
sAlwaysEditable | 47 if (!parent || (m_shouldAssumeContentIsAlwaysEditable == DoNotAssumeContentI
sAlwaysEditable |
47 && !parent->isContentEditable(Node::UserSelectAllIsAlwaysNonEditable) &&
parent->inActiveDocument())) | 48 && !parent->isContentEditable(Node::UserSelectAllIsAlwaysNonEditable) &&
parent->inActiveDocument())) |
48 return; | 49 return; |
49 ASSERT(parent->isContentEditable(Node::UserSelectAllIsAlwaysNonEditable) ||
!parent->inActiveDocument()); | 50 ASSERT(parent->isContentEditable(Node::UserSelectAllIsAlwaysNonEditable) ||
!parent->inActiveDocument()); |
50 | 51 |
51 m_parent = parent; | 52 m_parent = parent; |
52 m_refChild = m_node->nextSibling(); | 53 m_refChild = m_node->nextSibling(); |
53 | 54 |
54 m_node->remove(IGNORE_EXCEPTION); | 55 m_node->remove(IGNORE_EXCEPTION); |
| 56 // Node::remove dispatch synchronous events such as IFRAME unload events, |
| 57 // and event handlers may break the document. We check the document state |
| 58 // here in order to prevent further processing in bad situation. |
| 59 ASSERT_IN_EDITING_COMMAND(m_node->document().frame()); |
| 60 ASSERT_IN_EDITING_COMMAND(m_node->document().documentElement()); |
55 } | 61 } |
56 | 62 |
57 void RemoveNodeCommand::doUnapply() | 63 void RemoveNodeCommand::doUnapply() |
58 { | 64 { |
59 RefPtrWillBeRawPtr<ContainerNode> parent = m_parent.release(); | 65 RefPtrWillBeRawPtr<ContainerNode> parent = m_parent.release(); |
60 RefPtrWillBeRawPtr<Node> refChild = m_refChild.release(); | 66 RefPtrWillBeRawPtr<Node> refChild = m_refChild.release(); |
61 if (!parent || !parent->hasEditableStyle()) | 67 if (!parent || !parent->hasEditableStyle()) |
62 return; | 68 return; |
63 | 69 |
64 parent->insertBefore(m_node.get(), refChild.get(), IGNORE_EXCEPTION); | 70 parent->insertBefore(m_node.get(), refChild.get(), IGNORE_EXCEPTION); |
65 } | 71 } |
66 | 72 |
67 DEFINE_TRACE(RemoveNodeCommand) | 73 DEFINE_TRACE(RemoveNodeCommand) |
68 { | 74 { |
69 visitor->trace(m_node); | 75 visitor->trace(m_node); |
70 visitor->trace(m_parent); | 76 visitor->trace(m_parent); |
71 visitor->trace(m_refChild); | 77 visitor->trace(m_refChild); |
72 SimpleEditCommand::trace(visitor); | 78 SimpleEditCommand::trace(visitor); |
73 } | 79 } |
74 | 80 |
75 } // namespace blink | 81 } // namespace blink |
OLD | NEW |