blob: 14f704b4abb5ffb2962ee353dc89a1a9c6a0ffa6 [file] [log] [blame]
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +05301/****************************************************************************
micky3879b9f5e72025-07-08 18:04:53 -04002 * Copyright 2020 Thomas E. Dickey *
3 * Copyright 1999-2011,2012 Free Software Foundation, Inc. *
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +05304 * *
5 * Permission is hereby granted, free of charge, to any person obtaining a *
6 * copy of this software and associated documentation files (the *
7 * "Software"), to deal in the Software without restriction, including *
8 * without limitation the rights to use, copy, modify, merge, publish, *
9 * distribute, distribute with modifications, sublicense, and/or sell *
10 * copies of the Software, and to permit persons to whom the Software is *
11 * furnished to do so, subject to the following conditions: *
12 * *
13 * The above copyright notice and this permission notice shall be included *
14 * in all copies or substantial portions of the Software. *
15 * *
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
17 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
18 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
19 * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
20 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
21 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
22 * THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
23 * *
24 * Except as contained in this notice, the name(s) of the above copyright *
25 * holders shall not be used in advertising or otherwise to promote the *
26 * sale, use or other dealings in this Software without prior written *
27 * authorization. *
28 ****************************************************************************/
29
30/****************************************************************************
Steve Kondikae271bc2015-11-15 02:50:53 +010031 * Author: Thomas E. Dickey 1999 *
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +053032 ****************************************************************************/
33/*
34 * trace_tries.c - Tracing/Debugging buffers (keycode tries-trees)
35 */
36
37#include <curses.priv.h>
38
micky3879b9f5e72025-07-08 18:04:53 -040039MODULE_ID("$Id: trace_tries.c,v 1.18 2020/02/02 23:34:34 tom Exp $")
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +053040
41#ifdef TRACE
42#define my_buffer _nc_globals.tracetry_buf
43#define my_length _nc_globals.tracetry_used
44
45static void
46recur_tries(TRIES * tree, unsigned level)
47{
48 if (level > my_length) {
49 my_length = (level + 1) * 4;
Steve Kondikae271bc2015-11-15 02:50:53 +010050 my_buffer = (unsigned char *) _nc_doalloc(my_buffer, my_length);
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +053051 }
52
Steve Kondikae271bc2015-11-15 02:50:53 +010053 if (my_buffer != 0) {
54 while (tree != 0) {
55 if ((my_buffer[level] = tree->ch) == 0)
56 my_buffer[level] = 128;
57 my_buffer[level + 1] = 0;
58 if (tree->value != 0) {
59 _tracef("%5d: %s (%s)", tree->value,
60 _nc_visbuf((char *) my_buffer), keyname(tree->value));
61 }
62 if (tree->child)
63 recur_tries(tree->child, level + 1);
64 tree = tree->sibling;
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +053065 }
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +053066 }
67}
68
69NCURSES_EXPORT(void)
70_nc_trace_tries(TRIES * tree)
71{
Steve Kondikae271bc2015-11-15 02:50:53 +010072 if ((my_buffer = typeMalloc(unsigned char, my_length = 80)) != 0) {
73 _tracef("BEGIN tries %p", (void *) tree);
74 recur_tries(tree, 0);
75 _tracef(". . . tries %p", (void *) tree);
76 free(my_buffer);
77 }
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +053078}
79
80#else
Steve Kondikae271bc2015-11-15 02:50:53 +010081EMPTY_MODULE(_nc_empty_trace_tries)
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +053082#endif