1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298
|
/****************************************************************************
* Copyright 2018-2021,2022 Thomas E. Dickey *
* Copyright 2006-2016,2017 Free Software Foundation, Inc. *
* *
* Permission is hereby granted, free of charge, to any person obtaining a *
* copy of this software and associated documentation files (the *
* "Software"), to deal in the Software without restriction, including *
* without limitation the rights to use, copy, modify, merge, publish, *
* distribute, distribute with modifications, sublicense, and/or sell *
* copies of the Software, and to permit persons to whom the Software is *
* furnished to do so, subject to the following conditions: *
* *
* The above copyright notice and this permission notice shall be included *
* in all copies or substantial portions of the Software. *
* *
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
* IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
* OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
* THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
* *
* Except as contained in this notice, the name(s) of the above copyright *
* holders shall not be used in advertising or otherwise to promote the *
* sale, use or other dealings in this Software without prior written *
* authorization. *
****************************************************************************/
/*
* Author: Thomas E. Dickey, 2006
*
* $Id: foldkeys.c,v 1.11 2022/12/10 23:31:31 tom Exp $
*
* Demonstrate a method for altering key definitions at runtime.
*
* This program reads the key definitions, merging those which have xterm-style
* modifiers into their equivalents which have no modifiers. It does this
* merging only for the keys which are defined in the terminal description.
*/
#define NEED_TIME_H
#include <test.priv.h>
#if defined(NCURSES_VERSION) && NCURSES_EXT_FUNCS
#define MY_LOGFILE "demo_foldkeys.log"
#define MY_KEYS (KEY_MAX + 1)
/*
* Log the most recently-written line to our logfile
*/
static void
log_last_line(WINDOW *win)
{
FILE *fp;
if ((fp = fopen(MY_LOGFILE, "a")) != 0) {
char temp[256];
int y, x, n;
int need = sizeof(temp) - 1;
if (need > COLS)
need = COLS;
getyx(win, y, x);
wmove(win, y - 1, 0);
n = winnstr(win, temp, need);
while (n-- > 0) {
if (isspace(UChar(temp[n])))
temp[n] = '\0';
else
break;
}
wmove(win, y, x);
fprintf(fp, "%s\n", temp);
fclose(fp);
}
}
/*
* ncurses has no API for telling what the actual last key-code is. That is
* a secret because the codes past KEY_MAX are computed at run-time and may
* differ depending on the previous calls to newterm(), etc. It is unlikely
* that one could have more than a thousand key definitions...
*/
#define MAX_KEYS 2000
typedef struct {
const char *name;
const char *value;
int code;
int state;
} KeyInfo;
static void
demo_foldkeys(void)
{
KeyInfo info[MAX_KEYS];
int info_len = 0;
int merged = 0;
int code;
int j, k;
/*
* Tell ncurses that we want to use function keys. That will make it add
* any user-defined keys that appear in the terminfo.
*/
keypad(stdscr, TRUE);
/*
* List the predefined keys using the strnames[] array.
*/
for (code = 0; code < STRCOUNT; ++code) {
NCURSES_CONST char *name = strnames[code];
NCURSES_CONST char *value = tigetstr(name);
if (value != 0 && value != (NCURSES_CONST char *) -1) {
info[info_len].name = strnames[code];
info[info_len].code = key_defined(value);
info[info_len].value = value;
info[info_len].state = 0;
if (info[info_len].code > 0)
++info_len;
}
}
/*
* We can get the names for user-defined keys from keyname(). It returns
* a name like KEY_foo for the predefined keys, which tigetstr() does not
* understand.
*/
for (code = KEY_MAX; code < MAX_KEYS; ++code) {
NCURSES_CONST char *name = keyname(code);
if (name != 0) {
info[info_len].name = name;
info[info_len].code = code;
info[info_len].value = tigetstr(name);
info[info_len].state = 0;
++info_len;
}
}
printw("Initially %d key definitions\n", info_len);
/*
* Look for keys that have xterm-style modifiers.
*/
for (j = 0; j < info_len; ++j) {
int first, second;
char final[2];
char *value;
size_t need;
if (info[j].state == 0
&& sscanf(info[j].value,
"\033[%d;%d%c",
&first,
&second,
final) == 3
&& *final != ';'
&& (need = strlen(info[j].value)) != 0
&& (value = strdup(info[j].value)) != 0) {
(void) need; /* _nc_SLIMIT is normally nothing */
_nc_SPRINTF(value, _nc_SLIMIT(need) "\033[%d%c", first, *final);
for (k = 0; k < info_len; ++k) {
if (info[k].state == 0
&& !strcmp(info[k].value, value)) {
info[j].state = 1;
break;
}
}
if (info[j].state == 0) {
_nc_SPRINTF(value, _nc_SLIMIT(need) "\033O%c", *final);
for (k = 0; k < info_len; ++k) {
if (info[k].state == 0
&& !strcmp(info[k].value, value)) {
info[j].state = 1;
break;
}
}
}
if (info[j].state == 1) {
if ((define_key(info[j].value, info[k].code)) != ERR) {
printw("map %s to %s\n", info[j].value, info[k].value);
keyok(info[j].code, FALSE);
++merged;
} else {
printw("? cannot define_key %d:%s\n", j, info[j].value);
}
} else {
printw("? cannot merge %d:%s\n", j, info[j].value);
}
free(value);
}
}
printw("Merged to %d key definitions\n", info_len - merged);
}
static void
usage(int ok)
{
static const char *msg[] =
{
"Usage: foldkeys [options]"
,""
,USAGE_COMMON
};
size_t n;
for (n = 0; n < SIZEOF(msg); n++)
fprintf(stderr, "%s\n", msg[n]);
ExitProgram(ok ? EXIT_SUCCESS : EXIT_FAILURE);
}
/* *INDENT-OFF* */
VERSION_COMMON()
/* *INDENT-ON* */
int
main(int argc, char *argv[])
{
int ch;
#if HAVE_GETTIMEOFDAY
struct timeval previous;
#endif
while ((ch = getopt(argc, argv, OPTS_COMMON)) != -1) {
switch (ch) {
case OPTS_VERSION:
show_version(argv);
ExitProgram(EXIT_SUCCESS);
default:
usage(ch == OPTS_USAGE);
/* NOTREACHED */
}
}
if (optind < argc)
usage(FALSE);
if (newterm(0, stdout, stdin) == 0) {
fprintf(stderr, "Cannot initialize terminal\n");
ExitProgram(EXIT_FAILURE);
}
unlink(MY_LOGFILE);
(void) cbreak(); /* take input chars one at a time, no wait for \n */
(void) noecho(); /* don't echo input */
scrollok(stdscr, TRUE);
keypad(stdscr, TRUE);
move(0, 0);
demo_foldkeys();
#if HAVE_GETTIMEOFDAY
gettimeofday(&previous, 0);
#endif
while ((ch = getch()) != ERR) {
bool escaped = (ch >= MY_KEYS);
const char *name = keyname(escaped ? (ch - MY_KEYS) : ch);
#if HAVE_GETTIMEOFDAY
int secs, msecs;
struct timeval current;
gettimeofday(¤t, 0);
secs = (int) (current.tv_sec - previous.tv_sec);
msecs = (int) ((current.tv_usec - previous.tv_usec) / 1000);
if (msecs < 0) {
msecs += 1000;
--secs;
}
if (msecs >= 1000) {
secs += msecs / 1000;
msecs %= 1000;
}
printw("%6d.%03d ", secs, msecs);
previous = current;
#endif
printw("Keycode %d, name %s%s\n",
ch,
escaped ? "ESC-" : "",
name != 0 ? name : "<null>");
log_last_line(stdscr);
clrtoeol();
if (ch == 'q')
break;
}
endwin();
ExitProgram(EXIT_SUCCESS);
}
#else
int
main(void)
{
printf("This program requires the ncurses library\n");
ExitProgram(EXIT_FAILURE);
}
#endif
|