menu_sys.def revision 1.9 1 1.9 phil /* $NetBSD: menu_sys.def,v 1.9 1998/06/29 08:46:37 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.9 phil struct keyseq _mc_key_seq[] = {
70 1.9 phil /* keypad definitions */
71 1.9 phil { "kd", NULL, 0, KEYSEQ_DOWN_ARROW, NULL },
72 1.9 phil { "kl", NULL, 0, KEYSEQ_LEFT_ARROW, NULL },
73 1.9 phil { "kr", NULL, 0, KEYSEQ_RIGHT_ARROW, NULL },
74 1.9 phil { "ku", NULL, 0, KEYSEQ_UP_ARROW, NULL },
75 1.9 phil { "kf", NULL, 0, KEYSEQ_PAGE_DOWN, NULL }, /* scroll forward */
76 1.9 phil { "kN", NULL, 0, KEYSEQ_PAGE_DOWN, NULL }, /* next page */
77 1.9 phil { "kP", NULL, 0, KEYSEQ_PAGE_UP, NULL }, /* scroll backward */
78 1.9 phil { "kR", NULL, 0, KEYSEQ_PAGE_UP, NULL }, /* prev page */
79 1.9 phil /* other definitions */
80 1.9 phil { NULL, "\033v", 0, KEYSEQ_PAGE_UP, NULL }, /* ESC-v */
81 1.9 phil { NULL, "\026", 0, KEYSEQ_PAGE_DOWN, NULL }, /* CTL-v */
82 1.9 phil };
83 1.9 phil
84 1.9 phil int _mc_num_key_seq = sizeof(_mc_key_seq) / sizeof(struct keyseq);
85 1.9 phil struct keyseq *pad_list = NULL;
86 1.9 phil static char str_area [512];
87 1.9 phil static char *str_ptr = str_area;
88 1.1 phil
89 1.9 phil /* Macros */
90 1.1 phil #define MAX(x,y) ((x)>(y)?(x):(y))
91 1.7 phil #define MIN(x,y) ((x)<(y)?(x):(y))
92 1.1 phil
93 1.1 phil /* Initialization state. */
94 1.1 phil static int __menu_init = 0;
95 1.1 phil int __m_endwin = 0;
96 1.5 phil static int max_lines = 0;
97 1.7 phil static char *scrolltext = " <: page up, >: page down";
98 1.1 phil
99 1.1 phil /* prototypes for in here! */
100 1.9 phil static void ins_keyseq (struct keyseq **seq, struct keyseq *ins);
101 1.9 phil static void init_keyseq (void);
102 1.1 phil static void init_menu (struct menudesc *m);
103 1.1 phil static void post_menu (struct menudesc *m);
104 1.5 phil static void process_help (struct menudesc *m, int num);
105 1.4 phil static void process_req (struct menudesc *m, int num, int req);
106 1.1 phil static void mbeep (void);
107 1.1 phil static int menucmd (WINDOW *w);
108 1.1 phil
109 1.1 phil #ifndef NULL
110 1.1 phil #define NULL (void *)0
111 1.1 phil #endif
112 1.1 phil
113 1.1 phil /* menu system processing routines */
114 1.1 phil
115 1.1 phil static void mbeep (void)
116 1.1 phil {
117 1.1 phil fprintf (stderr,"\a");
118 1.1 phil }
119 1.1 phil
120 1.9 phil static void ins_keyseq (struct keyseq **seq, struct keyseq *ins)
121 1.9 phil {
122 1.9 phil if (*seq == NULL) {
123 1.9 phil ins->next = NULL;
124 1.9 phil *seq = ins;
125 1.9 phil } else if (ins->numchars <= (*seq)->numchars) {
126 1.9 phil ins->next = *seq;
127 1.9 phil *seq = ins;
128 1.9 phil } else
129 1.9 phil ins_keyseq (&(*seq)->next, ins);
130 1.9 phil }
131 1.9 phil
132 1.9 phil static void init_keyseq (void)
133 1.9 phil {
134 1.9 phil int i;
135 1.9 phil for (i=0; i<_mc_num_key_seq; i++) {
136 1.9 phil if (_mc_key_seq[i].termcap_name)
137 1.9 phil _mc_key_seq[i].chars =
138 1.9 phil tgetstr (_mc_key_seq[i].termcap_name,
139 1.9 phil &str_ptr);
140 1.9 phil if (_mc_key_seq[i].chars != NULL &&
141 1.9 phil (_mc_key_seq[i].numchars = strlen(_mc_key_seq[i].chars))
142 1.9 phil > 0)
143 1.9 phil ins_keyseq (&pad_list,&_mc_key_seq[i]);
144 1.9 phil }
145 1.9 phil }
146 1.9 phil
147 1.1 phil static int mgetch(WINDOW *w)
148 1.1 phil {
149 1.1 phil static char buf[20];
150 1.1 phil static int num = 0;
151 1.9 phil struct keyseq *list = pad_list;
152 1.1 phil int i, ret;
153 1.1 phil
154 1.9 phil /* key pad processing */
155 1.9 phil while (list) {
156 1.9 phil for (i=0; i< list->numchars; i++) {
157 1.9 phil if (i >= num)
158 1.9 phil buf[num++] = wgetch(w);
159 1.9 phil if (buf[i] != list->chars[i])
160 1.9 phil break;
161 1.9 phil }
162 1.9 phil if (i == list->numchars) {
163 1.9 phil num = 0;
164 1.9 phil return list->keyseq_val;
165 1.9 phil }
166 1.9 phil list = list->next;
167 1.9 phil }
168 1.1 phil
169 1.1 phil ret = buf[0];
170 1.1 phil for (i = 0; i < strlen(buf); i++)
171 1.1 phil buf[i] = buf[i+1];
172 1.1 phil num--;
173 1.1 phil return ret;
174 1.1 phil }
175 1.1 phil
176 1.1 phil static int menucmd (WINDOW *w)
177 1.1 phil {
178 1.1 phil int ch;
179 1.1 phil
180 1.1 phil while (TRUE) {
181 1.1 phil ch = mgetch(w);
182 1.1 phil
183 1.1 phil switch (ch) {
184 1.1 phil case '\n':
185 1.1 phil return REQ_EXECUTE;
186 1.1 phil case '\016':
187 1.9 phil case KEYSEQ_DOWN_ARROW:
188 1.1 phil return REQ_NEXT_ITEM;
189 1.1 phil case '\020':
190 1.9 phil case KEYSEQ_UP_ARROW:
191 1.1 phil return REQ_PREV_ITEM;
192 1.3 phil case '\014':
193 1.3 phil return REQ_REDISPLAY;
194 1.9 phil case '<':
195 1.9 phil case KEYSEQ_PAGE_UP:
196 1.9 phil return REQ_SCROLLUP;
197 1.9 phil case '>':
198 1.9 phil case KEYSEQ_PAGE_DOWN:
199 1.9 phil return REQ_SCROLLDOWN;
200 1.9 phil case '?':
201 1.9 phil return REQ_HELP;
202 1.1 phil }
203 1.1 phil
204 1.9 phil if (isalpha(ch))
205 1.1 phil return (ch);
206 1.1 phil
207 1.1 phil mbeep();
208 1.1 phil wrefresh(w);
209 1.1 phil }
210 1.1 phil }
211 1.1 phil
212 1.1 phil static void init_menu (struct menudesc *m)
213 1.1 phil {
214 1.1 phil int max;
215 1.1 phil char **p;
216 1.7 phil int add, exitadd;
217 1.1 phil
218 1.7 phil add = ((m->mopt & NOBOX) ? 2 : 4);
219 1.7 phil exitadd = ((m->mopt & NOEXITOPT) ? 0 : 1);
220 1.1 phil max = strlen(m->title);
221 1.1 phil
222 1.7 phil /* Calculate h? h == number of visible options. */
223 1.1 phil if (m->h == 0) {
224 1.7 phil m->h = m->numopts + exitadd;
225 1.7 phil if (m->h + m->y + add >= max_lines && (m->mopt & SCROLL))
226 1.9 phil m->h = max_lines - m->y - add ;
227 1.1 phil }
228 1.7 phil
229 1.7 phil /* Check window heights and set scrolling */
230 1.7 phil if (m->h < m->numopts + exitadd) {
231 1.9 phil if (!(m->mopt & SCROLL) || m->h < 3) {
232 1.7 phil endwin();
233 1.7 phil (void) fprintf (stderr,
234 1.9 phil "Window too small for menu \"%s\"\n",
235 1.9 phil m->title);
236 1.7 phil exit(1);
237 1.7 phil }
238 1.7 phil } else
239 1.7 phil m->mopt &= ~SCROLL;
240 1.1 phil
241 1.9 phil /* check for screen fit */
242 1.9 phil if (m->y + m->h + add > max_lines) {
243 1.9 phil endwin();
244 1.9 phil (void) fprintf (stderr,
245 1.9 phil "Screen too small for menu \"%s\"\n", m->title);
246 1.9 phil exit(1);
247 1.9 phil
248 1.9 phil }
249 1.9 phil
250 1.1 phil /* Calculate w? */
251 1.1 phil if (m->w == 0) {
252 1.1 phil p = m->opts;
253 1.7 phil if (m->mopt & SCROLL)
254 1.7 phil max = strlen(scrolltext);
255 1.1 phil while (*p) {
256 1.1 phil max = MAX(max,strlen(*p));
257 1.1 phil p++;
258 1.1 phil }
259 1.1 phil m->w = max;
260 1.1 phil }
261 1.1 phil
262 1.1 phil /* Get the windows. */
263 1.1 phil m->mw = newwin(m->h+add, m->w+add, m->y, m->x);
264 1.1 phil
265 1.1 phil if (m->mw == NULL) {
266 1.1 phil endwin();
267 1.1 phil (void) fprintf (stderr,
268 1.1 phil "Could not create window for window with title "
269 1.1 phil " \"%s\"\n", m->title);
270 1.1 phil exit(1);
271 1.1 phil }
272 1.1 phil }
273 1.1 phil
274 1.1 phil static void post_menu (struct menudesc *m)
275 1.1 phil {
276 1.1 phil int i;
277 1.7 phil int hasbox, cury, maxy, selrow, lastopt;
278 1.1 phil int tadd;
279 1.1 phil
280 1.1 phil if (m->mopt & NOBOX) {
281 1.1 phil cury = 0;
282 1.7 phil maxy = m->h;
283 1.1 phil hasbox = 0;
284 1.1 phil } else {
285 1.1 phil cury = 1;
286 1.7 phil maxy = m->h+1;
287 1.1 phil hasbox = 1;
288 1.1 phil }
289 1.1 phil
290 1.9 phil /* Clear the window */
291 1.9 phil wclear (m->mw);
292 1.9 phil
293 1.1 phil tadd = strlen(m->title) ? 2 : 0;
294 1.1 phil
295 1.1 phil if (tadd) {
296 1.1 phil mvwaddstr(m->mw, cury, cury, m->title);
297 1.1 phil cury += 2;
298 1.7 phil maxy += 2;
299 1.1 phil }
300 1.1 phil
301 1.7 phil /* Set defaults, calculate lastopt. */
302 1.7 phil selrow = -1;
303 1.7 phil if (m->mopt & SCROLL) {
304 1.7 phil lastopt = MIN(m->numopts, m->topline+m->h-1);
305 1.7 phil maxy -= 1;
306 1.7 phil } else
307 1.7 phil lastopt = m->numopts;
308 1.7 phil
309 1.7 phil for (i=m->topline; i<lastopt; i++, cury++) {
310 1.1 phil if (m->cursel == i) {
311 1.1 phil mvwaddstr (m->mw, cury, hasbox, ">");
312 1.1 phil wstandout(m->mw);
313 1.7 phil selrow = cury;
314 1.1 phil } else
315 1.1 phil mvwaddstr (m->mw, cury, hasbox, " ");
316 1.1 phil waddstr (m->mw, m->opts[i]);
317 1.1 phil if (m->cursel == i)
318 1.1 phil wstandend(m->mw);
319 1.1 phil }
320 1.7 phil
321 1.7 phil /* Add the exit option. */
322 1.7 phil if (!(m->mopt & NOEXITOPT) && cury < maxy) {
323 1.7 phil if (m->cursel >= m->numopts) {
324 1.7 phil mvwaddstr (m->mw, cury, hasbox, ">");
325 1.7 phil wstandout(m->mw);
326 1.7 phil selrow = cury;
327 1.7 phil } else
328 1.7 phil mvwaddstr (m->mw, cury, hasbox, " ");
329 1.7 phil waddstr (m->mw, "x: Exit");
330 1.7 phil if (m->cursel >= m->numopts)
331 1.7 phil wstandend(m->mw);
332 1.7 phil cury++;
333 1.7 phil }
334 1.7 phil
335 1.7 phil /* Add the scroll line */
336 1.7 phil if (m->mopt & SCROLL) {
337 1.7 phil mvwaddstr (m->mw, cury, hasbox, scrolltext);
338 1.7 phil if (selrow < 0)
339 1.7 phil selrow = cury;
340 1.7 phil }
341 1.7 phil
342 1.7 phil /* Add the box. */
343 1.1 phil if (!(m->mopt & NOBOX))
344 1.1 phil box(m->mw, '*', '*');
345 1.1 phil
346 1.7 phil wmove(m->mw, selrow, hasbox);
347 1.1 phil }
348 1.1 phil
349 1.5 phil static void process_help (struct menudesc *m, int num)
350 1.5 phil {
351 1.5 phil char *help = m->helpstr;
352 1.7 phil int lineoff = 0;
353 1.5 phil int curoff = 0;
354 1.5 phil int again;
355 1.7 phil int winin;
356 1.5 phil
357 1.6 phil /* Is there help? */
358 1.6 phil if (!help) {
359 1.6 phil mbeep();
360 1.6 phil return;
361 1.6 phil }
362 1.6 phil
363 1.6 phil /* Display the help information. */
364 1.7 phil do {
365 1.5 phil if (lineoff < curoff) {
366 1.5 phil help = m->helpstr;
367 1.5 phil curoff = 0;
368 1.5 phil }
369 1.5 phil while (*help && curoff < lineoff) {
370 1.5 phil if (*help == '\n')
371 1.5 phil curoff++;
372 1.5 phil help++;
373 1.5 phil }
374 1.5 phil
375 1.5 phil wclear(stdscr);
376 1.5 phil mvwaddstr (stdscr, 0, 0,
377 1.9 phil "Help: exit: x, page up: u <, page down: d >");
378 1.5 phil mvwaddstr (stdscr, 2, 0, help);
379 1.5 phil wmove (stdscr, 1, 0);
380 1.5 phil wrefresh(stdscr);
381 1.5 phil
382 1.5 phil do {
383 1.5 phil winin = mgetch(stdscr);
384 1.9 phil if (winin < KEYSEQ_FIRST)
385 1.9 phil winin = tolower(winin);
386 1.5 phil again = 0;
387 1.5 phil switch (winin) {
388 1.5 phil case '<':
389 1.5 phil case 'u':
390 1.9 phil case KEYSEQ_UP_ARROW:
391 1.9 phil case KEYSEQ_LEFT_ARROW:
392 1.9 phil case KEYSEQ_PAGE_UP:
393 1.5 phil if (lineoff)
394 1.5 phil lineoff -= max_lines - 2;
395 1.7 phil else
396 1.7 phil again = 1;
397 1.5 phil break;
398 1.5 phil case '>':
399 1.5 phil case 'd':
400 1.9 phil case KEYSEQ_DOWN_ARROW:
401 1.9 phil case KEYSEQ_RIGHT_ARROW:
402 1.9 phil case KEYSEQ_PAGE_DOWN:
403 1.5 phil if (*help)
404 1.5 phil lineoff += max_lines - 2;
405 1.7 phil else
406 1.7 phil again = 1;
407 1.5 phil break;
408 1.9 phil case 'x':
409 1.5 phil case 'q':
410 1.5 phil break;
411 1.5 phil default:
412 1.5 phil again = 1;
413 1.5 phil }
414 1.9 phil if (again)
415 1.9 phil mbeep();
416 1.5 phil } while (again);
417 1.5 phil } while (winin != 'q');
418 1.5 phil
419 1.5 phil /* Restore current menu */
420 1.5 phil wclear(stdscr);
421 1.5 phil wrefresh(stdscr);
422 1.5 phil process_item (&num, -2);
423 1.5 phil }
424 1.5 phil
425 1.4 phil static void process_req (struct menudesc *m, int num, int req)
426 1.1 phil {
427 1.1 phil int ch;
428 1.1 phil int hasexit = (m->mopt & NOEXITOPT ? 0 : 1 );
429 1.7 phil int refresh = 0;
430 1.9 phil int scroll_sel = 0;
431 1.1 phil
432 1.1 phil if (req == REQ_EXECUTE)
433 1.1 phil return;
434 1.7 phil
435 1.1 phil else if (req == REQ_NEXT_ITEM) {
436 1.7 phil if (m->cursel < m->numopts + hasexit - 1) {
437 1.1 phil m->cursel++;
438 1.9 phil scroll_sel = 1;
439 1.7 phil refresh = 1;
440 1.7 phil } else
441 1.1 phil mbeep();
442 1.7 phil
443 1.1 phil } else if (req == REQ_PREV_ITEM) {
444 1.7 phil if (m->cursel > 0) {
445 1.1 phil m->cursel--;
446 1.9 phil scroll_sel = 1;
447 1.7 phil refresh = 1;
448 1.7 phil } else
449 1.1 phil mbeep();
450 1.3 phil
451 1.3 phil } else if (req == REQ_REDISPLAY) {
452 1.3 phil wclear(stdscr);
453 1.3 phil wrefresh(stdscr);
454 1.3 phil process_item (&num, -2);
455 1.7 phil refresh = 1;
456 1.3 phil
457 1.9 phil } else if (req == REQ_HELP) {
458 1.5 phil process_help (m, num);
459 1.7 phil refresh = 1;
460 1.7 phil
461 1.9 phil } else if (req == REQ_SCROLLUP) {
462 1.9 phil if (!(m->mopt & SCROLL))
463 1.9 phil mbeep();
464 1.9 phil else if (m->topline == 0)
465 1.7 phil mbeep();
466 1.7 phil else {
467 1.7 phil m->topline -= m->h-1;
468 1.7 phil wclear (m->mw);
469 1.7 phil refresh = 1;
470 1.7 phil }
471 1.7 phil
472 1.9 phil } else if (req == REQ_SCROLLDOWN) {
473 1.9 phil if (!(m->mopt & SCROLL))
474 1.9 phil mbeep();
475 1.9 phil else if (m->topline + m->h - 1 > m->numopts + hasexit)
476 1.7 phil mbeep();
477 1.7 phil else {
478 1.7 phil m->topline += m->h-1;
479 1.7 phil wclear (m->mw);
480 1.7 phil refresh = 1;
481 1.7 phil }
482 1.7 phil
483 1.1 phil } else {
484 1.9 phil ch = req;
485 1.7 phil if (ch == 'x' && hasexit) {
486 1.1 phil m->cursel = m->numopts;
487 1.9 phil scroll_sel = 1;
488 1.7 phil refresh = 1;
489 1.7 phil } else {
490 1.8 phil if (ch > 'z')
491 1.8 phil ch = 255;
492 1.8 phil if (ch >= 'a') {
493 1.8 phil if (ch > 'x') ch--;
494 1.8 phil ch = ch - 'a';
495 1.8 phil } else
496 1.8 phil ch = 25 + ch - 'A';
497 1.1 phil if (ch < 0 || ch >= m->numopts)
498 1.1 phil mbeep();
499 1.7 phil else {
500 1.1 phil m->cursel = ch;
501 1.9 phil scroll_sel = 1;
502 1.7 phil refresh = 1;
503 1.7 phil }
504 1.1 phil }
505 1.1 phil }
506 1.9 phil
507 1.9 phil if (m->mopt & SCROLL && scroll_sel) {
508 1.9 phil while (m->cursel >= m->topline + m->h -1 )
509 1.9 phil m->topline += m->h -1;
510 1.9 phil while (m->cursel < m->topline)
511 1.9 phil m->topline -= m->h -1;
512 1.9 phil }
513 1.9 phil
514 1.7 phil if (refresh) {
515 1.7 phil post_menu (m);
516 1.7 phil wrefresh (m->mw);
517 1.1 phil }
518 1.1 phil }
519 1.1 phil
520 1.1 phil void process_menu (int num)
521 1.1 phil {
522 1.1 phil int sel = 0;
523 1.1 phil int req, done;
524 1.1 phil int last_num;
525 1.1 phil
526 1.1 phil struct menudesc *m = &menus[num];
527 1.1 phil
528 1.1 phil done = FALSE;
529 1.1 phil
530 1.1 phil /* Initialize? */
531 1.1 phil if (!__menu_init) {
532 1.2 phil if (initscr() == NULL) {
533 1.2 phil __menu_initerror();
534 1.2 phil return;
535 1.2 phil }
536 1.1 phil cbreak();
537 1.1 phil noecho();
538 1.5 phil max_lines = stdscr->maxy;
539 1.9 phil init_keyseq();
540 1.1 phil __menu_init = 1;
541 1.1 phil }
542 1.1 phil if (__m_endwin) {
543 1.7 phil wclear(stdscr);
544 1.1 phil wrefresh(stdscr);
545 1.1 phil __m_endwin = 0;
546 1.1 phil }
547 1.1 phil if (m->mw == NULL)
548 1.1 phil init_menu (m);
549 1.1 phil
550 1.7 phil /* Always preselect option 0 and display from 0! */
551 1.1 phil m->cursel = 0;
552 1.7 phil m->topline = 0;
553 1.1 phil
554 1.1 phil while (!done) {
555 1.1 phil last_num = num;
556 1.1 phil if (__m_endwin) {
557 1.1 phil wclear(stdscr);
558 1.1 phil wrefresh(stdscr);
559 1.1 phil __m_endwin = 0;
560 1.1 phil }
561 1.1 phil /* Process the display action */
562 1.1 phil process_item (&num, -2);
563 1.1 phil post_menu (m);
564 1.1 phil wrefresh (m->mw);
565 1.1 phil
566 1.1 phil while ((req = menucmd (m->mw)) != REQ_EXECUTE)
567 1.4 phil process_req (m, num, req);
568 1.1 phil
569 1.1 phil sel = m->cursel;
570 1.1 phil wclear (m->mw);
571 1.1 phil wrefresh (m->mw);
572 1.1 phil
573 1.1 phil /* Process the items */
574 1.1 phil if (sel < m->numopts)
575 1.1 phil done = process_item (&num, sel);
576 1.1 phil else
577 1.1 phil done = TRUE;
578 1.1 phil
579 1.1 phil /* Reselect m just in case */
580 1.1 phil if (num != last_num) {
581 1.1 phil m = &menus[num];
582 1.1 phil /* Initialize? */
583 1.1 phil if (m->mw == NULL)
584 1.1 phil init_menu (m);
585 1.1 phil process_item (&num, -2);
586 1.1 phil }
587 1.1 phil }
588 1.1 phil
589 1.1 phil /* Process the exit action */
590 1.1 phil process_item (&num, -1);
591 1.1 phil }
592 1.7 phil
593