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
|
/*
* Copyright (C) 1996-2000 Michael R. Elkins <me@cs.hmc.edu>
*
* 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., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include "mutt.h"
#include "history.h"
/* global vars used for the string-history routines */
struct history
{
char **hist;
short cur;
short last;
};
static struct history History[HC_LAST];
static int OldSize = 0;
static void init_history (struct history *h)
{
int i;
if(OldSize)
{
if (h->hist)
{
for (i = 0 ; i < OldSize ; i ++)
safe_free ((void **) &h->hist[i]);
safe_free ((void **) &h->hist);
}
}
if (HistSize)
h->hist = safe_calloc (HistSize, sizeof (char *));
h->cur = 0;
h->last = 0;
}
void mutt_init_history(void)
{
history_class_t hclass;
if (HistSize == OldSize)
return;
for(hclass = HC_FIRST; hclass < HC_LAST; hclass++)
init_history(&History[hclass]);
OldSize = HistSize;
}
void mutt_history_add (history_class_t hclass, const char *s)
{
int prev;
struct history *h = &History[hclass];
if (!HistSize)
return; /* disabled */
if (*s)
{
prev = h->last - 1;
if (prev < 0) prev = HistSize - 1;
if (!h->hist[prev] || mutt_strcmp (h->hist[prev], s) != 0)
{
mutt_str_replace (&h->hist[h->last++], s);
if (h->last > HistSize - 1)
h->last = 0;
}
}
h->cur = h->last; /* reset to the last entry */
}
char *mutt_history_next (history_class_t hclass)
{
int next;
struct history *h = &History[hclass];
if (!HistSize)
return (""); /* disabled */
next = h->cur + 1;
if (next > h->last - 1)
next = 0;
if (h->hist[next])
h->cur = next;
return (h->hist[h->cur] ? h->hist[h->cur] : "");
}
char *mutt_history_prev (history_class_t hclass)
{
int prev;
struct history *h = &History[hclass];
if (!HistSize)
return (""); /* disabled */
prev = h->cur - 1;
if (prev < 0)
{
prev = h->last - 1;
if (prev < 0)
{
prev = HistSize - 1;
while (prev > 0 && h->hist[prev] == NULL)
prev--;
}
}
if (h->hist[prev])
h->cur = prev;
return (h->hist[h->cur] ? h->hist[h->cur] : "");
}
|
