608     int		depth;  in tree_count_words()  local
618     depth = 0;  in tree_count_words()
619     while (depth >= 0 && !got_int)  in tree_count_words()
621 	if (curi[depth] > byts[arridx[depth]])  in tree_count_words()
624 	    idxs[arridx[depth]] = wordcount[depth];  in tree_count_words()
625 	    if (depth > 0)  in tree_count_words()
626 		wordcount[depth - 1] += wordcount[depth];  in tree_count_words()
628 	    --depth;  in tree_count_words()
634 	    n = arridx[depth] + curi[depth];  in tree_count_words()
635 	    ++curi[depth];  in tree_count_words()
641 		++wordcount[depth];  in tree_count_words()
648 		    ++curi[depth];  in tree_count_words()
654 		++depth;  in tree_count_words()
655 		arridx[depth] = idxs[n];  in tree_count_words()
656 		curi[depth] = 1;  in tree_count_words()
657 		wordcount[depth] = 0;  in tree_count_words()
2090 #define PRINTSOME(l, depth, fmt, a1, a2) vim_snprintf(l + depth * PRINTWIDTH, \  argument
2091 	    PRINTLINESIZE - PRINTWIDTH * depth, fmt, a1, a2)
2110 spell_print_node(wordnode_T *node, int depth)  in spell_print_node()  argument
2115 	PRINTSOME(line1, depth, "(%d)", node->wn_nr, 0);  in spell_print_node()
2116 	PRINTSOME(line2, depth, "    ", 0, 0);  in spell_print_node()
2117 	PRINTSOME(line3, depth, "    ", 0, 0);  in spell_print_node()
2129 		PRINTSOME(line1, depth, " %c -> ", node->wn_byte, 0);  in spell_print_node()
2132 		PRINTSOME(line1, depth, " %c ???", node->wn_byte, 0);  in spell_print_node()
2135 	    PRINTSOME(line1, depth, " $    ", 0, 0);  in spell_print_node()
2137 	PRINTSOME(line2, depth, "%d/%d    ", node->wn_nr, node->wn_refs);  in spell_print_node()
2140 	    PRINTSOME(line3, depth, " |    ", 0, 0);  in spell_print_node()
2142 	    PRINTSOME(line3, depth, "      ", 0, 0);  in spell_print_node()
2153 	    spell_print_node(node->wn_child, depth + 1);  in spell_print_node()
2161 	    spell_print_node(node->wn_sibling, depth);  in spell_print_node()
5550     int		depth;  in sug_filltree()  local
5579     depth = 0;  in sug_filltree()
5580     while (depth >= 0 && !got_int)  in sug_filltree()
5582 	if (curi[depth] > byts[arridx[depth]])  in sug_filltree()
5585 	    idxs[arridx[depth]] = wordcount[depth];  in sug_filltree()
5586 	    if (depth > 0)  in sug_filltree()
5587 		wordcount[depth - 1] += wordcount[depth];  in sug_filltree()
5589 	    --depth;  in sug_filltree()
5596 	    n = arridx[depth] + curi[depth];  in sug_filltree()
5597 	    ++curi[depth];  in sug_filltree()
5603 		tword[depth] = NUL;  in sug_filltree()
5614 		++wordcount[depth];  in sug_filltree()
5625 		    ++curi[depth];  in sug_filltree()
5631 		tword[depth++] = c;  in sug_filltree()
5632 		arridx[depth] = idxs[n];  in sug_filltree()
5633 		curi[depth] = 1;  in sug_filltree()
5634 		wordcount[depth] = 0;  in sug_filltree()