2022-07-20 15:37:26 +02:00
|
|
|
/****************************************************************************
|
|
|
|
* mm/mempool/mempool.c
|
|
|
|
*
|
|
|
|
* 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
|
|
|
|
****************************************************************************/
|
|
|
|
|
2023-03-10 01:20:48 +01:00
|
|
|
#include <assert.h>
|
2022-07-20 15:37:26 +02:00
|
|
|
#include <stdbool.h>
|
2022-11-06 16:27:44 +01:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <syslog.h>
|
2022-07-20 15:37:26 +02:00
|
|
|
|
|
|
|
#include <nuttx/kmalloc.h>
|
|
|
|
#include <nuttx/mm/mempool.h>
|
2023-05-09 07:46:05 +02:00
|
|
|
#include <nuttx/sched.h>
|
2022-07-20 15:37:26 +02:00
|
|
|
|
2022-10-24 11:29:34 +02:00
|
|
|
#include "kasan/kasan.h"
|
|
|
|
|
2022-11-06 16:27:44 +01:00
|
|
|
#if UINTPTR_MAX <= UINT32_MAX
|
|
|
|
# define MM_PTR_FMT_WIDTH 11
|
|
|
|
#elif UINTPTR_MAX <= UINT64_MAX
|
|
|
|
# define MM_PTR_FMT_WIDTH 19
|
|
|
|
#endif
|
|
|
|
|
2022-11-23 15:08:13 +01:00
|
|
|
#undef ALIGN_UP
|
|
|
|
#define ALIGN_UP(x, a) (((x) + ((a) - 1)) & (~((a) - 1)))
|
2022-11-06 16:27:44 +01:00
|
|
|
|
2022-07-20 15:37:26 +02:00
|
|
|
/****************************************************************************
|
|
|
|
* Private Functions
|
|
|
|
****************************************************************************/
|
|
|
|
|
2022-11-25 17:22:12 +01:00
|
|
|
static inline FAR sq_entry_t *mempool_remove_queue(FAR sq_queue_t *queue)
|
|
|
|
{
|
|
|
|
if (!sq_empty(queue))
|
|
|
|
{
|
|
|
|
FAR sq_entry_t *entry = queue->head;
|
|
|
|
|
|
|
|
queue->head = entry->flink;
|
|
|
|
return entry;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline size_t mempool_queue_lenth(FAR sq_queue_t *queue)
|
|
|
|
{
|
|
|
|
FAR sq_entry_t *node;
|
|
|
|
size_t count;
|
|
|
|
|
|
|
|
for (node = queue->head, count = 0;
|
|
|
|
node != NULL;
|
|
|
|
node = node->flink, count++);
|
|
|
|
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void mempool_add_queue(FAR sq_queue_t *queue,
|
|
|
|
FAR char *base, size_t nblks,
|
|
|
|
size_t blocksize)
|
2022-07-20 15:37:26 +02:00
|
|
|
{
|
|
|
|
while (nblks-- > 0)
|
|
|
|
{
|
2022-11-25 17:22:12 +01:00
|
|
|
sq_addfirst((FAR sq_entry_t *)(base + blocksize * nblks), queue);
|
2022-07-20 15:37:26 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-11-06 16:27:44 +01:00
|
|
|
#if CONFIG_MM_BACKTRACE >= 0
|
|
|
|
static inline void mempool_add_backtrace(FAR struct mempool_s *pool,
|
|
|
|
FAR struct mempool_backtrace_s *buf)
|
|
|
|
{
|
|
|
|
list_add_head(&pool->alist, &buf->node);
|
2023-02-01 11:05:58 +01:00
|
|
|
buf->pid = _SCHED_GETTID();
|
2023-05-05 10:52:30 +02:00
|
|
|
buf->seqno = g_mm_seqno++;
|
2022-11-06 16:27:44 +01:00
|
|
|
# if CONFIG_MM_BACKTRACE > 0
|
|
|
|
if (pool->procfs.backtrace)
|
|
|
|
{
|
2023-05-10 16:13:20 +02:00
|
|
|
int result = sched_backtrace(buf->pid, buf->backtrace,
|
|
|
|
CONFIG_MM_BACKTRACE,
|
|
|
|
CONFIG_MM_HEAP_MEMPOOL_BACKTRACE_SKIP);
|
2022-11-24 12:36:21 +01:00
|
|
|
if (result < CONFIG_MM_BACKTRACE)
|
2022-11-06 16:27:44 +01:00
|
|
|
{
|
2022-11-24 12:36:21 +01:00
|
|
|
buf->backtrace[result] = NULL;
|
2022-11-06 16:27:44 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
buf->backtrace[0] = NULL;
|
|
|
|
}
|
|
|
|
# endif
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2022-07-20 15:37:26 +02:00
|
|
|
/****************************************************************************
|
|
|
|
* Public Functions
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
/****************************************************************************
|
|
|
|
* Name: mempool_init
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Initialize a memory pool.
|
2022-08-14 04:28:05 +02:00
|
|
|
* The user needs to specify the initialization information of mempool
|
2022-10-28 16:42:14 +02:00
|
|
|
* including blocksize, initialsize, expandsize, interruptsize.
|
2022-07-20 15:37:26 +02:00
|
|
|
*
|
|
|
|
* Input Parameters:
|
2022-08-14 04:28:05 +02:00
|
|
|
* pool - Address of the memory pool to be used.
|
|
|
|
* name - The name of memory pool.
|
2022-07-20 15:37:26 +02:00
|
|
|
*
|
|
|
|
* Returned Value:
|
|
|
|
* Zero on success; A negated errno value is returned on any failure.
|
|
|
|
*
|
|
|
|
****************************************************************************/
|
|
|
|
|
2022-08-14 04:28:05 +02:00
|
|
|
int mempool_init(FAR struct mempool_s *pool, FAR const char *name)
|
2022-07-20 15:37:26 +02:00
|
|
|
{
|
2023-02-01 13:00:25 +01:00
|
|
|
size_t blocksize = MEMPOOL_REALBLOCKSIZE(pool);
|
2022-07-20 15:37:26 +02:00
|
|
|
|
2022-11-25 17:22:12 +01:00
|
|
|
sq_init(&pool->queue);
|
|
|
|
sq_init(&pool->iqueue);
|
|
|
|
sq_init(&pool->equeue);
|
2022-08-14 04:28:05 +02:00
|
|
|
|
2022-11-06 16:27:44 +01:00
|
|
|
#if CONFIG_MM_BACKTRACE >= 0
|
|
|
|
list_initialize(&pool->alist);
|
2022-11-25 17:22:12 +01:00
|
|
|
#else
|
|
|
|
pool->nalloc = 0;
|
2022-11-06 16:27:44 +01:00
|
|
|
#endif
|
|
|
|
|
2023-05-28 16:01:43 +02:00
|
|
|
if (pool->interruptsize >= blocksize)
|
2022-07-20 15:37:26 +02:00
|
|
|
{
|
2023-05-28 16:01:43 +02:00
|
|
|
size_t ninterrupt = pool->interruptsize / blocksize;
|
|
|
|
size_t size = ninterrupt * blocksize;
|
2022-11-25 17:22:12 +01:00
|
|
|
|
2022-11-26 16:44:38 +01:00
|
|
|
pool->ibase = pool->alloc(pool, size);
|
2022-11-25 17:22:12 +01:00
|
|
|
if (pool->ibase == NULL)
|
|
|
|
{
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
mempool_add_queue(&pool->iqueue, pool->ibase, ninterrupt, blocksize);
|
|
|
|
kasan_poison(pool->ibase, size);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
pool->ibase = NULL;
|
|
|
|
}
|
|
|
|
|
2023-05-28 17:54:01 +02:00
|
|
|
if (pool->initialsize >= blocksize + sizeof(sq_entry_t))
|
2022-11-25 17:22:12 +01:00
|
|
|
{
|
|
|
|
size_t ninitial = (pool->initialsize - sizeof(sq_entry_t)) / blocksize;
|
|
|
|
size_t size = ninitial * blocksize + sizeof(sq_entry_t);
|
2022-10-31 08:09:47 +01:00
|
|
|
FAR char *base;
|
|
|
|
|
2022-11-26 16:44:38 +01:00
|
|
|
base = pool->alloc(pool, size);
|
2022-09-16 10:55:09 +02:00
|
|
|
if (base == NULL)
|
|
|
|
{
|
2023-02-16 05:28:54 +01:00
|
|
|
if (pool->ibase)
|
|
|
|
{
|
|
|
|
pool->free(pool, pool->ibase);
|
|
|
|
}
|
|
|
|
|
2022-09-16 10:55:09 +02:00
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
2022-11-25 17:22:12 +01:00
|
|
|
mempool_add_queue(&pool->queue, base, ninitial, blocksize);
|
|
|
|
sq_addlast((FAR sq_entry_t *)(base + ninitial * blocksize),
|
|
|
|
&pool->equeue);
|
|
|
|
kasan_poison(base, size);
|
2022-07-20 15:37:26 +02:00
|
|
|
}
|
|
|
|
|
2023-09-15 20:57:03 +02:00
|
|
|
spin_initialize(&pool->lock, SP_UNLOCKED);
|
2022-10-28 16:42:14 +02:00
|
|
|
if (pool->wait && pool->expandsize == 0)
|
2022-08-14 04:28:05 +02:00
|
|
|
{
|
|
|
|
nxsem_init(&pool->waitsem, 0, 0);
|
|
|
|
}
|
2022-07-20 15:37:26 +02:00
|
|
|
|
2022-11-05 17:44:53 +01:00
|
|
|
#if defined(CONFIG_FS_PROCFS) && !defined(CONFIG_FS_PROCFS_EXCLUDE_MEMPOOL)
|
2022-07-29 06:17:14 +02:00
|
|
|
mempool_procfs_register(&pool->procfs, name);
|
2022-11-06 16:27:44 +01:00
|
|
|
# ifdef CONFIG_MM_BACKTRACE_DEFAULT
|
|
|
|
pool->procfs.backtrace = true;
|
|
|
|
# endif
|
2022-07-29 06:17:14 +02:00
|
|
|
#endif
|
|
|
|
|
2022-07-20 15:37:26 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/****************************************************************************
|
|
|
|
* Name: mempool_alloc
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Allocate an block from a specific memory pool.
|
|
|
|
*
|
|
|
|
* If there isn't enough memory blocks, This function will expand memory
|
2022-10-28 16:42:14 +02:00
|
|
|
* pool if expandsize isn't zero.
|
2022-07-20 15:37:26 +02:00
|
|
|
*
|
|
|
|
* Input Parameters:
|
|
|
|
* pool - Address of the memory pool to be used.
|
|
|
|
*
|
|
|
|
* Returned Value:
|
|
|
|
* The pointer to the allocated block on success; NULL on any failure.
|
|
|
|
*
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
FAR void *mempool_alloc(FAR struct mempool_s *pool)
|
|
|
|
{
|
2022-11-25 17:22:12 +01:00
|
|
|
FAR sq_entry_t *blk;
|
2022-07-20 15:37:26 +02:00
|
|
|
irqstate_t flags;
|
|
|
|
|
|
|
|
retry:
|
|
|
|
flags = spin_lock_irqsave(&pool->lock);
|
2022-11-25 17:22:12 +01:00
|
|
|
blk = mempool_remove_queue(&pool->queue);
|
2022-07-20 15:37:26 +02:00
|
|
|
if (blk == NULL)
|
|
|
|
{
|
|
|
|
if (up_interrupt_context())
|
|
|
|
{
|
2022-11-25 17:22:12 +01:00
|
|
|
blk = mempool_remove_queue(&pool->iqueue);
|
2022-07-20 15:37:26 +02:00
|
|
|
if (blk == NULL)
|
|
|
|
{
|
|
|
|
goto out_with_lock;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2023-05-28 17:54:01 +02:00
|
|
|
size_t blocksize = MEMPOOL_REALBLOCKSIZE(pool);
|
|
|
|
|
2022-07-20 15:37:26 +02:00
|
|
|
spin_unlock_irqrestore(&pool->lock, flags);
|
2023-05-28 17:54:01 +02:00
|
|
|
if (pool->expandsize >= blocksize + sizeof(sq_entry_t))
|
2022-07-20 15:37:26 +02:00
|
|
|
{
|
2022-11-25 17:22:12 +01:00
|
|
|
size_t nexpand = (pool->expandsize - sizeof(sq_entry_t)) /
|
|
|
|
blocksize;
|
|
|
|
size_t size = nexpand * blocksize + sizeof(sq_entry_t);
|
2022-11-26 16:44:38 +01:00
|
|
|
FAR char *base = pool->alloc(pool, size);
|
2022-10-31 08:09:47 +01:00
|
|
|
|
2022-11-25 17:22:12 +01:00
|
|
|
if (base == NULL)
|
2022-07-20 15:37:26 +02:00
|
|
|
{
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2022-11-25 17:22:12 +01:00
|
|
|
kasan_poison(base, size);
|
2022-07-20 15:37:26 +02:00
|
|
|
flags = spin_lock_irqsave(&pool->lock);
|
2022-11-25 17:22:12 +01:00
|
|
|
mempool_add_queue(&pool->queue, base, nexpand, blocksize);
|
|
|
|
sq_addlast((FAR sq_entry_t *)(base + nexpand * blocksize),
|
|
|
|
&pool->equeue);
|
|
|
|
blk = mempool_remove_queue(&pool->queue);
|
2022-07-20 15:37:26 +02:00
|
|
|
}
|
2022-08-14 04:28:05 +02:00
|
|
|
else if (!pool->wait ||
|
|
|
|
nxsem_wait_uninterruptible(&pool->waitsem) < 0)
|
2022-07-20 15:37:26 +02:00
|
|
|
{
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
goto retry;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2023-09-05 07:44:14 +02:00
|
|
|
#ifdef CONFIG_MM_FILL_ALLOCATIONS
|
2024-03-04 05:17:29 +01:00
|
|
|
memset(blk, MM_ALLOC_MAGIC, pool->blocksize);
|
2023-09-05 07:44:14 +02:00
|
|
|
#endif
|
|
|
|
|
2022-11-06 16:27:44 +01:00
|
|
|
#if CONFIG_MM_BACKTRACE >= 0
|
|
|
|
mempool_add_backtrace(pool, (FAR struct mempool_backtrace_s *)
|
|
|
|
((FAR char *)blk + pool->blocksize));
|
2022-11-25 17:22:12 +01:00
|
|
|
#else
|
|
|
|
pool->nalloc++;
|
2022-11-06 16:27:44 +01:00
|
|
|
#endif
|
2022-10-28 16:42:14 +02:00
|
|
|
kasan_unpoison(blk, pool->blocksize);
|
2022-07-20 15:37:26 +02:00
|
|
|
out_with_lock:
|
|
|
|
spin_unlock_irqrestore(&pool->lock, flags);
|
|
|
|
return blk;
|
|
|
|
}
|
|
|
|
|
|
|
|
/****************************************************************************
|
|
|
|
* Name: mempool_free
|
|
|
|
*
|
|
|
|
* Description:
|
2023-11-24 16:56:47 +01:00
|
|
|
* Release a memory block to the pool.
|
2022-07-20 15:37:26 +02:00
|
|
|
*
|
|
|
|
* Input Parameters:
|
|
|
|
* pool - Address of the memory pool to be used.
|
|
|
|
* blk - The pointer of memory block.
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
void mempool_free(FAR struct mempool_s *pool, FAR void *blk)
|
|
|
|
{
|
2022-11-30 17:35:25 +01:00
|
|
|
irqstate_t flags = spin_lock_irqsave(&pool->lock);
|
2023-02-01 13:00:25 +01:00
|
|
|
size_t blocksize = MEMPOOL_REALBLOCKSIZE(pool);
|
2022-11-06 16:27:44 +01:00
|
|
|
#if CONFIG_MM_BACKTRACE >= 0
|
|
|
|
FAR struct mempool_backtrace_s *buf =
|
2022-11-25 17:22:12 +01:00
|
|
|
(FAR struct mempool_backtrace_s *)((FAR char *)blk + pool->blocksize);
|
2022-11-06 16:27:44 +01:00
|
|
|
|
2023-08-11 08:42:59 +02:00
|
|
|
/* Check double free */
|
|
|
|
|
|
|
|
DEBUGASSERT(list_in_list(&buf->node));
|
2022-11-06 16:27:44 +01:00
|
|
|
list_delete(&buf->node);
|
|
|
|
#else
|
2022-11-25 17:22:12 +01:00
|
|
|
pool->nalloc--;
|
2022-11-06 16:27:44 +01:00
|
|
|
#endif
|
2022-07-20 15:37:26 +02:00
|
|
|
|
2023-09-05 07:44:14 +02:00
|
|
|
#ifdef CONFIG_MM_FILL_ALLOCATIONS
|
2024-03-04 05:17:29 +01:00
|
|
|
memset(blk, MM_FREE_MAGIC, pool->blocksize);
|
2023-09-05 07:44:14 +02:00
|
|
|
#endif
|
|
|
|
|
2022-11-25 17:22:12 +01:00
|
|
|
if (pool->interruptsize > blocksize)
|
2022-07-20 15:37:26 +02:00
|
|
|
{
|
2022-11-25 17:22:12 +01:00
|
|
|
if ((FAR char *)blk >= pool->ibase &&
|
|
|
|
(FAR char *)blk < pool->ibase + pool->interruptsize - blocksize)
|
2022-09-09 10:01:49 +02:00
|
|
|
{
|
2022-11-25 17:22:12 +01:00
|
|
|
sq_addfirst(blk, &pool->iqueue);
|
2022-09-09 10:01:49 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2022-11-25 17:22:12 +01:00
|
|
|
sq_addfirst(blk, &pool->queue);
|
2022-09-09 10:01:49 +02:00
|
|
|
}
|
2022-07-20 15:37:26 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2022-11-25 17:22:12 +01:00
|
|
|
sq_addfirst(blk, &pool->queue);
|
2022-07-20 15:37:26 +02:00
|
|
|
}
|
|
|
|
|
2022-10-28 16:42:14 +02:00
|
|
|
kasan_poison(blk, pool->blocksize);
|
2022-07-20 15:37:26 +02:00
|
|
|
spin_unlock_irqrestore(&pool->lock, flags);
|
2022-10-28 16:42:14 +02:00
|
|
|
if (pool->wait && pool->expandsize == 0)
|
2022-07-20 15:37:26 +02:00
|
|
|
{
|
|
|
|
int semcount;
|
|
|
|
|
2022-08-14 04:28:05 +02:00
|
|
|
nxsem_get_value(&pool->waitsem, &semcount);
|
2022-07-20 15:37:26 +02:00
|
|
|
if (semcount < 1)
|
|
|
|
{
|
2022-08-14 04:28:05 +02:00
|
|
|
nxsem_post(&pool->waitsem);
|
2022-07-20 15:37:26 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-07-29 06:17:14 +02:00
|
|
|
/****************************************************************************
|
|
|
|
* Name: mempool_info
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* mempool_info returns a copy of updated current mempool information.
|
|
|
|
*
|
|
|
|
* Input Parameters:
|
|
|
|
* pool - Address of the memory pool to be used.
|
|
|
|
* info - The pointer of mempoolinfo.
|
|
|
|
*
|
|
|
|
* Returned Value:
|
|
|
|
* OK on success; A negated errno value on any failure.
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
int mempool_info(FAR struct mempool_s *pool, FAR struct mempoolinfo_s *info)
|
|
|
|
{
|
2023-05-28 16:01:43 +02:00
|
|
|
size_t blocksize = MEMPOOL_REALBLOCKSIZE(pool);
|
2022-07-29 06:17:14 +02:00
|
|
|
irqstate_t flags;
|
|
|
|
|
2022-09-09 10:01:49 +02:00
|
|
|
DEBUGASSERT(pool != NULL && info != NULL);
|
2022-07-29 06:17:14 +02:00
|
|
|
|
|
|
|
flags = spin_lock_irqsave(&pool->lock);
|
2022-11-25 17:22:12 +01:00
|
|
|
info->ordblks = mempool_queue_lenth(&pool->queue);
|
|
|
|
info->iordblks = mempool_queue_lenth(&pool->iqueue);
|
|
|
|
#if CONFIG_MM_BACKTRACE >= 0
|
|
|
|
info->aordblks = list_length(&pool->alist);
|
|
|
|
#else
|
|
|
|
info->aordblks = pool->nalloc;
|
|
|
|
#endif
|
2023-05-28 16:01:43 +02:00
|
|
|
info->arena =
|
2023-05-28 17:47:14 +02:00
|
|
|
mempool_queue_lenth(&pool->equeue) * sizeof(sq_entry_t) +
|
2023-05-28 16:01:43 +02:00
|
|
|
(info->aordblks + info->ordblks + info->iordblks) * blocksize;
|
2022-07-29 06:17:14 +02:00
|
|
|
spin_unlock_irqrestore(&pool->lock, flags);
|
2023-05-28 16:01:43 +02:00
|
|
|
info->sizeblks = blocksize;
|
2022-10-28 16:42:14 +02:00
|
|
|
if (pool->wait && pool->expandsize == 0)
|
2022-07-29 06:17:14 +02:00
|
|
|
{
|
|
|
|
int semcount;
|
|
|
|
|
2022-08-14 04:28:05 +02:00
|
|
|
nxsem_get_value(&pool->waitsem, &semcount);
|
2022-07-29 06:17:14 +02:00
|
|
|
info->nwaiter = -semcount;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
info->nwaiter = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2022-11-06 16:27:44 +01:00
|
|
|
/****************************************************************************
|
|
|
|
* Name: mempool_info_task
|
|
|
|
****************************************************************************/
|
|
|
|
|
2023-05-28 13:30:37 +02:00
|
|
|
struct mallinfo_task
|
2023-05-05 10:52:30 +02:00
|
|
|
mempool_info_task(FAR struct mempool_s *pool,
|
2023-05-28 13:23:56 +02:00
|
|
|
FAR const struct malltask *task)
|
2022-11-06 16:27:44 +01:00
|
|
|
{
|
2023-05-28 16:01:43 +02:00
|
|
|
size_t blocksize = MEMPOOL_REALBLOCKSIZE(pool);
|
2023-02-07 13:49:04 +01:00
|
|
|
irqstate_t flags = spin_lock_irqsave(&pool->lock);
|
2023-05-28 13:30:37 +02:00
|
|
|
struct mallinfo_task info =
|
2023-05-05 10:52:30 +02:00
|
|
|
{
|
|
|
|
0, 0
|
|
|
|
};
|
2023-02-07 13:49:04 +01:00
|
|
|
|
2023-05-28 14:09:42 +02:00
|
|
|
if (task->pid == PID_MM_FREE)
|
2022-11-06 16:27:44 +01:00
|
|
|
{
|
2022-11-25 17:22:12 +01:00
|
|
|
size_t count = mempool_queue_lenth(&pool->queue) +
|
|
|
|
mempool_queue_lenth(&pool->iqueue);
|
2022-11-06 16:27:44 +01:00
|
|
|
|
2023-05-05 10:52:30 +02:00
|
|
|
info.aordblks += count;
|
2023-05-28 16:01:43 +02:00
|
|
|
info.uordblks += count * blocksize;
|
2022-11-06 16:27:44 +01:00
|
|
|
}
|
2023-05-26 12:15:19 +02:00
|
|
|
#if CONFIG_MM_BACKTRACE < 0
|
2023-05-28 14:09:42 +02:00
|
|
|
else if (task->pid == PID_MM_ALLOC)
|
2022-11-06 16:27:44 +01:00
|
|
|
{
|
2023-05-28 14:09:42 +02:00
|
|
|
info.aordblks += pool->nalloc;
|
2023-05-28 16:01:43 +02:00
|
|
|
info.uordblks += pool->nalloc * blocksize;
|
2022-11-06 16:27:44 +01:00
|
|
|
}
|
2023-05-26 12:15:19 +02:00
|
|
|
#else
|
2022-11-06 16:27:44 +01:00
|
|
|
else
|
|
|
|
{
|
|
|
|
FAR struct mempool_backtrace_s *buf;
|
2022-11-25 17:22:12 +01:00
|
|
|
|
2023-09-11 11:52:17 +02:00
|
|
|
list_for_every_entry(&pool->alist, buf,
|
|
|
|
struct mempool_backtrace_s, node)
|
2022-11-06 16:27:44 +01:00
|
|
|
{
|
2023-09-11 11:52:17 +02:00
|
|
|
if ((MM_DUMP_ASSIGN(task->pid, buf->pid) ||
|
|
|
|
MM_DUMP_ALLOC(task->pid, buf->pid) ||
|
|
|
|
MM_DUMP_LEAK(task->pid, buf->pid)) &&
|
2023-05-28 14:09:42 +02:00
|
|
|
buf->seqno >= task->seqmin && buf->seqno <= task->seqmax)
|
2022-11-06 16:27:44 +01:00
|
|
|
{
|
2023-05-28 14:09:42 +02:00
|
|
|
info.aordblks++;
|
2023-05-28 16:01:43 +02:00
|
|
|
info.uordblks += blocksize;
|
2022-11-06 16:27:44 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2023-02-07 13:49:04 +01:00
|
|
|
spin_unlock_irqrestore(&pool->lock, flags);
|
2023-05-05 10:52:30 +02:00
|
|
|
return info;
|
2022-11-06 16:27:44 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/****************************************************************************
|
|
|
|
* Name: mempool_memdump
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* mempool_memdump returns a memory info about specified pid of
|
|
|
|
* task/thread. if pid equals -1, this function will dump all allocated
|
|
|
|
* node and output backtrace for every allocated node for this mempool,
|
|
|
|
* if pid equals -2, this function will dump all free node for this
|
|
|
|
* mempool, and if pid is greater than or equal to 0, will dump pid
|
|
|
|
* allocated node and output backtrace.
|
|
|
|
*
|
|
|
|
* Input Parameters:
|
|
|
|
* pool - Address of the memory pool to be used.
|
2023-05-05 10:52:30 +02:00
|
|
|
* dump - The information of what need dump.
|
2022-11-06 16:27:44 +01:00
|
|
|
*
|
|
|
|
* Returned Value:
|
|
|
|
* OK on success; A negated errno value on any failure.
|
|
|
|
****************************************************************************/
|
|
|
|
|
2023-05-05 10:52:30 +02:00
|
|
|
void mempool_memdump(FAR struct mempool_s *pool,
|
|
|
|
FAR const struct mm_memdump_s *dump)
|
2022-11-06 16:27:44 +01:00
|
|
|
{
|
2023-05-28 16:01:43 +02:00
|
|
|
size_t blocksize = MEMPOOL_REALBLOCKSIZE(pool);
|
|
|
|
|
2023-05-28 14:09:42 +02:00
|
|
|
if (dump->pid == PID_MM_FREE)
|
2022-11-06 16:27:44 +01:00
|
|
|
{
|
2022-11-25 17:22:12 +01:00
|
|
|
FAR sq_entry_t *entry;
|
|
|
|
|
|
|
|
sq_for_every(&pool->queue, entry)
|
2022-11-06 16:27:44 +01:00
|
|
|
{
|
|
|
|
syslog(LOG_INFO, "%12zu%*p\n",
|
2023-05-28 16:01:43 +02:00
|
|
|
blocksize, MM_PTR_FMT_WIDTH, (FAR char *)entry);
|
2022-11-25 17:22:12 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
sq_for_every(&pool->iqueue, entry)
|
|
|
|
{
|
|
|
|
syslog(LOG_INFO, "%12zu%*p\n",
|
2023-05-28 16:01:43 +02:00
|
|
|
blocksize, MM_PTR_FMT_WIDTH, (FAR char *)entry);
|
2022-11-06 16:27:44 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
#if CONFIG_MM_BACKTRACE >= 0
|
|
|
|
else
|
|
|
|
{
|
|
|
|
FAR struct mempool_backtrace_s *buf;
|
2022-11-25 17:22:12 +01:00
|
|
|
|
2023-05-28 18:44:04 +02:00
|
|
|
list_for_every_entry(&pool->alist, buf,
|
|
|
|
struct mempool_backtrace_s, node)
|
2022-11-06 16:27:44 +01:00
|
|
|
{
|
2023-09-11 11:52:17 +02:00
|
|
|
if ((MM_DUMP_ASSIGN(dump->pid, buf->pid) ||
|
|
|
|
MM_DUMP_ALLOC(dump->pid, buf->pid) ||
|
|
|
|
MM_DUMP_LEAK(dump->pid, buf->pid)) &&
|
2023-05-28 14:09:42 +02:00
|
|
|
buf->seqno >= dump->seqmin && buf->seqno <= dump->seqmax)
|
2022-11-06 16:27:44 +01:00
|
|
|
{
|
2023-05-28 18:44:04 +02:00
|
|
|
char tmp[CONFIG_MM_BACKTRACE * MM_PTR_FMT_WIDTH + 1] = "";
|
|
|
|
|
2022-11-06 16:27:44 +01:00
|
|
|
# if CONFIG_MM_BACKTRACE > 0
|
|
|
|
FAR const char *format = " %0*p";
|
2023-05-28 18:44:04 +02:00
|
|
|
int i;
|
2022-11-06 16:27:44 +01:00
|
|
|
|
|
|
|
for (i = 0; i < CONFIG_MM_BACKTRACE && buf->backtrace[i]; i++)
|
|
|
|
{
|
2023-05-28 18:44:04 +02:00
|
|
|
snprintf(tmp + i * MM_PTR_FMT_WIDTH,
|
|
|
|
sizeof(tmp) - i * MM_PTR_FMT_WIDTH,
|
2023-03-05 15:34:33 +01:00
|
|
|
format, MM_PTR_FMT_WIDTH - 1, buf->backtrace[i]);
|
2022-11-06 16:27:44 +01:00
|
|
|
}
|
|
|
|
# endif
|
|
|
|
|
2023-05-05 10:52:30 +02:00
|
|
|
syslog(LOG_INFO, "%6d%12zu%12lu%*p%s\n",
|
2023-06-18 22:20:04 +02:00
|
|
|
buf->pid, blocksize, buf->seqno,
|
2023-05-28 18:44:04 +02:00
|
|
|
MM_PTR_FMT_WIDTH, ((FAR char *)buf - blocksize), tmp);
|
2022-11-06 16:27:44 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2022-07-20 15:37:26 +02:00
|
|
|
/****************************************************************************
|
|
|
|
* Name: mempool_deinit
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Deallocate a memory pool.
|
|
|
|
*
|
|
|
|
* Input Parameters:
|
|
|
|
* pool - Address of the memory pool to be used.
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
int mempool_deinit(FAR struct mempool_s *pool)
|
|
|
|
{
|
2023-02-01 13:00:25 +01:00
|
|
|
size_t blocksize = MEMPOOL_REALBLOCKSIZE(pool);
|
2022-11-25 17:22:12 +01:00
|
|
|
FAR sq_entry_t *blk;
|
|
|
|
size_t count = 0;
|
2022-07-20 15:37:26 +02:00
|
|
|
|
2022-11-25 17:22:12 +01:00
|
|
|
#if CONFIG_MM_BACKTRACE >= 0
|
|
|
|
if (!list_is_empty(&pool->alist))
|
|
|
|
#else
|
|
|
|
if (pool->nalloc != 0)
|
|
|
|
#endif
|
2022-07-20 15:37:26 +02:00
|
|
|
{
|
|
|
|
return -EBUSY;
|
|
|
|
}
|
|
|
|
|
2023-05-28 17:54:01 +02:00
|
|
|
if (pool->initialsize >= blocksize + sizeof(sq_entry_t))
|
2022-11-06 16:27:44 +01:00
|
|
|
{
|
2022-11-25 17:22:12 +01:00
|
|
|
count = (pool->initialsize - sizeof(sq_entry_t)) / blocksize;
|
2022-11-06 16:27:44 +01:00
|
|
|
}
|
|
|
|
|
2022-10-31 08:09:47 +01:00
|
|
|
if (count == 0)
|
|
|
|
{
|
2023-05-28 17:54:01 +02:00
|
|
|
if (pool->expandsize >= blocksize + sizeof(sq_entry_t))
|
2022-11-25 17:22:12 +01:00
|
|
|
{
|
|
|
|
count = (pool->expandsize - sizeof(sq_entry_t)) / blocksize;
|
|
|
|
}
|
2022-10-31 08:09:47 +01:00
|
|
|
}
|
|
|
|
|
2022-11-25 17:22:12 +01:00
|
|
|
#if defined(CONFIG_FS_PROCFS) && !defined(CONFIG_FS_PROCFS_EXCLUDE_MEMPOOL)
|
|
|
|
mempool_procfs_unregister(&pool->procfs);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
while ((blk = mempool_remove_queue(&pool->equeue)) != NULL)
|
2022-07-20 15:37:26 +02:00
|
|
|
{
|
2022-11-25 17:22:12 +01:00
|
|
|
blk = (FAR sq_entry_t *)((FAR char *)blk - count * blocksize);
|
2022-11-26 16:44:38 +01:00
|
|
|
pool->free(pool, blk);
|
2023-05-28 17:54:01 +02:00
|
|
|
if (pool->expandsize >= blocksize + sizeof(sq_entry_t))
|
2022-11-25 17:22:12 +01:00
|
|
|
{
|
|
|
|
count = (pool->expandsize - sizeof(sq_entry_t)) / blocksize;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (pool->ibase)
|
|
|
|
{
|
2022-11-26 16:44:38 +01:00
|
|
|
pool->free(pool, pool->ibase);
|
2022-07-20 15:37:26 +02:00
|
|
|
}
|
|
|
|
|
2022-10-28 16:42:14 +02:00
|
|
|
if (pool->wait && pool->expandsize == 0)
|
2022-08-14 04:28:05 +02:00
|
|
|
{
|
|
|
|
nxsem_destroy(&pool->waitsem);
|
|
|
|
}
|
|
|
|
|
2022-07-20 15:37:26 +02:00
|
|
|
return 0;
|
|
|
|
}
|