HomeSort by: relevance | last modified time | path
    Searched refs:nk (Results 1 - 6 of 6) sorted by relevancy

  /src/usr.sbin/ypserv/common/
ypdb.c 190 DBT nk, nd; local
193 nk.data = key.dptr;
194 nk.size = key.dsize;
195 status = (db->get)(db, &nk, &nd, 0);
217 DBT nk, nd; local
219 status = (db->seq)(db, &nk, &nd, R_FIRST);
224 retkey.dptr = nk.data;
225 retkey.dsize = nk.size;
241 DBT nk, nd; local
243 status = (db->seq)(db, &nk, &nd, R_NEXT)
264 DBT nk, nd; local
286 DBT nk; local
307 DBT nk, nd; local
    [all...]
  /src/usr.bin/btkey/
btkey.c 57 bool cf, cd, lf, ld, rf, rd, wf, wd, nk; local
62 cf = cd = lf = ld = rf = rd = wf = wd = nk = false;
101 nk = true;
139 if ((lf || ld) && (rf || rd || wf || wd || cf || cd || nk))
142 if (((rf && rd) || (rf && nk) || (rd && nk)) && (wf || wd))
165 if (nk)
  /src/sys/crypto/aes/
aes_ct.c 273 int i, j, k, nk, nkf; local
291 nk = (int)(key_len >> 2);
294 for (i = 0; i < nk; i ++) {
299 for (i = nk, j = 0, k = 0; i < nkf; i ++) {
303 } else if (nk > 6 && j == 4) {
306 tmp ^= skey[(i - nk) << 1];
309 if (++ j == nk) {
349 int i, j, k, nk, nkf; local
366 nk = (int)(key_len >> 2);
369 for (i = 0; i < nk; i ++)
    [all...]
aes_ct64.c 342 int i, j, k, nk, nkf; local
360 nk = (int)(key_len >> 2);
364 for (i = nk, j = 0, k = 0; i < nkf; i ++) {
368 } else if (nk > 6 && j == 4) {
371 tmp ^= skey[i - nk];
373 if (++ j == nk) {
436 int i, j, k, nk, nkf; local
453 nk = (int)(key_len >> 2);
456 for (i = 0; i < nk; i ++) {
460 for (i = nk, j = 0, k = 0; i < nkf; i ++)
    [all...]
  /src/sys/crypto/aes/arch/x86/
aes_sse2_4x32.c 278 int i, j, k, nk, nkf; local
296 nk = (int)(key_len >> 2);
299 for (i = 0; i < nk; i ++) {
304 for (i = nk, j = 0, k = 0; i < nkf; i ++) {
308 } else if (nk > 6 && j == 4) {
311 tmp ^= skey[(i - nk) << 1];
314 if (++ j == nk) {
  /src/games/hack/
hack.mon.c 793 int tmp, nk, x, y; local
812 nk = 1; /* in case we cannot find it in mons */
816 if ((nk = u.nr_killed[tmp]) > MAXMONNO &&
856 if (u.uexp + 1 + (tmp + ((tmp2 <= 0) ? 0 : 4 << (tmp2 - 1))) / nk
862 tmp = (tmp + ((tmp2 < 0) ? 0 : 4 << tmp2)) / nk;

Completed in 25 milliseconds