Home
last modified time | relevance | path

Searched refs:element_size (Results 1 – 6 of 6) sorted by relevance

/malloc/
A Ddynarray_resize_clear.c24 void *scratch, size_t element_size) in __libc_dynarray_resize_clear() argument
27 if (!__libc_dynarray_resize (list, size, scratch, element_size)) in __libc_dynarray_resize_clear()
31 memset (array + (old_size * element_size), 0, in __libc_dynarray_resize_clear()
32 (size - old_size) * element_size); in __libc_dynarray_resize_clear()
A Ddynarray_emplace_enlarge.c27 void *scratch, size_t element_size) in __libc_dynarray_emplace_enlarge() argument
34 if (element_size < 4) in __libc_dynarray_emplace_enlarge()
36 else if (element_size < 8) in __libc_dynarray_emplace_enlarge()
55 if (INT_MULTIPLY_WRAPV (new_allocated, element_size, &new_size)) in __libc_dynarray_emplace_enlarge()
63 memcpy (new_array, list->array, list->used * element_size); in __libc_dynarray_emplace_enlarge()
A Ddynarray.h130 void *scratch, size_t element_size);
139 void *scratch, size_t element_size);
144 void *scratch, size_t element_size);
161 size_t element_size,
A Ddynarray_resize.c27 void *scratch, size_t element_size) in __libc_dynarray_resize() argument
41 if (INT_MULTIPLY_WRAPV (size, element_size, &new_size_bytes)) in __libc_dynarray_resize()
53 memcpy (new_array, list->array, list->used * element_size); in __libc_dynarray_resize()
A Dalloc_buffer_alloc_array.c23 __libc_alloc_buffer_alloc_array (struct alloc_buffer *buf, size_t element_size, in __libc_alloc_buffer_alloc_array() argument
30 bool overflow = __builtin_mul_overflow (element_size, count, &size); in __libc_alloc_buffer_alloc_array()
A Ddynarray_finalize.c25 void *scratch, size_t element_size, in __libc_dynarray_finalize() argument
45 size_t allocation_size = used * element_size; in __libc_dynarray_finalize()

Completed in 10 milliseconds