2 * Copyright (c) 2015 Cisco and/or its affiliates.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
7 * http://www.apache.org/licenses/LICENSE-2.0
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
16 Copyright (c) 2001, 2002, 2003 Eliot Dresselhaus
18 Permission is hereby granted, free of charge, to any person obtaining
19 a copy of this software and associated documentation files (the
20 "Software"), to deal in the Software without restriction, including
21 without limitation the rights to use, copy, modify, merge, publish,
22 distribute, sublicense, and/or sell copies of the Software, and to
23 permit persons to whom the Software is furnished to do so, subject to
24 the following conditions:
26 The above copyright notice and this permission notice shall be
27 included in all copies or substantial portions of the Software.
29 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
30 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
31 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
32 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
33 LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
34 OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
35 WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
38 #ifndef included_vec_h
39 #define included_vec_h
41 #include <vppinfra/clib.h> /* word, etc */
42 #include <vppinfra/mem.h> /* clib_mem_free */
43 #include <vppinfra/string.h> /* memcpy, memmove */
44 #include <vppinfra/vec_bootstrap.h>
48 CLIB vectors are ubiquitous dynamically resized arrays with by user
49 defined "headers". Many CLIB data structures (e.g. hash, heap,
50 pool) are vectors with various different headers.
52 The memory layout looks like this:
55 user header (aligned to uword boundary)
56 vector length: number of elements
57 user's pointer-> vector element #0
62 The user pointer contains the address of vector element # 0. Null
63 pointer vectors are valid and mean a zero length vector.
65 You can reset the length of an allocated vector to zero via the
66 vec_reset_length(v) macro, or by setting the vector length field to
67 zero (e.g. _vec_len (v) = 0). Vec_reset_length(v) preferred: it
68 understands Null pointers.
70 Typically, the header is not present. Headers allow for other
71 data structures to be built atop CLIB vectors.
73 Users may specify the alignment for first data element of a vector
74 via the vec_*_aligned macros.
76 Vector elements can be any C type e.g. (int, double, struct bar).
77 This is also true for data types built atop vectors (e.g. heap,
80 Many macros have \_a variants supporting alignment of vector elements
81 and \_h variants supporting non-zero-length vector headers. The \_ha
82 variants support both. Additionally cacheline alignment within a
83 vector element structure can be specified using the
84 CLIB_CACHE_LINE_ALIGN_MARK() macro.
86 Standard programming error: memorize a pointer to the ith element
87 of a vector then expand it. Vectors expand by 3/2, so such code
88 may appear to work for a period of time. Memorize vector indices
92 /** \brief Low-level resize allocation function, usually not called directly
94 @param v pointer to a vector
95 @param length_increment length increment in elements
96 @param data_bytes requested size in bytes
97 @param header_bytes header size in bytes (may be zero)
98 @param data_align alignment (may be zero)
99 @param numa_id numa id (may be zero)
100 @return v_prime pointer to resized vector, may or may not equal v
102 void *vec_resize_allocate_memory (void *v,
103 word length_increment,
105 uword header_bytes, uword data_align,
108 /** \brief Low-level vector resize function, usually not called directly
110 @param v pointer to a vector
111 @param length_increment length increment in elements
112 @param data_bytes requested size in bytes
113 @param header_bytes header size in bytes (may be zero)
114 @param data_align alignment (may be zero)
115 @param numa_id (may be ~0)
116 @return v_prime pointer to resized vector, may or may not equal v
119 #define _vec_resize_numa(V,L,DB,HB,A,S) \
121 __typeof__ ((V)) _V; \
122 _V = _vec_resize_inline((void *)V,L,DB,HB,clib_max((__alignof__((V)[0])),(A)),(S)); \
126 #define _vec_resize(V,L,DB,HB,A) \
127 _vec_resize_numa(V,L,DB,HB,A,VEC_NUMA_UNSPECIFIED)
130 _vec_resize_inline (void *v,
131 word length_increment,
132 uword data_bytes, uword header_bytes, uword data_align,
135 vec_header_t *vh = _vec_find (v);
136 uword new_data_bytes, aligned_header_bytes;
139 aligned_header_bytes = vec_header_bytes (header_bytes);
141 new_data_bytes = data_bytes + aligned_header_bytes;
143 if (PREDICT_TRUE (v != 0))
145 void *p = v - aligned_header_bytes;
147 if (PREDICT_FALSE (numa_id != VEC_NUMA_UNSPECIFIED))
149 oldheap = clib_mem_get_per_cpu_heap ();
150 clib_mem_set_per_cpu_heap (clib_mem_get_per_numa_heap (numa_id));
153 /* Vector header must start heap object. */
154 ASSERT (clib_mem_is_heap_object (p));
156 /* Typically we'll not need to resize. */
157 if (new_data_bytes <= clib_mem_size (p))
159 CLIB_MEM_UNPOISON (v, data_bytes);
160 vh->len += length_increment;
161 if (PREDICT_FALSE (numa_id != VEC_NUMA_UNSPECIFIED))
162 clib_mem_set_per_cpu_heap (oldheap);
165 if (PREDICT_FALSE (numa_id != VEC_NUMA_UNSPECIFIED))
166 clib_mem_set_per_cpu_heap (oldheap);
169 /* Slow path: call helper function. */
170 return vec_resize_allocate_memory (v, length_increment, data_bytes,
172 clib_max (sizeof (vec_header_t),
173 data_align), numa_id);
176 /** \brief Determine if vector will resize with next allocation
178 @param v pointer to a vector
179 @param length_increment length increment in elements
180 @param data_bytes requested size in bytes
181 @param header_bytes header size in bytes (may be zero)
182 @param data_align alignment (may be zero)
183 @return 1 if vector will resize 0 otherwise
187 _vec_resize_will_expand (void *v,
188 word length_increment,
189 uword data_bytes, uword header_bytes,
192 uword new_data_bytes, aligned_header_bytes;
194 aligned_header_bytes = vec_header_bytes (header_bytes);
196 new_data_bytes = data_bytes + aligned_header_bytes;
198 if (PREDICT_TRUE (v != 0))
200 void *p = v - aligned_header_bytes;
202 /* Vector header must start heap object. */
203 ASSERT (clib_mem_is_heap_object (p));
205 /* Typically we'll not need to resize. */
206 if (new_data_bytes <= clib_mem_size (p))
212 /** \brief Determine if vector will resize with next allocation
214 @param V pointer to a vector
215 @param N number of elements to add
216 @return 1 if vector will resize 0 otherwise
219 #define vec_resize_will_expand(V, N) \
222 word _v (l) = vec_len (V); \
223 _vec_resize_will_expand ((V), _v (n), \
224 (_v (l) + _v (n)) * sizeof ((V)[0]), 0, 0); \
227 /** \brief Predicate function, says whether the supplied vector is a clib heap
228 object (general version).
230 @param v pointer to a vector
231 @param header_bytes vector header size in bytes (may be zero)
234 uword clib_mem_is_vec_h (void *v, uword header_bytes);
237 /** \brief Predicate function, says whether the supplied vector is a clib heap
240 @param v pointer to a vector
244 clib_mem_is_vec (void *v)
246 return clib_mem_is_vec_h (v, 0);
249 /* Local variable naming macro (prevents collisions with other macro naming). */
250 #define _v(var) _vec_##var
252 /** \brief Resize a vector (general version).
253 Add N elements to end of given vector V, return pointer to start of vector.
254 Vector will have room for H header bytes and will have user's data aligned
255 at alignment A (rounded to next power of 2).
257 @param V pointer to a vector
258 @param N number of elements to add
259 @param H header size in bytes (may be zero)
260 @param A alignment (may be zero)
261 @param S numa_id (may be zero)
262 @return V (value-result macro parameter)
265 #define vec_resize_has(V,N,H,A,S) \
268 word _v(l) = vec_len (V); \
269 V = _vec_resize_numa ((V), _v(n), \
270 (_v(l) + _v(n)) * sizeof ((V)[0]), \
274 /** \brief Resize a vector (less general version).
275 Add N elements to end of given vector V, return pointer to start of vector.
276 Vector will have room for H header bytes and will have user's data aligned
277 at alignment A (rounded to next power of 2).
279 @param V pointer to a vector
280 @param N number of elements to add
281 @param H header size in bytes (may be zero)
282 @param A alignment (may be zero)
283 @return V (value-result macro parameter)
285 #define vec_resize_ha(V,N,H,A) vec_resize_has(V,N,H,A,VEC_NUMA_UNSPECIFIED)
287 /** \brief Resize a vector (no header, unspecified alignment)
288 Add N elements to end of given vector V, return pointer to start of vector.
289 Vector will have room for H header bytes and will have user's data aligned
290 at alignment A (rounded to next power of 2).
292 @param V pointer to a vector
293 @param N number of elements to add
294 @return V (value-result macro parameter)
296 #define vec_resize(V,N) vec_resize_ha(V,N,0,0)
298 /** \brief Resize a vector (no header, alignment specified).
299 Add N elements to end of given vector V, return pointer to start of vector.
300 Vector will have room for H header bytes and will have user's data aligned
301 at alignment A (rounded to next power of 2).
303 @param V pointer to a vector
304 @param N number of elements to add
305 @param A alignment (may be zero)
306 @return V (value-result macro parameter)
309 #define vec_resize_aligned(V,N,A) vec_resize_ha(V,N,0,A)
311 /** \brief Allocate space for N more elements
313 @param V pointer to a vector
314 @param N number of elements to add
315 @param H header size in bytes (may be zero)
316 @param A alignment (may be zero)
317 @return V (value-result macro parameter)
320 #define vec_alloc_ha(V,N,H,A) \
322 uword _v(l) = vec_len (V); \
323 vec_resize_ha (V, N, H, A); \
324 _vec_len (V) = _v(l); \
327 /** \brief Allocate space for N more elements
328 (no header, unspecified alignment)
330 @param V pointer to a vector
331 @param N number of elements to add
332 @return V (value-result macro parameter)
334 #define vec_alloc(V,N) vec_alloc_ha(V,N,0,0)
336 /** \brief Allocate space for N more elements (no header, given alignment)
337 @param V pointer to a vector
338 @param N number of elements to add
339 @param A alignment (may be zero)
340 @return V (value-result macro parameter)
343 #define vec_alloc_aligned(V,N,A) vec_alloc_ha(V,N,0,A)
345 /** \brief Create new vector of given type and length (general version).
346 @param T type of elements in new vector
347 @param N number of elements to add
348 @param H header size in bytes (may be zero)
349 @param A alignment (may be zero)
352 #define vec_new_ha(T,N,H,A) \
355 (T *)_vec_resize ((T *) 0, _v(n), _v(n) * sizeof (T), (H), (A)); \
358 /** \brief Create new vector of given type and length
359 (unspecified alignment, no header).
361 @param T type of elements in new vector
362 @param N number of elements to add
365 #define vec_new(T,N) vec_new_ha(T,N,0,0)
366 /** \brief Create new vector of given type and length
367 (alignment specified, no header).
369 @param T type of elements in new vector
370 @param N number of elements to add
371 @param A alignment (may be zero)
374 #define vec_new_aligned(T,N,A) vec_new_ha(T,N,0,A)
376 /** \brief Free vector's memory (general version)
378 @param V pointer to a vector
379 @param H size of header in bytes
380 @return V (value-result parameter, V=0)
382 #define vec_free_h(V,H) \
386 clib_mem_free (vec_header ((V), (H))); \
391 /** \brief Free vector's memory (no header).
392 @param V pointer to a vector
393 @return V (value-result parameter, V=0)
395 #define vec_free(V) vec_free_h(V,0)
397 void vec_free_not_inline (void *v);
399 /**\brief Free vector user header (syntactic sugar)
400 @param h vector header
403 #define vec_free_header(h) clib_mem_free (h)
405 /** \brief Return copy of vector (general version).
407 @param V pointer to a vector
408 @param H size of header in bytes
409 @param A alignment (may be zero)
410 @param S numa (may be VEC_NUMA_UNSPECIFIED)
412 @return Vdup copy of vector
415 #define vec_dup_ha_numa(V,H,A,S) \
417 __typeof__ ((V)[0]) * _v(v) = 0; \
418 uword _v(l) = vec_len (V); \
421 vec_resize_has (_v(v), _v(l), (H), (A), (S)); \
422 clib_memcpy_fast (_v(v), (V), _v(l) * sizeof ((V)[0]));\
427 /** \brief Return copy of vector (VEC_NUMA_UNSPECIFIED).
429 @param V pointer to a vector
430 @param H size of header in bytes
431 @param A alignment (may be zero)
433 @return Vdup copy of vector
435 #define vec_dup_ha(V,H,A) \
436 vec_dup_ha_numa(V,H,A,VEC_NUMA_UNSPECIFIED)
439 /** \brief Return copy of vector (no header, no alignment)
441 @param V pointer to a vector
442 @return Vdup copy of vector
444 #define vec_dup(V) vec_dup_ha(V,0,0)
446 /** \brief Return copy of vector (no header, alignment specified).
448 @param V pointer to a vector
449 @param A alignment (may be zero)
451 @return Vdup copy of vector
453 #define vec_dup_aligned(V,A) vec_dup_ha(V,0,A)
455 /** \brief Copy a vector, memcpy wrapper. Assumes sizeof(SRC[0]) ==
458 @param DST destination
461 #define vec_copy(DST,SRC) clib_memcpy_fast (DST, SRC, vec_len (DST) * \
464 /** \brief Clone a vector. Make a new vector with the
465 same size as a given vector but possibly with a different type.
467 @param NEW_V pointer to new vector
468 @param OLD_V pointer to old vector
470 #define vec_clone(NEW_V,OLD_V) \
473 (NEW_V) = _vec_resize ((NEW_V), vec_len (OLD_V), \
474 vec_len (OLD_V) * sizeof ((NEW_V)[0]), (0), (0)); \
477 /** \brief Make sure vector is long enough for given index (general version).
479 @param V (possibly NULL) pointer to a vector.
480 @param I vector index which will be valid upon return
481 @param H header size in bytes (may be zero)
482 @param A alignment (may be zero)
483 @param N numa_id (may be zero)
484 @return V (value-result macro parameter)
487 #define vec_validate_han(V,I,H,A,N) \
490 STATIC_ASSERT(A==0 || ((A % sizeof(V[0]))==0) \
491 || ((sizeof(V[0]) % A) == 0), \
492 "vector validate aligned on incorrectly sized object"); \
494 word _v(l) = vec_len (V); \
495 if (_v(i) >= _v(l)) \
497 /* switch to the per-numa heap if directed */ \
498 if (PREDICT_FALSE(N != VEC_NUMA_UNSPECIFIED)) \
500 oldheap = clib_mem_get_per_cpu_heap(); \
501 clib_mem_set_per_cpu_heap (clib_mem_get_per_numa_heap(N)); \
504 vec_resize_ha ((V), 1 + (_v(i) - _v(l)), (H), (A)); \
505 /* Must zero new space since user may have previously \
506 used e.g. _vec_len (v) -= 10 */ \
507 clib_memset ((V) + _v(l), 0, \
508 (1 + (_v(i) - _v(l))) * sizeof ((V)[0])); \
509 /* Switch back to the global heap */ \
510 if (PREDICT_FALSE (N != VEC_NUMA_UNSPECIFIED)) \
511 clib_mem_set_per_cpu_heap (oldheap); \
515 #define vec_validate_ha(V,I,H,A) vec_validate_han(V,I,H,A,VEC_NUMA_UNSPECIFIED)
517 /** \brief Make sure vector is long enough for given index
518 (no header, unspecified alignment)
520 @param V (possibly NULL) pointer to a vector.
521 @param I vector index which will be valid upon return
522 @return V (value-result macro parameter)
524 #define vec_validate(V,I) vec_validate_ha(V,I,0,0)
526 /** \brief Make sure vector is long enough for given index
527 (no header, specified alignment)
529 @param V (possibly NULL) pointer to a vector.
530 @param I vector index which will be valid upon return
531 @param A alignment (may be zero)
532 @return V (value-result macro parameter)
535 #define vec_validate_aligned(V,I,A) vec_validate_ha(V,I,0,A)
537 /** \brief Make sure vector is long enough for given index
538 and initialize empty space (general version)
540 @param V (possibly NULL) pointer to a vector.
541 @param I vector index which will be valid upon return
542 @param INIT initial value (can be a complex expression!)
543 @param H header size in bytes (may be zero)
544 @param A alignment (may be zero)
545 @return V (value-result macro parameter)
547 #define vec_validate_init_empty_ha(V,I,INIT,H,A) \
550 word _v(l) = vec_len (V); \
551 if (_v(i) >= _v(l)) \
553 vec_resize_ha ((V), 1 + (_v(i) - _v(l)), (H), (A)); \
554 while (_v(l) <= _v(i)) \
556 (V)[_v(l)] = (INIT); \
562 /** \brief Make sure vector is long enough for given index
563 and initialize empty space (no header, unspecified alignment)
565 @param V (possibly NULL) pointer to a vector.
566 @param I vector index which will be valid upon return
567 @param INIT initial value (can be a complex expression!)
568 @return V (value-result macro parameter)
571 #define vec_validate_init_empty(V,I,INIT) \
572 vec_validate_init_empty_ha(V,I,INIT,0,0)
574 /** \brief Make sure vector is long enough for given index
575 and initialize empty space (no header, alignment alignment)
577 @param V (possibly NULL) pointer to a vector.
578 @param I vector index which will be valid upon return
579 @param INIT initial value (can be a complex expression!)
580 @param A alignment (may be zero)
581 @return V (value-result macro parameter)
583 #define vec_validate_init_empty_aligned(V,I,INIT,A) \
584 vec_validate_init_empty_ha(V,I,INIT,0,A)
586 /** \brief Add 1 element to end of vector (general version).
588 @param V pointer to a vector
589 @param E element to add
590 @param H header size in bytes (may be zero)
591 @param A alignment (may be zero)
592 @return V (value-result macro parameter)
594 #define vec_add1_ha(V,E,H,A) \
596 word _v(l) = vec_len (V); \
597 V = _vec_resize ((V), 1, (_v(l) + 1) * sizeof ((V)[0]), (H), (A)); \
601 /** \brief Add 1 element to end of vector (unspecified alignment).
603 @param V pointer to a vector
604 @param E element to add
605 @return V (value-result macro parameter)
607 #define vec_add1(V,E) vec_add1_ha(V,E,0,0)
609 /** \brief Add 1 element to end of vector (alignment specified).
611 @param V pointer to a vector
612 @param E element to add
613 @param A alignment (may be zero)
614 @return V (value-result macro parameter)
616 #define vec_add1_aligned(V,E,A) vec_add1_ha(V,E,0,A)
618 /** \brief Add N elements to end of vector V,
619 return pointer to new elements in P. (general version)
621 @param V pointer to a vector
622 @param P pointer to new vector element(s)
623 @param N number of elements to add
624 @param H header size in bytes (may be zero)
625 @param A alignment (may be zero)
626 @return V and P (value-result macro parameters)
628 #define vec_add2_ha(V,P,N,H,A) \
631 word _v(l) = vec_len (V); \
632 V = _vec_resize ((V), _v(n), (_v(l) + _v(n)) * sizeof ((V)[0]), (H), (A)); \
636 /** \brief Add N elements to end of vector V,
637 return pointer to new elements in P. (no header, unspecified alignment)
639 @param V pointer to a vector
640 @param P pointer to new vector element(s)
641 @param N number of elements to add
642 @return V and P (value-result macro parameters)
645 #define vec_add2(V,P,N) vec_add2_ha(V,P,N,0,0)
647 /** \brief Add N elements to end of vector V,
648 return pointer to new elements in P. (no header, alignment specified)
650 @param V pointer to a vector
651 @param P pointer to new vector element(s)
652 @param N number of elements to add
653 @param A alignment (may be zero)
654 @return V and P (value-result macro parameters)
657 #define vec_add2_aligned(V,P,N,A) vec_add2_ha(V,P,N,0,A)
659 /** \brief Add N elements to end of vector V (general version)
661 @param V pointer to a vector
662 @param E pointer to element(s) to add
663 @param N number of elements to add
664 @param H header size in bytes (may be zero)
665 @param A alignment (may be zero)
666 @return V (value-result macro parameter)
668 #define vec_add_ha(V, E, N, H, A) \
672 if (PREDICT_TRUE (_v (n) > 0)) \
674 word _v (l) = vec_len (V); \
675 V = _vec_resize ((V), _v (n), (_v (l) + _v (n)) * sizeof ((V)[0]), \
677 clib_memcpy_fast ((V) + _v (l), (E), _v (n) * sizeof ((V)[0])); \
682 /** \brief Add N elements to end of vector V (no header, unspecified alignment)
684 @param V pointer to a vector
685 @param E pointer to element(s) to add
686 @param N number of elements to add
687 @return V (value-result macro parameter)
689 #define vec_add(V,E,N) vec_add_ha(V,E,N,0,0)
691 /** \brief Add N elements to end of vector V (no header, specified alignment)
693 @param V pointer to a vector
694 @param E pointer to element(s) to add
695 @param N number of elements to add
696 @param A alignment (may be zero)
697 @return V (value-result macro parameter)
699 #define vec_add_aligned(V,E,N,A) vec_add_ha(V,E,N,0,A)
701 /** \brief Returns last element of a vector and decrements its length
703 @param V pointer to a vector
704 @return E element removed from the end of the vector
708 uword _v(l) = vec_len (V); \
709 ASSERT (_v(l) > 0); \
711 _vec_len (V) = _v (l); \
715 /** \brief Set E to the last element of a vector, decrement vector length
716 @param V pointer to a vector
717 @param E pointer to the last vector element
718 @return E element removed from the end of the vector
719 (value-result macro parameter
722 #define vec_pop2(V,E) \
724 uword _v(l) = vec_len (V); \
725 if (_v(l) > 0) (E) = vec_pop (V); \
729 /** \brief Insert N vector elements starting at element M,
730 initialize new elements (general version).
732 @param V (possibly NULL) pointer to a vector.
733 @param N number of elements to insert
734 @param M insertion point
735 @param INIT initial value (can be a complex expression!)
736 @param H header size in bytes (may be zero)
737 @param A alignment (may be zero)
738 @return V (value-result macro parameter)
740 #define vec_insert_init_empty_ha(V,N,M,INIT,H,A) \
742 word _v(l) = vec_len (V); \
745 V = _vec_resize ((V), \
747 (_v(l) + _v(n))*sizeof((V)[0]), \
749 ASSERT (_v(m) <= _v(l)); \
750 memmove ((V) + _v(m) + _v(n), \
752 (_v(l) - _v(m)) * sizeof ((V)[0])); \
753 clib_memset ((V) + _v(m), INIT, _v(n) * sizeof ((V)[0])); \
756 /** \brief Insert N vector elements starting at element M,
757 initialize new elements to zero (general version)
759 @param V (possibly NULL) pointer to a vector.
760 @param N number of elements to insert
761 @param M insertion point
762 @param H header size in bytes (may be zero)
763 @param A alignment (may be zero)
764 @return V (value-result macro parameter)
766 #define vec_insert_ha(V,N,M,H,A) vec_insert_init_empty_ha(V,N,M,0,H,A)
768 /** \brief Insert N vector elements starting at element M,
769 initialize new elements to zero (no header, unspecified alignment)
771 @param V (possibly NULL) pointer to a vector.
772 @param N number of elements to insert
773 @param M insertion point
774 @return V (value-result macro parameter)
776 #define vec_insert(V,N,M) vec_insert_ha(V,N,M,0,0)
778 /** \brief Insert N vector elements starting at element M,
779 initialize new elements to zero (no header, alignment specified)
781 @param V (possibly NULL) pointer to a vector.
782 @param N number of elements to insert
783 @param M insertion point
784 @param A alignment (may be zero)
785 @return V (value-result macro parameter)
787 #define vec_insert_aligned(V,N,M,A) vec_insert_ha(V,N,M,0,A)
789 /** \brief Insert N vector elements starting at element M,
790 initialize new elements (no header, unspecified alignment)
792 @param V (possibly NULL) pointer to a vector.
793 @param N number of elements to insert
794 @param M insertion point
795 @param INIT initial value (can be a complex expression!)
796 @return V (value-result macro parameter)
799 #define vec_insert_init_empty(V,N,M,INIT) \
800 vec_insert_init_empty_ha(V,N,M,INIT,0,0)
801 /* Resize vector by N elements starting from element M, initialize new elements to INIT (alignment specified, no header). */
803 /** \brief Insert N vector elements starting at element M,
804 initialize new elements (no header, specified alignment)
806 @param V (possibly NULL) pointer to a vector.
807 @param N number of elements to insert
808 @param M insertion point
809 @param INIT initial value (can be a complex expression!)
810 @param A alignment (may be zero)
811 @return V (value-result macro parameter)
813 #define vec_insert_init_empty_aligned(V,N,M,INIT,A) \
814 vec_insert_init_empty_ha(V,N,M,INIT,0,A)
816 /** \brief Insert N vector elements starting at element M,
817 insert given elements (general version)
819 @param V (possibly NULL) pointer to a vector.
820 @param E element(s) to insert
821 @param N number of elements to insert
822 @param M insertion point
823 @param H header size in bytes (may be zero)
824 @param A alignment (may be zero)
825 @return V (value-result macro parameter)
828 #define vec_insert_elts_ha(V, E, N, M, H, A) \
832 if (PREDICT_TRUE (_v (n) > 0)) \
834 word _v (l) = vec_len (V); \
836 V = _vec_resize ((V), _v (n), (_v (l) + _v (n)) * sizeof ((V)[0]), \
838 ASSERT (_v (m) <= _v (l)); \
839 memmove ((V) + _v (m) + _v (n), (V) + _v (m), \
840 (_v (l) - _v (m)) * sizeof ((V)[0])); \
841 clib_memcpy_fast ((V) + _v (m), (E), _v (n) * sizeof ((V)[0])); \
846 /** \brief Insert N vector elements starting at element M,
847 insert given elements (no header, unspecified alignment)
849 @param V (possibly NULL) pointer to a vector.
850 @param E element(s) to insert
851 @param N number of elements to insert
852 @param M insertion point
853 @return V (value-result macro parameter)
855 #define vec_insert_elts(V,E,N,M) vec_insert_elts_ha(V,E,N,M,0,0)
857 /** \brief Insert N vector elements starting at element M,
858 insert given elements (no header, specified alignment)
860 @param V (possibly NULL) pointer to a vector.
861 @param E element(s) to insert
862 @param N number of elements to insert
863 @param M insertion point
864 @param A alignment (may be zero)
865 @return V (value-result macro parameter)
867 #define vec_insert_elts_aligned(V,E,N,M,A) vec_insert_elts_ha(V,E,N,M,0,A)
869 /** \brief Delete N elements starting at element M
871 @param V pointer to a vector
872 @param N number of elements to delete
873 @param M first element to delete
874 @return V (value-result macro parameter)
876 #define vec_delete(V,N,M) \
878 word _v(l) = vec_len (V); \
881 /* Copy over deleted elements. */ \
882 if (_v(l) - _v(n) - _v(m) > 0) \
883 memmove ((V) + _v(m), (V) + _v(m) + _v(n), \
884 (_v(l) - _v(n) - _v(m)) * sizeof ((V)[0])); \
885 /* Zero empty space at end (for future re-allocation). */ \
887 clib_memset ((V) + _v(l) - _v(n), 0, _v(n) * sizeof ((V)[0])); \
888 _vec_len (V) -= _v(n); \
889 CLIB_MEM_POISON(vec_end(V), _v(n) * sizeof ((V)[0])); \
892 /** \brief Delete the element at index I
894 @param V pointer to a vector
895 @param I index to delete
897 #define vec_del1(v,i) \
899 uword _vec_del_l = _vec_len (v) - 1; \
900 uword _vec_del_i = (i); \
901 if (_vec_del_i < _vec_del_l) \
902 (v)[_vec_del_i] = (v)[_vec_del_l]; \
903 _vec_len (v) = _vec_del_l; \
904 CLIB_MEM_POISON(vec_end(v), sizeof ((v)[0])); \
907 /** \brief Append v2 after v1. Result in v1.
908 @param V1 target vector
909 @param V2 vector to append
912 #define vec_append(v1, v2) \
915 uword _v (l1) = vec_len (v1); \
916 uword _v (l2) = vec_len (v2); \
918 if (PREDICT_TRUE (_v (l2) > 0)) \
920 v1 = _vec_resize ((v1), _v (l2), \
921 (_v (l1) + _v (l2)) * sizeof ((v1)[0]), 0, 0); \
922 clib_memcpy_fast ((v1) + _v (l1), (v2), \
923 _v (l2) * sizeof ((v2)[0])); \
928 /** \brief Append v2 after v1. Result in v1. Specified alignment.
929 @param V1 target vector
930 @param V2 vector to append
931 @param align required alignment
934 #define vec_append_aligned(v1, v2, align) \
937 uword _v (l1) = vec_len (v1); \
938 uword _v (l2) = vec_len (v2); \
940 if (PREDICT_TRUE (_v (l2) > 0)) \
943 (v1), _v (l2), (_v (l1) + _v (l2)) * sizeof ((v1)[0]), 0, align); \
944 clib_memcpy_fast ((v1) + _v (l1), (v2), \
945 _v (l2) * sizeof ((v2)[0])); \
950 /** \brief Prepend v2 before v1. Result in v1.
951 @param V1 target vector
952 @param V2 vector to prepend
955 #define vec_prepend(v1, v2) \
958 uword _v (l1) = vec_len (v1); \
959 uword _v (l2) = vec_len (v2); \
961 if (PREDICT_TRUE (_v (l2) > 0)) \
963 v1 = _vec_resize ((v1), _v (l2), \
964 (_v (l1) + _v (l2)) * sizeof ((v1)[0]), 0, 0); \
965 memmove ((v1) + _v (l2), (v1), _v (l1) * sizeof ((v1)[0])); \
966 clib_memcpy_fast ((v1), (v2), _v (l2) * sizeof ((v2)[0])); \
971 /** \brief Prepend v2 before v1. Result in v1. Specified alignment
972 @param V1 target vector
973 @param V2 vector to prepend
974 @param align required alignment
977 #define vec_prepend_aligned(v1, v2, align) \
980 uword _v (l1) = vec_len (v1); \
981 uword _v (l2) = vec_len (v2); \
983 if (PREDICT_TRUE (_v (l2) > 0)) \
986 (v1), _v (l2), (_v (l1) + _v (l2)) * sizeof ((v1)[0]), 0, align); \
987 memmove ((v1) + _v (l2), (v1), _v (l1) * sizeof ((v1)[0])); \
988 clib_memcpy_fast ((v1), (v2), _v (l2) * sizeof ((v2)[0])); \
993 /** \brief Zero all vector elements. Null-pointer tolerant.
994 @param var Vector to zero
996 #define vec_zero(var) \
999 clib_memset ((var), 0, vec_len (var) * sizeof ((var)[0])); \
1002 /** \brief Set all vector elements to given value. Null-pointer tolerant.
1003 @param v vector to set
1004 @param val value for each vector element
1006 #define vec_set(v,val) \
1009 __typeof__ ((v)[0]) _val = (val); \
1010 for (_v(i) = 0; _v(i) < vec_len (v); _v(i)++) \
1011 (v)[_v(i)] = _val; \
1015 #include <stdlib.h> /* for qsort */
1018 /** \brief Compare two vectors, not NULL-pointer tolerant
1020 @param v1 Pointer to a vector
1021 @param v2 Pointer to a vector
1022 @return 1 if equal, 0 if unequal
1024 #define vec_is_equal(v1,v2) \
1025 (vec_len (v1) == vec_len (v2) && ! memcmp ((v1), (v2), vec_len (v1) * sizeof ((v1)[0])))
1027 /** \brief Compare two vectors (only applicable to vectors of signed numbers).
1028 Used in qsort compare functions.
1030 @param v1 Pointer to a vector
1031 @param v2 Pointer to a vector
1034 #define vec_cmp(v1,v2) \
1036 word _v(i), _v(cmp), _v(l); \
1037 _v(l) = clib_min (vec_len (v1), vec_len (v2)); \
1039 for (_v(i) = 0; _v(i) < _v(l); _v(i)++) { \
1040 _v(cmp) = (v1)[_v(i)] - (v2)[_v(i)]; \
1044 if (_v(cmp) == 0 && _v(l) > 0) \
1045 _v(cmp) = vec_len(v1) - vec_len(v2); \
1046 (_v(cmp) < 0 ? -1 : (_v(cmp) > 0 ? +1 : 0)); \
1049 /** \brief Search a vector for the index of the entry that matches.
1051 @param v Pointer to a vector
1052 @param E Entry to match
1053 @return index of match or ~0
1055 #define vec_search(v,E) \
1058 while (_v(i) < vec_len(v)) \
1060 if ((v)[_v(i)] == E) \
1064 if (_v(i) == vec_len(v)) \
1069 /** \brief Search a vector for the index of the entry that matches.
1071 @param v Pointer to a vector
1072 @param E Pointer to entry to match
1073 @param fn Comparison function !0 => match
1074 @return index of match or ~0
1076 #define vec_search_with_function(v,E,fn) \
1079 while (_v(i) < vec_len(v)) \
1081 if (0 != fn(&(v)[_v(i)], (E))) \
1085 if (_v(i) == vec_len(v)) \
1090 /** \brief Sort a vector using the supplied element comparison function
1092 Does not depend on the underlying implementation to deal correctly
1093 with null, zero-long, or 1-long vectors
1095 @param vec vector to sort
1096 @param f comparison function
1098 #define vec_sort_with_function(vec,f) \
1100 if (vec_len (vec) > 1) \
1101 qsort (vec, vec_len (vec), sizeof (vec[0]), (void *) (f)); \
1104 /** \brief Make a vector containing a NULL terminated c-string.
1106 @param V (possibly NULL) pointer to a vector.
1107 @param S pointer to string buffer.
1108 @param L string length (NOT including the terminating NULL; a la strlen())
1110 #define vec_validate_init_c_string(V, S, L) \
1112 vec_reset_length (V); \
1113 vec_validate ((V), (L)); \
1115 clib_memcpy_fast ((V), (S), (L)); \
1120 /** \brief Test whether a vector is a NULL terminated c-string.
1122 @param V (possibly NULL) pointer to a vector.
1123 @return BOOLEAN indicating if the vector c-string is null terminated.
1125 #define vec_c_string_is_terminated(V) \
1126 (((V) != 0) && (vec_len (V) != 0) && ((V)[vec_len ((V)) - 1] == 0))
1128 /** \brief (If necessary) NULL terminate a vector containing a c-string.
1130 @param V (possibly NULL) pointer to a vector.
1131 @return V (value-result macro parameter)
1133 #define vec_terminate_c_string(V) \
1135 u32 vl = vec_len ((V)); \
1136 if (!vec_c_string_is_terminated(V)) \
1138 vec_validate ((V), vl); \
1143 #endif /* included_vec_h */
1147 * fd.io coding-style-patch-verification: ON
1150 * eval: (c-set-style "gnu")