303     for ((np) = (node); (np) != NULL; (np) = (np)->wn_sibling)
1887     wordnode_T  *wn_sibling;	// next sibling (alternate byte in word,  member
2139 	if (node->wn_sibling != NULL)  in spell_print_node()
2156 	if (node->wn_sibling != NULL)  in spell_print_node()
2161 	    spell_print_node(node->wn_sibling, depth);  in spell_print_node()
4016 				&& spin->si_prefroot->wn_sibling != NULL)  in store_aff_word()
4474 		copyprev = &np->wn_sibling;  in tree_add_word()
4498 	    prev = &node->wn_sibling;  in tree_add_word()
4528 	    np->wn_sibling = node;  in tree_add_word()
4544     spell_print_tree(root->wn_sibling);  in tree_add_word()
4681     if (root->wn_sibling != NULL)  in wordtree_compress()
4684 	n = node_compress(spin, root->wn_sibling, &ht, &tot);  in wordtree_compress()
4702 	spell_print_tree(root->wn_sibling);  in wordtree_compress()
4735     for (np = node; np != NULL && !got_int; np = np->wn_sibling)  in node_compress()
4825 				     p1 = p1->wn_sibling, p2 = p2->wn_sibling)  in node_equal()
5230 	    tree = spin->si_foldroot->wn_sibling;  in write_vim_spell()
5232 	    tree = spin->si_keeproot->wn_sibling;  in write_vim_spell()
5234 	    tree = spin->si_prefroot->wn_sibling;  in write_vim_spell()
5668     if (sug_filltable(spin, spin->si_foldroot->wn_sibling, 0, &ga) == -1)  in sug_maketable()
5698 	    for (np = p; np != NULL && np->wn_byte == NUL; np = np->wn_sibling)  in sug_filltable()
5724 	    while (p->wn_sibling != NULL && p->wn_sibling->wn_byte == NUL)  in sug_filltable()
5725 		p->wn_sibling = p->wn_sibling->wn_sibling;  in sug_filltable()
5830     tree = spin->si_foldroot->wn_sibling;  in sug_write()