Lines Matching defs:slot
1001 int slot = path->slots[0];
1024 ptr = (unsigned long)btrfs_item_ptr(eb, slot,
1026 total = btrfs_item_size(eb, slot);
1029 ptr = btrfs_item_ptr_offset(eb, slot);
1030 total = btrfs_item_size(eb, slot);
1122 int slot;
1139 slot = path->slots[0];
1140 di = btrfs_item_ptr(eb, slot, struct btrfs_dir_item);
1143 total = btrfs_item_size(eb, slot);
2723 int slot;
2747 slot = path->slots[0];
2748 ii = btrfs_item_ptr(eb, slot, struct btrfs_inode_item);
3909 int slot = path->slots[0];
3919 item_size = btrfs_item_size(leaf, slot);
3928 ptr = btrfs_item_ptr_offset(leaf, slot);
5946 int slot = path->slots[0];
5954 if (slot >= btrfs_header_nritems(leaf)) {
5963 btrfs_item_key_to_cpu(leaf, &key, slot);
5973 ei = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
6175 int slot;
6195 slot = left_path->slots[0];
6196 ei = btrfs_item_ptr(eb, slot, struct btrfs_file_extent_item);
6244 slot = path->slots[0];
6245 btrfs_item_key_to_cpu(eb, &found_key, slot);
6258 ei = btrfs_item_ptr(eb, slot, struct btrfs_file_extent_item);
6327 slot = path->slots[0];
6328 btrfs_item_key_to_cpu(eb, &found_key, slot);
6412 int slot = path->slots[0];
6416 if (slot >= btrfs_header_nritems(leaf)) {
6425 btrfs_item_key_to_cpu(leaf, &key, slot);
6434 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
7323 "send: key (%llu %u %llu) not found in %s root %llu, lowest_level %d, slot %d",
7426 int slot = path->slots[*level];
7434 eb = btrfs_read_node_slot(parent, slot);
7446 for (slot++; slot < nritems && reada_done < reada_max; slot++) {
7447 if (btrfs_node_ptr_generation(parent, slot) > reada_min_gen) {
7448 btrfs_readahead_node_child(parent, slot);
7725 * If we are at level 0, try to go to the next slot. If that's not
7727 * where we could go to the next slot. We may at this point be on a
7733 * If we are not at level 0 and on shared tree blocks, go one slot to