Lines Matching defs:offset
217 * Search @tree for an entry that contains @offset. Such entry would have
218 * entry->start <= offset && entry->end >= offset.
221 * @offset: offset that should fall within an entry in @tree
225 * containing @offset
227 * Return a pointer to the entry that contains @offset byte address and don't change
230 * If no such entry exists, return pointer to entry that ends before @offset
234 u64 offset,
247 if (offset < entry->start)
249 else if (offset > entry->end)
261 while (entry && offset > entry->end)
268 * Search offset in the tree or fill neighbor rbtree node pointers.
271 * @offset: offset that should fall within an entry in @tree
272 * @next_ret: pointer to the first entry whose range ends after @offset
273 * @prev_ret: pointer to the first entry whose range begins before @offset
275 * Return a pointer to the entry that contains @offset byte address. If no
280 u64 offset,
295 if (offset < entry->start)
297 else if (offset > entry->end)
304 while (entry && offset > entry->end)
309 while (entry && offset < entry->start)
317 * Inexact rb-tree search, return the next entry if @offset is not found
319 static inline struct extent_state *tree_search(struct extent_io_tree *tree, u64 offset)
321 return tree_search_for_insert(tree, offset, NULL, NULL);
446 * offset inside 'orig' where it should be split.
830 * Find the first offset in the io tree with one or more @bits set.
877 * @start: offset to start the search from
878 * @start_ret: the first offset we found with the bits set
1216 * @start: the start offset in bytes
1217 * @end: the end offset in bytes (inclusive)
1429 * @start: offset at/after which the found extent should start
1537 * @start: The start offset of the range. This value is updated to the
1538 * offset of the first byte found with the given bit(s), so it
1540 * @search_end: The end offset (inclusive value) of the search range.
1555 * then @start is updated with the offset of the first byte with the bits set.