Lines Matching refs:start
201 &disk_key, level, buf->start, 0,
207 btrfs_set_header_bytenr(cow, cow->start);
357 * node/leaf start address -> sequence
359 * The 'start address' is the logical address of the *new* root node
443 tm->logical = eb->start;
504 tm->logical = eb->start;
613 tm->logical = new_root->start;
614 tm->old_root.logical = old_root->start;
646 __tree_mod_log_search(struct btrfs_fs_info *fs_info, u64 start, u64 min_seq,
659 if (cur->logical < start) {
661 } else if (cur->logical > start) {
693 tree_mod_log_search_oldest(struct btrfs_fs_info *fs_info, u64 start,
696 return __tree_mod_log_search(fs_info, start, min_seq, 1);
705 tree_mod_log_search(struct btrfs_fs_info *fs_info, u64 start, u64 min_seq)
707 return __tree_mod_log_search(fs_info, start, min_seq, 0);
879 ret = btrfs_lookup_extent_info(trans, fs_info, buf->start,
1046 parent_start = parent->start;
1056 btrfs_set_header_bytenr(cow, cow->start);
1090 parent_start = buf->start;
1106 cow->start);
1139 u64 root_logical = eb_root->start;
1280 tm = tree_mod_log_search(fs_info, eb->start, time_seq);
1289 eb_rewin = alloc_dummy_extent_buffer(fs_info, eb->start);
1295 btrfs_set_header_bytenr(eb_rewin, eb->start);
1354 logical = eb_root->start;
1410 btrfs_set_header_bytenr(eb, eb->start);
1509 search_start = buf->start & ~((u64)SZ_1G - 1);
1702 search_start = cur->start;
1703 last_block = cur->start;
1712 * search for key in the extent_buffer. The items start at offset p,
1734 __func__, low, high, eb->start,
2487 * start over
3452 root->node->start, 0,
3461 btrfs_set_node_blockptr(c, 0, lower->start);
3583 c->start, 0, BTRFS_NESTING_SPLIT);
3608 insert_ptr(trans, path, &disk_key, split->start,
3625 * how many bytes are required to store the items in a leaf. start
3629 static int leaf_space_used(struct extent_buffer *l, int start, int nr)
3635 int end = min(nritems, start + nr) - 1;
3639 start_item = btrfs_item_nr(start);
3651 * the start of the leaf data. IOW, how much room
4177 insert_ptr(trans, path, &disk_key, right->start, path->slots[1] + 1, 1);
4235 * our goal is to get our slot at the start or end of a leaf. If
4382 l->start, 0, num_doubles ?
4394 right->start, path->slots[1] + 1, 1);
4403 right->start, path->slots[1], 1);
4557 /* write the data for the start of the original item */
4576 * old one at split_offset (from the start of the item).