Home
last modified time | relevance | path

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

/titanic_41/usr/src/lib/libxcurses/src/libc/xcurses/
H A Dkeypad.c53 t_decode **root; in decode_add()
58 t_decode *node, *saved;
60 if (root == (t_decode **) 0)
67 saved = (t_decode *) 0;
69 if (*root == (t_decode *) 0) {
71 node = (t_decode *) malloc(sizeof *node);
72 if (node == (t_decode *) 0)
77 node->child = node->sibling = (t_decode *) 0;
84 && node->sibling != (t_decode *)0)
88 node->sibling = (t_decode *) malloc(
[all …]
H A Dprivate.h129 typedef struct t_decode { struct
130 struct t_decode *sibling; argument
131 struct t_decode *child; argument
134 } t_decode; typedef
190 extern int __m_decode_init(t_decode **);
191 extern void __m_decode_free(t_decode **);
H A Dwgetch.c115 t_decode *node;
177 node = (t_decode *) __m_screen->_decode;
186 if (node == (t_decode *) 0)
H A Dnewterm.c263 sp->_unget._size = __m_decode_init((t_decode **) &sp->_decode);
406 __m_decode_free((t_decode **) &sp->_decode);
/titanic_41/usr/src/lib/libxcurses2/src/libc/xcurses/
H A Dkeypad.c57 decode_add(t_decode **root, const char *str, short code) in decode_add()
60 t_decode *node, *saved; in decode_add()
73 node = (t_decode *) malloc(sizeof (*node)); in decode_add()
90 node->sibling = (t_decode *) in decode_add()
109 node->child = (t_decode *) malloc(sizeof (*node)); in decode_add()
129 __m_decode_free(t_decode **tree) in __m_decode_free()
143 __m_decode_init(t_decode **tree) in __m_decode_init()
H A Dprivate.h114 typedef struct t_decode { struct
115 struct t_decode *sibling; argument
116 struct t_decode *child; argument
119 } t_decode; argument
181 extern int __m_decode_init(t_decode **);
182 extern void __m_decode_free(t_decode **);
H A Dwgetch.c341 t_decode *node; in wgetch()
400 node = (t_decode *) __m_screen->_decode; in wgetch()
H A Dnewterm.c259 sp->_unget._size = __m_decode_init((t_decode **) &sp->_decode); in newterm()
418 __m_decode_free((t_decode **) &sp->_decode); in delscreen()