diff options
author | Damjan Marion <damarion@cisco.com> | 2022-04-11 18:41:49 +0200 |
---|---|---|
committer | Florin Coras <florin.coras@gmail.com> | 2022-04-12 22:40:52 +0000 |
commit | e4fa1d2f6b8721318c0f104f2615588b5d4e0441 (patch) | |
tree | 70d33a24bae0b9aa993fe6e03960e2b135accb70 /src/vppinfra/vec.c | |
parent | 65e770d895b13a6e5c73d13f436872ea626e47e3 (diff) |
vppinfra: vector perf improvements
Type: improvement
Change-Id: I37c187af80c21b8fb1ab15af112527a837e0df9e
Signed-off-by: Damjan Marion <damarion@cisco.com>
Diffstat (limited to 'src/vppinfra/vec.c')
-rw-r--r-- | src/vppinfra/vec.c | 151 |
1 files changed, 97 insertions, 54 deletions
diff --git a/src/vppinfra/vec.c b/src/vppinfra/vec.c index 4dc8f18ce24..dbaadad2dd5 100644 --- a/src/vppinfra/vec.c +++ b/src/vppinfra/vec.c @@ -16,75 +16,118 @@ vec_mem_size (void *v) } __clib_export void * -_vec_realloc (void *v, uword n_elts, uword elt_sz, uword hdr_sz, uword align, - void *heap) +_vec_alloc_internal (uword n_elts, const vec_attr_t *const attr) { - uword n_data_bytes, alloc_size, new_data_size; - void *p; + uword req_size, alloc_size, data_offset, align; + uword elt_sz = attr->elt_sz; + void *p, *v, *heap = attr->heap; /* alignment must be power of 2 */ - align = clib_max (align, VEC_MIN_ALIGN); + align = clib_max (attr->align, VEC_MIN_ALIGN); ASSERT (count_set_bits (align) == 1); - /* mumber of bytes needed to store vector data */ - n_data_bytes = n_elts * elt_sz; + /* calc offset where vector data starts */ + data_offset = attr->hdr_sz + sizeof (vec_header_t); + data_offset += heap ? sizeof (void *) : 0; + data_offset = round_pow2 (data_offset, align); - if (v) - { - uword data_offset = vec_get_header_size (v); - uword old_data_size = data_offset + _vec_len (v) * elt_sz; - new_data_size = data_offset + n_data_bytes; - heap = _vec_find (v)->default_heap ? 0 : _vec_heap (v); - p = vec_header (v); - alloc_size = clib_mem_size (p); - - /* check that we are still dealing with the same vector type */ - ASSERT (_vec_find (v)->hdr_size * VEC_MIN_ALIGN == data_offset); - ASSERT (_vec_find (v)->log2_align == min_log2 (align)); - - /* realloc if new size cannot fit into existing allocation */ - if (alloc_size < new_data_size) - { - if (CLIB_VECTOR_GROW_BY_ONE) - alloc_size = n_data_bytes + data_offset; - else - alloc_size = (n_data_bytes * 3) / 2 + data_offset; - - p = clib_mem_heap_realloc_aligned (heap, p, alloc_size, align); - alloc_size = clib_mem_size (p); - v = p + data_offset; - } + req_size = data_offset + n_elts * elt_sz; + p = clib_mem_heap_alloc_aligned (heap, req_size, align); + + /* zero out whole alocation */ + alloc_size = clib_mem_size (p); + clib_mem_unpoison (p, alloc_size); + clib_memset_u8 (p, 0, alloc_size); - clib_mem_unpoison (p, alloc_size); - clib_memset_u8 (p + old_data_size, 0, alloc_size - old_data_size); + /* fill vector header */ + v = p + data_offset; + _vec_find (v)->len = n_elts; + _vec_find (v)->hdr_size = data_offset / VEC_MIN_ALIGN; + _vec_find (v)->log2_align = min_log2 (align); + if (heap) + { + _vec_find (v)->default_heap = 0; + _vec_heap (v) = heap; } else + _vec_find (v)->default_heap = 1; + + /* poison extra space given by allocator */ + clib_mem_poison (p + req_size, alloc_size - req_size); + _vec_set_grow_elts (v, (alloc_size - req_size) / elt_sz); + return v; +} + +static inline void +_vec_update_len (void *v, uword n_elts, uword elt_sz, uword n_data_bytes, + uword unused_bytes) +{ + _vec_find (v)->len = n_elts; + _vec_set_grow_elts (v, unused_bytes / elt_sz); + clib_mem_unpoison (v, n_data_bytes); + clib_mem_poison (v + n_data_bytes, unused_bytes); +} + +__clib_export void * +_vec_realloc_internal (void *v, uword n_elts, const vec_attr_t *const attr) +{ + uword old_alloc_sz, new_alloc_sz, new_data_size, n_data_bytes, data_offset; + uword elt_sz; + + if (PREDICT_FALSE (v == 0)) + return _vec_alloc_internal (n_elts, attr); + + elt_sz = attr->elt_sz; + n_data_bytes = n_elts * elt_sz; + data_offset = vec_get_header_size (v); + new_data_size = data_offset + n_data_bytes; + new_alloc_sz = old_alloc_sz = clib_mem_size (vec_header (v)); + + /* realloc if new size cannot fit into existing allocation */ + if (old_alloc_sz < new_data_size) { - /* new allocation */ - uword data_offset = hdr_sz + sizeof (vec_header_t); - data_offset += heap ? sizeof (void *) : 0; - data_offset = round_pow2 (data_offset, align); - - new_data_size = data_offset + n_data_bytes; - p = clib_mem_heap_alloc_aligned (heap, new_data_size, align); - alloc_size = clib_mem_size (p); - clib_mem_unpoison (p, alloc_size); - clib_memset_u8 (p, 0, alloc_size); + uword n_bytes, req_size = new_data_size; + void *p = v - data_offset; + + req_size += CLIB_VECTOR_GROW_BY_ONE ? 0 : n_data_bytes / 2; + + p = clib_mem_heap_realloc_aligned (vec_get_heap (v), p, req_size, + vec_get_align (v)); + new_alloc_sz = clib_mem_size (p); v = p + data_offset; - _vec_find (v)->hdr_size = data_offset / VEC_MIN_ALIGN; - _vec_find (v)->log2_align = min_log2 (align); - if (heap) + + /* zero out new allocation */ + n_bytes = new_alloc_sz - old_alloc_sz; + clib_mem_unpoison (p + old_alloc_sz, n_bytes); + clib_memset_u8 (p + old_alloc_sz, 0, n_bytes); + } + + _vec_update_len (v, n_elts, elt_sz, n_data_bytes, + new_alloc_sz - new_data_size); + return v; +} + +__clib_export void * +_vec_resize_internal (void *v, uword n_elts, const vec_attr_t *const attr) +{ + uword elt_sz = attr->elt_sz; + if (PREDICT_TRUE (v != 0)) + { + uword hs = _vec_find (v)->hdr_size * VEC_MIN_ALIGN; + uword alloc_sz = clib_mem_size (v - hs); + uword n_data_bytes = elt_sz * n_elts; + word unused_bytes = alloc_sz - (n_data_bytes + hs); + + if (PREDICT_TRUE (unused_bytes >= 0)) { - _vec_find (v)->default_heap = 0; - _vec_heap (v) = heap; + _vec_update_len (v, n_elts, elt_sz, n_data_bytes, unused_bytes); + return v; } - else - _vec_find (v)->default_heap = 1; } - clib_mem_poison (p + new_data_size, alloc_size - new_data_size); - _vec_find (v)->len = n_elts; - return v; + /* this shouled emit tail jump and likely avoid stack usasge inside this + * function */ + return _vec_realloc_internal (v, n_elts, attr); } __clib_export u32 |