Lines Matching defs:prev
352 /** index (-> ram[prev]) of the previous struct */
353 mem_size_t prev;
494 ptr_to_mem(nmem->next)->prev = mem_to_ptr(mem);
499 pmem = ptr_to_mem(mem->prev);
501 /* if mem->prev is unused, combine mem and mem->prev */
507 ptr_to_mem(mem->next)->prev = mem_to_ptr(pmem);
528 mem->prev = 0;
534 ram_end->prev = MEM_SIZE_ALIGNED;
557 pmem = ptr_to_mem(mem->prev);
558 if ((mem->next > MEM_SIZE_ALIGNED) || (mem->prev > MEM_SIZE_ALIGNED) ||
559 ((mem->prev != rmem_idx) && (pmem->next != rmem_idx)) ||
560 ((nmem != ram_end) && (nmem->prev != rmem_idx))) {
577 LWIP_ASSERT("heap element prev ptr valid", mem->prev == 0);
586 LWIP_ASSERT("heap element prev ptr valid", mem->prev <= MEM_SIZE_ALIGNED);
588 LWIP_ASSERT("heap element prev ptr aligned", LWIP_MEM_ALIGN(ptr_to_mem(mem->prev) == ptr_to_mem(mem->prev)));
605 LWIP_ASSERT("heap element prev ptr valid", mem->prev == MEM_SIZE_ALIGNED);
679 /* finally, see if prev or next are free also */
770 mem2->prev = ptr;
774 * let 'mem2->next->prev' point to mem2 again. but only if mem2->next is not
777 ptr_to_mem(mem2->next)->prev = ptr2;
797 mem2->prev = ptr;
800 ptr_to_mem(mem2->next)->prev = ptr2;
908 mem2->prev = ptr;
914 ptr_to_mem(mem2->next)->prev = ptr2;