Lines Matching refs:e
506 struct ino_entry *e = NULL, *new = NULL; in __add_ino_entry() local
511 e = radix_tree_lookup(&im->ino_root, ino); in __add_ino_entry()
516 if (!e) in __add_ino_entry()
524 e = radix_tree_lookup(&im->ino_root, ino); in __add_ino_entry()
525 if (!e) { in __add_ino_entry()
531 e = new; in __add_ino_entry()
532 if (unlikely(radix_tree_insert(&im->ino_root, ino, e))) in __add_ino_entry()
535 memset(e, 0, sizeof(struct ino_entry)); in __add_ino_entry()
536 e->ino = ino; in __add_ino_entry()
538 list_add_tail(&e->list, &im->ino_list); in __add_ino_entry()
544 f2fs_set_bit(devidx, (char *)&e->dirty_device); in __add_ino_entry()
549 if (new && e != new) in __add_ino_entry()
556 struct ino_entry *e; in __remove_ino_entry() local
559 e = radix_tree_lookup(&im->ino_root, ino); in __remove_ino_entry()
560 if (e) { in __remove_ino_entry()
561 list_del(&e->list); in __remove_ino_entry()
565 kmem_cache_free(ino_entry_slab, e); in __remove_ino_entry()
587 struct ino_entry *e; in f2fs_exist_written_data() local
590 e = radix_tree_lookup(&im->ino_root, ino); in f2fs_exist_written_data()
592 return e ? true : false; in f2fs_exist_written_data()
597 struct ino_entry *e, *tmp; in f2fs_release_ino_entry() local
604 list_for_each_entry_safe(e, tmp, &im->ino_list, list) { in f2fs_release_ino_entry()
605 list_del(&e->list); in f2fs_release_ino_entry()
606 radix_tree_delete(&im->ino_root, e->ino); in f2fs_release_ino_entry()
607 kmem_cache_free(ino_entry_slab, e); in f2fs_release_ino_entry()
624 struct ino_entry *e; in f2fs_is_dirty_device() local
628 e = radix_tree_lookup(&im->ino_root, ino); in f2fs_is_dirty_device()
629 if (e && f2fs_test_bit(devidx, (char *)&e->dirty_device)) in f2fs_is_dirty_device()