/* * Copyright (c) 2015 Cisco and/or its affiliates. * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at: * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ /* Copyright (c) 2001, 2002, 2003 Eliot Dresselhaus Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions 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 /* for CLIB_CACHE_LINE_BYTES */ #include #include #include #include #include always_inline heap_elt_t * elt_at (heap_header_t * h, uword i) { ASSERT (i < vec_len (h->elts)); return h->elts + i; } always_inline heap_elt_t * last (heap_header_t * h) { return elt_at (h, h->tail); } always_inline heap_elt_t * first (heap_header_t * h) { return elt_at (h, h->head); } /* Objects sizes are binned into N_BINS bins. Objects with size <= SMALL_BINS have their own bins. Larger objects are grouped together in power or 2 sized bins. Sizes are in units of elt_bytes bytes. */ /* Convert size to bin. */ always_inline uword size_to_bin (uword size) { uword bin; ASSERT (size > 0); if (size <= HEAP_SMALL_BINS) { bin = size - 1; if (size == 0) bin = 0; } else { bin = HEAP_SMALL_BINS + max_log2 (size) - (HEAP_LOG2_SMALL_BINS + 1); if (bin >= HEAP_N_BINS) bin = HEAP_N_BINS - 1; } return bin; } /* Convert bin to size. */ always_inline __attribute__ ((unused)) uword bin_to_size (uword bin) { uword size; if (bin <= HEAP_SMALL_BINS - 1) size = bin + 1; else size = (uword) 1 << ((bin - HEAP_SMALL_BINS) + HEAP_LOG2_SMALL_BINS + 1); return size; } static void elt_delete (heap_header_t * h, heap_elt_t * e) { heap_elt_t *l = vec_end (h->elts) - 1; ASSERT (e >= h->elts && e <= l); /* Update doubly linked pointers. */ { heap_elt_t *p = heap_prev (e); heap_elt_t *n = heap_next (e); if (p == e) { n->prev = 0; h->head = n - h->elts; } else if (n == e) { p->next = 0; h->tail = p - h->elts; } else { p->next = n - p; n->prev = p - n; } } /* Add to index free list or delete from end. */ if (e < l) vec_add1 (h->free_elts, e - h->elts); else _vec_len (h->elts)--; } /* Before: P ... E After : P ... NEW ... E */ always_inline void elt_insert_before (heap_header_t * h, heap_elt_t * e, heap_elt_t * new) { heap_elt_t *p = heap_prev (e); if (p == e) { new->prev = 0; new->next = e - new; p->prev = new - p; h->head = new - h->elts; } else { new->prev = p - new; new->next = e - new; e->prev = new - e; p->next = new - p; } } /* Before: E ... N After : E ... NEW ... N */ always_inline void elt_insert_after (heap_header_t * h, heap_elt_t * e, heap_elt_t * new) { heap_elt_t *n = heap_next (e); if (n == e) { new->next = 0; new->prev = e - new; e->next = new - e; h->tail = new - h->elts; } else { new->prev = e - new; new->next = n - new; e->next = new - e; n->prev = new - n; } } always_inline heap_elt_t * elt_new (heap_header_t * h) { heap_elt_t *e; uword l; if ((l = v
../vnet/ip/protocols.def
return s; if (i < 0) e0 = first (h); else { e0 = h->elts + i; for (j = 0; j < n / 2; j++) e0 = heap_prev (e0); } if (n < 0) e1 = h->elts + h->tail; else { e1 = h->elts + i; for (j = 0; j < n / 2; j++) e1 = heap_next (e1); } i = -n / 2; for (e = e0; 1; e = heap_next (e)) { if (heap_is_free (e)) s = format (s, "index %4d, free\n", e - h->elts); else if (h->format_elt) s = format (s, "%U", h->format_elt, v, elt_data (v, e)); else s = format (s, "index %4d, used\n", e - h->elts); i++; if (e == e1) break; } return s; } u8 * format_heap (u8 * s, va_list * va) { void *v = va_arg (*va, void *); uword verbose = va_arg (*va, uword); heap_header_t *h = heap_header (v); heap_header_t zero; clib_memset (&zero, 0, sizeof (zero)); if (!v) h = &zero; { f64 elt_bytes = vec_len (v) * h->elt_bytes; f64 overhead_bytes = heap_bytes (v); s = format (s, "heap %p, %6d objects, size %.1fk + overhead %.1fk\n", v, h->used_count, elt_bytes / 1024, (overhead_bytes - elt_bytes) / 1024); } if (v && verbose) s = debug_elt (s, v, -1, -1); return s; } void heap_validate (void *v) { heap_header_t *h = heap_header (v); uword i, o, s; u8 *free_map; heap_elt_t *e, *n; uword used_count, total_size; uword free_count, free_size; ASSERT (h->used_count == clib_bitmap_count_set_bits (h->used_elt_bitmap)); ASSERT (first (h)->prev == 0); ASSERT (last (h)->next == 0); /* Validate number of elements and size. */ free_size = free_count = 0; for (i = 0; i < vec_len (h->free_lists); i++) { free_count += vec_len (h->free_lists[i]); for (o = 0; o < vec_len (h->free_lists[i]); o++) { e = h->elts + h->free_lists[i][o]; s = heap_elt_size (v, e); ASSERT (size_to_bin (s) == i); ASSERT (heap_is_free (e)); free_size += s; } } { uword elt_free_size, elt_free_count; used_count = total_size = elt_free_size = elt_free_count = 0; for (e = first (h); 1; e = n) { int is_free = heap_is_free (e); used_count++; s = heap_elt_size (v, e); total_size += s; ASSERT (is_free == !clib_bitmap_get (h->used_elt_bitmap, e - h->elts)); if (is_free) { elt_free_count++; elt_free_size += s; } n = heap_next (e); if (e == n) { ASSERT (last (h) == n); break; } /* We should never have two free adjacent elements. */ ASSERT (!(heap_is_free (e) && heap_is_free (n))); } ASSERT (free_count == elt_free_count); ASSERT (free_size == elt_free_size); ASSERT (used_count == h->used_count + free_count); ASSERT (total_size == vec_len (v)); } free_map = vec_new (u8, used_count); e = first (h); for (i = o = 0; 1; i++) { ASSERT (heap_offset (e) == o); s = heap_elt_size (v, e); if (heap_is_free (e)) { uword fb, fi; fi = get_free_elt (v, e, &fb); ASSERT (fb < vec_len (h->free_lists)); ASSERT (fi < vec_len (h->free_lists[fb])); ASSERT (h->free_lists[fb][fi] == e - h->elts); ASSERT (!free_map[i]); free_map[i] = 1; } n = heap_next (e); if (e == n) break; ASSERT (heap_prev (n) == e); o += s; e = n; } vec_free (free_map); } /* * fd.io coding-style-patch-verification: ON * * Local Variables: * eval: (c-set-style "gnu") * End: */