Lines Matching refs:top
1846 mchunkptr top; member
1980 av->top = initial_top (av); in malloc_init_state()
2084 char *max_address = (char *) (av->top) + chunksize (av->top); in do_check_chunk()
2090 if (p != av->top) in do_check_chunk()
2095 assert (((char *) p + sz) <= ((char *) (av->top))); in do_check_chunk()
2109 if (contiguous (av) && av->top != initial_top (av)) in do_check_chunk()
2145 assert (next == av->top || inuse (next)); in do_check_free_chunk()
2186 if (next == av->top) in do_check_inuse_chunk()
2279 assert (av->top != 0); in do_check_malloc_state()
2282 if (av->top == initial_top (av)) in do_check_malloc_state()
2291 (char *) av->top + chunksize (av->top)); in do_check_malloc_state()
2391 (q != av->top && inuse (q) && in do_check_malloc_state()
2399 check_chunk (av, av->top); in do_check_malloc_state()
2606 old_top = av->top; in sysmalloc()
2648 top (av) = chunk_at_offset (heap, sizeof (*heap)); in sysmalloc()
2649 set_head (top (av), (heap->size - sizeof (*heap)) | PREV_INUSE); in sysmalloc()
2711 uintptr_t top = ALIGN_UP ((uintptr_t) __curbrk + size, in sysmalloc() local
2713 size = top - (uintptr_t) __curbrk; in sysmalloc()
2895 av->top = (mchunkptr) aligned_brk; in sysmalloc()
2896 set_head (av->top, (snd_brk - aligned_brk + correction) | PREV_INUSE); in sysmalloc()
2946 p = av->top; in sysmalloc()
2954 av->top = remainder; in sysmalloc()
2986 top_size = chunksize (av->top); in systrim()
3008 if (current_brk == (char *) (av->top) + top_size) in systrim()
3033 set_head (av->top, (top_size - released) | PREV_INUSE); in systrim()
3657 oldtop = top (av); in __libc_calloc()
3658 oldtopsize = chunksize (top (av)); in __libc_calloc()
4369 victim = av->top; in _int_malloc()
4379 av->top = remainder; in _int_malloc()
4500 && (chunk_at_offset(p, size) != av->top) in _int_free()
4582 if (__glibc_unlikely (p == av->top)) in _int_free()
4587 >= ((char *) av->top + chunksize(av->top)), 0)) in _int_free()
4610 if (nextchunk != av->top) { in _int_free()
4655 av->top = p; in _int_free()
4678 if ((unsigned long)(chunksize(av->top)) >= in _int_free()
4685 heap_info *heap = heap_for_ptr(top(av)); in _int_free()
4775 if (nextchunk != av->top) { in malloc_consolidate()
4802 av->top = p; in malloc_consolidate()
4854 if (next == av->top && in _int_realloc()
4859 av->top = chunk_at_offset (oldp, nb); in _int_realloc()
4860 set_head (av->top, (newsize - nb) | PREV_INUSE); in _int_realloc()
4866 else if (next != av->top && in _int_realloc()
5163 avail = chunksize (av->top); in int_mallinfo()
5208 m->keepcost = chunksize (av->top); in int_mallinfo()
5287 dump_heap (heap_for_ptr (top (ar_ptr))); in __malloc_stats()
5752 avail = chunksize (ar_ptr->top); in weak_alias()
5822 heap_info *heap = heap_for_ptr (top (ar_ptr)); in weak_alias()