Searched refs:nitems (Results 1 - 12 of 12) sorted by relevance
/darwin-on-arm/xnu/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) { 286 seg->sects.nitems * sizeof(*reorder_buffer)); 289 while (legacy_index < section_order->nitems) { 300 while (legacy_index < section_order->nitems) { 319 while (sect_index < seg->sects.nitems) { 384 kxld_free(reorder_buffer, seg->sects.nitems * sizeof(*reorder_buffer)); 491 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...] |
H A D | kxld_vtable.c | 227 for (i = 0; i < vtable->entries.nitems; ++i) { 292 i < vtable->entries.nitems; 384 i < vtable->entries.nitems; 499 require_action(vtable->entries.nitems >= super_vtable->entries.nitems, finish, 504 for (i = 0; i < super_vtable->entries.nitems; ++i) { 653 for (i = 0; i < vtable->entries.nitems; ++i) {
|
H A D | kxld_object.c | 290 for (i = 0; i < object->segs.nitems; ++i) { 681 for (j = 0; j < seg->sects.nitems; ++j, ++secti) { 756 object->sects.nitems); 762 for (i = 0, k = 0; i < object->segs.nitems; ++i) { 765 for (j = 0; j < seg->sects.nitems; ++j, ++k) { 1063 for (i = 0; i < object->segs.nitems; ++i) { 1103 for (i = 0; i < object->segs.nitems; ++i) { 1167 for (i = 0; i < object->segs.nitems; ++i) { 1197 for (i = 0; i < object->sects.nitems; ++i) { 1269 if (sectnum < object->sects.nitems) { [all...] |
H A D | kxld.c | 391 for (i = 0; i < context->dependencies.nitems; ++i) { 431 for (i = 0; i < context->objects.nitems; ++i) { 512 for (i = 0; i < context->objects.nitems; ++i) { 518 for (i = 0; i < context->dependencies.nitems; ++i) {
|
H A D | kxld_symtab.c | 319 return symtab->syms.nitems; 340 for (i = 0; i < symtab->syms.nitems; ++i) { 524 for (idx = iter->idx; idx < iter->symtab->syms.nitems; ++idx) { 663 u_int symindex = symtab->syms.nitems; 692 for (; iter->idx < iter->symtab->syms.nitems; ++iter->idx) {
|
H A D | kxld_kext.c | 148 for (i = 0; i < kext->vtables.nitems; ++i) { 345 for (i = 0; i < kext->vtables.nitems; ++i) { 532 require_action(i == kext->vtables.nitems, finish, 1004 kxld_dict_string_cmp, kext->vtables.nitems); 1007 for (i = 0; i < kext->vtables.nitems; ++i) {
|
H A D | kxld_sect.c | 250 return sect->relocs.nitems; 293 for (i = 0; i < sect->relocs.nitems; ++i) { 610 for (i = 0; i < sect->relocs.nitems; ++i) {
|
H A D | kxld_reloc.c | 498 for (i = 0; i < relocs->nitems; ++i) { 503 if (i >= relocs->nitems) { 938 for (i = 0; i < sectarray->nitems; ++i) { 991 for (i = 0; i < relocs->nitems; ++i) { 1018 for (i = 0; i < relocs->nitems; ++i) { 1063 require_action(i < relocs->nitems, finish, rval=KERN_FAILURE);
|
/darwin-on-arm/xnu/libkern/kxld/tests/ |
H A D | kxld_array_test.c | 63 assert(array.nitems == titems); 89 assert(array.nitems == titems); 134 assert(array.nitems == titems);
|
Completed in 70 milliseconds