Lines Matching defs:top
137 const u_char **an, *t, **aj, **top[256];
179 * Set top[]; push incompletely sorted bins onto stack.
180 * top[] = pointers to last out-of-place element in bins.
182 * Before permuting: top[c-1] + count[c] = top[c];
183 * during deal: top[c] counts down to top[c-1].
187 if (endch == 0) /* Special case: set top[eos]. */
188 top[0] = ak = a + count[0];
191 top[255] = an;
203 top[cp-count] = ak += *cp;
210 * before aj, and in bin[c], items from top[c] on.
213 * ak = top[r[i]] = location to put the next element.
221 for (r = *aj; aj < (ak = --top[c = tr[r[i]]]);)
235 const u_char **top[256];
266 top[0] = ak = a + count[0];
270 top[255] = a + n;
283 top[cp-count] = ak += c;
292 *--top[tr[(*ak)[i]]] = *ak;