summaryrefslogtreecommitdiff
path: root/ldmicro/undoredo.cpp
blob: 8bcfcc8ece6a78ea9a3e6f8ddee7fea8a3f6a0f6 (plain)
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
//-----------------------------------------------------------------------------
// Copyright 2007 Jonathan Westhues
//
// This file is part of LDmicro.
// 
// LDmicro is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
// 
// LDmicro is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
// 
// You should have received a copy of the GNU General Public License
// along with LDmicro.  If not, see <http://www.gnu.org/licenses/>.
//------
//
// Routines to maintain the stack of recent versions of the program that we
// use for the undo/redo feature. Don't be smart at all; keep deep copies of
// the entire program at all times.
// Jonathan Westhues, split May 2005
//-----------------------------------------------------------------------------
#include "linuxUI.h"
#include <stdio.h>
#include <stdlib.h>
#include <iostream>

#include "ldmicro.h"

using namespace std;

// Store a `deep copy' of the entire program before every change, in a
// circular buffer so that the first one scrolls out as soon as the buffer
// is full and we try to push another one.
#define MAX_LEVELS_UNDO 32
typedef struct ProgramStackTag {
    PlcProgram prog[MAX_LEVELS_UNDO];
    struct {
        int gx;
        int gy;
    } cursor[MAX_LEVELS_UNDO];
    int write;
    int count;
} ProgramStack;

static struct {
    ProgramStack undo;
    ProgramStack redo;
} Undo;

//-----------------------------------------------------------------------------
// Make a `deep copy' of a circuit. Used for making a copy of the program
// whenever we change it, for undo purposes. Fast enough that we shouldn't
// need to be smart.
//-----------------------------------------------------------------------------
static void *DeepCopy(int which, void *any)
{
    switch(which) {
        CASE_LEAF {
            ElemLeaf *l = AllocLeaf();
            memcpy(l, any, sizeof(*l));
            l->selectedState = SELECTED_NONE;
            return l;
        }
        case ELEM_SERIES_SUBCKT: {
            int i;
            ElemSubcktSeries *n = AllocSubcktSeries();
            ElemSubcktSeries *s = (ElemSubcktSeries *)any;
            n->count = s->count;
            for(i = 0; i < s->count; i++) {
                n->contents[i].which = s->contents[i].which;
                n->contents[i].d.any = DeepCopy(s->contents[i].which, 
                    s->contents[i].d.any);
            }
            return n;
        }
        case ELEM_PARALLEL_SUBCKT: {
            int i;
            ElemSubcktParallel *n = AllocSubcktParallel();
            ElemSubcktParallel *p = (ElemSubcktParallel *)any;
            n->count = p->count;
            for(i = 0; i < p->count; i++) {
                n->contents[i].which = p->contents[i].which;
                n->contents[i].d.any = DeepCopy(p->contents[i].which,
                    p->contents[i].d.any);
            }
            return n;
        }
        default:
            oops();
            break;
    }
}

//-----------------------------------------------------------------------------
// Empty out a ProgramStack data structure, either .undo or .redo: set the
// count to zero and free all the program copies in it.
//-----------------------------------------------------------------------------
static void EmptyProgramStack(ProgramStack *ps)
{
    while(ps->count > 0) {
        int a = (ps->write - 1);
        if(a < 0) a += MAX_LEVELS_UNDO;
        ps->write = a;
        (ps->count)--;

        int i;
        for(i = 0; i < ps->prog[ps->write].numRungs; i++) {
            FreeCircuit(ELEM_SERIES_SUBCKT, ps->prog[ps->write].rungs[i]);
        }
    }
}

//-----------------------------------------------------------------------------
// Push the current program onto a program stack. Can either make a deep or
// a shallow copy of the linked data structures.
//-----------------------------------------------------------------------------
static void PushProgramStack(ProgramStack *ps, BOOL deepCopy)
{
    if(ps->count == MAX_LEVELS_UNDO) {
        int i;
        for(i = 0; i < ps->prog[ps->write].numRungs; i++) {
            FreeCircuit(ELEM_SERIES_SUBCKT,
                ps->prog[ps->write].rungs[i]);
        }
    } else {
        (ps->count)++;
    }

    memcpy(&(ps->prog[ps->write]), &Prog, sizeof(Prog));
    if(deepCopy) {
        int i;
        for(i = 0; i < Prog.numRungs; i++) {
            ps->prog[ps->write].rungs[i] =
                (ElemSubcktSeries *)DeepCopy(ELEM_SERIES_SUBCKT, Prog.rungs[i]);
        }
    }

    int gx, gy;
    if(FindSelected(&gx, &gy)) {
        ps->cursor[ps->write].gx = gx;
        ps->cursor[ps->write].gy = gy;
    } else {
        ps->cursor[ps->write].gx = -1;
        ps->cursor[ps->write].gy = -1;
    }

    int a = (ps->write + 1);
    if(a >= MAX_LEVELS_UNDO) a -= MAX_LEVELS_UNDO;
    ps->write = a;
}

//-----------------------------------------------------------------------------
// Pop a program stack onto the current program. Always does a shallow copy.
// Internal error if the stack was empty.
//-----------------------------------------------------------------------------
static void PopProgramStack(ProgramStack *ps)
{
    int a = (ps->write - 1);
    if(a < 0) a += MAX_LEVELS_UNDO;
    ps->write = a;
    (ps->count)--;

    memcpy(&Prog, &ps->prog[ps->write], sizeof(Prog));

    SelectedGxAfterNextPaint = ps->cursor[ps->write].gx;
    SelectedGyAfterNextPaint = ps->cursor[ps->write].gy;
}

//-----------------------------------------------------------------------------
// Push a copy of the PLC program onto the undo history, replacing (and
// freeing) the oldest one if necessary.
//-----------------------------------------------------------------------------
void UndoRemember(void)
{
    // can't redo after modifying the program
    EmptyProgramStack(&(Undo.redo));
    PushProgramStack(&(Undo.undo), TRUE);

    SetUndoEnabled(TRUE, FALSE);
}

//-----------------------------------------------------------------------------
// Pop the undo history one level, or do nothing if we're out of levels of
// undo. This means that we push the current program on the redo stack, and
// pop the undo stack onto the current program.
//-----------------------------------------------------------------------------
void UndoUndo(void)
{
    if(Undo.undo.count <= 0) return;

    ForgetEverything();

    PushProgramStack(&(Undo.redo), FALSE);
    PopProgramStack(&(Undo.undo));

    if(Undo.undo.count > 0) {
        SetUndoEnabled(TRUE, TRUE);
    } else {
        SetUndoEnabled(FALSE, TRUE);
    }
   RefreshControlsToSettings(); 
   RefreshScrollbars();
   InvalidateRect(MainWindow, NULL, FALSE);
}

//-----------------------------------------------------------------------------
// Redo an undone operation. Push the current program onto the undo stack,
// and pop the redo stack into the current program.
//-----------------------------------------------------------------------------
void UndoRedo(void)
{
    if(Undo.redo.count <= 0) return;

    ForgetEverything();

    PushProgramStack(&(Undo.undo), FALSE);
    PopProgramStack(&(Undo.redo));

    if(Undo.redo.count > 0) {
        SetUndoEnabled(TRUE, TRUE);
    } else {
        SetUndoEnabled(TRUE, FALSE);
    }
    RefreshControlsToSettings(); 
    RefreshScrollbars();
    InvalidateRect(MainWindow, NULL, FALSE);
}

//-----------------------------------------------------------------------------
// Empty out our undo history entirely, as when loading a new file.
//-----------------------------------------------------------------------------
void UndoFlush(void)
{
    EmptyProgramStack(&(Undo.undo));
    EmptyProgramStack(&(Undo.redo));
    SetUndoEnabled(FALSE, FALSE);
}

//-----------------------------------------------------------------------------
// Is it possible to undo some operation? The display code needs to do that,
// due to an ugly hack for handling too-long lines; the only thing that
// notices that easily is the display code, which will respond by undoing
// the last operation, presumably the one that added the long line.
//-----------------------------------------------------------------------------
BOOL CanUndo(void)
{
    return (Undo.undo.count > 0);
}