Lines Matching refs:big
198 #define MAXSIZE 512 /* arbitrary, big enough, for requestsize */
273 * Add big to the oversize hash table at the head of the relevant bucket.
276 insert_hash(oversize_t *big)
278 caddr_t ret = big->addr;
282 big->hash_next = ovsz_hashtab[bucket];
283 ovsz_hashtab[bucket] = big;
287 remove_hash(oversize_t *big)
290 int bucket = HASH_OVERSIZE(big->addr);
295 if (*opp == big)
301 *opp = big->hash_next; /* remove big from the hash table */
302 big->hash_next = NULL;
466 oversize_t *big;
468 big = (oversize_t *)(mem - OVSZ_SIZE);
471 if (remove_hash(big) == -1) {
479 * big is the oversize_t
480 * big->addr is what was returned from malloc
481 * big->size is length
483 * madvise(big->addr, big->size, MADV_FREE)
489 * madvise(addr+offset, big->size - offset, MADV_FREE);
491 if (do_realfree && (big->size >= do_realfree)) {
492 page_offset = ((ulong_t)big->addr)%MTPAGESIZE;
495 i = madvise(big->addr + page_offset, big->size -
500 copy_pattern(FREEPATTERN, ptr, big->size);
501 add_oversize(big);
624 oversize_t *orig, *tail, *big;
695 big = oversize_header_alloc(ret_addr -
698 insert_hash(big);
763 * If the chunk is not big enough
767 big = oversize_header_alloc(ret_addr -
771 insert_hash(big);
806 big = oversize_header_alloc(ret_addr -
809 insert_hash(big);
1062 * end is a bunch of well-aligned stuff in a big initial allocation.
1680 * The request size is too big. We need to do this in
1708 oversize_t *big;
1732 if ((big = find_oversize(size)) != NULL) {
1734 if (verify_pattern(FREEPATTERN, big->addr, size))
1744 big = oversize_header_alloc((uintptr_t)ret, size);
1746 ret = big->addr;
1748 /* Add big to the hash table at the head of the relevant bucket. */
1749 insert_hash(big);
1915 * Find memory on our list that is at least size big. If we find a block that is
1916 * big enough, we break it up and return the associated oversize_t struct back
1927 if (wp == &oversize_list) /* empty list or nothing big enough */