menu_sys.def revision 1.22 1 1.22 thorpej /* $NetBSD: menu_sys.def,v 1.22 2000/04/22 21:34:25 thorpej 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.1 phil static void mbeep (void)
131 1.1 phil {
132 1.1 phil fprintf (stderr,"\a");
133 1.1 phil }
134 1.1 phil
135 1.9 phil static void ins_keyseq (struct keyseq **seq, struct keyseq *ins)
136 1.9 phil {
137 1.9 phil if (*seq == NULL) {
138 1.9 phil ins->next = NULL;
139 1.9 phil *seq = ins;
140 1.9 phil } else if (ins->numchars <= (*seq)->numchars) {
141 1.9 phil ins->next = *seq;
142 1.9 phil *seq = ins;
143 1.9 phil } else
144 1.9 phil ins_keyseq (&(*seq)->next, ins);
145 1.9 phil }
146 1.9 phil
147 1.9 phil static void init_keyseq (void)
148 1.9 phil {
149 1.22 thorpej /*
150 1.22 thorpej * XXX XXX XXX THIS SHOULD BE NUKED FROM ORBIT! DO THIS
151 1.22 thorpej * XXX XXX XXX WITH NORMAL CURSES FACILITIES!
152 1.22 thorpej */
153 1.22 thorpej extern struct tinfo *_cursesi_genbuf;
154 1.22 thorpej
155 1.9 phil int i;
156 1.22 thorpej
157 1.9 phil for (i=0; i<_mc_num_key_seq; i++) {
158 1.9 phil if (_mc_key_seq[i].termcap_name)
159 1.9 phil _mc_key_seq[i].chars =
160 1.22 thorpej t_getstr (_cursesi_genbuf,
161 1.22 thorpej _mc_key_seq[i].termcap_name,
162 1.22 thorpej &str_ptr, NULL);
163 1.9 phil if (_mc_key_seq[i].chars != NULL &&
164 1.9 phil (_mc_key_seq[i].numchars = strlen(_mc_key_seq[i].chars))
165 1.9 phil > 0)
166 1.9 phil ins_keyseq (&pad_list,&_mc_key_seq[i]);
167 1.9 phil }
168 1.9 phil }
169 1.9 phil
170 1.1 phil static int mgetch(WINDOW *w)
171 1.1 phil {
172 1.1 phil static char buf[20];
173 1.1 phil static int num = 0;
174 1.9 phil struct keyseq *list = pad_list;
175 1.1 phil int i, ret;
176 1.1 phil
177 1.9 phil /* key pad processing */
178 1.9 phil while (list) {
179 1.9 phil for (i=0; i< list->numchars; i++) {
180 1.9 phil if (i >= num)
181 1.9 phil buf[num++] = wgetch(w);
182 1.9 phil if (buf[i] != list->chars[i])
183 1.9 phil break;
184 1.9 phil }
185 1.9 phil if (i == list->numchars) {
186 1.9 phil num = 0;
187 1.9 phil return list->keyseq_val;
188 1.9 phil }
189 1.9 phil list = list->next;
190 1.9 phil }
191 1.1 phil
192 1.1 phil ret = buf[0];
193 1.1 phil for (i = 0; i < strlen(buf); i++)
194 1.1 phil buf[i] = buf[i+1];
195 1.1 phil num--;
196 1.1 phil return ret;
197 1.1 phil }
198 1.1 phil
199 1.1 phil static int menucmd (WINDOW *w)
200 1.1 phil {
201 1.1 phil int ch;
202 1.1 phil
203 1.1 phil while (TRUE) {
204 1.1 phil ch = mgetch(w);
205 1.1 phil
206 1.1 phil switch (ch) {
207 1.1 phil case '\n':
208 1.1 phil return REQ_EXECUTE;
209 1.11 phil case '\016': /* Contnrol-P */
210 1.9 phil case KEYSEQ_DOWN_ARROW:
211 1.1 phil return REQ_NEXT_ITEM;
212 1.11 phil case '\020': /* Control-N */
213 1.9 phil case KEYSEQ_UP_ARROW:
214 1.1 phil return REQ_PREV_ITEM;
215 1.11 phil case '\014': /* Control-L */
216 1.3 phil return REQ_REDISPLAY;
217 1.9 phil case '<':
218 1.11 phil case '\010': /* Control-H (backspace) */
219 1.9 phil case KEYSEQ_PAGE_UP:
220 1.9 phil return REQ_SCROLLUP;
221 1.9 phil case '>':
222 1.11 phil case ' ':
223 1.9 phil case KEYSEQ_PAGE_DOWN:
224 1.9 phil return REQ_SCROLLDOWN;
225 1.9 phil case '?':
226 1.9 phil return REQ_HELP;
227 1.1 phil }
228 1.1 phil
229 1.9 phil if (isalpha(ch))
230 1.1 phil return (ch);
231 1.1 phil
232 1.1 phil mbeep();
233 1.1 phil wrefresh(w);
234 1.1 phil }
235 1.1 phil }
236 1.1 phil
237 1.1 phil static void init_menu (struct menudesc *m)
238 1.1 phil {
239 1.18 cgd int wmax;
240 1.18 cgd int hadd, wadd, exithadd;
241 1.14 phil int i;
242 1.1 phil
243 1.18 cgd hadd = ((m->mopt & MC_NOBOX) ? 0 : 2);
244 1.18 cgd wadd = ((m->mopt & MC_NOBOX) ? 2 : 4);
245 1.18 cgd
246 1.18 cgd hadd += strlen(m->title) != 0 ? 2 : 0;
247 1.18 cgd exithadd = ((m->mopt & MC_NOEXITOPT) ? 0 : 1);
248 1.18 cgd
249 1.18 cgd wmax = strlen(m->title);
250 1.1 phil
251 1.7 phil /* Calculate h? h == number of visible options. */
252 1.1 phil if (m->h == 0) {
253 1.18 cgd m->h = m->numopts + exithadd;
254 1.18 cgd if (m->h + m->y + hadd >= max_lines && (m->mopt & MC_SCROLL))
255 1.18 cgd m->h = max_lines - m->y - hadd ;
256 1.1 phil }
257 1.7 phil
258 1.7 phil /* Check window heights and set scrolling */
259 1.18 cgd if (m->h < m->numopts + exithadd) {
260 1.14 phil if (!(m->mopt & MC_SCROLL) || m->h < 3) {
261 1.7 phil endwin();
262 1.7 phil (void) fprintf (stderr,
263 1.17 cgd "Window too short for menu \"%s\"\n",
264 1.9 phil m->title);
265 1.7 phil exit(1);
266 1.7 phil }
267 1.7 phil } else
268 1.14 phil m->mopt &= ~MC_SCROLL;
269 1.1 phil
270 1.9 phil /* check for screen fit */
271 1.18 cgd if (m->y + m->h + hadd > max_lines) {
272 1.9 phil endwin();
273 1.9 phil (void) fprintf (stderr,
274 1.17 cgd "Screen too short for menu \"%s\"\n", m->title);
275 1.9 phil exit(1);
276 1.9 phil
277 1.9 phil }
278 1.9 phil
279 1.1 phil /* Calculate w? */
280 1.1 phil if (m->w == 0) {
281 1.14 phil if (m->mopt & MC_SCROLL)
282 1.18 cgd wmax = MAX(wmax,strlen(scrolltext));
283 1.14 phil for (i=0; i < m->numopts; i++ )
284 1.18 cgd wmax = MAX(wmax,strlen(m->opts[i].opt_name)+3);
285 1.18 cgd m->w = wmax;
286 1.1 phil }
287 1.1 phil
288 1.17 cgd /* check and adjust for screen fit */
289 1.18 cgd if (m->w + wadd > max_cols) {
290 1.17 cgd endwin();
291 1.17 cgd (void) fprintf (stderr,
292 1.17 cgd "Screen too narrow for menu \"%s\"\n", m->title);
293 1.17 cgd exit(1);
294 1.17 cgd
295 1.17 cgd }
296 1.20 cgd if (m->x == -1)
297 1.20 cgd m->x = (max_cols - (m->w + wadd)) / 2; /* center */
298 1.20 cgd else if (m->x + m->w + wadd > max_cols)
299 1.18 cgd m->x = max_cols - (m->w + wadd);
300 1.17 cgd
301 1.1 phil /* Get the windows. */
302 1.18 cgd m->mw = newwin(m->h+hadd, m->w+wadd, m->y, m->x);
303 1.1 phil
304 1.1 phil if (m->mw == NULL) {
305 1.1 phil endwin();
306 1.1 phil (void) fprintf (stderr,
307 1.18 cgd "Could not create window for menu \"%s\"\n", m->title);
308 1.1 phil exit(1);
309 1.1 phil }
310 1.1 phil }
311 1.1 phil
312 1.14 phil static char opt_ch (int op_no)
313 1.14 phil {
314 1.14 phil char c;
315 1.14 phil if (op_no < 25) {
316 1.14 phil c = 'a' + op_no;
317 1.14 phil if (c >= 'x') c++;
318 1.14 phil } else
319 1.14 phil c = 'A' + op_no - 25;
320 1.14 phil return (char) c;
321 1.14 phil }
322 1.14 phil
323 1.1 phil static void post_menu (struct menudesc *m)
324 1.1 phil {
325 1.1 phil int i;
326 1.7 phil int hasbox, cury, maxy, selrow, lastopt;
327 1.1 phil int tadd;
328 1.14 phil char optstr[5];
329 1.1 phil
330 1.14 phil if (m->mopt & MC_NOBOX) {
331 1.1 phil cury = 0;
332 1.7 phil maxy = m->h;
333 1.1 phil hasbox = 0;
334 1.1 phil } else {
335 1.1 phil cury = 1;
336 1.7 phil maxy = m->h+1;
337 1.1 phil hasbox = 1;
338 1.1 phil }
339 1.1 phil
340 1.9 phil /* Clear the window */
341 1.9 phil wclear (m->mw);
342 1.9 phil
343 1.1 phil tadd = strlen(m->title) ? 2 : 0;
344 1.1 phil
345 1.1 phil if (tadd) {
346 1.18 cgd mvwaddstr(m->mw, cury, cury, " ");
347 1.18 cgd mvwaddstr(m->mw, cury, cury + 1, m->title);
348 1.1 phil cury += 2;
349 1.7 phil maxy += 2;
350 1.1 phil }
351 1.1 phil
352 1.7 phil /* Set defaults, calculate lastopt. */
353 1.7 phil selrow = -1;
354 1.14 phil if (m->mopt & MC_SCROLL) {
355 1.7 phil lastopt = MIN(m->numopts, m->topline+m->h-1);
356 1.7 phil maxy -= 1;
357 1.7 phil } else
358 1.7 phil lastopt = m->numopts;
359 1.7 phil
360 1.7 phil for (i=m->topline; i<lastopt; i++, cury++) {
361 1.1 phil if (m->cursel == i) {
362 1.1 phil mvwaddstr (m->mw, cury, hasbox, ">");
363 1.1 phil wstandout(m->mw);
364 1.7 phil selrow = cury;
365 1.1 phil } else
366 1.1 phil mvwaddstr (m->mw, cury, hasbox, " ");
367 1.14 phil (void) sprintf (optstr, "%c: ", opt_ch(i));
368 1.14 phil waddstr (m->mw, optstr);
369 1.14 phil waddstr (m->mw, m->opts[i].opt_name);
370 1.1 phil if (m->cursel == i)
371 1.1 phil wstandend(m->mw);
372 1.1 phil }
373 1.7 phil
374 1.7 phil /* Add the exit option. */
375 1.14 phil if (!(m->mopt & MC_NOEXITOPT) && cury < maxy) {
376 1.7 phil if (m->cursel >= m->numopts) {
377 1.7 phil mvwaddstr (m->mw, cury, hasbox, ">");
378 1.7 phil wstandout(m->mw);
379 1.7 phil selrow = cury;
380 1.7 phil } else
381 1.7 phil mvwaddstr (m->mw, cury, hasbox, " ");
382 1.19 cgd waddstr (m->mw, "x: ");
383 1.19 cgd waddstr (m->mw, m->exitstr);
384 1.7 phil if (m->cursel >= m->numopts)
385 1.7 phil wstandend(m->mw);
386 1.7 phil cury++;
387 1.7 phil }
388 1.7 phil
389 1.7 phil /* Add the scroll line */
390 1.14 phil if (m->mopt & MC_SCROLL) {
391 1.7 phil mvwaddstr (m->mw, cury, hasbox, scrolltext);
392 1.7 phil if (selrow < 0)
393 1.7 phil selrow = cury;
394 1.7 phil }
395 1.7 phil
396 1.7 phil /* Add the box. */
397 1.14 phil if (!(m->mopt & MC_NOBOX))
398 1.1 phil box(m->mw, '*', '*');
399 1.1 phil
400 1.7 phil wmove(m->mw, selrow, hasbox);
401 1.1 phil }
402 1.1 phil
403 1.5 phil static void process_help (struct menudesc *m, int num)
404 1.5 phil {
405 1.5 phil char *help = m->helpstr;
406 1.7 phil int lineoff = 0;
407 1.5 phil int curoff = 0;
408 1.5 phil int again;
409 1.7 phil int winin;
410 1.5 phil
411 1.6 phil /* Is there help? */
412 1.6 phil if (!help) {
413 1.6 phil mbeep();
414 1.6 phil return;
415 1.6 phil }
416 1.6 phil
417 1.6 phil /* Display the help information. */
418 1.7 phil do {
419 1.5 phil if (lineoff < curoff) {
420 1.5 phil help = m->helpstr;
421 1.5 phil curoff = 0;
422 1.5 phil }
423 1.5 phil while (*help && curoff < lineoff) {
424 1.5 phil if (*help == '\n')
425 1.5 phil curoff++;
426 1.5 phil help++;
427 1.5 phil }
428 1.5 phil
429 1.5 phil wclear(stdscr);
430 1.5 phil mvwaddstr (stdscr, 0, 0,
431 1.9 phil "Help: exit: x, page up: u <, page down: d >");
432 1.5 phil mvwaddstr (stdscr, 2, 0, help);
433 1.5 phil wmove (stdscr, 1, 0);
434 1.5 phil wrefresh(stdscr);
435 1.5 phil
436 1.5 phil do {
437 1.5 phil winin = mgetch(stdscr);
438 1.9 phil if (winin < KEYSEQ_FIRST)
439 1.9 phil winin = tolower(winin);
440 1.5 phil again = 0;
441 1.5 phil switch (winin) {
442 1.5 phil case '<':
443 1.5 phil case 'u':
444 1.9 phil case KEYSEQ_UP_ARROW:
445 1.9 phil case KEYSEQ_LEFT_ARROW:
446 1.9 phil case KEYSEQ_PAGE_UP:
447 1.5 phil if (lineoff)
448 1.5 phil lineoff -= max_lines - 2;
449 1.7 phil else
450 1.7 phil again = 1;
451 1.5 phil break;
452 1.5 phil case '>':
453 1.5 phil case 'd':
454 1.9 phil case KEYSEQ_DOWN_ARROW:
455 1.9 phil case KEYSEQ_RIGHT_ARROW:
456 1.9 phil case KEYSEQ_PAGE_DOWN:
457 1.5 phil if (*help)
458 1.5 phil lineoff += max_lines - 2;
459 1.7 phil else
460 1.7 phil again = 1;
461 1.5 phil break;
462 1.10 phil case 'q':
463 1.10 phil break;
464 1.9 phil case 'x':
465 1.10 phil winin = 'q';
466 1.5 phil break;
467 1.5 phil default:
468 1.5 phil again = 1;
469 1.5 phil }
470 1.9 phil if (again)
471 1.9 phil mbeep();
472 1.5 phil } while (again);
473 1.5 phil } while (winin != 'q');
474 1.5 phil
475 1.5 phil /* Restore current menu */
476 1.5 phil wclear(stdscr);
477 1.5 phil wrefresh(stdscr);
478 1.14 phil if (m->post_act)
479 1.14 phil (*m->post_act)();
480 1.5 phil }
481 1.5 phil
482 1.4 phil static void process_req (struct menudesc *m, int num, int req)
483 1.1 phil {
484 1.1 phil int ch;
485 1.14 phil int hasexit = (m->mopt & MC_NOEXITOPT ? 0 : 1 );
486 1.7 phil int refresh = 0;
487 1.9 phil int scroll_sel = 0;
488 1.1 phil
489 1.1 phil if (req == REQ_EXECUTE)
490 1.1 phil return;
491 1.7 phil
492 1.1 phil else if (req == REQ_NEXT_ITEM) {
493 1.7 phil if (m->cursel < m->numopts + hasexit - 1) {
494 1.1 phil m->cursel++;
495 1.9 phil scroll_sel = 1;
496 1.7 phil refresh = 1;
497 1.14 phil if (m->mopt & MC_SCROLL &&
498 1.12 phil m->cursel >= m->topline + m->h -1 )
499 1.11 phil m->topline += 1;
500 1.7 phil } else
501 1.1 phil mbeep();
502 1.7 phil
503 1.1 phil } else if (req == REQ_PREV_ITEM) {
504 1.7 phil if (m->cursel > 0) {
505 1.1 phil m->cursel--;
506 1.9 phil scroll_sel = 1;
507 1.7 phil refresh = 1;
508 1.11 phil if (m->cursel < m->topline )
509 1.11 phil m->topline -= 1;
510 1.7 phil } else
511 1.1 phil mbeep();
512 1.3 phil
513 1.3 phil } else if (req == REQ_REDISPLAY) {
514 1.3 phil wclear(stdscr);
515 1.3 phil wrefresh(stdscr);
516 1.14 phil if (m->post_act)
517 1.14 phil (*m->post_act)();
518 1.7 phil refresh = 1;
519 1.3 phil
520 1.9 phil } else if (req == REQ_HELP) {
521 1.5 phil process_help (m, num);
522 1.7 phil refresh = 1;
523 1.7 phil
524 1.9 phil } else if (req == REQ_SCROLLUP) {
525 1.14 phil if (!(m->mopt & MC_SCROLL))
526 1.9 phil mbeep();
527 1.9 phil else if (m->topline == 0)
528 1.7 phil mbeep();
529 1.7 phil else {
530 1.14 phil m->topline = MAX(0,m->topline-m->h+1);
531 1.7 phil wclear (m->mw);
532 1.7 phil refresh = 1;
533 1.7 phil }
534 1.7 phil
535 1.9 phil } else if (req == REQ_SCROLLDOWN) {
536 1.14 phil if (!(m->mopt & MC_SCROLL))
537 1.9 phil mbeep();
538 1.13 phil else if (m->topline + m->h - 1 >= m->numopts + hasexit)
539 1.7 phil mbeep();
540 1.7 phil else {
541 1.13 phil m->topline = MIN(m->topline+m->h-1,
542 1.13 phil m->numopts+hasexit-m->h+1);
543 1.7 phil wclear (m->mw);
544 1.7 phil refresh = 1;
545 1.7 phil }
546 1.7 phil
547 1.1 phil } else {
548 1.9 phil ch = req;
549 1.7 phil if (ch == 'x' && hasexit) {
550 1.1 phil m->cursel = m->numopts;
551 1.9 phil scroll_sel = 1;
552 1.7 phil refresh = 1;
553 1.7 phil } else {
554 1.8 phil if (ch > 'z')
555 1.8 phil ch = 255;
556 1.8 phil if (ch >= 'a') {
557 1.8 phil if (ch > 'x') ch--;
558 1.8 phil ch = ch - 'a';
559 1.8 phil } else
560 1.8 phil ch = 25 + ch - 'A';
561 1.1 phil if (ch < 0 || ch >= m->numopts)
562 1.1 phil mbeep();
563 1.7 phil else {
564 1.1 phil m->cursel = ch;
565 1.9 phil scroll_sel = 1;
566 1.7 phil refresh = 1;
567 1.7 phil }
568 1.1 phil }
569 1.1 phil }
570 1.9 phil
571 1.14 phil if (m->mopt & MC_SCROLL && scroll_sel) {
572 1.9 phil while (m->cursel >= m->topline + m->h -1 )
573 1.13 phil m->topline = MIN(m->topline+m->h-1,
574 1.13 phil m->numopts+hasexit-m->h+1);
575 1.9 phil while (m->cursel < m->topline)
576 1.13 phil m->topline = MAX(0,m->topline-m->h+1);
577 1.9 phil }
578 1.9 phil
579 1.7 phil if (refresh) {
580 1.7 phil post_menu (m);
581 1.7 phil wrefresh (m->mw);
582 1.1 phil }
583 1.1 phil }
584 1.1 phil
585 1.17 cgd int menu_init (void)
586 1.17 cgd {
587 1.17 cgd
588 1.17 cgd if (__menu_init)
589 1.17 cgd return 0;
590 1.17 cgd
591 1.17 cgd if (initscr() == NULL)
592 1.17 cgd return 1;
593 1.17 cgd
594 1.17 cgd cbreak();
595 1.17 cgd noecho();
596 1.17 cgd max_lines = getmaxy(stdscr);
597 1.17 cgd max_cols = getmaxx(stdscr);
598 1.17 cgd init_keyseq();
599 1.17 cgd #ifdef DYNAMIC_MENUS
600 1.17 cgd num_menus = DYN_INIT_NUM;
601 1.17 cgd while (num_menus < DYN_MENU_START)
602 1.17 cgd num_menus *= 2;
603 1.17 cgd menus = (menudesc *) malloc(sizeof(menudesc)*num_menus);
604 1.17 cgd if (menus == NULL)
605 1.17 cgd return 2;
606 1.17 cgd (void) memset ((void *)menus, 0, sizeof(menudesc)*num_menus);
607 1.17 cgd (void) memcpy ((void *)menus, (void *)menu_def,
608 1.17 cgd sizeof(menudesc)*DYN_MENU_START);
609 1.17 cgd num_avail = num_menus - DYN_MENU_START;
610 1.17 cgd #endif
611 1.17 cgd
612 1.17 cgd __menu_init = 1;
613 1.17 cgd return (0);
614 1.17 cgd }
615 1.17 cgd
616 1.1 phil void process_menu (int num)
617 1.1 phil {
618 1.1 phil int sel = 0;
619 1.1 phil int req, done;
620 1.1 phil int last_num;
621 1.1 phil
622 1.14 phil struct menudesc *m;
623 1.14 phil
624 1.14 phil m = &menus[num];
625 1.1 phil
626 1.1 phil done = FALSE;
627 1.1 phil
628 1.1 phil /* Initialize? */
629 1.17 cgd if (menu_init()) {
630 1.17 cgd __menu_initerror();
631 1.17 cgd return;
632 1.1 phil }
633 1.17 cgd
634 1.1 phil if (__m_endwin) {
635 1.7 phil wclear(stdscr);
636 1.1 phil wrefresh(stdscr);
637 1.1 phil __m_endwin = 0;
638 1.1 phil }
639 1.1 phil if (m->mw == NULL)
640 1.1 phil init_menu (m);
641 1.1 phil
642 1.7 phil /* Always preselect option 0 and display from 0! */
643 1.1 phil m->cursel = 0;
644 1.7 phil m->topline = 0;
645 1.1 phil
646 1.1 phil while (!done) {
647 1.1 phil last_num = num;
648 1.1 phil if (__m_endwin) {
649 1.1 phil wclear(stdscr);
650 1.1 phil wrefresh(stdscr);
651 1.1 phil __m_endwin = 0;
652 1.1 phil }
653 1.1 phil /* Process the display action */
654 1.14 phil if (m->post_act)
655 1.14 phil (*m->post_act)();
656 1.1 phil post_menu (m);
657 1.1 phil wrefresh (m->mw);
658 1.1 phil
659 1.1 phil while ((req = menucmd (m->mw)) != REQ_EXECUTE)
660 1.4 phil process_req (m, num, req);
661 1.1 phil
662 1.1 phil sel = m->cursel;
663 1.1 phil wclear (m->mw);
664 1.1 phil wrefresh (m->mw);
665 1.1 phil
666 1.1 phil /* Process the items */
667 1.14 phil if (sel < m->numopts) {
668 1.14 phil if (m->opts[sel].opt_flags & OPT_ENDWIN) {
669 1.14 phil endwin();
670 1.14 phil __m_endwin = 1;
671 1.14 phil }
672 1.14 phil if (m->opts[sel].opt_action)
673 1.15 phil done = (*m->opts[sel].opt_action)();
674 1.14 phil if (m->opts[sel].opt_menu != -1) {
675 1.14 phil if (m->opts[sel].opt_flags & OPT_SUB)
676 1.14 phil process_menu (m->opts[sel].opt_menu);
677 1.14 phil else
678 1.14 phil num = m->opts[sel].opt_menu;
679 1.14 phil }
680 1.15 phil
681 1.15 phil if (m->opts[sel].opt_flags & OPT_EXIT)
682 1.15 phil done = TRUE;
683 1.15 phil
684 1.14 phil } else
685 1.1 phil done = TRUE;
686 1.1 phil
687 1.1 phil /* Reselect m just in case */
688 1.1 phil if (num != last_num) {
689 1.1 phil m = &menus[num];
690 1.14 phil
691 1.1 phil /* Initialize? */
692 1.1 phil if (m->mw == NULL)
693 1.1 phil init_menu (m);
694 1.14 phil if (m->post_act)
695 1.14 phil (*m->post_act)();
696 1.1 phil }
697 1.1 phil }
698 1.1 phil
699 1.1 phil /* Process the exit action */
700 1.14 phil if (m->exit_act)
701 1.14 phil (*m->exit_act)();
702 1.1 phil }
703 1.13 phil
704 1.13 phil /* Control L is end of standard routines, remaining only for dynamic. */
706 1.13 phil
707 1.13 phil /* Beginning of routines for dynamic menus. */
708 1.14 phil
709 1.14 phil /* local prototypes */
710 1.14 phil static int double_menus (void);
711 1.14 phil
712 1.14 phil static int double_menus (void)
713 1.14 phil {
714 1.14 phil menudesc *temp;
715 1.14 phil
716 1.14 phil temp = (menudesc *) malloc(sizeof(menudesc)*num_menus*2);
717 1.14 phil if (temp == NULL)
718 1.14 phil return 0;
719 1.14 phil (void) memset ((void *)temp, 0,
720 1.14 phil sizeof(menudesc)*num_menus*2);
721 1.14 phil (void) memcpy ((void *)temp, (void *)menus,
722 1.14 phil sizeof(menudesc)*num_menus);
723 1.14 phil free (menus);
724 1.14 phil menus = temp;
725 1.14 phil num_avail = num_menus;
726 1.14 phil num_menus *= 2;
727 1.14 phil
728 1.14 phil return 1;
729 1.14 phil }
730 1.14 phil
731 1.14 phil int new_menu (char * title, menu_ent * opts, int numopts,
732 1.14 phil int x, int y, int h, int w, int mopt,
733 1.14 phil void (*post_act)(void), void (*exit_act), char * help)
734 1.14 phil {
735 1.7 phil int ix;
736 1.14 phil
737 1.14 phil /* Check for free menu entry. */
738 1.14 phil if (num_avail == 0)
739 1.14 phil if (!double_menus ())
740 1.14 phil return -1;
741 1.14 phil
742 1.14 phil /* Find free menu entry. */
743 1.14 phil for (ix = DYN_MENU_START; ix < num_menus && menus[ix].mopt & MC_VALID;
744 1.14 phil ix++) /* do nothing */;
745 1.14 phil
746 1.14 phil /* if ix == num_menus ... panic */
747 1.14 phil
748 1.14 phil /* Set Entries */
749 1.14 phil menus[ix].title = title;
750 1.14 phil menus[ix].opts = opts;
751 1.14 phil menus[ix].numopts = numopts;
752 1.14 phil menus[ix].x = x;
753 1.14 phil menus[ix].y = y;
754 1.14 phil menus[ix].h = h;
755 1.14 phil menus[ix].w = w;
756 1.14 phil menus[ix].mopt = mopt | MC_VALID;
757 1.14 phil menus[ix].post_act = post_act;
758 1.14 phil menus[ix].exit_act = exit_act;
759 1.21 cgd menus[ix].helpstr = help;
760 1.14 phil menus[ix].exitstr = "Exit";
761 1.14 phil
762 1.14 phil init_menu (&menus[ix]);
763 1.14 phil
764 1.14 phil return ix;
765 1.14 phil }
766 1.14 phil
767 1.14 phil void free_menu (int menu_no)
768 1.14 phil {
769 1.14 phil if (menu_no < num_menus) {
770 1.14 phil menus[menu_no].mopt &= ~MC_VALID;
771 1.14 phil if (menus[menu_no].mw != NULL)
772 1.14 phil delwin (menus[menu_no].mw);
773 1.14 phil }
774 }
775