Lines Matching defs:next
38 * the caller-usable region represented by the block. The next and
41 * address of the next and previous blocks in the list. ("address 0",
55 apr_rmm_off_t next;
76 static apr_rmm_off_t find_block_by_offset(apr_rmm_t *rmm, apr_rmm_off_t next,
81 while (next) {
82 struct rmm_block_t *blk = (rmm_block_t*)((char*)rmm->base + next);
84 if (find == next)
85 return next;
88 if (find < next)
91 prev = next;
92 next = blk->next;
99 apr_rmm_off_t next = rmm->base->firstfree;
103 while (next) {
104 struct rmm_block_t *blk = (rmm_block_t*)((char*)rmm->base + next);
107 return next;
116 best = next;
120 next = blk->next;
128 new->next = blk->next;
132 blk->next = best + size;
134 if (new->next) {
135 blk = (rmm_block_t*)((char*)rmm->base + new->next);
150 prev->next = blk->next;
154 rmm->base->firstused = blk->next;
157 rmm->base->firstfree = blk->next;
160 if (blk->next) {
161 struct rmm_block_t *next = (rmm_block_t*)((char*)rmm->base + blk->next);
162 next->prev = blk->prev;
169 blk->next = rmm->base->firstfree;
176 blk->next = rmm->base->firstused;
191 blk->next = prev->next;
192 prev->next = this;
196 if (blk->next) {
197 struct rmm_block_t *next = (rmm_block_t*)((char*)rmm->base + blk->next);
198 if (free && (this + blk->size == blk->next)) {
200 blk->size += next->size;
201 blk->next = next->next;
202 if (blk->next) {
203 next = (rmm_block_t*)((char*)rmm->base + blk->next);
204 next->prev = this;
208 next->prev = this;
243 blk->next = 0;
261 this = blk->next;
262 blk->next = blk->prev = 0;
270 this = blk->next;
271 blk->next = blk->prev = 0;
407 if (prev->next != this) {
419 if (blk->next) {
420 struct rmm_block_t *next = (rmm_block_t*)((char*)rmm->base + blk->next);
421 if (next->prev != this) {