Lines Matching refs:next
693 u32 next; /* offset of next header from start of pool */ member
768 if (!h->next) in debug_kmalloc()
771 h = (struct debug_alloc_header *)(debug_alloc_pool + h->next); in debug_kmalloc()
777 if (best->next == 0 && bestprev == NULL && rem < dah_overhead) in debug_kmalloc()
785 h->next = best->next; in debug_kmalloc()
787 h_offset = best->next; in debug_kmalloc()
792 bestprev->next = h_offset; in debug_kmalloc()
825 h->next = dah_first; in debug_kfree()
833 if (!prev->next || prev->next > h_offset) in debug_kfree()
836 (debug_alloc_pool + prev->next); in debug_kfree()
846 h->next = prev->next; in debug_kfree()
847 prev->next = h_offset; in debug_kfree()
850 if (h_offset + dah_overhead + h->size == h->next) { in debug_kfree()
851 struct debug_alloc_header *next; in debug_kfree() local
852 next = (struct debug_alloc_header *) in debug_kfree()
853 (debug_alloc_pool + h->next); in debug_kfree()
854 h->size += dah_overhead + next->size; in debug_kfree()
855 h->next = next->next; in debug_kfree()
856 memset(next, POISON_FREE, dah_overhead - 1); in debug_kfree()
857 *((char *)next + dah_overhead - 1) = POISON_END; in debug_kfree()
899 (debug_alloc_pool + h_free->next); in debug_kusage()
900 } while (h_free->next); in debug_kusage()