1872 typedef struct wordnode_S wordnode_T;  typedef
1883 	wordnode_T *next;	// next node with same hash key
1884 	wordnode_T *wnode;	// parent node that will write this node
1886     wordnode_T	*wn_child;	// child (next byte in word)
1887     wordnode_T  *wn_sibling;	// next sibling (alternate byte in word,
1910 #define HI2WN(hi)    (wordnode_T *)((hi)->hi_key)
1917     wordnode_T	*si_foldroot;	// tree with case-folded words
1920     wordnode_T	*si_keeproot;	// tree with keep-case words
1923     wordnode_T	*si_prefroot;	// tree with postponed prefixes
1933     wordnode_T	*si_first_free; // List of nodes that have been freed during
2005 static int tree_add_word(spellinfo_T *spin, char_u *word, wordnode_T *tree, int flags, int region, …
2006 static wordnode_T *get_wordnode(spellinfo_T *spin);
2007 static void free_wordnode(spellinfo_T *spin, wordnode_T *n);
2008 static void wordtree_compress(spellinfo_T *spin, wordnode_T *root, char *name);
2009 static long node_compress(spellinfo_T *spin, wordnode_T *node, hashtab_T *ht, long *tot);
2010 static int node_equal(wordnode_T *n1, wordnode_T *n2);
2011 static void clear_node(wordnode_T *node);
2012 static int put_node(FILE *fd, wordnode_T *node, int idx, int regionmask, int prefixtree);
2015 static int sug_filltable(spellinfo_T *spin, wordnode_T *node, int startwordnr, garray_T *gap);
2098 spell_clear_flags(wordnode_T *node)  in spell_clear_flags()
2100     wordnode_T	*np;  in spell_clear_flags()
2110 spell_print_node(wordnode_T *node, int depth)  in spell_print_node()
2167 spell_print_tree(wordnode_T *root)  in spell_print_tree()
4366     static wordnode_T *
4369     return (wordnode_T *)getroom(spin, sizeof(wordnode_T), TRUE);  in wordtree_alloc()
4432     wordnode_T	*root,  in tree_add_word()
4437     wordnode_T	*node = root;  in tree_add_word()
4438     wordnode_T	*np;  in tree_add_word()
4439     wordnode_T	*copyp, **copyprev;  in tree_add_word()
4440     wordnode_T	**prev = NULL;  in tree_add_word()
4609     static wordnode_T *
4612     wordnode_T *n;  in get_wordnode()
4615 	n = (wordnode_T *)getroom(spin, sizeof(wordnode_T), TRUE);  in get_wordnode()
4637 deref_wordnode(spellinfo_T *spin, wordnode_T *node)  in deref_wordnode()
4639     wordnode_T	*np;  in deref_wordnode()
4661 free_wordnode(spellinfo_T *spin, wordnode_T *n)  in free_wordnode()
4672 wordtree_compress(spellinfo_T *spin, wordnode_T *root, char *name)  in wordtree_compress()
4715     wordnode_T	*node,  in node_compress()
4720     wordnode_T	*np;  in node_compress()
4721     wordnode_T	*tp;  in node_compress()
4722     wordnode_T	*child;  in node_compress()
4819 node_equal(wordnode_T *n1, wordnode_T *n2)  in node_equal()
4821     wordnode_T	*p1;  in node_equal()
4822     wordnode_T	*p2;  in node_equal()
4861     wordnode_T	*tree;  in write_vim_spell()
5273 clear_node(wordnode_T *node)  in clear_node()
5275     wordnode_T	*np;  in clear_node()
5304     wordnode_T	*node,  in put_node()
5311     wordnode_T	*np;  in put_node()
5683     wordnode_T	*node,  in sug_filltable()
5687     wordnode_T	*p, *np;  in sug_filltable()
5794     wordnode_T	*tree;  in sug_write()