linux/include/linux/dcache.h
<<
>>
Prefs
   1/* SPDX-License-Identifier: GPL-2.0 */
   2#ifndef __LINUX_DCACHE_H
   3#define __LINUX_DCACHE_H
   4
   5#include <linux/atomic.h>
   6#include <linux/list.h>
   7#include <linux/rculist.h>
   8#include <linux/rculist_bl.h>
   9#include <linux/spinlock.h>
  10#include <linux/seqlock.h>
  11#include <linux/cache.h>
  12#include <linux/rcupdate.h>
  13#include <linux/lockref.h>
  14#include <linux/stringhash.h>
  15#include <linux/wait.h>
  16
  17struct path;
  18struct vfsmount;
  19
  20/*
  21 * linux/include/linux/dcache.h
  22 *
  23 * Dirent cache data structures
  24 *
  25 * (C) Copyright 1997 Thomas Schoebel-Theuer,
  26 * with heavy changes by Linus Torvalds
  27 */
  28
  29#define IS_ROOT(x) ((x) == (x)->d_parent)
  30
  31/* The hash is always the low bits of hash_len */
  32#ifdef __LITTLE_ENDIAN
  33 #define HASH_LEN_DECLARE u32 hash; u32 len
  34 #define bytemask_from_count(cnt)       (~(~0ul << (cnt)*8))
  35#else
  36 #define HASH_LEN_DECLARE u32 len; u32 hash
  37 #define bytemask_from_count(cnt)       (~(~0ul >> (cnt)*8))
  38#endif
  39
  40/*
  41 * "quick string" -- eases parameter passing, but more importantly
  42 * saves "metadata" about the string (ie length and the hash).
  43 *
  44 * hash comes first so it snuggles against d_parent in the
  45 * dentry.
  46 */
  47struct qstr {
  48        union {
  49                struct {
  50                        HASH_LEN_DECLARE;
  51                };
  52                u64 hash_len;
  53        };
  54        const unsigned char *name;
  55};
  56
  57#define QSTR_INIT(n,l) { { { .len = l } }, .name = n }
  58
  59extern const char empty_string[];
  60extern const struct qstr empty_name;
  61extern const char slash_string[];
  62extern const struct qstr slash_name;
  63
  64struct dentry_stat_t {
  65        long nr_dentry;
  66        long nr_unused;
  67        long age_limit;          /* age in seconds */
  68        long want_pages;         /* pages requested by system */
  69        long dummy[2];
  70};
  71extern struct dentry_stat_t dentry_stat;
  72
  73/*
  74 * Try to keep struct dentry aligned on 64 byte cachelines (this will
  75 * give reasonable cacheline footprint with larger lines without the
  76 * large memory footprint increase).
  77 */
  78#ifdef CONFIG_64BIT
  79# define DNAME_INLINE_LEN 32 /* 192 bytes */
  80#else
  81# ifdef CONFIG_SMP
  82#  define DNAME_INLINE_LEN 36 /* 128 bytes */
  83# else
  84#  define DNAME_INLINE_LEN 40 /* 128 bytes */
  85# endif
  86#endif
  87
  88#define d_lock  d_lockref.lock
  89
  90struct dentry {
  91        /* RCU lookup touched fields */
  92        unsigned int d_flags;           /* protected by d_lock */
  93        seqcount_t d_seq;               /* per dentry seqlock */
  94        struct hlist_bl_node d_hash;    /* lookup hash list */
  95        struct dentry *d_parent;        /* parent directory */
  96        struct qstr d_name;
  97        struct inode *d_inode;          /* Where the name belongs to - NULL is
  98                                         * negative */
  99        unsigned char d_iname[DNAME_INLINE_LEN];        /* small names */
 100
 101        /* Ref lookup also touches following */
 102        struct lockref d_lockref;       /* per-dentry lock and refcount */
 103        const struct dentry_operations *d_op;
 104        struct super_block *d_sb;       /* The root of the dentry tree */
 105        unsigned long d_time;           /* used by d_revalidate */
 106        void *d_fsdata;                 /* fs-specific data */
 107
 108        union {
 109                struct list_head d_lru;         /* LRU list */
 110                wait_queue_head_t *d_wait;      /* in-lookup ones only */
 111        };
 112        struct list_head d_child;       /* child of parent list */
 113        struct list_head d_subdirs;     /* our children */
 114        /*
 115         * d_alias and d_rcu can share memory
 116         */
 117        union {
 118                struct hlist_node d_alias;      /* inode alias list */
 119                struct hlist_bl_node d_in_lookup_hash;  /* only for in-lookup ones */
 120                struct rcu_head d_rcu;
 121        } d_u;
 122} __randomize_layout;
 123
 124/*
 125 * dentry->d_lock spinlock nesting subclasses:
 126 *
 127 * 0: normal
 128 * 1: nested
 129 */
 130enum dentry_d_lock_class
 131{
 132        DENTRY_D_LOCK_NORMAL, /* implicitly used by plain spin_lock() APIs. */
 133        DENTRY_D_LOCK_NESTED
 134};
 135
 136struct dentry_operations {
 137        int (*d_revalidate)(struct dentry *, unsigned int);
 138        int (*d_weak_revalidate)(struct dentry *, unsigned int);
 139        int (*d_hash)(const struct dentry *, struct qstr *);
 140        int (*d_compare)(const struct dentry *,
 141                        unsigned int, const char *, const struct qstr *);
 142        int (*d_delete)(const struct dentry *);
 143        int (*d_init)(struct dentry *);
 144        void (*d_release)(struct dentry *);
 145        void (*d_prune)(struct dentry *);
 146        void (*d_iput)(struct dentry *, struct inode *);
 147        char *(*d_dname)(struct dentry *, char *, int);
 148        struct vfsmount *(*d_automount)(struct path *);
 149        int (*d_manage)(const struct path *, bool);
 150        struct dentry *(*d_real)(struct dentry *, const struct inode *,
 151                                 unsigned int, unsigned int);
 152} ____cacheline_aligned;
 153
 154/*
 155 * Locking rules for dentry_operations callbacks are to be found in
 156 * Documentation/filesystems/Locking. Keep it updated!
 157 *
 158 * FUrther descriptions are found in Documentation/filesystems/vfs.txt.
 159 * Keep it updated too!
 160 */
 161
 162/* d_flags entries */
 163#define DCACHE_OP_HASH                  0x00000001
 164#define DCACHE_OP_COMPARE               0x00000002
 165#define DCACHE_OP_REVALIDATE            0x00000004
 166#define DCACHE_OP_DELETE                0x00000008
 167#define DCACHE_OP_PRUNE                 0x00000010
 168
 169#define DCACHE_DISCONNECTED             0x00000020
 170     /* This dentry is possibly not currently connected to the dcache tree, in
 171      * which case its parent will either be itself, or will have this flag as
 172      * well.  nfsd will not use a dentry with this bit set, but will first
 173      * endeavour to clear the bit either by discovering that it is connected,
 174      * or by performing lookup operations.   Any filesystem which supports
 175      * nfsd_operations MUST have a lookup function which, if it finds a
 176      * directory inode with a DCACHE_DISCONNECTED dentry, will d_move that
 177      * dentry into place and return that dentry rather than the passed one,
 178      * typically using d_splice_alias. */
 179
 180#define DCACHE_REFERENCED               0x00000040 /* Recently used, don't discard. */
 181#define DCACHE_RCUACCESS                0x00000080 /* Entry has ever been RCU-visible */
 182
 183#define DCACHE_CANT_MOUNT               0x00000100
 184#define DCACHE_GENOCIDE                 0x00000200
 185#define DCACHE_SHRINK_LIST              0x00000400
 186
 187#define DCACHE_OP_WEAK_REVALIDATE       0x00000800
 188
 189#define DCACHE_NFSFS_RENAMED            0x00001000
 190     /* this dentry has been "silly renamed" and has to be deleted on the last
 191      * dput() */
 192#define DCACHE_COOKIE                   0x00002000 /* For use by dcookie subsystem */
 193#define DCACHE_FSNOTIFY_PARENT_WATCHED  0x00004000
 194     /* Parent inode is watched by some fsnotify listener */
 195
 196#define DCACHE_DENTRY_KILLED            0x00008000
 197
 198#define DCACHE_MOUNTED                  0x00010000 /* is a mountpoint */
 199#define DCACHE_NEED_AUTOMOUNT           0x00020000 /* handle automount on this dir */
 200#define DCACHE_MANAGE_TRANSIT           0x00040000 /* manage transit from this dirent */
 201#define DCACHE_MANAGED_DENTRY \
 202        (DCACHE_MOUNTED|DCACHE_NEED_AUTOMOUNT|DCACHE_MANAGE_TRANSIT)
 203
 204#define DCACHE_LRU_LIST                 0x00080000
 205
 206#define DCACHE_ENTRY_TYPE               0x00700000
 207#define DCACHE_MISS_TYPE                0x00000000 /* Negative dentry (maybe fallthru to nowhere) */
 208#define DCACHE_WHITEOUT_TYPE            0x00100000 /* Whiteout dentry (stop pathwalk) */
 209#define DCACHE_DIRECTORY_TYPE           0x00200000 /* Normal directory */
 210#define DCACHE_AUTODIR_TYPE             0x00300000 /* Lookupless directory (presumed automount) */
 211#define DCACHE_REGULAR_TYPE             0x00400000 /* Regular file type (or fallthru to such) */
 212#define DCACHE_SPECIAL_TYPE             0x00500000 /* Other file type (or fallthru to such) */
 213#define DCACHE_SYMLINK_TYPE             0x00600000 /* Symlink (or fallthru to such) */
 214
 215#define DCACHE_MAY_FREE                 0x00800000
 216#define DCACHE_FALLTHRU                 0x01000000 /* Fall through to lower layer */
 217#define DCACHE_ENCRYPTED_WITH_KEY       0x02000000 /* dir is encrypted with a valid key */
 218#define DCACHE_OP_REAL                  0x04000000
 219
 220#define DCACHE_PAR_LOOKUP               0x10000000 /* being looked up (with parent locked shared) */
 221#define DCACHE_DENTRY_CURSOR            0x20000000
 222
 223extern seqlock_t rename_lock;
 224
 225/*
 226 * These are the low-level FS interfaces to the dcache..
 227 */
 228extern void d_instantiate(struct dentry *, struct inode *);
 229extern struct dentry * d_instantiate_unique(struct dentry *, struct inode *);
 230extern int d_instantiate_no_diralias(struct dentry *, struct inode *);
 231extern void __d_drop(struct dentry *dentry);
 232extern void d_drop(struct dentry *dentry);
 233extern void d_delete(struct dentry *);
 234extern void d_set_d_op(struct dentry *dentry, const struct dentry_operations *op);
 235
 236/* allocate/de-allocate */
 237extern struct dentry * d_alloc(struct dentry *, const struct qstr *);
 238extern struct dentry * d_alloc_pseudo(struct super_block *, const struct qstr *);
 239extern struct dentry * d_alloc_parallel(struct dentry *, const struct qstr *,
 240                                        wait_queue_head_t *);
 241extern struct dentry * d_splice_alias(struct inode *, struct dentry *);
 242extern struct dentry * d_add_ci(struct dentry *, struct inode *, struct qstr *);
 243extern struct dentry * d_exact_alias(struct dentry *, struct inode *);
 244extern struct dentry *d_find_any_alias(struct inode *inode);
 245extern struct dentry * d_obtain_alias(struct inode *);
 246extern struct dentry * d_obtain_root(struct inode *);
 247extern void shrink_dcache_sb(struct super_block *);
 248extern void shrink_dcache_parent(struct dentry *);
 249extern void shrink_dcache_for_umount(struct super_block *);
 250extern void d_invalidate(struct dentry *);
 251
 252/* only used at mount-time */
 253extern struct dentry * d_make_root(struct inode *);
 254
 255/* <clickety>-<click> the ramfs-type tree */
 256extern void d_genocide(struct dentry *);
 257
 258extern void d_tmpfile(struct dentry *, struct inode *);
 259
 260extern struct dentry *d_find_alias(struct inode *);
 261extern void d_prune_aliases(struct inode *);
 262
 263/* test whether we have any submounts in a subdir tree */
 264extern int path_has_submounts(const struct path *);
 265
 266/*
 267 * This adds the entry to the hash queues.
 268 */
 269extern void d_rehash(struct dentry *);
 270 
 271extern void d_add(struct dentry *, struct inode *);
 272
 273extern void dentry_update_name_case(struct dentry *, const struct qstr *);
 274
 275/* used for rename() and baskets */
 276extern void d_move(struct dentry *, struct dentry *);
 277extern void d_exchange(struct dentry *, struct dentry *);
 278extern struct dentry *d_ancestor(struct dentry *, struct dentry *);
 279
 280/* appendix may either be NULL or be used for transname suffixes */
 281extern struct dentry *d_lookup(const struct dentry *, const struct qstr *);
 282extern struct dentry *d_hash_and_lookup(struct dentry *, struct qstr *);
 283extern struct dentry *__d_lookup(const struct dentry *, const struct qstr *);
 284extern struct dentry *__d_lookup_rcu(const struct dentry *parent,
 285                                const struct qstr *name, unsigned *seq);
 286
 287static inline unsigned d_count(const struct dentry *dentry)
 288{
 289        return dentry->d_lockref.count;
 290}
 291
 292/*
 293 * helper function for dentry_operations.d_dname() members
 294 */
 295extern __printf(4, 5)
 296char *dynamic_dname(struct dentry *, char *, int, const char *, ...);
 297extern char *simple_dname(struct dentry *, char *, int);
 298
 299extern char *__d_path(const struct path *, const struct path *, char *, int);
 300extern char *d_absolute_path(const struct path *, char *, int);
 301extern char *d_path(const struct path *, char *, int);
 302extern char *dentry_path_raw(struct dentry *, char *, int);
 303extern char *dentry_path(struct dentry *, char *, int);
 304
 305/* Allocation counts.. */
 306
 307/**
 308 *      dget, dget_dlock -      get a reference to a dentry
 309 *      @dentry: dentry to get a reference to
 310 *
 311 *      Given a dentry or %NULL pointer increment the reference count
 312 *      if appropriate and return the dentry. A dentry will not be 
 313 *      destroyed when it has references.
 314 */
 315static inline struct dentry *dget_dlock(struct dentry *dentry)
 316{
 317        if (dentry)
 318                dentry->d_lockref.count++;
 319        return dentry;
 320}
 321
 322static inline struct dentry *dget(struct dentry *dentry)
 323{
 324        if (dentry)
 325                lockref_get(&dentry->d_lockref);
 326        return dentry;
 327}
 328
 329extern struct dentry *dget_parent(struct dentry *dentry);
 330
 331/**
 332 *      d_unhashed -    is dentry hashed
 333 *      @dentry: entry to check
 334 *
 335 *      Returns true if the dentry passed is not currently hashed.
 336 */
 337 
 338static inline int d_unhashed(const struct dentry *dentry)
 339{
 340        return hlist_bl_unhashed(&dentry->d_hash);
 341}
 342
 343static inline int d_unlinked(const struct dentry *dentry)
 344{
 345        return d_unhashed(dentry) && !IS_ROOT(dentry);
 346}
 347
 348static inline int cant_mount(const struct dentry *dentry)
 349{
 350        return (dentry->d_flags & DCACHE_CANT_MOUNT);
 351}
 352
 353static inline void dont_mount(struct dentry *dentry)
 354{
 355        spin_lock(&dentry->d_lock);
 356        dentry->d_flags |= DCACHE_CANT_MOUNT;
 357        spin_unlock(&dentry->d_lock);
 358}
 359
 360extern void __d_lookup_done(struct dentry *);
 361
 362static inline int d_in_lookup(struct dentry *dentry)
 363{
 364        return dentry->d_flags & DCACHE_PAR_LOOKUP;
 365}
 366
 367static inline void d_lookup_done(struct dentry *dentry)
 368{
 369        if (unlikely(d_in_lookup(dentry))) {
 370                spin_lock(&dentry->d_lock);
 371                __d_lookup_done(dentry);
 372                spin_unlock(&dentry->d_lock);
 373        }
 374}
 375
 376extern void dput(struct dentry *);
 377
 378static inline bool d_managed(const struct dentry *dentry)
 379{
 380        return dentry->d_flags & DCACHE_MANAGED_DENTRY;
 381}
 382
 383static inline bool d_mountpoint(const struct dentry *dentry)
 384{
 385        return dentry->d_flags & DCACHE_MOUNTED;
 386}
 387
 388/*
 389 * Directory cache entry type accessor functions.
 390 */
 391static inline unsigned __d_entry_type(const struct dentry *dentry)
 392{
 393        return dentry->d_flags & DCACHE_ENTRY_TYPE;
 394}
 395
 396static inline bool d_is_miss(const struct dentry *dentry)
 397{
 398        return __d_entry_type(dentry) == DCACHE_MISS_TYPE;
 399}
 400
 401static inline bool d_is_whiteout(const struct dentry *dentry)
 402{
 403        return __d_entry_type(dentry) == DCACHE_WHITEOUT_TYPE;
 404}
 405
 406static inline bool d_can_lookup(const struct dentry *dentry)
 407{
 408        return __d_entry_type(dentry) == DCACHE_DIRECTORY_TYPE;
 409}
 410
 411static inline bool d_is_autodir(const struct dentry *dentry)
 412{
 413        return __d_entry_type(dentry) == DCACHE_AUTODIR_TYPE;
 414}
 415
 416static inline bool d_is_dir(const struct dentry *dentry)
 417{
 418        return d_can_lookup(dentry) || d_is_autodir(dentry);
 419}
 420
 421static inline bool d_is_symlink(const struct dentry *dentry)
 422{
 423        return __d_entry_type(dentry) == DCACHE_SYMLINK_TYPE;
 424}
 425
 426static inline bool d_is_reg(const struct dentry *dentry)
 427{
 428        return __d_entry_type(dentry) == DCACHE_REGULAR_TYPE;
 429}
 430
 431static inline bool d_is_special(const struct dentry *dentry)
 432{
 433        return __d_entry_type(dentry) == DCACHE_SPECIAL_TYPE;
 434}
 435
 436static inline bool d_is_file(const struct dentry *dentry)
 437{
 438        return d_is_reg(dentry) || d_is_special(dentry);
 439}
 440
 441static inline bool d_is_negative(const struct dentry *dentry)
 442{
 443        // TODO: check d_is_whiteout(dentry) also.
 444        return d_is_miss(dentry);
 445}
 446
 447static inline bool d_is_positive(const struct dentry *dentry)
 448{
 449        return !d_is_negative(dentry);
 450}
 451
 452/**
 453 * d_really_is_negative - Determine if a dentry is really negative (ignoring fallthroughs)
 454 * @dentry: The dentry in question
 455 *
 456 * Returns true if the dentry represents either an absent name or a name that
 457 * doesn't map to an inode (ie. ->d_inode is NULL).  The dentry could represent
 458 * a true miss, a whiteout that isn't represented by a 0,0 chardev or a
 459 * fallthrough marker in an opaque directory.
 460 *
 461 * Note!  (1) This should be used *only* by a filesystem to examine its own
 462 * dentries.  It should not be used to look at some other filesystem's
 463 * dentries.  (2) It should also be used in combination with d_inode() to get
 464 * the inode.  (3) The dentry may have something attached to ->d_lower and the
 465 * type field of the flags may be set to something other than miss or whiteout.
 466 */
 467static inline bool d_really_is_negative(const struct dentry *dentry)
 468{
 469        return dentry->d_inode == NULL;
 470}
 471
 472/**
 473 * d_really_is_positive - Determine if a dentry is really positive (ignoring fallthroughs)
 474 * @dentry: The dentry in question
 475 *
 476 * Returns true if the dentry represents a name that maps to an inode
 477 * (ie. ->d_inode is not NULL).  The dentry might still represent a whiteout if
 478 * that is represented on medium as a 0,0 chardev.
 479 *
 480 * Note!  (1) This should be used *only* by a filesystem to examine its own
 481 * dentries.  It should not be used to look at some other filesystem's
 482 * dentries.  (2) It should also be used in combination with d_inode() to get
 483 * the inode.
 484 */
 485static inline bool d_really_is_positive(const struct dentry *dentry)
 486{
 487        return dentry->d_inode != NULL;
 488}
 489
 490static inline int simple_positive(struct dentry *dentry)
 491{
 492        return d_really_is_positive(dentry) && !d_unhashed(dentry);
 493}
 494
 495extern void d_set_fallthru(struct dentry *dentry);
 496
 497static inline bool d_is_fallthru(const struct dentry *dentry)
 498{
 499        return dentry->d_flags & DCACHE_FALLTHRU;
 500}
 501
 502
 503extern int sysctl_vfs_cache_pressure;
 504
 505static inline unsigned long vfs_pressure_ratio(unsigned long val)
 506{
 507        return mult_frac(val, sysctl_vfs_cache_pressure, 100);
 508}
 509
 510/**
 511 * d_inode - Get the actual inode of this dentry
 512 * @dentry: The dentry to query
 513 *
 514 * This is the helper normal filesystems should use to get at their own inodes
 515 * in their own dentries and ignore the layering superimposed upon them.
 516 */
 517static inline struct inode *d_inode(const struct dentry *dentry)
 518{
 519        return dentry->d_inode;
 520}
 521
 522/**
 523 * d_inode_rcu - Get the actual inode of this dentry with ACCESS_ONCE()
 524 * @dentry: The dentry to query
 525 *
 526 * This is the helper normal filesystems should use to get at their own inodes
 527 * in their own dentries and ignore the layering superimposed upon them.
 528 */
 529static inline struct inode *d_inode_rcu(const struct dentry *dentry)
 530{
 531        return ACCESS_ONCE(dentry->d_inode);
 532}
 533
 534/**
 535 * d_backing_inode - Get upper or lower inode we should be using
 536 * @upper: The upper layer
 537 *
 538 * This is the helper that should be used to get at the inode that will be used
 539 * if this dentry were to be opened as a file.  The inode may be on the upper
 540 * dentry or it may be on a lower dentry pinned by the upper.
 541 *
 542 * Normal filesystems should not use this to access their own inodes.
 543 */
 544static inline struct inode *d_backing_inode(const struct dentry *upper)
 545{
 546        struct inode *inode = upper->d_inode;
 547
 548        return inode;
 549}
 550
 551/**
 552 * d_backing_dentry - Get upper or lower dentry we should be using
 553 * @upper: The upper layer
 554 *
 555 * This is the helper that should be used to get the dentry of the inode that
 556 * will be used if this dentry were opened as a file.  It may be the upper
 557 * dentry or it may be a lower dentry pinned by the upper.
 558 *
 559 * Normal filesystems should not use this to access their own dentries.
 560 */
 561static inline struct dentry *d_backing_dentry(struct dentry *upper)
 562{
 563        return upper;
 564}
 565
 566/* d_real() flags */
 567#define D_REAL_UPPER    0x2     /* return upper dentry or NULL if non-upper */
 568
 569/**
 570 * d_real - Return the real dentry
 571 * @dentry: the dentry to query
 572 * @inode: inode to select the dentry from multiple layers (can be NULL)
 573 * @open_flags: open flags to control copy-up behavior
 574 * @flags: flags to control what is returned by this function
 575 *
 576 * If dentry is on a union/overlay, then return the underlying, real dentry.
 577 * Otherwise return the dentry itself.
 578 *
 579 * See also: Documentation/filesystems/vfs.txt
 580 */
 581static inline struct dentry *d_real(struct dentry *dentry,
 582                                    const struct inode *inode,
 583                                    unsigned int open_flags, unsigned int flags)
 584{
 585        if (unlikely(dentry->d_flags & DCACHE_OP_REAL))
 586                return dentry->d_op->d_real(dentry, inode, open_flags, flags);
 587        else
 588                return dentry;
 589}
 590
 591/**
 592 * d_real_inode - Return the real inode
 593 * @dentry: The dentry to query
 594 *
 595 * If dentry is on a union/overlay, then return the underlying, real inode.
 596 * Otherwise return d_inode().
 597 */
 598static inline struct inode *d_real_inode(const struct dentry *dentry)
 599{
 600        /* This usage of d_real() results in const dentry */
 601        return d_backing_inode(d_real((struct dentry *) dentry, NULL, 0, 0));
 602}
 603
 604struct name_snapshot {
 605        const unsigned char *name;
 606        unsigned char inline_name[DNAME_INLINE_LEN];
 607};
 608void take_dentry_name_snapshot(struct name_snapshot *, struct dentry *);
 609void release_dentry_name_snapshot(struct name_snapshot *);
 610
 611#endif  /* __LINUX_DCACHE_H */
 612