driver.c revision 1.4.2.2
1 1.4.2.2 wrstuden /* $Id: driver.c,v 1.4.2.2 1999/12/27 18:30:03 wrstuden Exp $ */ 2 1.4.2.2 wrstuden 3 1.4.2.2 wrstuden /*- 4 1.4.2.2 wrstuden * Copyright (c) 1998-1999 Brett Lymn (blymn (at) baea.com.au, brett_lymn (at) yahoo.com.au) 5 1.4.2.2 wrstuden * All rights reserved. 6 1.4.2.2 wrstuden * 7 1.4.2.2 wrstuden * Redistribution and use in source and binary forms, with or without 8 1.4.2.2 wrstuden * modification, are permitted provided that the following conditions 9 1.4.2.2 wrstuden * are met: 10 1.4.2.2 wrstuden * 1. Redistributions of source code must retain the above copyright 11 1.4.2.2 wrstuden * notice, this list of conditions and the following disclaimer. 12 1.4.2.2 wrstuden * 2. The name of the author may not be used to endorse or promote products 13 1.4.2.2 wrstuden * derived from this software withough specific prior written permission 14 1.4.2.2 wrstuden * 15 1.4.2.2 wrstuden * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 16 1.4.2.2 wrstuden * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 17 1.4.2.2 wrstuden * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 18 1.4.2.2 wrstuden * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 19 1.4.2.2 wrstuden * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 20 1.4.2.2 wrstuden * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 21 1.4.2.2 wrstuden * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 22 1.4.2.2 wrstuden * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 23 1.4.2.2 wrstuden * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 24 1.4.2.2 wrstuden * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 25 1.4.2.2 wrstuden * 26 1.4.2.2 wrstuden * 27 1.4.2.2 wrstuden */ 28 1.4.2.2 wrstuden 29 1.4.2.2 wrstuden #include <menu.h> 30 1.4.2.2 wrstuden #include <ctype.h> 31 1.4.2.2 wrstuden #include <stdlib.h> 32 1.4.2.2 wrstuden #include "internals.h" 33 1.4.2.2 wrstuden 34 1.4.2.2 wrstuden /* 35 1.4.2.2 wrstuden * The guts of the menu library. This function processes the character 36 1.4.2.2 wrstuden * in c and performs actions based on the value of the character. If the 37 1.4.2.2 wrstuden * character is a normal one then the driver attempts to match the character 38 1.4.2.2 wrstuden * against the items. If the character is a recognised request then the 39 1.4.2.2 wrstuden * request is processed by the driver, if the character is not a recognised 40 1.4.2.2 wrstuden * request and is not printable then it assumed to be a user defined command. 41 1.4.2.2 wrstuden */ 42 1.4.2.2 wrstuden int 43 1.4.2.2 wrstuden menu_driver(menu, c) 44 1.4.2.2 wrstuden MENU *menu; 45 1.4.2.2 wrstuden int c; 46 1.4.2.2 wrstuden { 47 1.4.2.2 wrstuden int drv_top_row, drv_scroll, it, status = E_OK; 48 1.4.2.2 wrstuden ITEM *drv_new_item; 49 1.4.2.2 wrstuden 50 1.4.2.2 wrstuden if (menu == NULL) 51 1.4.2.2 wrstuden return E_BAD_ARGUMENT; 52 1.4.2.2 wrstuden if (menu->posted == 0) 53 1.4.2.2 wrstuden return E_NOT_POSTED; 54 1.4.2.2 wrstuden if (menu->items == NULL) 55 1.4.2.2 wrstuden return E_NOT_CONNECTED; 56 1.4.2.2 wrstuden if (*menu->items == NULL) 57 1.4.2.2 wrstuden return E_NOT_CONNECTED; 58 1.4.2.2 wrstuden if (menu->in_init == 1) 59 1.4.2.2 wrstuden return E_BAD_STATE; 60 1.4.2.2 wrstuden 61 1.4.2.2 wrstuden /* this one should never happen but just in case.... */ 62 1.4.2.2 wrstuden if (menu->items[menu->cur_item] == NULL) 63 1.4.2.2 wrstuden return E_SYSTEM_ERROR; 64 1.4.2.2 wrstuden 65 1.4.2.2 wrstuden drv_new_item = menu->items[menu->cur_item]; 66 1.4.2.2 wrstuden it = menu->cur_item; 67 1.4.2.2 wrstuden drv_top_row = menu->top_row; 68 1.4.2.2 wrstuden 69 1.4.2.2 wrstuden if ((c > REQ_BASE_NUM) && (c <= MAX_COMMAND)) { 70 1.4.2.2 wrstuden /* is a known driver request - first check if the pattern 71 1.4.2.2 wrstuden * buffer needs to be cleared, we do this on non-search 72 1.4.2.2 wrstuden * type requests. 73 1.4.2.2 wrstuden */ 74 1.4.2.2 wrstuden if (! ((c == REQ_BACK_PATTERN) || (c == REQ_NEXT_MATCH) || 75 1.4.2.2 wrstuden (c == REQ_PREV_MATCH))) { 76 1.4.2.2 wrstuden if ((c == REQ_CLEAR_PATTERN) 77 1.4.2.2 wrstuden && (menu->pattern == NULL)) 78 1.4.2.2 wrstuden return E_REQUEST_DENIED; 79 1.4.2.2 wrstuden free(menu->pattern); 80 1.4.2.2 wrstuden menu->pattern = NULL; 81 1.4.2.2 wrstuden menu->plen = 0; 82 1.4.2.2 wrstuden menu->match_len = 0; 83 1.4.2.2 wrstuden } 84 1.4.2.2 wrstuden 85 1.4.2.2 wrstuden switch (c) { 86 1.4.2.2 wrstuden case REQ_LEFT_ITEM: 87 1.4.2.2 wrstuden drv_new_item = drv_new_item->left; 88 1.4.2.2 wrstuden break; 89 1.4.2.2 wrstuden case REQ_RIGHT_ITEM: 90 1.4.2.2 wrstuden drv_new_item = drv_new_item->right; 91 1.4.2.2 wrstuden break; 92 1.4.2.2 wrstuden case REQ_UP_ITEM: 93 1.4.2.2 wrstuden drv_new_item = drv_new_item->up; 94 1.4.2.2 wrstuden break; 95 1.4.2.2 wrstuden case REQ_DOWN_ITEM: 96 1.4.2.2 wrstuden drv_new_item = drv_new_item->down; 97 1.4.2.2 wrstuden break; 98 1.4.2.2 wrstuden case REQ_SCR_ULINE: 99 1.4.2.2 wrstuden if (drv_top_row == 0) 100 1.4.2.2 wrstuden return E_REQUEST_DENIED; 101 1.4.2.2 wrstuden drv_top_row--; 102 1.4.2.2 wrstuden drv_new_item = drv_new_item->up; 103 1.4.2.2 wrstuden break; 104 1.4.2.2 wrstuden case REQ_SCR_DLINE: 105 1.4.2.2 wrstuden drv_top_row++; 106 1.4.2.2 wrstuden if ((drv_top_row + menu->rows - 1)> menu->item_rows) 107 1.4.2.2 wrstuden return E_REQUEST_DENIED; 108 1.4.2.2 wrstuden drv_new_item = drv_new_item->down; 109 1.4.2.2 wrstuden break; 110 1.4.2.2 wrstuden case REQ_SCR_DPAGE: 111 1.4.2.2 wrstuden drv_scroll = menu->item_rows - menu->rows 112 1.4.2.2 wrstuden - menu->top_row; 113 1.4.2.2 wrstuden if (drv_scroll > menu->rows) { 114 1.4.2.2 wrstuden drv_scroll = menu->rows; 115 1.4.2.2 wrstuden } 116 1.4.2.2 wrstuden 117 1.4.2.2 wrstuden if (drv_scroll <= 0) { 118 1.4.2.2 wrstuden return E_REQUEST_DENIED; 119 1.4.2.2 wrstuden } else { 120 1.4.2.2 wrstuden drv_top_row += drv_scroll; 121 1.4.2.2 wrstuden while (drv_scroll-- > 0) 122 1.4.2.2 wrstuden drv_new_item = drv_new_item->down; 123 1.4.2.2 wrstuden } 124 1.4.2.2 wrstuden break; 125 1.4.2.2 wrstuden case REQ_SCR_UPAGE: 126 1.4.2.2 wrstuden if (menu->rows < menu->top_row) { 127 1.4.2.2 wrstuden drv_scroll = menu->rows; 128 1.4.2.2 wrstuden } else { 129 1.4.2.2 wrstuden drv_scroll = menu->top_row; 130 1.4.2.2 wrstuden } 131 1.4.2.2 wrstuden if (drv_scroll == 0) 132 1.4.2.2 wrstuden return E_REQUEST_DENIED; 133 1.4.2.2 wrstuden 134 1.4.2.2 wrstuden drv_top_row -= drv_scroll; 135 1.4.2.2 wrstuden while (drv_scroll-- > 0) 136 1.4.2.2 wrstuden drv_new_item = drv_new_item->up; 137 1.4.2.2 wrstuden break; 138 1.4.2.2 wrstuden case REQ_FIRST_ITEM: 139 1.4.2.2 wrstuden drv_new_item = menu->items[0]; 140 1.4.2.2 wrstuden break; 141 1.4.2.2 wrstuden case REQ_LAST_ITEM: 142 1.4.2.2 wrstuden drv_new_item = menu->items[menu->item_count - 1]; 143 1.4.2.2 wrstuden break; 144 1.4.2.2 wrstuden case REQ_NEXT_ITEM: 145 1.4.2.2 wrstuden if ((menu->cur_item + 1) >= menu->item_count) { 146 1.4.2.2 wrstuden if ((menu->opts & O_NONCYCLIC) 147 1.4.2.2 wrstuden == O_NONCYCLIC) { 148 1.4.2.2 wrstuden return E_REQUEST_DENIED; 149 1.4.2.2 wrstuden } else { 150 1.4.2.2 wrstuden drv_new_item = menu->items[0]; 151 1.4.2.2 wrstuden } 152 1.4.2.2 wrstuden } else { 153 1.4.2.2 wrstuden drv_new_item = 154 1.4.2.2 wrstuden menu->items[menu->cur_item + 1]; 155 1.4.2.2 wrstuden } 156 1.4.2.2 wrstuden break; 157 1.4.2.2 wrstuden case REQ_PREV_ITEM: 158 1.4.2.2 wrstuden if (menu->cur_item == 0) { 159 1.4.2.2 wrstuden if ((menu->opts & O_NONCYCLIC) 160 1.4.2.2 wrstuden == O_NONCYCLIC) { 161 1.4.2.2 wrstuden return E_REQUEST_DENIED; 162 1.4.2.2 wrstuden } else { 163 1.4.2.2 wrstuden drv_new_item = menu->items[ 164 1.4.2.2 wrstuden menu->item_count - 1]; 165 1.4.2.2 wrstuden } 166 1.4.2.2 wrstuden } else { 167 1.4.2.2 wrstuden drv_new_item = 168 1.4.2.2 wrstuden menu->items[menu->cur_item - 1]; 169 1.4.2.2 wrstuden } 170 1.4.2.2 wrstuden break; 171 1.4.2.2 wrstuden case REQ_TOGGLE_ITEM: 172 1.4.2.2 wrstuden if ((menu->opts & O_ONEVALUE) == O_ONEVALUE) { 173 1.4.2.2 wrstuden return E_REQUEST_DENIED; 174 1.4.2.2 wrstuden } else { 175 1.4.2.2 wrstuden if ((drv_new_item->opts 176 1.4.2.2 wrstuden & O_SELECTABLE) == O_SELECTABLE) { 177 1.4.2.2 wrstuden /* toggle select flag */ 178 1.4.2.2 wrstuden drv_new_item->selected ^= 1; 179 1.4.2.2 wrstuden /* update item in menu */ 180 1.4.2.2 wrstuden _menui_draw_item(menu, 181 1.4.2.2 wrstuden drv_new_item->index); 182 1.4.2.2 wrstuden } else { 183 1.4.2.2 wrstuden return E_NOT_SELECTABLE; 184 1.4.2.2 wrstuden } 185 1.4.2.2 wrstuden } 186 1.4.2.2 wrstuden break; 187 1.4.2.2 wrstuden case REQ_CLEAR_PATTERN: 188 1.4.2.2 wrstuden /* this action is taken before the 189 1.4.2.2 wrstuden case statement */ 190 1.4.2.2 wrstuden break; 191 1.4.2.2 wrstuden case REQ_BACK_PATTERN: 192 1.4.2.2 wrstuden if (menu->pattern == NULL) 193 1.4.2.2 wrstuden return E_REQUEST_DENIED; 194 1.4.2.2 wrstuden 195 1.4.2.2 wrstuden if (menu->plen == 0) 196 1.4.2.2 wrstuden return E_REQUEST_DENIED; 197 1.4.2.2 wrstuden menu->pattern[menu->plen--] = '\0'; 198 1.4.2.2 wrstuden break; 199 1.4.2.2 wrstuden case REQ_NEXT_MATCH: 200 1.4.2.2 wrstuden if (menu->pattern == NULL) 201 1.4.2.2 wrstuden return E_REQUEST_DENIED; 202 1.4.2.2 wrstuden 203 1.4.2.2 wrstuden status = _menui_match_pattern(menu, 0, 204 1.4.2.2 wrstuden MATCH_NEXT_FORWARD, 205 1.4.2.2 wrstuden &it); 206 1.4.2.2 wrstuden drv_new_item = menu->items[it]; 207 1.4.2.2 wrstuden break; 208 1.4.2.2 wrstuden case REQ_PREV_MATCH: 209 1.4.2.2 wrstuden if (menu->pattern == NULL) 210 1.4.2.2 wrstuden return E_REQUEST_DENIED; 211 1.4.2.2 wrstuden 212 1.4.2.2 wrstuden status = _menui_match_pattern(menu, 0, 213 1.4.2.2 wrstuden MATCH_NEXT_REVERSE, 214 1.4.2.2 wrstuden &it); 215 1.4.2.2 wrstuden drv_new_item = menu->items[it]; 216 1.4.2.2 wrstuden break; 217 1.4.2.2 wrstuden } 218 1.4.2.2 wrstuden } else if (c > MAX_COMMAND) { 219 1.4.2.2 wrstuden /* must be a user command */ 220 1.4.2.2 wrstuden return E_UNKNOWN_COMMAND; 221 1.4.2.2 wrstuden } else if (isprint((char) c)) { 222 1.4.2.2 wrstuden /* otherwise search items for the character. */ 223 1.4.2.2 wrstuden status = _menui_match_pattern(menu, c, MATCH_FORWARD, 224 1.4.2.2 wrstuden &it); 225 1.4.2.2 wrstuden drv_new_item = menu->items[it]; 226 1.4.2.2 wrstuden 227 1.4.2.2 wrstuden /* update the position of the cursor if we are doing 228 1.4.2.2 wrstuden * show match and the current item has not changed. If 229 1.4.2.2 wrstuden * we don't do this here it won't get done since the 230 1.4.2.2 wrstuden * display will not be updated due to the current item 231 1.4.2.2 wrstuden * not changing. 232 1.4.2.2 wrstuden */ 233 1.4.2.2 wrstuden if ((drv_new_item->index == menu->cur_item) 234 1.4.2.2 wrstuden && ((menu->opts & O_SHOWMATCH) == O_SHOWMATCH)) { 235 1.4.2.2 wrstuden pos_menu_cursor(menu); 236 1.4.2.2 wrstuden } 237 1.4.2.2 wrstuden 238 1.4.2.2 wrstuden 239 1.4.2.2 wrstuden } else { 240 1.4.2.2 wrstuden /* bad character */ 241 1.4.2.2 wrstuden return E_BAD_ARGUMENT; 242 1.4.2.2 wrstuden } 243 1.4.2.2 wrstuden 244 1.4.2.2 wrstuden if (drv_new_item == NULL) 245 1.4.2.2 wrstuden return E_REQUEST_DENIED; 246 1.4.2.2 wrstuden 247 1.4.2.2 wrstuden if (drv_new_item->row < drv_top_row) drv_top_row = drv_new_item->row; 248 1.4.2.2 wrstuden if (drv_new_item->row >= (drv_top_row + menu->rows)) 249 1.4.2.2 wrstuden drv_top_row = drv_new_item->row - menu->rows + 1; 250 1.4.2.2 wrstuden 251 1.4.2.2 wrstuden if ((drv_new_item->index != menu->cur_item) 252 1.4.2.2 wrstuden || (drv_top_row != menu->top_row)) 253 1.4.2.2 wrstuden _menui_goto_item(menu, drv_new_item, drv_top_row); 254 1.4.2.2 wrstuden 255 1.4.2.2 wrstuden return status; 256 1.4.2.2 wrstuden } 257 1.4.2.2 wrstuden 258 1.4.2.2 wrstuden 259 1.4.2.2 wrstuden 260 1.4.2.2 wrstuden 261 1.4.2.2 wrstuden 262
Indexes created Thu Oct 02 14:10:14 GMT 2025