Lines Matching refs:next
18 * next paragraph) shall be included in all copies or substantial portions
85 list[(unsigned)list[i].next].prev = list[i].prev;
86 list[(unsigned)list[i].prev].next = list[i].next;
91 list[i].next = list[nr].next;
92 list[(unsigned)list[nr].next].prev = (unsigned char)i;
93 list[nr].next = (unsigned char)i;
112 newblock->next = p->next;
114 p->next->prev = newblock;
115 p->next = newblock;
129 newblock->next = p->next;
131 p->next->prev = newblock;
132 p->next = newblock;
148 for (p = heap->next; p != heap; p = p->next) {
161 for (p = heap->next; p != heap; p = p->next)
172 for (p = heap->next; p != heap; p = p->next)
186 if (p->next->filp == NULL) {
187 struct mem_block *q = p->next;
189 p->next = q->next;
190 p->next->prev = p;
197 q->next = p->next;
198 q->next->prev = q;
221 blocks->next = blocks->prev = *heap;
225 (*heap)->next = (*heap)->prev = blocks;
235 if (!heap || !heap->next)
238 for (p = heap->next; p != heap; p = p->next) {
248 for (p = heap->next; p != heap; p = p->next) {
249 while (p->filp == NULL && p->next->filp == NULL) {
250 struct mem_block *q = p->next;
252 p->next = q->next;
253 p->next->prev = p;
268 for (p = (*heap)->next; p != *heap;) {
270 p = p->next;