Lines Matching full:cell
363 /* use entire cell (there's not enough space to carve out a new cell from this one) */
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 */
410 { /* peel off a residual cell */
490 /* this is where the SPEEDUP code is sped up : start with the bin's first free cell */
521 /* find the free cell location */
541 { /* merge qp and q (merge with prior cell) */
563 { /* merge q and q->_Next (merge with latter cell) */
565 /* lose 1 cell here - this could change first entry in bin.
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
586 cell in the bin */
