1/**************************************************************************** |
2 * Copyright (c) 1998-2004,2005 Free Software Foundation, Inc. * |
3 * * 4 * Permission is hereby granted, free of charge, to any person obtaining a * 5 * copy of this software and associated documentation files (the * 6 * "Software"), to deal in the Software without restriction, including * 7 * without limitation the rights to use, copy, modify, merge, publish, * 8 * distribute, distribute with modifications, sublicense, and/or sell * 9 * copies of the Software, and to permit persons to whom the Software is * 10 * furnished to do so, subject to the following conditions: * --- 11 unchanged lines hidden (view full) --- 22 * * 23 * Except as contained in this notice, the name(s) of the above copyright * 24 * holders shall not be used in advertising or otherwise to promote the * 25 * sale, use or other dealings in this Software without prior written * 26 * authorization. * 27 ****************************************************************************/ 28 29/**************************************************************************** |
30 * Author: Juergen Pfeifer, 1995,1997 * |
31 ****************************************************************************/ 32 33/*************************************************************************** 34* Module m_request_name * 35* Routines to handle external names of menu requests * 36***************************************************************************/ 37 38#include "menu.priv.h" 39 |
40MODULE_ID("$Id: m_req_name.c,v 1.19 2005/04/16 16:59:52 tom Exp $") |
41 |
42static const char *request_names[MAX_MENU_COMMAND - MIN_MENU_COMMAND + 1] = 43{ 44 "LEFT_ITEM", 45 "RIGHT_ITEM", 46 "UP_ITEM", 47 "DOWN_ITEM", 48 "SCR_ULINE", 49 "SCR_DLINE", 50 "SCR_DPAGE", 51 "SCR_UPAGE", 52 "FIRST_ITEM", 53 "LAST_ITEM", 54 "NEXT_ITEM", 55 "PREV_ITEM", 56 "TOGGLE_ITEM", |
57 "CLEAR_PATTERN", |
58 "BACK_PATTERN", 59 "NEXT_MATCH", 60 "PREV_MATCH" |
61}; |
62 |
63#define A_SIZE (sizeof(request_names)/sizeof(request_names[0])) 64 65/*--------------------------------------------------------------------------- 66| Facility : libnmenu 67| Function : const char * menu_request_name (int request); 68| 69| Description : Get the external name of a menu request. 70| 71| Return Values : Pointer to name - on success 72| NULL - on invalid request code 73+--------------------------------------------------------------------------*/ 74NCURSES_EXPORT(const char *) |
75menu_request_name(int request) |
76{ |
77 T((T_CALLED("menu_request_name(%d)"), request)); 78 if ((request < MIN_MENU_COMMAND) || (request > MAX_MENU_COMMAND)) |
79 { 80 SET_ERROR(E_BAD_ARGUMENT); |
81 returnCPtr((const char *)0); |
82 } 83 else |
84 returnCPtr(request_names[request - MIN_MENU_COMMAND]); |
85} 86 |
87/*--------------------------------------------------------------------------- 88| Facility : libnmenu 89| Function : int menu_request_by_name (const char *str); 90| 91| Description : Search for a request with this name. 92| 93| Return Values : Request Id - on success 94| E_NO_MATCH - request not found 95+--------------------------------------------------------------------------*/ 96NCURSES_EXPORT(int) |
97menu_request_by_name(const char *str) 98{ |
99 /* because the table is so small, it doesn't really hurt 100 to run sequentially through it. |
101 */ |
102 unsigned int i = 0; 103 char buf[16]; |
104 105 T((T_CALLED("menu_request_by_name(%s)"), _nc_visbuf(str))); 106 |
107 if (str) 108 { |
109 strncpy(buf, str, sizeof(buf)); 110 while ((i < sizeof(buf)) && (buf[i] != '\0')) |
111 { 112 buf[i] = toupper(buf[i]); 113 i++; 114 } |
115 116 for (i = 0; i < A_SIZE; i++) |
117 { |
118 if (strncmp(request_names[i], buf, sizeof(buf)) == 0) 119 returnCode(MIN_MENU_COMMAND + (int)i); 120 } |
121 } 122 RETURN(E_NO_MATCH); 123} 124 125/* m_req_name.c ends here */ |