Lines Matching refs:sibling
107 struct Xmapnode *sibling; /* ptr to another Xkey with same prefix */ member
195 if (ptr->sibling) { in TraverseMap()
197 return (TraverseMap(ptr->sibling, ch, val)); in TraverseMap()
243 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling) in TryNode()
244 if (xm->sibling->ch == *(str->buf)) in TryNode()
246 if (xm->sibling == NULL) in TryNode()
247 xm->sibling = GetFreeNode(str); /* setup new node */ in TryNode()
248 ptr = xm->sibling; in TryNode()
343 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling) in TryDeleteNode()
344 if (xm->sibling->ch == *(str->buf)) in TryDeleteNode()
346 if (xm->sibling == NULL) in TryDeleteNode()
348 inptr = &xm->sibling; in TryDeleteNode()
349 ptr = xm->sibling; in TryDeleteNode()
357 *inptr = ptr->sibling; in TryDeleteNode()
358 ptr->sibling = NULL; in TryDeleteNode()
365 *inptr = ptr->sibling; in TryDeleteNode()
366 ptr->sibling = NULL; in TryDeleteNode()
389 PutFreeNode(ptr->sibling); in PutFreeNode()
421 ptr->sibling = NULL; in GetFreeNode()
497 if (ptr->sibling) in Lookup()
498 return (Lookup(buf, str, ptr->sibling)); in Lookup()
529 if (ptr->sibling) { in Enumerate()
531 Enumerate(buf, ptr->sibling); in Enumerate()