Lines Matching refs:extent_state
13 static inline bool extent_state_in_tree(const struct extent_state *state)
22 static inline void btrfs_leak_debug_add_state(struct extent_state *state)
31 static inline void btrfs_leak_debug_del_state(struct extent_state *state)
42 struct extent_state *state;
45 state = list_entry(states.next, struct extent_state, leak_list);
119 struct extent_state *state;
122 state = rb_entry(node, struct extent_state, rb_node);
137 static struct extent_state *alloc_extent_state(gfp_t mask)
139 struct extent_state *state;
158 static struct extent_state *alloc_extent_state_atomic(struct extent_state *prealloc)
166 void free_extent_state(struct extent_state *state)
178 static int add_extent_changeset(struct extent_state *state, u32 bits,
196 static inline struct extent_state *next_state(struct extent_state *state)
201 return rb_entry(next, struct extent_state, rb_node);
206 static inline struct extent_state *prev_state(struct extent_state *state)
211 return rb_entry(next, struct extent_state, rb_node);
233 static inline struct extent_state *tree_search_for_insert(struct extent_io_tree *tree,
241 struct extent_state *entry = NULL;
245 entry = rb_entry(prev, struct extent_state, rb_node);
279 static struct extent_state *tree_search_prev_next(struct extent_io_tree *tree,
281 struct extent_state **prev_ret,
282 struct extent_state **next_ret)
286 struct extent_state *orig_prev;
287 struct extent_state *entry = NULL;
293 entry = rb_entry(*node, struct extent_state, rb_node);
319 static inline struct extent_state *tree_search(struct extent_io_tree *tree, u64 offset)
339 static void merge_state(struct extent_io_tree *tree, struct extent_state *state)
341 struct extent_state *other;
369 struct extent_state *state,
384 * Insert an extent_state struct into the tree. 'bits' are set on the
394 struct extent_state *state,
405 struct extent_state *entry;
408 entry = rb_entry(parent, struct extent_state, rb_node);
433 struct extent_state *state, struct rb_node **node,
457 static int split_state(struct extent_io_tree *tree, struct extent_state *orig,
458 struct extent_state *prealloc, u64 split)
474 struct extent_state *entry;
477 entry = rb_entry(parent, struct extent_state, rb_node);
502 static struct extent_state *clear_state_bit(struct extent_io_tree *tree,
503 struct extent_state *state,
507 struct extent_state *next;
558 u32 bits, struct extent_state **cached_state,
561 struct extent_state *state;
562 struct extent_state *cached;
563 struct extent_state *prealloc = NULL;
712 struct extent_state *state)
730 struct extent_state **cached_state)
732 struct extent_state *state;
787 static void cache_state_if_flags(struct extent_state *state,
788 struct extent_state **cached_ptr,
799 static void cache_state(struct extent_state *state,
800 struct extent_state **cached_ptr)
811 static struct extent_state *find_first_extent_bit_state(struct extent_io_tree *tree,
814 struct extent_state *state;
839 struct extent_state **cached_state)
841 struct extent_state *state;
892 struct extent_state *state;
919 struct extent_state **cached_state)
921 struct extent_state *state;
972 * part of the range already has the desired bits set. The extent_state of the
982 struct extent_state **failed_state,
983 struct extent_state **cached_state,
986 struct extent_state *state;
987 struct extent_state *prealloc = NULL;
1206 u32 bits, struct extent_state **cached_state)
1232 struct extent_state **cached_state)
1234 struct extent_state *state;
1235 struct extent_state *prealloc = NULL;
1442 struct extent_state *state;
1443 struct extent_state *prev = NULL, *next = NULL;
1560 struct extent_state **cached_state)
1562 struct extent_state *state = NULL;
1563 struct extent_state *cached;
1585 struct extent_state *prev;
1648 u32 bits, int filled, struct extent_state *cached)
1650 struct extent_state *state = NULL;
1721 struct extent_state **cached)
1742 struct extent_state **cached_state)
1744 struct extent_state *failed_state = NULL;
1773 sizeof(struct extent_state), 0,