| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2006, 2007 Apple, Inc. All rights reserved. | 2 * Copyright (C) 2006, 2007 Apple, Inc. All rights reserved. |
| 3 * Copyright (C) 2012 Google, Inc. All rights reserved. | 3 * Copyright (C) 2012 Google, 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 10 matching lines...) Expand all Loading... |
| 21 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY | 21 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
| 22 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 22 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 25 */ | 25 */ |
| 26 | 26 |
| 27 #include "config.h" | 27 #include "config.h" |
| 28 #include "core/editing/UndoStack.h" | 28 #include "core/editing/UndoStack.h" |
| 29 | 29 |
| 30 #include "core/dom/ContainerNode.h" | 30 #include "core/dom/ContainerNode.h" |
| 31 #include "core/dom/NoEventDispatchAssertion.h" | |
| 32 #include "core/editing/UndoStep.h" | 31 #include "core/editing/UndoStep.h" |
| 32 #include "platform/EventDispatchForbiddenScope.h" |
| 33 #include "wtf/TemporaryChange.h" | 33 #include "wtf/TemporaryChange.h" |
| 34 | 34 |
| 35 namespace blink { | 35 namespace blink { |
| 36 | 36 |
| 37 // Arbitrary depth limit for the undo stack, to keep it from using | 37 // Arbitrary depth limit for the undo stack, to keep it from using |
| 38 // unbounded memory. This is the maximum number of distinct undoable | 38 // unbounded memory. This is the maximum number of distinct undoable |
| 39 // actions -- unbroken stretches of typed characters are coalesced | 39 // actions -- unbroken stretches of typed characters are coalesced |
| 40 // into a single action. | 40 // into a single action. |
| 41 static const size_t maximumUndoStackDepth = 1000; | 41 static const size_t maximumUndoStackDepth = 1000; |
| 42 | 42 |
| (...skipping 18 matching lines...) Expand all Loading... |
| 61 m_undoStack.append(step); | 61 m_undoStack.append(step); |
| 62 } | 62 } |
| 63 | 63 |
| 64 void UndoStack::registerRedoStep(PassRefPtrWillBeRawPtr<UndoStep> step) | 64 void UndoStack::registerRedoStep(PassRefPtrWillBeRawPtr<UndoStep> step) |
| 65 { | 65 { |
| 66 m_redoStack.append(step); | 66 m_redoStack.append(step); |
| 67 } | 67 } |
| 68 | 68 |
| 69 void UndoStack::didUnloadFrame(const LocalFrame& frame) | 69 void UndoStack::didUnloadFrame(const LocalFrame& frame) |
| 70 { | 70 { |
| 71 NoEventDispatchAssertion assertNoEventDispatch; | 71 EventDispatchForbiddenScope assertNoEventDispatch; |
| 72 filterOutUndoSteps(m_undoStack, frame); | 72 filterOutUndoSteps(m_undoStack, frame); |
| 73 filterOutUndoSteps(m_redoStack, frame); | 73 filterOutUndoSteps(m_redoStack, frame); |
| 74 } | 74 } |
| 75 | 75 |
| 76 void UndoStack::filterOutUndoSteps(UndoStepStack& stack, const LocalFrame& frame
) | 76 void UndoStack::filterOutUndoSteps(UndoStepStack& stack, const LocalFrame& frame
) |
| 77 { | 77 { |
| 78 UndoStepStack newStack; | 78 UndoStepStack newStack; |
| 79 while (!stack.isEmpty()) { | 79 while (!stack.isEmpty()) { |
| 80 UndoStep* step = stack.first().get(); | 80 UndoStep* step = stack.first().get(); |
| 81 if (!step->belongsTo(frame)) | 81 if (!step->belongsTo(frame)) |
| (...skipping 38 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 120 } | 120 } |
| 121 } | 121 } |
| 122 | 122 |
| 123 void UndoStack::trace(Visitor* visitor) | 123 void UndoStack::trace(Visitor* visitor) |
| 124 { | 124 { |
| 125 visitor->trace(m_undoStack); | 125 visitor->trace(m_undoStack); |
| 126 visitor->trace(m_redoStack); | 126 visitor->trace(m_redoStack); |
| 127 } | 127 } |
| 128 | 128 |
| 129 } // namespace blink | 129 } // namespace blink |
| OLD | NEW |