Lines Matching refs:entry
255 * more then one inum would fall into the same entry, we use radix_list
1739 * generation of the parent dir and the name of the dir entry.
1865 * and we can just unlink this entry.
2018 * Insert a name cache entry. On 32bit kernels the radix tree index is 32bit,
2097 * Removes the entry from the list and adds it back to the end. This marks the
2098 * entry as recently used so that name_cache_clean_unused does not remove it.
2156 * ino/gen. If yes, check if the cache entry is still up-to-date. If yes
2867 struct orphan_dir_info *entry, *odi;
2871 entry = rb_entry(parent, struct orphan_dir_info, node);
2872 if (dir_ino < entry->ino)
2874 else if (dir_ino > entry->ino)
2876 else if (dir_gen < entry->gen)
2878 else if (dir_gen > entry->gen)
2881 return entry;
2900 struct orphan_dir_info *entry;
2903 entry = rb_entry(n, struct orphan_dir_info, node);
2904 if (dir_ino < entry->ino)
2906 else if (dir_ino > entry->ino)
2908 else if (gen < entry->gen)
2910 else if (gen > entry->gen)
2913 return entry;
3034 struct waiting_dir_move *entry = get_waiting_dir_move(sctx, ino);
3036 return entry != NULL;
3043 struct waiting_dir_move *entry, *dm;
3055 entry = rb_entry(parent, struct waiting_dir_move, node);
3056 if (ino < entry->ino) {
3058 } else if (ino > entry->ino) {
3075 struct waiting_dir_move *entry;
3078 entry = rb_entry(n, struct waiting_dir_move, node);
3079 if (ino < entry->ino)
3081 else if (ino > entry->ino)
3084 return entry;
3108 struct pending_dir_move *entry = NULL, *pm;
3125 entry = rb_entry(parent, struct pending_dir_move, node);
3126 if (parent_ino < entry->parent_ino) {
3128 } else if (parent_ino > entry->parent_ino) {
3152 list_add_tail(&pm->list, &entry->list);
3170 struct pending_dir_move *entry;
3173 entry = rb_entry(n, struct pending_dir_move, node);
3174 if (parent_ino < entry->parent_ino)
3176 else if (parent_ino > entry->parent_ino)
3179 return entry;
7314 * is slow to remove the directory entry, send can still be started