search.c revision 1.1 1 1.1 cgd /*-
2 1.1 cgd * Copyright (c) 1992, 1993
3 1.1 cgd * The Regents of the University of California. All rights reserved.
4 1.1 cgd *
5 1.1 cgd * This code is derived from software contributed to Berkeley by
6 1.1 cgd * Christos Zoulas of Cornell University.
7 1.1 cgd *
8 1.1 cgd * Redistribution and use in source and binary forms, with or without
9 1.1 cgd * modification, are permitted provided that the following conditions
10 1.1 cgd * are met:
11 1.1 cgd * 1. Redistributions of source code must retain the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer.
13 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer in the
15 1.1 cgd * documentation and/or other materials provided with the distribution.
16 1.1 cgd * 3. All advertising materials mentioning features or use of this software
17 1.1 cgd * must display the following acknowledgement:
18 1.1 cgd * This product includes software developed by the University of
19 1.1 cgd * California, Berkeley and its contributors.
20 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
21 1.1 cgd * may be used to endorse or promote products derived from this software
22 1.1 cgd * without specific prior written permission.
23 1.1 cgd *
24 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 cgd * SUCH DAMAGE.
35 1.1 cgd */
36 1.1 cgd
37 1.1 cgd #if !defined(lint) && !defined(SCCSID)
38 1.1 cgd static char sccsid[] = "@(#)search.c 8.1 (Berkeley) 6/4/93";
39 1.1 cgd #endif /* not lint && not SCCSID */
40 1.1 cgd
41 1.1 cgd /*
42 1.1 cgd * search.c: History and character search functions
43 1.1 cgd */
44 1.1 cgd #include "sys.h"
45 1.1 cgd #include <stdlib.h>
46 1.1 cgd #ifdef REGEXP
47 1.1 cgd #include <regexp.h>
48 1.1 cgd #endif
49 1.1 cgd #include "el.h"
50 1.1 cgd
51 1.1 cgd /*
52 1.1 cgd * Adjust cursor in vi mode to include the character under it
53 1.1 cgd */
54 1.1 cgd #define EL_CURSOR(el) \
55 1.1 cgd ((el)->el_line.cursor + (((el)->el_map.type == MAP_VI) && \
56 1.1 cgd ((el)->el_map.current == (el)->el_map.alt)))
57 1.1 cgd
58 1.1 cgd /* search_init():
59 1.1 cgd * Initialize the search stuff
60 1.1 cgd */
61 1.1 cgd protected int
62 1.1 cgd search_init(el)
63 1.1 cgd EditLine *el;
64 1.1 cgd {
65 1.1 cgd el->el_search.patbuf = (char *) el_malloc(EL_BUFSIZ);
66 1.1 cgd el->el_search.patlen = 0;
67 1.1 cgd el->el_search.patdir = -1;
68 1.1 cgd el->el_search.chacha = '\0';
69 1.1 cgd el->el_search.chadir = -1;
70 1.1 cgd return 0;
71 1.1 cgd }
72 1.1 cgd
73 1.1 cgd
74 1.1 cgd /* search_end():
75 1.1 cgd * Initialize the search stuff
76 1.1 cgd */
77 1.1 cgd protected void
78 1.1 cgd search_end(el)
79 1.1 cgd EditLine *el;
80 1.1 cgd {
81 1.1 cgd el_free((ptr_t) el->el_search.patbuf);
82 1.1 cgd el->el_search.patbuf = NULL;
83 1.1 cgd }
84 1.1 cgd
85 1.1 cgd #ifdef REGEXP
86 1.1 cgd /* regerror():
87 1.1 cgd * Handle regular expression errors
88 1.1 cgd */
89 1.1 cgd public void
90 1.1 cgd /*ARGSUSED*/
91 1.1 cgd regerror(msg)
92 1.1 cgd const char *msg;
93 1.1 cgd {
94 1.1 cgd }
95 1.1 cgd #endif
96 1.1 cgd
97 1.1 cgd /* el_match():
98 1.1 cgd * Return if string matches pattern
99 1.1 cgd */
100 1.1 cgd protected int
101 1.1 cgd el_match(str, pat)
102 1.1 cgd const char *str;
103 1.1 cgd const char *pat;
104 1.1 cgd {
105 1.1 cgd #ifndef REGEXP
106 1.1 cgd extern char *re_comp __P((const char *));
107 1.1 cgd extern int re_exec __P((const char *));
108 1.1 cgd #else
109 1.1 cgd regexp *re;
110 1.1 cgd int rv;
111 1.1 cgd #endif
112 1.1 cgd
113 1.1 cgd if (strstr(str, pat) != NULL)
114 1.1 cgd return 1;
115 1.1 cgd #ifndef REGEXP
116 1.1 cgd if (re_comp(pat) != NULL)
117 1.1 cgd return 0;
118 1.1 cgd else
119 1.1 cgd return re_exec(str) == 1;
120 1.1 cgd #else
121 1.1 cgd if ((re = regcomp(pat)) != NULL) {
122 1.1 cgd rv = regexec(re, str);
123 1.1 cgd free((ptr_t) re);
124 1.1 cgd }
125 1.1 cgd else
126 1.1 cgd rv = 0;
127 1.1 cgd return rv;
128 1.1 cgd #endif
129 1.1 cgd
130 1.1 cgd }
131 1.1 cgd
132 1.1 cgd
133 1.1 cgd /* c_hmatch():
134 1.1 cgd * return True if the pattern matches the prefix
135 1.1 cgd */
136 1.1 cgd protected int
137 1.1 cgd c_hmatch(el, str)
138 1.1 cgd EditLine *el;
139 1.1 cgd const char *str;
140 1.1 cgd {
141 1.1 cgd #ifdef SDEBUG
142 1.1 cgd (void) fprintf(el->el_errfile, "match `%s' with `%s'\n",
143 1.1 cgd el->el_search.patbuf, str);
144 1.1 cgd #endif /* SDEBUG */
145 1.1 cgd
146 1.1 cgd return el_match(str, el->el_search.patbuf);
147 1.1 cgd }
148 1.1 cgd
149 1.1 cgd
150 1.1 cgd /* c_setpat():
151 1.1 cgd * Set the history seatch pattern
152 1.1 cgd */
153 1.1 cgd protected void
154 1.1 cgd c_setpat(el)
155 1.1 cgd EditLine *el;
156 1.1 cgd {
157 1.1 cgd if (el->el_state.lastcmd != ED_SEARCH_PREV_HISTORY &&
158 1.1 cgd el->el_state.lastcmd != ED_SEARCH_NEXT_HISTORY) {
159 1.1 cgd el->el_search.patlen = EL_CURSOR(el) - el->el_line.buffer;
160 1.1 cgd if (el->el_search.patlen >= EL_BUFSIZ)
161 1.1 cgd el->el_search.patlen = EL_BUFSIZ -1;
162 1.1 cgd if (el->el_search.patlen >= 0) {
163 1.1 cgd (void) strncpy(el->el_search.patbuf, el->el_line.buffer,
164 1.1 cgd el->el_search.patlen);
165 1.1 cgd el->el_search.patbuf[el->el_search.patlen] = '\0';
166 1.1 cgd }
167 1.1 cgd else
168 1.1 cgd el->el_search.patlen = strlen(el->el_search.patbuf);
169 1.1 cgd }
170 1.1 cgd #ifdef SDEBUG
171 1.1 cgd (void) fprintf(el->el_errfile, "\neventno = %d\n", el->el_history.eventno);
172 1.1 cgd (void) fprintf(el->el_errfile, "patlen = %d\n", el->el_search.patlen);
173 1.1 cgd (void) fprintf(el->el_errfile, "patbuf = \"%s\"\n", el->el_search.patbuf);
174 1.1 cgd (void) fprintf(el->el_errfile, "cursor %d lastchar %d\n",
175 1.1 cgd EL_CURSOR(el) - el->el_line.buffer,
176 1.1 cgd el->el_line.lastchar - el->el_line.buffer);
177 1.1 cgd #endif
178 1.1 cgd }
179 1.1 cgd
180 1.1 cgd
181 1.1 cgd /* ce_inc_search():
182 1.1 cgd * Emacs incremental search
183 1.1 cgd */
184 1.1 cgd protected el_action_t
185 1.1 cgd ce_inc_search(el, dir)
186 1.1 cgd EditLine *el;
187 1.1 cgd int dir;
188 1.1 cgd {
189 1.1 cgd static char STRfwd[] = { 'f', 'w', 'd', '\0' },
190 1.1 cgd STRbck[] = { 'b', 'c', 'k', '\0' };
191 1.1 cgd static char pchar = ':'; /* ':' = normal, '?' = failed */
192 1.1 cgd static char endcmd[2] = { '\0', '\0' };
193 1.1 cgd char ch, *cp, *ocursor = el->el_line.cursor, oldpchar = pchar;
194 1.1 cgd
195 1.1 cgd el_action_t ret = CC_NORM;
196 1.1 cgd
197 1.1 cgd int ohisteventno = el->el_history.eventno,
198 1.1 cgd oldpatlen = el->el_search.patlen,
199 1.1 cgd newdir = dir,
200 1.1 cgd done, redo;
201 1.1 cgd
202 1.1 cgd if (el->el_line.lastchar + sizeof(STRfwd) / sizeof(char) + 2 +
203 1.1 cgd el->el_search.patlen >= el->el_line.limit)
204 1.1 cgd return CC_ERROR;
205 1.1 cgd
206 1.1 cgd for (;;) {
207 1.1 cgd
208 1.1 cgd if (el->el_search.patlen == 0) { /* first round */
209 1.1 cgd pchar = ':';
210 1.1 cgd #ifdef ANCHOR
211 1.1 cgd el->el_search.patbuf[el->el_search.patlen++] = '.';
212 1.1 cgd el->el_search.patbuf[el->el_search.patlen++] = '*';
213 1.1 cgd #endif
214 1.1 cgd }
215 1.1 cgd done = redo = 0;
216 1.1 cgd *el->el_line.lastchar++ = '\n';
217 1.1 cgd for (cp = newdir == ED_SEARCH_PREV_HISTORY ? STRbck : STRfwd;
218 1.1 cgd *cp; *el->el_line.lastchar++ = *cp++)
219 1.1 cgd continue;
220 1.1 cgd *el->el_line.lastchar++ = pchar;
221 1.1 cgd for (cp = &el->el_search.patbuf[1];
222 1.1 cgd cp < &el->el_search.patbuf[el->el_search.patlen];
223 1.1 cgd *el->el_line.lastchar++ = *cp++)
224 1.1 cgd continue;
225 1.1 cgd *el->el_line.lastchar = '\0';
226 1.1 cgd re_refresh(el);
227 1.1 cgd
228 1.1 cgd if (el_getc(el, &ch) != 1)
229 1.1 cgd return ed_end_of_file(el, 0);
230 1.1 cgd
231 1.1 cgd switch (el->el_map.current[(unsigned char) ch]) {
232 1.1 cgd case ED_INSERT:
233 1.1 cgd case ED_DIGIT:
234 1.1 cgd if (el->el_search.patlen > EL_BUFSIZ - 3)
235 1.1 cgd term_beep(el);
236 1.1 cgd else {
237 1.1 cgd el->el_search.patbuf[el->el_search.patlen++] = ch;
238 1.1 cgd *el->el_line.lastchar++ = ch;
239 1.1 cgd *el->el_line.lastchar = '\0';
240 1.1 cgd re_refresh(el);
241 1.1 cgd }
242 1.1 cgd break;
243 1.1 cgd
244 1.1 cgd case EM_INC_SEARCH_NEXT:
245 1.1 cgd newdir = ED_SEARCH_NEXT_HISTORY;
246 1.1 cgd redo++;
247 1.1 cgd break;
248 1.1 cgd
249 1.1 cgd case EM_INC_SEARCH_PREV:
250 1.1 cgd newdir = ED_SEARCH_PREV_HISTORY;
251 1.1 cgd redo++;
252 1.1 cgd break;
253 1.1 cgd
254 1.1 cgd case ED_DELETE_PREV_CHAR:
255 1.1 cgd if (el->el_search.patlen > 1)
256 1.1 cgd done++;
257 1.1 cgd else
258 1.1 cgd term_beep(el);
259 1.1 cgd break;
260 1.1 cgd
261 1.1 cgd default:
262 1.1 cgd switch (ch) {
263 1.1 cgd case 0007: /* ^G: Abort */
264 1.1 cgd ret = CC_ERROR;
265 1.1 cgd done++;
266 1.1 cgd break;
267 1.1 cgd
268 1.1 cgd case 0027: /* ^W: Append word */
269 1.1 cgd /* No can do if globbing characters in pattern */
270 1.1 cgd for (cp = &el->el_search.patbuf[1]; ; cp++)
271 1.1 cgd if (cp >= &el->el_search.patbuf[el->el_search.patlen]) {
272 1.1 cgd el->el_line.cursor += el->el_search.patlen - 1;
273 1.1 cgd cp = c__next_word(el->el_line.cursor,
274 1.1 cgd el->el_line.lastchar, 1, ce__isword);
275 1.1 cgd while (el->el_line.cursor < cp &&
276 1.1 cgd *el->el_line.cursor != '\n') {
277 1.1 cgd if (el->el_search.patlen > EL_BUFSIZ - 3) {
278 1.1 cgd term_beep(el);
279 1.1 cgd break;
280 1.1 cgd }
281 1.1 cgd el->el_search.patbuf[el->el_search.patlen++] =
282 1.1 cgd *el->el_line.cursor;
283 1.1 cgd *el->el_line.lastchar++ = *el->el_line.cursor++;
284 1.1 cgd }
285 1.1 cgd el->el_line.cursor = ocursor;
286 1.1 cgd *el->el_line.lastchar = '\0';
287 1.1 cgd re_refresh(el);
288 1.1 cgd break;
289 1.1 cgd } else if (isglob(*cp)) {
290 1.1 cgd term_beep(el);
291 1.1 cgd break;
292 1.1 cgd }
293 1.1 cgd break;
294 1.1 cgd
295 1.1 cgd default: /* Terminate and execute cmd */
296 1.1 cgd endcmd[0] = ch;
297 1.1 cgd el_push(el, endcmd);
298 1.1 cgd /*FALLTHROUGH*/
299 1.1 cgd
300 1.1 cgd case 0033: /* ESC: Terminate */
301 1.1 cgd ret = CC_REFRESH;
302 1.1 cgd done++;
303 1.1 cgd break;
304 1.1 cgd }
305 1.1 cgd break;
306 1.1 cgd }
307 1.1 cgd
308 1.1 cgd while (el->el_line.lastchar > el->el_line.buffer &&
309 1.1 cgd *el->el_line.lastchar != '\n')
310 1.1 cgd *el->el_line.lastchar-- = '\0';
311 1.1 cgd *el->el_line.lastchar = '\0';
312 1.1 cgd
313 1.1 cgd if (!done) {
314 1.1 cgd
315 1.1 cgd /* Can't search if unmatched '[' */
316 1.1 cgd for (cp = &el->el_search.patbuf[el->el_search.patlen-1], ch = ']';
317 1.1 cgd cp > el->el_search.patbuf; cp--)
318 1.1 cgd if (*cp == '[' || *cp == ']') {
319 1.1 cgd ch = *cp;
320 1.1 cgd break;
321 1.1 cgd }
322 1.1 cgd
323 1.1 cgd if (el->el_search.patlen > 1 && ch != '[') {
324 1.1 cgd if (redo && newdir == dir) {
325 1.1 cgd if (pchar == '?') { /* wrap around */
326 1.1 cgd el->el_history.eventno =
327 1.1 cgd newdir == ED_SEARCH_PREV_HISTORY ? 0 : 0x7fffffff;
328 1.1 cgd if (hist_get(el) == CC_ERROR)
329 1.1 cgd /* el->el_history.eventno was fixed by first call */
330 1.1 cgd (void) hist_get(el);
331 1.1 cgd el->el_line.cursor = newdir == ED_SEARCH_PREV_HISTORY ?
332 1.1 cgd el->el_line.lastchar : el->el_line.buffer;
333 1.1 cgd } else
334 1.1 cgd el->el_line.cursor +=
335 1.1 cgd newdir == ED_SEARCH_PREV_HISTORY ? -1 : 1;
336 1.1 cgd }
337 1.1 cgd #ifdef ANCHOR
338 1.1 cgd el->el_search.patbuf[el->el_search.patlen++] = '.';
339 1.1 cgd el->el_search.patbuf[el->el_search.patlen++] = '*';
340 1.1 cgd #endif
341 1.1 cgd el->el_search.patbuf[el->el_search.patlen] = '\0';
342 1.1 cgd if (el->el_line.cursor < el->el_line.buffer ||
343 1.1 cgd el->el_line.cursor > el->el_line.lastchar ||
344 1.1 cgd (ret = ce_search_line(el, &el->el_search.patbuf[1],
345 1.1 cgd newdir)) == CC_ERROR) {
346 1.1 cgd /* avoid c_setpat */
347 1.1 cgd el->el_state.lastcmd = (el_action_t) newdir;
348 1.1 cgd ret = newdir == ED_SEARCH_PREV_HISTORY ?
349 1.1 cgd ed_search_prev_history(el, 0) :
350 1.1 cgd ed_search_next_history(el, 0);
351 1.1 cgd if (ret != CC_ERROR) {
352 1.1 cgd el->el_line.cursor = newdir == ED_SEARCH_PREV_HISTORY ?
353 1.1 cgd el->el_line.lastchar : el->el_line.buffer;
354 1.1 cgd (void) ce_search_line(el, &el->el_search.patbuf[1],
355 1.1 cgd newdir);
356 1.1 cgd }
357 1.1 cgd }
358 1.1 cgd el->el_search.patbuf[--el->el_search.patlen] = '\0';
359 1.1 cgd if (ret == CC_ERROR) {
360 1.1 cgd term_beep(el);
361 1.1 cgd if (el->el_history.eventno != ohisteventno) {
362 1.1 cgd el->el_history.eventno = ohisteventno;
363 1.1 cgd if (hist_get(el) == CC_ERROR)
364 1.1 cgd return CC_ERROR;
365 1.1 cgd }
366 1.1 cgd el->el_line.cursor = ocursor;
367 1.1 cgd pchar = '?';
368 1.1 cgd } else {
369 1.1 cgd pchar = ':';
370 1.1 cgd }
371 1.1 cgd }
372 1.1 cgd
373 1.1 cgd ret = ce_inc_search(el, newdir);
374 1.1 cgd
375 1.1 cgd if (ret == CC_ERROR && pchar == '?' && oldpchar == ':')
376 1.1 cgd /* break abort of failed search at last non-failed */
377 1.1 cgd ret = CC_NORM;
378 1.1 cgd
379 1.1 cgd }
380 1.1 cgd
381 1.1 cgd if (ret == CC_NORM || (ret == CC_ERROR && oldpatlen == 0)) {
382 1.1 cgd /* restore on normal return or error exit */
383 1.1 cgd pchar = oldpchar;
384 1.1 cgd el->el_search.patlen = oldpatlen;
385 1.1 cgd if (el->el_history.eventno != ohisteventno) {
386 1.1 cgd el->el_history.eventno = ohisteventno;
387 1.1 cgd if (hist_get(el) == CC_ERROR)
388 1.1 cgd return CC_ERROR;
389 1.1 cgd }
390 1.1 cgd el->el_line.cursor = ocursor;
391 1.1 cgd if (ret == CC_ERROR)
392 1.1 cgd re_refresh(el);
393 1.1 cgd }
394 1.1 cgd if (done || ret != CC_NORM)
395 1.1 cgd return ret;
396 1.1 cgd }
397 1.1 cgd }
398 1.1 cgd
399 1.1 cgd
400 1.1 cgd /* cv_search():
401 1.1 cgd * Vi search.
402 1.1 cgd */
403 1.1 cgd protected el_action_t
404 1.1 cgd cv_search(el, dir)
405 1.1 cgd EditLine *el;
406 1.1 cgd int dir;
407 1.1 cgd {
408 1.1 cgd char ch;
409 1.1 cgd char tmpbuf[EL_BUFSIZ];
410 1.1 cgd int tmplen;
411 1.1 cgd
412 1.1 cgd tmplen = 0;
413 1.1 cgd #ifdef ANCHOR
414 1.1 cgd tmpbuf[tmplen++] = '.';
415 1.1 cgd tmpbuf[tmplen++] = '*';
416 1.1 cgd #endif
417 1.1 cgd
418 1.1 cgd el->el_line.buffer[0] = '\0';
419 1.1 cgd el->el_line.lastchar = el->el_line.buffer;
420 1.1 cgd el->el_line.cursor = el->el_line.buffer;
421 1.1 cgd el->el_search.patdir = dir;
422 1.1 cgd
423 1.1 cgd c_insert(el, 2); /* prompt + '\n' */
424 1.1 cgd *el->el_line.cursor++ = '\n';
425 1.1 cgd *el->el_line.cursor++ = dir == ED_SEARCH_PREV_HISTORY ? '/' : '?';
426 1.1 cgd re_refresh(el);
427 1.1 cgd
428 1.1 cgd #ifdef ANCHOR
429 1.1 cgd # define LEN 2
430 1.1 cgd #else
431 1.1 cgd # define LEN 0
432 1.1 cgd #endif
433 1.1 cgd
434 1.1 cgd tmplen = c_gets(el, &tmpbuf[LEN]) + LEN;
435 1.1 cgd ch = tmpbuf[tmplen];
436 1.1 cgd tmpbuf[tmplen] = '\0';
437 1.1 cgd
438 1.1 cgd if (tmplen == LEN) {
439 1.1 cgd /*
440 1.1 cgd * Use the old pattern, but wild-card it.
441 1.1 cgd */
442 1.1 cgd if (el->el_search.patlen == 0) {
443 1.1 cgd el->el_line.buffer[0] = '\0';
444 1.1 cgd el->el_line.lastchar = el->el_line.buffer;
445 1.1 cgd el->el_line.cursor = el->el_line.buffer;
446 1.1 cgd re_refresh(el);
447 1.1 cgd return CC_ERROR;
448 1.1 cgd }
449 1.1 cgd #ifdef ANCHOR
450 1.1 cgd if (el->el_search.patbuf[0] != '.' && el->el_search.patbuf[0] != '*') {
451 1.1 cgd (void) strcpy(tmpbuf, el->el_search.patbuf);
452 1.1 cgd el->el_search.patbuf[0] = '.';
453 1.1 cgd el->el_search.patbuf[1] = '*';
454 1.1 cgd (void) strcpy(&el->el_search.patbuf[2], tmpbuf);
455 1.1 cgd el->el_search.patlen++;
456 1.1 cgd el->el_search.patbuf[el->el_search.patlen++] = '.';
457 1.1 cgd el->el_search.patbuf[el->el_search.patlen++] = '*';
458 1.1 cgd el->el_search.patbuf[el->el_search.patlen] = '\0';
459 1.1 cgd }
460 1.1 cgd #endif
461 1.1 cgd }
462 1.1 cgd else {
463 1.1 cgd #ifdef ANCHOR
464 1.1 cgd tmpbuf[tmplen++] = '.';
465 1.1 cgd tmpbuf[tmplen++] = '*';
466 1.1 cgd #endif
467 1.1 cgd tmpbuf[tmplen] = '\0';
468 1.1 cgd (void) strcpy(el->el_search.patbuf, tmpbuf);
469 1.1 cgd el->el_search.patlen = tmplen;
470 1.1 cgd }
471 1.1 cgd el->el_state.lastcmd = (el_action_t) dir; /* avoid c_setpat */
472 1.1 cgd el->el_line.cursor = el->el_line.lastchar = el->el_line.buffer;
473 1.1 cgd if ((dir == ED_SEARCH_PREV_HISTORY ? ed_search_prev_history(el, 0) :
474 1.1 cgd ed_search_next_history(el, 0)) == CC_ERROR) {
475 1.1 cgd re_refresh(el);
476 1.1 cgd return CC_ERROR;
477 1.1 cgd }
478 1.1 cgd else {
479 1.1 cgd if (ch == 0033) {
480 1.1 cgd re_refresh(el);
481 1.1 cgd *el->el_line.lastchar++ = '\n';
482 1.1 cgd *el->el_line.lastchar = '\0';
483 1.1 cgd re_goto_bottom(el);
484 1.1 cgd return CC_NEWLINE;
485 1.1 cgd }
486 1.1 cgd else
487 1.1 cgd return CC_REFRESH;
488 1.1 cgd }
489 1.1 cgd }
490 1.1 cgd
491 1.1 cgd
492 1.1 cgd /* ce_search_line():
493 1.1 cgd * Look for a pattern inside a line
494 1.1 cgd */
495 1.1 cgd protected el_action_t
496 1.1 cgd ce_search_line(el, pattern, dir)
497 1.1 cgd EditLine *el;
498 1.1 cgd char *pattern;
499 1.1 cgd int dir;
500 1.1 cgd {
501 1.1 cgd char *cp;
502 1.1 cgd
503 1.1 cgd if (dir == ED_SEARCH_PREV_HISTORY) {
504 1.1 cgd for (cp = el->el_line.cursor; cp >= el->el_line.buffer; cp--)
505 1.1 cgd if (el_match(cp, pattern)) {
506 1.1 cgd el->el_line.cursor = cp;
507 1.1 cgd return CC_NORM;
508 1.1 cgd }
509 1.1 cgd return CC_ERROR;
510 1.1 cgd } else {
511 1.1 cgd for (cp = el->el_line.cursor; *cp != '\0' &&
512 1.1 cgd cp < el->el_line.limit; cp++)
513 1.1 cgd if (el_match(cp, pattern)) {
514 1.1 cgd el->el_line.cursor = cp;
515 1.1 cgd return CC_NORM;
516 1.1 cgd }
517 1.1 cgd return CC_ERROR;
518 1.1 cgd }
519 1.1 cgd }
520 1.1 cgd
521 1.1 cgd
522 1.1 cgd /* cv_repeat_srch():
523 1.1 cgd * Vi repeat search
524 1.1 cgd */
525 1.1 cgd protected el_action_t
526 1.1 cgd cv_repeat_srch(el, c)
527 1.1 cgd EditLine *el;
528 1.1 cgd int c;
529 1.1 cgd {
530 1.1 cgd #ifdef SDEBUG
531 1.1 cgd (void) fprintf(el->el_errfile, "dir %d patlen %d patbuf %s\n",
532 1.1 cgd c, el->el_search.patlen, el->el_search.patbuf);
533 1.1 cgd #endif
534 1.1 cgd
535 1.1 cgd el->el_state.lastcmd = (el_action_t) c; /* Hack to stop c_setpat */
536 1.1 cgd el->el_line.lastchar = el->el_line.buffer;
537 1.1 cgd
538 1.1 cgd switch (c) {
539 1.1 cgd case ED_SEARCH_NEXT_HISTORY:
540 1.1 cgd return ed_search_next_history(el, 0);
541 1.1 cgd case ED_SEARCH_PREV_HISTORY:
542 1.1 cgd return ed_search_prev_history(el, 0);
543 1.1 cgd default:
544 1.1 cgd return CC_ERROR;
545 1.1 cgd }
546 1.1 cgd }
547 1.1 cgd
548 1.1 cgd
549 1.1 cgd /* cv_csearch_back():
550 1.1 cgd * Vi character search reverse
551 1.1 cgd */
552 1.1 cgd protected el_action_t
553 1.1 cgd cv_csearch_back(el, ch, count, tflag)
554 1.1 cgd EditLine *el;
555 1.1 cgd int ch, count, tflag;
556 1.1 cgd {
557 1.1 cgd char *cp;
558 1.1 cgd
559 1.1 cgd cp = el->el_line.cursor;
560 1.1 cgd while (count--) {
561 1.1 cgd if (*cp == ch)
562 1.1 cgd cp--;
563 1.1 cgd while (cp > el->el_line.buffer && *cp != ch)
564 1.1 cgd cp--;
565 1.1 cgd }
566 1.1 cgd
567 1.1 cgd if (cp < el->el_line.buffer || (cp == el->el_line.buffer && *cp != ch))
568 1.1 cgd return CC_ERROR;
569 1.1 cgd
570 1.1 cgd if (*cp == ch && tflag)
571 1.1 cgd cp++;
572 1.1 cgd
573 1.1 cgd el->el_line.cursor = cp;
574 1.1 cgd
575 1.1 cgd if (el->el_chared.c_vcmd.action & DELETE) {
576 1.1 cgd el->el_line.cursor++;
577 1.1 cgd cv_delfini(el);
578 1.1 cgd return CC_REFRESH;
579 1.1 cgd }
580 1.1 cgd
581 1.1 cgd re_refresh_cursor(el);
582 1.1 cgd return CC_NORM;
583 1.1 cgd }
584 1.1 cgd
585 1.1 cgd
586 1.1 cgd /* cv_csearch_fwd():
587 1.1 cgd * Vi character search forward
588 1.1 cgd */
589 1.1 cgd protected el_action_t
590 1.1 cgd cv_csearch_fwd(el, ch, count, tflag)
591 1.1 cgd EditLine *el;
592 1.1 cgd int ch, count, tflag;
593 1.1 cgd {
594 1.1 cgd char *cp;
595 1.1 cgd
596 1.1 cgd cp = el->el_line.cursor;
597 1.1 cgd while (count--) {
598 1.1 cgd if(*cp == ch)
599 1.1 cgd cp++;
600 1.1 cgd while (cp < el->el_line.lastchar && *cp != ch)
601 1.1 cgd cp++;
602 1.1 cgd }
603 1.1 cgd
604 1.1 cgd if (cp >= el->el_line.lastchar)
605 1.1 cgd return CC_ERROR;
606 1.1 cgd
607 1.1 cgd if (*cp == ch && tflag)
608 1.1 cgd cp--;
609 1.1 cgd
610 1.1 cgd el->el_line.cursor = cp;
611 1.1 cgd
612 1.1 cgd if (el->el_chared.c_vcmd.action & DELETE) {
613 1.1 cgd el->el_line.cursor++;
614 1.1 cgd cv_delfini(el);
615 1.1 cgd return CC_REFRESH;
616 1.1 cgd }
617 1.1 cgd re_refresh_cursor(el);
618 1.1 cgd return CC_NORM;
619 1.1 cgd }
620