xref: /dragonfly/contrib/dialog/fselect.c (revision 279dd846)
1 /*
2  *  $Id: fselect.c,v 1.93 2012/12/30 20:52:25 tom Exp $
3  *
4  *  fselect.c -- implements the file-selector box
5  *
6  *  Copyright 2000-2011,2012	Thomas E. Dickey
7  *
8  *  This program is free software; you can redistribute it and/or modify
9  *  it under the terms of the GNU Lesser General Public License, version 2.1
10  *  as published by the Free Software Foundation.
11  *
12  *  This program is distributed in the hope that it will be useful, but
13  *  WITHOUT ANY WARRANTY; without even the implied warranty of
14  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
15  *  Lesser General Public License for more details.
16  *
17  *  You should have received a copy of the GNU Lesser General Public
18  *  License along with this program; if not, write to
19  *	Free Software Foundation, Inc.
20  *	51 Franklin St., Fifth Floor
21  *	Boston, MA 02110, USA.
22  */
23 
24 #include <dialog.h>
25 #include <dlg_keys.h>
26 
27 #include <sys/types.h>
28 #include <sys/stat.h>
29 
30 #if HAVE_DIRENT_H
31 # include <dirent.h>
32 # define NAMLEN(dirent) strlen((dirent)->d_name)
33 #else
34 # define dirent direct
35 # define NAMLEN(dirent) (dirent)->d_namlen
36 # if HAVE_SYS_NDIR_H
37 #  include <sys/ndir.h>
38 # endif
39 # if HAVE_SYS_DIR_H
40 #  include <sys/dir.h>
41 # endif
42 # if HAVE_NDIR_H
43 #  include <ndir.h>
44 # endif
45 #endif
46 
47 # if defined(_FILE_OFFSET_BITS) && defined(HAVE_STRUCT_DIRENT64)
48 #  if !defined(_LP64) && (_FILE_OFFSET_BITS == 64)
49 #   define      DIRENT  struct dirent64
50 #  else
51 #   define      DIRENT  struct dirent
52 #  endif
53 # else
54 #  define       DIRENT  struct dirent
55 # endif
56 
57 #define EXT_WIDE 1
58 #define HDR_HIGH 1
59 #define BTN_HIGH (1 + 2 * MARGIN)	/* Ok/Cancel, also input-box */
60 #define MIN_HIGH (HDR_HIGH - MARGIN + (BTN_HIGH * 2) + 4 * MARGIN)
61 #define MIN_WIDE (2 * MAX(dlg_count_columns(d_label), dlg_count_columns(f_label)) + 6 * MARGIN + 2 * EXT_WIDE)
62 
63 #define MOUSE_D (KEY_MAX + 0)
64 #define MOUSE_F (KEY_MAX + 10000)
65 #define MOUSE_T (KEY_MAX + 20000)
66 
67 typedef enum {
68     sDIRS = -3
69     ,sFILES = -2
70     ,sTEXT = -1
71 } STATES;
72 
73 typedef struct {
74     WINDOW *par;		/* parent window */
75     WINDOW *win;		/* this window */
76     int length;			/* length of the data[] array */
77     int offset;			/* index of first item on screen */
78     int choice;			/* index of the selection */
79     int mousex;			/* base of mouse-code return-values */
80     unsigned allocd;
81     char **data;
82 } LIST;
83 
84 typedef struct {
85     int length;
86     char **data;
87 } MATCH;
88 
89 static void
90 init_list(LIST * list, WINDOW *par, WINDOW *win, int mousex)
91 {
92     list->par = par;
93     list->win = win;
94     list->length = 0;
95     list->offset = 0;
96     list->choice = 0;
97     list->mousex = mousex;
98     list->allocd = 0;
99     list->data = 0;
100     dlg_mouse_mkbigregion(getbegy(win), getbegx(win),
101 			  getmaxy(win), getmaxx(win),
102 			  mousex, 1, 1, 1 /* by lines */ );
103 }
104 
105 static char *
106 leaf_of(char *path)
107 {
108     char *leaf = strrchr(path, '/');
109     if (leaf != 0)
110 	leaf++;
111     else
112 	leaf = path;
113     return leaf;
114 }
115 
116 static char *
117 data_of(LIST * list)
118 {
119     if (list != 0
120 	&& list->data != 0)
121 	return list->data[list->choice];
122     return 0;
123 }
124 
125 static void
126 free_list(LIST * list, int reinit)
127 {
128     int n;
129 
130     if (list->data != 0) {
131 	for (n = 0; list->data[n] != 0; n++)
132 	    free(list->data[n]);
133 	free(list->data);
134 	list->data = 0;
135     }
136     if (reinit)
137 	init_list(list, list->par, list->win, list->mousex);
138 }
139 
140 static void
141 add_to_list(LIST * list, char *text)
142 {
143     unsigned need;
144 
145     need = (unsigned) (list->length + 1);
146     if (need + 1 > list->allocd) {
147 	list->allocd = 2 * (need + 1);
148 	if (list->data == 0) {
149 	    list->data = dlg_malloc(char *, list->allocd);
150 	} else {
151 	    list->data = dlg_realloc(char *, list->allocd, list->data);
152 	}
153 	assert_ptr(list->data, "add_to_list");
154     }
155     list->data[list->length++] = dlg_strclone(text);
156     list->data[list->length] = 0;
157 }
158 
159 static void
160 keep_visible(LIST * list)
161 {
162     int high = getmaxy(list->win);
163 
164     if (list->choice < list->offset) {
165 	list->offset = list->choice;
166     }
167     if (list->choice - list->offset >= high)
168 	list->offset = list->choice - high + 1;
169 }
170 
171 #define Value(c) (int)((c) & 0xff)
172 
173 static int
174 find_choice(char *target, LIST * list)
175 {
176     int n;
177     int choice = list->choice;
178     int len_1, len_2, cmp_1, cmp_2;
179 
180     if (*target == 0) {
181 	list->choice = 0;
182     } else {
183 	/* find the match with the longest length.  If more than one has the
184 	 * same length, choose the one with the closest match of the final
185 	 * character.
186 	 */
187 	len_1 = 0;
188 	cmp_1 = 256;
189 	for (n = 0; n < list->length; n++) {
190 	    char *a = target;
191 	    char *b = list->data[n];
192 
193 	    len_2 = 0;
194 	    while ((*a != 0) && (*b != 0) && (*a == *b)) {
195 		a++;
196 		b++;
197 		len_2++;
198 	    }
199 	    cmp_2 = Value(*a) - Value(*b);
200 	    if (cmp_2 < 0)
201 		cmp_2 = -cmp_2;
202 	    if ((len_2 > len_1)
203 		|| (len_1 == len_2 && cmp_2 < cmp_1)) {
204 		len_1 = len_2;
205 		cmp_1 = cmp_2;
206 		list->choice = n;
207 	    }
208 	}
209     }
210     if (choice != list->choice) {
211 	keep_visible(list);
212     }
213     return (choice != list->choice);
214 }
215 
216 static void
217 display_list(LIST * list)
218 {
219     int n;
220     int x;
221     int y;
222     int top;
223     int bottom;
224 
225     if (list->win != 0) {
226 	dlg_attr_clear(list->win, getmaxy(list->win), getmaxx(list->win), item_attr);
227 	for (n = list->offset; n < list->length && list->data[n]; n++) {
228 	    y = n - list->offset;
229 	    if (y >= getmaxy(list->win))
230 		break;
231 	    (void) wmove(list->win, y, 0);
232 	    if (n == list->choice)
233 		(void) wattrset(list->win, item_selected_attr);
234 	    (void) waddstr(list->win, list->data[n]);
235 	    (void) wattrset(list->win, item_attr);
236 	}
237 	(void) wattrset(list->win, item_attr);
238 
239 	getparyx(list->win, y, x);
240 
241 	top = y - 1;
242 	bottom = y + getmaxy(list->win);
243 	dlg_draw_scrollbar(list->par,
244 			   (long) list->offset,
245 			   (long) list->offset,
246 			   (long) (list->offset + getmaxy(list->win)),
247 			   (long) (list->length),
248 			   x + 1,
249 			   x + getmaxx(list->win),
250 			   top,
251 			   bottom,
252 			   menubox_border2_attr,
253 			   menubox_border_attr);
254 
255 	(void) wmove(list->win, list->choice - list->offset, 0);
256 	(void) wnoutrefresh(list->win);
257     }
258 }
259 
260 /* FIXME: see arrows.c
261  * This workaround is used to allow two lists to have scroll-tabs at the same
262  * time, by reassigning their return-values to be different.  Just for
263  * readability, we use the names of keys with similar connotations, though all
264  * that is really required is that they're distinct, so we can put them in a
265  * switch statement.
266  */
267 static void
268 fix_arrows(LIST * list)
269 {
270     int x;
271     int y;
272     int top;
273     int right;
274     int bottom;
275 
276     if (list->win != 0) {
277 	getparyx(list->win, y, x);
278 	top = y - 1;
279 	right = getmaxx(list->win);
280 	bottom = y + getmaxy(list->win);
281 
282 	mouse_mkbutton(top, x, right,
283 		       ((list->mousex == MOUSE_D)
284 			? KEY_PREVIOUS
285 			: KEY_PPAGE));
286 	mouse_mkbutton(bottom, x, right,
287 		       ((list->mousex == MOUSE_D)
288 			? KEY_NEXT
289 			: KEY_NPAGE));
290     }
291 }
292 
293 static int
294 show_list(char *target, LIST * list, int keep)
295 {
296     int changed = keep || find_choice(target, list);
297     display_list(list);
298     return changed;
299 }
300 
301 /*
302  * Highlight the closest match to 'target' in the given list, setting offset
303  * to match.
304  */
305 static int
306 show_both_lists(char *input, LIST * d_list, LIST * f_list, int keep)
307 {
308     char *leaf = leaf_of(input);
309 
310     return show_list(leaf, d_list, keep) | show_list(leaf, f_list, keep);
311 }
312 
313 /*
314  * Move up/down in the given list
315  */
316 static bool
317 change_list(int choice, LIST * list)
318 {
319     if (data_of(list) != 0) {
320 	int last = list->length - 1;
321 
322 	choice += list->choice;
323 	if (choice < 0)
324 	    choice = 0;
325 	if (choice > last)
326 	    choice = last;
327 	list->choice = choice;
328 	keep_visible(list);
329 	display_list(list);
330 	return TRUE;
331     }
332     return FALSE;
333 }
334 
335 static void
336 scroll_list(int direction, LIST * list)
337 {
338     if (data_of(list) != 0) {
339 	int length = getmaxy(list->win);
340 	if (change_list(direction * length, list))
341 	    return;
342     }
343     beep();
344 }
345 
346 static int
347 compar(const void *a, const void *b)
348 {
349     return strcmp(*(const char *const *) a, *(const char *const *) b);
350 }
351 
352 static void
353 match(char *name, LIST * d_list, LIST * f_list, MATCH * match_list)
354 {
355     char *test = leaf_of(name);
356     size_t test_len = strlen(test);
357     char **matches = dlg_malloc(char *, (size_t) (d_list->length + f_list->length));
358     size_t data_len = 0;
359     int i;
360     for (i = 2; i < d_list->length; i++) {
361 	if (strncmp(test, d_list->data[i], test_len) == 0) {
362 	    matches[data_len++] = d_list->data[i];
363 	}
364     }
365     for (i = 0; i < f_list->length; i++) {
366 	if (strncmp(test, f_list->data[i], test_len) == 0) {
367 	    matches[data_len++] = f_list->data[i];
368 	}
369     }
370     matches = dlg_realloc(char *, data_len + 1, matches);
371     match_list->data = matches;
372     match_list->length = (int) data_len;
373 }
374 
375 static void
376 free_match(MATCH * match_list)
377 {
378     free(match_list->data);
379     match_list->length = 0;
380 }
381 
382 static int
383 complete(char *name, LIST * d_list, LIST * f_list, char **buff_ptr)
384 {
385     MATCH match_list;
386     char *test;
387     size_t test_len;
388     size_t i;
389     int j;
390     char *buff;
391 
392     match(name, d_list, f_list, &match_list);
393     if (match_list.length == 0) {
394 	*buff_ptr = NULL;
395 	return 0;
396     }
397 
398     test = match_list.data[0];
399     test_len = strlen(test);
400     buff = dlg_malloc(char, test_len + 2);
401     if (match_list.length == 1) {
402 	strcpy(buff, test);
403 	i = test_len;
404 	if (test == data_of(d_list)) {
405 	    buff[test_len] = '/';
406 	    i++;
407 	}
408     } else {
409 	for (i = 0; i < test_len; i++) {
410 	    char test_char = test[i];
411 	    if (test_char == '\0')
412 		break;
413 	    for (j = 0; j < match_list.length; j++) {
414 		if (match_list.data[j][i] != test_char) {
415 		    break;
416 		}
417 	    }
418 	    if (j == match_list.length) {
419 		(buff)[i] = test_char;
420 	    } else
421 		break;
422 	}
423 	buff = dlg_realloc(char, i + 1, buff);
424     }
425     free_match(&match_list);
426     buff[i] = '\0';
427     *buff_ptr = buff;
428     return (i != 0);
429 }
430 
431 static bool
432 fill_lists(char *current, char *input, LIST * d_list, LIST * f_list, int keep)
433 {
434     bool result = TRUE;
435     bool rescan = FALSE;
436     DIR *dp;
437     DIRENT *de;
438     struct stat sb;
439     int n;
440     char path[MAX_LEN + 1];
441     char *leaf;
442 
443     /* check if we've updated the lists */
444     for (n = 0; current[n] && input[n]; n++) {
445 	if (current[n] != input[n])
446 	    break;
447     }
448 
449     if (current[n] == input[n]) {
450 	result = FALSE;
451 	rescan = (n == 0 && d_list->length == 0);
452     } else if (strchr(current + n, '/') == 0
453 	       && strchr(input + n, '/') == 0) {
454 	result = show_both_lists(input, d_list, f_list, keep);
455     } else {
456 	rescan = TRUE;
457     }
458 
459     if (rescan) {
460 	size_t have = strlen(input);
461 
462 	if (have > MAX_LEN)
463 	    have = MAX_LEN;
464 	memcpy(current, input, have);
465 	current[have] = '\0';
466 
467 	/* refill the lists */
468 	free_list(d_list, TRUE);
469 	free_list(f_list, TRUE);
470 	memcpy(path, current, have);
471 	path[have] = '\0';
472 	if ((leaf = strrchr(path, '/')) != 0) {
473 	    *++leaf = 0;
474 	} else {
475 	    strcpy(path, "./");
476 	    leaf = path + strlen(path);
477 	}
478 	dlg_trace_msg("opendir '%s'\n", path);
479 	if ((dp = opendir(path)) != 0) {
480 	    while ((de = readdir(dp)) != 0) {
481 		strncpy(leaf, de->d_name, NAMLEN(de))[NAMLEN(de)] = 0;
482 		if (stat(path, &sb) == 0) {
483 		    if ((sb.st_mode & S_IFMT) == S_IFDIR)
484 			add_to_list(d_list, leaf);
485 		    else if (f_list->win)
486 			add_to_list(f_list, leaf);
487 		}
488 	    }
489 	    (void) closedir(dp);
490 	    /* sort the lists */
491 	    if (d_list->data != 0 && d_list->length > 1) {
492 		qsort(d_list->data,
493 		      (size_t) d_list->length,
494 		      sizeof(d_list->data[0]),
495 		      compar);
496 	    }
497 	    if (f_list->data != 0 && f_list->length > 1) {
498 		qsort(f_list->data,
499 		      (size_t) f_list->length,
500 		      sizeof(f_list->data[0]),
501 		      compar);
502 	    }
503 	}
504 
505 	(void) show_both_lists(input, d_list, f_list, FALSE);
506 	d_list->offset = d_list->choice;
507 	f_list->offset = f_list->choice;
508 	result = TRUE;
509     }
510     return result;
511 }
512 
513 static bool
514 usable_state(int state, LIST * dirs, LIST * files)
515 {
516     bool result;
517 
518     switch (state) {
519     case sDIRS:
520 	result = (dirs->win != 0) && (data_of(dirs) != 0);
521 	break;
522     case sFILES:
523 	result = (files->win != 0) && (data_of(files) != 0);
524 	break;
525     default:
526 	result = TRUE;
527 	break;
528     }
529     return result;
530 }
531 
532 #define which_list() ((state == sFILES) \
533 			? &f_list \
534 			: ((state == sDIRS) \
535 			  ? &d_list \
536 			  : 0))
537 #define NAVIGATE_BINDINGS \
538 	DLG_KEYS_DATA( DLGK_FIELD_NEXT, KEY_RIGHT ), \
539 	DLG_KEYS_DATA( DLGK_FIELD_NEXT, TAB ), \
540 	DLG_KEYS_DATA( DLGK_FIELD_PREV, KEY_BTAB ), \
541 	DLG_KEYS_DATA( DLGK_ITEM_NEXT,  KEY_DOWN ), \
542 	DLG_KEYS_DATA( DLGK_ITEM_NEXT,  CHR_NEXT ), \
543 	DLG_KEYS_DATA( DLGK_ITEM_NEXT,  KEY_NEXT ), \
544 	DLG_KEYS_DATA( DLGK_ITEM_PREV,  CHR_PREVIOUS ), \
545 	DLG_KEYS_DATA( DLGK_ITEM_PREV,  KEY_UP ), \
546 	DLG_KEYS_DATA( DLGK_PAGE_NEXT,  KEY_NPAGE ), \
547 	DLG_KEYS_DATA( DLGK_PAGE_PREV,  KEY_PPAGE )
548 
549 /*
550  * Display a dialog box for entering a filename
551  */
552 static int
553 dlg_fselect(const char *title, const char *path, int height, int width, int dselect)
554 {
555     /* *INDENT-OFF* */
556     static DLG_KEYS_BINDING binding[] = {
557 	HELPKEY_BINDINGS,
558 	ENTERKEY_BINDINGS,
559 	NAVIGATE_BINDINGS,
560 	END_KEYS_BINDING
561     };
562     static DLG_KEYS_BINDING binding2[] = {
563 	INPUTSTR_BINDINGS,
564 	HELPKEY_BINDINGS,
565 	ENTERKEY_BINDINGS,
566 	NAVIGATE_BINDINGS,
567 	END_KEYS_BINDING
568     };
569     /* *INDENT-ON* */
570 
571 #ifdef KEY_RESIZE
572     int old_height = height;
573     int old_width = width;
574     bool resized = FALSE;
575 #endif
576     int tbox_y, tbox_x, tbox_width, tbox_height;
577     int dbox_y, dbox_x, dbox_width, dbox_height;
578     int fbox_y, fbox_x, fbox_width, fbox_height;
579     int show_buttons = TRUE;
580     int offset = 0;
581     int key = 0;
582     int fkey = FALSE;
583     int code;
584     int result = DLG_EXIT_UNKNOWN;
585     int state = dialog_vars.default_button >= 0 ? dlg_default_button() : sTEXT;
586     int button;
587     int first = (state == sTEXT);
588     int first_trace = TRUE;
589     char *input;
590     char *completed;
591     char current[MAX_LEN + 1];
592     WINDOW *dialog = 0;
593     WINDOW *w_text = 0;
594     WINDOW *w_work = 0;
595     const char **buttons = dlg_ok_labels();
596     const char *d_label = _("Directories");
597     const char *f_label = _("Files");
598     char *partial = 0;
599     int min_wide = MIN_WIDE;
600     int min_items = height ? 0 : 4;
601     LIST d_list, f_list;
602 
603     dlg_does_output();
604 
605     /* Set up the initial value */
606     input = dlg_set_result(path);
607     offset = (int) strlen(input);
608     *current = 0;
609 
610     dlg_button_layout(buttons, &min_wide);
611 
612 #ifdef KEY_RESIZE
613   retry:
614 #endif
615     dlg_auto_size(title, (char *) 0, &height, &width, 6, 25);
616     height += MIN_HIGH + min_items;
617     if (width < min_wide)
618 	width = min_wide;
619     dlg_print_size(height, width);
620     dlg_ctl_size(height, width);
621 
622     dialog = dlg_new_window(height, width,
623 			    dlg_box_y_ordinate(height),
624 			    dlg_box_x_ordinate(width));
625     dlg_register_window(dialog, "fselect", binding);
626     dlg_register_buttons(dialog, "fselect", buttons);
627 
628     dlg_mouse_setbase(0, 0);
629 
630     dlg_draw_box2(dialog, 0, 0, height, width, dialog_attr, border_attr, border2_attr);
631     dlg_draw_bottom_box2(dialog, border_attr, border2_attr, dialog_attr);
632     dlg_draw_title(dialog, title);
633 
634     (void) wattrset(dialog, dialog_attr);
635 
636     /* Draw the input field box */
637     tbox_height = 1;
638     tbox_width = width - (4 * MARGIN + 2);
639     tbox_y = height - (BTN_HIGH * 2) + MARGIN;
640     tbox_x = (width - tbox_width) / 2;
641 
642     w_text = derwin(dialog, tbox_height, tbox_width, tbox_y, tbox_x);
643     if (w_text == 0) {
644 	result = DLG_EXIT_ERROR;
645 	goto finish;
646     }
647 
648     (void) keypad(w_text, TRUE);
649     dlg_draw_box(dialog, tbox_y - MARGIN, tbox_x - MARGIN,
650 		 (2 * MARGIN + 1), tbox_width + (MARGIN + EXT_WIDE),
651 		 menubox_border_attr, menubox_border2_attr);
652     dlg_mouse_mkbigregion(getbegy(dialog) + tbox_y - MARGIN,
653 			  getbegx(dialog) + tbox_x - MARGIN,
654 			  1 + (2 * MARGIN),
655 			  tbox_width + (MARGIN + EXT_WIDE),
656 			  MOUSE_T, 1, 1, 3 /* doesn't matter */ );
657 
658     dlg_register_window(w_text, "fselect2", binding2);
659 
660     /* Draw the directory listing box */
661     if (dselect)
662 	dbox_width = (width - (6 * MARGIN));
663     else
664 	dbox_width = (width - (6 * MARGIN + 2 * EXT_WIDE)) / 2;
665     dbox_height = height - MIN_HIGH;
666     dbox_y = (2 * MARGIN + 1);
667     dbox_x = tbox_x;
668 
669     w_work = derwin(dialog, dbox_height, dbox_width, dbox_y, dbox_x);
670     if (w_work == 0) {
671 	result = DLG_EXIT_ERROR;
672 	goto finish;
673     }
674 
675     (void) keypad(w_work, TRUE);
676     (void) mvwaddstr(dialog, dbox_y - (MARGIN + 1), dbox_x - MARGIN, d_label);
677     dlg_draw_box(dialog,
678 		 dbox_y - MARGIN, dbox_x - MARGIN,
679 		 dbox_height + (MARGIN + 1), dbox_width + (MARGIN + 1),
680 		 menubox_border_attr, menubox_border2_attr);
681     init_list(&d_list, dialog, w_work, MOUSE_D);
682 
683     if (!dselect) {
684 	/* Draw the filename listing box */
685 	fbox_height = dbox_height;
686 	fbox_width = dbox_width;
687 	fbox_y = dbox_y;
688 	fbox_x = tbox_x + dbox_width + (2 * MARGIN);
689 
690 	w_work = derwin(dialog, fbox_height, fbox_width, fbox_y, fbox_x);
691 	if (w_work == 0) {
692 	    result = DLG_EXIT_ERROR;
693 	    goto finish;
694 	}
695 
696 	(void) keypad(w_work, TRUE);
697 	(void) mvwaddstr(dialog, fbox_y - (MARGIN + 1), fbox_x - MARGIN, f_label);
698 	dlg_draw_box(dialog,
699 		     fbox_y - MARGIN, fbox_x - MARGIN,
700 		     fbox_height + (MARGIN + 1), fbox_width + (MARGIN + 1),
701 		     menubox_border_attr, menubox_border2_attr);
702 	init_list(&f_list, dialog, w_work, MOUSE_F);
703     } else {
704 	memset(&f_list, 0, sizeof(f_list));
705     }
706 
707     while (result == DLG_EXIT_UNKNOWN) {
708 
709 	if (fill_lists(current, input, &d_list, &f_list, state < sTEXT))
710 	    show_buttons = TRUE;
711 
712 #ifdef KEY_RESIZE
713 	if (resized) {
714 	    resized = FALSE;
715 	    dlg_show_string(w_text, input, offset, inputbox_attr,
716 			    0, 0, tbox_width, (bool) 0, (bool) first);
717 	}
718 #endif
719 
720 	/*
721 	 * The last field drawn determines where the cursor is shown:
722 	 */
723 	if (show_buttons) {
724 	    show_buttons = FALSE;
725 	    button = (state < 0) ? 0 : state;
726 	    dlg_draw_buttons(dialog, height - 2, 0, buttons, button, FALSE, width);
727 	}
728 
729 	if (first_trace) {
730 	    first_trace = FALSE;
731 	    dlg_trace_win(dialog);
732 	}
733 
734 	if (state < 0) {
735 	    switch (state) {
736 	    case sTEXT:
737 		dlg_set_focus(dialog, w_text);
738 		break;
739 	    case sFILES:
740 		dlg_set_focus(dialog, f_list.win);
741 		break;
742 	    case sDIRS:
743 		dlg_set_focus(dialog, d_list.win);
744 		break;
745 	    }
746 	}
747 
748 	if (first) {
749 	    (void) wrefresh(dialog);
750 	} else {
751 	    fix_arrows(&d_list);
752 	    fix_arrows(&f_list);
753 	    key = dlg_mouse_wgetch((state == sTEXT) ? w_text : dialog, &fkey);
754 	    if (dlg_result_key(key, fkey, &result))
755 		break;
756 	}
757 
758 	if (!fkey && key == ' ') {
759 	    key = DLGK_SELECT;
760 	    fkey = TRUE;
761 	}
762 
763 	if (fkey) {
764 	    switch (key) {
765 	    case DLGK_MOUSE(KEY_PREVIOUS):
766 		state = sDIRS;
767 		scroll_list(-1, which_list());
768 		continue;
769 	    case DLGK_MOUSE(KEY_NEXT):
770 		state = sDIRS;
771 		scroll_list(1, which_list());
772 		continue;
773 	    case DLGK_MOUSE(KEY_PPAGE):
774 		state = sFILES;
775 		scroll_list(-1, which_list());
776 		continue;
777 	    case DLGK_MOUSE(KEY_NPAGE):
778 		state = sFILES;
779 		scroll_list(1, which_list());
780 		continue;
781 	    case DLGK_PAGE_PREV:
782 		scroll_list(-1, which_list());
783 		continue;
784 	    case DLGK_PAGE_NEXT:
785 		scroll_list(1, which_list());
786 		continue;
787 	    case DLGK_ITEM_PREV:
788 		if (change_list(-1, which_list()))
789 		    continue;
790 		/* FALLTHRU */
791 	    case DLGK_FIELD_PREV:
792 		show_buttons = TRUE;
793 		do {
794 		    state = dlg_prev_ok_buttonindex(state, sDIRS);
795 		} while (!usable_state(state, &d_list, &f_list));
796 		continue;
797 	    case DLGK_ITEM_NEXT:
798 		if (change_list(1, which_list()))
799 		    continue;
800 		/* FALLTHRU */
801 	    case DLGK_FIELD_NEXT:
802 		show_buttons = TRUE;
803 		do {
804 		    state = dlg_next_ok_buttonindex(state, sDIRS);
805 		} while (!usable_state(state, &d_list, &f_list));
806 		continue;
807 	    case DLGK_SELECT:
808 		completed = 0;
809 		if (partial != 0) {
810 		    free(partial);
811 		    partial = 0;
812 		}
813 		if (state == sFILES && !dselect) {
814 		    completed = data_of(&f_list);
815 		} else if (state == sDIRS) {
816 		    completed = data_of(&d_list);
817 		} else {
818 		    if (complete(input, &d_list, &f_list, &partial)) {
819 			completed = partial;
820 		    }
821 		}
822 		if (completed != 0) {
823 		    state = sTEXT;
824 		    show_buttons = TRUE;
825 		    strcpy(leaf_of(input), completed);
826 		    offset = (int) strlen(input);
827 		    dlg_show_string(w_text, input, offset, inputbox_attr,
828 				    0, 0, tbox_width, 0, first);
829 		    if (partial != NULL) {
830 			free(partial);
831 			partial = 0;
832 		    }
833 		    continue;
834 		} else {	/* if (state < sTEXT) */
835 		    (void) beep();
836 		    continue;
837 		}
838 		/* FALLTHRU */
839 	    case DLGK_ENTER:
840 		result = (state > 0) ? dlg_enter_buttoncode(state) : DLG_EXIT_OK;
841 		continue;
842 #ifdef KEY_RESIZE
843 	    case KEY_RESIZE:
844 		/* reset data */
845 		height = old_height;
846 		width = old_width;
847 		show_buttons = TRUE;
848 		*current = 0;
849 		resized = TRUE;
850 		/* repaint */
851 		dlg_clear();
852 		dlg_del_window(dialog);
853 		refresh();
854 		dlg_mouse_free_regions();
855 		goto retry;
856 #endif
857 	    default:
858 		if (key >= DLGK_MOUSE(MOUSE_T)) {
859 		    state = sTEXT;
860 		    continue;
861 		} else if (key >= DLGK_MOUSE(MOUSE_F)) {
862 		    if (f_list.win != 0) {
863 			state = sFILES;
864 			f_list.choice = (key - DLGK_MOUSE(MOUSE_F)) + f_list.offset;
865 			display_list(&f_list);
866 		    }
867 		    continue;
868 		} else if (key >= DLGK_MOUSE(MOUSE_D)) {
869 		    if (d_list.win != 0) {
870 			state = sDIRS;
871 			d_list.choice = (key - DLGK_MOUSE(MOUSE_D)) + d_list.offset;
872 			display_list(&d_list);
873 		    }
874 		    continue;
875 		} else if (is_DLGK_MOUSE(key)
876 			   && (code = dlg_ok_buttoncode(key - M_EVENT)) >= 0) {
877 		    result = code;
878 		    continue;
879 		}
880 		break;
881 	    }
882 	}
883 
884 	if (state < 0) {	/* Input box selected if we're editing */
885 	    int edit = dlg_edit_string(input, &offset, key, fkey, first);
886 
887 	    if (edit) {
888 		dlg_show_string(w_text, input, offset, inputbox_attr,
889 				0, 0, tbox_width, 0, first);
890 		first = FALSE;
891 		state = sTEXT;
892 	    }
893 	} else if (state >= 0 &&
894 		   (code = dlg_char_to_button(key, buttons)) >= 0) {
895 	    result = dlg_ok_buttoncode(code);
896 	    break;
897 	}
898     }
899 
900     dlg_unregister_window(w_text);
901     dlg_del_window(dialog);
902     dlg_mouse_free_regions();
903     free_list(&d_list, FALSE);
904     free_list(&f_list, FALSE);
905 
906   finish:
907     if (partial != 0)
908 	free(partial);
909     return result;
910 }
911 
912 /*
913  * Display a dialog box for entering a filename
914  */
915 int
916 dialog_fselect(const char *title, const char *path, int height, int width)
917 {
918     return dlg_fselect(title, path, height, width, FALSE);
919 }
920 
921 /*
922  * Display a dialog box for entering a directory
923  */
924 int
925 dialog_dselect(const char *title, const char *path, int height, int width)
926 {
927     return dlg_fselect(title, path, height, width, TRUE);
928 }
929