Lines Matching defs:node
60 t_decode *node, *saved;
72 /* First node of tree. */
73 node = (t_decode *) malloc(sizeof (*node));
74 if (node == NULL)
77 *root = saved = node;
79 node->child = node->sibling = NULL;
80 node->ch = *str++;
81 node->key = 0;
83 /* Find node to insert function key sequence into the tree. */
84 for (node = *root; *str != '\0'; ++str, node = node->child) {
85 while (node->ch != *str &&
86 node->sibling != NULL)
87 node = node->sibling;
89 if (node->ch != *str) {
90 node->sibling = (t_decode *)
91 malloc(sizeof (*node));
92 if (node->sibling == NULL)
95 saved = node = node->sibling;
96 node->child = node->sibling = NULL;
97 node->ch = *str++;
98 node->key = 0;
102 if (node->child == NULL)
107 /* Insert string into the tree; node->child == null. */
109 node->child = (t_decode *) malloc(sizeof (*node));
110 if (node->child == NULL) {
115 node = node->child;
116 node->child = node->sibling = NULL;
117 node->ch = *str++;
118 node->key = 0;
121 node->key = code;