Lines Matching defs:node
157 struct trust_anchor* node, *prev = NULL, *p;
161 RBTREE_FOR(node, struct trust_anchor*, anchors->tree) {
162 lock_basic_lock(&node->lock);
163 node->parent = NULL;
164 if(!prev || prev->dclass != node->dclass) {
165 prev = node;
166 lock_basic_unlock(&node->lock);
169 (void)dname_lab_cmp(prev->name, prev->namelabs, node->name,
170 node->namelabs, &m); /* we know prev is smaller */
179 node->parent = p;
182 lock_basic_unlock(&node->lock);
183 prev = node;
203 key.node.key = &key;
232 ta->node.key = ta;
250 rbtree_insert(anchors->tree, &ta->node);
994 next = (struct trust_anchor*)rbtree_next(&ta->node);
1031 (void)rbtree_delete(anchors->tree, &ta->node);
1033 anchors_delfunc(&ta->node, NULL);
1135 key.node.key = &key;
1186 key.node.key = &key;
1213 key.node.key = &key;
1234 (void)rbtree_delete(anchors->tree, &ta->node);
1240 anchors_delfunc(&ta->node, NULL);