Lines Matching defs:index
333 * @index: the dir index value to lookup (offset of a dir index key)
340 u64 index)
348 if (delayed_item->index < index)
350 else if (delayed_item->index > index)
381 if (item->index < ins->index) {
384 } else if (item->index > ins->index) {
395 ins->index >= delayed_node->index_cnt)
396 delayed_node->index_cnt = ins->index + 1;
638 * that fit in a leaf. The delayed items (dir index keys) are sorted by their key
639 * in the rbtree, and if there's a gap between two consecutive dir index items,
642 * into the subvolume tree. Dir index keys also have their offsets coming from a
644 * fits within a gap between delayed dir index items.
668 * During normal operation the delayed index offset is continuously
704 if (continuous_keys_only && (next->index != curr->index + 1))
723 first_key.offset = first_item->index;
744 ins_keys[i].offset = curr->index;
794 * reserved leaves > 1 here - this happens when many dir index
881 key.offset != next->index)
934 key.offset = item->index;
1442 * Adding the new dir index item does not require touching another
1455 /* Will return 0, -ENOMEM or -EEXIST (index number collision, unexpected). */
1460 u64 index)
1483 delayed_item->index = index;
1508 "error adding delayed dir index item, name: %.*s, index: %llu, root: %llu, dir: %llu, dir->index_cnt: %llu, delayed_node->index_cnt: %llu, error: %d",
1509 name_len, name, index, btrfs_root_id(delayed_node->root),
1530 * Space was reserved for a dir index item insertion when we
1553 u64 index)
1558 item = __btrfs_lookup_delayed_item(&node->ins_root.rb_root, index);
1577 * accumulate enough dir index items to fill more than one leaf (even
1589 /* If we now have no more dir index items, we can release all leaves. */
1600 struct btrfs_inode *dir, u64 index)
1610 ret = btrfs_delete_delayed_insertion_item(trans->fs_info, node, index);
1620 item->index = index;
1638 "err add delayed dir index item(index: %llu) into the deletion tree of the delayed node(root id: %llu, inode id: %llu, errno: %d)",
1639 index, node->root->root_key.objectid,
1659 * a new directory index is added into the delayed node and index_cnt
1693 while (item && item->index <= last_index) {
1700 while (item && item->index <= last_index) {
1746 u64 index)
1752 if (curr->index > index)
1754 if (curr->index == index) {
1785 if (curr->index < ctx->pos) {
1791 ctx->pos = curr->index;