Lines Matching refs:start
62 state->cache_node.start = state->start; in update_extent_state()
63 state->cache_node.size = state->end + 1 - state->start; in update_extent_state()
85 if (other->end == state->start - 1 && in merge_state()
87 state->start = other->start; in merge_state()
97 if (other->start == state->end + 1 && in merge_state()
99 other->start = state->start; in merge_state()
113 struct extent_state *state, u64 start, u64 end, in insert_state() argument
118 BUG_ON(end < start); in insert_state()
120 state->start = start; in insert_state()
138 prealloc->start = orig->start; in split_state()
142 orig->start = split; in split_state()
174 void extent_buffer_bitmap_set(struct extent_buffer *eb, unsigned long start, in extent_buffer_bitmap_set() argument
177 u8 *p = (u8 *)eb->data + start + BIT_BYTE(pos); in extent_buffer_bitmap_set()
202 void extent_buffer_bitmap_clear(struct extent_buffer *eb, unsigned long start, in extent_buffer_bitmap_clear() argument
205 u8 *p = (u8 *)eb->data + start + BIT_BYTE(pos); in extent_buffer_bitmap_clear()
226 int clear_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, int bits) in clear_extent_bits() argument
246 node = search_cache_extent(&tree->state, start); in clear_extent_bits()
250 if (state->start > end) in clear_extent_bits()
269 if (state->start < start) { in clear_extent_bits()
270 err = split_state(tree, state, prealloc, start); in clear_extent_bits()
279 start = last_end + 1; in clear_extent_bits()
281 start = state->start; in clear_extent_bits()
291 if (state->start <= end && state->end > end) { in clear_extent_bits()
300 start = state->end + 1; in clear_extent_bits()
304 start = last_end + 1; in clear_extent_bits()
312 if (start > end) in clear_extent_bits()
320 int set_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, int bits) in set_extent_bits() argument
339 node = search_cache_extent(&tree->state, start); in set_extent_bits()
341 err = insert_state(tree, prealloc, start, end, bits); in set_extent_bits()
348 last_start = state->start; in set_extent_bits()
357 if (state->start == start && state->end <= end) { in set_extent_bits()
362 start = last_end + 1; in set_extent_bits()
381 if (state->start < start) { in set_extent_bits()
382 err = split_state(tree, state, prealloc, start); in set_extent_bits()
389 start = state->end + 1; in set_extent_bits()
393 start = last_end + 1; in set_extent_bits()
395 start = state->start; in set_extent_bits()
406 if (state->start > start) { in set_extent_bits()
412 err = insert_state(tree, prealloc, start, this_end, in set_extent_bits()
418 start = this_end + 1; in set_extent_bits()
438 if (start > end) in set_extent_bits()
443 int set_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end) in set_extent_dirty() argument
445 return set_extent_bits(tree, start, end, EXTENT_DIRTY); in set_extent_dirty()
448 int clear_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end) in clear_extent_dirty() argument
450 return clear_extent_bits(tree, start, end, EXTENT_DIRTY); in clear_extent_dirty()
453 int find_first_extent_bit(struct extent_io_tree *tree, u64 start, in find_first_extent_bit() argument
464 node = search_cache_extent(&tree->state, start); in find_first_extent_bit()
470 if (state->end >= start && (state->state & bits)) { in find_first_extent_bit()
471 *start_ret = state->start; in find_first_extent_bit()
484 int test_range_bit(struct extent_io_tree *tree, u64 start, u64 end, in test_range_bit() argument
491 node = search_cache_extent(&tree->state, start); in test_range_bit()
492 while (node && start <= end) { in test_range_bit()
495 if (filled && state->start > start) { in test_range_bit()
499 if (state->start > end) in test_range_bit()
509 start = state->end + 1; in test_range_bit()
510 if (start > end) in test_range_bit()
522 int set_state_private(struct extent_io_tree *tree, u64 start, u64 private) in set_state_private() argument
528 node = search_cache_extent(&tree->state, start); in set_state_private()
534 if (state->start != start) { in set_state_private()
543 int get_state_private(struct extent_io_tree *tree, u64 start, u64 *private) in get_state_private() argument
549 node = search_cache_extent(&tree->state, start); in get_state_private()
555 if (state->start != start) { in get_state_private()
578 eb->start = bytenr; in __alloc_extent_buffer()
582 eb->cache_node.start = bytenr; in __alloc_extent_buffer()
594 new = __alloc_extent_buffer(src->fs_info, src->start, src->len); in btrfs_clone_extent_buffer()
629 eb->start, eb->len); in free_extent_buffer_internal()
648 if (cache && cache->start == bytenr && in find_extent_buffer()
657 u64 start) in find_first_extent_buffer() argument
662 cache = search_cache_extent(&tree->cache, start); in find_first_extent_buffer()
678 if (cache && cache->start == bytenr && in alloc_extent_buffer()
747 unsigned long start, unsigned long len) in memcmp_extent_buffer() argument
749 return memcmp(eb->data + start, ptrv, len); in memcmp_extent_buffer()
753 unsigned long start, unsigned long len) in read_extent_buffer() argument
755 memcpy(dst, eb->data + start, len); in read_extent_buffer()
759 unsigned long start, unsigned long len) in write_extent_buffer() argument
761 memcpy(eb->data + start, src, len); in write_extent_buffer()
778 unsigned long start, unsigned long len) in memset_extent_buffer() argument
780 memset(eb->data + start, c, len); in memset_extent_buffer()
783 int extent_buffer_test_bit(struct extent_buffer *eb, unsigned long start, in extent_buffer_test_bit() argument
786 return le_test_bit(nr, (u8 *)eb->data + start); in extent_buffer_test_bit()
794 set_extent_dirty(tree, eb->start, eb->start + eb->len - 1); in set_extent_buffer_dirty()
805 clear_extent_dirty(tree, eb->start, eb->start + eb->len - 1); in clear_extent_buffer_dirty()