fs/btrfs/extent-io-tree.c

84  * The only tree allowed to set the inode is IO_TREE_INODE_IO.
129  * set on any extent state when calling this function).
204 				 int set)
210 	if (set && (state->state & bits) == bits)
212 	if (!set && (state->state & bits) == 0)
424  * Insert an extent_state struct into the tree.  'bits' are set on the
436  * probably isn't what you want to call (see set/clear_extent_bit).
566  * If no bits are set on the state struct after clearing things, the
604  * Detect if extent bits request NOWAIT semantics and set the gfp mask accordingly,
795 	 * are more bits than the bits we're waiting on set on this state.
868  * Find the first state struct with 'bits' set after 'start', and return it.
891  * Find the first offset in the io tree with one or more @bits set.
893  * Note: If there are multiple bits set in @bits, any of them will match.
948  * @start_ret: the first offset we found with the bits set
949  * @end_ret:   the final contiguous range of the bits that were set
953  * to set bits appropriately, and then merge them again.  During this time it
957  * returned will be the full contiguous area with the bits set.
1043  * If any of the exclusive bits are set, this will fail with -EEXIST if some
1044  * part of the range already has the desired bits set.  The extent_state of the
1154 	 * If the extent we found is inside our range, we set the desired bit
1166 		 * If this extent already has all the bits we want set, then
1241 	 * We need to split the extent, and set the bit on the first half
1295  * @bits:	the bits to set in this range
1299  * This will go through and set bits for the given range.  If any states exist
1300  * already in this range they are set with the given bit and cleared of the
1399 	 * If the extent we found is inside our range, we set the desired bit
1470 	 * We need to split the extent, and set the bit on the first half.
1507  * Find the first range that has @bits not set. This range could start before
1514  * @bits:      the set of bits which must be unset
1517  * set it's possible that @end_ret contains -1, this happens in case the range
1542 			 * We are past the last allocated chunk, set start at
1567 				 * have the bits set, so take its start as the
1599 	 * bits set
1615  * Count the number of bytes in the tree that have a given bit(s) set for a
1626  *                If multiple bits are set, then only subranges that have all
1627  *                the bits set are accounted for.
1636  * all given bits set. If the returned number of bytes is greater than zero
1637  * then @start is updated with the offset of the first byte with the bits set.
1756  * Check if the whole range [@start,@end) contains the single @bit set.
1806 /* Wrappers around set/clear extent bit */