Lines Matching defs:new
132 /* If ocfs2_read_block() got us a new bh, pass it up. */
215 struct ocfs2_refcount_tree *new)
217 u64 rf_blkno = new->rf_blkno;
240 rb_link_node(&new->rf_node, parent, p);
241 rb_insert_color(&new->rf_node, &osb->osb_rf_lock_tree);
289 static inline void ocfs2_init_refcount_tree_ci(struct ocfs2_refcount_tree *new,
292 ocfs2_metadata_cache_init(&new->rf_ci, &ocfs2_refcount_caching_ops);
293 mutex_init(&new->rf_io_mutex);
294 new->rf_sb = sb;
295 spin_lock_init(&new->rf_lock);
299 struct ocfs2_refcount_tree *new,
302 init_rwsem(&new->rf_sem);
303 ocfs2_refcount_lock_res_init(&new->rf_lockres, osb,
310 struct ocfs2_refcount_tree *new;
312 new = kzalloc(sizeof(struct ocfs2_refcount_tree), GFP_NOFS);
313 if (!new)
316 new->rf_blkno = rf_blkno;
317 kref_init(&new->rf_getcnt);
318 ocfs2_init_refcount_tree_ci(new, osb->sb);
320 return new;
327 struct ocfs2_refcount_tree *tree, *new = NULL;
342 new = ocfs2_allocate_refcount_tree(osb, rf_blkno);
343 if (!new) {
356 ret = ocfs2_read_refcount_block(&new->rf_ci, rf_blkno, &ref_root_bh);
359 ocfs2_metadata_cache_exit(&new->rf_ci);
360 kfree(new);
365 new->rf_generation = le32_to_cpu(ref_rb->rf_generation);
366 ocfs2_init_refcount_tree_lock(osb, new, rf_blkno,
367 new->rf_generation);
368 ocfs2_metadata_cache_purge(&new->rf_ci);
375 ocfs2_insert_refcount_tree(osb, new);
377 tree = new;
378 new = NULL;
387 if (new)
388 ocfs2_free_refcount_tree(new);
485 * the new refcount tree for us.
660 * We've just created a new refcount tree in this block. If
663 * inserting the new tree.
1470 * 2. call ocfs2_insert_extent to insert the new refcount block.
1471 * 3. move the refcount rec to the new block.
1487 /* move refcount records starting from split_index to the new block. */
1496 /* change old and new rl_used accordingly. */
1597 /* Insert the new leaf block with the specific offset cpos. */
1634 /* Now add a new refcount block into the tree.*/
1647 * Only called when we have inserted a new refcount rec at index 0
1816 * split_rec is the new refcount rec we want to insert.
1852 * Otherwise we at least need one new recs.
1864 * We need one more rec if we split in the middle and the new rec have
1913 * We have calculated out how many new records we need and store
2394 * Now we encounter a new leaf block, so calculate
2425 * we need a new refcount block or not.
2427 * If we will insert a new one, this is easy and only happens
2481 * We need one more block for expansion since the new created leaf
2510 * we gonna touch and whether we need to create new blocks.
2832 * more new leaf records.
2833 * 2. In some case, we may not need to reserve new clusters(e.g, reflink), so
3117 u32 new, u32 len,
3125 cpos, old, new, len, ext_flags);
3130 cpos, old, new, len);
3138 cpos, new, len, ext_flags,
3299 * Here we should write the new page out first if we are
3551 * clusters * 2 new refcount rec.
3651 * Insert a new extent into refcount tree and mark a extent rec
4017 * change the new file's attributes to the src.
4553 /* Map in the new extent. */