48 			      struct ubifs_old_idx *old_idx)  in do_insert_old_idx()  argument
53 	p = &c->old_idx.rb_node;  in do_insert_old_idx()
57 		if (old_idx->lnum < o->lnum)  in do_insert_old_idx()
59 		else if (old_idx->lnum > o->lnum)  in do_insert_old_idx()
61 		else if (old_idx->offs < o->offs)  in do_insert_old_idx()
63 		else if (old_idx->offs > o->offs)  in do_insert_old_idx()
67 			kfree(old_idx);  in do_insert_old_idx()
71 	rb_link_node(&old_idx->rb, parent, p);  in do_insert_old_idx()
72 	rb_insert_color(&old_idx->rb, &c->old_idx);  in do_insert_old_idx()
100 	struct ubifs_old_idx *old_idx;  in insert_old_idx()  local
102 	old_idx = kmalloc(sizeof(struct ubifs_old_idx), GFP_NOFS);  in insert_old_idx()
103 	if (unlikely(!old_idx))  in insert_old_idx()
105 	old_idx->lnum = lnum;  in insert_old_idx()
106 	old_idx->offs = offs;  in insert_old_idx()
107 	do_insert_old_idx(c, old_idx);  in insert_old_idx()
182 	struct ubifs_old_idx *old_idx, *n;  in destroy_old_idx()  local
184 	rbtree_postorder_for_each_entry_safe(old_idx, n, &c->old_idx, rb)  in destroy_old_idx()
185 		kfree(old_idx);  in destroy_old_idx()
187 	c->old_idx = RB_ROOT;  in destroy_old_idx()
295 		struct ubifs_old_idx *old_idx;  in dirty_cow_znode()  local
297 		old_idx = kmalloc(sizeof(struct ubifs_old_idx), GFP_NOFS);  in dirty_cow_znode()
298 		if (unlikely(!old_idx)) {  in dirty_cow_znode()
302 		old_idx->lnum = zbr->lnum;  in dirty_cow_znode()
303 		old_idx->offs = zbr->offs;  in dirty_cow_znode()
307 			kfree(old_idx);  in dirty_cow_znode()
311 		do_insert_old_idx(c, old_idx);  in dirty_cow_znode()