72 	struct ubifs_old_idx *old_idx, *o;  in insert_old_idx()  local
75 	old_idx = kmalloc(sizeof(struct ubifs_old_idx), GFP_NOFS);  in insert_old_idx()
76 	if (unlikely(!old_idx))  in insert_old_idx()
78 	old_idx->lnum = lnum;  in insert_old_idx()
79 	old_idx->offs = offs;  in insert_old_idx()
81 	p = &c->old_idx.rb_node;  in insert_old_idx()
95 			kfree(old_idx);  in insert_old_idx()
99 	rb_link_node(&old_idx->rb, parent, p);  in insert_old_idx()
100 	rb_insert_color(&old_idx->rb, &c->old_idx);  in insert_old_idx()
174 	struct ubifs_old_idx *old_idx, *n;  in destroy_old_idx()  local
176 	rbtree_postorder_for_each_entry_safe(old_idx, n, &c->old_idx, rb)  in destroy_old_idx()
177 		kfree(old_idx);  in destroy_old_idx()
179 	c->old_idx = RB_ROOT;  in destroy_old_idx()