static DEFINE_PER_CPU(unsigned long, nfsd_file_cache_hits);
 static DEFINE_PER_CPU(unsigned long, nfsd_file_acquisitions);
 static DEFINE_PER_CPU(unsigned long, nfsd_file_releases);
+static DEFINE_PER_CPU(unsigned long, nfsd_file_total_age);
 
 struct nfsd_fcache_disposal {
        struct work_struct work;
        if (nf) {
                INIT_HLIST_NODE(&nf->nf_node);
                INIT_LIST_HEAD(&nf->nf_lru);
+               nf->nf_birthtime = ktime_get();
                nf->nf_file = NULL;
                nf->nf_cred = get_current_cred();
                nf->nf_net = net;
 static bool
 nfsd_file_free(struct nfsd_file *nf)
 {
+       s64 age = ktime_to_ms(ktime_sub(ktime_get(), nf->nf_birthtime));
        bool flush = false;
 
        this_cpu_inc(nfsd_file_releases);
+       this_cpu_add(nfsd_file_total_age, age);
 
        trace_nfsd_file_put_final(nf);
        if (nf->nf_mark)
 {
        unsigned long hits = 0, acquisitions = 0, releases = 0;
        unsigned int i, count = 0, longest = 0;
-       unsigned long lru = 0;
+       unsigned long lru = 0, total_age = 0;
 
        /*
         * No need for spinlocks here since we're not terribly interested in
                hits += per_cpu(nfsd_file_cache_hits, i);
                acquisitions += per_cpu(nfsd_file_acquisitions, i);
                releases += per_cpu(nfsd_file_releases, i);
+               total_age += per_cpu(nfsd_file_total_age, i);
        }
 
        seq_printf(m, "total entries: %u\n", count);
        seq_printf(m, "cache hits:    %lu\n", hits);
        seq_printf(m, "acquisitions:  %lu\n", acquisitions);
        seq_printf(m, "releases:      %lu\n", releases);
+       if (releases)
+               seq_printf(m, "mean age (ms): %ld\n", total_age / releases);
+       else
+               seq_printf(m, "mean age (ms): -\n");
        return 0;
 }