Home
last modified time | relevance | path

Searched refs:t_decode (Results 1 – 8 of 8) sorted by relevance

/illumos-gate/usr/src/lib/libxcurses/src/libc/xcurses/
H A Dkeypad.c51 t_decode **root; in decode_add()
56 t_decode *node, *saved;
58 if (root == (t_decode **) 0)
65 saved = (t_decode *) 0;
67 if (*root == (t_decode *) 0) {
69 node = (t_decode *) malloc(sizeof *node);
70 if (node == (t_decode *) 0)
75 node->child = node->sibling = (t_decode *) 0;
82 && node->sibling != (t_decode *)0)
86 node->sibling = (t_decode *) malloc(
[all …]
H A Dprivate.h127 typedef struct t_decode { struct
128 struct t_decode *sibling; argument
129 struct t_decode *child; argument
132 } t_decode; argument
188 extern int __m_decode_init(t_decode **);
189 extern void __m_decode_free(t_decode **);
H A Dwgetch.c113 t_decode *node;
175 node = (t_decode *) __m_screen->_decode;
184 if (node == (t_decode *) 0)
H A Dnewterm.c261 sp->_unget._size = __m_decode_init((t_decode **) &sp->_decode);
404 __m_decode_free((t_decode **) &sp->_decode);
/illumos-gate/usr/src/lib/libxcurses2/src/libc/xcurses/
H A Dkeypad.c55 decode_add(t_decode **root, const char *str, short code) in decode_add()
58 t_decode *node, *saved; in decode_add()
71 node = (t_decode *) malloc(sizeof (*node)); in decode_add()
88 node->sibling = (t_decode *) in decode_add()
107 node->child = (t_decode *) malloc(sizeof (*node)); in decode_add()
127 __m_decode_free(t_decode **tree) in __m_decode_free()
141 __m_decode_init(t_decode **tree) in __m_decode_init()
H A Dprivate.h112 typedef struct t_decode { struct
113 struct t_decode *sibling; argument
114 struct t_decode *child; argument
117 } t_decode; typedef
179 extern int __m_decode_init(t_decode **);
180 extern void __m_decode_free(t_decode **);
H A Dwgetch.c339 t_decode *node; in wgetch()
398 node = (t_decode *) __m_screen->_decode; in wgetch()
H A Dnewterm.c257 sp->_unget._size = __m_decode_init((t_decode **) &sp->_decode); in newterm()
416 __m_decode_free((t_decode **) &sp->_decode); in delscreen()