Commit 6d794237 authored by Roman Gushchin's avatar Roman Gushchin Committed by Greg Kroah-Hartman

dcache: account external names as indirectly reclaimable memory

commit f1782c9b upstream.

I received a report about suspicious growth of unreclaimable slabs on
some machines.  I've found that it happens on machines with low memory
pressure, and these unreclaimable slabs are external names attached to

External names are allocated using generic kmalloc() function, so they
are accounted as unreclaimable.  But they are held by dentries, which
are reclaimable, and they will be reclaimed under the memory pressure.

In particular, this breaks MemAvailable calculation, as it doesn't take
unreclaimable slabs into account.  This leads to a silly situation, when
a machine is almost idle, has no memory pressure and therefore has a big
dentry cache.  And the resulting MemAvailable is too low to start a new

To address the issue, the NR_INDIRECTLY_RECLAIMABLE_BYTES counter is
used to track the amount of memory, consumed by external names.  The
counter is increased in the dentry allocation path, if an external name
structure is allocated; and it's decreased in the dentry freeing path.

To reproduce the problem I've used the following Python script:

  import os

  for iter in range (0, 10000000):
          name = ("/some_long_name_%d" % iter) + "_" * 220
      except Exception:

Without this patch:
  $ cat /proc/meminfo | grep MemAvailable
  MemAvailable:    7811688 kB
  $ python
  $ cat /proc/meminfo | grep MemAvailable
  MemAvailable:    2753052 kB

With the patch:
  $ cat /proc/meminfo | grep MemAvailable
  MemAvailable:    7809516 kB
  $ python
  $ cat /proc/meminfo | grep MemAvailable
  MemAvailable:    7749144 kB

[ fix indirectly reclaimable memory accounting for CONFIG_SLOB]
[ fix indirectly reclaimable memory accounting]
Link: default avatarRoman Gushchin <>
Reviewed-by: default avatarAndrew Morton <>
Cc: Alexander Viro <>
Cc: Michal Hocko <>
Cc: Johannes Weiner <>
Cc: Mel Gorman <>
Signed-off-by: default avatarAndrew Morton <>
Signed-off-by: default avatarLinus Torvalds <>
Signed-off-by: default avatarGreg Kroah-Hartman <>
parent dc09a5b6
......@@ -270,11 +270,25 @@ static void __d_free(struct rcu_head *head)
kmem_cache_free(dentry_cache, dentry);
static void __d_free_external_name(struct rcu_head *head)
struct external_name *name = container_of(head, struct external_name,
static void __d_free_external(struct rcu_head *head)
struct dentry *dentry = container_of(head, struct dentry, d_u.d_rcu);
kmem_cache_free(dentry_cache, dentry);
kmem_cache_free(dentry_cache, dentry);
static inline int dname_external(const struct dentry *dentry)
......@@ -305,7 +319,7 @@ void release_dentry_name_snapshot(struct name_snapshot *name)
struct external_name *p;
p = container_of(name->name, struct external_name, name[0]);
if (unlikely(atomic_dec_and_test(&p->u.count)))
kfree_rcu(p, u.head);
call_rcu(&p->u.head, __d_free_external_name);
......@@ -1605,6 +1619,7 @@ EXPORT_SYMBOL(d_invalidate);
struct dentry *__d_alloc(struct super_block *sb, const struct qstr *name)
struct external_name *ext = NULL;
struct dentry *dentry;
char *dname;
int err;
......@@ -1625,14 +1640,13 @@ struct dentry *__d_alloc(struct super_block *sb, const struct qstr *name)
dname = dentry->d_iname;
} else if (name->len > DNAME_INLINE_LEN-1) {
size_t size = offsetof(struct external_name, name[1]);
struct external_name *p = kmalloc(size + name->len,
if (!p) {
ext = kmalloc(size + name->len, GFP_KERNEL_ACCOUNT);
if (!ext) {
kmem_cache_free(dentry_cache, dentry);
return NULL;
atomic_set(&p->u.count, 1);
dname = p->name;
atomic_set(&ext->u.count, 1);
dname = ext->name;
round_up(name->len + 1, sizeof(unsigned long)));
......@@ -1675,6 +1689,12 @@ struct dentry *__d_alloc(struct super_block *sb, const struct qstr *name)
if (unlikely(ext)) {
pg_data_t *pgdat = page_pgdat(virt_to_page(ext));
mod_node_page_state(pgdat, NR_INDIRECTLY_RECLAIMABLE_BYTES,
return dentry;
......@@ -2769,7 +2789,7 @@ static void copy_name(struct dentry *dentry, struct dentry *target)
dentry->d_name.hash_len = target->d_name.hash_len;
if (old_name && likely(atomic_dec_and_test(&old_name->u.count)))
kfree_rcu(old_name, u.head);
call_rcu(&old_name->u.head, __d_free_external_name);
static void dentry_lock_for_move(struct dentry *dentry, struct dentry *target)
Markdown is supported
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment