aboutsummaryrefslogtreecommitdiffstats
path: root/bootstrap-hc2vpp-verify-odl.sh
AgeCommit message (Expand)AuthorFilesLines
2018-07-23HC Tests: disable NSH pluginMarek Gradzki1-1/+2
2018-06-06HC Tests: reenable NSH plugin (CSIT-994)Marek Gradzki1-2/+1
2018-05-16HC tests: archive ODL logs (CSIT-1031)Marek Gradzki1-2/+6
2018-05-15HC tests: archive JOB artifacts to logs.fd.ioMarek Gradzki1-5/+13
2018-05-15HC tests: disable NSH plugin (CSIT-994)Marek Gradzki1-1/+2
2018-04-27HC tests: reenable NSH plugin (CSIT-994)Marek Gradzki1-2/+1
2018-03-20HC Tests: move honeycomb tests out of vpp directoryMarek Gradzki1-1/+1
2018-03-13HC Tests: disable NSH pluginMarek Gradzki1-1/+2
2017-10-23Update disk-image-builder scripts to allow IPv6selias1-9/+13
2017-07-18HC Test: Update archive items path in csit-hc2vpp jobsselias1-0/+12
2017-06-29CSIT-687: Directory structure reorganizationTibor Frank1-1/+1
2017-05-17CSIT-577 HC Test: Scripts for test jobs using ODL clientselias1-0/+235
of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ #include <vppinfra/cache.h> #include <vppinfra/fifo.h> #include <vppinfra/error.h> #include <vppinfra/string.h> /* General first in/first out queues. FIFOs can have arbitrary size and type. Let T be any type (i.e. char, int, struct foo, etc.). A null fifo is initialized: T * f = 0; For example, typedef struct { int a, b; } T; Elements can be added in 3 ways. #1 1 element is added: T x; x.a = 10; x.b = 20; fifo_add1 (f, x); #2 n elements are added T buf[10]; initialize buf[0] .. buf[9]; fifo_add (f, buf, 10); #3 1 element is added, pointer is returned T * x; fifo_add2 (f, x); x->a = 10; x->b = 20; Elements are removed 1 at a time: T x; fifo_sub1 (f, x); fifo_free (f) frees fifo. */ void * _clib_fifo_resize (void *v_old, uword n_new_elts, uword elt_bytes) { void *v_new, *end, *head; uword n_old_elts, header_bytes; uword n_copy_bytes, n_zero_bytes; clib_fifo_header_t *f_new, *f_old; n_old_elts = clib_fifo_elts (v_old); n_new_elts += n_old_elts; if (n_new_elts < 32) n_new_elts = 32; else n_new_elts = max_pow2 (n_new_elts); header_bytes = vec_header_bytes (sizeof (clib_fifo_header_t)); v_new = clib_mem_alloc_no_fail (n_new_elts * elt_bytes + header_bytes); v_new += header_bytes; f_new = clib_fifo_header (v_new); f_new->head_index = 0; f_new->tail_index = n_old_elts; _vec_len (v_new) = n_new_elts; /* Copy old -> new. */ n_copy_bytes = n_old_elts * elt_bytes; if (n_copy_bytes > 0) { f_old = clib_fifo_header (v_old); end = v_old + _vec_len (v_old) * elt_bytes; head = v_old + f_old->head_index * elt_bytes; if (head + n_copy_bytes >= end) { uword n = end - head; clib_memcpy_fast (v_new, head, n); clib_memcpy_fast (v_new + n, v_old, n_copy_bytes - n); } else clib_memcpy_fast (v_new, head, n_copy_bytes); } /* Zero empty space. */ n_zero_bytes = (n_new_elts - n_old_elts) * elt_bytes; clib_memset (v_new + n_copy_bytes, 0, n_zero_bytes); clib_fifo_free (v_old); return v_new; } /* * fd.io coding-style-patch-verification: ON * * Local Variables: * eval: (c-set-style "gnu") * End: */