Searched refs:nkeys (Results 1 - 25 of 55) sorted by relevance

123

/macosx-10.10/Heimdal-398.1.2/lib/kadm5/
H A Ddefault_keys.c40 print_keys(krb5_context context, Key *keys, size_t nkeys) argument
48 for (i = 0; i < nkeys; i++) {
85 size_t nkeys; local
88 ret = hdb_generate_key_set(context, principal, 0, NULL, &keys, &nkeys,
93 print_keys(context, keys, nkeys);
95 hdb_free_keys(context, nkeys, keys);
/macosx-10.10/tcl-105/tcl_ext/mk4tcl/metakit/examples/
H A Dmkhash.cpp66 int nkeys = 1; local
83 nkeys = 2;
106 data = data.Hash(map, nkeys);
108 data = data.Ordered(nkeys);
150 data = data.Hash(map, nkeys);
H A Dslow.tcl100 set nkeys [llength $keys]
101 set mode "$type$nkeys"
105 timedRun $mode-fill 1 fill$nkeys $i
108 timedRun $mode-find 10000 find$nkeys $w
/macosx-10.10/OpenSSH-189/openssh/
H A Dsshconnect.h30 int nkeys; member in struct:Sensitive
H A Dssh-pkcs11-client.c188 int i, nkeys; local
204 nkeys = buffer_get_int(&msg);
205 *keysp = xcalloc(nkeys, sizeof(Key *));
206 for (i = 0; i < nkeys; i++) {
215 nkeys = -1;
218 return (nkeys);
H A Dssh-pkcs11.c385 * add 'wrapped' public keys to the 'keysp' array and increment nkeys.
386 * keysp points to an (possibly empty) array with *nkeys keys.
390 int *nkeys)
463 *keysp = xrealloc(*keysp, *nkeys + 1,
465 (*keysp)[*nkeys] = key;
466 *nkeys = *nkeys + 1;
467 debug("have %d keys", *nkeys);
484 int nkeys, need_finalize = 0; local
551 nkeys
389 pkcs11_fetch_keys(struct pkcs11_provider *p, CK_ULONG slotidx, Key ***keysp, int *nkeys) argument
[all...]
/macosx-10.10/BerkeleyDB-21/db/test/
H A Dtest086.tcl55 set nkeys 5
58 puts "\tTest$tnum.b: Fill page with $nkeys small key/data pairs."
61 for { set i 0 } { $i < $nkeys } { incr i } {
68 puts "\tTest$tnum.c: Set cursors on each of $nkeys pairs."
72 $i < $nkeys && [llength $ret] != 0} {\
90 for {set i $nkeys} { $i < $mkeys } { incr i } {
105 for {set i 0} { $i < $nkeys } {incr i} {
116 for {set i $nkeys} { $i < $mkeys } { incr i } {
130 for {set i $nkeys} { $i < $mkeys } { incr i } {
146 for {set i 0} { $i < $nkeys } {inc
[all...]
H A Drecd009.tcl26 set nkeys 5
41 puts "\tRecd009.b: Fill page with $nkeys small key/data pairs."
42 for { set i 1 } { $i <= $nkeys } { incr i } {
54 set newnkeys [expr $nkeys + 1]
76 set abortkeys $nkeys
82 set commitkeys $nkeys
135 proc recd009_split { db txn split method nkeys mkeys } {
145 for {set i $nkeys} { $i <= $mkeys } { incr i } {
163 for {set i $mkeys} { $i >= $nkeys } { set i [expr $i - 1] } {
H A Dtest048.tcl65 set nkeys 5
68 puts "\tTest$tnum.b: Fill page with $nkeys small key/data pairs."
69 for { set i 0 } { $i < $nkeys } { incr i } {
83 puts "\tTest$tnum.c: Set cursors on each of $nkeys pairs."
90 $i < $nkeys && [llength $ret] != 0} {\
105 for {set i $nkeys} { $i < $mkeys } { incr i } {
124 for {set i 0} { $i < $nkeys } {incr i} {
133 for {set i $nkeys} { $i < $mkeys } { incr i } {
147 for {set i 0} { $i < $nkeys } {incr i} {
157 for {set i 0} { $i < $nkeys } {inc
[all...]
H A Dtest088.tcl66 set nkeys 5
69 puts "\tTest$tstn.b: Fill page with $nkeys small key/data pairs."
70 for { set i 0 } { $i < $nkeys } { incr i } {
84 puts "\tTest$tstn.c: Set cursors on each of $nkeys pairs."
94 $i < $nkeys && [llength $ret] != 0} {\
106 for {set i $nkeys} { $i < $mkeys } { incr i } {
129 for {set i 0} { $i < $nkeys } {incr i} {
138 for {set i $nkeys} { $i < $mkeys } { incr i } {
154 for {set i 0} { $i < $nkeys } {incr i} {
164 for {set i 0} { $i < $nkeys } {inc
[all...]
H A Dtest078.tcl9 proc test078 { method { nkeys 100 } { pagesize 512 } { tnum "078" } args } {
36 set nkeys 50
55 for { set i 1 } { $i <= $nkeys } { incr i } {
77 for { set i 1 } { $i <= $nkeys } { incr i } {
123 for { set i 1 } { $i <= $nkeys } { incr i } {
142 for { set i 1 } { $i <= $nkeys } { incr i } {
151 for { set i 1 } { $i <= $nkeys } { incr i } {
189 for { set i 1 } { $i <= $nkeys } { incr i } {
213 for { set i 1 } { $i <= $nkeys } { incr i } {
230 for { set i 1 } { $i <= $nkeys } { inc
[all...]
H A Dmdbscript.tcl96 set nkeys [db_init $db 0]
97 puts "Initial number of keys: $nkeys"
132 proc rand_key { method nkeys renum procs} {
134 return [berkdb random_int 1 [expr $nkeys - $procs]]
136 return [berkdb random_int 1 $nkeys]
138 return [berkdb random_int 0 [expr $nkeys - 1]]
166 set k [rand_key $method $nkeys $renum $procs]
187 set k [rand_key $method $nkeys $renum $procs]
205 set k [rand_key $method $nkeys $renum $procs]
246 set k [rand_key $method $nkeys
[all...]
H A Dtest047.tcl59 set nkeys 20
62 puts "\tTest$tnum.b: Fill page with $nkeys small key/data pairs."
63 for { set i 0 } { $i < $nkeys } { incr i } {
126 set nkeys 10
127 puts "\tTest$tnum.f: Fill page with $nkeys pairs, one set of dups."
128 for {set i 0} { $i < $nkeys } {incr i} {
143 for {set i 0} { $i < $nkeys } {incr i} {
194 set nkeys 10
197 puts "\tTest$tnum.i: Fill page with $nkeys pairs and $ndups dups."
198 for {set i 0} { $i < $nkeys } { inc
[all...]
H A Drecd010.tcl219 proc recd010_split { db txn split nkeys mkeys } {
228 set numdups [expr $mkeys / $nkeys]
230 set kvals $nkeys
234 "\tRecd010_split: Add $nkeys keys, with $numdups duplicates each to force split."
235 for {set k 0} { $k < $nkeys } { incr k } {
250 "\tRecd010_split: Delete $nkeys keys to force reverse split."
251 for {set k 0} { $k < $nkeys } { incr k } {
H A Dtest068.tcl35 set nkeys 1000
46 set nkeys 100
51 # Create a list of $nkeys words to insert into db.
57 while { [gets $did str] != -1 && $count < $nkeys } {
63 # Sanity check: did we get $nkeys words?
64 error_check_good enough_keys [llength $wordlist] $nkeys
203 while { $count < $nkeys } {
H A Dtest052.tcl54 # keep nkeys even
55 set nkeys 20
58 puts "\tTest052: Fill page with $nkeys small key/data pairs."
59 for { set i 1 } { $i <= $nkeys } { incr i } {
92 set i [expr $nkeys/2]
106 [lindex [lindex [$dbc get -current] 0] 0] $keys([expr $nkeys/2 - 1])
109 set i [expr $nkeys/2 ]
123 # key: $nkeys/2, data: $nkeys/2 + 2
132 # should be { keys($nkeys/
[all...]
H A Dtest077.tcl9 proc test077 { method { nkeys 1000 } { tnum "077" } args } {
49 for { set i 1 } { $i <= $nkeys } { incr i } {
H A Dsdbutils.tcl19 proc subdb_build { name nkeys ndups dup_interval method psize subdb dbargs} {
43 $nkeys keys with $ndups duplicates at interval of $dup_interval"
47 $nkeys unique keys of pagesize $psize"
50 # so skip ahead in the dict by nkeys * iteration
53 { $count < [expr $nkeys * $dup_interval] } {
62 for { set count 0 } { [gets $did str] != -1 && $count < $nkeys } {
92 set num [expr $nkeys * $dup_interval]
H A Dtest050.tcl58 # keep nkeys even
59 set nkeys 20
63 puts "\tTest$tstn: Fill page with $nkeys small key/data pairs."
64 for { set i 1 } { $i <= $nkeys } { incr i } {
96 for {set i 0} { $i < $nkeys } {incr i} {
150 # should be $nkeys + 2 keys, starting at 1
152 $i <= $nkeys && [llength $ret] != 0 } {\
163 # we should have ($nkeys + 2) keys, ordered:
164 # DATAPUTBEFORE, DATAPUTAFTER, DATAOVER1, data1, ..., data$nkeys
/macosx-10.10/Heimdal-398.1.2/lib/hx509/
H A Dcollector.c290 size_t i, nkeys; local
294 for (i = 0, nkeys = 0; i < c->val.len; i++)
296 nkeys++;
298 *keys = calloc(nkeys + 1, sizeof(**keys));
304 for (i = 0, nkeys = 0; i < c->val.len; i++) {
306 (*keys)[nkeys++] = c->val.data[i]->private_key;
310 (*keys)[nkeys] = NULL;
/macosx-10.10/dyld-353.2.1/include/
H A Dobjc-shared-cache.h896 static int inittab(bstuff *tabb, ub4 blen, key *keys, ub4 nkeys, int complete) argument
908 for (i = 0; i < nkeys; i++) {
934 static void initnorm(key *keys, ub4 nkeys, ub4 alen, ub4 blen, ub4 smax, ub8 salt) argument
944 for (i = 0; i < nkeys; i++) {
1031 static int augment(bstuff *tabb, hstuff *tabh, qstuff *tabq, ub4 blen, ub4 *scramble, ub4 smax, bstuff *item, ub4 nkeys, argument
1040 // ub4 nkeys; /* final hash must be in 0..nkeys-1 */
1114 static int perfect(bstuff *tabb, hstuff *tabh, qstuff *tabq, ub4 blen, ub4 smax, ub4 *scramble, ub4 nkeys) argument
1120 fprintf(stderr, " blen %d smax %d nkeys %d\n", blen, smax, nkeys);
1147 initalen(ub4 *alen, ub4 *blen, ub4 smax, ub4 nkeys) argument
1204 findhash(bstuff **tabb, ub4 *alen, ub4 *blen, ub8 *salt, ub4 *scramble, ub4 smax, key *keys, ub4 nkeys) argument
1309 getkeys(key **keys, ub4 *nkeys, const string_map& strings) argument
1327 ub4 nkeys; /* number of keys */ local
[all...]
/macosx-10.10/groff-38/groff/src/libs/libbib/
H A Dlinear.cpp362 : ignore_fields(ign), truncate_len(trunc), keys(0), nkeys(0)
383 keys[nkeys++] = new bmpattern(start, p - start);
385 assert(nkeys <= nk);
386 if (nkeys == 0) {
394 for (int i = 0; i < nkeys; i++)
405 if (nkeys == 0)
414 for (i = 1; i < nkeys; i++)
417 if (i >= nkeys) {
/macosx-10.10/groff-38/groff/src/include/
H A Dsearch.h43 int nkeys; member in class:linear_searcher
/macosx-10.10/Libc-1044.1.2/db/hash/FreeBSD/
H A Dhash.h79 int32_t nkeys; /* Number of keys in hash table */ member in struct:hashhdr
285 #define NKEYS hdr.nkeys
/macosx-10.10/bind9-45.101/bind9/lib/dns/include/dns/
H A Ddnssec.h166 unsigned int *nkeys);
172 unsigned int *nkeys);

Completed in 204 milliseconds

123