Lines Matching defs:new
1397 * If COW succeeds, it allocates a new data extent and after doing
1875 * Handle merged delayed allocation extents so we can keep track of new extents
1879 void btrfs_merge_delalloc_extent(struct inode *inode, struct extent_state *new,
1889 if (new->start > other->start)
1890 new_size = new->end - other->start + 1;
1892 new_size = other->end - new->start + 1;
1905 * extents we accounted for is <= the amount we need for the new range
1922 old_size = new->end - new->start + 1;
2305 * set the delalloc new bit for the range directly.
2532 * The new extent is pinned in the extent map, and we don't want
4205 * csum items that cross the new i_size are truncated to the new size
4263 * new size is not block aligned since we will be keeping the
4912 * zero. Make sure any new writes to the file get on disk
5336 struct rb_node *new = &BTRFS_I(inode)->rb_node;
5355 rb_replace_node(parent, new, &root->inode_tree);
5361 rb_link_node(new, parent, p);
5362 rb_insert_color(new, &root->inode_tree);
5767 * Stop new entries from being returned after we return the last
5771 * offset. This means that new entries created during readdir
5775 * we have this hack to stop new entries from being returned
6064 * Start new inodes with an inode_ref. This is slightly more
6440 * If new hard link count is 1, it's a file created
7310 * We don't allocate a new extent in the following cases
7503 /* Recalc len in case the new em is smaller than requested */
8223 * we have the page locked, so new writeback can't start,
8520 * need to be able to stop the transaction and start a new one, which
8634 * create a new subvolume directory/inode (helper for the ioctl).
8940 * inodes. So 5 * 2 is 10, plus 2 for the new links, so 12 total items
9243 * inodes. So 5 * 2 is 10, plus 1 for the new link, so 11 total items
9246 * new inode (1 inode item, 1 inode ref, 2 dir items and 1 xattr item