Cross Reference: /external/srec/portable/src/pmalloc.c

Lines Matching defs:free
37 #undef free
61    * scanning the free-memory linked list in PortFree(). If SPEEDUP is defined, then
62    * split the memory pool into imaginary 'bins', and keep track of the first free list
108   /* Memory pool free list */
110    * free list entry in each bin. This is to speed up the linked-list search
197     free(memBuffer);
333         _UPD_Altab(q->_Size, q->_Size, 0); /* heap=alloc+free */
365       /* remove *qb cell from free list.
370       /* Check whether the cell is at the end of the 'free' linked-list */
373         /* The cell is not at the end of the free linked-list; find out which bin the next free cell is in */
380             /* The allocated cell was the first free cell in the bin; update the first free cell
381                pointer to point to the next free cell */
389             /* The allocated cell was the only free cell in the bin; update the first free cell
398         /* Cell is at the end of the 'free' linked-list */
401           /* The allocated cell was the first free cell in the bin; there are no following free cells
402              so set the first free cell pointer to NULL */
416       /* remove q from free list, and add *qb to free list.
419       /* remove q from free list */
422       /* now add *qb to its bin's free list if it's the first */
429     _UPD_Altab(0, q->_Size, -q->_Size); /* heap=alloc+free */
436   /* free function */
440   { /* free an allocated data object */
490       /* this is where the SPEEDUP code is sped up : start with the bin's first free cell */
521         /* find the free cell location */
542         /* nothing to do to bin's free list here */
573         /* The q->_Next cell is the first free cell in its bin; set the first free cell
574            pointer to NULL for now; if there is another free cell in the same bin then
575            the first free cell pointer will be updated in next 'if' code block */
578         /* If there is another free cell after q->_Next and it's in the same bin then
579            update the first free cell pointer if necessary */
584           /* The first free cell pointer for q->_Next->_Next's bin can only be set to 0
585              by the code above; if it is 0 then q->_Next->_Next must be the first free
598     _UPD_Altab(0, -size, size); /* heap=alloc+free */
600     /* every successful free "falls off" here */