Amit Daniel Kachhap | e6a01f5 | 2011-07-20 11:45:59 +0530 | [diff] [blame] | 1 | /**************************************************************************** |
| 2 | * Copyright (c) 1998-2007,2008 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 | * * |
| 12 | * The above copyright notice and this permission notice shall be included * |
| 13 | * in all copies or substantial portions of the Software. * |
| 14 | * * |
| 15 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS * |
| 16 | * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * |
| 17 | * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. * |
| 18 | * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, * |
| 19 | * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR * |
| 20 | * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR * |
| 21 | * THE USE OR OTHER DEALINGS IN THE SOFTWARE. * |
| 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: Thomas E. Dickey 1997-on * |
| 31 | ****************************************************************************/ |
| 32 | |
| 33 | /* |
| 34 | * This replaces an awk script which translated keys.list into keys.tries by |
| 35 | * making the output show the indices into the TERMTYPE Strings array. Doing |
| 36 | * it that way lets us cut down on the size of the init_keytry() function. |
| 37 | */ |
| 38 | |
| 39 | #define USE_TERMLIB 1 |
| 40 | #include <curses.priv.h> |
| 41 | |
| 42 | MODULE_ID("$Id: make_keys.c,v 1.14 2008/08/03 21:57:22 tom Exp $") |
| 43 | |
| 44 | #include <names.c> |
| 45 | |
| 46 | #define UNKNOWN (SIZEOF(strnames) + SIZEOF(strfnames)) |
| 47 | |
| 48 | static size_t |
| 49 | lookup(const char *name) |
| 50 | { |
| 51 | size_t n; |
| 52 | bool found = FALSE; |
| 53 | for (n = 0; strnames[n] != 0; n++) { |
| 54 | if (!strcmp(name, strnames[n])) { |
| 55 | found = TRUE; |
| 56 | break; |
| 57 | } |
| 58 | } |
| 59 | if (!found) { |
| 60 | for (n = 0; strfnames[n] != 0; n++) { |
| 61 | if (!strcmp(name, strfnames[n])) { |
| 62 | found = TRUE; |
| 63 | break; |
| 64 | } |
| 65 | } |
| 66 | } |
| 67 | return found ? n : UNKNOWN; |
| 68 | } |
| 69 | |
| 70 | static void |
| 71 | make_keys(FILE *ifp, FILE *ofp) |
| 72 | { |
| 73 | char buffer[BUFSIZ]; |
| 74 | char from[256]; |
| 75 | char to[256]; |
| 76 | int maxlen = 16; |
| 77 | int scanned; |
| 78 | |
| 79 | while (fgets(buffer, sizeof(buffer), ifp) != 0) { |
| 80 | if (*buffer == '#') |
| 81 | continue; |
| 82 | |
| 83 | to[sizeof(to) - 1] = '\0'; |
| 84 | from[sizeof(from) - 1] = '\0'; |
| 85 | |
| 86 | scanned = sscanf(buffer, "%255s %255s", to, from); |
| 87 | if (scanned == 2) { |
| 88 | int code = lookup(from); |
| 89 | if (code == UNKNOWN) |
| 90 | continue; |
| 91 | if ((int) strlen(from) > maxlen) |
| 92 | maxlen = strlen(from); |
| 93 | fprintf(ofp, "\t{ %4d, %-*.*s },\t/* %s */\n", |
| 94 | code, |
| 95 | maxlen, maxlen, |
| 96 | to, |
| 97 | from); |
| 98 | } |
| 99 | } |
| 100 | } |
| 101 | |
| 102 | static void |
| 103 | write_list(FILE *ofp, const char **list) |
| 104 | { |
| 105 | while (*list != 0) |
| 106 | fprintf(ofp, "%s\n", *list++); |
| 107 | } |
| 108 | |
| 109 | int |
| 110 | main(int argc, char *argv[]) |
| 111 | { |
| 112 | static const char *prefix[] = |
| 113 | { |
| 114 | "#ifndef NCU_KEYS_H", |
| 115 | "#define NCU_KEYS_H 1", |
| 116 | "", |
| 117 | "/* This file was generated by MAKE_KEYS */", |
| 118 | "", |
| 119 | "#if BROKEN_LINKER", |
| 120 | "static", |
| 121 | "#endif", |
| 122 | "const struct tinfo_fkeys _nc_tinfo_fkeys[] = {", |
| 123 | 0 |
| 124 | }; |
| 125 | static const char *suffix[] = |
| 126 | { |
| 127 | "\t{ 0, 0} };", |
| 128 | "", |
| 129 | "#endif /* NCU_KEYS_H */", |
| 130 | 0 |
| 131 | }; |
| 132 | |
| 133 | write_list(stdout, prefix); |
| 134 | if (argc > 1) { |
| 135 | int n; |
| 136 | for (n = 1; n < argc; n++) { |
| 137 | FILE *fp = fopen(argv[n], "r"); |
| 138 | if (fp != 0) { |
| 139 | make_keys(fp, stdout); |
| 140 | fclose(fp); |
| 141 | } |
| 142 | } |
| 143 | } else { |
| 144 | make_keys(stdin, stdout); |
| 145 | } |
| 146 | write_list(stdout, suffix); |
| 147 | return EXIT_SUCCESS; |
| 148 | } |