menu_sys.def revision 1.24 1 1.23 hubertf /* $NetBSD: menu_sys.def,v 1.24 2000/08/15 02:09:11 phil Exp $ */
2 1.1 phil
3 1.1 phil /*
4 1.1 phil * Copyright 1997 Piermont Information Systems Inc.
5 1.1 phil * All rights reserved.
6 1.1 phil *
7 1.1 phil * Written by Philip A. Nelson for Piermont Information Systems Inc.
8 1.1 phil *
9 1.1 phil * Redistribution and use in source and binary forms, with or without
10 1.1 phil * modification, are permitted provided that the following conditions
11 1.1 phil * are met:
12 1.1 phil * 1. Redistributions of source code must retain the above copyright
13 1.1 phil * notice, this list of conditions and the following disclaimer.
14 1.1 phil * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 phil * notice, this list of conditions and the following disclaimer in the
16 1.1 phil * documentation and/or other materials provided with the distribution.
17 1.1 phil * 3. All advertising materials mentioning features or use of this software
18 1.1 phil * must display the following acknowledgement:
19 1.1 phil * This product includes software develooped for the NetBSD Project by
20 1.1 phil * Piermont Information Systems Inc.
21 1.1 phil * 4. The name of Piermont Information Systems Inc. may not be used to endorse
22 1.1 phil * or promote products derived from this software without specific prior
23 1.1 phil * written permission.
24 1.1 phil *
25 1.1 phil * THIS SOFTWARE IS PROVIDED BY PIERMONT INFORMATION SYSTEMS INC. ``AS IS''
26 1.1 phil * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 1.1 phil * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 1.1 phil * ARE DISCLAIMED. IN NO EVENT SHALL PIERMONT INFORMATION SYSTEMS INC. BE
29 1.1 phil * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
30 1.1 phil * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31 1.1 phil * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
32 1.1 phil * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
33 1.1 phil * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 1.1 phil * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
35 1.1 phil * THE POSSIBILITY OF SUCH DAMAGE.
36 1.1 phil *
37 1.1 phil */
38 1.1 phil
39 1.1 phil /* menu_sys.defs -- Menu system standard routines. */
40 1.1 phil
41 1.1 phil #include <string.h>
42 1.1 phil #include <ctype.h>
43 1.1 phil
44 1.3 phil #define REQ_EXECUTE 1000
45 1.3 phil #define REQ_NEXT_ITEM 1001
46 1.3 phil #define REQ_PREV_ITEM 1002
47 1.3 phil #define REQ_REDISPLAY 1003
48 1.9 phil #define REQ_SCROLLDOWN 1004
49 1.9 phil #define REQ_SCROLLUP 1005
50 1.9 phil #define REQ_HELP 1006
51 1.9 phil
52 1.9 phil /* Multiple key support */
53 1.9 phil #define KEYSEQ_FIRST 256
54 1.9 phil #define KEYSEQ_DOWN_ARROW 256
55 1.9 phil #define KEYSEQ_UP_ARROW 257
56 1.9 phil #define KEYSEQ_LEFT_ARROW 258
57 1.9 phil #define KEYSEQ_RIGHT_ARROW 259
58 1.9 phil #define KEYSEQ_PAGE_DOWN 260
59 1.9 phil #define KEYSEQ_PAGE_UP 261
60 1.9 phil
61 1.9 phil struct keyseq {
62 1.9 phil char *termcap_name;
63 1.9 phil char *chars;
64 1.9 phil int numchars;
65 1.9 phil int keyseq_val;
66 1.9 phil struct keyseq *next;
67 1.9 phil };
68 1.9 phil
69 1.10 phil /* keypad and other definitions */
70 1.9 phil struct keyseq _mc_key_seq[] = {
71 1.10 phil /* Cludge for xterm ... */
72 1.10 phil { NULL, "\033[B", 0, KEYSEQ_DOWN_ARROW, NULL },
73 1.10 phil { NULL, "\033[D", 0, KEYSEQ_LEFT_ARROW, NULL },
74 1.10 phil { NULL, "\033[C", 0, KEYSEQ_RIGHT_ARROW, NULL },
75 1.10 phil { NULL, "\033[A", 0, KEYSEQ_UP_ARROW, NULL },
76 1.10 phil /* Termcap defined */
77 1.9 phil { "kd", NULL, 0, KEYSEQ_DOWN_ARROW, NULL },
78 1.9 phil { "kl", NULL, 0, KEYSEQ_LEFT_ARROW, NULL },
79 1.9 phil { "kr", NULL, 0, KEYSEQ_RIGHT_ARROW, NULL },
80 1.9 phil { "ku", NULL, 0, KEYSEQ_UP_ARROW, NULL },
81 1.9 phil { "kf", NULL, 0, KEYSEQ_PAGE_DOWN, NULL }, /* scroll forward */
82 1.9 phil { "kN", NULL, 0, KEYSEQ_PAGE_DOWN, NULL }, /* next page */
83 1.9 phil { "kP", NULL, 0, KEYSEQ_PAGE_UP, NULL }, /* scroll backward */
84 1.9 phil { "kR", NULL, 0, KEYSEQ_PAGE_UP, NULL }, /* prev page */
85 1.9 phil /* other definitions */
86 1.9 phil { NULL, "\033v", 0, KEYSEQ_PAGE_UP, NULL }, /* ESC-v */
87 1.9 phil { NULL, "\026", 0, KEYSEQ_PAGE_DOWN, NULL }, /* CTL-v */
88 1.9 phil };
89 1.9 phil
90 1.9 phil int _mc_num_key_seq = sizeof(_mc_key_seq) / sizeof(struct keyseq);
91 1.9 phil struct keyseq *pad_list = NULL;
92 1.9 phil static char str_area [512];
93 1.9 phil static char *str_ptr = str_area;
94 1.1 phil
95 1.9 phil /* Macros */
96 1.1 phil #define MAX(x,y) ((x)>(y)?(x):(y))
97 1.7 phil #define MIN(x,y) ((x)<(y)?(x):(y))
98 1.1 phil
99 1.1 phil /* Initialization state. */
100 1.1 phil static int __menu_init = 0;
101 1.1 phil int __m_endwin = 0;
102 1.17 cgd static int max_lines = 0, max_cols = 0;
103 1.7 phil static char *scrolltext = " <: page up, >: page down";
104 1.1 phil
105 1.14 phil static menudesc *menus = menu_def;
106 1.14 phil
107 1.14 phil #ifdef DYNAMIC_MENUS
108 1.14 phil static int num_menus = 0;
109 1.14 phil static int num_avail = 0;
110 1.14 phil #define DYN_INIT_NUM 32
111 1.14 phil #endif
112 1.14 phil
113 1.1 phil /* prototypes for in here! */
114 1.9 phil static void ins_keyseq (struct keyseq **seq, struct keyseq *ins);
115 1.9 phil static void init_keyseq (void);
116 1.1 phil static void init_menu (struct menudesc *m);
117 1.14 phil static char opt_ch (int op_no);
118 1.1 phil static void post_menu (struct menudesc *m);
119 1.5 phil static void process_help (struct menudesc *m, int num);
120 1.4 phil static void process_req (struct menudesc *m, int num, int req);
121 1.1 phil static void mbeep (void);
122 1.1 phil static int menucmd (WINDOW *w);
123 1.1 phil
124 1.1 phil #ifndef NULL
125 1.1 phil #define NULL (void *)0
126 1.1 phil #endif
127 1.1 phil
128 1.1 phil /* menu system processing routines */
129 1.1 phil
130 1.23 hubertf static void
131 1.23 hubertf mbeep (void)
132 1.1 phil {
133 1.1 phil fprintf (stderr,"\a");
134 1.1 phil }
135 1.1 phil
136 1.23 hubertf static void
137 1.23 hubertf ins_keyseq (struct keyseq **seq, struct keyseq *ins)
138 1.9 phil {
139 1.9 phil if (*seq == NULL) {
140 1.9 phil ins->next = NULL;
141 1.9 phil *seq = ins;
142 1.9 phil } else if (ins->numchars <= (*seq)->numchars) {
143 1.9 phil ins->next = *seq;
144 1.9 phil *seq = ins;
145 1.9 phil } else
146 1.9 phil ins_keyseq (&(*seq)->next, ins);
147 1.9 phil }
148 1.9 phil
149 1.23 hubertf static void
150 1.23 hubertf init_keyseq (void)
151 1.9 phil {
152 1.22 thorpej /*
153 1.22 thorpej * XXX XXX XXX THIS SHOULD BE NUKED FROM ORBIT! DO THIS
154 1.22 thorpej * XXX XXX XXX WITH NORMAL CURSES FACILITIES!
155 1.22 thorpej */
156 1.22 thorpej extern struct tinfo *_cursesi_genbuf;
157 1.22 thorpej
158 1.9 phil int i;
159 1.22 thorpej
160 1.9 phil for (i=0; i<_mc_num_key_seq; i++) {
161 1.9 phil if (_mc_key_seq[i].termcap_name)
162 1.9 phil _mc_key_seq[i].chars =
163 1.22 thorpej t_getstr (_cursesi_genbuf,
164 1.22 thorpej _mc_key_seq[i].termcap_name,
165 1.22 thorpej &str_ptr, NULL);
166 1.9 phil if (_mc_key_seq[i].chars != NULL &&
167 1.9 phil (_mc_key_seq[i].numchars = strlen(_mc_key_seq[i].chars))
168 1.9 phil > 0)
169 1.9 phil ins_keyseq (&pad_list,&_mc_key_seq[i]);
170 1.9 phil }
171 1.9 phil }
172 1.9 phil
173 1.23 hubertf static int
174 1.23 hubertf mgetch(WINDOW *w)
175 1.1 phil {
176 1.1 phil static char buf[20];
177 1.1 phil static int num = 0;
178 1.9 phil struct keyseq *list = pad_list;
179 1.1 phil int i, ret;
180 1.1 phil
181 1.9 phil /* key pad processing */
182 1.9 phil while (list) {
183 1.9 phil for (i=0; i< list->numchars; i++) {
184 1.9 phil if (i >= num)
185 1.9 phil buf[num++] = wgetch(w);
186 1.9 phil if (buf[i] != list->chars[i])
187 1.9 phil break;
188 1.9 phil }
189 1.9 phil if (i == list->numchars) {
190 1.9 phil num = 0;
191 1.9 phil return list->keyseq_val;
192 1.9 phil }
193 1.9 phil list = list->next;
194 1.9 phil }
195 1.1 phil
196 1.1 phil ret = buf[0];
197 1.1 phil for (i = 0; i < strlen(buf); i++)
198 1.1 phil buf[i] = buf[i+1];
199 1.1 phil num--;
200 1.1 phil return ret;
201 1.1 phil }
202 1.1 phil
203 1.23 hubertf static int
204 1.23 hubertf menucmd (WINDOW *w)
205 1.1 phil {
206 1.1 phil int ch;
207 1.1 phil
208 1.1 phil while (TRUE) {
209 1.1 phil ch = mgetch(w);
210 1.1 phil
211 1.1 phil switch (ch) {
212 1.1 phil case '\n':
213 1.1 phil return REQ_EXECUTE;
214 1.11 phil case '\016': /* Contnrol-P */
215 1.9 phil case KEYSEQ_DOWN_ARROW:
216 1.1 phil return REQ_NEXT_ITEM;
217 1.11 phil case '\020': /* Control-N */
218 1.9 phil case KEYSEQ_UP_ARROW:
219 1.1 phil return REQ_PREV_ITEM;
220 1.11 phil case '\014': /* Control-L */
221 1.3 phil return REQ_REDISPLAY;
222 1.9 phil case '<':
223 1.11 phil case '\010': /* Control-H (backspace) */
224 1.9 phil case KEYSEQ_PAGE_UP:
225 1.9 phil return REQ_SCROLLUP;
226 1.9 phil case '>':
227 1.11 phil case ' ':
228 1.9 phil case KEYSEQ_PAGE_DOWN:
229 1.9 phil return REQ_SCROLLDOWN;
230 1.9 phil case '?':
231 1.9 phil return REQ_HELP;
232 1.1 phil }
233 1.1 phil
234 1.9 phil if (isalpha(ch))
235 1.1 phil return (ch);
236 1.1 phil
237 1.1 phil mbeep();
238 1.1 phil wrefresh(w);
239 1.1 phil }
240 1.1 phil }
241 1.1 phil
242 1.23 hubertf static void
243 1.23 hubertf init_menu (struct menudesc *m)
244 1.1 phil {
245 1.18 cgd int wmax;
246 1.18 cgd int hadd, wadd, exithadd;
247 1.14 phil int i;
248 1.1 phil
249 1.18 cgd hadd = ((m->mopt & MC_NOBOX) ? 0 : 2);
250 1.18 cgd wadd = ((m->mopt & MC_NOBOX) ? 2 : 4);
251 1.18 cgd
252 1.18 cgd hadd += strlen(m->title) != 0 ? 2 : 0;
253 1.18 cgd exithadd = ((m->mopt & MC_NOEXITOPT) ? 0 : 1);
254 1.18 cgd
255 1.18 cgd wmax = strlen(m->title);
256 1.1 phil
257 1.7 phil /* Calculate h? h == number of visible options. */
258 1.1 phil if (m->h == 0) {
259 1.18 cgd m->h = m->numopts + exithadd;
260 1.18 cgd if (m->h + m->y + hadd >= max_lines && (m->mopt & MC_SCROLL))
261 1.18 cgd m->h = max_lines - m->y - hadd ;
262 1.1 phil }
263 1.7 phil
264 1.7 phil /* Check window heights and set scrolling */
265 1.18 cgd if (m->h < m->numopts + exithadd) {
266 1.14 phil if (!(m->mopt & MC_SCROLL) || m->h < 3) {
267 1.7 phil endwin();
268 1.7 phil (void) fprintf (stderr,
269 1.17 cgd "Window too short for menu \"%s\"\n",
270 1.9 phil m->title);
271 1.7 phil exit(1);
272 1.7 phil }
273 1.7 phil } else
274 1.14 phil m->mopt &= ~MC_SCROLL;
275 1.1 phil
276 1.9 phil /* check for screen fit */
277 1.18 cgd if (m->y + m->h + hadd > max_lines) {
278 1.9 phil endwin();
279 1.9 phil (void) fprintf (stderr,
280 1.17 cgd "Screen too short for menu \"%s\"\n", m->title);
281 1.9 phil exit(1);
282 1.9 phil
283 1.9 phil }
284 1.9 phil
285 1.1 phil /* Calculate w? */
286 1.1 phil if (m->w == 0) {
287 1.14 phil if (m->mopt & MC_SCROLL)
288 1.18 cgd wmax = MAX(wmax,strlen(scrolltext));
289 1.14 phil for (i=0; i < m->numopts; i++ )
290 1.18 cgd wmax = MAX(wmax,strlen(m->opts[i].opt_name)+3);
291 1.18 cgd m->w = wmax;
292 1.1 phil }
293 1.1 phil
294 1.17 cgd /* check and adjust for screen fit */
295 1.18 cgd if (m->w + wadd > max_cols) {
296 1.17 cgd endwin();
297 1.17 cgd (void) fprintf (stderr,
298 1.17 cgd "Screen too narrow for menu \"%s\"\n", m->title);
299 1.17 cgd exit(1);
300 1.17 cgd
301 1.17 cgd }
302 1.20 cgd if (m->x == -1)
303 1.20 cgd m->x = (max_cols - (m->w + wadd)) / 2; /* center */
304 1.20 cgd else if (m->x + m->w + wadd > max_cols)
305 1.18 cgd m->x = max_cols - (m->w + wadd);
306 1.17 cgd
307 1.1 phil /* Get the windows. */
308 1.18 cgd m->mw = newwin(m->h+hadd, m->w+wadd, m->y, m->x);
309 1.1 phil
310 1.1 phil if (m->mw == NULL) {
311 1.1 phil endwin();
312 1.1 phil (void) fprintf (stderr,
313 1.18 cgd "Could not create window for menu \"%s\"\n", m->title);
314 1.1 phil exit(1);
315 1.1 phil }
316 1.1 phil }
317 1.1 phil
318 1.23 hubertf static char
319 1.23 hubertf opt_ch (int op_no)
320 1.14 phil {
321 1.14 phil char c;
322 1.14 phil if (op_no < 25) {
323 1.14 phil c = 'a' + op_no;
324 1.14 phil if (c >= 'x') c++;
325 1.14 phil } else
326 1.14 phil c = 'A' + op_no - 25;
327 1.14 phil return (char) c;
328 1.14 phil }
329 1.14 phil
330 1.23 hubertf static void
331 1.23 hubertf post_menu (struct menudesc *m)
332 1.1 phil {
333 1.1 phil int i;
334 1.7 phil int hasbox, cury, maxy, selrow, lastopt;
335 1.1 phil int tadd;
336 1.14 phil char optstr[5];
337 1.1 phil
338 1.14 phil if (m->mopt & MC_NOBOX) {
339 1.1 phil cury = 0;
340 1.7 phil maxy = m->h;
341 1.1 phil hasbox = 0;
342 1.1 phil } else {
343 1.1 phil cury = 1;
344 1.7 phil maxy = m->h+1;
345 1.1 phil hasbox = 1;
346 1.1 phil }
347 1.1 phil
348 1.9 phil /* Clear the window */
349 1.9 phil wclear (m->mw);
350 1.9 phil
351 1.1 phil tadd = strlen(m->title) ? 2 : 0;
352 1.1 phil
353 1.1 phil if (tadd) {
354 1.18 cgd mvwaddstr(m->mw, cury, cury, " ");
355 1.18 cgd mvwaddstr(m->mw, cury, cury + 1, m->title);
356 1.1 phil cury += 2;
357 1.7 phil maxy += 2;
358 1.1 phil }
359 1.1 phil
360 1.7 phil /* Set defaults, calculate lastopt. */
361 1.7 phil selrow = -1;
362 1.14 phil if (m->mopt & MC_SCROLL) {
363 1.7 phil lastopt = MIN(m->numopts, m->topline+m->h-1);
364 1.7 phil maxy -= 1;
365 1.7 phil } else
366 1.7 phil lastopt = m->numopts;
367 1.7 phil
368 1.7 phil for (i=m->topline; i<lastopt; i++, cury++) {
369 1.1 phil if (m->cursel == i) {
370 1.1 phil mvwaddstr (m->mw, cury, hasbox, ">");
371 1.1 phil wstandout(m->mw);
372 1.7 phil selrow = cury;
373 1.1 phil } else
374 1.1 phil mvwaddstr (m->mw, cury, hasbox, " ");
375 1.24 phil if (!(m->mopt & MC_NOSHORTCUT)) {
376 1.23 hubertf (void) sprintf (optstr, "%c: ", opt_ch(i));
377 1.24 phil waddstr (m->mw, optstr);
378 1.23 hubertf }
379 1.14 phil waddstr (m->mw, m->opts[i].opt_name);
380 1.1 phil if (m->cursel == i)
381 1.1 phil wstandend(m->mw);
382 1.1 phil }
383 1.7 phil
384 1.7 phil /* Add the exit option. */
385 1.14 phil if (!(m->mopt & MC_NOEXITOPT) && cury < maxy) {
386 1.7 phil if (m->cursel >= m->numopts) {
387 1.7 phil mvwaddstr (m->mw, cury, hasbox, ">");
388 1.7 phil wstandout(m->mw);
389 1.7 phil selrow = cury;
390 1.7 phil } else
391 1.7 phil mvwaddstr (m->mw, cury, hasbox, " ");
392 1.24 phil if (!(m->mopt & MC_NOSHORTCUT))
393 1.23 hubertf waddstr (m->mw, "x: ");
394 1.19 cgd waddstr (m->mw, m->exitstr);
395 1.7 phil if (m->cursel >= m->numopts)
396 1.7 phil wstandend(m->mw);
397 1.7 phil cury++;
398 1.7 phil }
399 1.7 phil
400 1.7 phil /* Add the scroll line */
401 1.14 phil if (m->mopt & MC_SCROLL) {
402 1.7 phil mvwaddstr (m->mw, cury, hasbox, scrolltext);
403 1.7 phil if (selrow < 0)
404 1.7 phil selrow = cury;
405 1.7 phil }
406 1.7 phil
407 1.7 phil /* Add the box. */
408 1.14 phil if (!(m->mopt & MC_NOBOX))
409 1.1 phil box(m->mw, '*', '*');
410 1.1 phil
411 1.7 phil wmove(m->mw, selrow, hasbox);
412 1.1 phil }
413 1.1 phil
414 1.23 hubertf static void
415 1.23 hubertf process_help (struct menudesc *m, int num)
416 1.5 phil {
417 1.5 phil char *help = m->helpstr;
418 1.7 phil int lineoff = 0;
419 1.5 phil int curoff = 0;
420 1.5 phil int again;
421 1.7 phil int winin;
422 1.5 phil
423 1.6 phil /* Is there help? */
424 1.6 phil if (!help) {
425 1.6 phil mbeep();
426 1.6 phil return;
427 1.6 phil }
428 1.6 phil
429 1.6 phil /* Display the help information. */
430 1.7 phil do {
431 1.5 phil if (lineoff < curoff) {
432 1.5 phil help = m->helpstr;
433 1.5 phil curoff = 0;
434 1.5 phil }
435 1.5 phil while (*help && curoff < lineoff) {
436 1.5 phil if (*help == '\n')
437 1.5 phil curoff++;
438 1.5 phil help++;
439 1.5 phil }
440 1.5 phil
441 1.5 phil wclear(stdscr);
442 1.5 phil mvwaddstr (stdscr, 0, 0,
443 1.9 phil "Help: exit: x, page up: u <, page down: d >");
444 1.5 phil mvwaddstr (stdscr, 2, 0, help);
445 1.5 phil wmove (stdscr, 1, 0);
446 1.5 phil wrefresh(stdscr);
447 1.5 phil
448 1.5 phil do {
449 1.5 phil winin = mgetch(stdscr);
450 1.9 phil if (winin < KEYSEQ_FIRST)
451 1.9 phil winin = tolower(winin);
452 1.5 phil again = 0;
453 1.5 phil switch (winin) {
454 1.5 phil case '<':
455 1.5 phil case 'u':
456 1.9 phil case KEYSEQ_UP_ARROW:
457 1.9 phil case KEYSEQ_LEFT_ARROW:
458 1.9 phil case KEYSEQ_PAGE_UP:
459 1.5 phil if (lineoff)
460 1.5 phil lineoff -= max_lines - 2;
461 1.7 phil else
462 1.7 phil again = 1;
463 1.5 phil break;
464 1.5 phil case '>':
465 1.5 phil case 'd':
466 1.9 phil case KEYSEQ_DOWN_ARROW:
467 1.9 phil case KEYSEQ_RIGHT_ARROW:
468 1.9 phil case KEYSEQ_PAGE_DOWN:
469 1.5 phil if (*help)
470 1.5 phil lineoff += max_lines - 2;
471 1.7 phil else
472 1.7 phil again = 1;
473 1.5 phil break;
474 1.10 phil case 'q':
475 1.10 phil break;
476 1.9 phil case 'x':
477 1.10 phil winin = 'q';
478 1.5 phil break;
479 1.5 phil default:
480 1.5 phil again = 1;
481 1.5 phil }
482 1.9 phil if (again)
483 1.9 phil mbeep();
484 1.5 phil } while (again);
485 1.5 phil } while (winin != 'q');
486 1.5 phil
487 1.5 phil /* Restore current menu */
488 1.5 phil wclear(stdscr);
489 1.5 phil wrefresh(stdscr);
490 1.14 phil if (m->post_act)
491 1.14 phil (*m->post_act)();
492 1.5 phil }
493 1.5 phil
494 1.23 hubertf static void
495 1.23 hubertf process_req (struct menudesc *m, int num, int req)
496 1.1 phil {
497 1.1 phil int ch;
498 1.14 phil int hasexit = (m->mopt & MC_NOEXITOPT ? 0 : 1 );
499 1.7 phil int refresh = 0;
500 1.9 phil int scroll_sel = 0;
501 1.1 phil
502 1.1 phil if (req == REQ_EXECUTE)
503 1.1 phil return;
504 1.7 phil
505 1.1 phil else if (req == REQ_NEXT_ITEM) {
506 1.7 phil if (m->cursel < m->numopts + hasexit - 1) {
507 1.1 phil m->cursel++;
508 1.9 phil scroll_sel = 1;
509 1.7 phil refresh = 1;
510 1.14 phil if (m->mopt & MC_SCROLL &&
511 1.12 phil m->cursel >= m->topline + m->h -1 )
512 1.11 phil m->topline += 1;
513 1.7 phil } else
514 1.1 phil mbeep();
515 1.7 phil
516 1.1 phil } else if (req == REQ_PREV_ITEM) {
517 1.7 phil if (m->cursel > 0) {
518 1.1 phil m->cursel--;
519 1.9 phil scroll_sel = 1;
520 1.7 phil refresh = 1;
521 1.11 phil if (m->cursel < m->topline )
522 1.11 phil m->topline -= 1;
523 1.7 phil } else
524 1.1 phil mbeep();
525 1.3 phil
526 1.3 phil } else if (req == REQ_REDISPLAY) {
527 1.3 phil wclear(stdscr);
528 1.3 phil wrefresh(stdscr);
529 1.14 phil if (m->post_act)
530 1.14 phil (*m->post_act)();
531 1.7 phil refresh = 1;
532 1.3 phil
533 1.9 phil } else if (req == REQ_HELP) {
534 1.5 phil process_help (m, num);
535 1.7 phil refresh = 1;
536 1.7 phil
537 1.9 phil } else if (req == REQ_SCROLLUP) {
538 1.14 phil if (!(m->mopt & MC_SCROLL))
539 1.9 phil mbeep();
540 1.9 phil else if (m->topline == 0)
541 1.7 phil mbeep();
542 1.7 phil else {
543 1.14 phil m->topline = MAX(0,m->topline-m->h+1);
544 1.23 hubertf m->cursel = MAX(0, m->cursel-m->h+1);
545 1.7 phil wclear (m->mw);
546 1.7 phil refresh = 1;
547 1.7 phil }
548 1.7 phil
549 1.9 phil } else if (req == REQ_SCROLLDOWN) {
550 1.14 phil if (!(m->mopt & MC_SCROLL))
551 1.9 phil mbeep();
552 1.13 phil else if (m->topline + m->h - 1 >= m->numopts + hasexit)
553 1.7 phil mbeep();
554 1.7 phil else {
555 1.13 phil m->topline = MIN(m->topline+m->h-1,
556 1.13 phil m->numopts+hasexit-m->h+1);
557 1.23 hubertf m->cursel = MIN(m->numopts-1, m->cursel+m->h-1);
558 1.7 phil wclear (m->mw);
559 1.7 phil refresh = 1;
560 1.7 phil }
561 1.7 phil
562 1.1 phil } else {
563 1.9 phil ch = req;
564 1.7 phil if (ch == 'x' && hasexit) {
565 1.1 phil m->cursel = m->numopts;
566 1.9 phil scroll_sel = 1;
567 1.7 phil refresh = 1;
568 1.24 phil } else
569 1.24 phil if (!(m->mopt & MC_NOSHORTCUT)) {
570 1.23 hubertf if (ch > 'z')
571 1.23 hubertf ch = 255;
572 1.23 hubertf if (ch >= 'a') {
573 1.23 hubertf if (ch > 'x') ch--;
574 1.24 phil ch = ch - 'a';
575 1.23 hubertf } else
576 1.23 hubertf ch = 25 + ch - 'A';
577 1.23 hubertf if (ch < 0 || ch >= m->numopts)
578 1.23 hubertf mbeep();
579 1.23 hubertf else {
580 1.23 hubertf m->cursel = ch;
581 1.23 hubertf scroll_sel = 1;
582 1.23 hubertf refresh = 1;
583 1.23 hubertf }
584 1.24 phil } else
585 1.24 phil mbeep();
586 1.1 phil }
587 1.9 phil
588 1.14 phil if (m->mopt & MC_SCROLL && scroll_sel) {
589 1.9 phil while (m->cursel >= m->topline + m->h -1 )
590 1.13 phil m->topline = MIN(m->topline+m->h-1,
591 1.13 phil m->numopts+hasexit-m->h+1);
592 1.9 phil while (m->cursel < m->topline)
593 1.13 phil m->topline = MAX(0,m->topline-m->h+1);
594 1.9 phil }
595 1.9 phil
596 1.7 phil if (refresh) {
597 1.7 phil post_menu (m);
598 1.7 phil wrefresh (m->mw);
599 1.1 phil }
600 1.1 phil }
601 1.1 phil
602 1.23 hubertf int
603 1.23 hubertf menu_init (void)
604 1.17 cgd {
605 1.17 cgd
606 1.17 cgd if (__menu_init)
607 1.17 cgd return 0;
608 1.17 cgd
609 1.17 cgd if (initscr() == NULL)
610 1.17 cgd return 1;
611 1.17 cgd
612 1.17 cgd cbreak();
613 1.17 cgd noecho();
614 1.17 cgd max_lines = getmaxy(stdscr);
615 1.17 cgd max_cols = getmaxx(stdscr);
616 1.17 cgd init_keyseq();
617 1.17 cgd #ifdef DYNAMIC_MENUS
618 1.17 cgd num_menus = DYN_INIT_NUM;
619 1.17 cgd while (num_menus < DYN_MENU_START)
620 1.17 cgd num_menus *= 2;
621 1.17 cgd menus = (menudesc *) malloc(sizeof(menudesc)*num_menus);
622 1.17 cgd if (menus == NULL)
623 1.17 cgd return 2;
624 1.17 cgd (void) memset ((void *)menus, 0, sizeof(menudesc)*num_menus);
625 1.17 cgd (void) memcpy ((void *)menus, (void *)menu_def,
626 1.17 cgd sizeof(menudesc)*DYN_MENU_START);
627 1.17 cgd num_avail = num_menus - DYN_MENU_START;
628 1.17 cgd #endif
629 1.17 cgd
630 1.17 cgd __menu_init = 1;
631 1.17 cgd return (0);
632 1.17 cgd }
633 1.17 cgd
634 1.23 hubertf void
635 1.23 hubertf process_menu (int num)
636 1.1 phil {
637 1.1 phil int sel = 0;
638 1.1 phil int req, done;
639 1.1 phil int last_num;
640 1.1 phil
641 1.14 phil struct menudesc *m;
642 1.14 phil
643 1.14 phil m = &menus[num];
644 1.1 phil
645 1.1 phil done = FALSE;
646 1.1 phil
647 1.1 phil /* Initialize? */
648 1.17 cgd if (menu_init()) {
649 1.17 cgd __menu_initerror();
650 1.17 cgd return;
651 1.1 phil }
652 1.17 cgd
653 1.1 phil if (__m_endwin) {
654 1.7 phil wclear(stdscr);
655 1.1 phil wrefresh(stdscr);
656 1.1 phil __m_endwin = 0;
657 1.1 phil }
658 1.1 phil if (m->mw == NULL)
659 1.1 phil init_menu (m);
660 1.1 phil
661 1.7 phil /* Always preselect option 0 and display from 0! */
662 1.1 phil m->cursel = 0;
663 1.7 phil m->topline = 0;
664 1.1 phil
665 1.1 phil while (!done) {
666 1.1 phil last_num = num;
667 1.1 phil if (__m_endwin) {
668 1.1 phil wclear(stdscr);
669 1.1 phil wrefresh(stdscr);
670 1.1 phil __m_endwin = 0;
671 1.1 phil }
672 1.1 phil /* Process the display action */
673 1.14 phil if (m->post_act)
674 1.14 phil (*m->post_act)();
675 1.1 phil post_menu (m);
676 1.1 phil wrefresh (m->mw);
677 1.1 phil
678 1.1 phil while ((req = menucmd (m->mw)) != REQ_EXECUTE)
679 1.4 phil process_req (m, num, req);
680 1.1 phil
681 1.1 phil sel = m->cursel;
682 1.1 phil wclear (m->mw);
683 1.1 phil wrefresh (m->mw);
684 1.1 phil
685 1.1 phil /* Process the items */
686 1.14 phil if (sel < m->numopts) {
687 1.14 phil if (m->opts[sel].opt_flags & OPT_ENDWIN) {
688 1.14 phil endwin();
689 1.14 phil __m_endwin = 1;
690 1.14 phil }
691 1.14 phil if (m->opts[sel].opt_action)
692 1.23 hubertf done = (*m->opts[sel].opt_action)(m);
693 1.14 phil if (m->opts[sel].opt_menu != -1) {
694 1.14 phil if (m->opts[sel].opt_flags & OPT_SUB)
695 1.14 phil process_menu (m->opts[sel].opt_menu);
696 1.14 phil else
697 1.14 phil num = m->opts[sel].opt_menu;
698 1.14 phil }
699 1.15 phil
700 1.15 phil if (m->opts[sel].opt_flags & OPT_EXIT)
701 1.15 phil done = TRUE;
702 1.15 phil
703 1.14 phil } else
704 1.1 phil done = TRUE;
705 1.1 phil
706 1.1 phil /* Reselect m just in case */
707 1.1 phil if (num != last_num) {
708 1.1 phil m = &menus[num];
709 1.14 phil
710 1.1 phil /* Initialize? */
711 1.1 phil if (m->mw == NULL)
712 1.1 phil init_menu (m);
713 1.14 phil if (m->post_act)
714 1.14 phil (*m->post_act)();
715 1.1 phil }
716 1.1 phil }
717 1.1 phil
718 1.1 phil /* Process the exit action */
719 1.14 phil if (m->exit_act)
720 1.14 phil (*m->exit_act)();
721 1.1 phil }
722 1.13 phil
723 1.13 phil /* Control L is end of standard routines, remaining only for dynamic. */
725 1.13 phil
726 1.13 phil /* Beginning of routines for dynamic menus. */
727 1.14 phil
728 1.14 phil /* local prototypes */
729 1.14 phil static int double_menus (void);
730 1.24 phil
731 1.23 hubertf static int
732 1.14 phil double_menus (void)
733 1.14 phil {
734 1.14 phil menudesc *temp;
735 1.14 phil
736 1.14 phil temp = (menudesc *) malloc(sizeof(menudesc)*num_menus*2);
737 1.14 phil if (temp == NULL)
738 1.14 phil return 0;
739 1.14 phil (void) memset ((void *)temp, 0,
740 1.14 phil sizeof(menudesc)*num_menus*2);
741 1.14 phil (void) memcpy ((void *)temp, (void *)menus,
742 1.14 phil sizeof(menudesc)*num_menus);
743 1.14 phil free (menus);
744 1.14 phil menus = temp;
745 1.14 phil num_avail = num_menus;
746 1.14 phil num_menus *= 2;
747 1.14 phil
748 1.14 phil return 1;
749 1.14 phil }
750 1.23 hubertf
751 1.23 hubertf int
752 1.24 phil new_menu (char * title, menu_ent * opts, int numopts,
753 1.24 phil int x, int y, int h, int w, int mopt,
754 1.14 phil void (*post_act)(void), void (*exit_act), char * help)
755 1.14 phil {
756 1.7 phil int ix;
757 1.14 phil
758 1.14 phil /* Check for free menu entry. */
759 1.14 phil if (num_avail == 0)
760 1.14 phil if (!double_menus ())
761 1.14 phil return -1;
762 1.14 phil
763 1.14 phil /* Find free menu entry. */
764 1.14 phil for (ix = DYN_MENU_START; ix < num_menus && menus[ix].mopt & MC_VALID;
765 1.14 phil ix++) /* do nothing */;
766 1.14 phil
767 1.14 phil /* if ix == num_menus ... panic */
768 1.14 phil
769 1.24 phil /* Set Entries */
770 1.14 phil menus[ix].title = title ? title : "";
771 1.14 phil menus[ix].opts = opts;
772 1.14 phil menus[ix].numopts = numopts;
773 1.14 phil menus[ix].x = x;
774 1.14 phil menus[ix].y = y;
775 1.14 phil menus[ix].h = h;
776 1.14 phil menus[ix].w = w;
777 1.14 phil menus[ix].mopt = mopt | MC_VALID;
778 1.14 phil menus[ix].post_act = post_act;
779 1.14 phil menus[ix].exit_act = exit_act;
780 1.21 cgd menus[ix].helpstr = help;
781 1.14 phil menus[ix].exitstr = "Exit";
782 1.14 phil
783 1.14 phil init_menu (&menus[ix]);
784 1.14 phil
785 1.14 phil return ix;
786 1.14 phil }
787 1.23 hubertf
788 1.23 hubertf void
789 1.14 phil free_menu (int menu_no)
790 1.14 phil {
791 1.14 phil if (menu_no < num_menus) {
792 1.14 phil menus[menu_no].mopt &= ~MC_VALID;
793 1.14 phil if (menus[menu_no].mw != NULL)
794 1.14 phil delwin (menus[menu_no].mw);
795 1.14 phil }
796 }
797