Lines Matching refs:next
30 * NOTE: We are only using the next-> link. The prev-> link is
71 struct memlist *next, *buf;
73 next = *list;
74 while (next) {
75 buf = next;
76 next = buf->ml_next;
88 struct memlist *prev = 0, *next;
91 next = *listp;
92 while (next && next->ml_address <= addr) {
97 if (next->ml_address <= addr &&
98 next->ml_address + next->ml_size >= addr + size) {
99 /* next already contains this entire element; drop */
104 if (next->ml_address == addr) {
107 prev = next;
108 next = prev->ml_next;
112 merge_right = (next && addr + size == next->ml_address);
114 prev->ml_size += size + next->ml_size;
115 prev->ml_next = next->ml_next;
116 memlist_free(next);
126 next->ml_address = addr;
127 next->ml_size += size;
138 entry->ml_next = next;
208 /* fall-through to next chunk */
225 struct memlist *prev = 0, *next;
228 next = *listp;
229 while (next) {
230 delta = next->ml_address & ((align != 0) ? (align - 1) : 0);
235 if (next->ml_size >= total_size)
237 prev = next;
238 next = prev->ml_next;
241 if (next == 0)
244 paddr = next->ml_address;
262 struct memlist *next;
265 next = *listp;
266 while (next && (next->ml_address != address)) {
267 next = next->ml_next;
269 if (next == 0)
272 delta = next->ml_address & ((align != 0) ? (align - 1) : 0);
277 if (next->ml_size < total_size)
280 paddr = next->ml_address;