fs/btrfs/extent-io-tree.c

301  * Otherwise return the found entry and other pointers are left untouched.
341  * Inexact rb-tree search, return the next entry if @offset is not found
705 	 * We need to split the extent we found, and may flip bits on second
708 	 * If the extent we found extends past our range, we just split and
711 	 * If the extent we found is inside our range, we clear the desired bit
869  * tree->lock must be held.  NULL will returned if nothing was found after
896  * Return false if we found nothing.
914 			 * If we found the next extent state, clear cached_state
917 			 * again. If we haven't found any, clear as well since
948  * @start_ret: the first offset we found with the bits set
995 	bool found = false;
1011 		if (found && (state->start != cur_start ||
1016 			if (!found)
1020 		if (!found) {
1025 		found = true;
1035 	return found;
1119 	 * Just lock what we found and keep going
1148 	 * We need to split the extent we found, and may flip bits on second
1151 	 * If the extent we found extends past our range, we just split and
1154 	 * If the extent we found is inside our range, we set the desired bit
1204 	 * extent we found.
1372 	 * Just lock what we found and keep going.
1393 	 * We need to split the extent we found, and may flip bits on second
1396 	 * If the extent we found extends past our range, we just split and
1399 	 * If the extent we found is inside our range, we set the desired bit
1432 	 * extent we found.
1511  * @start:     offset at/after which the found extent should start
1620  *                offset of the first byte found with the given bit(s), so it
1635  * Returns the total number of bytes found within the given range that have
1649 	int found = 0;
1694 		if (contig && found && state->start > last + 1)
1701 			if (!found) {
1703 				found = 1;
1706 		} else if (contig && found) {