2009 static long node_compress(spellinfo_T *spin, wordnode_T *node, hashtab_T *ht, long *tot);
4676     long	    tot = 0;  in wordtree_compress()  local
4684 	n = node_compress(spin, root->wn_sibling, &ht, &tot);  in wordtree_compress()
4690 	    if (tot > 1000000)  in wordtree_compress()
4691 		perc = (tot - n) / (tot / 100);  in wordtree_compress()
4692 	    else if (tot == 0)  in wordtree_compress()
4695 		perc = (tot - n) * 100 / tot;  in wordtree_compress()
4698 						       name, n, tot, tot - n, perc);  in wordtree_compress()
4717     long	*tot)	    // total count of nodes before compressing,  in node_compress()  argument
4741 	    compressed += node_compress(spin, child, ht, tot);  in node_compress()
4778     *tot += len + 1;	// add one for the node that stores the length  in node_compress()