166 lines
4.6 KiB
C
166 lines
4.6 KiB
C
/*-
|
|
* 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.
|
|
*
|
|
*/
|
|
|
|
#include <stdint.h>
|
|
#include <stddef.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <sys/queue.h>
|
|
|
|
#include <rte_memcpy.h>
|
|
#include <rte_memory.h>
|
|
#include <rte_memzone.h>
|
|
#include <rte_tailq.h>
|
|
#include <rte_eal.h>
|
|
#include <rte_branch_prediction.h>
|
|
#include <rte_debug.h>
|
|
#include <rte_launch.h>
|
|
#include <rte_per_lcore.h>
|
|
#include <rte_lcore.h>
|
|
#include <rte_common.h>
|
|
#include <rte_spinlock.h>
|
|
|
|
#include <rte_malloc.h>
|
|
#include "malloc_elem.h"
|
|
#include "malloc_heap.h"
|
|
|
|
static struct malloc_heap malloc_heap[RTE_MAX_NUMA_NODES] = {
|
|
{ .initialised = NOT_INITIALISED }
|
|
};
|
|
|
|
/* Free the memory space back to heap */
|
|
void rte_free(void *addr)
|
|
{
|
|
if (addr == NULL) return;
|
|
if (malloc_elem_free(malloc_elem_from_data(addr)) < 0)
|
|
rte_panic("Fatal error: Invalid memory\n");
|
|
}
|
|
|
|
/*
|
|
* Allocate memory on default heap.
|
|
*/
|
|
void *
|
|
rte_malloc(const char *type, size_t size, unsigned align)
|
|
{
|
|
unsigned malloc_socket = malloc_get_numa_socket();
|
|
/* return NULL if size is 0 or alignment is not power-of-2 */
|
|
if (size == 0 || !rte_is_power_of_2(align))
|
|
return NULL;
|
|
return malloc_heap_alloc(&malloc_heap[malloc_socket], type,
|
|
size, align == 0 ? 1 : align);
|
|
}
|
|
|
|
/*
|
|
* Allocate zero'd memory on default heap.
|
|
*/
|
|
void *
|
|
rte_zmalloc(const char *type, size_t size, unsigned align)
|
|
{
|
|
void *ptr = rte_malloc(type, size, align);
|
|
|
|
if (ptr != NULL)
|
|
memset(ptr, 0, size);
|
|
return ptr;
|
|
}
|
|
|
|
/*
|
|
* Allocate zero'd memory on default heap.
|
|
*/
|
|
void *
|
|
rte_calloc(const char *type, size_t num, size_t size, unsigned align)
|
|
{
|
|
return rte_zmalloc(type, num * size, align);
|
|
}
|
|
|
|
/*
|
|
* Resize allocated memory.
|
|
*/
|
|
void *
|
|
rte_realloc(void *ptr, size_t size, unsigned align)
|
|
{
|
|
if (ptr == NULL)
|
|
return rte_malloc(NULL, size, align);
|
|
|
|
struct malloc_elem *elem = malloc_elem_from_data(ptr);
|
|
if (elem == NULL)
|
|
rte_panic("Fatal error: memory corruption detected\n");
|
|
|
|
size = CACHE_LINE_ROUNDUP(size), align = CACHE_LINE_ROUNDUP(align);
|
|
/* check alignment matches first, and if ok, see if we can resize block */
|
|
if (RTE_ALIGN(ptr,align) == ptr &&
|
|
malloc_elem_resize(elem, size) == 0)
|
|
return ptr;
|
|
|
|
/* either alignment is off, or we have no room to expand,
|
|
* so move data. */
|
|
void *new_ptr = rte_malloc(NULL, size, align);
|
|
if (new_ptr == NULL)
|
|
return NULL;
|
|
const unsigned old_size = elem->size - MALLOC_ELEM_OVERHEAD;
|
|
rte_memcpy(new_ptr, ptr, old_size < size ? old_size : size);
|
|
rte_free(ptr);
|
|
|
|
return new_ptr;
|
|
}
|
|
|
|
int
|
|
rte_malloc_validate(void *ptr, size_t *size)
|
|
{
|
|
struct malloc_elem *elem = malloc_elem_from_data(ptr);
|
|
if (!malloc_elem_cookies_ok(elem))
|
|
return -1;
|
|
if (size != NULL)
|
|
*size = elem->size - elem->pad - MALLOC_ELEM_OVERHEAD;
|
|
return 0;
|
|
}
|
|
/*
|
|
* TODO: Print stats on memory type. If type is NULL, info on all types is printed
|
|
*/
|
|
void
|
|
rte_malloc_dump_stats(__rte_unused const char *type)
|
|
{
|
|
return;
|
|
}
|
|
|
|
/*
|
|
* TODO: Set limit to memory that can be allocated to memory type
|
|
*/
|
|
int
|
|
rte_malloc_set_limit(__rte_unused const char *type,
|
|
__rte_unused size_t max)
|
|
{
|
|
return 0;
|
|
}
|
|
|