Home
last modified time | relevance | path

Searched refs:memp_pools (Results 1 – 3 of 3) sorted by relevance

/third_party/lwip/src/core/
Dmemp.c81 const struct memp_desc *const memp_pools[MEMP_MAX] = { variable
157 p = (struct memp *)LWIP_MEM_ALIGN(memp_pools[i]->base); in memp_overflow_check_all()
158 for (j = 0; j < memp_pools[i]->num; ++j) { in memp_overflow_check_all()
159 memp_overflow_check_element(p, memp_pools[i]); in memp_overflow_check_all()
160 …p = LWIP_ALIGNMENT_CAST(struct memp *, ((u8_t *)p + MEMP_SIZE + memp_pools[i]->size + MEM_SANITY_R… in memp_overflow_check_all()
229 for (i = 0; i < LWIP_ARRAYSIZE(memp_pools); i++) { in memp_init()
230 memp_init_pool(memp_pools[i]); in memp_init()
233 lwip_stats.memp[i] = memp_pools[i]->stats; in memp_init()
350 memp = do_memp_malloc_pool(memp_pools[type]); in memp_malloc()
352 memp = do_memp_malloc_pool_fn(memp_pools[type], file, line); in memp_malloc()
[all …]
Dmem.c261 if (required_size <= memp_pools[poolnr]->size) { in mem_malloc()
295 memset((u8_t *)ret + size, 0xcd, memp_pools[poolnr]->size - size); in mem_malloc()
328 hmem->size <= memp_pools[hmem->poolnr]->size); in mem_free()
330 for (i = hmem->size; i < memp_pools[hmem->poolnr]->size; i++) { in mem_free()
/third_party/lwip/src/include/lwip/
Dmemp.h61 extern const struct memp_desc* const memp_pools[MEMP_MAX];