HomeSort by: relevance | last modified time | path
    Searched refs:kk (Results 1 - 25 of 53) sorted by relevancy

1 2 3

  /src/distrib/syspkg/sets/base/base-locale-kk/
Makefile 3 PKGBASE=base-locale-kk
  /src/external/bsd/libfido2/dist/fuzz/
prng.c 86 int kk; local
90 for (kk=0;kk<N-M;kk++) {
91 y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
92 mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];
94 for (;kk<N-1;kk++)
    [all...]
  /src/external/bsd/bzip2/dist/
spewG.c 42 int ii, kk, p; local
45 for (kk = 0; kk < MEGABYTES * 515; kk+=3) {
decompress.c 368 Int32 ii, jj, kk; local
369 kk = MTFA_SIZE-1;
372 s->mtfa[kk] = (UChar)(ii * MTFL_SIZE + jj);
373 kk--;
375 s->mtfbase[ii] = kk + 1;
433 Int32 ii, jj, kk, pp, lno, off; local
472 kk = MTFA_SIZE-1;
475 s->mtfa[kk] = s->mtfa[s->mtfbase[ii] + jj];
476 kk--;
478 s->mtfbase[ii] = kk + 1
    [all...]
  /src/external/gpl3/binutils/dist/gprofng/common/
opteron_pcbe.c 383 for (uint_t kk = 0; amd_events && amd_events[kk].name; kk++)
386 hwc_cb (jj, amd_events[kk].name);
389 for (uint_t kk = 0; amd_generic_events && amd_generic_events[kk].name; kk++)
392 hwc_cb (jj, amd_generic_events[kk].name);
410 uint_t kk; local
422 for (kk = 0; amd_events && amd_events[kk].name; kk++
    [all...]
hwctable.c 1823 for (int kk = 0; kk < 2; kk++)
1825 cpcx_attrs[kk] = NULL;
1826 cpcx_std[kk] = NULL;
1827 cpcx_raw[kk] = NULL;
1828 cpcx_hidden[kk] = NULL;
1829 cpcx_max_concurrent[kk] = 0;
1830 cpcx_default_hwcs[kk] = NULL;
1831 cpcx_orig_default_hwcs[kk] = NULL
    [all...]
  /src/external/gpl3/binutils.old/dist/gprofng/common/
opteron_pcbe.c 383 for (uint_t kk = 0; amd_events && amd_events[kk].name; kk++)
386 hwc_cb (jj, amd_events[kk].name);
389 for (uint_t kk = 0; amd_generic_events && amd_generic_events[kk].name; kk++)
392 hwc_cb (jj, amd_generic_events[kk].name);
410 uint_t kk; local
422 for (kk = 0; amd_events && amd_events[kk].name; kk++
    [all...]
hwctable.c 1823 for (int kk = 0; kk < 2; kk++)
1825 cpcx_attrs[kk] = NULL;
1826 cpcx_std[kk] = NULL;
1827 cpcx_raw[kk] = NULL;
1828 cpcx_hidden[kk] = NULL;
1829 cpcx_max_concurrent[kk] = 0;
1830 cpcx_default_hwcs[kk] = NULL;
1831 cpcx_orig_default_hwcs[kk] = NULL
    [all...]
  /src/games/larn/
display.c 287 int i, j, kk; local
305 else if ((kk = mitem[j][i]) != 0)
306 screen[j][i] = monstnamelist[kk];
307 else if ((kk = item[j][i]) == OWALL)
331 for (kk = j; kk <= j + 3; kk++)
332 if (screen[kk][i] != ' ')
333 kk = 1000;
334 if (kk < 1000)
380 int i, j, kk, mm; local
501 int kk, mm, i, j; local
    [all...]
  /src/sys/crypto/adiantum/
adiantum.h 42 uint8_t kk[32]; /* AES key */ member in struct:adiantum
  /src/external/lgpl3/gmp/dist/mpn/generic/
rootrem.c 215 mp_bitcnt_t b, kk; local
255 kk = k * xnb; /* number of truncated bits in the input */
281 kk -= xnb;
321 kk = number of truncated bits of the input
327 kk -= (k - 1) * b; /* remaining input bits */
328 /* {rp, rn} = floor({up, un} / 2^kk) */
329 rn = un - kk / GMP_NUMB_BITS;
330 MPN_RSHIFT (rp, up + kk / GMP_NUMB_BITS, rn, kk % GMP_NUMB_BITS);
346 /* if S^k > floor(U/2^kk), the root approximation was too large *
    [all...]
  /src/external/bsd/unbound/dist/validator/
val_kentry.c 54 struct key_entry_key* kk = (struct key_entry_key*)key; local
56 size_t s = sizeof(*kk) + kk->namelen;
57 s += sizeof(*kd) + lock_get_mem(&kk->entry.lock);
83 struct key_entry_key* kk = (struct key_entry_key*)key; local
86 lock_rw_destroy(&kk->entry.lock);
87 free(kk->name);
88 free(kk);
102 key_entry_hash(struct key_entry_key* kk)
104 kk->entry.hash = 0x654
    [all...]
val_kentry.h 107 * @param kk: key entry. The lruhash entry.hash value is filled in.
109 void key_entry_hash(struct key_entry_key* kk);
  /src/dist/pf/
README.NetBSD 141 cvs update -kk -j${VEROLD} -j${VERNEW} -d
148 cvs diff -u -kk -rOPENBSD $A | less
149 cvs diff -u -kk -rOPENBSD | less
154 cvs update -kk -j${VEROLD} -j${VERNEW} -d
161 cvs diff -u -kk -rOPENBSD $B | less
162 cvs diff -u -kk -rOPENBSD | less
170 cvs diff -u -kk -rOPENBSD dist/pf sys/dist/pf | less
221 cvs update -kk -j${VEROLD} -j${VERNEW} -d
225 cvs update -kk -j${VEROLD} -j${VERNEW} -d
274 cvs update -kk -j${VEROLD} -j${VERNEW} -
    [all...]
  /src/external/lgpl3/gmp/dist/rand/
randmt.c 172 int kk; local
174 for (kk = 0; kk < N - M; kk++)
176 y = (mt[kk] & 0x80000000) | (mt[kk + 1] & 0x7FFFFFFF);
177 mt[kk] = mt[kk + M] ^ (y >> 1) ^ ((y & 0x01) != 0 ? MATRIX_A : 0);
179 for (; kk < N - 1; kk++
    [all...]
  /src/external/lgpl3/mpfr/dist/src/
log_ui.c 95 unsigned long N, lgN, i, kk; local
156 kk = k;
158 while ((p % 2) == 0) /* replace p/2^kk by (p/2)/2^(kk-1) */
161 kk --;
171 /* we need at most w/log2(2^kk/|p|) terms for an accuracy of w bits */
175 mpfr_ui_sub (tmp, kk, tmp, MPFR_RNDD);
193 S (P, &q0, B, T, 1, N, p, kk, 0);
218 case is when log(1 + p/2^kk) = log(2/3) ~ -0.405, and with n=3 which
  /src/sys/external/isc/atheros_hal/dist/ar5212/
ar2316.c 308 uint16_t ii, kk; local
326 kk = VpdList[idxL];
328 kk = (uint16_t)
332 retVpdList[pdGainIdx][ii] = kk;
373 uint32_t ii, jj, kk; local
421 for (kk = 0; kk < (uint16_t)(Pmax_t2[numPdGainsUsed] - Pmin_t2[numPdGainsUsed]); kk++) {
422 VpdTable_I[numPdGainsUsed][kk] =
425 (int16_t)VpdTable_L[numPdGainsUsed][kk], (int16_t)VpdTable_R[numPdGainsUsed][kk])
    [all...]
ar2317.c 285 uint16_t ii, kk; local
303 kk = VpdList[idxL];
305 kk = (uint16_t)
309 retVpdList[pdGainIdx][ii] = kk;
351 uint32_t ii, jj, kk; local
399 for (kk = 0; kk < (uint16_t)(Pmax_t2[numPdGainsUsed] - Pmin_t2[numPdGainsUsed]); kk++) {
400 VpdTable_I[numPdGainsUsed][kk] =
403 (int16_t)VpdTable_L[numPdGainsUsed][kk], (int16_t)VpdTable_R[numPdGainsUsed][kk])
    [all...]
ar2413.c 302 uint16_t ii, kk; local
320 kk = VpdList[idxL];
322 kk = (uint16_t)
326 retVpdList[pdGainIdx][ii] = kk;
367 uint32_t ii, jj, kk; local
415 for (kk = 0; kk < (uint16_t)(Pmax_t2[numPdGainsUsed] - Pmin_t2[numPdGainsUsed]); kk++) {
416 VpdTable_I[numPdGainsUsed][kk] =
419 (int16_t)VpdTable_L[numPdGainsUsed][kk], (int16_t)VpdTable_R[numPdGainsUsed][kk])
    [all...]
ar2425.c 304 uint16_t ii, kk; local
322 kk = VpdList[idxL];
324 kk = (uint16_t)
328 retVpdList[pdGainIdx][ii] = kk;
366 uint32_t ii, jj, kk; local
422 for (kk = 0; kk < (uint16_t)(Pmax_t2[numPdGainsUsed] - Pmin_t2[numPdGainsUsed]); kk++) {
423 VpdTable_I[numPdGainsUsed][kk] =
426 (int16_t)VpdTable_L[numPdGainsUsed][kk], (int16_t)VpdTable_R[numPdGainsUsed][kk])
    [all...]
ar5413.c 338 uint16_t ii, kk; local
356 kk = VpdList[idxL];
358 kk = (uint16_t)
362 retVpdList[pdGainIdx][ii] = kk;
403 uint32_t ii, jj, kk; local
451 for (kk = 0; kk < (uint16_t)(Pmax_t2[numPdGainsUsed] - Pmin_t2[numPdGainsUsed]); kk++) {
452 VpdTable_I[numPdGainsUsed][kk] =
455 (int16_t)VpdTable_L[numPdGainsUsed][kk], (int16_t)VpdTable_R[numPdGainsUsed][kk])
    [all...]
ar5112.c 353 uint32_t ii, jj, kk; local
405 kk = 0;
409 if (kk > 1) {
415 xgainList[kk++] = (uint16_t)jj;
422 kk = 0;
436 OS_MEMCPY(&powTableLXPD[kk][0], &tmpPowerTable[0],
450 OS_MEMCPY(&powTableLXPD[kk][0], &tmpPowerTable[0],
464 OS_MEMCPY(&powTableHXPD[kk][0], &tmpPowerTable[0],
467 kk++;
472 kk = chan_idx_R - chan_idx_L
    [all...]
  /src/external/mpl/bind/dist/bin/dnssec/
dnssec-ksr.c 1068 for (dns_kasp_key_t *kk = ISC_LIST_HEAD(dns_kasp_keys(kasp));
1069 kk != NULL; kk = ISC_LIST_NEXT(kk, link))
1071 if (dns_kasp_key_ksk(kk) && !ksr->ksk) {
1074 } else if (dns_kasp_key_zsk(kk) && ksr->ksk) {
1078 ksr->alg = dns_kasp_key_algorithm(kk);
1079 ksr->lifetime = dns_kasp_key_lifetime(kk);
1080 ksr->keystore = dns_kasp_key_keystore(kk);
1081 ksr->size = dns_kasp_key_size(kk);
    [all...]
  /src/games/adventure/
main.c 67 struct text *kk; local
107 kk = &stext[loc];
108 if ((abb[loc] % abbnum) == 0 || kk->seekadr == 0)
109 kk = &ltext[loc];
115 kk = &rtext[16];
122 speak(kk);
  /src/external/mpl/bind/dist/bin/tests/system/statschannel/
generic.py 153 for kk, vv in v.items():
154 expected[k][kk] += vv

Completed in 39 milliseconds

1 2 3