Searched refs:elem_size (Results 1 – 6 of 6) sorted by relevance
69 size_t elem_size; member76 size_t elem_size, size_t node_size);
40 size_t elem_size, size_t node_size) in util_sparse_array_init() argument43 arr->elem_size = elem_size; in util_sparse_array_init()102 size = arr->elem_size << arr->node_size_log2; in _util_sparse_array_node_alloc()191 return (void *)((char *)node_data + (elem_idx * arr->elem_size)); in util_sparse_array_get()
122 static inline void* __vk_outarray_next(struct __vk_outarray* a, size_t elem_size) { in __vk_outarray_next() argument129 if (a->data != NULL) p = ((uint8_t*)a->data) + (*a->filled_len) * elem_size; in __vk_outarray_next()
202 __vk_outarray_next(struct __vk_outarray *a, size_t elem_size) in __vk_outarray_next() argument212 p = (uint8_t *)a->data + (*a->filled_len) * elem_size; in __vk_outarray_next()
225 result->elem_size = sizeof(int64_t); in QueryControl()228 result->elem_size = result->maximum + 1; in QueryControl()231 result->elem_size = sizeof(int32_t); in QueryControl()
141 static inline void* __vk_outarray_next(struct __vk_outarray* a, size_t elem_size) { in __vk_outarray_next() argument148 if (a->data != NULL) p = ((uint8_t*)a->data) + (*a->filled_len) * elem_size; in __vk_outarray_next()