Lines Matching refs:aj
135 const u_char **an, *t, **aj, **top[256];
208 * before aj, and in bin[c], items from top[c] on.
212 * aj = bottom of 1st disordered bin.
214 * Once the 1st disordered bin is done, ie. aj >= ak,
215 * aj<-aj + count[c] connects the bins in a linked list;
218 for (aj = a; aj < an; *aj = r, aj += count[c], count[c] = 0)
219 for (r = *aj; aj < (ak = --top[c = tr[r[i]]]);)