1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
|
/**
* @file llundo.cpp
*
* $LicenseInfo:firstyear=2001&license=viewergpl$
*
* Copyright (c) 2001-2009, Linden Research, Inc.
*
* Second Life Viewer Source Code
* The source code in this file ("Source Code") is provided by Linden Lab
* to you under the terms of the GNU General Public License, version 2.0
* ("GPL"), unless you have obtained a separate licensing agreement
* ("Other License"), formally executed by you and Linden Lab. Terms of
* the GPL can be found in doc/GPL-license.txt in this distribution, or
* online at http://secondlifegrid.net/programs/open_source/licensing/gplv2
*
* There are special exceptions to the terms and conditions of the GPL as
* it is applied to this Source Code. View the full text of the exception
* in the file doc/FLOSS-exception.txt in this software distribution, or
* online at
* http://secondlifegrid.net/programs/open_source/licensing/flossexception
*
* By copying, modifying or distributing this software, you acknowledge
* that you have read and understood your obligations described above,
* and agree to abide by those obligations.
*
* ALL LINDEN LAB SOURCE CODE IS PROVIDED "AS IS." LINDEN LAB MAKES NO
* WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,
* COMPLETENESS OR PERFORMANCE.
* $/LicenseInfo$
*/
#include "linden_common.h"
#include "llundo.h"
// TODO:
// implement doubly linked circular list for ring buffer
// this will allow us to easily change the size of an undo buffer on the fly
//-----------------------------------------------------------------------------
// LLUndoBuffer()
//-----------------------------------------------------------------------------
LLUndoBuffer::LLUndoBuffer( LLUndoAction (*create_func()), S32 initial_count )
{
mNextAction = 0;
mLastAction = 0;
mFirstAction = 0;
mOperationID = 0;
mNumActions = initial_count;
mActions = new LLUndoAction *[initial_count];
//initialize buffer with actions
for (S32 i = 0; i < initial_count; i++)
{
mActions[i] = create_func();
if (!mActions[i])
{
llerrs << "Unable to create action for undo buffer" << llendl;
}
}
}
//-----------------------------------------------------------------------------
// ~LLUndoBuffer()
//-----------------------------------------------------------------------------
LLUndoBuffer::~LLUndoBuffer()
{
for (S32 i = 0; i < mNumActions; i++)
{
delete mActions[i];
}
delete [] mActions;
}
//-----------------------------------------------------------------------------
// getNextAction()
//-----------------------------------------------------------------------------
LLUndoBuffer::LLUndoAction* LLUndoBuffer::getNextAction(BOOL setClusterBegin)
{
LLUndoAction *nextAction = mActions[mNextAction];
if (setClusterBegin)
{
mOperationID++;
}
mActions[mNextAction]->mClusterID = mOperationID;
mNextAction = (mNextAction + 1) % mNumActions;
mLastAction = mNextAction;
if (mNextAction == mFirstAction)
{
mActions[mFirstAction]->cleanup();
mFirstAction = (mFirstAction + 1) % mNumActions;
}
return nextAction;
}
//-----------------------------------------------------------------------------
// undoAction()
//-----------------------------------------------------------------------------
BOOL LLUndoBuffer::undoAction()
{
if (!canUndo())
{
return FALSE;
}
S32 prevAction = (mNextAction + mNumActions - 1) % mNumActions;
while(mActions[prevAction]->mClusterID == mOperationID)
{
// go ahead and decrement action index
mNextAction = prevAction;
// undo this action
mActions[mNextAction]->undo();
// we're at the first action, so we don't know if we've actually undid everything
if (mNextAction == mFirstAction)
{
mOperationID--;
return FALSE;
}
// do wrap-around of index, but avoid negative numbers for modulo operator
prevAction = (mNextAction + mNumActions - 1) % mNumActions;
}
mOperationID--;
return TRUE;
}
//-----------------------------------------------------------------------------
// redoAction()
//-----------------------------------------------------------------------------
BOOL LLUndoBuffer::redoAction()
{
if (!canRedo())
{
return FALSE;
}
mOperationID++;
while(mActions[mNextAction]->mClusterID == mOperationID)
{
if (mNextAction == mLastAction)
{
return FALSE;
}
mActions[mNextAction]->redo();
// do wrap-around of index
mNextAction = (mNextAction + 1) % mNumActions;
}
return TRUE;
}
//-----------------------------------------------------------------------------
// flushActions()
//-----------------------------------------------------------------------------
void LLUndoBuffer::flushActions()
{
for (S32 i = 0; i < mNumActions; i++)
{
mActions[i]->cleanup();
}
mNextAction = 0;
mLastAction = 0;
mFirstAction = 0;
mOperationID = 0;
}
|
