Lines Matching refs:next
18 struct FreeElemRec *next;
34 pool->freeList->next = NULL;
41 FreeElem *i, *next;
42 for (i = pool->freeList; i; i = next)
44 next = i->next;
76 pool->freeList = pool->freeList->next;
82 f->prev->next = f->next;
83 f->next->prev = f->prev;
102 f = f->next;
123 for (i = pool->freeList; i && i->next && i->next->min < first; i = i->next)
131 if (!i->next && i->max == first)
138 if (i->next && i->max+1 >= i->next->min)
141 i->next->min = i->min;
142 i->next->prev = i->prev;
145 i->prev->next = i->next;
149 pool->freeList = i->next;
156 /* Case: j->next: (first+1, ~) */
157 if (i->next && i->next->min - count == first)
159 i->next->min -= count;
160 if (i->max + 1 >= i->next->min)
163 i->next->min = i->min;
164 i->next->prev = i->prev;
167 i->prev->next = i->next;
171 pool->freeList = i->next;
178 /* Case: j: (first+1, ~) j->next: null */
179 if (!i->next && i->min - count == first)
190 /* Case: j: (~,first-(2+)) j->next: (first+(2+), ~) or null */
194 newelem->next = i->next;
195 if (i->next)
197 i->next->prev = newelem;
199 i->next = newelem;
207 newelem->next = i;
247 newelem->next = f->next;
248 if (f->next)
249 f->next->prev = newelem;
251 f->next = newelem;
255 f = f->next;
270 for (i = pool->freeList; i && !(i->min <= id && id <= i->max); i=i->next)