emacs.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[] = "@(#)emacs.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 * emacs.c: Emacs functions
43 1.1 cgd */
44 1.1 cgd #include "sys.h"
45 1.1 cgd #include "el.h"
46 1.1 cgd
47 1.1 cgd /* em_delete_or_list():
48 1.1 cgd * Delete character under cursor or list completions if at end of line
49 1.1 cgd * [^D]
50 1.1 cgd */
51 1.1 cgd protected el_action_t
52 1.1 cgd /*ARGSUSED*/
53 1.1 cgd em_delete_or_list(el, c)
54 1.1 cgd EditLine *el;
55 1.1 cgd int c;
56 1.1 cgd {
57 1.1 cgd if (el->el_line.cursor == el->el_line.lastchar) { /* if I'm at the end */
58 1.1 cgd if (el->el_line.cursor == el->el_line.buffer) { /* and the beginning */
59 1.1 cgd term_overwrite(el, STReof, 4);/* then do a EOF */
60 1.1 cgd term__flush();
61 1.1 cgd return CC_EOF;
62 1.1 cgd }
63 1.1 cgd else {
64 1.2 cgd /* Here we could list completions, but it is an error right now */
65 1.2 cgd term_beep(el);
66 1.2 cgd return CC_ERROR;
67 1.1 cgd }
68 1.1 cgd }
69 1.1 cgd else {
70 1.1 cgd c_delafter(el, el->el_state.argument); /* delete after dot */
71 1.1 cgd if (el->el_line.cursor > el->el_line.lastchar)
72 1.1 cgd el->el_line.cursor = el->el_line.lastchar; /* bounds check */
73 1.1 cgd return CC_REFRESH;
74 1.1 cgd }
75 1.1 cgd }
76 1.1 cgd
77 1.1 cgd
78 1.1 cgd /* em_delete_next_word():
79 1.1 cgd * Cut from cursor to end of current word
80 1.1 cgd * [M-d]
81 1.1 cgd */
82 1.1 cgd protected el_action_t
83 1.1 cgd /*ARGSUSED*/
84 1.1 cgd em_delete_next_word(el, c)
85 1.1 cgd EditLine *el;
86 1.1 cgd int c;
87 1.1 cgd {
88 1.1 cgd char *cp, *p, *kp;
89 1.1 cgd
90 1.1 cgd if (el->el_line.cursor == el->el_line.lastchar)
91 1.1 cgd return CC_ERROR;
92 1.1 cgd
93 1.1 cgd cp = c__next_word(el->el_line.cursor, el->el_line.lastchar,
94 1.1 cgd el->el_state.argument, ce__isword);
95 1.1 cgd
96 1.1 cgd for (p = el->el_line.cursor, kp = el->el_chared.c_kill.buf; p < cp; p++)
97 1.1 cgd /* save the text */
98 1.1 cgd *kp++ = *p;
99 1.1 cgd el->el_chared.c_kill.last = kp;
100 1.1 cgd
101 1.1 cgd c_delafter(el, cp - el->el_line.cursor); /* delete after dot */
102 1.1 cgd if (el->el_line.cursor > el->el_line.lastchar)
103 1.1 cgd el->el_line.cursor = el->el_line.lastchar; /* bounds check */
104 1.1 cgd return CC_REFRESH;
105 1.1 cgd }
106 1.1 cgd
107 1.1 cgd
108 1.1 cgd /* em_yank():
109 1.1 cgd * Paste cut buffer at cursor position
110 1.1 cgd * [^Y]
111 1.1 cgd */
112 1.1 cgd protected el_action_t
113 1.1 cgd /*ARGSUSED*/
114 1.1 cgd em_yank(el, c)
115 1.1 cgd EditLine *el;
116 1.1 cgd int c;
117 1.1 cgd {
118 1.1 cgd char *kp, *cp;
119 1.1 cgd
120 1.1 cgd if (el->el_chared.c_kill.last == el->el_chared.c_kill.buf)
121 1.1 cgd return CC_ERROR;
122 1.1 cgd
123 1.1 cgd if (el->el_line.lastchar +
124 1.1 cgd (el->el_chared.c_kill.last - el->el_chared.c_kill.buf) >=
125 1.1 cgd el->el_line.limit)
126 1.1 cgd return CC_ERROR;
127 1.1 cgd
128 1.1 cgd el->el_chared.c_kill.mark = el->el_line.cursor;
129 1.1 cgd cp = el->el_line.cursor;
130 1.1 cgd
131 1.1 cgd /* open the space, */
132 1.1 cgd c_insert(el, el->el_chared.c_kill.last - el->el_chared.c_kill.buf);
133 1.1 cgd /* copy the chars */
134 1.1 cgd for (kp = el->el_chared.c_kill.buf; kp < el->el_chared.c_kill.last; kp++)
135 1.1 cgd *cp++ = *kp;
136 1.1 cgd
137 1.1 cgd /* if an arg, cursor at beginning else cursor at end */
138 1.1 cgd if (el->el_state.argument == 1)
139 1.1 cgd el->el_line.cursor = cp;
140 1.1 cgd
141 1.1 cgd return CC_REFRESH;
142 1.1 cgd }
143 1.1 cgd
144 1.1 cgd
145 1.1 cgd /* em_kill_line():
146 1.1 cgd * Cut the entire line and save in cut buffer
147 1.1 cgd * [^U]
148 1.1 cgd */
149 1.1 cgd protected el_action_t
150 1.1 cgd /*ARGSUSED*/
151 1.1 cgd em_kill_line(el, c)
152 1.1 cgd EditLine *el;
153 1.1 cgd int c;
154 1.1 cgd {
155 1.1 cgd char *kp, *cp;
156 1.1 cgd
157 1.1 cgd cp = el->el_line.buffer;
158 1.1 cgd kp = el->el_chared.c_kill.buf;
159 1.1 cgd while (cp < el->el_line.lastchar)
160 1.1 cgd *kp++ = *cp++; /* copy it */
161 1.1 cgd el->el_chared.c_kill.last = kp;
162 1.1 cgd el->el_line.lastchar = el->el_line.buffer; /* zap! -- delete all of it */
163 1.1 cgd el->el_line.cursor = el->el_line.buffer;
164 1.1 cgd return CC_REFRESH;
165 1.1 cgd }
166 1.1 cgd
167 1.1 cgd
168 1.1 cgd /* em_kill_region():
169 1.1 cgd * Cut area between mark and cursor and save in cut buffer
170 1.1 cgd * [^W]
171 1.1 cgd */
172 1.1 cgd protected el_action_t
173 1.1 cgd /*ARGSUSED*/
174 1.1 cgd em_kill_region(el, c)
175 1.1 cgd EditLine *el;
176 1.1 cgd int c;
177 1.1 cgd {
178 1.1 cgd char *kp, *cp;
179 1.1 cgd
180 1.1 cgd if (!el->el_chared.c_kill.mark)
181 1.1 cgd return CC_ERROR;
182 1.1 cgd
183 1.1 cgd if (el->el_chared.c_kill.mark > el->el_line.cursor) {
184 1.1 cgd cp = el->el_line.cursor;
185 1.1 cgd kp = el->el_chared.c_kill.buf;
186 1.1 cgd while (cp < el->el_chared.c_kill.mark)
187 1.1 cgd *kp++ = *cp++; /* copy it */
188 1.1 cgd el->el_chared.c_kill.last = kp;
189 1.1 cgd c_delafter(el, cp - el->el_line.cursor);
190 1.1 cgd }
191 1.1 cgd else { /* mark is before cursor */
192 1.1 cgd cp = el->el_chared.c_kill.mark;
193 1.1 cgd kp = el->el_chared.c_kill.buf;
194 1.1 cgd while (cp < el->el_line.cursor)
195 1.1 cgd *kp++ = *cp++; /* copy it */
196 1.1 cgd el->el_chared.c_kill.last = kp;
197 1.1 cgd c_delbefore(el, cp - el->el_chared.c_kill.mark);
198 1.1 cgd el->el_line.cursor = el->el_chared.c_kill.mark;
199 1.1 cgd }
200 1.1 cgd return CC_REFRESH;
201 1.1 cgd }
202 1.1 cgd
203 1.1 cgd
204 1.1 cgd /* em_copy_region():
205 1.1 cgd * Copy area between mark and cursor to cut buffer
206 1.1 cgd * [M-W]
207 1.1 cgd */
208 1.1 cgd protected el_action_t
209 1.1 cgd /*ARGSUSED*/
210 1.1 cgd em_copy_region(el, c)
211 1.1 cgd EditLine *el;
212 1.1 cgd int c;
213 1.1 cgd {
214 1.1 cgd char *kp, *cp;
215 1.1 cgd
216 1.1 cgd if (el->el_chared.c_kill.mark)
217 1.1 cgd return CC_ERROR;
218 1.1 cgd
219 1.1 cgd if (el->el_chared.c_kill.mark > el->el_line.cursor) {
220 1.1 cgd cp = el->el_line.cursor;
221 1.1 cgd kp = el->el_chared.c_kill.buf;
222 1.1 cgd while (cp < el->el_chared.c_kill.mark)
223 1.1 cgd *kp++ = *cp++; /* copy it */
224 1.1 cgd el->el_chared.c_kill.last = kp;
225 1.1 cgd }
226 1.1 cgd else {
227 1.1 cgd cp = el->el_chared.c_kill.mark;
228 1.1 cgd kp = el->el_chared.c_kill.buf;
229 1.1 cgd while (cp < el->el_line.cursor)
230 1.1 cgd *kp++ = *cp++; /* copy it */
231 1.1 cgd el->el_chared.c_kill.last = kp;
232 1.1 cgd }
233 1.1 cgd return CC_NORM;
234 1.1 cgd }
235 1.1 cgd
236 1.1 cgd
237 1.1 cgd /* em_gosmacs_traspose():
238 1.1 cgd * Exchange the two characters before the cursor
239 1.1 cgd * Gosling emacs transpose chars [^T]
240 1.1 cgd */
241 1.1 cgd protected el_action_t
242 1.1 cgd em_gosmacs_traspose(el, c)
243 1.1 cgd EditLine *el;
244 1.1 cgd int c;
245 1.1 cgd {
246 1.1 cgd
247 1.1 cgd if (el->el_line.cursor > &el->el_line.buffer[1]) {
248 1.1 cgd /* must have at least two chars entered */
249 1.1 cgd c = el->el_line.cursor[-2];
250 1.1 cgd el->el_line.cursor[-2] = el->el_line.cursor[-1];
251 1.1 cgd el->el_line.cursor[-1] = c;
252 1.1 cgd return CC_REFRESH;
253 1.1 cgd }
254 1.1 cgd else
255 1.1 cgd return CC_ERROR;
256 1.1 cgd }
257 1.1 cgd
258 1.1 cgd
259 1.1 cgd /* em_next_word():
260 1.1 cgd * Move next to end of current word
261 1.1 cgd * [M-f]
262 1.1 cgd */
263 1.1 cgd protected el_action_t
264 1.1 cgd /*ARGSUSED*/
265 1.1 cgd em_next_word(el, c)
266 1.1 cgd EditLine *el;
267 1.1 cgd int c;
268 1.1 cgd {
269 1.1 cgd if (el->el_line.cursor == el->el_line.lastchar)
270 1.1 cgd return CC_ERROR;
271 1.1 cgd
272 1.1 cgd el->el_line.cursor = c__next_word(el->el_line.cursor, el->el_line.lastchar,
273 1.1 cgd el->el_state.argument,
274 1.1 cgd ce__isword);
275 1.1 cgd
276 1.1 cgd if (el->el_map.type == MAP_VI)
277 1.1 cgd if (el->el_chared.c_vcmd.action & DELETE) {
278 1.1 cgd cv_delfini(el);
279 1.1 cgd return CC_REFRESH;
280 1.1 cgd }
281 1.1 cgd
282 1.1 cgd return CC_CURSOR;
283 1.1 cgd }
284 1.1 cgd
285 1.1 cgd /* em_upper_case():
286 1.1 cgd * Uppercase the characters from cursor to end of current word
287 1.1 cgd * [M-u]
288 1.1 cgd */
289 1.1 cgd protected el_action_t
290 1.1 cgd /*ARGSUSED*/
291 1.1 cgd em_upper_case(el, c)
292 1.1 cgd EditLine *el;
293 1.1 cgd int c;
294 1.1 cgd {
295 1.1 cgd char *cp, *ep;
296 1.1 cgd
297 1.1 cgd ep = c__next_word(el->el_line.cursor, el->el_line.lastchar,
298 1.1 cgd el->el_state.argument, ce__isword);
299 1.1 cgd
300 1.1 cgd for (cp = el->el_line.cursor; cp < ep; cp++)
301 1.1 cgd if (islower(*cp))
302 1.1 cgd *cp = toupper(*cp);
303 1.1 cgd
304 1.1 cgd el->el_line.cursor = ep;
305 1.1 cgd if (el->el_line.cursor > el->el_line.lastchar)
306 1.1 cgd el->el_line.cursor = el->el_line.lastchar;
307 1.1 cgd return CC_REFRESH;
308 1.1 cgd }
309 1.1 cgd
310 1.1 cgd
311 1.1 cgd /* em_capitol_case():
312 1.1 cgd * Capitalize the characters from cursor to end of current word
313 1.1 cgd * [M-c]
314 1.1 cgd */
315 1.1 cgd protected el_action_t
316 1.1 cgd /*ARGSUSED*/
317 1.1 cgd em_capitol_case(el, c)
318 1.1 cgd EditLine *el;
319 1.1 cgd int c;
320 1.1 cgd {
321 1.1 cgd char *cp, *ep;
322 1.1 cgd
323 1.1 cgd ep = c__next_word(el->el_line.cursor, el->el_line.lastchar,
324 1.1 cgd el->el_state.argument, ce__isword);
325 1.1 cgd
326 1.1 cgd for (cp = el->el_line.cursor; cp < ep; cp++) {
327 1.1 cgd if (isalpha(*cp)) {
328 1.1 cgd if (islower(*cp))
329 1.1 cgd *cp = toupper(*cp);
330 1.1 cgd cp++;
331 1.1 cgd break;
332 1.1 cgd }
333 1.1 cgd }
334 1.1 cgd for (; cp < ep; cp++)
335 1.1 cgd if (isupper(*cp))
336 1.1 cgd *cp = tolower(*cp);
337 1.1 cgd
338 1.1 cgd el->el_line.cursor = ep;
339 1.1 cgd if (el->el_line.cursor > el->el_line.lastchar)
340 1.1 cgd el->el_line.cursor = el->el_line.lastchar;
341 1.1 cgd return CC_REFRESH;
342 1.1 cgd }
343 1.1 cgd
344 1.1 cgd /* em_lower_case():
345 1.1 cgd * Lowercase the characters from cursor to end of current word
346 1.1 cgd * [M-l]
347 1.1 cgd */
348 1.1 cgd protected el_action_t
349 1.1 cgd /*ARGSUSED*/
350 1.1 cgd em_lower_case(el, c)
351 1.1 cgd EditLine *el;
352 1.1 cgd int c;
353 1.1 cgd {
354 1.1 cgd char *cp, *ep;
355 1.1 cgd
356 1.1 cgd ep = c__next_word(el->el_line.cursor, el->el_line.lastchar,
357 1.1 cgd el->el_state.argument, ce__isword);
358 1.1 cgd
359 1.1 cgd for (cp = el->el_line.cursor; cp < ep; cp++)
360 1.1 cgd if (isupper(*cp))
361 1.1 cgd *cp = tolower(*cp);
362 1.1 cgd
363 1.1 cgd el->el_line.cursor = ep;
364 1.1 cgd if (el->el_line.cursor > el->el_line.lastchar)
365 1.1 cgd el->el_line.cursor = el->el_line.lastchar;
366 1.1 cgd return CC_REFRESH;
367 1.1 cgd }
368 1.1 cgd
369 1.1 cgd
370 1.1 cgd /* em_set_mark():
371 1.1 cgd * Set the mark at cursor
372 1.1 cgd * [^@]
373 1.1 cgd */
374 1.1 cgd protected el_action_t
375 1.1 cgd /*ARGSUSED*/
376 1.1 cgd em_set_mark(el, c)
377 1.1 cgd EditLine *el;
378 1.1 cgd int c;
379 1.1 cgd {
380 1.1 cgd el->el_chared.c_kill.mark = el->el_line.cursor;
381 1.1 cgd return CC_NORM;
382 1.1 cgd }
383 1.1 cgd
384 1.1 cgd
385 1.1 cgd /* em_exchange_mark():
386 1.1 cgd * Exchange the cursor and mark
387 1.1 cgd * [^X^X]
388 1.1 cgd */
389 1.1 cgd protected el_action_t
390 1.1 cgd /*ARGSUSED*/
391 1.1 cgd em_exchange_mark(el, c)
392 1.1 cgd EditLine *el;
393 1.1 cgd int c;
394 1.1 cgd {
395 1.1 cgd register char *cp;
396 1.1 cgd
397 1.1 cgd cp = el->el_line.cursor;
398 1.1 cgd el->el_line.cursor = el->el_chared.c_kill.mark;
399 1.1 cgd el->el_chared.c_kill.mark = cp;
400 1.1 cgd return CC_CURSOR;
401 1.1 cgd }
402 1.1 cgd
403 1.1 cgd /* em_universal_argument():
404 1.1 cgd * Universal argument (argument times 4)
405 1.1 cgd * [^U]
406 1.1 cgd */
407 1.1 cgd protected el_action_t
408 1.1 cgd /*ARGSUSED*/
409 1.1 cgd em_universal_argument(el, c)
410 1.1 cgd EditLine *el;
411 1.1 cgd int c;
412 1.1 cgd { /* multiply current argument by 4 */
413 1.1 cgd if (el->el_state.argument > 1000000)
414 1.1 cgd return CC_ERROR;
415 1.1 cgd el->el_state.doingarg = 1;
416 1.1 cgd el->el_state.argument *= 4;
417 1.1 cgd return CC_ARGHACK;
418 1.1 cgd }
419 1.1 cgd
420 1.1 cgd /* em_meta_next():
421 1.1 cgd * Add 8th bit to next character typed
422 1.1 cgd * [<ESC>]
423 1.1 cgd */
424 1.1 cgd protected el_action_t
425 1.1 cgd /*ARGSUSED*/
426 1.1 cgd em_meta_next(el, c)
427 1.1 cgd EditLine *el;
428 1.1 cgd int c;
429 1.1 cgd {
430 1.1 cgd el->el_state.metanext = 1;
431 1.1 cgd return CC_ARGHACK;
432 1.1 cgd }
433 1.1 cgd
434 1.1 cgd
435 1.1 cgd /* em_toggle_overwrite():
436 1.1 cgd * Switch from insert to overwrite mode or vice versa
437 1.1 cgd */
438 1.1 cgd protected el_action_t
439 1.1 cgd /*ARGSUSED*/
440 1.1 cgd em_toggle_overwrite(el, c)
441 1.1 cgd EditLine *el;
442 1.1 cgd int c;
443 1.1 cgd {
444 1.1 cgd el->el_state.inputmode =
445 1.1 cgd (el->el_state.inputmode == MODE_INSERT) ? MODE_REPLACE : MODE_INSERT;
446 1.1 cgd return CC_NORM;
447 1.1 cgd }
448 1.1 cgd
449 1.1 cgd
450 1.1 cgd /* em_copy_prev_word():
451 1.1 cgd * Copy current word to cursor
452 1.1 cgd */
453 1.1 cgd protected el_action_t
454 1.1 cgd /*ARGSUSED*/
455 1.1 cgd em_copy_prev_word(el, c)
456 1.1 cgd EditLine *el;
457 1.1 cgd int c;
458 1.1 cgd {
459 1.1 cgd char *cp, *oldc, *dp;
460 1.1 cgd
461 1.1 cgd if (el->el_line.cursor == el->el_line.buffer)
462 1.1 cgd return CC_ERROR;
463 1.1 cgd
464 1.1 cgd oldc = el->el_line.cursor;
465 1.1 cgd /* does a bounds check */
466 1.1 cgd cp = c__prev_word(el->el_line.cursor, el->el_line.buffer,
467 1.1 cgd el->el_state.argument, ce__isword);
468 1.1 cgd
469 1.1 cgd c_insert(el, oldc - cp);
470 1.1 cgd for (dp = oldc; cp < oldc && dp < el->el_line.lastchar; cp++)
471 1.1 cgd *dp++ = *cp;
472 1.1 cgd
473 1.1 cgd el->el_line.cursor = dp; /* put cursor at end */
474 1.1 cgd
475 1.1 cgd return CC_REFRESH;
476 1.1 cgd }
477 1.1 cgd
478 1.1 cgd
479 1.1 cgd /* em_inc_search_next():
480 1.1 cgd * Emacs incremental next search
481 1.1 cgd */
482 1.1 cgd protected el_action_t
483 1.1 cgd /*ARGSUSED*/
484 1.1 cgd em_inc_search_next(el, c)
485 1.1 cgd EditLine *el;
486 1.1 cgd int c;
487 1.1 cgd {
488 1.1 cgd el->el_search.patlen = 0;
489 1.1 cgd return ce_inc_search(el, ED_SEARCH_NEXT_HISTORY);
490 1.1 cgd }
491 1.1 cgd
492 1.1 cgd
493 1.1 cgd /* em_inc_search_prev():
494 1.1 cgd * Emacs incremental reverse search
495 1.1 cgd */
496 1.1 cgd protected el_action_t
497 1.1 cgd /*ARGSUSED*/
498 1.1 cgd em_inc_search_prev(el, c)
499 1.1 cgd EditLine *el;
500 1.1 cgd int c;
501 1.1 cgd {
502 1.1 cgd el->el_search.patlen = 0;
503 1.1 cgd return ce_inc_search(el, ED_SEARCH_PREV_HISTORY);
504 1.1 cgd }
505