Skip to content

[mem]When using SLAB, calls to memcheck and memtrace will be abnormal #8862

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
BernardXiong merged 2 commits into from
Apr 27, 2024
Merged

[mem]When using SLAB, calls to memcheck and memtrace will be abnormal #8862

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
b524018
[mem]When using SLAB, calls to memcheck and memtrace will be abnormal
wdfk-prog Apr 25, 2024
d905902
[mem]The memtrace printing system does not match the display
wdfk-prog Apr 27, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
21 changes: 17 additions & 4 deletions src/mem.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
/*
* Copyright (c) 2006-2022, RT-Thread Development Team
* Copyright (c) 2006-2024, RT-Thread Development Team
*
* SPDX-License-Identifier: Apache-2.0
*
Expand Down Expand Up @@ -565,9 +565,16 @@ static int memcheck(int argc, char *argv[])
object = rt_list_entry(node, struct rt_object, list);
/* find the specified object */
if (name != RT_NULL && rt_strncmp(name, object->name, RT_NAME_MAX) != 0)
{
continue;
}
/* mem object */
m = (struct rt_small_mem *)object;
if(rt_strncmp(m->parent.algorithm, "small", RT_NAME_MAX) != 0)
{
continue;
}

/* check mem */
for (mem = (struct rt_small_mem_item *)m->heap_ptr; mem != m->heap_end; mem = (struct rt_small_mem_item *)&m->heap_ptr[mem->next])
{
Expand Down Expand Up @@ -611,15 +618,21 @@ static int memtrace(int argc, char **argv)
object = rt_list_entry(node, struct rt_object, list);
/* find the specified object */
if (name != RT_NULL && rt_strncmp(name, object->name, RT_NAME_MAX) != 0)
{
continue;
}
/* mem object */
m = (struct rt_small_mem *)object;
if(rt_strncmp(m->parent.algorithm, "small", RT_NAME_MAX) != 0)
{
continue;
}
/* show memory information */
rt_kprintf("\nmemory heap address:\n");
rt_kprintf("name : %s\n", m->parent.parent.name);
rt_kprintf("total : 0x%d\n", m->parent.total);
rt_kprintf("used : 0x%d\n", m->parent.used);
rt_kprintf("max_used: 0x%d\n", m->parent.max);
rt_kprintf("total : %d\n", m->parent.total);
rt_kprintf("used : %d\n", m->parent.used);
rt_kprintf("max_used: %d\n", m->parent.max);
rt_kprintf("heap_ptr: 0x%08x\n", m->heap_ptr);
rt_kprintf("lfree : 0x%08x\n", m->lfree);
rt_kprintf("heap_end: 0x%08x\n", m->heap_end);
Expand Down