• Home
  • Raw
  • Download

Lines Matching refs:e

1309     struct size_entry *e;  in add_ino()  local
1313 e = rb_entry(parent, struct size_entry, rb); in add_ino()
1314 if (inum < e->inum) { in add_ino()
1321 e = kzalloc(sizeof(struct size_entry), GFP_KERNEL); in add_ino()
1322 if (!e) { in add_ino()
1326 e->inum = inum; in add_ino()
1327 e->i_size = i_size; in add_ino()
1328 e->d_size = d_size; in add_ino()
1329 e->exists = exists; in add_ino()
1331 rb_link_node(&e->rb, parent, p); in add_ino()
1332 rb_insert_color(&e->rb, &c->size_tree); in add_ino()
1345 struct size_entry *e; in find_ino() local
1348 e = rb_entry(p, struct size_entry, rb); in find_ino()
1349 if (inum < e->inum) { in find_ino()
1351 } else if (inum > e->inum) { in find_ino()
1354 return e; in find_ino()
1367 struct size_entry *e = find_ino(c, inum); in remove_ino() local
1369 if (!e) { in remove_ino()
1372 rb_erase(&e->rb, &c->size_tree); in remove_ino()
1373 kfree(e); in remove_ino()
1382 struct size_entry *e, *n; in ubifs_destroy_size_tree() local
1384 rbtree_postorder_for_each_entry_safe(e, n, &c->size_tree, rb) in ubifs_destroy_size_tree()
1386 iput(e->inode); in ubifs_destroy_size_tree()
1387 kfree(e); in ubifs_destroy_size_tree()
1421 struct size_entry *e; in ubifs_recover_size_accum() local
1429 e = find_ino(c, inum); in ubifs_recover_size_accum()
1430 if (e) { in ubifs_recover_size_accum()
1431 e->i_size = new_size; in ubifs_recover_size_accum()
1432 e->exists = 1; in ubifs_recover_size_accum()
1442 e = find_ino(c, inum); in ubifs_recover_size_accum()
1443 if (e) { in ubifs_recover_size_accum()
1444 if (new_size > e->d_size) { in ubifs_recover_size_accum()
1445 e->d_size = new_size; in ubifs_recover_size_accum()
1455 e = find_ino(c, inum); in ubifs_recover_size_accum()
1456 if (e) { in ubifs_recover_size_accum()
1457 e->d_size = new_size; in ubifs_recover_size_accum()
1471 static int fix_size_in_place(struct ubifs_info *c, struct size_entry *e) in fix_size_in_place() argument
1481 ino_key_init(c, &key, e->inum); in fix_size_in_place()
1491 if (i_size >= e->d_size) { in fix_size_in_place()
1501 ino->size = cpu_to_le64(e->d_size); in fix_size_in_place()
1517 …dbg_rcvry("inode %lu at %d:%d size %lld -> %lld", (unsigned long)e->inum, lnum, offs, i_size, e->d… in fix_size_in_place()
1521 …"inode %lu failed to fix size %lld -> %lld error %d", (unsigned long)e->inum, e->i_size, e->d_size, in fix_size_in_place()
1531 static int inode_fix_size(struct ubifs_info *c, struct size_entry *e) in inode_fix_size() argument
1538 ubifs_assert(c, !e->inode); in inode_fix_size()
1541 if (e->inode) { in inode_fix_size()
1543 inode = e->inode; in inode_fix_size()
1545 inode = ubifs_iget(c->vfs_sb, e->inum); in inode_fix_size()
1550 if (inode->i_size >= e->d_size) { in inode_fix_size()
1559 dbg_rcvry("ino %lu size %lld -> %lld", (unsigned long)e->inum, inode->i_size, e->d_size); in inode_fix_size()
1563 inode->i_size = e->d_size; in inode_fix_size()
1564 ui->ui_size = e->d_size; in inode_fix_size()
1565 ui->synced_i_size = e->d_size; in inode_fix_size()
1567 e->inode = inode; in inode_fix_size()
1587 rb_erase(&e->rb, &c->size_tree); in inode_fix_size()
1588 kfree(e); in inode_fix_size()
1608 struct size_entry *e; in ubifs_recover_size() local
1611 e = rb_entry(this, struct size_entry, rb); in ubifs_recover_size()
1615 if (!e->exists) { in ubifs_recover_size()
1618 ino_key_init(c, &key, e->inum); in ubifs_recover_size()
1625 dbg_rcvry("removing ino %lu", (unsigned long)e->inum); in ubifs_recover_size()
1626 err = ubifs_tnc_remove_ino(c, e->inum); in ubifs_recover_size()
1633 e->exists = 1; in ubifs_recover_size()
1634 e->i_size = le64_to_cpu(ino->size); in ubifs_recover_size()
1638 if (e->exists && e->i_size < e->d_size) { in ubifs_recover_size()
1647 err = fix_size_in_place(c, e); in ubifs_recover_size()
1651 iput(e->inode); in ubifs_recover_size()
1653 err = inode_fix_size(c, e); in ubifs_recover_size()
1661 rb_erase(&e->rb, &c->size_tree); in ubifs_recover_size()
1662 kfree(e); in ubifs_recover_size()