summaryrefslogtreecommitdiff
path: root/lib/librte_malloc/malloc_heap.c
diff options
context:
space:
mode:
Diffstat (limited to 'lib/librte_malloc/malloc_heap.c')
-rw-r--r--lib/librte_malloc/malloc_heap.c181
1 files changed, 181 insertions, 0 deletions
diff --git a/lib/librte_malloc/malloc_heap.c b/lib/librte_malloc/malloc_heap.c
new file mode 100644
index 0000000..3f621ab
--- /dev/null
+++ b/lib/librte_malloc/malloc_heap.c
@@ -0,0 +1,181 @@
+/*-
+ * BSD LICENSE
+ *
+ * Copyright(c) 2010-2012 Intel Corporation. All rights reserved.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ *
+ * * Redistributions of source code must retain the above copyright
+ * notice, this list of conditions and the following disclaimer.
+ * * Redistributions in binary form must reproduce the above copyright
+ * notice, this list of conditions and the following disclaimer in
+ * the documentation and/or other materials provided with the
+ * distribution.
+ * * Neither the name of Intel Corporation nor the names of its
+ * contributors may be used to endorse or promote products derived
+ * from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * version: DPDK.L.1.2.3-3
+ */
+#include <stdint.h>
+#include <stddef.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include <stdarg.h>
+#include <errno.h>
+#include <sys/queue.h>
+
+#include <rte_memory.h>
+#include <rte_memzone.h>
+#include <rte_tailq.h>
+#include <rte_eal.h>
+#include <rte_launch.h>
+#include <rte_per_lcore.h>
+#include <rte_lcore.h>
+#include <rte_common.h>
+#include <rte_string_fns.h>
+#include <rte_spinlock.h>
+
+#include "malloc_elem.h"
+#include "malloc_heap.h"
+
+#define QUOTE_(x) #x
+#define QUOTE(x) QUOTE_(x)
+/* since the memzone size starts with a digit, it will appear unquoted in
+ * rte_config.h, so quote it so it can be passed to rte_str_to_size */
+#define MALLOC_MEMZONE_SIZE QUOTE(RTE_MALLOC_MEMZONE_SIZE)
+
+/*
+ * returns the configuration setting for the memzone size as a size_t value
+ */
+static inline size_t
+get_malloc_memzone_size(void)
+{
+ return rte_str_to_size(MALLOC_MEMZONE_SIZE);
+}
+
+/*
+ * reserve an extra memory zone and make it available for use by a particular
+ * heap. This reserves the zone and sets a dummy malloc_elem header at the end
+ * to prevent overflow. The rest of the zone is added to free list as a single
+ * large free block
+ */
+static int
+malloc_heap_add_memzone(struct malloc_heap *heap, size_t size, unsigned align)
+{
+ const unsigned mz_flags = 0;
+ const size_t min_size = get_malloc_memzone_size();
+ /* ensure the data we want to allocate will fit in the memzone */
+ size_t mz_size = size + align + MALLOC_ELEM_OVERHEAD * 2;
+ if (mz_size < min_size)
+ mz_size = min_size;
+
+ char mz_name[RTE_MEMZONE_NAMESIZE];
+ rte_snprintf(mz_name, sizeof(mz_name), "MALLOC_S%u_HEAP_%u",
+ heap->numa_socket, heap->mz_count++);
+ const struct rte_memzone *mz = rte_memzone_reserve(mz_name, mz_size,
+ heap->numa_socket, mz_flags);
+ if (mz == NULL)
+ return -1;
+
+ /* allocate the memory block headers, one at end, one at start */
+ struct malloc_elem *start_elem = (struct malloc_elem *)mz->addr;
+ struct malloc_elem *end_elem = RTE_PTR_ADD(mz->addr,
+ mz_size - MALLOC_ELEM_OVERHEAD);
+ end_elem = RTE_ALIGN_FLOOR(end_elem, CACHE_LINE_SIZE);
+
+ const unsigned elem_size = (uintptr_t)end_elem - (uintptr_t)start_elem;
+ malloc_elem_init(start_elem, heap, elem_size);
+ malloc_elem_mkend(end_elem, start_elem);
+
+ start_elem->next_free = heap->free_head;
+ heap->free_head = start_elem;
+ return 0;
+}
+
+/*
+ * initialise a malloc heap object. The heap is locked with a private
+ * lock while being initialised. This function should only be called the
+ * first time a thread calls malloc - if even then, as heaps are per-socket
+ * not per-thread.
+ */
+static void
+malloc_heap_init(struct malloc_heap *heap)
+{
+ static rte_spinlock_t init_lock = RTE_SPINLOCK_INITIALIZER;
+ rte_spinlock_lock(&init_lock);
+ if (!heap->initialised) {
+ heap->free_head = NULL;
+ heap->mz_count = 0;
+ heap->numa_socket = malloc_get_numa_socket();
+ rte_spinlock_init(&heap->lock);
+ heap->initialised = INITIALISED;
+ }
+ rte_spinlock_unlock(&init_lock);
+}
+
+/*
+ * Iterates through the freelist for a heap to find a free element
+ * which can store data of the required size and with the requested alignment.
+ * Returns null on failure, or pointer to element on success, with the pointer
+ * to the previous element in the list, if any, being returned in a parameter
+ * (to make removing the element from the free list faster).
+ */
+static struct malloc_elem *
+find_suitable_element(struct malloc_heap *heap, size_t size,
+ unsigned align, struct malloc_elem **prev)
+{
+ struct malloc_elem *elem = heap->free_head;
+ *prev = NULL;
+ while(elem){
+ if (malloc_elem_can_hold(elem, size, align))
+ break;
+ *prev = elem;
+ elem = elem->next_free;
+ }
+ return elem;
+}
+
+/*
+ * Main function called by malloc to allocate a block of memory from the
+ * heap. It locks the free list, scans it, and adds a new memzone if the
+ * scan fails. Once the new memzone is added, it re-scans and should return
+ * the new element after releasing the lock.
+ */
+void *
+malloc_heap_alloc(struct malloc_heap *heap,
+ const char *type __attribute__((unused)), size_t size, unsigned align)
+{
+ if (!heap->initialised)
+ malloc_heap_init(heap);
+
+ size = CACHE_LINE_ROUNDUP(size);
+ align = CACHE_LINE_ROUNDUP(align);
+ rte_spinlock_lock(&heap->lock);
+
+ struct malloc_elem *prev, *elem = find_suitable_element(heap,
+ size, align, &prev);
+ if (elem == NULL){
+ malloc_heap_add_memzone(heap, size, align);
+ elem = find_suitable_element(heap, size, align, &prev);
+ }
+ if (elem != NULL)
+ elem = malloc_elem_alloc(elem, size, align, prev);
+ rte_spinlock_unlock(&heap->lock);
+ return elem == NULL ? NULL : (void *)(&elem[1]);
+}