Lines Matching refs:list
4 * to place their list. We cannot do that because the memory we manage may
69 /* and fixup list pointers */
74 fixup(blks, blke, delta, &blk->list);
90 /* add all new blocks to the free list */
93 list_add(&blk->list, &info->empty_list);
133 blk = list_entry(info->empty_list.next, rh_block_t, list);
134 list_del_init(&blk->list);
147 list_add(&blk->list, &info->empty_list);
173 blk = list_entry(l, rh_block_t, list);
199 /* No coalescing; list insert and return */
203 list_add(&blkn->list, &next->list);
205 list_add(&blkn->list, &info->free_list);
228 list_del(&after->list);
239 blk = list_entry(l, rh_block_t, list);
241 list_add_tail(&blkn->list, &blk->list);
246 list_add_tail(&blkn->list, &info->taken_list);
322 /* Add all new blocks to the free list */
324 list_add(&blk->list, &info->empty_list);
396 blk = list_entry(l, rh_block_t, list);
410 /* Delete from free list, release slot */
411 list_del(&blk->list);
416 /* blk still in free list, with updated start and/or size */
431 list_add(&newblk->list, &blk->list);
461 blk = list_entry(l, rh_block_t, list);
475 /* Move from free list to taken list */
476 list_del(&blk->list);
489 list_add(&spblk->list, blk->list.prev);
495 /* blk still in free list, with updated start and size
501 list_del(&blk->list);
553 blk = list_entry(l, rh_block_t, list);
567 /* Move from free list to taken list */
568 list_del(&blk->list);
578 /* blk still in free list, with updated start and/or size */
593 list_add(&newblk2->list, &blk->list);
621 blk2 = list_entry(l, rh_block_t, list);
630 /* Remove from taken list */
631 list_del(&blk->list);
665 blk = list_entry(l, rh_block_t, list);
688 blk2 = list_entry(l, rh_block_t, list);