t_decode
node->child = (t_decode *) malloc(sizeof *node);
if (node->child == (t_decode *) 0) {
node->child = node->sibling = (t_decode *) 0;
t_decode **tree;
if (*tree != (t_decode *) 0) {
*tree = (t_decode *) 0;
t_decode **tree;
*tree = (t_decode *) 0;
t_decode **root;
t_decode *node, *saved;
if (root == (t_decode **) 0)
saved = (t_decode *) 0;
if (*root == (t_decode *) 0) {
node = (t_decode *) malloc(sizeof *node);
if (node == (t_decode *) 0)
node->child = node->sibling = (t_decode *) 0;
&& node->sibling != (t_decode *)0)
node->sibling = (t_decode *) malloc(
if (node->sibling == (t_decode *) 0)
node->child = node->sibling = (t_decode *) 0;
if (node->child == (t_decode *) 0)
sp->_unget._size = __m_decode_init((t_decode **) &sp->_decode);
__m_decode_free((t_decode **) &sp->_decode);
struct t_decode *sibling;
struct t_decode *child;
extern int __m_decode_init(t_decode **);
extern void __m_decode_free(t_decode **);
t_decode *node;
node = (t_decode *) __m_screen->_decode;
if (node == (t_decode *) 0)
node->child = (t_decode *) malloc(sizeof (*node));
__m_decode_free(t_decode **tree)
__m_decode_init(t_decode **tree)
decode_add(t_decode **root, const char *str, short code)
t_decode *node, *saved;
node = (t_decode *) malloc(sizeof (*node));
node->sibling = (t_decode *)
sp->_unget._size = __m_decode_init((t_decode **) &sp->_decode);
__m_decode_free((t_decode **) &sp->_decode);
struct t_decode *sibling;
struct t_decode *child;
extern int __m_decode_init(t_decode **);
extern void __m_decode_free(t_decode **);
t_decode *node;
node = (t_decode *) __m_screen->_decode;