octeon-sdk/cvmx-malloc/malloc.c

1739         MINSIZE bytes long, it is replenished.
1761 #define MINSIZE  \
1772    low enough so that adding MINSIZE will also not wrap around zero.
1777    (unsigned long)(INTERNAL_SIZE_T)(-2 * MINSIZE))
1788   (((req) + sizeof(void *) + SIZE_SZ + MALLOC_ALIGN_MASK < MINSIZE)  ?             \
1789    MINSIZE :                                                      \
2336       /* top size is always at least MINSIZE */
2337       assert((unsigned long)(sz) >= MINSIZE);
2380   if ((unsigned long)(sz) >= MINSIZE)
2434     assert(chunksize(next) >= MINSIZE);
2461   assert((unsigned long)(sz) >= MINSIZE);
2464   /* chunk is less than MINSIZE more than request */
2466   assert((long)(sz) - (long)(s + MINSIZE) < 0);
2594              (unsigned long)(chunksize(q)) >= MINSIZE);
2795   if (alignment <  MINSIZE) alignment = MINSIZE;
2932     to obtain a size of at least MINSIZE, the smallest allocatable
3032           (unsigned long)(size) > (unsigned long)(nb + MINSIZE)) {
3119 	  if (remainder_size < MINSIZE)  {
3202         if (remainder_size < MINSIZE) {
3239       MINSIZE) after initialization, so if it would otherwise be
3241       reason for ensuring it exists is that we may need MINSIZE space
3248     if ((unsigned long)(size) >= (unsigned long)(nb + MINSIZE)) {
3581           (unsigned long)(nb + MINSIZE)) {
3663     if (remainder_size < MINSIZE) { /* not enough extra to split off */
3718   if (alignment <  MINSIZE) alignment = MINSIZE;
3720   /* Make sure alignment is power of 2 (in case MINSIZE is not).  */
3737   m  = (char*)(_int_malloc(av, nb + alignment + MINSIZE));
3747       leading space in a chunk of at least MINSIZE, if the first
3748       calculation places us at a spot with less than MINSIZE leader,
3755     if ((unsigned long)(brk - (char*)(p)) < MINSIZE)
3785     if ((unsigned long)(size) > (unsigned long)(nb + MINSIZE)) {