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