Lines Matching refs:next
16 * next paragraph) shall be included in all copies or substantial portions
76 list[(unsigned)list[i].next].prev = list[i].prev;
77 list[(unsigned)list[i].prev].next = list[i].next;
82 list[i].next = list[nr].next;
83 list[(unsigned)list[nr].next].prev = i;
84 list[nr].next = i;
104 newblock->next = p->next;
106 p->next->prev = newblock;
107 p->next = newblock;
121 newblock->next = p->next;
123 p->next->prev = newblock;
124 p->next = newblock;
140 for (p = heap->next; p != heap; p = p->next) {
153 for (p = heap->next; p != heap; p = p->next)
167 if (p->next->file_priv == NULL) {
168 struct mem_block *q = p->next;
170 p->next = q->next;
171 p->next->prev = p;
178 q->next = p->next;
179 q->next->prev = q;
202 blocks->next = blocks->prev = *heap;
206 (*heap)->next = (*heap)->prev = blocks;
217 if (!heap || !heap->next)
220 for (p = heap->next; p != heap; p = p->next) {
230 for (p = heap->next; p != heap; p = p->next) {
231 while (p->file_priv == NULL && p->next->file_priv == NULL) {
232 struct mem_block *q = p->next;
234 p->next = q->next;
235 p->next->prev = p;
250 for (p = (*heap)->next; p != *heap;) {
252 p = p->next;