2 * fs/kernfs/dir.c - kernfs directory implementation
4 * Copyright (c) 2001-3 Patrick Mochel
5 * Copyright (c) 2007 SUSE Linux Products GmbH
6 * Copyright (c) 2007, 2013 Tejun Heo <tj@kernel.org>
8 * This file is released under the GPLv2.
12 #include <linux/namei.h>
13 #include <linux/idr.h>
14 #include <linux/slab.h>
15 #include <linux/security.h>
16 #include <linux/hash.h>
18 #include "kernfs-internal.h"
20 DEFINE_MUTEX(kernfs_mutex);
22 #define rb_to_kn(X) rb_entry((X), struct kernfs_node, rb)
26 * @name: Null terminated string to hash
27 * @ns: Namespace tag to hash
29 * Returns 31 bit hash of ns + name (so it fits in an off_t )
31 static unsigned int kernfs_name_hash(const char *name, const void *ns)
33 unsigned long hash = init_name_hash();
34 unsigned int len = strlen(name);
36 hash = partial_name_hash(*name++, hash);
37 hash = (end_name_hash(hash) ^ hash_ptr((void *)ns, 31));
39 /* Reserve hash numbers 0, 1 and INT_MAX for magic directory entries */
47 static int kernfs_name_compare(unsigned int hash, const char *name,
48 const void *ns, const struct kernfs_node *kn)
51 return hash - kn->hash;
54 return strcmp(name, kn->name);
57 static int kernfs_sd_compare(const struct kernfs_node *left,
58 const struct kernfs_node *right)
60 return kernfs_name_compare(left->hash, left->name, left->ns, right);
64 * kernfs_link_sibling - link kernfs_node into sibling rbtree
65 * @kn: kernfs_node of interest
67 * Link @kn into its sibling rbtree which starts from
68 * @kn->parent->dir.children.
71 * mutex_lock(kernfs_mutex)
74 * 0 on susccess -EEXIST on failure.
76 static int kernfs_link_sibling(struct kernfs_node *kn)
78 struct rb_node **node = &kn->parent->dir.children.rb_node;
79 struct rb_node *parent = NULL;
81 if (kernfs_type(kn) == KERNFS_DIR)
82 kn->parent->dir.subdirs++;
85 struct kernfs_node *pos;
88 pos = rb_to_kn(*node);
90 result = kernfs_sd_compare(kn, pos);
92 node = &pos->rb.rb_left;
94 node = &pos->rb.rb_right;
98 /* add new node and rebalance the tree */
99 rb_link_node(&kn->rb, parent, node);
100 rb_insert_color(&kn->rb, &kn->parent->dir.children);
105 * kernfs_unlink_sibling - unlink kernfs_node from sibling rbtree
106 * @kn: kernfs_node of interest
108 * Unlink @kn from its sibling rbtree which starts from
109 * kn->parent->dir.children.
112 * mutex_lock(kernfs_mutex)
114 static void kernfs_unlink_sibling(struct kernfs_node *kn)
116 if (kernfs_type(kn) == KERNFS_DIR)
117 kn->parent->dir.subdirs--;
119 rb_erase(&kn->rb, &kn->parent->dir.children);
123 * kernfs_get_active - get an active reference to kernfs_node
124 * @kn: kernfs_node to get an active reference to
126 * Get an active reference of @kn. This function is noop if @kn
130 * Pointer to @kn on success, NULL on failure.
132 struct kernfs_node *kernfs_get_active(struct kernfs_node *kn)
137 if (!atomic_inc_unless_negative(&kn->active))
140 if (kn->flags & KERNFS_LOCKDEP)
141 rwsem_acquire_read(&kn->dep_map, 0, 1, _RET_IP_);
146 * kernfs_put_active - put an active reference to kernfs_node
147 * @kn: kernfs_node to put an active reference to
149 * Put an active reference to @kn. This function is noop if @kn
152 void kernfs_put_active(struct kernfs_node *kn)
159 if (kn->flags & KERNFS_LOCKDEP)
160 rwsem_release(&kn->dep_map, 1, _RET_IP_);
161 v = atomic_dec_return(&kn->active);
162 if (likely(v != KN_DEACTIVATED_BIAS))
166 * atomic_dec_return() is a mb(), we'll always see the updated
169 complete(kn->u.completion);
173 * kernfs_deactivate - deactivate kernfs_node
174 * @kn: kernfs_node to deactivate
176 * Deny new active references and drain existing ones.
178 static void kernfs_deactivate(struct kernfs_node *kn)
180 DECLARE_COMPLETION_ONSTACK(wait);
183 BUG_ON(!(kn->flags & KERNFS_REMOVED));
185 if (!(kernfs_type(kn) & KERNFS_ACTIVE_REF))
188 kn->u.completion = (void *)&wait;
190 rwsem_acquire(&kn->dep_map, 0, 0, _RET_IP_);
191 /* atomic_add_return() is a mb(), put_active() will always see
192 * the updated kn->u.completion.
194 v = atomic_add_return(KN_DEACTIVATED_BIAS, &kn->active);
196 if (v != KN_DEACTIVATED_BIAS) {
197 lock_contended(&kn->dep_map, _RET_IP_);
198 wait_for_completion(&wait);
201 lock_acquired(&kn->dep_map, _RET_IP_);
202 rwsem_release(&kn->dep_map, 1, _RET_IP_);
206 * kernfs_get - get a reference count on a kernfs_node
207 * @kn: the target kernfs_node
209 void kernfs_get(struct kernfs_node *kn)
212 WARN_ON(!atomic_read(&kn->count));
213 atomic_inc(&kn->count);
216 EXPORT_SYMBOL_GPL(kernfs_get);
219 * kernfs_put - put a reference count on a kernfs_node
220 * @kn: the target kernfs_node
222 * Put a reference count of @kn and destroy it if it reached zero.
224 void kernfs_put(struct kernfs_node *kn)
226 struct kernfs_node *parent;
227 struct kernfs_root *root;
229 if (!kn || !atomic_dec_and_test(&kn->count))
231 root = kernfs_root(kn);
233 /* Moving/renaming is always done while holding reference.
234 * kn->parent won't change beneath us.
238 WARN(!(kn->flags & KERNFS_REMOVED), "kernfs: free using entry: %s/%s\n",
239 parent ? parent->name : "", kn->name);
241 if (kernfs_type(kn) == KERNFS_LINK)
242 kernfs_put(kn->symlink.target_kn);
243 if (kernfs_type(kn) & KERNFS_COPY_NAME)
246 if (kn->iattr->ia_secdata)
247 security_release_secctx(kn->iattr->ia_secdata,
248 kn->iattr->ia_secdata_len);
249 simple_xattrs_free(&kn->iattr->xattrs);
252 ida_simple_remove(&root->ino_ida, kn->ino);
253 kmem_cache_free(kernfs_node_cache, kn);
257 if (atomic_dec_and_test(&kn->count))
260 /* just released the root kn, free @root too */
261 ida_destroy(&root->ino_ida);
265 EXPORT_SYMBOL_GPL(kernfs_put);
267 static int kernfs_dop_delete(const struct dentry *dentry)
269 struct kernfs_node *kn = dentry->d_fsdata;
270 return !(kn && !(kn->flags & KERNFS_REMOVED));
273 static int kernfs_dop_revalidate(struct dentry *dentry, unsigned int flags)
275 struct kernfs_node *kn;
277 if (flags & LOOKUP_RCU)
280 kn = dentry->d_fsdata;
281 mutex_lock(&kernfs_mutex);
283 /* The kernfs node has been deleted */
284 if (kn->flags & KERNFS_REMOVED)
287 /* The kernfs node has been moved? */
288 if (dentry->d_parent->d_fsdata != kn->parent)
291 /* The kernfs node has been renamed */
292 if (strcmp(dentry->d_name.name, kn->name) != 0)
295 /* The kernfs node has been moved to a different namespace */
296 if (kn->parent && kernfs_ns_enabled(kn->parent) &&
297 kernfs_info(dentry->d_sb)->ns != kn->ns)
300 mutex_unlock(&kernfs_mutex);
305 * Remove the dentry from the dcache hashes.
306 * If this is a deleted dentry we use d_drop instead of d_delete
307 * so kernfs doesn't need to cope with negative dentries.
309 * If this is a dentry that has simply been renamed we
310 * use d_drop to remove it from the dcache lookup on its
311 * old parent. If this dentry persists later when a lookup
312 * is performed at its new name the dentry will be readded
313 * to the dcache hashes.
315 mutex_unlock(&kernfs_mutex);
317 /* If we have submounts we must allow the vfs caches
318 * to lie about the state of the filesystem to prevent
319 * leaks and other nasty things.
321 if (check_submounts_and_drop(dentry) != 0)
327 static void kernfs_dop_release(struct dentry *dentry)
329 kernfs_put(dentry->d_fsdata);
332 const struct dentry_operations kernfs_dops = {
333 .d_revalidate = kernfs_dop_revalidate,
334 .d_delete = kernfs_dop_delete,
335 .d_release = kernfs_dop_release,
338 struct kernfs_node *kernfs_new_node(struct kernfs_root *root, const char *name,
339 umode_t mode, int type)
341 char *dup_name = NULL;
342 struct kernfs_node *kn;
345 if (type & KERNFS_COPY_NAME) {
346 name = dup_name = kstrdup(name, GFP_KERNEL);
351 kn = kmem_cache_zalloc(kernfs_node_cache, GFP_KERNEL);
355 ret = ida_simple_get(&root->ino_ida, 1, 0, GFP_KERNEL);
360 atomic_set(&kn->count, 1);
361 atomic_set(&kn->active, 0);
365 kn->flags = type | KERNFS_REMOVED;
370 kmem_cache_free(kernfs_node_cache, kn);
377 * kernfs_addrm_start - prepare for kernfs_node add/remove
378 * @acxt: pointer to kernfs_addrm_cxt to be used
380 * This function is called when the caller is about to add or remove
381 * kernfs_node. This function acquires kernfs_mutex. @acxt is used
382 * to keep and pass context to other addrm functions.
385 * Kernel thread context (may sleep). kernfs_mutex is locked on
388 void kernfs_addrm_start(struct kernfs_addrm_cxt *acxt)
389 __acquires(kernfs_mutex)
391 memset(acxt, 0, sizeof(*acxt));
393 mutex_lock(&kernfs_mutex);
397 * kernfs_add_one - add kernfs_node to parent without warning
398 * @acxt: addrm context to use
399 * @kn: kernfs_node to be added
400 * @parent: the parent kernfs_node to add @kn to
402 * Get @parent and set @kn->parent to it and increment nlink of the
403 * parent inode if @kn is a directory and link into the children list
406 * This function should be called between calls to
407 * kernfs_addrm_start() and kernfs_addrm_finish() and should be passed
408 * the same @acxt as passed to kernfs_addrm_start().
411 * Determined by kernfs_addrm_start().
414 * 0 on success, -EEXIST if entry with the given name already
417 int kernfs_add_one(struct kernfs_addrm_cxt *acxt, struct kernfs_node *kn,
418 struct kernfs_node *parent)
420 bool has_ns = kernfs_ns_enabled(parent);
421 struct kernfs_iattrs *ps_iattr;
424 if (has_ns != (bool)kn->ns) {
425 WARN(1, KERN_WARNING "kernfs: ns %s in '%s' for '%s'\n",
426 has_ns ? "required" : "invalid", parent->name, kn->name);
430 if (kernfs_type(parent) != KERNFS_DIR)
433 kn->hash = kernfs_name_hash(kn->name, kn->ns);
437 ret = kernfs_link_sibling(kn);
441 /* Update timestamps on the parent */
442 ps_iattr = parent->iattr;
444 struct iattr *ps_iattrs = &ps_iattr->ia_iattr;
445 ps_iattrs->ia_ctime = ps_iattrs->ia_mtime = CURRENT_TIME;
448 /* Mark the entry added into directory tree */
449 kn->flags &= ~KERNFS_REMOVED;
455 * kernfs_remove_one - remove kernfs_node from parent
456 * @acxt: addrm context to use
457 * @kn: kernfs_node to be removed
459 * Mark @kn removed and drop nlink of parent inode if @kn is a
460 * directory. @kn is unlinked from the children list.
462 * This function should be called between calls to
463 * kernfs_addrm_start() and kernfs_addrm_finish() and should be
464 * passed the same @acxt as passed to kernfs_addrm_start().
467 * Determined by kernfs_addrm_start().
469 static void kernfs_remove_one(struct kernfs_addrm_cxt *acxt,
470 struct kernfs_node *kn)
472 struct kernfs_iattrs *ps_iattr;
475 * Removal can be called multiple times on the same node. Only the
476 * first invocation is effective and puts the base ref.
478 if (kn->flags & KERNFS_REMOVED)
482 kernfs_unlink_sibling(kn);
484 /* Update timestamps on the parent */
485 ps_iattr = kn->parent->iattr;
487 ps_iattr->ia_iattr.ia_ctime = CURRENT_TIME;
488 ps_iattr->ia_iattr.ia_mtime = CURRENT_TIME;
492 kn->flags |= KERNFS_REMOVED;
493 kn->u.removed_list = acxt->removed;
498 * kernfs_addrm_finish - finish up kernfs_node add/remove
499 * @acxt: addrm context to finish up
501 * Finish up kernfs_node add/remove. Resources acquired by
502 * kernfs_addrm_start() are released and removed kernfs_nodes are
506 * kernfs_mutex is released.
508 void kernfs_addrm_finish(struct kernfs_addrm_cxt *acxt)
509 __releases(kernfs_mutex)
511 /* release resources acquired by kernfs_addrm_start() */
512 mutex_unlock(&kernfs_mutex);
514 /* kill removed kernfs_nodes */
515 while (acxt->removed) {
516 struct kernfs_node *kn = acxt->removed;
518 acxt->removed = kn->u.removed_list;
520 kernfs_deactivate(kn);
521 kernfs_unmap_bin_file(kn);
527 * kernfs_find_ns - find kernfs_node with the given name
528 * @parent: kernfs_node to search under
529 * @name: name to look for
530 * @ns: the namespace tag to use
532 * Look for kernfs_node with name @name under @parent. Returns pointer to
533 * the found kernfs_node on success, %NULL on failure.
535 static struct kernfs_node *kernfs_find_ns(struct kernfs_node *parent,
536 const unsigned char *name,
539 struct rb_node *node = parent->dir.children.rb_node;
540 bool has_ns = kernfs_ns_enabled(parent);
543 lockdep_assert_held(&kernfs_mutex);
545 if (has_ns != (bool)ns) {
546 WARN(1, KERN_WARNING "kernfs: ns %s in '%s' for '%s'\n",
547 has_ns ? "required" : "invalid", parent->name, name);
551 hash = kernfs_name_hash(name, ns);
553 struct kernfs_node *kn;
557 result = kernfs_name_compare(hash, name, ns, kn);
559 node = node->rb_left;
561 node = node->rb_right;
569 * kernfs_find_and_get_ns - find and get kernfs_node with the given name
570 * @parent: kernfs_node to search under
571 * @name: name to look for
572 * @ns: the namespace tag to use
574 * Look for kernfs_node with name @name under @parent and get a reference
575 * if found. This function may sleep and returns pointer to the found
576 * kernfs_node on success, %NULL on failure.
578 struct kernfs_node *kernfs_find_and_get_ns(struct kernfs_node *parent,
579 const char *name, const void *ns)
581 struct kernfs_node *kn;
583 mutex_lock(&kernfs_mutex);
584 kn = kernfs_find_ns(parent, name, ns);
586 mutex_unlock(&kernfs_mutex);
590 EXPORT_SYMBOL_GPL(kernfs_find_and_get_ns);
593 * kernfs_create_root - create a new kernfs hierarchy
594 * @priv: opaque data associated with the new directory
596 * Returns the root of the new hierarchy on success, ERR_PTR() value on
599 struct kernfs_root *kernfs_create_root(void *priv)
601 struct kernfs_root *root;
602 struct kernfs_node *kn;
604 root = kzalloc(sizeof(*root), GFP_KERNEL);
606 return ERR_PTR(-ENOMEM);
608 ida_init(&root->ino_ida);
610 kn = kernfs_new_node(root, "", S_IFDIR | S_IRUGO | S_IXUGO, KERNFS_DIR);
612 ida_destroy(&root->ino_ida);
614 return ERR_PTR(-ENOMEM);
617 kn->flags &= ~KERNFS_REMOVED;
627 * kernfs_destroy_root - destroy a kernfs hierarchy
628 * @root: root of the hierarchy to destroy
630 * Destroy the hierarchy anchored at @root by removing all existing
631 * directories and destroying @root.
633 void kernfs_destroy_root(struct kernfs_root *root)
635 kernfs_remove(root->kn); /* will also free @root */
639 * kernfs_create_dir_ns - create a directory
640 * @parent: parent in which to create a new directory
641 * @name: name of the new directory
642 * @mode: mode of the new directory
643 * @priv: opaque data associated with the new directory
644 * @ns: optional namespace tag of the directory
646 * Returns the created node on success, ERR_PTR() value on failure.
648 struct kernfs_node *kernfs_create_dir_ns(struct kernfs_node *parent,
649 const char *name, umode_t mode,
650 void *priv, const void *ns)
652 struct kernfs_addrm_cxt acxt;
653 struct kernfs_node *kn;
657 kn = kernfs_new_node(kernfs_root(parent), name, mode | S_IFDIR,
660 return ERR_PTR(-ENOMEM);
662 kn->dir.root = parent->dir.root;
667 kernfs_addrm_start(&acxt);
668 rc = kernfs_add_one(&acxt, kn, parent);
669 kernfs_addrm_finish(&acxt);
678 static struct dentry *kernfs_iop_lookup(struct inode *dir,
679 struct dentry *dentry,
682 struct dentry *ret = NULL;
683 struct kernfs_node *parent = dentry->d_parent->d_fsdata;
684 struct kernfs_node *kn;
686 const void *ns = NULL;
688 mutex_lock(&kernfs_mutex);
690 if (kernfs_ns_enabled(parent))
691 ns = kernfs_info(dir->i_sb)->ns;
693 kn = kernfs_find_ns(parent, dentry->d_name.name, ns);
697 ret = ERR_PTR(-ENOENT);
701 dentry->d_fsdata = kn;
703 /* attach dentry and inode */
704 inode = kernfs_get_inode(dir->i_sb, kn);
706 ret = ERR_PTR(-ENOMEM);
710 /* instantiate and hash dentry */
711 ret = d_materialise_unique(dentry, inode);
713 mutex_unlock(&kernfs_mutex);
717 const struct inode_operations kernfs_dir_iops = {
718 .lookup = kernfs_iop_lookup,
719 .permission = kernfs_iop_permission,
720 .setattr = kernfs_iop_setattr,
721 .getattr = kernfs_iop_getattr,
722 .setxattr = kernfs_iop_setxattr,
723 .removexattr = kernfs_iop_removexattr,
724 .getxattr = kernfs_iop_getxattr,
725 .listxattr = kernfs_iop_listxattr,
728 static struct kernfs_node *kernfs_leftmost_descendant(struct kernfs_node *pos)
730 struct kernfs_node *last;
737 if (kernfs_type(pos) != KERNFS_DIR)
740 rbn = rb_first(&pos->dir.children);
751 * kernfs_next_descendant_post - find the next descendant for post-order walk
752 * @pos: the current position (%NULL to initiate traversal)
753 * @root: kernfs_node whose descendants to walk
755 * Find the next descendant to visit for post-order traversal of @root's
756 * descendants. @root is included in the iteration and the last node to be
759 static struct kernfs_node *kernfs_next_descendant_post(struct kernfs_node *pos,
760 struct kernfs_node *root)
764 lockdep_assert_held(&kernfs_mutex);
766 /* if first iteration, visit leftmost descendant which may be root */
768 return kernfs_leftmost_descendant(root);
770 /* if we visited @root, we're done */
774 /* if there's an unvisited sibling, visit its leftmost descendant */
775 rbn = rb_next(&pos->rb);
777 return kernfs_leftmost_descendant(rb_to_kn(rbn));
779 /* no sibling left, visit parent */
783 static void __kernfs_remove(struct kernfs_addrm_cxt *acxt,
784 struct kernfs_node *kn)
786 struct kernfs_node *pos, *next;
791 pr_debug("kernfs %s: removing\n", kn->name);
796 next = kernfs_next_descendant_post(pos, kn);
798 kernfs_remove_one(acxt, pos);
803 * kernfs_remove - remove a kernfs_node recursively
804 * @kn: the kernfs_node to remove
806 * Remove @kn along with all its subdirectories and files.
808 void kernfs_remove(struct kernfs_node *kn)
810 struct kernfs_addrm_cxt acxt;
812 kernfs_addrm_start(&acxt);
813 __kernfs_remove(&acxt, kn);
814 kernfs_addrm_finish(&acxt);
818 * kernfs_remove_by_name_ns - find a kernfs_node by name and remove it
819 * @parent: parent of the target
820 * @name: name of the kernfs_node to remove
821 * @ns: namespace tag of the kernfs_node to remove
823 * Look for the kernfs_node with @name and @ns under @parent and remove it.
824 * Returns 0 on success, -ENOENT if such entry doesn't exist.
826 int kernfs_remove_by_name_ns(struct kernfs_node *parent, const char *name,
829 struct kernfs_addrm_cxt acxt;
830 struct kernfs_node *kn;
833 WARN(1, KERN_WARNING "kernfs: can not remove '%s', no directory\n",
838 kernfs_addrm_start(&acxt);
840 kn = kernfs_find_ns(parent, name, ns);
842 __kernfs_remove(&acxt, kn);
844 kernfs_addrm_finish(&acxt);
853 * kernfs_rename_ns - move and rename a kernfs_node
855 * @new_parent: new parent to put @sd under
856 * @new_name: new name
857 * @new_ns: new namespace tag
859 int kernfs_rename_ns(struct kernfs_node *kn, struct kernfs_node *new_parent,
860 const char *new_name, const void *new_ns)
864 mutex_lock(&kernfs_mutex);
867 if ((kn->parent == new_parent) && (kn->ns == new_ns) &&
868 (strcmp(kn->name, new_name) == 0))
869 goto out; /* nothing to rename */
872 if (kernfs_find_ns(new_parent, new_name, new_ns))
875 /* rename kernfs_node */
876 if (strcmp(kn->name, new_name) != 0) {
878 new_name = kstrdup(new_name, GFP_KERNEL);
887 * Move to the appropriate place in the appropriate directories rbtree.
889 kernfs_unlink_sibling(kn);
890 kernfs_get(new_parent);
891 kernfs_put(kn->parent);
893 kn->hash = kernfs_name_hash(kn->name, kn->ns);
894 kn->parent = new_parent;
895 kernfs_link_sibling(kn);
899 mutex_unlock(&kernfs_mutex);
903 /* Relationship between s_mode and the DT_xxx types */
904 static inline unsigned char dt_type(struct kernfs_node *kn)
906 return (kn->mode >> 12) & 15;
909 static int kernfs_dir_fop_release(struct inode *inode, struct file *filp)
911 kernfs_put(filp->private_data);
915 static struct kernfs_node *kernfs_dir_pos(const void *ns,
916 struct kernfs_node *parent, loff_t hash, struct kernfs_node *pos)
919 int valid = !(pos->flags & KERNFS_REMOVED) &&
920 pos->parent == parent && hash == pos->hash;
925 if (!pos && (hash > 1) && (hash < INT_MAX)) {
926 struct rb_node *node = parent->dir.children.rb_node;
928 pos = rb_to_kn(node);
930 if (hash < pos->hash)
931 node = node->rb_left;
932 else if (hash > pos->hash)
933 node = node->rb_right;
938 /* Skip over entries in the wrong namespace */
939 while (pos && pos->ns != ns) {
940 struct rb_node *node = rb_next(&pos->rb);
944 pos = rb_to_kn(node);
949 static struct kernfs_node *kernfs_dir_next_pos(const void *ns,
950 struct kernfs_node *parent, ino_t ino, struct kernfs_node *pos)
952 pos = kernfs_dir_pos(ns, parent, ino, pos);
955 struct rb_node *node = rb_next(&pos->rb);
959 pos = rb_to_kn(node);
960 } while (pos && pos->ns != ns);
964 static int kernfs_fop_readdir(struct file *file, struct dir_context *ctx)
966 struct dentry *dentry = file->f_path.dentry;
967 struct kernfs_node *parent = dentry->d_fsdata;
968 struct kernfs_node *pos = file->private_data;
969 const void *ns = NULL;
971 if (!dir_emit_dots(file, ctx))
973 mutex_lock(&kernfs_mutex);
975 if (kernfs_ns_enabled(parent))
976 ns = kernfs_info(dentry->d_sb)->ns;
978 for (pos = kernfs_dir_pos(ns, parent, ctx->pos, pos);
980 pos = kernfs_dir_next_pos(ns, parent, ctx->pos, pos)) {
981 const char *name = pos->name;
982 unsigned int type = dt_type(pos);
983 int len = strlen(name);
984 ino_t ino = pos->ino;
986 ctx->pos = pos->hash;
987 file->private_data = pos;
990 mutex_unlock(&kernfs_mutex);
991 if (!dir_emit(ctx, name, len, ino, type))
993 mutex_lock(&kernfs_mutex);
995 mutex_unlock(&kernfs_mutex);
996 file->private_data = NULL;
1001 static loff_t kernfs_dir_fop_llseek(struct file *file, loff_t offset,
1004 struct inode *inode = file_inode(file);
1007 mutex_lock(&inode->i_mutex);
1008 ret = generic_file_llseek(file, offset, whence);
1009 mutex_unlock(&inode->i_mutex);
1014 const struct file_operations kernfs_dir_fops = {
1015 .read = generic_read_dir,
1016 .iterate = kernfs_fop_readdir,
1017 .release = kernfs_dir_fop_release,
1018 .llseek = kernfs_dir_fop_llseek,