Lines Matching refs:_Next
276 for (q = p->_Head; q != 0; q = q->_Next)
280 if (q->_Next != 0)
283 _PTR_NORM((char *)q->_Next));
284 passert(_PTR_NORM(q) < _PTR_NORM(q->_Next));
304 qb = &(*qb)->_Next)
310 for (; *qb != 0; qb = &(*qb)->_Next)
315 qb = &(*qb)->_Next)
371 if (0 != ((*qb)->_Next))
374 qbNextBin = GET_MEM_BIN((*qb)->_Next);
382 binsFirstFreeCell[qbsBin] = (*qb)->_Next;
407 *qb = q->_Next;
412 (*qb)->_Next = q->_Next;
467 q->_Next = _Aldata._Head;
483 while ((nextCell = qp->_Next) != 0
485 qp = qp->_Next;
495 while ((nextCell = qp->_Next) != 0
498 qp = qp->_Next;
522 _Next) != 0
524 qp = qp->_Next;
546 else if (qp->_Next != 0 && _PTR_NORM((char *)qp->_Next)
548 return; /* erroneous call, overlaps qp->_Next */
557 q->_Next = qp->_Next;
558 qp->_Next = q;
561 if (q->_Next != 0 && _PTR_NORM((char *)q + q->_Size)
562 == _PTR_NORM((char *)q->_Next))
563 { /* merge q and q->_Next (merge with latter cell) */
566 * if q->_Next was first in bin, now it's its Next.
569 qNextBin = GET_MEM_BIN(q->_Next);
571 if (binsFirstFreeCell[qNextBin] == q->_Next)
573 /* The q->_Next cell is the first free cell in its bin; set the first free cell
578 /* If there is another free cell after q->_Next and it's in the same bin then
580 if (0 != (q->_Next->_Next))
582 qNextNextBin = GET_MEM_BIN(q->_Next->_Next);
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
589 binsFirstFreeCell[qNextNextBin] = q->_Next->_Next;
595 q->_Size += q->_Next->_Size;
596 q->_Next = q->_Next->_Next;
