Searched refs:arr_size (Results 1 – 5 of 5) sorted by relevance
| /external/valgrind/VEX/priv/ |
| D | host_generic_regs.c | 288 ha->arr_size = 4; in newHInstrArray()
290 ha->arr = LibVEX_Alloc_inline(ha->arr_size * sizeof(HInstr*)); in newHInstrArray()
298 vassert(ha->arr_used == ha->arr_size); in addHInstr_SLOW()
300 HInstr** arr2 = LibVEX_Alloc_inline(ha->arr_size * 2 * sizeof(HInstr*)); in addHInstr_SLOW()
301 for (i = 0; i < ha->arr_size; i++) { in addHInstr_SLOW()
304 ha->arr_size *= 2; in addHInstr_SLOW()
|
| D | host_generic_regs.h | 353 Int arr_size; member
368 if (LIKELY(ha->arr_used < ha->arr_size)) { in addHInstr()
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_linux.cc | 442 int arr_size) { in ReadNullSepFileToArray() argument
446 *arr = (char **)MmapOrDie(arr_size * sizeof(char *), "NullSepFileArray"); in ReadNullSepFileToArray()
457 CHECK_LE(count, arr_size - 1); // FIXME: make this more flexible. in ReadNullSepFileToArray()
|
| /external/protobuf/php/ext/google/protobuf/ |
| D | upb.c | 4596 size_t arr_size; in upb_inttable_compact() local
4609 arr_size = 1; in upb_inttable_compact()
4614 arr_size = max_key + 1; in upb_inttable_compact()
4620 arr_size = 1 << size_lg2; in upb_inttable_compact()
4622 if (arr_count >= arr_size * MIN_DENSITY) { in upb_inttable_compact()
4631 arr_size = UPB_MAX(arr_size, 1); in upb_inttable_compact()
4640 upb_inttable_sizedinit(&new_t, t->t.ctype, arr_size, hashsize_lg2); in upb_inttable_compact()
4646 assert(new_t.array_size == arr_size); in upb_inttable_compact()
|
| /external/protobuf/ruby/ext/google/protobuf_c/ |
| D | upb.c | 4886 size_t arr_size = max[size_lg2] + 1; /* +1 so arr[max] will fit. */ in upb_inttable_compact2() local
4891 upb_inttable_sizedinit(&new_t, t->t.ctype, arr_size, hashsize_lg2, a); in upb_inttable_compact2()
4897 assert(new_t.array_size == arr_size); in upb_inttable_compact2()
|