Home
last modified time | relevance | path

Searched refs:block_size (Results 1 – 2 of 2) sorted by relevance

/src/
A Dmempool.c88 rt_size_t block_size) in rt_mp_init() argument
97 RT_ASSERT(size > 0 && block_size > 0); in rt_mp_init()
107 block_size = RT_ALIGN(block_size, RT_ALIGN_SIZE); in rt_mp_init()
108 mp->block_size = block_size; in rt_mp_init()
178 rt_size_t block_size) in rt_mp_create() argument
188 RT_ASSERT(block_count > 0 && block_size > 0); in rt_mp_create()
197 block_size = RT_ALIGN(block_size, RT_ALIGN_SIZE); in rt_mp_create()
198 mp->block_size = block_size; in rt_mp_create()
199 mp->size = (block_size + sizeof(rt_uint8_t *)) * block_count; in rt_mp_create()
202 mp->start_address = rt_malloc((block_size + sizeof(rt_uint8_t *)) * in rt_mp_create()
[all …]
A Dmemheap.c943 long block_size; in memheaptrace() local
969 block_size = MEMITEM_SIZE(header_ptr); in memheaptrace()
970 if (block_size < 0) in memheaptrace()
974 if (block_size < 1024) in memheaptrace()
975 rt_kprintf("%5d", block_size); in memheaptrace()
976 else if (block_size < 1024 * 1024) in memheaptrace()
977 rt_kprintf("%4dK", block_size / 1024); in memheaptrace()
978 else if (block_size < 1024 * 1024 * 100) in memheaptrace()
979 …rt_kprintf("%2d.%dM", block_size / (1024 * 1024), (block_size % (1024 * 1024) * 10) / (1024 * 102… in memheaptrace()
981 rt_kprintf("%4dM", block_size / (1024 * 1024)); in memheaptrace()

Completed in 3 milliseconds