edit.c revision 1.5 1 1.5 hubertf /* $NetBSD: edit.c,v 1.5 1999/10/20 15:09:59 hubertf Exp $ */
2 1.2 tls
3 1.1 jtc /*
4 1.1 jtc * Command line editing - common code
5 1.1 jtc *
6 1.1 jtc */
7 1.1 jtc
8 1.1 jtc #include "config.h"
9 1.1 jtc #ifdef EDIT
10 1.1 jtc
11 1.1 jtc #include "sh.h"
12 1.1 jtc #include "tty.h"
13 1.1 jtc #define EXTERN
14 1.1 jtc #include "edit.h"
15 1.1 jtc #undef EXTERN
16 1.1 jtc #ifdef OS_SCO /* SCO Unix 3.2v4.1 */
17 1.1 jtc # include <sys/stream.h> /* needed for <sys/ptem.h> */
18 1.1 jtc # include <sys/ptem.h> /* needed for struct winsize */
19 1.1 jtc #endif /* OS_SCO */
20 1.1 jtc #include <ctype.h>
21 1.3 christos #include <sys/ioctl.h>
22 1.1 jtc #include "ksh_stat.h"
23 1.1 jtc
24 1.1 jtc
25 1.1 jtc #if defined(TIOCGWINSZ)
26 1.1 jtc static RETSIGTYPE x_sigwinch ARGS((int sig));
27 1.1 jtc static int got_sigwinch;
28 1.1 jtc static void check_sigwinch ARGS((void));
29 1.1 jtc #endif /* TIOCGWINSZ */
30 1.1 jtc
31 1.1 jtc static int x_file_glob ARGS((int flags, const char *str, int slen,
32 1.1 jtc char ***wordsp));
33 1.1 jtc static int x_command_glob ARGS((int flags, const char *str, int slen,
34 1.1 jtc char ***wordsp));
35 1.1 jtc static int x_locate_word ARGS((const char *buf, int buflen, int pos,
36 1.1 jtc int *startp, int *is_command));
37 1.3 christos static int path_order_cmp ARGS((const void *, const void *));
38 1.1 jtc
39 1.1 jtc static char vdisable_c;
40 1.1 jtc
41 1.1 jtc
42 1.1 jtc /* Called from main */
43 1.1 jtc void
44 1.1 jtc x_init()
45 1.1 jtc {
46 1.5 hubertf /* set to -2 to force initial binding */
47 1.1 jtc edchars.erase = edchars.kill = edchars.intr = edchars.quit
48 1.5 hubertf = edchars.eof = -2;
49 1.1 jtc /* default value for deficient systems */
50 1.1 jtc edchars.werase = 027; /* ^W */
51 1.1 jtc
52 1.1 jtc #ifdef TIOCGWINSZ
53 1.1 jtc # ifdef SIGWINCH
54 1.1 jtc if (setsig(&sigtraps[SIGWINCH], x_sigwinch, SS_RESTORE_ORIG|SS_SHTRAP))
55 1.1 jtc sigtraps[SIGWINCH].flags |= TF_SHELL_USES;
56 1.1 jtc # endif /* SIGWINCH */
57 1.2 tls got_sigwinch = 1; /* force initial check */
58 1.1 jtc check_sigwinch();
59 1.1 jtc #endif /* TIOCGWINSZ */
60 1.1 jtc
61 1.1 jtc #ifdef EMACS
62 1.1 jtc x_init_emacs();
63 1.1 jtc #endif /* EMACS */
64 1.1 jtc
65 1.1 jtc /* Bizarreness to figure out how to disable
66 1.1 jtc * a struct termios.c_cc[] char
67 1.1 jtc */
68 1.1 jtc #ifdef _POSIX_VDISABLE
69 1.1 jtc if (_POSIX_VDISABLE >= 0)
70 1.1 jtc vdisable_c = (char) _POSIX_VDISABLE;
71 1.1 jtc else
72 1.1 jtc /* `feature not available' */
73 1.1 jtc vdisable_c = (char) 0377;
74 1.1 jtc #else
75 1.1 jtc # if defined(HAVE_PATHCONF) && defined(_PC_VDISABLE)
76 1.1 jtc vdisable_c = fpathconf(tty_fd, _PC_VDISABLE);
77 1.1 jtc # else
78 1.1 jtc vdisable_c = (char) 0377; /* default to old BSD value */
79 1.1 jtc # endif
80 1.1 jtc #endif /* _POSIX_VDISABLE */
81 1.1 jtc }
82 1.1 jtc
83 1.1 jtc #if defined(TIOCGWINSZ)
84 1.1 jtc static RETSIGTYPE
85 1.1 jtc x_sigwinch(sig)
86 1.1 jtc int sig;
87 1.1 jtc {
88 1.1 jtc got_sigwinch = 1;
89 1.1 jtc return RETSIGVAL;
90 1.1 jtc }
91 1.1 jtc
92 1.1 jtc static void
93 1.1 jtc check_sigwinch ARGS((void))
94 1.1 jtc {
95 1.1 jtc if (got_sigwinch) {
96 1.1 jtc struct winsize ws;
97 1.1 jtc
98 1.1 jtc got_sigwinch = 0;
99 1.1 jtc if (procpid == kshpid && ioctl(tty_fd, TIOCGWINSZ, &ws) >= 0) {
100 1.1 jtc struct tbl *vp;
101 1.1 jtc
102 1.1 jtc /* Do NOT export COLUMNS/LINES. Many applications
103 1.1 jtc * check COLUMNS/LINES before checking ws.ws_col/row,
104 1.1 jtc * so if the app is started with C/L in the environ
105 1.1 jtc * and the window is then resized, the app won't
106 1.1 jtc * see the change cause the environ doesn't change.
107 1.1 jtc */
108 1.1 jtc if (ws.ws_col) {
109 1.1 jtc x_cols = ws.ws_col < MIN_COLS ? MIN_COLS
110 1.1 jtc : ws.ws_col;
111 1.1 jtc
112 1.1 jtc if ((vp = typeset("COLUMNS", 0, 0, 0, 0)))
113 1.1 jtc setint(vp, (long) ws.ws_col);
114 1.1 jtc }
115 1.1 jtc if (ws.ws_row
116 1.1 jtc && (vp = typeset("LINES", 0, 0, 0, 0)))
117 1.1 jtc setint(vp, (long) ws.ws_row);
118 1.1 jtc }
119 1.1 jtc }
120 1.1 jtc }
121 1.1 jtc #endif /* TIOCGWINSZ */
122 1.1 jtc
123 1.1 jtc /*
124 1.1 jtc * read an edited command line
125 1.1 jtc */
126 1.1 jtc int
127 1.1 jtc x_read(buf, len)
128 1.1 jtc char *buf;
129 1.1 jtc size_t len;
130 1.1 jtc {
131 1.1 jtc int i;
132 1.1 jtc
133 1.1 jtc #if defined(TIOCGWINSZ)
134 1.1 jtc if (got_sigwinch)
135 1.1 jtc check_sigwinch();
136 1.1 jtc #endif /* TIOCGWINSZ */
137 1.1 jtc
138 1.1 jtc x_mode(TRUE);
139 1.1 jtc #ifdef EMACS
140 1.1 jtc if (Flag(FEMACS) || Flag(FGMACS))
141 1.1 jtc i = x_emacs(buf, len);
142 1.1 jtc else
143 1.1 jtc #endif
144 1.1 jtc #ifdef VI
145 1.1 jtc if (Flag(FVI))
146 1.1 jtc i = x_vi(buf, len);
147 1.1 jtc else
148 1.1 jtc #endif
149 1.1 jtc i = -1; /* internal error */
150 1.1 jtc x_mode(FALSE);
151 1.1 jtc return i;
152 1.1 jtc }
153 1.1 jtc
154 1.1 jtc /* tty I/O */
155 1.1 jtc
156 1.1 jtc int
157 1.1 jtc x_getc()
158 1.1 jtc {
159 1.1 jtc #ifdef OS2
160 1.1 jtc unsigned char c = _read_kbd(0, 1, 0);
161 1.1 jtc return c == 0 ? 0xE0 : c;
162 1.1 jtc #else /* OS2 */
163 1.1 jtc char c;
164 1.1 jtc int n;
165 1.1 jtc
166 1.1 jtc while ((n = blocking_read(0, &c, 1)) < 0 && errno == EINTR)
167 1.1 jtc if (trap) {
168 1.1 jtc x_mode(FALSE);
169 1.1 jtc runtraps(0);
170 1.1 jtc x_mode(TRUE);
171 1.1 jtc }
172 1.1 jtc if (n != 1)
173 1.1 jtc return -1;
174 1.1 jtc return (int) (unsigned char) c;
175 1.1 jtc #endif /* OS2 */
176 1.1 jtc }
177 1.1 jtc
178 1.1 jtc void
179 1.1 jtc x_flush()
180 1.1 jtc {
181 1.1 jtc shf_flush(shl_out);
182 1.1 jtc }
183 1.1 jtc
184 1.1 jtc void
185 1.1 jtc x_putc(c)
186 1.1 jtc int c;
187 1.1 jtc {
188 1.1 jtc shf_putc(c, shl_out);
189 1.1 jtc }
190 1.1 jtc
191 1.1 jtc void
192 1.1 jtc x_puts(s)
193 1.1 jtc const char *s;
194 1.1 jtc {
195 1.1 jtc while (*s != 0)
196 1.1 jtc shf_putc(*s++, shl_out);
197 1.1 jtc }
198 1.1 jtc
199 1.1 jtc bool_t
200 1.1 jtc x_mode(onoff)
201 1.1 jtc bool_t onoff;
202 1.1 jtc {
203 1.1 jtc static bool_t x_cur_mode;
204 1.1 jtc bool_t prev;
205 1.1 jtc
206 1.1 jtc if (x_cur_mode == onoff)
207 1.1 jtc return x_cur_mode;
208 1.1 jtc prev = x_cur_mode;
209 1.1 jtc x_cur_mode = onoff;
210 1.1 jtc
211 1.1 jtc if (onoff) {
212 1.1 jtc TTY_state cb;
213 1.1 jtc X_chars oldchars;
214 1.1 jtc
215 1.1 jtc oldchars = edchars;
216 1.1 jtc cb = tty_state;
217 1.1 jtc
218 1.1 jtc #if defined(HAVE_TERMIOS_H) || defined(HAVE_TERMIO_H)
219 1.1 jtc edchars.erase = cb.c_cc[VERASE];
220 1.1 jtc edchars.kill = cb.c_cc[VKILL];
221 1.1 jtc edchars.intr = cb.c_cc[VINTR];
222 1.1 jtc edchars.quit = cb.c_cc[VQUIT];
223 1.1 jtc edchars.eof = cb.c_cc[VEOF];
224 1.1 jtc # ifdef VWERASE
225 1.1 jtc edchars.werase = cb.c_cc[VWERASE];
226 1.1 jtc # endif
227 1.1 jtc # ifdef _CRAY2 /* brain-damaged terminal handler */
228 1.1 jtc cb.c_lflag &= ~(ICANON|ECHO);
229 1.1 jtc /* rely on print routine to map '\n' to CR,LF */
230 1.1 jtc # else
231 1.1 jtc cb.c_iflag &= ~(INLCR|ICRNL);
232 1.1 jtc # ifdef _BSD_SYSV /* need to force CBREAK instead of RAW (need CRMOD on output) */
233 1.1 jtc cb.c_lflag &= ~(ICANON|ECHO);
234 1.1 jtc # else
235 1.1 jtc # ifdef SWTCH /* need CBREAK to handle swtch char */
236 1.1 jtc cb.c_lflag &= ~(ICANON|ECHO);
237 1.1 jtc cb.c_lflag |= ISIG;
238 1.1 jtc cb.c_cc[VINTR] = vdisable_c;
239 1.1 jtc cb.c_cc[VQUIT] = vdisable_c;
240 1.1 jtc # else
241 1.1 jtc cb.c_lflag &= ~(ISIG|ICANON|ECHO);
242 1.1 jtc # endif
243 1.1 jtc # endif
244 1.1 jtc # ifdef VLNEXT
245 1.1 jtc /* osf/1 processes lnext when ~icanon */
246 1.1 jtc cb.c_cc[VLNEXT] = vdisable_c;
247 1.1 jtc # endif /* VLNEXT */
248 1.1 jtc # ifdef VDISCARD
249 1.1 jtc /* sunos 4.1.x & osf/1 processes discard(flush) when ~icanon */
250 1.1 jtc cb.c_cc[VDISCARD] = vdisable_c;
251 1.1 jtc # endif /* VDISCARD */
252 1.1 jtc cb.c_cc[VTIME] = 0;
253 1.1 jtc cb.c_cc[VMIN] = 1;
254 1.1 jtc # endif /* _CRAY2 */
255 1.1 jtc #else
256 1.1 jtc /* Assume BSD tty stuff. */
257 1.1 jtc edchars.erase = cb.sgttyb.sg_erase;
258 1.1 jtc edchars.kill = cb.sgttyb.sg_kill;
259 1.1 jtc cb.sgttyb.sg_flags &= ~ECHO;
260 1.1 jtc cb.sgttyb.sg_flags |= CBREAK;
261 1.1 jtc # ifdef TIOCGATC
262 1.1 jtc edchars.intr = cb.lchars.tc_intrc;
263 1.1 jtc edchars.quit = cb.lchars.tc_quitc;
264 1.1 jtc edchars.eof = cb.lchars.tc_eofc;
265 1.1 jtc edchars.werase = cb.lchars.tc_werasc;
266 1.1 jtc cb.lchars.tc_suspc = -1;
267 1.1 jtc cb.lchars.tc_dsuspc = -1;
268 1.1 jtc cb.lchars.tc_lnextc = -1;
269 1.1 jtc cb.lchars.tc_statc = -1;
270 1.1 jtc cb.lchars.tc_intrc = -1;
271 1.1 jtc cb.lchars.tc_quitc = -1;
272 1.1 jtc cb.lchars.tc_rprntc = -1;
273 1.1 jtc # else
274 1.1 jtc edchars.intr = cb.tchars.t_intrc;
275 1.1 jtc edchars.quit = cb.tchars.t_quitc;
276 1.1 jtc edchars.eof = cb.tchars.t_eofc;
277 1.1 jtc cb.tchars.t_intrc = -1;
278 1.1 jtc cb.tchars.t_quitc = -1;
279 1.1 jtc # ifdef TIOCGLTC
280 1.1 jtc edchars.werase = cb.ltchars.t_werasc;
281 1.1 jtc cb.ltchars.t_suspc = -1;
282 1.1 jtc cb.ltchars.t_dsuspc = -1;
283 1.1 jtc cb.ltchars.t_lnextc = -1;
284 1.1 jtc cb.ltchars.t_rprntc = -1;
285 1.1 jtc # endif
286 1.1 jtc # endif /* TIOCGATC */
287 1.1 jtc #endif /* HAVE_TERMIOS_H || HAVE_TERMIO_H */
288 1.1 jtc
289 1.1 jtc set_tty(tty_fd, &cb, TF_WAIT);
290 1.1 jtc
291 1.5 hubertf #ifdef __CYGWIN__
292 1.5 hubertf if (edchars.eof == '\0')
293 1.5 hubertf edchars.eof = '\4';
294 1.5 hubertf #endif /* __CYGWIN__ */
295 1.5 hubertf
296 1.5 hubertf /* Convert unset values to internal `unset' value */
297 1.5 hubertf if (edchars.erase == vdisable_c)
298 1.5 hubertf edchars.erase = -1;
299 1.5 hubertf if (edchars.kill == vdisable_c)
300 1.5 hubertf edchars.kill = -1;
301 1.5 hubertf if (edchars.intr == vdisable_c)
302 1.5 hubertf edchars.intr = -1;
303 1.5 hubertf if (edchars.quit == vdisable_c)
304 1.5 hubertf edchars.quit = -1;
305 1.5 hubertf if (edchars.eof == vdisable_c)
306 1.5 hubertf edchars.eof = -1;
307 1.5 hubertf if (edchars.werase == vdisable_c)
308 1.5 hubertf edchars.werase = -1;
309 1.1 jtc if (memcmp(&edchars, &oldchars, sizeof(edchars)) != 0) {
310 1.1 jtc #ifdef EMACS
311 1.1 jtc x_emacs_keys(&edchars);
312 1.1 jtc #endif
313 1.1 jtc }
314 1.5 hubertf } else {
315 1.1 jtc /* TF_WAIT doesn't seem to be necessary when leaving xmode */
316 1.1 jtc set_tty(tty_fd, &tty_state, TF_NONE);
317 1.5 hubertf }
318 1.1 jtc
319 1.1 jtc return prev;
320 1.1 jtc }
321 1.1 jtc
322 1.1 jtc /* NAME:
323 1.1 jtc * promptlen - calculate the length of PS1 etc.
324 1.1 jtc *
325 1.1 jtc * DESCRIPTION:
326 1.1 jtc * This function is based on a fix from guy (at) demon.co.uk
327 1.1 jtc * It fixes a bug in that if PS1 contains '!', the length
328 1.1 jtc * given by strlen() is probably wrong.
329 1.1 jtc *
330 1.1 jtc * RETURN VALUE:
331 1.1 jtc * length
332 1.1 jtc */
333 1.1 jtc int
334 1.1 jtc promptlen(cp, spp)
335 1.1 jtc const char *cp;
336 1.1 jtc const char **spp;
337 1.1 jtc {
338 1.1 jtc int count = 0;
339 1.1 jtc const char *sp = cp;
340 1.2 tls char delimiter = 0;
341 1.2 tls int indelimit = 0;
342 1.2 tls
343 1.2 tls /* Undocumented AT&T ksh feature:
344 1.2 tls * If the second char in the prompt string is \r then the first char
345 1.2 tls * is taken to be a non-printing delimiter and any chars between two
346 1.2 tls * instances of the delimiter are not considered to be part of the
347 1.2 tls * prompt length
348 1.2 tls */
349 1.2 tls if (*cp && cp[1] == '\r') {
350 1.2 tls delimiter = *cp;
351 1.2 tls cp += 2;
352 1.2 tls }
353 1.1 jtc
354 1.2 tls for (; *cp; cp++) {
355 1.2 tls if (indelimit && *cp != delimiter)
356 1.2 tls ;
357 1.2 tls else if (*cp == '\n' || *cp == '\r') {
358 1.1 jtc count = 0;
359 1.2 tls sp = cp + 1;
360 1.1 jtc } else if (*cp == '\t') {
361 1.1 jtc count = (count | 7) + 1;
362 1.1 jtc } else if (*cp == '\b') {
363 1.1 jtc if (count > 0)
364 1.1 jtc count--;
365 1.2 tls } else if (*cp == delimiter)
366 1.2 tls indelimit = !indelimit;
367 1.1 jtc else
368 1.1 jtc count++;
369 1.1 jtc }
370 1.1 jtc if (spp)
371 1.1 jtc *spp = sp;
372 1.1 jtc return count;
373 1.1 jtc }
374 1.1 jtc
375 1.1 jtc void
376 1.1 jtc set_editmode(ed)
377 1.1 jtc const char *ed;
378 1.1 jtc {
379 1.1 jtc static const enum sh_flag edit_flags[] = {
380 1.1 jtc #ifdef EMACS
381 1.1 jtc FEMACS, FGMACS,
382 1.1 jtc #endif
383 1.1 jtc #ifdef VI
384 1.1 jtc FVI,
385 1.1 jtc #endif
386 1.1 jtc };
387 1.1 jtc char *rcp;
388 1.1 jtc int i;
389 1.1 jtc
390 1.1 jtc if ((rcp = ksh_strrchr_dirsep(ed)))
391 1.1 jtc ed = ++rcp;
392 1.1 jtc for (i = 0; i < NELEM(edit_flags); i++)
393 1.1 jtc if (strstr(ed, options[(int) edit_flags[i]].name)) {
394 1.1 jtc change_flag(edit_flags[i], OF_SPECIAL, 1);
395 1.1 jtc return;
396 1.1 jtc }
397 1.1 jtc }
398 1.1 jtc
399 1.1 jtc /* ------------------------------------------------------------------------- */
400 1.1 jtc /* Misc common code for vi/emacs */
401 1.1 jtc
402 1.1 jtc /* Handle the commenting/uncommenting of a line.
403 1.1 jtc * Returns:
404 1.1 jtc * 1 if a carriage return is indicated (comment added)
405 1.1 jtc * 0 if no return (comment removed)
406 1.1 jtc * -1 if there is an error (not enough room for comment chars)
407 1.1 jtc * If successful, *lenp contains the new length. Note: cursor should be
408 1.1 jtc * moved to the start of the line after (un)commenting.
409 1.1 jtc */
410 1.1 jtc int
411 1.1 jtc x_do_comment(buf, bsize, lenp)
412 1.1 jtc char *buf;
413 1.1 jtc int bsize;
414 1.1 jtc int *lenp;
415 1.1 jtc {
416 1.1 jtc int i, j;
417 1.1 jtc int len = *lenp;
418 1.1 jtc
419 1.1 jtc if (len == 0)
420 1.1 jtc return 1; /* somewhat arbitrary - it's what at&t ksh does */
421 1.1 jtc
422 1.1 jtc /* Already commented? */
423 1.1 jtc if (buf[0] == '#') {
424 1.1 jtc int saw_nl = 0;
425 1.1 jtc
426 1.1 jtc for (j = 0, i = 1; i < len; i++) {
427 1.1 jtc if (!saw_nl || buf[i] != '#')
428 1.1 jtc buf[j++] = buf[i];
429 1.1 jtc saw_nl = buf[i] == '\n';
430 1.1 jtc }
431 1.1 jtc *lenp = j;
432 1.1 jtc return 0;
433 1.1 jtc } else {
434 1.1 jtc int n = 1;
435 1.1 jtc
436 1.1 jtc /* See if there's room for the #'s - 1 per \n */
437 1.1 jtc for (i = 0; i < len; i++)
438 1.1 jtc if (buf[i] == '\n')
439 1.1 jtc n++;
440 1.1 jtc if (len + n >= bsize)
441 1.1 jtc return -1;
442 1.1 jtc /* Now add them... */
443 1.1 jtc for (i = len, j = len + n; --i >= 0; ) {
444 1.1 jtc if (buf[i] == '\n')
445 1.1 jtc buf[--j] = '#';
446 1.1 jtc buf[--j] = buf[i];
447 1.1 jtc }
448 1.1 jtc buf[0] = '#';
449 1.1 jtc *lenp += n;
450 1.1 jtc return 1;
451 1.1 jtc }
452 1.1 jtc }
453 1.1 jtc
454 1.1 jtc /* ------------------------------------------------------------------------- */
455 1.1 jtc /* Common file/command completion code for vi/emacs */
456 1.1 jtc
457 1.1 jtc
458 1.1 jtc static char *add_glob ARGS((const char *str, int slen));
459 1.1 jtc static void glob_table ARGS((const char *pat, XPtrV *wp, struct table *tp));
460 1.1 jtc static void glob_path ARGS((int flags, const char *pat, XPtrV *wp,
461 1.1 jtc const char *path));
462 1.1 jtc
463 1.1 jtc #if 0 /* not used... */
464 1.1 jtc int x_complete_word ARGS((const char *str, int slen, int is_command,
465 1.1 jtc int *multiple, char **ret));
466 1.1 jtc int
467 1.1 jtc x_complete_word(str, slen, is_command, nwordsp, ret)
468 1.1 jtc const char *str;
469 1.1 jtc int slen;
470 1.1 jtc int is_command;
471 1.1 jtc int *nwordsp;
472 1.1 jtc char **ret;
473 1.1 jtc {
474 1.1 jtc int nwords;
475 1.1 jtc int prefix_len;
476 1.1 jtc char **words;
477 1.1 jtc
478 1.1 jtc nwords = (is_command ? x_command_glob : x_file_glob)(XCF_FULLPATH,
479 1.1 jtc str, slen, &words);
480 1.1 jtc *nwordsp = nwords;
481 1.1 jtc if (nwords == 0) {
482 1.1 jtc *ret = (char *) 0;
483 1.1 jtc return -1;
484 1.1 jtc }
485 1.1 jtc
486 1.1 jtc prefix_len = x_longest_prefix(nwords, words);
487 1.1 jtc *ret = str_nsave(words[0], prefix_len, ATEMP);
488 1.1 jtc x_free_words(nwords, words);
489 1.1 jtc return prefix_len;
490 1.1 jtc }
491 1.1 jtc #endif /* 0 */
492 1.1 jtc
493 1.1 jtc void
494 1.1 jtc x_print_expansions(nwords, words, is_command)
495 1.1 jtc int nwords;
496 1.1 jtc char *const *words;
497 1.1 jtc int is_command;
498 1.1 jtc {
499 1.1 jtc int use_copy = 0;
500 1.1 jtc int prefix_len;
501 1.1 jtc XPtrV l;
502 1.1 jtc
503 1.1 jtc /* Check if all matches are in the same directory (in this
504 1.1 jtc * case, we want to omitt the directory name)
505 1.1 jtc */
506 1.1 jtc if (!is_command
507 1.1 jtc && (prefix_len = x_longest_prefix(nwords, words)) > 0)
508 1.1 jtc {
509 1.1 jtc int i;
510 1.1 jtc
511 1.1 jtc /* Special case for 1 match (prefix is whole word) */
512 1.1 jtc if (nwords == 1)
513 1.1 jtc prefix_len = x_basename(words[0], (char *) 0);
514 1.1 jtc /* Any (non-trailing) slashes in non-common word suffixes? */
515 1.1 jtc for (i = 0; i < nwords; i++)
516 1.1 jtc if (x_basename(words[i] + prefix_len, (char *) 0)
517 1.1 jtc > prefix_len)
518 1.1 jtc break;
519 1.1 jtc /* All in same directory? */
520 1.1 jtc if (i == nwords) {
521 1.1 jtc while (prefix_len > 0
522 1.1 jtc && !ISDIRSEP(words[0][prefix_len - 1]))
523 1.1 jtc prefix_len--;
524 1.1 jtc use_copy = 1;
525 1.1 jtc XPinit(l, nwords + 1);
526 1.1 jtc for (i = 0; i < nwords; i++)
527 1.1 jtc XPput(l, words[i] + prefix_len);
528 1.1 jtc XPput(l, (char *) 0);
529 1.1 jtc }
530 1.1 jtc }
531 1.1 jtc
532 1.1 jtc /*
533 1.1 jtc * Enumerate expansions
534 1.1 jtc */
535 1.1 jtc x_putc('\r');
536 1.1 jtc x_putc('\n');
537 1.1 jtc pr_menu(use_copy ? (char **) XPptrv(l) : words);
538 1.1 jtc
539 1.1 jtc if (use_copy)
540 1.1 jtc XPfree(l); /* not x_free_words() */
541 1.1 jtc }
542 1.1 jtc
543 1.1 jtc /*
544 1.1 jtc * Do file globbing:
545 1.1 jtc * - appends * to (copy of) str if no globbing chars found
546 1.1 jtc * - does expansion, checks for no match, etc.
547 1.1 jtc * - sets *wordsp to array of matching strings
548 1.1 jtc * - returns number of matching strings
549 1.1 jtc */
550 1.1 jtc static int
551 1.1 jtc x_file_glob(flags, str, slen, wordsp)
552 1.1 jtc int flags;
553 1.1 jtc const char *str;
554 1.1 jtc int slen;
555 1.1 jtc char ***wordsp;
556 1.1 jtc {
557 1.1 jtc char *toglob;
558 1.1 jtc char **words;
559 1.1 jtc int nwords;
560 1.1 jtc XPtrV w;
561 1.1 jtc struct source *s, *sold;
562 1.1 jtc
563 1.1 jtc if (slen < 0)
564 1.1 jtc return 0;
565 1.1 jtc
566 1.1 jtc toglob = add_glob(str, slen);
567 1.1 jtc
568 1.1 jtc /*
569 1.1 jtc * Convert "foo*" (toglob) to an array of strings (words)
570 1.1 jtc */
571 1.1 jtc sold = source;
572 1.1 jtc s = pushs(SWSTR, ATEMP);
573 1.1 jtc s->start = s->str = toglob;
574 1.1 jtc source = s;
575 1.1 jtc if (yylex(ONEWORD) != LWORD) {
576 1.1 jtc source = sold;
577 1.1 jtc internal_errorf(0, "fileglob: substitute error");
578 1.1 jtc return 0;
579 1.1 jtc }
580 1.1 jtc source = sold;
581 1.1 jtc XPinit(w, 32);
582 1.1 jtc expand(yylval.cp, &w, DOGLOB|DOTILDE|DOMARKDIRS);
583 1.1 jtc XPput(w, NULL);
584 1.1 jtc words = (char **) XPclose(w);
585 1.1 jtc
586 1.1 jtc for (nwords = 0; words[nwords]; nwords++)
587 1.1 jtc ;
588 1.1 jtc if (nwords == 1) {
589 1.1 jtc struct stat statb;
590 1.1 jtc
591 1.1 jtc /* Check if globbing failed (returned glob pattern),
592 1.1 jtc * but be careful (E.g. toglob == "ab*" when the file
593 1.1 jtc * "ab*" exists is not an error).
594 1.1 jtc * Also, check for empty result - happens if we tried
595 1.1 jtc * to glob something which evaluated to an empty
596 1.1 jtc * string (e.g., "$FOO" when there is no FOO, etc).
597 1.1 jtc */
598 1.1 jtc if ((strcmp(words[0], toglob) == 0
599 1.1 jtc && stat(words[0], &statb) < 0)
600 1.1 jtc || words[0][0] == '\0')
601 1.1 jtc {
602 1.1 jtc x_free_words(nwords, words);
603 1.1 jtc nwords = 0;
604 1.1 jtc }
605 1.1 jtc }
606 1.1 jtc afree(toglob, ATEMP);
607 1.1 jtc
608 1.1 jtc *wordsp = nwords ? words : (char **) 0;
609 1.1 jtc
610 1.1 jtc return nwords;
611 1.1 jtc }
612 1.1 jtc
613 1.1 jtc /* Data structure used in x_command_glob() */
614 1.1 jtc struct path_order_info {
615 1.1 jtc char *word;
616 1.1 jtc int base;
617 1.1 jtc int path_order;
618 1.1 jtc };
619 1.1 jtc
620 1.1 jtc /* Compare routine used in x_command_glob() */
621 1.1 jtc static int
622 1.1 jtc path_order_cmp(aa, bb)
623 1.1 jtc const void *aa;
624 1.1 jtc const void *bb;
625 1.1 jtc {
626 1.1 jtc const struct path_order_info *a = (const struct path_order_info *) aa;
627 1.1 jtc const struct path_order_info *b = (const struct path_order_info *) bb;
628 1.1 jtc int t;
629 1.1 jtc
630 1.1 jtc t = FILECMP(a->word + a->base, b->word + b->base);
631 1.1 jtc return t ? t : a->path_order - b->path_order;
632 1.1 jtc }
633 1.1 jtc
634 1.1 jtc static int
635 1.1 jtc x_command_glob(flags, str, slen, wordsp)
636 1.1 jtc int flags;
637 1.1 jtc const char *str;
638 1.1 jtc int slen;
639 1.1 jtc char ***wordsp;
640 1.1 jtc {
641 1.1 jtc char *toglob;
642 1.1 jtc char *pat;
643 1.1 jtc char *fpath;
644 1.1 jtc int nwords;
645 1.1 jtc XPtrV w;
646 1.1 jtc struct block *l;
647 1.1 jtc
648 1.1 jtc if (slen < 0)
649 1.1 jtc return 0;
650 1.1 jtc
651 1.1 jtc toglob = add_glob(str, slen);
652 1.1 jtc
653 1.1 jtc /* Convert "foo*" (toglob) to a pattern for future use */
654 1.1 jtc pat = evalstr(toglob, DOPAT|DOTILDE);
655 1.1 jtc afree(toglob, ATEMP);
656 1.1 jtc
657 1.1 jtc XPinit(w, 32);
658 1.1 jtc
659 1.1 jtc glob_table(pat, &w, &keywords);
660 1.1 jtc glob_table(pat, &w, &aliases);
661 1.1 jtc glob_table(pat, &w, &builtins);
662 1.1 jtc for (l = e->loc; l; l = l->next)
663 1.1 jtc glob_table(pat, &w, &l->funs);
664 1.1 jtc
665 1.1 jtc glob_path(flags, pat, &w, path);
666 1.1 jtc if ((fpath = str_val(global("FPATH"))) != null)
667 1.1 jtc glob_path(flags, pat, &w, fpath);
668 1.1 jtc
669 1.1 jtc nwords = XPsize(w);
670 1.1 jtc
671 1.1 jtc if (!nwords) {
672 1.1 jtc *wordsp = (char **) 0;
673 1.1 jtc XPfree(w);
674 1.1 jtc return 0;
675 1.1 jtc }
676 1.1 jtc
677 1.1 jtc /* Sort entries */
678 1.1 jtc if (flags & XCF_FULLPATH) {
679 1.1 jtc /* Sort by basename, then path order */
680 1.1 jtc struct path_order_info *info;
681 1.1 jtc struct path_order_info *last_info = 0;
682 1.1 jtc char **words = (char **) XPptrv(w);
683 1.1 jtc int path_order = 0;
684 1.1 jtc int i;
685 1.1 jtc
686 1.1 jtc info = (struct path_order_info *)
687 1.1 jtc alloc(sizeof(struct path_order_info) * nwords, ATEMP);
688 1.1 jtc for (i = 0; i < nwords; i++) {
689 1.1 jtc info[i].word = words[i];
690 1.1 jtc info[i].base = x_basename(words[i], (char *) 0);
691 1.1 jtc if (!last_info || info[i].base != last_info->base
692 1.1 jtc || FILENCMP(words[i],
693 1.1 jtc last_info->word, info[i].base) != 0)
694 1.1 jtc {
695 1.1 jtc last_info = &info[i];
696 1.1 jtc path_order++;
697 1.1 jtc }
698 1.1 jtc info[i].path_order = path_order;
699 1.1 jtc }
700 1.1 jtc qsort(info, nwords, sizeof(struct path_order_info),
701 1.1 jtc path_order_cmp);
702 1.1 jtc for (i = 0; i < nwords; i++)
703 1.1 jtc words[i] = info[i].word;
704 1.1 jtc afree((void *) info, ATEMP);
705 1.1 jtc } else {
706 1.1 jtc /* Sort and remove duplicate entries */
707 1.1 jtc char **words = (char **) XPptrv(w);
708 1.1 jtc int i, j;
709 1.1 jtc
710 1.1 jtc qsortp(XPptrv(w), (size_t) nwords, xstrcmp);
711 1.1 jtc
712 1.1 jtc for (i = j = 0; i < nwords - 1; i++) {
713 1.1 jtc if (strcmp(words[i], words[i + 1]))
714 1.1 jtc words[j++] = words[i];
715 1.1 jtc else
716 1.1 jtc afree(words[i], ATEMP);
717 1.1 jtc }
718 1.1 jtc words[j++] = words[i];
719 1.1 jtc nwords = j;
720 1.1 jtc w.cur = (void **) &words[j];
721 1.1 jtc }
722 1.1 jtc
723 1.1 jtc XPput(w, NULL);
724 1.1 jtc *wordsp = (char **) XPclose(w);
725 1.1 jtc
726 1.1 jtc return nwords;
727 1.1 jtc }
728 1.1 jtc
729 1.5 hubertf #define IS_WORDC(c) !(ctype(c, C_LEX1) || (c) == '\'' || (c) == '"')
730 1.1 jtc
731 1.1 jtc static int
732 1.1 jtc x_locate_word(buf, buflen, pos, startp, is_commandp)
733 1.1 jtc const char *buf;
734 1.1 jtc int buflen;
735 1.1 jtc int pos;
736 1.1 jtc int *startp;
737 1.1 jtc int *is_commandp;
738 1.1 jtc {
739 1.1 jtc int p;
740 1.1 jtc int start, end;
741 1.1 jtc
742 1.1 jtc /* Bad call? Probably should report error */
743 1.1 jtc if (pos < 0 || pos > buflen) {
744 1.1 jtc *startp = pos;
745 1.1 jtc *is_commandp = 0;
746 1.1 jtc return 0;
747 1.1 jtc }
748 1.5 hubertf /* The case where pos == buflen happens to take care of itself... */
749 1.1 jtc
750 1.1 jtc start = pos;
751 1.1 jtc /* Keep going backwards to start of word (has effect of allowing
752 1.1 jtc * one blank after the end of a word)
753 1.1 jtc */
754 1.1 jtc for (; start > 0 && IS_WORDC(buf[start - 1]); start--)
755 1.1 jtc ;
756 1.1 jtc /* Go forwards to end of word */
757 1.1 jtc for (end = start; end < buflen && IS_WORDC(buf[end]); end++)
758 1.1 jtc ;
759 1.1 jtc
760 1.1 jtc if (is_commandp) {
761 1.1 jtc int iscmd;
762 1.1 jtc
763 1.1 jtc /* Figure out if this is a command */
764 1.4 christos for (p = start - 1; p >= 0 && isspace((unsigned char)buf[p]); p--)
765 1.1 jtc ;
766 1.1 jtc iscmd = p < 0 || strchr(";|&()", buf[p]);
767 1.1 jtc if (iscmd) {
768 1.1 jtc /* If command has a /, path, etc. is not searched;
769 1.1 jtc * only current directory is searched, which is just
770 1.1 jtc * like file globbing.
771 1.1 jtc */
772 1.1 jtc for (p = start; p < end; p++)
773 1.1 jtc if (ISDIRSEP(buf[p]))
774 1.1 jtc break;
775 1.1 jtc iscmd = p == end;
776 1.1 jtc }
777 1.1 jtc *is_commandp = iscmd;
778 1.1 jtc }
779 1.1 jtc
780 1.1 jtc *startp = start;
781 1.1 jtc
782 1.1 jtc return end - start;
783 1.1 jtc }
784 1.1 jtc
785 1.1 jtc int
786 1.1 jtc x_cf_glob(flags, buf, buflen, pos, startp, endp, wordsp, is_commandp)
787 1.1 jtc int flags;
788 1.1 jtc const char *buf;
789 1.1 jtc int buflen;
790 1.1 jtc int pos;
791 1.1 jtc int *startp;
792 1.1 jtc int *endp;
793 1.1 jtc char ***wordsp;
794 1.1 jtc int *is_commandp;
795 1.1 jtc {
796 1.1 jtc int len;
797 1.1 jtc int nwords;
798 1.1 jtc char **words;
799 1.1 jtc int is_command;
800 1.1 jtc
801 1.1 jtc len = x_locate_word(buf, buflen, pos, startp, &is_command);
802 1.1 jtc if (!(flags & XCF_COMMAND))
803 1.1 jtc is_command = 0;
804 1.1 jtc /* Don't do command globing on zero length strings - it takes too
805 1.1 jtc * long and isn't very useful. File globs are more likely to be
806 1.1 jtc * useful, so allow these.
807 1.1 jtc */
808 1.1 jtc if (len == 0 && is_command)
809 1.1 jtc return 0;
810 1.1 jtc
811 1.1 jtc nwords = (is_command ? x_command_glob : x_file_glob)(flags,
812 1.1 jtc buf + *startp, len, &words);
813 1.1 jtc if (nwords == 0) {
814 1.1 jtc *wordsp = (char **) 0;
815 1.1 jtc return 0;
816 1.1 jtc }
817 1.1 jtc
818 1.1 jtc if (is_commandp)
819 1.1 jtc *is_commandp = is_command;
820 1.1 jtc *wordsp = words;
821 1.1 jtc *endp = *startp + len;
822 1.1 jtc
823 1.1 jtc return nwords;
824 1.1 jtc }
825 1.1 jtc
826 1.1 jtc /* Given a string, copy it and possibly add a '*' to the end. The
827 1.1 jtc * new string is returned.
828 1.1 jtc */
829 1.1 jtc static char *
830 1.1 jtc add_glob(str, slen)
831 1.1 jtc const char *str;
832 1.1 jtc int slen;
833 1.1 jtc {
834 1.1 jtc char *toglob;
835 1.1 jtc char *s;
836 1.2 tls bool_t saw_slash = FALSE;
837 1.1 jtc
838 1.1 jtc if (slen < 0)
839 1.1 jtc return (char *) 0;
840 1.1 jtc
841 1.1 jtc toglob = str_nsave(str, slen + 1, ATEMP); /* + 1 for "*" */
842 1.1 jtc toglob[slen] = '\0';
843 1.1 jtc
844 1.1 jtc /*
845 1.1 jtc * If the pathname contains a wildcard (an unquoted '*',
846 1.2 tls * '?', or '[') or parameter expansion ('$'), or a ~username
847 1.2 tls * with no trailing slash, then it is globbed based on that
848 1.2 tls * value (i.e., without the appended '*').
849 1.1 jtc */
850 1.1 jtc for (s = toglob; *s; s++) {
851 1.1 jtc if (*s == '\\' && s[1])
852 1.1 jtc s++;
853 1.1 jtc else if (*s == '*' || *s == '[' || *s == '?' || *s == '$'
854 1.1 jtc || (s[1] == '(' /*)*/ && strchr("*+?@!", *s)))
855 1.1 jtc break;
856 1.2 tls else if (ISDIRSEP(*s))
857 1.2 tls saw_slash = TRUE;
858 1.1 jtc }
859 1.2 tls if (!*s && (*toglob != '~' || saw_slash)) {
860 1.1 jtc toglob[slen] = '*';
861 1.1 jtc toglob[slen + 1] = '\0';
862 1.1 jtc }
863 1.1 jtc
864 1.1 jtc return toglob;
865 1.1 jtc }
866 1.1 jtc
867 1.1 jtc /*
868 1.1 jtc * Find longest common prefix
869 1.1 jtc */
870 1.1 jtc int
871 1.1 jtc x_longest_prefix(nwords, words)
872 1.1 jtc int nwords;
873 1.1 jtc char *const *words;
874 1.1 jtc {
875 1.1 jtc int i, j;
876 1.1 jtc int prefix_len;
877 1.1 jtc char *p;
878 1.1 jtc
879 1.1 jtc if (nwords <= 0)
880 1.1 jtc return 0;
881 1.1 jtc
882 1.1 jtc prefix_len = strlen(words[0]);
883 1.1 jtc for (i = 1; i < nwords; i++)
884 1.1 jtc for (j = 0, p = words[i]; j < prefix_len; j++)
885 1.1 jtc if (FILECHCONV(p[j]) != FILECHCONV(words[0][j])) {
886 1.1 jtc prefix_len = j;
887 1.1 jtc break;
888 1.1 jtc }
889 1.1 jtc return prefix_len;
890 1.1 jtc }
891 1.1 jtc
892 1.1 jtc void
893 1.1 jtc x_free_words(nwords, words)
894 1.1 jtc int nwords;
895 1.1 jtc char **words;
896 1.1 jtc {
897 1.1 jtc int i;
898 1.1 jtc
899 1.1 jtc for (i = 0; i < nwords; i++)
900 1.1 jtc if (words[i])
901 1.1 jtc afree(words[i], ATEMP);
902 1.1 jtc afree(words, ATEMP);
903 1.1 jtc }
904 1.1 jtc
905 1.1 jtc /* Return the offset of the basename of string s (which ends at se - need not
906 1.1 jtc * be null terminated). Trailing slashes are ignored. If s is just a slash,
907 1.1 jtc * then the offset is 0 (actually, length - 1).
908 1.1 jtc * s Return
909 1.1 jtc * /etc 1
910 1.1 jtc * /etc/ 1
911 1.1 jtc * /etc// 1
912 1.1 jtc * /etc/fo 5
913 1.1 jtc * foo 0
914 1.1 jtc * /// 2
915 1.1 jtc * 0
916 1.1 jtc */
917 1.1 jtc int
918 1.1 jtc x_basename(s, se)
919 1.1 jtc const char *s;
920 1.1 jtc const char *se;
921 1.1 jtc {
922 1.1 jtc const char *p;
923 1.1 jtc
924 1.1 jtc if (se == (char *) 0)
925 1.1 jtc se = s + strlen(s);
926 1.1 jtc if (s == se)
927 1.1 jtc return 0;
928 1.1 jtc
929 1.1 jtc /* Skip trailing slashes */
930 1.1 jtc for (p = se - 1; p > s && ISDIRSEP(*p); p--)
931 1.1 jtc ;
932 1.1 jtc for (; p > s && !ISDIRSEP(*p); p--)
933 1.1 jtc ;
934 1.1 jtc if (ISDIRSEP(*p) && p + 1 < se)
935 1.1 jtc p++;
936 1.1 jtc
937 1.1 jtc return p - s;
938 1.1 jtc }
939 1.1 jtc
940 1.1 jtc /*
941 1.1 jtc * Apply pattern matching to a table: all table entries that match a pattern
942 1.1 jtc * are added to wp.
943 1.1 jtc */
944 1.1 jtc static void
945 1.1 jtc glob_table(pat, wp, tp)
946 1.1 jtc const char *pat;
947 1.1 jtc XPtrV *wp;
948 1.1 jtc struct table *tp;
949 1.1 jtc {
950 1.1 jtc struct tstate ts;
951 1.1 jtc struct tbl *te;
952 1.1 jtc
953 1.1 jtc for (twalk(&ts, tp); (te = tnext(&ts)); ) {
954 1.1 jtc if (gmatch(te->name, pat, FALSE))
955 1.1 jtc XPput(*wp, str_save(te->name, ATEMP));
956 1.1 jtc }
957 1.1 jtc }
958 1.1 jtc
959 1.1 jtc static void
960 1.1 jtc glob_path(flags, pat, wp, path)
961 1.1 jtc int flags;
962 1.1 jtc const char *pat;
963 1.1 jtc XPtrV *wp;
964 1.1 jtc const char *path;
965 1.1 jtc {
966 1.1 jtc const char *sp, *p;
967 1.1 jtc char *xp;
968 1.1 jtc int pathlen;
969 1.1 jtc int patlen;
970 1.1 jtc int oldsize, newsize, i, j;
971 1.1 jtc char **words;
972 1.1 jtc XString xs;
973 1.1 jtc
974 1.1 jtc patlen = strlen(pat) + 1;
975 1.1 jtc sp = path;
976 1.1 jtc Xinit(xs, xp, patlen + 128, ATEMP);
977 1.1 jtc while (sp) {
978 1.1 jtc xp = Xstring(xs, xp);
979 1.1 jtc if (!(p = strchr(sp, PATHSEP)))
980 1.1 jtc p = sp + strlen(sp);
981 1.1 jtc pathlen = p - sp;
982 1.1 jtc if (pathlen) {
983 1.1 jtc /* Copy sp into xp, stuffing any MAGIC characters
984 1.1 jtc * on the way
985 1.1 jtc */
986 1.1 jtc const char *s = sp;
987 1.1 jtc
988 1.1 jtc XcheckN(xs, xp, pathlen * 2);
989 1.1 jtc while (s < p) {
990 1.1 jtc if (ISMAGIC(*s))
991 1.1 jtc *xp++ = MAGIC;
992 1.1 jtc *xp++ = *s++;
993 1.1 jtc }
994 1.1 jtc *xp++ = DIRSEP;
995 1.1 jtc pathlen++;
996 1.1 jtc }
997 1.1 jtc sp = p;
998 1.1 jtc XcheckN(xs, xp, patlen);
999 1.1 jtc memcpy(xp, pat, patlen);
1000 1.1 jtc
1001 1.1 jtc oldsize = XPsize(*wp);
1002 1.1 jtc glob_str(Xstring(xs, xp), wp, 0);
1003 1.1 jtc newsize = XPsize(*wp);
1004 1.1 jtc
1005 1.1 jtc /* Check that each match is executable... */
1006 1.1 jtc words = (char **) XPptrv(*wp);
1007 1.1 jtc for (i = j = oldsize; i < newsize; i++) {
1008 1.1 jtc if (search_access(words[i], X_OK, (int *) 0) >= 0) {
1009 1.1 jtc words[j] = words[i];
1010 1.1 jtc if (!(flags & XCF_FULLPATH))
1011 1.1 jtc memmove(words[j], words[j] + pathlen,
1012 1.1 jtc strlen(words[j] + pathlen) + 1);
1013 1.1 jtc j++;
1014 1.1 jtc } else
1015 1.1 jtc afree(words[i], ATEMP);
1016 1.1 jtc }
1017 1.1 jtc wp->cur = (void **) &words[j];
1018 1.1 jtc
1019 1.1 jtc if (!*sp++)
1020 1.1 jtc break;
1021 1.1 jtc }
1022 1.1 jtc Xfree(xs, xp);
1023 1.1 jtc }
1024 1.1 jtc
1025 1.1 jtc #endif /* EDIT */
1026