1 /*-
2 * Copyright (c) 1992, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Christos Zoulas of Cornell University.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
31 *
32 * $NetBSD: hist.c,v 1.15 2003/11/01 23:36:39 christos Exp $
33 */
34
35 #if !defined(lint) && !defined(SCCSID)
36 static char sccsid[] = "@(#)hist.c 8.1 (Berkeley) 6/4/93";
37 #endif /* not lint && not SCCSID */
38 #include <sys/cdefs.h>
39 __FBSDID("$FreeBSD$");
40
41 /*
42 * hist.c: History access functions
43 */
44 #include "sys.h"
45 #include <stdlib.h>
46 #include "el.h"
47
48 /* hist_init():
49 * Initialization function.
50 */
51 protected int
hist_init(EditLine * el)52 hist_init(EditLine *el)
53 {
54
55 el->el_history.fun = NULL;
56 el->el_history.ref = NULL;
57 el->el_history.buf = (char *) el_malloc(EL_BUFSIZ);
58 el->el_history.sz = EL_BUFSIZ;
59 if (el->el_history.buf == NULL)
60 return (-1);
61 el->el_history.last = el->el_history.buf;
62 return (0);
63 }
64
65
66 /* hist_end():
67 * clean up history;
68 */
69 protected void
hist_end(EditLine * el)70 hist_end(EditLine *el)
71 {
72
73 el_free((ptr_t) el->el_history.buf);
74 el->el_history.buf = NULL;
75 }
76
77
78 /* hist_set():
79 * Set new history interface
80 */
81 protected int
hist_set(EditLine * el,hist_fun_t fun,ptr_t ptr)82 hist_set(EditLine *el, hist_fun_t fun, ptr_t ptr)
83 {
84
85 el->el_history.ref = ptr;
86 el->el_history.fun = fun;
87 return (0);
88 }
89
90
91 /* hist_get():
92 * Get a history line and update it in the buffer.
93 * eventno tells us the event to get.
94 */
95 protected el_action_t
hist_get(EditLine * el)96 hist_get(EditLine *el)
97 {
98 const char *hp;
99 int h;
100
101 if (el->el_history.eventno == 0) { /* if really the current line */
102 (void) strncpy(el->el_line.buffer, el->el_history.buf,
103 el->el_history.sz);
104 el->el_line.lastchar = el->el_line.buffer +
105 (el->el_history.last - el->el_history.buf);
106
107 #ifdef KSHVI
108 if (el->el_map.type == MAP_VI)
109 el->el_line.cursor = el->el_line.buffer;
110 else
111 #endif /* KSHVI */
112 el->el_line.cursor = el->el_line.lastchar;
113
114 return (CC_REFRESH);
115 }
116 if (el->el_history.ref == NULL)
117 return (CC_ERROR);
118
119 hp = HIST_FIRST(el);
120
121 if (hp == NULL)
122 return (CC_ERROR);
123
124 for (h = 1; h < el->el_history.eventno; h++)
125 if ((hp = HIST_NEXT(el)) == NULL) {
126 el->el_history.eventno = h;
127 return (CC_ERROR);
128 }
129 (void) strlcpy(el->el_line.buffer, hp,
130 (size_t)(el->el_line.limit - el->el_line.buffer));
131 el->el_line.lastchar = el->el_line.buffer + strlen(el->el_line.buffer);
132
133 if (el->el_line.lastchar > el->el_line.buffer
134 && el->el_line.lastchar[-1] == '\n')
135 el->el_line.lastchar--;
136 if (el->el_line.lastchar > el->el_line.buffer
137 && el->el_line.lastchar[-1] == ' ')
138 el->el_line.lastchar--;
139 #ifdef KSHVI
140 if (el->el_map.type == MAP_VI)
141 el->el_line.cursor = el->el_line.buffer;
142 else
143 #endif /* KSHVI */
144 el->el_line.cursor = el->el_line.lastchar;
145
146 return (CC_REFRESH);
147 }
148
149
150 /* hist_command()
151 * process a history command
152 */
153 protected int
hist_command(EditLine * el,int argc,const char ** argv)154 hist_command(EditLine *el, int argc, const char **argv)
155 {
156 const char *str;
157 int num;
158 HistEvent ev;
159
160 if (el->el_history.ref == NULL)
161 return (-1);
162
163 if (argc == 1 || strcmp(argv[1], "list") == 0) {
164 /* List history entries */
165
166 for (str = HIST_LAST(el); str != NULL; str = HIST_PREV(el))
167 (void) fprintf(el->el_outfile, "%d %s",
168 el->el_history.ev.num, str);
169 return (0);
170 }
171
172 if (argc != 3)
173 return (-1);
174
175 num = (int)strtol(argv[2], NULL, 0);
176
177 if (strcmp(argv[1], "size") == 0)
178 return history(el->el_history.ref, &ev, H_SETSIZE, num);
179
180 if (strcmp(argv[1], "unique") == 0)
181 return history(el->el_history.ref, &ev, H_SETUNIQUE, num);
182
183 return -1;
184 }
185
186 /* hist_enlargebuf()
187 * Enlarge history buffer to specified value. Called from el_enlargebufs().
188 * Return 0 for failure, 1 for success.
189 */
190 protected int
191 /*ARGSUSED*/
hist_enlargebuf(EditLine * el,size_t oldsz,size_t newsz)192 hist_enlargebuf(EditLine *el, size_t oldsz, size_t newsz)
193 {
194 char *newbuf;
195
196 newbuf = realloc(el->el_history.buf, newsz);
197 if (!newbuf)
198 return 0;
199
200 (void) memset(&newbuf[oldsz], '\0', newsz - oldsz);
201
202 el->el_history.last = newbuf +
203 (el->el_history.last - el->el_history.buf);
204 el->el_history.buf = newbuf;
205 el->el_history.sz = newsz;
206
207 return 1;
208 }
209