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
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
|
/*
* tkUndo.c --
*
* This module provides the implementation of an undo stack.
*
* Copyright © 2002 Ludwig Callewaert.
* Copyright © 2003-2004 Vincent Darley.
*
* See the file "license.terms" for information on usage and redistribution of
* this file, and for a DISCLAIMER OF ALL WARRANTIES.
*/
#include "tkInt.h"
#include "tkUndo.h"
static int EvaluateActionList(Tcl_Interp *interp,
TkUndoSubAtom *action);
/*
*----------------------------------------------------------------------
*
* TkUndoPushStack --
*
* Push elem on the stack identified by stack.
*
* Results:
* None.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
void
TkUndoPushStack(
TkUndoAtom **stack,
TkUndoAtom *elem)
{
elem->next = *stack;
*stack = elem;
}
/*
*----------------------------------------------------------------------
*
* TkUndoPopStack --
*
* Remove and return the top element from the stack identified by stack.
*
* Results:
* None.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
TkUndoAtom *
TkUndoPopStack(
TkUndoAtom **stack)
{
TkUndoAtom *elem = NULL;
if (*stack != NULL) {
elem = *stack;
*stack = elem->next;
}
return elem;
}
/*
*----------------------------------------------------------------------
*
* TkUndoInsertSeparator --
*
* Insert a separator on the stack, indicating a border for an undo/redo
* chunk.
*
* Results:
* None.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
int
TkUndoInsertSeparator(
TkUndoAtom **stack)
{
TkUndoAtom *separator;
if (*stack!=NULL && (*stack)->type!=TK_UNDO_SEPARATOR) {
separator = (TkUndoAtom *)ckalloc(sizeof(TkUndoAtom));
separator->type = TK_UNDO_SEPARATOR;
TkUndoPushStack(stack,separator);
return 1;
}
return 0;
}
/*
*----------------------------------------------------------------------
*
* TkUndoClearStack --
*
* Clear an entire undo or redo stack and destroy all elements in it.
*
* Results:
* None.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
void
TkUndoClearStack(
TkUndoAtom **stack) /* An Undo or Redo stack */
{
TkUndoAtom *elem;
while ((elem = TkUndoPopStack(stack)) != NULL) {
if (elem->type != TK_UNDO_SEPARATOR) {
TkUndoSubAtom *sub;
sub = elem->apply;
while (sub != NULL) {
TkUndoSubAtom *next = sub->next;
if (sub->action != NULL) {
Tcl_DecrRefCount(sub->action);
}
ckfree(sub);
sub = next;
}
sub = elem->revert;
while (sub != NULL) {
TkUndoSubAtom *next = sub->next;
if (sub->action != NULL) {
Tcl_DecrRefCount(sub->action);
}
ckfree(sub);
sub = next;
}
}
ckfree(elem);
}
*stack = NULL;
}
/*
*----------------------------------------------------------------------
*
* TkUndoPushAction --
*
* Push a new elem on the stack identified by stack. Action and revert
* are given through Tcl_Obj's to which we will retain a reference. (So
* they can be passed in with a zero refCount if desired).
*
* Results:
* None.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
void
TkUndoPushAction(
TkUndoRedoStack *stack, /* An Undo or Redo stack */
TkUndoSubAtom *apply,
TkUndoSubAtom *revert)
{
TkUndoAtom *atom;
atom = (TkUndoAtom *)ckalloc(sizeof(TkUndoAtom));
atom->type = TK_UNDO_ACTION;
atom->apply = apply;
atom->revert = revert;
TkUndoPushStack(&stack->undoStack, atom);
TkUndoClearStack(&stack->redoStack);
}
/*
*----------------------------------------------------------------------
*
* TkUndoMakeCmdSubAtom --
*
* Create a new undo/redo step which must later be place into an undo
* stack with TkUndoPushAction. This sub-atom, if evaluated, will take
* the given command (if non-NULL), find its full Tcl command string, and
* then evaluate that command with the list elements of 'actionScript'
* appended.
*
* If 'subAtomList' is non-NULL, the newly created sub-atom is added onto
* the end of the linked list of which 'subAtomList' is a part. This
* makes it easy to build up a sequence of actions which will be pushed
* in one step.
*
* Note: if the undo stack can persist for longer than the Tcl_Command
* provided, the stack will cause crashes when actions are evaluated. In
* this case the 'command' argument should not be used. This is the case
* with peer text widgets, for example.
*
* Results:
* The newly created subAtom is returned. It must be passed to
* TkUndoPushAction otherwise a memory leak will result.
*
* Side effects:
* A refCount is retained on 'actionScript'.
*
*----------------------------------------------------------------------
*/
TkUndoSubAtom *
TkUndoMakeCmdSubAtom(
Tcl_Command command, /* Tcl command token for actions, may be NULL
* if not needed. */
Tcl_Obj *actionScript, /* The script to append to the command to
* perform the action (may be NULL if the
* command is not-null). */
TkUndoSubAtom *subAtomList) /* Add to the end of this list of actions if
* non-NULL */
{
TkUndoSubAtom *atom;
if (command == NULL && actionScript == NULL) {
Tcl_Panic("NULL command and actionScript in TkUndoMakeCmdSubAtom");
}
atom = (TkUndoSubAtom *)ckalloc(sizeof(TkUndoSubAtom));
atom->command = command;
atom->funcPtr = NULL;
atom->clientData = NULL;
atom->next = NULL;
atom->action = actionScript;
if (atom->action != NULL) {
Tcl_IncrRefCount(atom->action);
}
if (subAtomList != NULL) {
while (subAtomList->next != NULL) {
subAtomList = subAtomList->next;
}
subAtomList->next = atom;
}
return atom;
}
/*
*----------------------------------------------------------------------
*
* TkUndoMakeSubAtom --
*
* Create a new undo/redo step which must later be place into an undo
* stack with TkUndoPushAction. This sub-atom, if evaluated, will take
* the given C-funcPtr (which must be non-NULL), and call it with three
* arguments: the undo stack's 'interp', the 'clientData' given and the
* 'actionScript'. The callback should return a standard Tcl return code
* (TCL_OK on success).
*
* If 'subAtomList' is non-NULL, the newly created sub-atom is added onto
* the end of the linked list of which 'subAtomList' is a part. This
* makes it easy to build up a sequence of actions which will be pushed
* in one step.
*
* Results:
* The newly created subAtom is returned. It must be passed to
* TkUndoPushAction otherwise a memory leak will result.
*
* Side effects:
* A refCount is retained on 'actionScript'.
*
*----------------------------------------------------------------------
*/
TkUndoSubAtom *
TkUndoMakeSubAtom(
TkUndoProc *funcPtr, /* Callback function to perform the
* undo/redo. */
ClientData clientData, /* Data to pass to the callback function. */
Tcl_Obj *actionScript, /* Additional Tcl data to pass to the callback
* function (may be NULL). */
TkUndoSubAtom *subAtomList) /* Add to the end of this list of actions if
* non-NULL */
{
TkUndoSubAtom *atom;
if (funcPtr == NULL) {
Tcl_Panic("NULL funcPtr in TkUndoMakeSubAtom");
}
atom = (TkUndoSubAtom *)ckalloc(sizeof(TkUndoSubAtom));
atom->command = NULL;
atom->funcPtr = funcPtr;
atom->clientData = clientData;
atom->next = NULL;
atom->action = actionScript;
if (atom->action != NULL) {
Tcl_IncrRefCount(atom->action);
}
if (subAtomList != NULL) {
while (subAtomList->next != NULL) {
subAtomList = subAtomList->next;
}
subAtomList->next = atom;
}
return atom;
}
/*
*----------------------------------------------------------------------
*
* TkUndoInitStack --
*
* Initialize a new undo/redo stack.
*
* Results:
* An Undo/Redo stack pointer.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
TkUndoRedoStack *
TkUndoInitStack(
Tcl_Interp *interp, /* The interpreter */
int maxdepth) /* The maximum stack depth */
{
TkUndoRedoStack *stack; /* An Undo/Redo stack */
stack = (TkUndoRedoStack *)ckalloc(sizeof(TkUndoRedoStack));
stack->undoStack = NULL;
stack->redoStack = NULL;
stack->interp = interp;
stack->maxdepth = maxdepth;
stack->depth = 0;
return stack;
}
/*
*----------------------------------------------------------------------
*
* TkUndoSetMaxDepth --
*
* Set the maximum depth of stack.
*
* Results:
* None.
*
* Side effects:
* May delete elements from the stack if the new maximum depth is smaller
* than the number of elements previously in the stack.
*
*----------------------------------------------------------------------
*/
void
TkUndoSetMaxDepth(
TkUndoRedoStack *stack, /* An Undo/Redo stack */
int maxdepth) /* The maximum stack depth */
{
stack->maxdepth = maxdepth;
if (stack->maxdepth>0 && stack->depth>stack->maxdepth) {
TkUndoAtom *elem, *prevelem;
int sepNumber = 0;
/*
* Maximum stack depth exceeded. We have to remove the last compound
* elements on the stack.
*/
elem = stack->undoStack;
prevelem = NULL;
while ((elem != NULL) && (sepNumber <= stack->maxdepth)) {
if (elem->type == TK_UNDO_SEPARATOR) {
sepNumber++;
}
prevelem = elem;
elem = elem->next;
}
CLANG_ASSERT(prevelem);
prevelem->next = NULL;
while (elem != NULL) {
prevelem = elem;
if (elem->type != TK_UNDO_SEPARATOR) {
TkUndoSubAtom *sub = elem->apply;
while (sub != NULL) {
TkUndoSubAtom *next = sub->next;
if (sub->action != NULL) {
Tcl_DecrRefCount(sub->action);
}
ckfree(sub);
sub = next;
}
sub = elem->revert;
while (sub != NULL) {
TkUndoSubAtom *next = sub->next;
if (sub->action != NULL) {
Tcl_DecrRefCount(sub->action);
}
ckfree(sub);
sub = next;
}
}
elem = elem->next;
ckfree(prevelem);
}
stack->depth = stack->maxdepth;
}
}
/*
*----------------------------------------------------------------------
*
* TkUndoClearStacks --
*
* Clear both the undo and redo stack.
*
* Results:
* None.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
void
TkUndoClearStacks(
TkUndoRedoStack *stack) /* An Undo/Redo stack */
{
TkUndoClearStack(&stack->undoStack);
TkUndoClearStack(&stack->redoStack);
stack->depth = 0;
}
/*
*----------------------------------------------------------------------
*
* TkUndoFreeStack
*
* Clear both the undo and redo stack and free the memory allocated to
* the u/r stack pointer.
*
* Results:
* None.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
void
TkUndoFreeStack(
TkUndoRedoStack *stack) /* An Undo/Redo stack */
{
TkUndoClearStacks(stack);
ckfree(stack);
}
/*
*----------------------------------------------------------------------
*
* TkUndoCanRedo --
*
* Returns true if redo is possible, i.e. if the redo stack is not empty.
*
* Results:
* A boolean.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
int
TkUndoCanRedo(
TkUndoRedoStack *stack) /* An Undo/Redo stack */
{
return stack->redoStack != NULL;
}
/*
*----------------------------------------------------------------------
*
* TkUndoCanUndo --
*
* Returns true if undo is possible, i.e. if the undo stack is not empty.
*
* Results:
* A boolean.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
int
TkUndoCanUndo(
TkUndoRedoStack *stack) /* An Undo/Redo stack */
{
return stack->undoStack != NULL;
}
/*
*----------------------------------------------------------------------
*
* TkUndoInsertUndoSeparator --
*
* Insert a separator on the undo stack, indicating a border for an
* undo/redo chunk.
*
* Results:
* None.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
void
TkUndoInsertUndoSeparator(
TkUndoRedoStack *stack)
{
if (TkUndoInsertSeparator(&stack->undoStack)) {
stack->depth++;
TkUndoSetMaxDepth(stack, stack->maxdepth);
}
}
/*
*----------------------------------------------------------------------
*
* TkUndoRevert --
*
* Undo a compound action on the stack.
*
* Results:
* A Tcl status code
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
int
TkUndoRevert(
TkUndoRedoStack *stack)
{
TkUndoAtom *elem;
/*
* Insert a separator on the undo and the redo stack.
*/
TkUndoInsertUndoSeparator(stack);
TkUndoInsertSeparator(&stack->redoStack);
/*
* Pop and skip the first separator if there is one.
*/
elem = TkUndoPopStack(&stack->undoStack);
if (elem == NULL) {
return TCL_ERROR;
}
if (elem->type == TK_UNDO_SEPARATOR) {
ckfree(elem);
elem = TkUndoPopStack(&stack->undoStack);
}
while (elem != NULL && elem->type != TK_UNDO_SEPARATOR) {
/*
* Note that we currently ignore errors thrown here.
*/
EvaluateActionList(stack->interp, elem->revert);
TkUndoPushStack(&stack->redoStack, elem);
elem = TkUndoPopStack(&stack->undoStack);
}
/*
* Insert a separator on the redo stack.
*/
TkUndoInsertSeparator(&stack->redoStack);
stack->depth--;
return TCL_OK;
}
/*
*----------------------------------------------------------------------
*
* TkUndoApply --
*
* Redo a compound action on the stack.
*
* Results:
* A Tcl status code
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
int
TkUndoApply(
TkUndoRedoStack *stack)
{
TkUndoAtom *elem;
/*
* Insert a separator on the undo stack.
*/
TkUndoInsertSeparator(&stack->undoStack);
/*
* Pop and skip the first separator if there is one.
*/
elem = TkUndoPopStack(&stack->redoStack);
if (elem == NULL) {
return TCL_ERROR;
}
if (elem->type == TK_UNDO_SEPARATOR) {
ckfree(elem);
elem = TkUndoPopStack(&stack->redoStack);
}
while (elem != NULL && elem->type != TK_UNDO_SEPARATOR) {
/*
* Note that we currently ignore errors thrown here.
*/
EvaluateActionList(stack->interp, elem->apply);
TkUndoPushStack(&stack->undoStack, elem);
elem = TkUndoPopStack(&stack->redoStack);
}
/*
* Insert a separator on the undo stack.
*/
TkUndoInsertSeparator(&stack->undoStack);
stack->depth++;
return TCL_OK;
}
/*
*----------------------------------------------------------------------
*
* EvaluateActionList --
*
* Execute a linked list of undo/redo sub-atoms. If any sub-atom returns
* a non TCL_OK value, execution of subsequent sub-atoms is cancelled and
* the error returned immediately.
*
* Results:
* A Tcl status code
*
* Side effects:
* The undo/redo subAtoms can perform arbitrary actions.
*
*----------------------------------------------------------------------
*/
static int
EvaluateActionList(
Tcl_Interp *interp, /* Interpreter to evaluate the action in. */
TkUndoSubAtom *action) /* Head of linked list of action steps to
* perform. */
{
int result = TCL_OK;
while (action != NULL) {
if (action->funcPtr != NULL) {
result = action->funcPtr(interp, action->clientData,
action->action);
} else if (action->command != NULL) {
Tcl_Obj *cmdNameObj, *evalObj;
cmdNameObj = Tcl_NewObj();
evalObj = Tcl_NewObj();
Tcl_IncrRefCount(evalObj);
Tcl_GetCommandFullName(interp, action->command, cmdNameObj);
Tcl_ListObjAppendElement(NULL, evalObj, cmdNameObj);
if (action->action != NULL) {
Tcl_ListObjAppendList(NULL, evalObj, action->action);
}
result = Tcl_EvalObjEx(interp, evalObj, TCL_EVAL_GLOBAL);
Tcl_DecrRefCount(evalObj);
} else {
result = Tcl_EvalObjEx(interp, action->action, TCL_EVAL_GLOBAL);
}
if (result != TCL_OK) {
return result;
}
action = action->next;
}
return result;
}
/*
* Local Variables:
* mode: c
* c-basic-offset: 4
* fill-column: 78
* End:
*/
|