Searched refs:node_list (Results 1 – 2 of 2) sorted by relevance
34 struct list_head node_list; member
49 INIT_LIST_HEAD(&delayed_root->node_list); in btrfs_init_delayed_root()191 list_add_tail(&node->n_list, &root->node_list); in btrfs_queue_delayed_node()222 node = list_first_entry_or_null(&delayed_root->node_list, in btrfs_first_delayed_node()242 if (list_empty(&delayed_root->node_list)) in btrfs_next_delayed_node()244 p = delayed_root->node_list.next; in btrfs_next_delayed_node()245 } else if (list_is_last(&node->n_list, &delayed_root->node_list)) in btrfs_next_delayed_node()
Completed in 9 milliseconds