Lines Matching defs:lower
330 * Blocker with lower sequence number exists, we
340 * anything that's lower than the lowest existing (read: blocked)
690 * sequence lower than min_seq will be ignored.
702 * a time sequence lower than min_seq will be ignored.
1994 * tree during a delete. A deletion from lower in the tree
2717 /* everything at write_lock_level or lower must be write locked */
2836 * on lower levels due to the invariants BTRFS' btree provides,
2839 * lower levels
3063 * When find_higher is true, the next higher item is returned, the next lower
3066 * return the next lower instead.
3067 * When return_any is true and find_higher is false, and no lower item is found,
3102 * lower instead
3123 * no lower item found, return the next
3436 struct extent_buffer *lower;
3445 lower = path->nodes[level-1];
3447 btrfs_item_key(lower, &lower_key, 0);
3449 btrfs_node_key(lower, &lower_key, 0);
3461 btrfs_set_node_blockptr(c, 0, lower->start);
3462 lower_gen = btrfs_header_generation(lower);
3497 struct extent_buffer *lower;
3503 lower = path->nodes[level];
3504 nritems = btrfs_header_nritems(lower);
3509 ret = tree_mod_log_insert_move(lower, slot + 1, slot,
3513 memmove_extent_buffer(lower,
3519 ret = tree_mod_log_insert_key(lower, slot, MOD_LOG_KEY_ADD,
3523 btrfs_set_node_key(lower, key, slot);
3524 btrfs_set_node_blockptr(lower, slot, bytenr);
3526 btrfs_set_node_ptr_generation(lower, slot, trans->transid);
3527 btrfs_set_header_nritems(lower, nritems + 1);
3528 btrfs_mark_buffer_dirty(lower);
3673 * right. We'll push up to and including min_slot, but no lower
3821 * push any slot lower than min_slot