Lines Matching defs:aj
156 const u_char **an, *t, **aj, **top[256];
221 * before aj, and in bin[c], items from top[c] on.
225 * aj = bottom of 1st disordered bin.
227 * Once the 1st disordered bin is done, ie. aj >= ak,
228 * aj<-aj + count[c] connects the bins in a linked list;
231 for (aj = a; aj < an; *aj = r, aj += count[c], count[c] = 0)
232 for (r = *aj; aj < (ak = --top[c = tr[r[i]]]);)