Lines Matching defs:element_count
36 inline static void __set_element_count ( void *p, size_t element_count ) {
37 static_cast <size_t *> (p)[-1] = element_count;
148 size_t calculate_allocation_size_or_throw(size_t element_count,
152 if (mul_overflow(element_count, element_size, &element_heap_size))
168 // __cxa_vec_new2(element_count, element_size, padding_size, constructor,
171 __cxa_vec_new(size_t element_count, size_t element_size, size_t padding_size,
173 return __cxa_vec_new2 ( element_count, element_size, padding_size,
195 __cxa_vec_new2(size_t element_count, size_t element_size, size_t padding_size,
199 element_count, element_size, padding_size);
209 __set_element_count ( vec_base, element_count );
213 __cxa_vec_ctor ( vec_base, element_count, element_size, constructor, destructor );
224 __cxa_vec_new3(size_t element_count, size_t element_size, size_t padding_size,
228 element_count, element_size, padding_size);
238 __set_element_count ( vec_base, element_count );
242 __cxa_vec_ctor ( vec_base, element_count, element_size, constructor, destructor );
261 size_t element_count,
271 for ( idx = 0; idx < element_count;
287 __cxa_vec_ctor(void *array_address, size_t element_count, size_t element_size,
295 for ( idx = 0; idx < element_count; ++idx, ptr += element_size )
308 size_t element_count,
313 size_t idx = element_count;
317 ptr += element_count * element_size; // one past the last element
334 size_t element_count,
339 size_t idx = element_count;
342 ptr += element_count * element_size; // one past the last element
409 const size_t element_count = padding_size ? __get_element_count ( vec_base ) : 0;
410 const size_t heap_block_size = element_size * element_count + padding_size;
414 __cxa_vec_dtor ( array_address, element_count, element_size, destructor );