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

  /src/external/gpl2/groff/dist/src/libs/libbib/
linear.cpp 364 : ignore_fields(ign), truncate_len(trunc), keys(0), nkeys(0)
385 keys[nkeys++] = new bmpattern(start, p - start);
387 assert(nkeys <= nk);
388 if (nkeys == 0) {
396 for (int i = 0; i < nkeys; i++)
407 if (nkeys == 0)
416 for (i = 1; i < nkeys; i++)
419 if (i >= nkeys) {
  /src/external/gpl2/groff/dist/src/include/
search.h 45 int nkeys; member in class:linear_searcher
  /src/lib/libpam/modules/pam_ssh/
pam_ssh.c 171 int nkeys, nullok, pam_err, pass; local
189 nkeys = 0;
209 ++nkeys;
221 if (nkeys == 0 && pass == 1 &&
229 if (nkeys == 0)
  /src/lib/libc/db/hash/
hash.h 84 int32_t nkeys; /* Number of keys in hash table */ member in struct:hashhdr
293 #define NKEYS hdr.nkeys
hash.c 229 "NKEYS ", hashp->NKEYS);
285 hashp->NKEYS = 0;
404 hashp->NKEYS, hashp->MAX_BUCKET, hashp->nsegs);
968 P_32_COPY(srcp->nkeys, destp->nkeys);
999 M_32_SWAP(hdrp->nkeys);
  /src/lib/libc/db/btree/
bt_debug.c 306 unsigned long ifree, lfree, nkeys; local
313 nkeys = ifree = lfree = 0;
326 nkeys += NEXTINDEX(h);
351 levels, levels == 1 ? "" : "s", nkeys);
  /src/games/arithmetic/
arithmetic.c 98 static int nkeys = sizeof(defaultkeys) - 1; variable
127 nkeys = p - optarg;
199 op = keys[random() % nkeys];
  /src/sys/dev/bluetooth/
btkbd.c 468 #define ADDKEY(c) ibuf[nkeys++] = (c)
479 int nkeys, i, j; local
499 nkeys = 0;
544 if (nkeys == 0)
555 for (i = j = 0 ; i < nkeys ; i++) {
595 for (i = 0 ; i < nkeys ; i++) {
  /src/sys/dev/hid/
hidkbd.c 482 int nkeys, i, j; local
484 #define ADDKEY(c) ibuf[nkeys++] = (c)
514 nkeys = 0;
555 if (nkeys == 0)
560 memcpy(kbd->sc_pollchars, ibuf, nkeys * sizeof(u_int16_t));
561 kbd->sc_npollchar = nkeys;
573 for (i = j = 0; i < nkeys; i++) {
594 for (i = 0; i < nkeys; i++) {
619 for (i = 0; i < nkeys; i++) {
  /src/sys/dev/usb/
ukbd.c 779 int nkeys, i; local
785 KASSERT(nkeys < MAXKEYS); \
786 ibuf[nkeys++] = (c); \
823 nkeys = 0;
840 if (nkeys == 0)
845 memcpy(sc->sc_pollchars, ibuf, nkeys * sizeof(uint16_t));
846 sc->sc_npollchar = nkeys;
857 for (i = j = 0; i < nkeys; i++) {
904 for (i = 0; i < nkeys; i++) {
  /src/external/bsd/openldap/dist/servers/slapd/
schema_init.c 940 ber_len_t i, nkeys; local
949 nkeys = 0;
955 nkeys += index_substr_if_maxlen -
958 nkeys += values[i].bv_len - (index_substr_if_minlen - 1);
964 nkeys += values[i].bv_len - (index_substr_any_len - 1);
970 nkeys += index_substr_if_maxlen -
973 nkeys += values[i].bv_len - (index_substr_if_minlen - 1);
978 if( nkeys == 0 ) {
984 keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
993 nkeys = 0
1058 ber_len_t nkeys = 0; local
    [all...]
  /src/external/bsd/openldap/dist/libraries/liblmdb/
mdb.c 1663 unsigned int i, nkeys, nsize, total = 0; local
1686 nkeys = NUMKEYS(mp);
1687 fprintf(stderr, "%s %"Z"u numkeys %d%s\n", type, pgno, nkeys, state);
1689 for (i=0; i<nkeys; i++) {
5364 unsigned int i = 0, nkeys; local
5373 nkeys = NUMKEYS(mp);
5376 nkeys, IS_LEAF(mp) ? "leaf" : "branch", IS_SUBP(mp) ? "sub-" : "",
5380 high = nkeys - 1;
5441 *exactp = (rc == 0 && nkeys > 0);
5444 if (i >= nkeys)
6155 unsigned int nkeys = NUMKEYS(mp); local
6417 int nkeys = NUMKEYS(mp); local
8189 unsigned nkeys; local
8539 unsigned int nkeys; local
8723 int i, j, split_indx, nkeys, pmax; local
    [all...]
  /src/external/bsd/openldap/dist/contrib/slapd-modules/smbk5pwd/
smbk5pwd.c 372 size_t nkeys; local
404 qpw->rs_new.bv_val, &ent.keys.val, &nkeys);
405 ent.keys.len = nkeys;
  /src/external/bsd/ntp/dist/util/
ntp-keygen.c 170 int nkeys; /* MV keys */ variable
415 nkeys = OPT_VALUE_MV_PARAMS;
419 nkeys = OPT_VALUE_MV_KEYS;
1595 n = nkeys;
ntp-keygen-opts.def 1069 .It Fl V Fl -mv-params Ar nkeys
1071 .Ar nkeys
  /src/external/cddl/osnet/dist/uts/common/dtrace/
dtrace.c 1979 dtrace_dynvar(dtrace_dstate_t *dstate, uint_t nkeys,
1993 ASSERT(nkeys != 0);
2006 for (i = 0; i < nkeys; i++) {
2136 if (dtuple->dtt_nkeys != nkeys)
2139 for (i = 0; i < nkeys; i++, dkey++) {
2247 * size of dtrace_dynvar plus the size of nkeys dtrace_key_t's plus the
2252 for (ksize = 0, i = 0; i < nkeys; i++)
2265 if (sizeof (dtrace_dynvar_t) + sizeof (dtrace_key_t) * (nkeys - 1) +
2388 kdata = (uintptr_t)&dvar->dtdv_tuple.dtt_key[nkeys];
2390 dvar->dtdv_tuple.dtt_nkeys = nkeys;
    [all...]

Completed in 60 milliseconds