Lines Matching refs:sibling
81 struct keymacro_node_t *sibling;/* ptr to another key with same prefix*/ member
302 if (ptr->sibling) { in node_trav()
304 return node_trav(el, ptr->sibling, ch, val); in node_trav()
325 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling) in node__try()
326 if (xm->sibling->ch == *str) in node__try()
328 if (xm->sibling == NULL) in node__try()
329 xm->sibling = node__get(*str); /* setup new node */ in node__try()
330 ptr = xm->sibling; in node__try()
391 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling) in node__delete()
392 if (xm->sibling->ch == *str) in node__delete()
394 if (xm->sibling == NULL) in node__delete()
397 ptr = xm->sibling; in node__delete()
402 *inptr = ptr->sibling; in node__delete()
404 prev_ptr->sibling = ptr->sibling; in node__delete()
405 ptr->sibling = NULL; in node__delete()
413 *inptr = ptr->sibling; in node__delete()
415 prev_ptr->sibling = ptr->sibling; in node__delete()
416 ptr->sibling = NULL; in node__delete()
438 node__put(el, ptr->sibling); in node__put()
472 ptr->sibling = NULL; in node__get()
481 node__free(k->sibling); in node__free()
529 if (ptr->sibling) in node_lookup()
530 return (node_lookup(el, str, ptr->sibling, in node_lookup()
575 if (ptr->sibling) in node_enum()
576 (void) node_enum(el, ptr->sibling, cnt); in node_enum()