Searched refs:mod (Results 1 - 4 of 4) sorted by last modified time

/system/security/keystore/
H A Dkeystore.cpp132 const hw_module_t* mod; local
133 rc = hw_get_module_by_class(KEYSTORE_HARDWARE_MODULE_ID, NULL, &mod);
139 rc = keymaster_open(mod, dev);
/system/core/libmincrypt/tools/
H A DDumpPublicKey.java89 BigInteger N0inv = B.subtract(N.modInverse(B)); // -1 / N[0] mod 2^32
95 BigInteger RR = R.multiply(R).mod(N); // 2^4096 mod N
100 long n = N.mod(B).longValue();
114 long rr = RR.mod(B).longValue();
/system/extras/tests/include/
H A DtestUtil.h43 uint32_t testRandMod(uint32_t mod);
/system/extras/tests/lib/testUtil/
H A DtestUtil.c199 * Pseudo randomly returns unsigned integer in the range [0, mod).
204 uint32_t testRandMod(uint32_t mod) argument
210 uint32_t val = (mod <= lrand48maxVal) ? (uint32_t) lrand48() : testRand();
216 * least significant bits. For small mod values this can produce
217 * noticably non-random sequnces. For mod values of less than 2
220 if (mod <= 0x10000) {
223 // If mod less than a byte, can further combine down to
225 if (mod <= 0x100) {
230 return val % mod;

Completed in 56 milliseconds