1886     wordnode_T	*wn_child;	// child (next byte in word)  member
2105 	spell_clear_flags(np->wn_child);  in spell_clear_flags()
2128 	    if (node->wn_child != NULL)  in spell_print_node()
2152 	if (node->wn_byte != NUL && node->wn_child != NULL)  in spell_print_node()
2153 	    spell_print_node(node->wn_child, depth + 1);  in spell_print_node()
4459 		np->wn_child = copyp->wn_child;  in tree_add_word()
4460 		if (np->wn_child != NULL)  in tree_add_word()
4461 		    ++np->wn_child->wn_refs;	// child gets extra ref  in tree_add_word()
4539 	prev = &node->wn_child;  in tree_add_word()
4619 	spin->si_first_free = n->wn_child;  in get_wordnode()
4646 	    if (np->wn_child != NULL)  in deref_wordnode()
4647 		cnt += deref_wordnode(spin, np->wn_child);  in deref_wordnode()
4663     n->wn_child = spin->si_first_free;  in free_wordnode()
4738 	if ((child = np->wn_child) != NULL)  in node_compress()
4759 			np->wn_child = tp;  in node_compress()
4794 	    n = (unsigned)(np->wn_byte + ((long_u)np->wn_child << 8));  in node_compress()
4831 		    : (p1->wn_child != p2->wn_child)))  in node_equal()
5284 		clear_node(np->wn_child);  in clear_node()
5389 	    if (np->wn_child->wn_u1.index != 0  in put_node()
5390 					 && np->wn_child->wn_u2.wnode != node)  in put_node()
5397 		    put_bytes(fd, (long_u)np->wn_child->wn_u1.index, 3);  in put_node()
5400 	    else if (np->wn_child->wn_u2.wnode == NULL)  in put_node()
5402 		np->wn_child->wn_u2.wnode = node;  in put_node()
5419 	if (np->wn_byte != 0 && np->wn_child->wn_u2.wnode == node)  in put_node()
5420 	    newindex = put_node(fd, np->wn_child, newindex, regionmask,  in put_node()
5734 	    wordnr = sug_filltable(spin, p->wn_child, wordnr, gap);  in sug_filltable()