Lines Matching refs:ak
132 const u_char **ak, *r;
151 for (ak = a; ak < an;) {
152 c = tr[(*ak++)[i]];
186 top[0] = ak = a + count[0];
188 ak = a;
199 push(ak, *cp, i+1);
201 top[cp-count] = ak += *cp;
211 * ak = top[r[i]] = location to put the next element.
214 * Once the 1st disordered bin is done, ie. aj >= ak,
219 for (r = *aj; aj < (ak = --top[c = tr[r[i]]]);)
220 swap(*ak, r, t);
231 const u_char **ak, **ai;
247 for (ak = a + n; --ak >= a;) {
248 c = tr[(*ak)[i]];
264 top[0] = ak = a + count[0];
267 ak = a;
279 push(ak, c, i+1);
281 top[cp-count] = ak += c;
287 for (ak = ta + n, ai = a+n; ak > ta;) /* Copy to temp. */
288 *--ak = *--ai;
289 for (ak = ta+n; --ak >= ta;) /* Deal to piles. */
290 *--top[tr[(*ak)[i]]] = *ak;
299 const u_char **ak, **ai, *s, *t;
301 for (ak = a+1; --n >= 1; ak++)
302 for (ai = ak; ai > a; ai--) {