Lines Matching refs:list
364 struct list_head list;
402 list_add_tail(&async_extent->list, &cow->extents);
781 struct async_extent, list);
782 list_del(&async_extent->list);
1356 LIST_HEAD(list);
1359 bytenr + num_bytes - 1, &list, 0);
1360 if (ret == 0 && list_empty(&list))
1363 while (!list_empty(&list)) {
1364 sums = list_entry(list.next, struct btrfs_ordered_sum, list);
1365 list_del(&sums->list);
1986 * list of inodes that have pending delalloc work to be done.
2236 * given a list of ordered sums record them in the inode. This happens
2240 struct list_head *list)
2245 list_for_each_entry(sum, list, list) {
2475 /* this page is properly in the ordered list */
2673 BUG_ON(!list_empty(&ordered_extent->list)); /* Logic error */
2733 ret = add_pending_csums(trans, &ordered_extent->list);
3034 * this cleans up any orphans that may be left on the list from the last use
9405 struct list_head list;
9435 INIT_LIST_HEAD(&work->list);
9443 * some fairly slow code that needs optimization. This walks the list
9492 list_add_tail(&work->list, &works);
9511 list_for_each_entry_safe(work, next, &works, list) {
9512 list_del_init(&work->list);