Lines Matching defs:node
58 t_decode *node, *saved;
70 /* First node of tree. */
71 node = (t_decode *) malloc(sizeof *node);
72 if (node == (t_decode *) 0)
75 *root = saved = node;
77 node->child = node->sibling = (t_decode *) 0;
78 node->ch = *str++;
79 node->key = 0;
81 /* Find node to insert function key sequence into the tree. */
82 for (node = *root; *str != '\0'; ++str, node = node->child) {
83 while (node->ch != *str
84 && node->sibling != (t_decode *)0)
85 node = node->sibling;
87 if (node->ch != *str) {
88 node->sibling = (t_decode *) malloc(
89 sizeof *node
91 if (node->sibling == (t_decode *) 0)
94 saved = node = node->sibling;
95 node->child = node->sibling = (t_decode *) 0;
96 node->ch = *str++;
97 node->key = 0;
101 if (node->child == (t_decode *) 0)
106 /* Insert string into the tree; node->child == null. */
108 node->child = (t_decode *) malloc(sizeof *node);
109 if (node->child == (t_decode *) 0) {
114 node = node->child;
115 node->child = node->sibling = (t_decode *) 0;
116 node->ch = *str++;
117 node->key = 0;
120 node->key = code;