82 	struct keymacro_node_t *sibling;/* ptr to another key with same prefix*/  member
301 		if (ptr->sibling) {  in node_trav()
303 			return node_trav(el, ptr->sibling, ch, val);  in node_trav()
324 		for (xm = ptr; xm->sibling != NULL; xm = xm->sibling)  in node__try()
325 			if (xm->sibling->ch == *str)  in node__try()
327 		if (xm->sibling == NULL)  in node__try()
328 			xm->sibling = node__get(*str);	/* setup new node */  in node__try()
329 		ptr = xm->sibling;  in node__try()
386 		for (xm = ptr; xm->sibling != NULL; xm = xm->sibling)  in node__delete()
387 			if (xm->sibling->ch == *str)  in node__delete()
389 		if (xm->sibling == NULL)  in node__delete()
392 		ptr = xm->sibling;  in node__delete()
397 			*inptr = ptr->sibling;  in node__delete()
399 			prev_ptr->sibling = ptr->sibling;  in node__delete()
400 		ptr->sibling = NULL;  in node__delete()
408 			*inptr = ptr->sibling;  in node__delete()
410 			prev_ptr->sibling = ptr->sibling;  in node__delete()
411 		ptr->sibling = NULL;  in node__delete()
433 	node__put(el, ptr->sibling);  in node__put()
465 	ptr->sibling = NULL;  in node__get()
474 	node__free(k->sibling);  in node__free()
523 			if (ptr->sibling)  in node_lookup()
524 				return (node_lookup(el, str, ptr->sibling,  in node_lookup()
569 	if (ptr->sibling)  in node_enum()
570 		(void) node_enum(el, ptr->sibling, cnt);  in node_enum()