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
|
/*
* Copyright 2004-2005 Timo Hirvonen
*
* 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 2 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, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
* 02111-1307, USA.
*/
#include <history.h>
#include <xmalloc.h>
#include <file.h>
#include <uchar.h>
#include <list.h>
#include <sys/types.h>
#include <fcntl.h>
#include <unistd.h>
struct history_entry {
struct list_head node;
char text[0];
};
static struct history_entry *history_entry_new(const char *text)
{
struct history_entry *new;
int size = strlen(text) + 1;
new = xmalloc(sizeof(struct history_entry) + size);
memcpy(new->text, text, size);
return new;
}
static int history_add_tail(void *data, const char *line)
{
struct history *history = data;
if (history->lines < history->max_lines) {
struct history_entry *new;
new = history_entry_new(line);
list_add_tail(&new->node, &history->head);
history->lines++;
}
return 0;
}
void history_load(struct history *history, char *filename, int max_lines)
{
list_init(&history->head);
history->max_lines = max_lines;
history->lines = 0;
history->search_pos = NULL;
history->filename = filename;
file_for_each_line(filename, history_add_tail, history);
}
void history_save(struct history *history)
{
struct list_head *item;
int fd;
fd = open(history->filename, O_CREAT | O_WRONLY | O_TRUNC, 0666);
if (fd == -1)
return;
list_for_each(item, &history->head) {
struct history_entry *history_entry;
const char nl = '\n';
history_entry = list_entry(item, struct history_entry, node);
write(fd, history_entry->text, strlen(history_entry->text));
write(fd, &nl, 1);
}
close(fd);
}
void history_add_line(struct history *history, const char *line)
{
struct history_entry *new;
struct list_head *item;
new = history_entry_new(line);
list_add(&new->node, &history->head);
history->lines++;
/* remove identical */
item = history->head.next->next;
while (item != &history->head) {
struct list_head *next = item->next;
struct history_entry *hentry;
hentry = container_of(item, struct history_entry, node);
if (strcmp(hentry->text, new->text) == 0) {
list_del(item);
free(hentry);
history->lines--;
}
item = next;
}
/* remove oldest if history is 'full' */
if (history->lines > history->max_lines) {
struct list_head *node;
struct history_entry *hentry;
node = history->head.prev;
list_del(node);
hentry = list_entry(node, struct history_entry, node);
free(hentry);
history->lines--;
}
}
void history_reset_search(struct history *history)
{
history->search_pos = NULL;
}
const char *history_search_forward(struct history *history, const char *text)
{
struct list_head *item;
int search_len;
if (history->search_pos == NULL) {
/* first time to search. set search */
item = history->head.next;
} else {
item = history->search_pos->next;
}
search_len = strlen(text);
while (item != &history->head) {
struct history_entry *hentry;
hentry = list_entry(item, struct history_entry, node);
if (strncmp(text, hentry->text, search_len) == 0) {
history->search_pos = item;
return hentry->text;
}
item = item->next;
}
return NULL;
}
const char *history_search_backward(struct history *history, const char *text)
{
struct list_head *item;
int search_len;
if (history->search_pos == NULL)
return NULL;
item = history->search_pos->prev;
search_len = strlen(text);
while (item != &history->head) {
struct history_entry *hentry;
hentry = list_entry(item, struct history_entry, node);
if (strncmp(text, hentry->text, search_len) == 0) {
history->search_pos = item;
return hentry->text;
}
item = item->prev;
}
history->search_pos = NULL;
return NULL;
}
|