76 	struct keymacro_node_t *sibling;/* ptr to another key with same prefix*/  member
295 		if (ptr->sibling) {  in node_trav()
297 			return node_trav(el, ptr->sibling, ch, val);  in node_trav()
318 		for (xm = ptr; xm->sibling != NULL; xm = xm->sibling)  in node__try()
319 			if (xm->sibling->ch == *str)  in node__try()
321 		if (xm->sibling == NULL)  in node__try()
322 			xm->sibling = node__get(*str);	/* setup new node */  in node__try()
323 		ptr = xm->sibling;  in node__try()
382 		for (xm = ptr; xm->sibling != NULL; xm = xm->sibling)  in node__delete()
383 			if (xm->sibling->ch == *str)  in node__delete()
385 		if (xm->sibling == NULL)  in node__delete()
388 		ptr = xm->sibling;  in node__delete()
393 			*inptr = ptr->sibling;  in node__delete()
395 			prev_ptr->sibling = ptr->sibling;  in node__delete()
396 		ptr->sibling = NULL;  in node__delete()
404 			*inptr = ptr->sibling;  in node__delete()
406 			prev_ptr->sibling = ptr->sibling;  in node__delete()
407 		ptr->sibling = NULL;  in node__delete()
429 	node__put(el, ptr->sibling);  in node__put()
462 	ptr->sibling = NULL;  in node__get()
471 	node__free(k->sibling);  in node__free()
519 			if (ptr->sibling)  in node_lookup()
520 				return (node_lookup(el, str, ptr->sibling,  in node_lookup()
565 	if (ptr->sibling)  in node_enum()
566 		(void) node_enum(el, ptr->sibling, cnt);  in node_enum()