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
|
#include <errno.h>
#include <stdlib.h>
#include <string.h>
#include "history.h"
#include "error.h"
#include "util/debug.h"
#include "util/readfile.h"
#include "util/str-util.h"
#include "util/xmalloc.h"
#include "util/xstdio.h"
void history_add(History *history, const char *text)
{
BUG_ON(history->max_entries < 2);
if (text[0] == '\0') {
return;
}
HashMap *map = &history->entries;
HistoryEntry *e = hashmap_get(map, text);
if (e) {
if (e == history->last) {
// Existing entry already at end of list; nothing more to do
return;
}
// Remove existing entry from list
e->next->prev = e->prev;
if (unlikely(e == history->first)) {
history->first = e->next;
} else {
e->prev->next = e->next;
}
} else {
if (map->count == history->max_entries) {
// History is full; recycle oldest entry
HistoryEntry *old_first = history->first;
HistoryEntry *new_first = old_first->next;
new_first->prev = NULL;
history->first = new_first;
e = hashmap_remove(map, old_first->text);
BUG_ON(e != old_first);
} else {
e = xnew(HistoryEntry, 1);
}
e->text = xstrdup(text);
hashmap_insert(map, e->text, e);
}
// Insert entry at end of list
HistoryEntry *old_last = history->last;
e->next = NULL;
e->prev = old_last;
history->last = e;
if (likely(old_last)) {
old_last->next = e;
} else {
history->first = e;
}
}
bool history_search_forward (
const History *history,
const HistoryEntry **pos,
const char *text
) {
const HistoryEntry *start = *pos ? (*pos)->prev : history->last;
for (const HistoryEntry *e = start; e; e = e->prev) {
if (str_has_prefix(e->text, text)) {
*pos = e;
return true;
}
}
return false;
}
bool history_search_backward (
const History *history,
const HistoryEntry **pos,
const char *text
) {
const HistoryEntry *start = *pos ? (*pos)->next : history->first;
for (const HistoryEntry *e = start; e; e = e->next) {
if (str_has_prefix(e->text, text)) {
*pos = e;
return true;
}
}
return false;
}
void history_load(History *history, char *filename)
{
BUG_ON(!history);
BUG_ON(!filename);
BUG_ON(history->filename);
BUG_ON(history->max_entries < 2);
hashmap_init(&history->entries, history->max_entries);
history->filename = filename;
char *buf;
const ssize_t ssize = read_file(filename, &buf);
if (ssize < 0) {
if (errno != ENOENT) {
error_msg("Error reading %s: %s", filename, strerror(errno));
}
return;
}
for (size_t pos = 0, size = ssize; pos < size; ) {
history_add(history, buf_next_line(buf, &pos, size));
}
free(buf);
}
void history_save(const History *history)
{
const char *filename = history->filename;
if (!filename) {
return;
}
FILE *f = xfopen(filename, "w", O_CLOEXEC, 0666);
if (!f) {
error_msg("Error creating %s: %s", filename, strerror(errno));
return;
}
for (const HistoryEntry *e = history->first; e; e = e->next) {
xfputs(e->text, f);
xfputc('\n', f);
}
fclose(f);
}
void history_free(History *history)
{
hashmap_free(&history->entries, free);
free(history->filename);
history->filename = NULL;
history->first = NULL;
history->last = NULL;
}
|
