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