Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | #ifndef __LINUX_DCACHE_H |
| 2 | #define __LINUX_DCACHE_H |
| 3 | |
Arun Sharma | 60063497 | 2011-07-26 16:09:06 -0700 | [diff] [blame] | 4 | #include <linux/atomic.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5 | #include <linux/list.h> |
Franck Bui-Huu | 8252474 | 2008-05-12 21:21:05 +0200 | [diff] [blame] | 6 | #include <linux/rculist.h> |
Nick Piggin | ceb5bdc | 2011-01-07 17:50:05 +1100 | [diff] [blame] | 7 | #include <linux/rculist_bl.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 8 | #include <linux/spinlock.h> |
Nick Piggin | 31e6b01 | 2011-01-07 17:49:52 +1100 | [diff] [blame] | 9 | #include <linux/seqlock.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 10 | #include <linux/cache.h> |
| 11 | #include <linux/rcupdate.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 12 | |
| 13 | struct nameidata; |
Jan Blunck | cf28b48 | 2008-02-14 19:38:44 -0800 | [diff] [blame] | 14 | struct path; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 15 | struct vfsmount; |
| 16 | |
| 17 | /* |
| 18 | * linux/include/linux/dcache.h |
| 19 | * |
| 20 | * Dirent cache data structures |
| 21 | * |
| 22 | * (C) Copyright 1997 Thomas Schoebel-Theuer, |
| 23 | * with heavy changes by Linus Torvalds |
| 24 | */ |
| 25 | |
| 26 | #define IS_ROOT(x) ((x) == (x)->d_parent) |
| 27 | |
| 28 | /* |
| 29 | * "quick string" -- eases parameter passing, but more importantly |
| 30 | * saves "metadata" about the string (ie length and the hash). |
| 31 | * |
| 32 | * hash comes first so it snuggles against d_parent in the |
| 33 | * dentry. |
| 34 | */ |
| 35 | struct qstr { |
| 36 | unsigned int hash; |
| 37 | unsigned int len; |
| 38 | const unsigned char *name; |
| 39 | }; |
| 40 | |
| 41 | struct dentry_stat_t { |
| 42 | int nr_dentry; |
| 43 | int nr_unused; |
| 44 | int age_limit; /* age in seconds */ |
| 45 | int want_pages; /* pages requested by system */ |
| 46 | int dummy[2]; |
| 47 | }; |
| 48 | extern struct dentry_stat_t dentry_stat; |
| 49 | |
Nick Piggin | 9d55c36 | 2011-01-07 17:50:09 +1100 | [diff] [blame] | 50 | /* |
| 51 | * Compare 2 name strings, return 0 if they match, otherwise non-zero. |
| 52 | * The strings are both count bytes long, and count is non-zero. |
| 53 | */ |
| 54 | static inline int dentry_cmp(const unsigned char *cs, size_t scount, |
| 55 | const unsigned char *ct, size_t tcount) |
| 56 | { |
| 57 | int ret; |
| 58 | if (scount != tcount) |
| 59 | return 1; |
| 60 | do { |
| 61 | ret = (*cs != *ct); |
| 62 | if (ret) |
| 63 | break; |
| 64 | cs++; |
| 65 | ct++; |
| 66 | tcount--; |
| 67 | } while (tcount); |
| 68 | return ret; |
| 69 | } |
| 70 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 71 | /* Name hashing routines. Initial hash value */ |
| 72 | /* Hash courtesy of the R5 hash in reiserfs modulo sign bits */ |
| 73 | #define init_name_hash() 0 |
| 74 | |
| 75 | /* partial hash update function. Assume roughly 4 bits per character */ |
| 76 | static inline unsigned long |
| 77 | partial_name_hash(unsigned long c, unsigned long prevhash) |
| 78 | { |
| 79 | return (prevhash + (c << 4) + (c >> 4)) * 11; |
| 80 | } |
| 81 | |
| 82 | /* |
| 83 | * Finally: cut down the number of bits to a int value (and try to avoid |
| 84 | * losing bits) |
| 85 | */ |
| 86 | static inline unsigned long end_name_hash(unsigned long hash) |
| 87 | { |
| 88 | return (unsigned int) hash; |
| 89 | } |
| 90 | |
| 91 | /* Compute the hash for a name string. */ |
| 92 | static inline unsigned int |
| 93 | full_name_hash(const unsigned char *name, unsigned int len) |
| 94 | { |
| 95 | unsigned long hash = init_name_hash(); |
| 96 | while (len--) |
| 97 | hash = partial_name_hash(*name++, hash); |
| 98 | return end_name_hash(hash); |
| 99 | } |
| 100 | |
Nick Piggin | c2452f3 | 2008-12-01 09:33:43 +0100 | [diff] [blame] | 101 | /* |
| 102 | * Try to keep struct dentry aligned on 64 byte cachelines (this will |
| 103 | * give reasonable cacheline footprint with larger lines without the |
| 104 | * large memory footprint increase). |
| 105 | */ |
| 106 | #ifdef CONFIG_64BIT |
Nick Piggin | 44a7d7a | 2011-01-07 17:49:56 +1100 | [diff] [blame] | 107 | # define DNAME_INLINE_LEN 32 /* 192 bytes */ |
Nick Piggin | c2452f3 | 2008-12-01 09:33:43 +0100 | [diff] [blame] | 108 | #else |
Nick Piggin | 44a7d7a | 2011-01-07 17:49:56 +1100 | [diff] [blame] | 109 | # ifdef CONFIG_SMP |
| 110 | # define DNAME_INLINE_LEN 36 /* 128 bytes */ |
| 111 | # else |
| 112 | # define DNAME_INLINE_LEN 40 /* 128 bytes */ |
| 113 | # endif |
Nick Piggin | c2452f3 | 2008-12-01 09:33:43 +0100 | [diff] [blame] | 114 | #endif |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 115 | |
| 116 | struct dentry { |
Nick Piggin | 44a7d7a | 2011-01-07 17:49:56 +1100 | [diff] [blame] | 117 | /* RCU lookup touched fields */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 118 | unsigned int d_flags; /* protected by d_lock */ |
Nick Piggin | 31e6b01 | 2011-01-07 17:49:52 +1100 | [diff] [blame] | 119 | seqcount_t d_seq; /* per dentry seqlock */ |
Nick Piggin | ceb5bdc | 2011-01-07 17:50:05 +1100 | [diff] [blame] | 120 | struct hlist_bl_node d_hash; /* lookup hash list */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 121 | struct dentry *d_parent; /* parent directory */ |
| 122 | struct qstr d_name; |
Nick Piggin | 44a7d7a | 2011-01-07 17:49:56 +1100 | [diff] [blame] | 123 | struct inode *d_inode; /* Where the name belongs to - NULL is |
| 124 | * negative */ |
| 125 | unsigned char d_iname[DNAME_INLINE_LEN]; /* small names */ |
| 126 | |
| 127 | /* Ref lookup also touches following */ |
| 128 | unsigned int d_count; /* protected by d_lock */ |
| 129 | spinlock_t d_lock; /* per dentry lock */ |
| 130 | const struct dentry_operations *d_op; |
| 131 | struct super_block *d_sb; /* The root of the dentry tree */ |
| 132 | unsigned long d_time; /* used by d_revalidate */ |
| 133 | void *d_fsdata; /* fs-specific data */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 134 | |
| 135 | struct list_head d_lru; /* LRU list */ |
Eric Dumazet | 5160ee6 | 2006-01-08 01:03:32 -0800 | [diff] [blame] | 136 | /* |
| 137 | * d_child and d_rcu can share memory |
| 138 | */ |
| 139 | union { |
| 140 | struct list_head d_child; /* child of parent list */ |
| 141 | struct rcu_head d_rcu; |
| 142 | } d_u; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 143 | struct list_head d_subdirs; /* our children */ |
| 144 | struct list_head d_alias; /* inode alias list */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 145 | }; |
| 146 | |
Ingo Molnar | a90b9c0 | 2006-07-03 00:25:04 -0700 | [diff] [blame] | 147 | /* |
| 148 | * dentry->d_lock spinlock nesting subclasses: |
| 149 | * |
| 150 | * 0: normal |
| 151 | * 1: nested |
| 152 | */ |
| 153 | enum dentry_d_lock_class |
| 154 | { |
| 155 | DENTRY_D_LOCK_NORMAL, /* implicitly used by plain spin_lock() APIs. */ |
| 156 | DENTRY_D_LOCK_NESTED |
| 157 | }; |
| 158 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 159 | struct dentry_operations { |
| 160 | int (*d_revalidate)(struct dentry *, struct nameidata *); |
Nick Piggin | b1e6a01 | 2011-01-07 17:49:28 +1100 | [diff] [blame] | 161 | int (*d_hash)(const struct dentry *, const struct inode *, |
| 162 | struct qstr *); |
Nick Piggin | 621e155 | 2011-01-07 17:49:27 +1100 | [diff] [blame] | 163 | int (*d_compare)(const struct dentry *, const struct inode *, |
| 164 | const struct dentry *, const struct inode *, |
| 165 | unsigned int, const char *, const struct qstr *); |
Nick Piggin | fe15ce4 | 2011-01-07 17:49:23 +1100 | [diff] [blame] | 166 | int (*d_delete)(const struct dentry *); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 167 | void (*d_release)(struct dentry *); |
| 168 | void (*d_iput)(struct dentry *, struct inode *); |
Eric Dumazet | c23fbb6 | 2007-05-08 00:26:18 -0700 | [diff] [blame] | 169 | char *(*d_dname)(struct dentry *, char *, int); |
David Howells | 9875cf8 | 2011-01-14 18:45:21 +0000 | [diff] [blame] | 170 | struct vfsmount *(*d_automount)(struct path *); |
Al Viro | 1aed3e4 | 2011-03-18 09:09:02 -0400 | [diff] [blame] | 171 | int (*d_manage)(struct dentry *, bool); |
Nick Piggin | 44a7d7a | 2011-01-07 17:49:56 +1100 | [diff] [blame] | 172 | } ____cacheline_aligned; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 173 | |
Nick Piggin | 5eef7fa | 2011-01-07 17:49:22 +1100 | [diff] [blame] | 174 | /* |
| 175 | * Locking rules for dentry_operations callbacks are to be found in |
| 176 | * Documentation/filesystems/Locking. Keep it updated! |
| 177 | * |
Nick Piggin | 621e155 | 2011-01-07 17:49:27 +1100 | [diff] [blame] | 178 | * FUrther descriptions are found in Documentation/filesystems/vfs.txt. |
| 179 | * Keep it updated too! |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 180 | */ |
| 181 | |
| 182 | /* d_flags entries */ |
Linus Torvalds | 830c0f0 | 2011-08-06 22:41:50 -0700 | [diff] [blame] | 183 | #define DCACHE_OP_HASH 0x0001 |
| 184 | #define DCACHE_OP_COMPARE 0x0002 |
| 185 | #define DCACHE_OP_REVALIDATE 0x0004 |
| 186 | #define DCACHE_OP_DELETE 0x0008 |
Nick Piggin | 5f57cbc | 2011-01-07 17:49:54 +1100 | [diff] [blame] | 187 | |
Linus Torvalds | 830c0f0 | 2011-08-06 22:41:50 -0700 | [diff] [blame] | 188 | #define DCACHE_DISCONNECTED 0x0010 |
Nick Piggin | 5f57cbc | 2011-01-07 17:49:54 +1100 | [diff] [blame] | 189 | /* This dentry is possibly not currently connected to the dcache tree, in |
| 190 | * which case its parent will either be itself, or will have this flag as |
| 191 | * well. nfsd will not use a dentry with this bit set, but will first |
| 192 | * endeavour to clear the bit either by discovering that it is connected, |
| 193 | * or by performing lookup operations. Any filesystem which supports |
| 194 | * nfsd_operations MUST have a lookup function which, if it finds a |
| 195 | * directory inode with a DCACHE_DISCONNECTED dentry, will d_move that |
| 196 | * dentry into place and return that dentry rather than the passed one, |
| 197 | * typically using d_splice_alias. */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 198 | |
Linus Torvalds | 830c0f0 | 2011-08-06 22:41:50 -0700 | [diff] [blame] | 199 | #define DCACHE_REFERENCED 0x0020 /* Recently used, don't discard. */ |
| 200 | #define DCACHE_RCUACCESS 0x0040 /* Entry has ever been RCU-visible */ |
Eric Paris | c28f7e5 | 2009-05-21 17:01:29 -0400 | [diff] [blame] | 201 | |
Al Viro | d83c49f | 2010-04-30 17:17:09 -0400 | [diff] [blame] | 202 | #define DCACHE_CANT_MOUNT 0x0100 |
Nick Piggin | 949854d | 2011-01-07 17:49:37 +1100 | [diff] [blame] | 203 | #define DCACHE_GENOCIDE 0x0200 |
Nick Piggin | 5f57cbc | 2011-01-07 17:49:54 +1100 | [diff] [blame] | 204 | |
Linus Torvalds | 830c0f0 | 2011-08-06 22:41:50 -0700 | [diff] [blame] | 205 | #define DCACHE_NFSFS_RENAMED 0x1000 |
| 206 | /* this dentry has been "silly renamed" and has to be deleted on the last |
| 207 | * dput() */ |
| 208 | #define DCACHE_COOKIE 0x2000 /* For use by dcookie subsystem */ |
| 209 | #define DCACHE_FSNOTIFY_PARENT_WATCHED 0x4000 |
| 210 | /* Parent inode is watched by some fsnotify listener */ |
Nick Piggin | fb045ad | 2011-01-07 17:49:55 +1100 | [diff] [blame] | 211 | |
David Howells | 9875cf8 | 2011-01-14 18:45:21 +0000 | [diff] [blame] | 212 | #define DCACHE_MOUNTED 0x10000 /* is a mountpoint */ |
| 213 | #define DCACHE_NEED_AUTOMOUNT 0x20000 /* handle automount on this dir */ |
David Howells | cc53ce5 | 2011-01-14 18:45:26 +0000 | [diff] [blame] | 214 | #define DCACHE_MANAGE_TRANSIT 0x40000 /* manage transit from this dirent */ |
Josef Bacik | 44396f4 | 2011-05-31 11:58:49 -0400 | [diff] [blame] | 215 | #define DCACHE_NEED_LOOKUP 0x80000 /* dentry requires i_op->lookup */ |
David Howells | 9875cf8 | 2011-01-14 18:45:21 +0000 | [diff] [blame] | 216 | #define DCACHE_MANAGED_DENTRY \ |
David Howells | cc53ce5 | 2011-01-14 18:45:26 +0000 | [diff] [blame] | 217 | (DCACHE_MOUNTED|DCACHE_NEED_AUTOMOUNT|DCACHE_MANAGE_TRANSIT) |
David Howells | 9875cf8 | 2011-01-14 18:45:21 +0000 | [diff] [blame] | 218 | |
Al Viro | 74c3cbe | 2007-07-22 08:04:18 -0400 | [diff] [blame] | 219 | extern seqlock_t rename_lock; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 220 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 221 | static inline int dname_external(struct dentry *dentry) |
| 222 | { |
| 223 | return dentry->d_name.name != dentry->d_iname; |
| 224 | } |
| 225 | |
| 226 | /* |
| 227 | * These are the low-level FS interfaces to the dcache.. |
| 228 | */ |
| 229 | extern void d_instantiate(struct dentry *, struct inode *); |
| 230 | extern struct dentry * d_instantiate_unique(struct dentry *, struct inode *); |
David Howells | 770bfad | 2006-08-22 20:06:07 -0400 | [diff] [blame] | 231 | extern struct dentry * d_materialise_unique(struct dentry *, struct inode *); |
Nick Piggin | 789680d | 2011-01-07 17:49:30 +1100 | [diff] [blame] | 232 | extern void __d_drop(struct dentry *dentry); |
| 233 | extern void d_drop(struct dentry *dentry); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 234 | extern void d_delete(struct dentry *); |
Nick Piggin | fb045ad | 2011-01-07 17:49:55 +1100 | [diff] [blame] | 235 | extern void d_set_d_op(struct dentry *dentry, const struct dentry_operations *op); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 236 | |
| 237 | /* allocate/de-allocate */ |
| 238 | extern struct dentry * d_alloc(struct dentry *, const struct qstr *); |
Nick Piggin | 4b93688 | 2011-01-07 17:50:07 +1100 | [diff] [blame] | 239 | extern struct dentry * d_alloc_pseudo(struct super_block *, const struct qstr *); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 240 | extern struct dentry * d_splice_alias(struct inode *, struct dentry *); |
Christoph Hellwig | e45b590 | 2008-08-07 23:49:07 +0200 | [diff] [blame] | 241 | extern struct dentry * d_add_ci(struct dentry *, struct inode *, struct qstr *); |
Christoph Hellwig | 4ea3ada | 2008-08-11 15:48:57 +0200 | [diff] [blame] | 242 | extern struct dentry * d_obtain_alias(struct inode *); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 243 | extern void shrink_dcache_sb(struct super_block *); |
| 244 | extern void shrink_dcache_parent(struct dentry *); |
David Howells | c636ebd | 2006-10-11 01:22:19 -0700 | [diff] [blame] | 245 | extern void shrink_dcache_for_umount(struct super_block *); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 246 | extern int d_invalidate(struct dentry *); |
| 247 | |
| 248 | /* only used at mount-time */ |
| 249 | extern struct dentry * d_alloc_root(struct inode *); |
| 250 | |
| 251 | /* <clickety>-<click> the ramfs-type tree */ |
| 252 | extern void d_genocide(struct dentry *); |
| 253 | |
| 254 | extern struct dentry *d_find_alias(struct inode *); |
| 255 | extern void d_prune_aliases(struct inode *); |
| 256 | |
| 257 | /* test whether we have any submounts in a subdir tree */ |
| 258 | extern int have_submounts(struct dentry *); |
| 259 | |
| 260 | /* |
| 261 | * This adds the entry to the hash queues. |
| 262 | */ |
| 263 | extern void d_rehash(struct dentry *); |
| 264 | |
| 265 | /** |
| 266 | * d_add - add dentry to hash queues |
| 267 | * @entry: dentry to add |
| 268 | * @inode: The inode to attach to this dentry |
| 269 | * |
| 270 | * This adds the entry to the hash queues and initializes @inode. |
| 271 | * The entry was actually filled in earlier during d_alloc(). |
| 272 | */ |
| 273 | |
| 274 | static inline void d_add(struct dentry *entry, struct inode *inode) |
| 275 | { |
| 276 | d_instantiate(entry, inode); |
| 277 | d_rehash(entry); |
| 278 | } |
| 279 | |
| 280 | /** |
| 281 | * d_add_unique - add dentry to hash queues without aliasing |
| 282 | * @entry: dentry to add |
| 283 | * @inode: The inode to attach to this dentry |
| 284 | * |
| 285 | * This adds the entry to the hash queues and initializes @inode. |
| 286 | * The entry was actually filled in earlier during d_alloc(). |
| 287 | */ |
| 288 | static inline struct dentry *d_add_unique(struct dentry *entry, struct inode *inode) |
| 289 | { |
| 290 | struct dentry *res; |
| 291 | |
| 292 | res = d_instantiate_unique(entry, inode); |
| 293 | d_rehash(res != NULL ? res : entry); |
| 294 | return res; |
| 295 | } |
| 296 | |
Nick Piggin | fb2d5b8 | 2011-01-07 17:49:26 +1100 | [diff] [blame] | 297 | extern void dentry_update_name_case(struct dentry *, struct qstr *); |
| 298 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 299 | /* used for rename() and baskets */ |
| 300 | extern void d_move(struct dentry *, struct dentry *); |
OGAWA Hirofumi | e2761a1 | 2008-10-16 07:50:28 +0900 | [diff] [blame] | 301 | extern struct dentry *d_ancestor(struct dentry *, struct dentry *); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 302 | |
| 303 | /* appendix may either be NULL or be used for transname suffixes */ |
Nick Piggin | 31e6b01 | 2011-01-07 17:49:52 +1100 | [diff] [blame] | 304 | extern struct dentry *d_lookup(struct dentry *, struct qstr *); |
| 305 | extern struct dentry *d_hash_and_lookup(struct dentry *, struct qstr *); |
| 306 | extern struct dentry *__d_lookup(struct dentry *, struct qstr *); |
| 307 | extern struct dentry *__d_lookup_rcu(struct dentry *parent, struct qstr *name, |
| 308 | unsigned *seq, struct inode **inode); |
| 309 | |
| 310 | /** |
| 311 | * __d_rcu_to_refcount - take a refcount on dentry if sequence check is ok |
| 312 | * @dentry: dentry to take a ref on |
| 313 | * @seq: seqcount to verify against |
Randy Dunlap | 2a8c0c68 | 2011-01-08 19:37:20 -0800 | [diff] [blame] | 314 | * Returns: 0 on failure, else 1. |
Nick Piggin | 31e6b01 | 2011-01-07 17:49:52 +1100 | [diff] [blame] | 315 | * |
| 316 | * __d_rcu_to_refcount operates on a dentry,seq pair that was returned |
| 317 | * by __d_lookup_rcu, to get a reference on an rcu-walk dentry. |
| 318 | */ |
| 319 | static inline int __d_rcu_to_refcount(struct dentry *dentry, unsigned seq) |
| 320 | { |
| 321 | int ret = 0; |
| 322 | |
| 323 | assert_spin_locked(&dentry->d_lock); |
| 324 | if (!read_seqcount_retry(&dentry->d_seq, seq)) { |
| 325 | ret = 1; |
| 326 | dentry->d_count++; |
| 327 | } |
| 328 | |
| 329 | return ret; |
| 330 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 331 | |
| 332 | /* validate "insecure" dentry pointer */ |
| 333 | extern int d_validate(struct dentry *, struct dentry *); |
| 334 | |
Eric Dumazet | c23fbb6 | 2007-05-08 00:26:18 -0700 | [diff] [blame] | 335 | /* |
| 336 | * helper function for dentry_operations.d_dname() members |
| 337 | */ |
| 338 | extern char *dynamic_dname(struct dentry *, char *, int, const char *, ...); |
| 339 | |
Miklos Szeredi | 9d1bc601 | 2008-03-27 13:06:21 +0100 | [diff] [blame] | 340 | extern char *__d_path(const struct path *path, struct path *root, char *, int); |
Jan Engelhardt | 20d4fdc | 2008-06-09 16:40:36 -0700 | [diff] [blame] | 341 | extern char *d_path(const struct path *, char *, int); |
Miklos Szeredi | 8df9d1a | 2010-08-10 11:41:41 +0200 | [diff] [blame] | 342 | extern char *d_path_with_unreachable(const struct path *, char *, int); |
Nick Piggin | ec2447c | 2011-01-07 17:49:29 +1100 | [diff] [blame] | 343 | extern char *dentry_path_raw(struct dentry *, char *, int); |
Ram Pai | 6092d04 | 2008-03-27 13:06:20 +0100 | [diff] [blame] | 344 | extern char *dentry_path(struct dentry *, char *, int); |
Jan Blunck | cf28b48 | 2008-02-14 19:38:44 -0800 | [diff] [blame] | 345 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 346 | /* Allocation counts.. */ |
| 347 | |
| 348 | /** |
Nick Piggin | dc0474b | 2011-01-07 17:49:43 +1100 | [diff] [blame] | 349 | * dget, dget_dlock - get a reference to a dentry |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 350 | * @dentry: dentry to get a reference to |
| 351 | * |
| 352 | * Given a dentry or %NULL pointer increment the reference count |
| 353 | * if appropriate and return the dentry. A dentry will not be |
Nick Piggin | dc0474b | 2011-01-07 17:49:43 +1100 | [diff] [blame] | 354 | * destroyed when it has references. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 355 | */ |
Nick Piggin | b7ab39f | 2011-01-07 17:49:32 +1100 | [diff] [blame] | 356 | static inline struct dentry *dget_dlock(struct dentry *dentry) |
| 357 | { |
Nick Piggin | dc0474b | 2011-01-07 17:49:43 +1100 | [diff] [blame] | 358 | if (dentry) |
Nick Piggin | b7ab39f | 2011-01-07 17:49:32 +1100 | [diff] [blame] | 359 | dentry->d_count++; |
Nick Piggin | b7ab39f | 2011-01-07 17:49:32 +1100 | [diff] [blame] | 360 | return dentry; |
| 361 | } |
Nick Piggin | 2fd6b7f | 2011-01-07 17:49:34 +1100 | [diff] [blame] | 362 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 363 | static inline struct dentry *dget(struct dentry *dentry) |
| 364 | { |
| 365 | if (dentry) { |
Nick Piggin | b7ab39f | 2011-01-07 17:49:32 +1100 | [diff] [blame] | 366 | spin_lock(&dentry->d_lock); |
| 367 | dget_dlock(dentry); |
| 368 | spin_unlock(&dentry->d_lock); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 369 | } |
| 370 | return dentry; |
| 371 | } |
| 372 | |
Nick Piggin | b7ab39f | 2011-01-07 17:49:32 +1100 | [diff] [blame] | 373 | extern struct dentry *dget_parent(struct dentry *dentry); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 374 | |
| 375 | /** |
| 376 | * d_unhashed - is dentry hashed |
| 377 | * @dentry: entry to check |
| 378 | * |
| 379 | * Returns true if the dentry passed is not currently hashed. |
| 380 | */ |
| 381 | |
| 382 | static inline int d_unhashed(struct dentry *dentry) |
| 383 | { |
Linus Torvalds | dea3667 | 2011-04-24 07:58:46 -0700 | [diff] [blame] | 384 | return hlist_bl_unhashed(&dentry->d_hash); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 385 | } |
| 386 | |
Alexey Dobriyan | f3da392 | 2009-05-04 03:32:03 +0400 | [diff] [blame] | 387 | static inline int d_unlinked(struct dentry *dentry) |
| 388 | { |
| 389 | return d_unhashed(dentry) && !IS_ROOT(dentry); |
| 390 | } |
| 391 | |
Al Viro | d83c49f | 2010-04-30 17:17:09 -0400 | [diff] [blame] | 392 | static inline int cant_mount(struct dentry *dentry) |
| 393 | { |
| 394 | return (dentry->d_flags & DCACHE_CANT_MOUNT); |
| 395 | } |
| 396 | |
| 397 | static inline void dont_mount(struct dentry *dentry) |
| 398 | { |
| 399 | spin_lock(&dentry->d_lock); |
| 400 | dentry->d_flags |= DCACHE_CANT_MOUNT; |
| 401 | spin_unlock(&dentry->d_lock); |
| 402 | } |
| 403 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 404 | extern void dput(struct dentry *); |
| 405 | |
David Howells | cc53ce5 | 2011-01-14 18:45:26 +0000 | [diff] [blame] | 406 | static inline bool d_managed(struct dentry *dentry) |
| 407 | { |
| 408 | return dentry->d_flags & DCACHE_MANAGED_DENTRY; |
| 409 | } |
| 410 | |
| 411 | static inline bool d_mountpoint(struct dentry *dentry) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 412 | { |
Nick Piggin | 5f57cbc | 2011-01-07 17:49:54 +1100 | [diff] [blame] | 413 | return dentry->d_flags & DCACHE_MOUNTED; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 414 | } |
| 415 | |
Josef Bacik | 44396f4 | 2011-05-31 11:58:49 -0400 | [diff] [blame] | 416 | static inline bool d_need_lookup(struct dentry *dentry) |
| 417 | { |
| 418 | return dentry->d_flags & DCACHE_NEED_LOOKUP; |
| 419 | } |
| 420 | |
| 421 | extern void d_clear_need_lookup(struct dentry *dentry); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 422 | |
| 423 | extern int sysctl_vfs_cache_pressure; |
| 424 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 425 | #endif /* __LINUX_DCACHE_H */ |