Lines Matching refs:big
169 #define MAXSIZE 256 /* arbitrary, big enough, for requestsize */
220 * Add big to the oversize hash table at the head of the relevant bucket.
223 insert_hash(oversize_t *big)
225 caddr_t ret = big->addr;
229 big->hash_next = ovsz_hashtab[bucket];
230 ovsz_hashtab[bucket] = big;
382 oversize_t *big, **opp;
385 big = (oversize_t *)(mem - OVSZ_SIZE);
388 bucket = HASH_OVERSIZE(big->addr);
391 if (*opp == big)
401 *opp = big->hash_next; /* remove big from the hash table */
402 big->hash_next = NULL;
405 copy_pattern(FREEPATTERN, ptr, big->size);
406 add_oversize(big);
530 oversize_t *orig, *tail, *big;
601 big = oversize_header_alloc(ret_addr -
604 insert_hash(big);
669 * If the chunk is not big enough
673 big = oversize_header_alloc(ret_addr -
677 insert_hash(big);
712 big = oversize_header_alloc(ret_addr -
715 insert_hash(big);
815 * end is a bunch of well-aligned stuff in a big initial allocation.
1171 * The request size is too big. We need to do this in
1199 oversize_t *big;
1223 if ((big = find_oversize(size)) != NULL) {
1225 if (verify_pattern(FREEPATTERN, big->addr, size))
1235 big = oversize_header_alloc((uintptr_t)ret, size);
1237 ret = big->addr;
1239 insert_hash(big);
1405 * Find memory on our list that is at least size big. If we find a block that is
1406 * big enough, we break it up and return the associated oversize_t struct back
1417 if (wp == &oversize_list) /* empty list or nothing big enough */