/macosx-10.10/BerkeleyDB-21/db/test/ |
H A D | test082.tcl | 9 proc test082 { method {dir -prevnodup} {nitems 100} {tnum "082"} args} { 12 eval {test074 $method $dir $nitems $tnum} $args
|
H A D | test091.tcl | 10 {nproducers 2} {nitems 1000} {start 0 } {tnum "091"} args} { 16 $nconsumers $nproducers $nitems WAIT $start -txn $tnum } $args 18 $nconsumers $nproducers $nitems WAIT $start -cdb $tnum } $args
|
H A D | test071.tcl | 10 proc test071 { method {nconsumers 1} {nproducers 1} {nitems 10000} \ 14 $nconsumers $nproducers $nitems $mode $start $txn $tnum $args
|
H A D | test083.tcl | 53 for { set nitems 10 } { $nitems <= $maxitems }\ 54 { set nitems [expr $nitems * $step] } { 65 t83_build $db $nitems $env $txnenv 66 t83_test $db $nitems $env $txnenv 72 proc t83_build { db nitems env txnenv } { 75 puts "\tTest083.b: Populating database with $nitems keys" 79 for { set i 0 } { $i < $nitems } { incr i } { 107 proc t83_test { db nitems en [all...] |
H A D | conscript.tcl | 8 # Usage: conscript dir file runtype nitems outputfile tnum args 12 # nitems: number of items to put or get 16 proc consumescript_produce { db_cmd nitems tnum args } { 21 puts "\tTest$tnum: Producer $pid starting, producing $nitems items." 28 for { set ndx 0 } { $ndx < $nitems } { incr ndx } { 45 proc consumescript_consume { db_cmd nitems tnum outputfile mode args } { 49 puts "\tTest$tnum: Consumer $pid starting, seeking $nitems items." 56 for { set ndx 0 } { $ndx < $nitems } { } { 85 set usage "conscript.tcl dir file runtype nitems outputfile tnum" 91 set nitems [linde [all...] |
H A D | test070.tcl | 15 {nitems 1000} {mode CONSUME } {start 0} {txn -txn} {tnum "070"} args } { 70 error_check_good cons_div_evenly [expr $nitems % $nconsumers] 0 71 error_check_good prod_div_evenly [expr $nitems % $nproducers] 0 72 set nperconsumer [expr $nitems / $nconsumers] 73 set nperproducer [expr $nitems / $nproducers] 111 set nitems [expr $start + $nitems] 112 for { set ndx $start } { $ndx < $nitems } { set ndx [expr $ndx + 1] } { 123 incr nitems
|
H A D | recd013.tcl | 20 proc recd013 { method { nitems 100 } args } { 59 # Create a database containing $nitems items, numbered with odds. 63 for { set i 1 } { $i <= 2 * $nitems } { incr i 2 } { 99 for { set i 1 } { $i <= 2 * $nitems } { incr i 2 } { 108 for { set i 2 } { $i <= 2 * $nitems } { incr i 2 } { 131 for { set i 1 } { $i <= 2 * $nitems } { incr i 2 } { 137 for { set i 1 } { $i <= 2 * $nitems } { incr i 2 } { 153 for { set i 2 } { $i <= 2 * $nitems } { incr i 2 } { 170 for { set i 1 } { $i <= 2 * $nitems } { incr i } { 182 set bound [expr 2 * $nitems] [all...] |
H A D | bigfile001.tcl | 13 { nitems 1048576 } { growby 5000 } { growtms 2 } args } { 24 puts "Bigfile001: $method ($args) $nitems * $itemsize bytes of data" 43 for { set i 0 } { $i < $nitems } { incr i } { 49 set pct [expr 100 * $i / $nitems]
|
/macosx-10.10/Libc-1044.1.2/gen/FreeBSD/ |
H A D | scandir.c | 64 size_t nitems = 0; local 95 if (nitems >= arraysz) { 107 names[nitems++] = p; 110 if (nitems && dcomp != NULL) 111 qsort(names, nitems, sizeof(struct dirent *), dcomp); 113 return(nitems); 116 while (nitems > 0) 117 free(names[--nitems]);
|
H A D | scandir_b.c | 64 size_t nitems = 0; local 95 if (nitems >= arraysz) { 107 names[nitems++] = p; 110 if (nitems && dcomp != NULL) 111 qsort_b(names, nitems, sizeof(struct dirent *), dcomp); 113 return(nitems); 116 while (nitems > 0) 117 free(names[--nitems]);
|
/macosx-10.10/xnu-2782.1.97/libkern/kxld/ |
H A D | kxld_array.c | 42 static kern_return_t array_init(KXLDArray *array, size_t itemsize, u_int nitems); 45 static u_int reinit_pools(KXLDArray *array, u_int nitems); 50 kxld_array_init(KXLDArray *array, size_t itemsize, u_int nitems) argument 60 if (!nitems) { 85 * update their internal nitems counts. 87 if (array->maxitems < nitems) { 95 nitems = reinit_pools(array, nitems); 96 require_action(nitems == 0, finish, rval=KERN_FAILURE); 110 rval = array_init(array, itemsize, nitems); 138 array_init(KXLDArray *array, size_t itemsize, u_int nitems) argument 386 kxld_array_resize(KXLDArray *array, u_int nitems) argument 417 reinit_pools(KXLDArray *array, u_int nitems) argument 448 u_int nitems = 0; local [all...] |
H A D | kxld_array.h | 85 u_int nitems; /* The current number of items this array contains */ member in struct:kxld_array 93 u_int nitems; /* The number of items the array contains */ member in struct:kxld_array_pool 104 /* Initializes the array's capacity to a minimum of nitems * itemsize */ 105 kern_return_t kxld_array_init(KXLDArray *array, size_t itemsize, u_int nitems) 116 /* Zeroes out the array and sets nitems to 0 */ 128 /* Returns the item at the specified index, or NULL if idx > nitems */ 145 /* Grows the array to contain a minimum of nitems. If extra memory is needed, 149 kern_return_t kxld_array_resize(KXLDArray *array, u_int nitems)
|
H A D | kxld_seg.c | 158 rval = kxld_array_init(&seg->sects, sizeof(KXLDSect *), sectarray->nitems); 161 for (i = 0; i < sectarray->nitems; ++i) { 187 require_action(segarray->nitems == 1, finish, rval=KERN_FAILURE); 203 for (i = 0; i < seg->sects.nitems; ++i) { 285 seg->sects.nitems * sizeof(*reorder_buffer)); 288 while (legacy_index < section_order->nitems) { 299 while (legacy_index < section_order->nitems) { 318 while (sect_index < seg->sects.nitems) { 383 kxld_free(reorder_buffer, seg->sects.nitems * sizeof(*reorder_buffer)); 490 size += seg->sects.nitems * kxld_sect_get_macho_header_siz [all...] |
H A D | kxld_dict.c | 204 idx = (idx + 1) % dict->buckets.nitems; 210 check(idx < dict->buckets.nitems); 274 u_int nbuckets = (dict->buckets.nitems * 2 + 1); 290 dict->resize_threshold = RESIZE_THRESHOLD(dict->buckets.nitems); 293 for (i = 0; i < dict->resize_buckets.nitems; ++i) { 327 idx = (idx + 1) % dict->buckets.nitems; 386 for (; iter->idx < iter->dict->buckets.nitems; ++(iter->idx)) { 425 return (hash_val % dict->buckets.nitems); 435 return (u_int) (key % dict->buckets.nitems); 445 return (u_int) (key % dict->buckets.nitems); [all...] |
/macosx-10.10/swig-12/Source/DOH/ |
H A D | list.c | 18 int nitems; /* Num items */ member in struct:List 44 nl->nitems = l->nitems; 47 for (i = 0; i < l->nitems; i++) { 67 for (i = 0; i < l->nitems; i++) 82 for (i = 0; i < l->nitems; i++) { 85 l->nitems = 0; 106 pos = l->nitems; 109 if (pos > l->nitems) 110 pos = l->nitems; [all...] |
/macosx-10.10/swig-12/Lib/ |
H A D | cmalloc.i | 64 TYPE *realloc_##NAME(TYPE *ptr, int nitems) 66 TYPE *realloc_##TYPE(TYPE *ptr, int nitems) 70 return (TYPE *) realloc(ptr, nitems*sizeof(TYPE)); 72 return (TYPE *) realloc(ptr, nitems); 77 TYPE *realloc_##NAME(TYPE *ptr, int nitems); 79 TYPE *realloc_##TYPE(TYPE *ptr, int nitems);
|
/macosx-10.10/tcpdump-61/tcpdump/ |
H A D | print-vqp.c | 48 * | Constant | Packet type | Error Code | nitems | 58 u_int8_t nitems; member in struct:vqp_common_header_t 118 u_int8_t nitems; local 146 nitems = vqp_common_header->nitems; 153 nitems, 160 while (nitems > 0 && tlen > 0) { 204 nitems--;
|
/macosx-10.10/curl-83.1.2/curl/tests/libtest/ |
H A D | lib537.c | 105 int nitems, i; local 229 for (nitems = i = 1; nitems <= i; i *= 2) 230 nitems = i; 231 if (nitems > 0x7fff) 232 nitems = 0x40000; 234 num_open.rlim_max = sizeof(*memchunk) * (size_t)nitems; 237 memchunk = malloc(sizeof(*memchunk) * (size_t)nitems); 240 nitems /= 2; 242 } while (nitems [all...] |
H A D | lib518.c | 103 int nitems, i; local 255 for (nitems = i = 1; nitems <= i; i *= 2) 256 nitems = i; 257 if (nitems > 0x7fff) 258 nitems = 0x40000; 260 num_open.rlim_max = sizeof(*memchunk) * (size_t)nitems; 263 memchunk = malloc(sizeof(*memchunk) * (size_t)nitems); 266 nitems /= 2; 268 } while (nitems [all...] |
/macosx-10.10/ncurses-44/ncurses/menu/ |
H A D | m_format.c | 88 total_rows = (menu->nitems - 1) / cols + 1; 90 minimum(menu->nitems, cols) : 91 (menu->nitems - 1) / total_rows + 1;
|
/macosx-10.10/swig-12/Lib/tcl/ |
H A D | std_vector.i | 90 int nitems; 100 &nitems, &listobjv) == TCL_ERROR) 103 for (i = 0; i < nitems; i++) { 119 int nitems; 129 &nitems, &listobjv) == TCL_ERROR) 132 for (i = 0; i < nitems; i++) { 158 int nitems; 169 &nitems, &listobjv) == TCL_ERROR) 172 if (nitems == 0) 187 int nitems; [all...] |
/macosx-10.10/swig-12/Lib/typemaps/ |
H A D | cmalloc.swg | 64 TYPE *realloc_##NAME(TYPE *ptr, size_t nitems) 66 TYPE *realloc_##TYPE(TYPE *ptr, size_t nitems) 70 return (TYPE *) realloc(ptr, nitems*sizeof(TYPE)); 72 return (TYPE *) realloc(ptr, nitems); 77 TYPE *realloc_##NAME(TYPE *ptr, size_t nitems); 79 TYPE *realloc_##TYPE(TYPE *ptr, size_t nitems);
|
/macosx-10.10/libauto-186/tests/ |
H A D | dump.m | 503 uint32_t nitems; 511 uint32_t nitems; 532 uint32_t nitems = 0; 543 descriptor->items[nitems].offset = counter; 544 descriptor->items[nitems].index = index - 1; 545 ++nitems; 555 descriptor->items[nitems].offset = counter; 556 descriptor->items[nitems].index = index - 1; 557 ++nitems; 562 descriptor->nitems [all...] |
/macosx-10.10/dcerpc-61/dcerpc/ncklib/ |
H A D | cominit_ux.c | 398 size_t nitems = 0; local 437 if (nitems >= arraysz) { 450 names[nitems++] = p; 453 if (nitems && dcomp != NULL) 454 qsort(names, nitems, sizeof(struct dirent *), dcomp); 456 return(nitems); 459 while (nitems > 0) 460 free(names[--nitems]);
|
/macosx-10.10/ncurses-44/ncurses/c++/ |
H A D | cursesm.cc | 100 NCursesMenu::mapItems(NCursesMenuItem* nitems[]) argument 104 for (lcv=0; nitems[lcv]->item; ++lcv) 109 for (lcv=0;nitems[lcv]->item;++lcv) { 110 itemArray[lcv] = nitems[lcv]->item; 114 my_items = nitems; 122 NCursesMenu::InitMenu(NCursesMenuItem* nitems[], argument 135 menu = ::new_menu(mapItems(nitems));
|