Lines Matching defs:lower
909 * The lower boundary for the search is specified by the slot number @first_slot.
1206 * tree during a delete. A deletion from lower in the tree
1953 * always be at slot 0 on lower levels, since each key pointer
1955 * subtree it points to. Thus we can skip searching lower levels.
2135 /* everything at write_lock_level or lower must be write locked */
2552 * When find_higher is true, the next higher item is returned, the next lower
2555 * return the next lower instead.
2556 * When return_any is true and find_higher is false, and no lower item is found,
2591 * lower instead
2612 * no lower item found, return the next
2981 struct extent_buffer *lower;
2990 lower = path->nodes[level-1];
2992 btrfs_item_key(lower, &lower_key, 0);
2994 btrfs_node_key(lower, &lower_key, 0);
3006 btrfs_set_node_blockptr(c, 0, lower->start);
3007 lower_gen = btrfs_header_generation(lower);
3047 struct extent_buffer *lower;
3053 lower = path->nodes[level];
3054 nritems = btrfs_header_nritems(lower);
3059 ret = btrfs_tree_mod_log_insert_move(lower, slot + 1,
3066 memmove_extent_buffer(lower,
3067 btrfs_node_key_ptr_offset(lower, slot + 1),
3068 btrfs_node_key_ptr_offset(lower, slot),
3072 ret = btrfs_tree_mod_log_insert_key(lower, slot,
3079 btrfs_set_node_key(lower, key, slot);
3080 btrfs_set_node_blockptr(lower, slot, bytenr);
3082 btrfs_set_node_ptr_generation(lower, slot, trans->transid);
3083 btrfs_set_header_nritems(lower, nritems + 1);
3084 btrfs_mark_buffer_dirty(trans, lower);
3231 * right. We'll push up to and including min_slot, but no lower
3369 * push any slot lower than min_slot