2001 …info_T *spin, char_u *word, char_u *afflist, afffile_T *affile, hashtab_T *ht, hashtab_T *xht, int…
2009 static long node_compress(spellinfo_T *spin, wordnode_T *node, hashtab_T *ht, long *tot);
3457     hashtab_T	*ht;  in spell_free_aff()  local
3466     for (ht = &aff->af_pref; ; ht = &aff->af_suff)  in spell_free_aff()
3468 	todo = (int)ht->ht_used;  in spell_free_aff()
3469 	for (hi = ht->ht_array; todo > 0; ++hi)  in spell_free_aff()
3479 	if (ht == &aff->af_suff)  in spell_free_aff()
3495     hashtab_T	ht;  in spell_read_dic()  local
3528     hash_init(&ht);  in spell_read_dic()
3633 	hi = hash_lookup(&ht, dw, hash);  in spell_read_dic()
3645 	    hash_add_item(&ht, hi, dw, hash);  in spell_read_dic()
3699     hash_clear(&ht);  in spell_read_dic()
3828     hashtab_T	*ht,  in store_aff_word()  argument
3853     todo = (int)ht->ht_used;  in store_aff_word()
3854     for (hi = ht->ht_array; todo > 0 && retval == OK; ++hi)  in store_aff_word()
4674     hashtab_T	    ht;  in wordtree_compress()  local
4683 	hash_init(&ht);  in wordtree_compress()
4684 	n = node_compress(spin, root->wn_sibling, &ht, &tot);  in wordtree_compress()
4704 	hash_clear(&ht);  in wordtree_compress()
4716     hashtab_T	*ht,  in node_compress()  argument
4741 	    compressed += node_compress(spin, child, ht, tot);  in node_compress()
4745 	    hi = hash_lookup(ht, child->wn_u1.hashkey, hash);  in node_compress()
4775 		hash_add_item(ht, hi, child->wn_u1.hashkey, hash);  in node_compress()