HomeSort by: relevance | last modified time | path
    Searched defs:aj (Results 1 - 2 of 2) sorted by relevancy

  /src/lib/libc/stdlib/
radixsort.c 156 const u_char **an, *t, **aj, **top[256]; local
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
    [all...]
  /src/crypto/external/bsd/openssh/dist/
libcrux_mlkem768_sha3.h 6248 int16_t aj = a->elements[(size_t)2U * i + (size_t)1U]; local
6253 libcrux_secrets_int_as_i32_f5(aj) * libcrux_secrets_int_as_i32_f5(bj);
6266 libcrux_secrets_int_as_i32_f5(aj) * libcrux_secrets_int_as_i32_f5(bi);

Completed in 32 milliseconds