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