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