* mm/mm_heap/mm_initialize.c
*
* SPDX-License-Identifier: Apache-2.0
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership. The
* ASF licenses this file to you 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.
*
****************************************************************************/
* Included Files
****************************************************************************/
#include <nuttx/config.h>
#include <string.h>
#include <assert.h>
#include <debug.h>
#include <nuttx/lib/lib.h>
#include <nuttx/sched_note.h>
#include <nuttx/mm/mm.h>
#include <nuttx/mm/kasan.h>
#include "mm_heap/mm.h"
* Pre-processor Definitions
****************************************************************************/
#if CONFIG_MM_HEAP_MEMPOOL_THRESHOLD > 0
# define MEMPOOL_NPOOLS (CONFIG_MM_HEAP_MEMPOOL_THRESHOLD / MM_MIN_CHUNK)
#endif
* Private Functions
****************************************************************************/
#if defined(CONFIG_MM_HEAP_MEMPOOL) && defined(CONFIG_MM_RECORD_PID)
* Name: mempool_memalign
*
* Description:
* This function call mm_memalign and set mm_backtrace pid to free pid
* avoid repeated calculation.
****************************************************************************/
static FAR void *mempool_memalign(FAR void *arg, size_t alignment,
size_t size)
{
FAR struct mm_allocnode_s *node;
FAR void *ret;
ret = mm_memalign(arg, alignment, size);
if (ret)
{
node = (FAR struct mm_allocnode_s *)
((uintptr_t)ret - MM_SIZEOF_ALLOCNODE);
node->pid = PID_MM_MEMPOOL;
}
return ret;
}
#else
# define mempool_memalign ((mempool_multiple_alloc_t)mm_memalign)
#endif
# define mempool_malloc_size ((mempool_multiple_alloc_size_t)mm_malloc_size)
# define mempool_free ((mempool_multiple_free_t)mm_free)
* Public Functions
****************************************************************************/
* Name: mm_addregion
*
* Description:
* This function adds a region of contiguous memory to the selected heap.
*
* Input Parameters:
* heap - The selected heap
* heapstart - Start of the heap region
* heapsize - Size of the heap region
*
* Returned Value:
* None
*
* Assumptions:
*
****************************************************************************/
void mm_addregion(FAR struct mm_heap_s *heap, FAR void *heapstart,
size_t heapsize)
{
FAR struct mm_freenode_s *node;
uintptr_t heapbase;
uintptr_t heapend;
bool bypass;
#if CONFIG_MM_REGIONS > 1
int idx;
DEBUGVERIFY(nxrmutex_lock(&heap->mm_lock));
bypass = kasan_bypass(true);
idx = heap->mm_nregions;
DEBUGASSERT(idx < CONFIG_MM_REGIONS);
if (idx >= CONFIG_MM_REGIONS)
{
kasan_bypass(bypass);
DEBUGVERIFY(nxrmutex_unlock(&heap->mm_lock));
return;
}
#else
# define idx 0
DEBUGVERIFY(nxrmutex_lock(&heap->mm_lock));
bypass = kasan_bypass(true);
#endif
#if defined(CONFIG_MM_SMALL) && !defined(CONFIG_SMALL_MEMORY)
* for a small heap, then verify that the caller is not doing something
* crazy.
*/
DEBUGASSERT(heapsize <= MMSIZE_MAX + 1);
#endif
#ifdef CONFIG_MM_FILL_ALLOCATIONS
memset(heapstart, MM_INIT_MAGIC, heapsize);
#endif
*
* Note: (uintptr_t)node + MM_SIZEOF_ALLOCNODE is what's actually
* returned to the malloc user, which should have natural alignment.
* (that is, in this implementation, MM_MIN_CHUNK-alignment.)
*/
heapbase = MM_ALIGN_UP((uintptr_t)heapstart + 2 * MM_SIZEOF_ALLOCNODE) -
2 * MM_SIZEOF_ALLOCNODE;
heapsize = MM_ALIGN_DOWN(heapsize - (heapbase - (uintptr_t)heapstart));
* address alignment.
*/
if (!heap->mm_nokasan)
{
kasan_register((void *)heapbase, &heapsize);
}
heapend = MM_ALIGN_DOWN((uintptr_t)heapbase + (uintptr_t)heapsize);
heap->mm_regionsize[idx] = heapsize;
heapsize = heapend - heapbase;
#if defined(CONFIG_FS_PROCFS) && \
!defined(CONFIG_FS_PROCFS_EXCLUDE_MEMINFO) && \
(defined(CONFIG_BUILD_FLAT) || defined(__KERNEL__))
minfo("[%s] Region %d: base=%p size=%zu\n",
heap->mm_procfs ? heap->mm_procfs->name : "unknown",
idx + 1, heapstart, heapsize);
#else
minfo("Region %d: base=%p size=%zu\n", idx + 1, heapstart, heapsize);
#endif
heap->mm_heapsize += heapsize;
* the heap. These only serve to keep us from allocating outside
* of the heap.
*
* And create one free node between the guard nodes that contains
* all available memory.
*/
heap->mm_heapstart[idx] = (FAR struct mm_allocnode_s *)heapbase;
MM_RECORD(heap, heap->mm_heapstart[idx]);
heap->mm_heapstart[idx]->size = MM_SIZEOF_ALLOCNODE | MM_ALLOC_BIT;
node = (FAR struct mm_freenode_s *)
(heapbase + MM_SIZEOF_ALLOCNODE);
DEBUGASSERT((((uintptr_t)node + MM_SIZEOF_ALLOCNODE) % MM_ALIGN) == 0);
node->size = heapsize - 2 * MM_SIZEOF_ALLOCNODE;
heap->mm_heapend[idx] = (FAR struct mm_allocnode_s *)
(heapend - MM_SIZEOF_ALLOCNODE);
heap->mm_heapend[idx]->size = MM_SIZEOF_ALLOCNODE | MM_ALLOC_BIT |
MM_PREVFREE_BIT;
heap->mm_heapend[idx]->preceding = node->size;
MM_RECORD(heap, heap->mm_heapend[idx]);
#undef idx
#if CONFIG_MM_REGIONS > 1
heap->mm_nregions++;
#endif
mm_addfreechunk(heap, node);
heap->mm_curused += 2 * MM_SIZEOF_ALLOCNODE;
sched_note_heap(NOTE_HEAP_ADD, heap, heapstart, heapsize,
heap->mm_curused);
kasan_bypass(bypass);
DEBUGVERIFY(nxrmutex_unlock(&heap->mm_lock));
}
* Name: mm_initialize_heap
*
* Description:
* Initialize the selected heap data structures, providing the initial
* heap region.
*
* Input Parameters:
* config - The heap config structure
* heap - The heap instance
*
* Returned Value:
* None
*
* Assumptions:
*
****************************************************************************/
void mm_initialize_heap(FAR const struct mm_heap_config_s *config,
FAR struct mm_heap_s **heap)
{
FAR const char *name = config->name;
FAR void *heapstart = config->start;
size_t heapsize = config->size;
int i;
minfo("Heap: name=%s, start=%p size=%zu\n", name, heapstart, heapsize);
if (!config->allocheap)
{
uintptr_t heap_adj = MM_ALIGN_UP((uintptr_t)heapstart);
heapsize -= heap_adj - (uintptr_t)heapstart;
DEBUGASSERT(heapsize > sizeof(struct mm_heap_s));
*heap = (FAR struct mm_heap_s *)heap_adj;
heapsize -= sizeof(struct mm_heap_s);
heapstart = (FAR char *)heap_adj + sizeof(struct mm_heap_s);
DEBUGASSERT(MM_MIN_CHUNK >= MM_SIZEOF_ALLOCNODE);
memset(*heap, 0, sizeof(struct mm_heap_s));
(*heap)->mm_curused = sizeof(struct mm_heap_s);
}
else
{
*heap = lib_memalign(MM_ALIGN, sizeof(struct mm_heap_s));
DEBUGASSERT(*heap != NULL);
memset(*heap, 0, sizeof(struct mm_heap_s));
}
(*heap)->mm_nokasan = config->nokasan;
for (i = 1; i < MM_NNODES; i++)
{
(*heap)->mm_nodelist[i - 1].flink = &(*heap)->mm_nodelist[i];
(*heap)->mm_nodelist[i].blink = &(*heap)->mm_nodelist[i - 1];
}
* a-time access to private data sets).
*/
nxrmutex_init(&(*heap)->mm_lock);
mm_addregion(*heap, heapstart, heapsize);
#if defined(CONFIG_FS_PROCFS) && !defined(CONFIG_FS_PROCFS_EXCLUDE_MEMINFO)
# if defined(CONFIG_BUILD_FLAT) || defined(__KERNEL__)
(*heap)->mm_procfs = procfs_register_meminfo(name, *heap, NULL, NULL);
# endif
#endif
}
#ifdef CONFIG_MM_HEAP_MEMPOOL
void mm_initialize_pool(FAR const struct mm_heap_config_s *config,
FAR const struct mm_pool_config_s *poolconfig,
FAR struct mm_heap_s **heap)
{
#if CONFIG_MM_HEAP_MEMPOOL_THRESHOLD > 0
size_t poolsize[MEMPOOL_NPOOLS];
#endif
struct mm_pool_config_s def;
if (poolconfig)
{
memcpy(&def, poolconfig, sizeof(struct mm_pool_config_s));
}
else
{
memset(&def, 0, sizeof(struct mm_pool_config_s));
}
#if CONFIG_MM_HEAP_MEMPOOL_THRESHOLD > 0
if (def.poolsize == 0 || def.npools == 0)
{
int i;
for (i = 0; i < MEMPOOL_NPOOLS; i++)
{
#if CONFIG_MM_MIN_BLKSIZE != 0
poolsize[i] = (i + 1) * CONFIG_MM_MIN_BLKSIZE;
#else
poolsize[i] = (i + 1) * MM_MIN_CHUNK;
#endif
}
def.poolsize = poolsize;
def.npools = MEMPOOL_NPOOLS;
}
if (def.threshold == 0)
{
def.threshold = CONFIG_MM_HEAP_MEMPOOL_THRESHOLD;
}
if (def.chunksize == 0)
{
def.chunksize = CONFIG_MM_HEAP_MEMPOOL_CHUNK_SIZE;
}
if (def.init_chunksize == 0)
{
def.init_chunksize = CONFIG_MM_HEAP_MEMPOOL_INIT_CHUNK_SIZE;
}
if (def.expandsize == 0)
{
def.expandsize = CONFIG_MM_HEAP_MEMPOOL_EXPAND_SIZE;
}
if (def.dict_expendsize == 0)
{
def.dict_expendsize = CONFIG_MM_HEAP_MEMPOOL_DICTIONARY_EXPAND_SIZE;
}
#endif
mm_initialize_heap(config, heap);
(*heap)->mm_threshold = def.threshold;
if (def.poolsize != NULL && def.npools != 0)
{
(*heap)->mm_mpool = mempool_multiple_init(config->name,
&def,
mempool_memalign,
mempool_malloc_size,
mempool_free,
*heap);
}
}
#endif
* Name: mm_uninitialize
*
* Description:
* Uninitialize the selected heap data structures.
*
* Input Parameters:
* heap - The heap to uninitialize
*
* Returned Value:
* None
*
****************************************************************************/
void mm_uninitialize(FAR struct mm_heap_s *heap)
{
int i;
#ifdef CONFIG_MM_HEAP_MEMPOOL
mempool_multiple_deinit(heap->mm_mpool);
#endif
mm_free_delaylist(heap);
for (i = 0; i < CONFIG_MM_REGIONS; i++)
{
if (!heap->mm_nokasan)
{
kasan_unregister(heap->mm_heapstart[i],
heap->mm_regionsize[i]);
}
sched_note_heap(NOTE_HEAP_REMOVE, heap, heap->mm_heapstart[i],
(uintptr_t)heap->mm_heapend[i] -
(uintptr_t)heap->mm_heapstart[i], heap->mm_curused);
}
#if defined(CONFIG_FS_PROCFS) && (defined(CONFIG_BUILD_FLAT) || \
defined(__KERNEL__)) && !defined(CONFIG_FS_PROCFS_EXCLUDE_MEMINFO)
procfs_unregister_meminfo(heap->mm_procfs);
#endif
nxrmutex_destroy(&heap->mm_lock);
}