Lines Matching defs:ptr
451 ptr_to_mem(mem_size_t ptr)
453 return (struct mem *)(void *)&ram[ptr];
577 LWIP_ASSERT("heap element prev ptr valid", mem->prev == 0);
578 LWIP_ASSERT("heap element next ptr valid", mem->next <= MEM_SIZE_ALIGNED);
579 LWIP_ASSERT("heap element next ptr aligned", LWIP_MEM_ALIGN(ptr_to_mem(mem->next) == ptr_to_mem(mem->next)));
586 LWIP_ASSERT("heap element prev ptr valid", mem->prev <= MEM_SIZE_ALIGNED);
587 LWIP_ASSERT("heap element next ptr valid", mem->next <= MEM_SIZE_ALIGNED);
588 LWIP_ASSERT("heap element prev ptr aligned", LWIP_MEM_ALIGN(ptr_to_mem(mem->prev) == ptr_to_mem(mem->prev)));
589 LWIP_ASSERT("heap element next ptr aligned", LWIP_MEM_ALIGN(ptr_to_mem(mem->next) == ptr_to_mem(mem->next)));
603 LWIP_ASSERT("heap end ptr sanity", mem == ptr_to_mem(MEM_SIZE_ALIGNED));
605 LWIP_ASSERT("heap element prev ptr valid", mem->prev == MEM_SIZE_ALIGNED);
606 LWIP_ASSERT("heap element next ptr valid", mem->next == MEM_SIZE_ALIGNED);
702 mem_size_t ptr, ptr2;
737 ptr = mem_to_ptr(mem);
739 size = (mem_size_t)((mem_size_t)(mem->next - ptr) - (SIZEOF_STRUCT_MEM + MEM_SANITY_OVERHEAD));
757 LWIP_ASSERT("invalid next ptr", mem->next != MEM_SIZE_ALIGNED);
761 ptr2 = (mem_size_t)(ptr + SIZEOF_STRUCT_MEM + newsize);
770 mem2->prev = ptr;
789 ptr2 = (mem_size_t)(ptr + SIZEOF_STRUCT_MEM + newsize);
790 LWIP_ASSERT("invalid next ptr", mem->next != MEM_SIZE_ALIGNED);
797 mem2->prev = ptr;
833 mem_size_t ptr, ptr2, size;
870 for (ptr = mem_to_ptr(lfree); ptr < MEM_SIZE_ALIGNED - size;
871 ptr = ptr_to_mem(ptr)->next) {
872 mem = ptr_to_mem(ptr);
887 (mem->next - (ptr + SIZEOF_STRUCT_MEM)) >= size) {
889 * mem->next - (ptr + SIZEOF_STRUCT_MEM) gives us the 'user data size' of mem */
891 if (mem->next - (ptr + SIZEOF_STRUCT_MEM) >= (size + SIZEOF_STRUCT_MEM + MIN_SIZE_ALIGNED)) {
896 * mem->next - (ptr + (2*SIZEOF_STRUCT_MEM)) == size,
902 ptr2 = (mem_size_t)(ptr + SIZEOF_STRUCT_MEM + size);
903 LWIP_ASSERT("invalid next ptr",ptr2 != MEM_SIZE_ALIGNED);
908 mem2->prev = ptr;