Lines Matching defs:first
91 * stages for the tree walking. The first
672 * first check to see if we already have this extent in the
813 * extent first, and we do not do the csum deletion
833 * After the first file extent item is replayed, the
2377 * gets called in two different stages. The first stage just looks
2417 /* inode keys are done during the first stage */
2774 /* insert root item on the first sync */
3137 * first log transaction has an ID of 0.
3599 * that matches the offset where the data for the first item starts, the
3813 * The dir index key before the first one we found that needs to
3829 * Find the first key from this transaction again or the one we were at
3915 * dir item and the first one on the next leaf (which did not
3972 * the value right before the first valid index value.
3982 * first valid index value, as it means we have an empty directory.
4197 * This means it is the first fsync in the current transaction,
4361 * few random writes into a file and then fsync it for the first
4663 * If this is the first time we are logging the inode in the current
5057 * deletion of entire leafs or all the extent items of the first leaf (the one
5170 * After the log replay procedure, we would lose the first directory and all its
5696 * Conflicting inodes are logged by the first call to btrfs_log_inode(),
5992 const struct btrfs_delayed_item *first = NULL;
6009 * So find the first delayed item that was not yet logged (they are
6014 first = curr;
6020 if (!first)
6032 curr = first;
6039 &batch, first);
6046 first = curr;
6061 ret = insert_delayed_items_batch(trans, log, path, &batch, first);
6121 const struct btrfs_delayed_item *first,
6130 next = list_next_entry(first, log_list);
6392 * directory ("a") without flushing them first, while for each of its
7069 * Similar as the first example, after log replay the parent directory