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

  /src/sys/crypto/cast128/
cast128.h 16 int rounds; /* Number of rounds to use, 12 or 16 */ member in struct:__anon80cd8cdc0108
  /src/share/examples/rump/sdread/
sdread.c 63 int fd, val = 0, rounds = 0; local in function:waitcd
70 if (rounds > 0) {
71 if (rounds == 1) {
81 rounds++;
82 } while (val == 0 || rounds >= 30);
  /src/sys/opencrypto/
gmac.h 46 int rounds; member in struct:_AES_GMAC_CTX
  /src/lib/libcrypt/
bcrypt.c 39 * REPEAT rounds:
63 * You can have up to 2^31 rounds which should be enough for some
71 #define BCRYPT_MINROUNDS 16 /* we have log2(rounds) in salt */
216 u_int32_t rounds, i, k; local in function:__bcrypt
257 if ((rounds = (u_int32_t) 1 << logr) < BCRYPT_MINROUNDS)
260 /* Discard num rounds + "$" identifier */
280 for (k = 0; k < rounds; k++) {
  /src/tests/rump/rumpkern/h_client/
h_stresscli.c 136 int rounds, myport; local in function:main
153 for (rounds = 1; rounds < atoi(argv[1])*10; rounds++) {
  /src/sys/netinet/
tcp_congctl.c 837 int i, rounds = CBRT_ROUNDS; local in function:tcp_cubic_cbrt
851 rounds += 10;
853 for (i = 0; i < rounds; i++)
854 if (rounds == CBRT_ROUNDS)
  /src/sys/dev/marvell/
mvxpsec.c 2940 int KC, BC, ROUNDS;
2946 ROUNDS = 10;
2950 ROUNDS = 12;
2954 ROUNDS = 14;
2968 for(j = 0; (j < KC) && (t < (ROUNDS+1)*BC); j++, t++)
2971 while (t < (ROUNDS+1)*BC) { /* while not enough round key material calculated */
2992 for(j = 0; (j < KC) && (t < (ROUNDS+1)*BC); j++, t++)
3005 int i, rounds, KC; local in function:mv_aes_deckey
3025 rounds = 10;
3029 rounds = 12
    [all...]

Completed in 16 milliseconds