1266     idx_T	arridx;  in suggest_trie_walk()  local
1339 	    arridx = sp->ts_arridx;	    // current node in the tree  in suggest_trie_walk()
1340 	    len = byts[arridx];		    // bytes in this node  in suggest_trie_walk()
1341 	    arridx += sp->ts_curi;	    // index of current byte  in suggest_trie_walk()
1346 		for (n = 0; n < len && byts[arridx + n] == 0; ++n)  in suggest_trie_walk()
1358 		if (byts[arridx] == 0 || n == (int)STATE_NOPREFIX)  in suggest_trie_walk()
1391 	    if (sp->ts_curi > len || byts[arridx] != 0)  in suggest_trie_walk()
1403 	    flags = (int)idxs[arridx];  in suggest_trie_walk()
1883 	    arridx = sp->ts_arridx;  in suggest_trie_walk()
1884 	    if (sp->ts_curi > byts[arridx])  in suggest_trie_walk()
1896 		arridx += sp->ts_curi++;  in suggest_trie_walk()
1897 		c = byts[arridx];  in suggest_trie_walk()
1930 		    sp->ts_arridx = idxs[arridx];  in suggest_trie_walk()
2685     idx_T	arridx[MAXWLEN];  in find_keepcap_word()  local
2714     arridx[0] = 0;  in find_keepcap_word()
2725 	    if (byts[arridx[depth] + 1] == 0)  in find_keepcap_word()
2762 	    for (tryidx = arridx[depth]; l > 0; --l)  in find_keepcap_word()
2811 		arridx[depth] = tryidx;  in find_keepcap_word()
3362     idx_T	arridx = 0;  in soundfold_find()  local
3377 	len = byts[arridx++];  in soundfold_find()
3382 	if (byts[arridx] == NUL)  in soundfold_find()
3388 	    while (len > 0 && byts[arridx] == NUL)  in soundfold_find()
3390 		++arridx;  in soundfold_find()
3405 	while (byts[arridx] < c)  in soundfold_find()
3408 	    wordnr += idxs[idxs[arridx]];  in soundfold_find()
3409 	    ++arridx;  in soundfold_find()
3413 	if (byts[arridx] != c)	// didn't find the byte  in soundfold_find()
3417 	arridx = idxs[arridx];  in soundfold_find()