1262 	struct size_entry *e;  in add_ino()  local
1266 		e = rb_entry(parent, struct size_entry, rb);  in add_ino()
1267 		if (inum < e->inum)  in add_ino()
1273 	e = kzalloc(sizeof(struct size_entry), GFP_KERNEL);  in add_ino()
1274 	if (!e)  in add_ino()
1277 	e->inum = inum;  in add_ino()
1278 	e->i_size = i_size;  in add_ino()
1279 	e->d_size = d_size;  in add_ino()
1280 	e->exists = exists;  in add_ino()
1282 	rb_link_node(&e->rb, parent, p);  in add_ino()
1283 	rb_insert_color(&e->rb, &c->size_tree);  in add_ino()
1296 	struct size_entry *e;  in find_ino()  local
1299 		e = rb_entry(p, struct size_entry, rb);  in find_ino()
1300 		if (inum < e->inum)  in find_ino()
1302 		else if (inum > e->inum)  in find_ino()
1305 			return e;  in find_ino()
1317 	struct size_entry *e = find_ino(c, inum);  in remove_ino()  local
1319 	if (!e)  in remove_ino()
1321 	rb_erase(&e->rb, &c->size_tree);  in remove_ino()
1322 	kfree(e);  in remove_ino()
1331 	struct size_entry *e, *n;  in ubifs_destroy_size_tree()  local
1333 	rbtree_postorder_for_each_entry_safe(e, n, &c->size_tree, rb) {  in ubifs_destroy_size_tree()
1334 		iput(e->inode);  in ubifs_destroy_size_tree()
1335 		kfree(e);  in ubifs_destroy_size_tree()
1370 	struct size_entry *e;  in ubifs_recover_size_accum()  local
1378 			e = find_ino(c, inum);  in ubifs_recover_size_accum()
1379 			if (e) {  in ubifs_recover_size_accum()
1380 				e->i_size = new_size;  in ubifs_recover_size_accum()
1381 				e->exists = 1;  in ubifs_recover_size_accum()
1390 		e = find_ino(c, inum);  in ubifs_recover_size_accum()
1391 		if (e) {  in ubifs_recover_size_accum()
1392 			if (new_size > e->d_size)  in ubifs_recover_size_accum()
1393 				e->d_size = new_size;  in ubifs_recover_size_accum()
1401 		e = find_ino(c, inum);  in ubifs_recover_size_accum()
1402 		if (e)  in ubifs_recover_size_accum()
1403 			e->d_size = new_size;  in ubifs_recover_size_accum()
1414 static int fix_size_in_place(struct ubifs_info *c, struct size_entry *e)  in fix_size_in_place()  argument
1424 	ino_key_init(c, &key, e->inum);  in fix_size_in_place()
1433 	if (i_size >= e->d_size)  in fix_size_in_place()
1441 	ino->size = cpu_to_le64(e->d_size);  in fix_size_in_place()
1456 		  (unsigned long)e->inum, lnum, offs, i_size, e->d_size);  in fix_size_in_place()
1461 		   (unsigned long)e->inum, e->i_size, e->d_size, err);  in fix_size_in_place()
1479 		struct size_entry *e;  in ubifs_recover_size()  local
1482 		e = rb_entry(this, struct size_entry, rb);  in ubifs_recover_size()
1483 		if (!e->exists) {  in ubifs_recover_size()
1486 			ino_key_init(c, &key, e->inum);  in ubifs_recover_size()
1493 					  (unsigned long)e->inum);  in ubifs_recover_size()
1494 				err = ubifs_tnc_remove_ino(c, e->inum);  in ubifs_recover_size()
1500 				e->exists = 1;  in ubifs_recover_size()
1501 				e->i_size = le64_to_cpu(ino->size);  in ubifs_recover_size()
1505 		if (e->exists && e->i_size < e->d_size) {  in ubifs_recover_size()
1511 				ubifs_assert(!e->inode);  in ubifs_recover_size()
1513 				inode = ubifs_iget(c->vfs_sb, e->inum);  in ubifs_recover_size()
1518 				if (inode->i_size < e->d_size) {  in ubifs_recover_size()
1520 						  (unsigned long)e->inum,  in ubifs_recover_size()
1521 						  inode->i_size, e->d_size);  in ubifs_recover_size()
1522 					inode->i_size = e->d_size;  in ubifs_recover_size()
1523 					ui->ui_size = e->d_size;  in ubifs_recover_size()
1524 					ui->synced_i_size = e->d_size;  in ubifs_recover_size()
1525 					e->inode = inode;  in ubifs_recover_size()
1532 				err = fix_size_in_place(c, e);  in ubifs_recover_size()
1535 				iput(e->inode);  in ubifs_recover_size()
1540 		rb_erase(&e->rb, &c->size_tree);  in ubifs_recover_size()
1541 		kfree(e);  in ubifs_recover_size()