| /src/lib/libc/stdlib/ |
| radixsort.c | 153 const u_char **ak, *r; local in function:r_sort_a
175 for (ak = a; ak < an;) {
176 c = tr[(*ak++)[i]];
199 top[0] = ak = a + count[0];
201 ak = a;
212 push(ak, *cp, i+1);
214 top[cp-count] = ak += *cp;
224 * ak = top[r[i]] = location to put the next element.
227 * Once the 1st disordered bin is done, ie. aj >= ak,
244 const u_char **ak, **ai; local in function:r_sort_b
316 const u_char **ak, **ai, *s, *t; local in function:simplesort
[all...] |
| /src/usr.bin/sort/ |
| radix_sort.c | 75 RECHEADER **ak, **tai, **lim; local in function:radix_sort
106 for (ak = a, tai = ta; ak < lim; ak++) {
107 hdr = *ak;
141 ak = a;
150 push(ak, c, data_index+1);
152 ak += c;
153 top[cp-count] = ak;
159 for (ak = ta+n; --ak >= ta;) /* Deal to piles. *
170 RECHEADER **ak, **ai; local in function:simplesort
[all...] |
| /src/sys/crypto/aes/arch/x86/ |
| aes_ssse3.c | 198 __m128i k, i, ak, j; local in function:subbytes
201 ak = gf16_inva(k);
203 *io = j ^ gf16_inv(ak ^ gf16_inv(i));
204 *jo = i ^ gf16_inv(ak ^ gf16_inv(j));
|
| /src/sys/crypto/aes/arch/arm/ |
| aes_neon.c | 239 uint8x16_t k, i, ak, j; local in function:subbytes
242 ak = vqtbl1q_u8(inva_, k);
244 *io = j ^ vqtbl1q_u8(inv_, ak ^ vqtbl1q_u8(inv_, i));
245 *jo = i ^ vqtbl1q_u8(inv_, ak ^ vqtbl1q_u8(inv_, j));
|
| /src/usr.sbin/npf/npfctl/ |
| npf_show.c | 640 const struct attr_keyword_mapent *ak = &attr_keyword_map[i]; local in function:npfctl_print_rule
645 if ((attr & ak->mask) == ak->flags) {
646 ctx->fpos += fprintf(ctx->fp, "%s ", ak->val);
|
