Lines Matching defs:set
356 * insert an extent_state struct into the tree. 'bits' are set on the
363 * probably isn't what you want to call (see set/clear_extent_bit).
453 * If no bits are set on the state struct after clearing things, the
497 * bits were already set, or zero if none of the bits were already set.
511 int set = 0;
584 set |= clear_state_bit(tree, state, &bits, wake);
605 set |= clear_state_bit(tree, prealloc, &bits, wake);
616 set |= clear_state_bit(tree, state, &bits, wake);
633 return set;
738 * set some bits on a range in the tree. This may require allocations or
741 * If any of the exclusive bits are set, this will fail with -EEXIST if some
742 * part of the range already has the desired bits set. The start of the
840 * If the extent we found is inside our range, we set the
894 * We need to split the extent, and set the bit
935 /* wrappers around set/clear extent bit */
1067 * helper function to set pages and extents in the tree dirty
1086 * helper function to set both pages and extents in the tree writeback
1105 * find the first offset in the io tree with 'bits' set. zero is
1107 * set to reflect the state struct that was found.
1144 /* find the first state struct with 'bits' set after 'start', and
1475 * set. This can be fairly slow, except for EXTENT_DIRTY which is
1530 * set the private field for a given byte offset in the tree. If there isn't
1590 * has the bits set. Otherwise, 1 is returned if any bit in the
1591 * range is found set.
1643 * helper function to set a given page up to date if all the
1752 * set the uptodate bits if things worked
1753 * set the page up to date if all extents in the tree are uptodate
1839 * the structs in the extent tree when done, and set the uptodate bits