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
|
/*
* Copyright (C) 2012-2015 Robin Haberkorn
*
* This program 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.
*
* This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include <stdio.h>
#include <bsd/sys/queue.h>
#include <glib.h>
#include <glib/gstdio.h>
#include <Scintilla.h>
#include "sciteco.h"
#include "cmdline.h"
#include "interface.h"
#include "error.h"
#include "undo.h"
#define SIZE_TO_MB(SIZE) ((gdouble)(SIZE))/(1024*1024)
namespace SciTECO {
//#define DEBUG
UndoStack undo;
void
UndoStack::set_memory_limit(gsize new_limit)
{
if (new_limit) {
if (!memory_limit) {
/* memory_usage outdated - recalculate */
UndoToken *token;
memory_usage = 0;
SLIST_FOREACH(token, &head, tokens)
memory_usage += token->get_size();
}
if (memory_usage > new_limit)
throw Error("Cannot set undo memory limit (%gmb): "
"Current stack too large (%gmb).",
SIZE_TO_MB(new_limit),
SIZE_TO_MB(memory_usage));
}
push_var(memory_limit) = new_limit;
}
void
UndoStack::push(UndoToken *token)
{
if (!enabled) {
delete token;
return;
}
if (memory_limit) {
gsize token_size = token->get_size();
if (memory_usage + token_size > memory_limit) {
delete token;
throw Error("Undo stack memory limit (%gmb) exceeded. "
"See <EJ> command.",
SIZE_TO_MB(memory_limit));
}
memory_usage += token_size;
}
#ifdef DEBUG
g_printf("UNDO PUSH %p\n", token);
#endif
token->pc = cmdline.pc;
SLIST_INSERT_HEAD(&head, token, tokens);
}
void
UndoStack::pop(gint pc)
{
while (!SLIST_EMPTY(&head) && SLIST_FIRST(&head)->pc >= pc) {
UndoToken *top = SLIST_FIRST(&head);
#ifdef DEBUG
g_printf("UNDO POP %p\n", top);
fflush(stdout);
#endif
if (memory_limit)
memory_usage -= top->get_size();
top->run();
SLIST_REMOVE_HEAD(&head, tokens);
delete top;
}
}
void
UndoStack::clear(void)
{
UndoToken *cur;
while ((cur = SLIST_FIRST(&head))) {
SLIST_REMOVE_HEAD(&head, tokens);
delete cur;
}
memory_usage = 0;
}
UndoStack::~UndoStack()
{
UndoToken *token, *next;
SLIST_FOREACH_SAFE(token, &head, tokens, next)
delete token;
}
} /* namespace SciTECO */
|
