Lines Matching defs:next
23 * sufficient free blocks (using a next-fit-like approach) followed by
79 * or offset of next block if -ve (in SLOB_UNITs).
81 * Free blocks of size 1 unit simply contain the offset of the next block.
83 * memory, and the offset of the next free block in the second SLOB_UNIT.
144 * Encode the given size and next info into a free slob block s.
146 static void set_slob(slob_t *s, slobidx_t size, slob_t *next)
149 slobidx_t offset = next - base;
169 * Return the next free slob block pointer after this one.
174 slobidx_t next;
177 next = -s[0].units;
179 next = s[1].units;
180 return base+next;
261 slob_t *next;
264 next = slob_next(cur);
265 set_slob(aligned, avail - delta, next);
272 next = slob_next(cur);
275 set_slob(prev, slob_units(prev), next);
277 sp->freelist = next;
283 set_slob(cur + units, avail - units, next);
346 * search time by starting our next search here. (see
385 slob_t *prev, *next, *b = (slob_t *)block;
442 next = slob_next(prev);
443 while (b > next) {
444 prev = next;
445 next = slob_next(prev);
448 if (!slob_last(prev) && b + units == next) {
449 units += slob_units(next);
450 set_slob(b, units, slob_next(next));
452 set_slob(b, units, next);