Lines Matching refs:node
58 t_decode *node, *saved; in decode_add() local
71 node = (t_decode *) malloc(sizeof (*node)); in decode_add()
72 if (node == NULL) in decode_add()
75 *root = saved = node; in decode_add()
77 node->child = node->sibling = NULL; in decode_add()
78 node->ch = *str++; in decode_add()
79 node->key = 0; in decode_add()
82 for (node = *root; *str != '\0'; ++str, node = node->child) { in decode_add()
83 while (node->ch != *str && in decode_add()
84 node->sibling != NULL) in decode_add()
85 node = node->sibling; in decode_add()
87 if (node->ch != *str) { in decode_add()
88 node->sibling = (t_decode *) in decode_add()
89 malloc(sizeof (*node)); in decode_add()
90 if (node->sibling == NULL) in decode_add()
93 saved = node = node->sibling; in decode_add()
94 node->child = node->sibling = NULL; in decode_add()
95 node->ch = *str++; in decode_add()
96 node->key = 0; in decode_add()
100 if (node->child == NULL) in decode_add()
107 node->child = (t_decode *) malloc(sizeof (*node)); in decode_add()
108 if (node->child == NULL) { in decode_add()
113 node = node->child; in decode_add()
114 node->child = node->sibling = NULL; in decode_add()
115 node->ch = *str++; in decode_add()
116 node->key = 0; in decode_add()
119 node->key = code; in decode_add()