Lines Matching defs:search
909 * The lower boundary for the search is specified by the slot number @first_slot.
910 * Use a value of 0 to search over the whole extent buffer. Works for both
927 * efficient division in the search loop below.
1457 u64 search;
1487 search = btrfs_node_blockptr(node, slot);
1492 eb = find_extent_buffer(fs_info, search);
1499 target = search;
1520 search = btrfs_node_blockptr(node, nr);
1522 (search <= target && target - search <= 65536) ||
1523 (search > target && search - target <= 65536)) {
1611 * Helper function for btrfs_search_slot() and other functions that do a search
1617 * whole btree search, starting again from the current root node.
1647 * restart the search. We don't release the lock on the current level
1982 * binary search on the leaf (with search_for_key_slot()), allowing other
2014 * nodes and we have to do the binary search.
2028 * insert, so we can skip the binary search as
2098 * @p: Holds all btree nodes along the search path
2101 * @ins_len: Indicates purpose of search:
2247 * go through the expensive btree search on b.
2367 * modification log to search for the key in a previous version of this tree, as
2415 * go through the expensive btree search on b.
2550 * helper to use instead of search slot if no exact match is needed but
2627 * Execute search and call btrfs_previous_item to traverse backwards if the item
4736 * was nothing in the tree that matched the search criteria.
4850 * path->keep_locks should be set to 1 on the search made before
5170 * search in extent tree to find a previous Metadata/Data extent item with