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
|
#if !defined(lint) && !defined(DOS)
static char rcsid[] = "$Id: hist.c 807 2007-11-09 01:21:33Z hubert@u.washington.edu $";
#endif
/*
* ========================================================================
* Copyright 2013-2020 Eduardo Chappa
* Copyright 2006-2007 University of Washington
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* ========================================================================
*/
#include "../pith/headers.h"
#include "../pith/conf.h"
#include "../pith/hist.h"
void
init_hist(HISTORY_S **history, int histsize)
{
size_t l;
if(!history)
return;
if(!*history){
l = sizeof(**history) + histsize * sizeof(ONE_HIST_S);
*history = (HISTORY_S *) fs_get(l);
memset(*history, 0, l);
(*history)->histsize = histsize;
(*history)->origindex = histsize - 1;
add_to_histlist(history);
}
(*history)->curindex = (*history)->origindex;
}
void
free_hist(HISTORY_S **history)
{
int i;
if(history && *history){
for(i = 0; i < (*history)->histsize; i++)
if((*history)->hist[i]){
if((*history)->hist[i]->str)
fs_give((void **) &(*history)->hist[i]->str);
(*history)->hist[i]->cntxt = NULL; /* taken care of elsewhere */
fs_give((void **) &(*history)->hist[i]);
}
fs_give((void **) history);
}
}
char *
hist_in_pos(int pos, char **list, int llen, HISTORY_S *hist, int n)
{
if(pos < 0 || pos > llen + n)
return NULL;
if(pos < llen)
return list[pos];
hist->curindex = (hist->origindex + n - pos + llen) % hist->histsize;
return((hist->hist[hist->curindex] && hist->hist[hist->curindex]->str)
? hist->hist[hist->curindex]->str : NULL);
}
char *
get_prev_hist(HISTORY_S *history, char *savethis, unsigned saveflags, void *cntxt)
{
int nextcurindex;
size_t l;
if(!(history && history->histsize > 0))
return NULL;
nextcurindex = (history->curindex + 1) % history->histsize;
/* already at start of history */
if(nextcurindex == history->origindex
|| !(history->hist[nextcurindex] && history->hist[nextcurindex]->str
&& history->hist[nextcurindex]->str[0]))
return NULL;
/* save what user typed */
if(history->curindex == history->origindex){
if(!savethis)
savethis = "";
if(!history->hist[history->origindex]){
history->hist[history->origindex] = (ONE_HIST_S *) fs_get(sizeof(ONE_HIST_S));
memset(history->hist[history->origindex], 0, sizeof(ONE_HIST_S));
}
if(history->hist[history->origindex]->str){
if(strlen(history->hist[history->origindex]->str) < (l=strlen(savethis)))
fs_resize((void **) &history->hist[history->origindex]->str, l+1);
strncpy(history->hist[history->origindex]->str, savethis, l+1);
history->hist[history->origindex]->str[l] = '\0';
}
else
history->hist[history->origindex]->str = cpystr(savethis);
history->hist[history->origindex]->flags = saveflags;
history->hist[history->origindex]->cntxt = cntxt;
}
history->curindex = nextcurindex;
return((history->hist[history->curindex] && history->hist[history->curindex]->str)
? history->hist[history->curindex]->str : NULL);
}
char *
get_next_hist(HISTORY_S *history, char *savethis, unsigned saveflags, void *cntxt)
{
if(!(history && history->histsize > 0))
return NULL;
/* already at end (most recent) of history */
if(history->curindex == history->origindex)
return NULL;
history->curindex = (history->curindex + history->histsize - 1) % history->histsize;
return((history->hist[history->curindex] && history->hist[history->curindex]->str)
? history->hist[history->curindex]->str : NULL);
}
void
save_hist(HISTORY_S *history, char *savethis, unsigned saveflags, void *cntxt)
{
size_t l;
int plusone;
if(!(history && history->histsize > 0))
return;
plusone = (history->origindex + 1) % history->histsize;
if(!history->hist[history->origindex]){
history->hist[history->origindex] = (ONE_HIST_S *) fs_get(sizeof(ONE_HIST_S));
memset(history->hist[history->origindex], 0, sizeof(ONE_HIST_S));
}
if(savethis && savethis[0]
&& (!history->hist[history->origindex]->str
|| strcmp(history->hist[history->origindex]->str, savethis)
|| history->hist[history->origindex]->flags != saveflags
|| history->hist[history->origindex]->cntxt != cntxt)
&& !(history->hist[plusone] && history->hist[plusone]->str
&& !strcmp(history->hist[plusone]->str, savethis)
&& history->hist[history->origindex]->flags == saveflags
&& history->hist[history->origindex]->cntxt == cntxt)){
if(history->hist[history->origindex]->str){
if(strlen(history->hist[history->origindex]->str) < (l=strlen(savethis)))
fs_resize((void **) &history->hist[history->origindex]->str, l+1);
strncpy(history->hist[history->origindex]->str, savethis, l+1);
history->hist[history->origindex]->str[l] = '\0';
}
else{
history->hist[history->origindex]->str = cpystr(savethis);
}
history->hist[history->origindex]->flags = saveflags;
history->hist[history->origindex]->cntxt = cntxt;
history->origindex = (history->origindex + history->histsize - 1) % history->histsize;
if(history->hist[history->origindex] && history->hist[history->origindex]->str)
history->hist[history->origindex]->str[0] = '\0';
}
}
/*
* Returns count of items entered into history.
*/
int
items_in_hist(HISTORY_S *history)
{
int i, cnt = 0;
if(history && history->histsize > 0)
for(i = 0; i < history->histsize; i++)
if(history->hist[i] && history->hist[i]->str)
cnt++;
return(cnt);
}
static HISTORY_S **histlist[100];
void
add_to_histlist(HISTORY_S **history)
{
int i;
if(history){
/* find empty slot */
for(i = 0; i < 100; i++)
if(!histlist[i])
break;
if(i < 100)
histlist[i] = history;
}
}
void
free_histlist(void)
{
int i;
for(i = 0; i < 100; i++)
if(histlist[i])
free_hist(histlist[i]);
}
|
