1 // SPDX-License-Identifier: GPL-2.0 2 /* 3 * The NFSD open file cache. 4 * 5 * (c) 2015 - Jeff Layton <jeff.layton@primarydata.com> 6 * 7 * An nfsd_file object is a per-file collection of open state that binds 8 * together: 9 * - a struct file * 10 * - a user credential 11 * - a network namespace 12 * - a read-ahead context 13 * - monitoring for writeback errors 14 * 15 * nfsd_file objects are reference-counted. Consumers acquire a new 16 * object via the nfsd_file_acquire API. They manage their interest in 17 * the acquired object, and hence the object's reference count, via 18 * nfsd_file_get and nfsd_file_put. There are two varieties of nfsd_file 19 * object: 20 * 21 * * non-garbage-collected: When a consumer wants to precisely control 22 * the lifetime of a file's open state, it acquires a non-garbage- 23 * collected nfsd_file. The final nfsd_file_put releases the open 24 * state immediately. 25 * 26 * * garbage-collected: When a consumer does not control the lifetime 27 * of open state, it acquires a garbage-collected nfsd_file. The 28 * final nfsd_file_put allows the open state to linger for a period 29 * during which it may be re-used. 30 */ 31 32 #include <linux/hash.h> 33 #include <linux/slab.h> 34 #include <linux/file.h> 35 #include <linux/pagemap.h> 36 #include <linux/sched.h> 37 #include <linux/list_lru.h> 38 #include <linux/fsnotify_backend.h> 39 #include <linux/fsnotify.h> 40 #include <linux/seq_file.h> 41 #include <linux/rhashtable.h> 42 43 #include "vfs.h" 44 #include "nfsd.h" 45 #include "nfsfh.h" 46 #include "netns.h" 47 #include "filecache.h" 48 #include "trace.h" 49 50 #define NFSD_LAUNDRETTE_DELAY (2 * HZ) 51 52 #define NFSD_FILE_CACHE_UP (0) 53 54 /* We only care about NFSD_MAY_READ/WRITE for this cache */ 55 #define NFSD_FILE_MAY_MASK (NFSD_MAY_READ|NFSD_MAY_WRITE|NFSD_MAY_LOCALIO) 56 57 static DEFINE_PER_CPU(unsigned long, nfsd_file_cache_hits); 58 static DEFINE_PER_CPU(unsigned long, nfsd_file_acquisitions); 59 static DEFINE_PER_CPU(unsigned long, nfsd_file_allocations); 60 static DEFINE_PER_CPU(unsigned long, nfsd_file_releases); 61 static DEFINE_PER_CPU(unsigned long, nfsd_file_total_age); 62 static DEFINE_PER_CPU(unsigned long, nfsd_file_evictions); 63 64 struct nfsd_fcache_disposal { 65 spinlock_t lock; 66 struct list_head freeme; 67 }; 68 69 static struct kmem_cache *nfsd_file_slab; 70 static struct kmem_cache *nfsd_file_mark_slab; 71 static struct list_lru nfsd_file_lru; 72 static unsigned long nfsd_file_flags; 73 static struct fsnotify_group *nfsd_file_fsnotify_group; 74 static struct delayed_work nfsd_filecache_laundrette; 75 static struct rhltable nfsd_file_rhltable 76 ____cacheline_aligned_in_smp; 77 78 static bool 79 nfsd_match_cred(const struct cred *c1, const struct cred *c2) 80 { 81 int i; 82 83 if (!uid_eq(c1->fsuid, c2->fsuid)) 84 return false; 85 if (!gid_eq(c1->fsgid, c2->fsgid)) 86 return false; 87 if (c1->group_info == NULL || c2->group_info == NULL) 88 return c1->group_info == c2->group_info; 89 if (c1->group_info->ngroups != c2->group_info->ngroups) 90 return false; 91 for (i = 0; i < c1->group_info->ngroups; i++) { 92 if (!gid_eq(c1->group_info->gid[i], c2->group_info->gid[i])) 93 return false; 94 } 95 return true; 96 } 97 98 static const struct rhashtable_params nfsd_file_rhash_params = { 99 .key_len = sizeof_field(struct nfsd_file, nf_inode), 100 .key_offset = offsetof(struct nfsd_file, nf_inode), 101 .head_offset = offsetof(struct nfsd_file, nf_rlist), 102 103 /* 104 * Start with a single page hash table to reduce resizing churn 105 * on light workloads. 106 */ 107 .min_size = 256, 108 .automatic_shrinking = true, 109 }; 110 111 static void 112 nfsd_file_schedule_laundrette(void) 113 { 114 if (test_bit(NFSD_FILE_CACHE_UP, &nfsd_file_flags)) 115 queue_delayed_work(system_unbound_wq, &nfsd_filecache_laundrette, 116 NFSD_LAUNDRETTE_DELAY); 117 } 118 119 static void 120 nfsd_file_slab_free(struct rcu_head *rcu) 121 { 122 struct nfsd_file *nf = container_of(rcu, struct nfsd_file, nf_rcu); 123 124 put_cred(nf->nf_cred); 125 kmem_cache_free(nfsd_file_slab, nf); 126 } 127 128 static void 129 nfsd_file_mark_free(struct fsnotify_mark *mark) 130 { 131 struct nfsd_file_mark *nfm = container_of(mark, struct nfsd_file_mark, 132 nfm_mark); 133 134 kmem_cache_free(nfsd_file_mark_slab, nfm); 135 } 136 137 static struct nfsd_file_mark * 138 nfsd_file_mark_get(struct nfsd_file_mark *nfm) 139 { 140 if (!refcount_inc_not_zero(&nfm->nfm_ref)) 141 return NULL; 142 return nfm; 143 } 144 145 static void 146 nfsd_file_mark_put(struct nfsd_file_mark *nfm) 147 { 148 if (refcount_dec_and_test(&nfm->nfm_ref)) { 149 fsnotify_destroy_mark(&nfm->nfm_mark, nfsd_file_fsnotify_group); 150 fsnotify_put_mark(&nfm->nfm_mark); 151 } 152 } 153 154 static struct nfsd_file_mark * 155 nfsd_file_mark_find_or_create(struct inode *inode) 156 { 157 int err; 158 struct fsnotify_mark *mark; 159 struct nfsd_file_mark *nfm = NULL, *new; 160 161 do { 162 fsnotify_group_lock(nfsd_file_fsnotify_group); 163 mark = fsnotify_find_inode_mark(inode, 164 nfsd_file_fsnotify_group); 165 if (mark) { 166 nfm = nfsd_file_mark_get(container_of(mark, 167 struct nfsd_file_mark, 168 nfm_mark)); 169 fsnotify_group_unlock(nfsd_file_fsnotify_group); 170 if (nfm) { 171 fsnotify_put_mark(mark); 172 break; 173 } 174 /* Avoid soft lockup race with nfsd_file_mark_put() */ 175 fsnotify_destroy_mark(mark, nfsd_file_fsnotify_group); 176 fsnotify_put_mark(mark); 177 } else { 178 fsnotify_group_unlock(nfsd_file_fsnotify_group); 179 } 180 181 /* allocate a new nfm */ 182 new = kmem_cache_alloc(nfsd_file_mark_slab, GFP_KERNEL); 183 if (!new) 184 return NULL; 185 fsnotify_init_mark(&new->nfm_mark, nfsd_file_fsnotify_group); 186 new->nfm_mark.mask = FS_ATTRIB|FS_DELETE_SELF; 187 refcount_set(&new->nfm_ref, 1); 188 189 err = fsnotify_add_inode_mark(&new->nfm_mark, inode, 0); 190 191 /* 192 * If the add was successful, then return the object. 193 * Otherwise, we need to put the reference we hold on the 194 * nfm_mark. The fsnotify code will take a reference and put 195 * it on failure, so we can't just free it directly. It's also 196 * not safe to call fsnotify_destroy_mark on it as the 197 * mark->group will be NULL. Thus, we can't let the nfm_ref 198 * counter drive the destruction at this point. 199 */ 200 if (likely(!err)) 201 nfm = new; 202 else 203 fsnotify_put_mark(&new->nfm_mark); 204 } while (unlikely(err == -EEXIST)); 205 206 return nfm; 207 } 208 209 static struct nfsd_file * 210 nfsd_file_alloc(struct net *net, struct inode *inode, unsigned char need, 211 bool want_gc) 212 { 213 struct nfsd_file *nf; 214 215 nf = kmem_cache_alloc(nfsd_file_slab, GFP_KERNEL); 216 if (unlikely(!nf)) 217 return NULL; 218 219 this_cpu_inc(nfsd_file_allocations); 220 INIT_LIST_HEAD(&nf->nf_lru); 221 INIT_LIST_HEAD(&nf->nf_gc); 222 nf->nf_birthtime = ktime_get(); 223 nf->nf_file = NULL; 224 nf->nf_cred = get_current_cred(); 225 nf->nf_net = net; 226 nf->nf_flags = want_gc ? 227 BIT(NFSD_FILE_HASHED) | BIT(NFSD_FILE_PENDING) | BIT(NFSD_FILE_GC) : 228 BIT(NFSD_FILE_HASHED) | BIT(NFSD_FILE_PENDING); 229 nf->nf_inode = inode; 230 refcount_set(&nf->nf_ref, 1); 231 nf->nf_may = need; 232 nf->nf_mark = NULL; 233 return nf; 234 } 235 236 /** 237 * nfsd_file_check_write_error - check for writeback errors on a file 238 * @nf: nfsd_file to check for writeback errors 239 * 240 * Check whether a nfsd_file has an unseen error. Reset the write 241 * verifier if so. 242 */ 243 static void 244 nfsd_file_check_write_error(struct nfsd_file *nf) 245 { 246 struct file *file = nf->nf_file; 247 248 if ((file->f_mode & FMODE_WRITE) && 249 filemap_check_wb_err(file->f_mapping, READ_ONCE(file->f_wb_err))) 250 nfsd_reset_write_verifier(net_generic(nf->nf_net, nfsd_net_id)); 251 } 252 253 static void 254 nfsd_file_hash_remove(struct nfsd_file *nf) 255 { 256 trace_nfsd_file_unhash(nf); 257 rhltable_remove(&nfsd_file_rhltable, &nf->nf_rlist, 258 nfsd_file_rhash_params); 259 } 260 261 static bool 262 nfsd_file_unhash(struct nfsd_file *nf) 263 { 264 if (test_and_clear_bit(NFSD_FILE_HASHED, &nf->nf_flags)) { 265 nfsd_file_hash_remove(nf); 266 return true; 267 } 268 return false; 269 } 270 271 static void 272 nfsd_file_free(struct nfsd_file *nf) 273 { 274 s64 age = ktime_to_ms(ktime_sub(ktime_get(), nf->nf_birthtime)); 275 276 trace_nfsd_file_free(nf); 277 278 this_cpu_inc(nfsd_file_releases); 279 this_cpu_add(nfsd_file_total_age, age); 280 281 nfsd_file_unhash(nf); 282 if (nf->nf_mark) 283 nfsd_file_mark_put(nf->nf_mark); 284 if (nf->nf_file) { 285 nfsd_file_check_write_error(nf); 286 nfsd_filp_close(nf->nf_file); 287 } 288 289 /* 290 * If this item is still linked via nf_lru, that's a bug. 291 * WARN and leak it to preserve system stability. 292 */ 293 if (WARN_ON_ONCE(!list_empty(&nf->nf_lru))) 294 return; 295 296 call_rcu(&nf->nf_rcu, nfsd_file_slab_free); 297 } 298 299 static bool 300 nfsd_file_check_writeback(struct nfsd_file *nf) 301 { 302 struct file *file = nf->nf_file; 303 struct address_space *mapping; 304 305 /* File not open for write? */ 306 if (!(file->f_mode & FMODE_WRITE)) 307 return false; 308 309 /* 310 * Some filesystems (e.g. NFS) flush all dirty data on close. 311 * On others, there is no need to wait for writeback. 312 */ 313 if (!(file_inode(file)->i_sb->s_export_op->flags & EXPORT_OP_FLUSH_ON_CLOSE)) 314 return false; 315 316 mapping = file->f_mapping; 317 return mapping_tagged(mapping, PAGECACHE_TAG_DIRTY) || 318 mapping_tagged(mapping, PAGECACHE_TAG_WRITEBACK); 319 } 320 321 322 static bool nfsd_file_lru_add(struct nfsd_file *nf) 323 { 324 set_bit(NFSD_FILE_REFERENCED, &nf->nf_flags); 325 if (list_lru_add_obj(&nfsd_file_lru, &nf->nf_lru)) { 326 trace_nfsd_file_lru_add(nf); 327 return true; 328 } 329 return false; 330 } 331 332 static bool nfsd_file_lru_remove(struct nfsd_file *nf) 333 { 334 if (list_lru_del_obj(&nfsd_file_lru, &nf->nf_lru)) { 335 trace_nfsd_file_lru_del(nf); 336 return true; 337 } 338 return false; 339 } 340 341 struct nfsd_file * 342 nfsd_file_get(struct nfsd_file *nf) 343 { 344 if (nf && refcount_inc_not_zero(&nf->nf_ref)) 345 return nf; 346 return NULL; 347 } 348 349 /** 350 * nfsd_file_put - put the reference to a nfsd_file 351 * @nf: nfsd_file of which to put the reference 352 * 353 * Put a reference to a nfsd_file. In the non-GC case, we just put the 354 * reference immediately. In the GC case, if the reference would be 355 * the last one, the put it on the LRU instead to be cleaned up later. 356 */ 357 void 358 nfsd_file_put(struct nfsd_file *nf) 359 { 360 might_sleep(); 361 trace_nfsd_file_put(nf); 362 363 if (test_bit(NFSD_FILE_GC, &nf->nf_flags) && 364 test_bit(NFSD_FILE_HASHED, &nf->nf_flags)) { 365 /* 366 * If this is the last reference (nf_ref == 1), then try to 367 * transfer it to the LRU. 368 */ 369 if (refcount_dec_not_one(&nf->nf_ref)) 370 return; 371 372 /* Try to add it to the LRU. If that fails, decrement. */ 373 if (nfsd_file_lru_add(nf)) { 374 /* If it's still hashed, we're done */ 375 if (test_bit(NFSD_FILE_HASHED, &nf->nf_flags)) { 376 nfsd_file_schedule_laundrette(); 377 return; 378 } 379 380 /* 381 * We're racing with unhashing, so try to remove it from 382 * the LRU. If removal fails, then someone else already 383 * has our reference. 384 */ 385 if (!nfsd_file_lru_remove(nf)) 386 return; 387 } 388 } 389 if (refcount_dec_and_test(&nf->nf_ref)) 390 nfsd_file_free(nf); 391 } 392 393 /** 394 * nfsd_file_put_local - put the reference to nfsd_file and local nfsd_serv 395 * @nf: nfsd_file of which to put the references 396 * 397 * First put the reference of the nfsd_file and then put the 398 * reference to the associated nn->nfsd_serv. 399 */ 400 void 401 nfsd_file_put_local(struct nfsd_file *nf) 402 { 403 struct net *net = nf->nf_net; 404 405 nfsd_file_put(nf); 406 nfsd_serv_put(net); 407 } 408 409 /** 410 * nfsd_file_file - get the backing file of an nfsd_file 411 * @nf: nfsd_file of which to access the backing file. 412 * 413 * Return backing file for @nf. 414 */ 415 struct file * 416 nfsd_file_file(struct nfsd_file *nf) 417 { 418 return nf->nf_file; 419 } 420 421 static void 422 nfsd_file_dispose_list(struct list_head *dispose) 423 { 424 struct nfsd_file *nf; 425 426 while (!list_empty(dispose)) { 427 nf = list_first_entry(dispose, struct nfsd_file, nf_gc); 428 list_del_init(&nf->nf_gc); 429 nfsd_file_free(nf); 430 } 431 } 432 433 /** 434 * nfsd_file_dispose_list_delayed - move list of dead files to net's freeme list 435 * @dispose: list of nfsd_files to be disposed 436 * 437 * Transfers each file to the "freeme" list for its nfsd_net, to eventually 438 * be disposed of by the per-net garbage collector. 439 */ 440 static void 441 nfsd_file_dispose_list_delayed(struct list_head *dispose) 442 { 443 while(!list_empty(dispose)) { 444 struct nfsd_file *nf = list_first_entry(dispose, 445 struct nfsd_file, nf_gc); 446 struct nfsd_net *nn = net_generic(nf->nf_net, nfsd_net_id); 447 struct nfsd_fcache_disposal *l = nn->fcache_disposal; 448 449 spin_lock(&l->lock); 450 list_move_tail(&nf->nf_gc, &l->freeme); 451 spin_unlock(&l->lock); 452 svc_wake_up(nn->nfsd_serv); 453 } 454 } 455 456 /** 457 * nfsd_file_net_dispose - deal with nfsd_files waiting to be disposed. 458 * @nn: nfsd_net in which to find files to be disposed. 459 * 460 * When files held open for nfsv3 are removed from the filecache, whether 461 * due to memory pressure or garbage collection, they are queued to 462 * a per-net-ns queue. This function completes the disposal, either 463 * directly or by waking another nfsd thread to help with the work. 464 */ 465 void nfsd_file_net_dispose(struct nfsd_net *nn) 466 { 467 struct nfsd_fcache_disposal *l = nn->fcache_disposal; 468 469 if (!list_empty(&l->freeme)) { 470 LIST_HEAD(dispose); 471 int i; 472 473 spin_lock(&l->lock); 474 for (i = 0; i < 8 && !list_empty(&l->freeme); i++) 475 list_move(l->freeme.next, &dispose); 476 spin_unlock(&l->lock); 477 if (!list_empty(&l->freeme)) 478 /* Wake up another thread to share the work 479 * *before* doing any actual disposing. 480 */ 481 svc_wake_up(nn->nfsd_serv); 482 nfsd_file_dispose_list(&dispose); 483 } 484 } 485 486 /** 487 * nfsd_file_lru_cb - Examine an entry on the LRU list 488 * @item: LRU entry to examine 489 * @lru: controlling LRU 490 * @lock: LRU list lock (unused) 491 * @arg: dispose list 492 * 493 * Return values: 494 * %LRU_REMOVED: @item was removed from the LRU 495 * %LRU_ROTATE: @item is to be moved to the LRU tail 496 * %LRU_SKIP: @item cannot be evicted 497 */ 498 static enum lru_status 499 nfsd_file_lru_cb(struct list_head *item, struct list_lru_one *lru, 500 spinlock_t *lock, void *arg) 501 __releases(lock) 502 __acquires(lock) 503 { 504 struct list_head *head = arg; 505 struct nfsd_file *nf = list_entry(item, struct nfsd_file, nf_lru); 506 507 /* We should only be dealing with GC entries here */ 508 WARN_ON_ONCE(!test_bit(NFSD_FILE_GC, &nf->nf_flags)); 509 510 /* 511 * Don't throw out files that are still undergoing I/O or 512 * that have uncleared errors pending. 513 */ 514 if (nfsd_file_check_writeback(nf)) { 515 trace_nfsd_file_gc_writeback(nf); 516 return LRU_SKIP; 517 } 518 519 /* If it was recently added to the list, skip it */ 520 if (test_and_clear_bit(NFSD_FILE_REFERENCED, &nf->nf_flags)) { 521 trace_nfsd_file_gc_referenced(nf); 522 return LRU_ROTATE; 523 } 524 525 /* 526 * Put the reference held on behalf of the LRU. If it wasn't the last 527 * one, then just remove it from the LRU and ignore it. 528 */ 529 if (!refcount_dec_and_test(&nf->nf_ref)) { 530 trace_nfsd_file_gc_in_use(nf); 531 list_lru_isolate(lru, &nf->nf_lru); 532 return LRU_REMOVED; 533 } 534 535 /* Refcount went to zero. Unhash it and queue it to the dispose list */ 536 nfsd_file_unhash(nf); 537 list_lru_isolate(lru, &nf->nf_lru); 538 list_add(&nf->nf_gc, head); 539 this_cpu_inc(nfsd_file_evictions); 540 trace_nfsd_file_gc_disposed(nf); 541 return LRU_REMOVED; 542 } 543 544 static void 545 nfsd_file_gc(void) 546 { 547 LIST_HEAD(dispose); 548 unsigned long ret; 549 550 ret = list_lru_walk(&nfsd_file_lru, nfsd_file_lru_cb, 551 &dispose, list_lru_count(&nfsd_file_lru)); 552 trace_nfsd_file_gc_removed(ret, list_lru_count(&nfsd_file_lru)); 553 nfsd_file_dispose_list_delayed(&dispose); 554 } 555 556 static void 557 nfsd_file_gc_worker(struct work_struct *work) 558 { 559 nfsd_file_gc(); 560 if (list_lru_count(&nfsd_file_lru)) 561 nfsd_file_schedule_laundrette(); 562 } 563 564 static unsigned long 565 nfsd_file_lru_count(struct shrinker *s, struct shrink_control *sc) 566 { 567 return list_lru_count(&nfsd_file_lru); 568 } 569 570 static unsigned long 571 nfsd_file_lru_scan(struct shrinker *s, struct shrink_control *sc) 572 { 573 LIST_HEAD(dispose); 574 unsigned long ret; 575 576 ret = list_lru_shrink_walk(&nfsd_file_lru, sc, 577 nfsd_file_lru_cb, &dispose); 578 trace_nfsd_file_shrinker_removed(ret, list_lru_count(&nfsd_file_lru)); 579 nfsd_file_dispose_list_delayed(&dispose); 580 return ret; 581 } 582 583 static struct shrinker *nfsd_file_shrinker; 584 585 /** 586 * nfsd_file_cond_queue - conditionally unhash and queue a nfsd_file 587 * @nf: nfsd_file to attempt to queue 588 * @dispose: private list to queue successfully-put objects 589 * 590 * Unhash an nfsd_file, try to get a reference to it, and then put that 591 * reference. If it's the last reference, queue it to the dispose list. 592 */ 593 static void 594 nfsd_file_cond_queue(struct nfsd_file *nf, struct list_head *dispose) 595 __must_hold(RCU) 596 { 597 int decrement = 1; 598 599 /* If we raced with someone else unhashing, ignore it */ 600 if (!nfsd_file_unhash(nf)) 601 return; 602 603 /* If we can't get a reference, ignore it */ 604 if (!nfsd_file_get(nf)) 605 return; 606 607 /* Extra decrement if we remove from the LRU */ 608 if (nfsd_file_lru_remove(nf)) 609 ++decrement; 610 611 /* If refcount goes to 0, then put on the dispose list */ 612 if (refcount_sub_and_test(decrement, &nf->nf_ref)) { 613 list_add(&nf->nf_gc, dispose); 614 trace_nfsd_file_closing(nf); 615 } 616 } 617 618 /** 619 * nfsd_file_queue_for_close: try to close out any open nfsd_files for an inode 620 * @inode: inode on which to close out nfsd_files 621 * @dispose: list on which to gather nfsd_files to close out 622 * 623 * An nfsd_file represents a struct file being held open on behalf of nfsd. 624 * An open file however can block other activity (such as leases), or cause 625 * undesirable behavior (e.g. spurious silly-renames when reexporting NFS). 626 * 627 * This function is intended to find open nfsd_files when this sort of 628 * conflicting access occurs and then attempt to close those files out. 629 * 630 * Populates the dispose list with entries that have already had their 631 * refcounts go to zero. The actual free of an nfsd_file can be expensive, 632 * so we leave it up to the caller whether it wants to wait or not. 633 */ 634 static void 635 nfsd_file_queue_for_close(struct inode *inode, struct list_head *dispose) 636 { 637 struct rhlist_head *tmp, *list; 638 struct nfsd_file *nf; 639 640 rcu_read_lock(); 641 list = rhltable_lookup(&nfsd_file_rhltable, &inode, 642 nfsd_file_rhash_params); 643 rhl_for_each_entry_rcu(nf, tmp, list, nf_rlist) { 644 if (!test_bit(NFSD_FILE_GC, &nf->nf_flags)) 645 continue; 646 nfsd_file_cond_queue(nf, dispose); 647 } 648 rcu_read_unlock(); 649 } 650 651 /** 652 * nfsd_file_close_inode - attempt a delayed close of a nfsd_file 653 * @inode: inode of the file to attempt to remove 654 * 655 * Close out any open nfsd_files that can be reaped for @inode. The 656 * actual freeing is deferred to the dispose_list_delayed infrastructure. 657 * 658 * This is used by the fsnotify callbacks and setlease notifier. 659 */ 660 static void 661 nfsd_file_close_inode(struct inode *inode) 662 { 663 LIST_HEAD(dispose); 664 665 nfsd_file_queue_for_close(inode, &dispose); 666 nfsd_file_dispose_list_delayed(&dispose); 667 } 668 669 /** 670 * nfsd_file_close_inode_sync - attempt to forcibly close a nfsd_file 671 * @inode: inode of the file to attempt to remove 672 * 673 * Close out any open nfsd_files that can be reaped for @inode. The 674 * nfsd_files are closed out synchronously. 675 * 676 * This is called from nfsd_rename and nfsd_unlink to avoid silly-renames 677 * when reexporting NFS. 678 */ 679 void 680 nfsd_file_close_inode_sync(struct inode *inode) 681 { 682 struct nfsd_file *nf; 683 LIST_HEAD(dispose); 684 685 trace_nfsd_file_close(inode); 686 687 nfsd_file_queue_for_close(inode, &dispose); 688 while (!list_empty(&dispose)) { 689 nf = list_first_entry(&dispose, struct nfsd_file, nf_gc); 690 list_del_init(&nf->nf_gc); 691 nfsd_file_free(nf); 692 } 693 } 694 695 static int 696 nfsd_file_lease_notifier_call(struct notifier_block *nb, unsigned long arg, 697 void *data) 698 { 699 struct file_lease *fl = data; 700 701 /* Only close files for F_SETLEASE leases */ 702 if (fl->c.flc_flags & FL_LEASE) 703 nfsd_file_close_inode(file_inode(fl->c.flc_file)); 704 return 0; 705 } 706 707 static struct notifier_block nfsd_file_lease_notifier = { 708 .notifier_call = nfsd_file_lease_notifier_call, 709 }; 710 711 static int 712 nfsd_file_fsnotify_handle_event(struct fsnotify_mark *mark, u32 mask, 713 struct inode *inode, struct inode *dir, 714 const struct qstr *name, u32 cookie) 715 { 716 if (WARN_ON_ONCE(!inode)) 717 return 0; 718 719 trace_nfsd_file_fsnotify_handle_event(inode, mask); 720 721 /* Should be no marks on non-regular files */ 722 if (!S_ISREG(inode->i_mode)) { 723 WARN_ON_ONCE(1); 724 return 0; 725 } 726 727 /* don't close files if this was not the last link */ 728 if (mask & FS_ATTRIB) { 729 if (inode->i_nlink) 730 return 0; 731 } 732 733 nfsd_file_close_inode(inode); 734 return 0; 735 } 736 737 738 static const struct fsnotify_ops nfsd_file_fsnotify_ops = { 739 .handle_inode_event = nfsd_file_fsnotify_handle_event, 740 .free_mark = nfsd_file_mark_free, 741 }; 742 743 int 744 nfsd_file_cache_init(void) 745 { 746 int ret; 747 748 lockdep_assert_held(&nfsd_mutex); 749 if (test_and_set_bit(NFSD_FILE_CACHE_UP, &nfsd_file_flags) == 1) 750 return 0; 751 752 ret = rhltable_init(&nfsd_file_rhltable, &nfsd_file_rhash_params); 753 if (ret) 754 return ret; 755 756 ret = -ENOMEM; 757 nfsd_file_slab = KMEM_CACHE(nfsd_file, 0); 758 if (!nfsd_file_slab) { 759 pr_err("nfsd: unable to create nfsd_file_slab\n"); 760 goto out_err; 761 } 762 763 nfsd_file_mark_slab = KMEM_CACHE(nfsd_file_mark, 0); 764 if (!nfsd_file_mark_slab) { 765 pr_err("nfsd: unable to create nfsd_file_mark_slab\n"); 766 goto out_err; 767 } 768 769 ret = list_lru_init(&nfsd_file_lru); 770 if (ret) { 771 pr_err("nfsd: failed to init nfsd_file_lru: %d\n", ret); 772 goto out_err; 773 } 774 775 nfsd_file_shrinker = shrinker_alloc(0, "nfsd-filecache"); 776 if (!nfsd_file_shrinker) { 777 ret = -ENOMEM; 778 pr_err("nfsd: failed to allocate nfsd_file_shrinker\n"); 779 goto out_lru; 780 } 781 782 nfsd_file_shrinker->count_objects = nfsd_file_lru_count; 783 nfsd_file_shrinker->scan_objects = nfsd_file_lru_scan; 784 nfsd_file_shrinker->seeks = 1; 785 786 shrinker_register(nfsd_file_shrinker); 787 788 ret = lease_register_notifier(&nfsd_file_lease_notifier); 789 if (ret) { 790 pr_err("nfsd: unable to register lease notifier: %d\n", ret); 791 goto out_shrinker; 792 } 793 794 nfsd_file_fsnotify_group = fsnotify_alloc_group(&nfsd_file_fsnotify_ops, 795 FSNOTIFY_GROUP_NOFS); 796 if (IS_ERR(nfsd_file_fsnotify_group)) { 797 pr_err("nfsd: unable to create fsnotify group: %ld\n", 798 PTR_ERR(nfsd_file_fsnotify_group)); 799 ret = PTR_ERR(nfsd_file_fsnotify_group); 800 nfsd_file_fsnotify_group = NULL; 801 goto out_notifier; 802 } 803 804 INIT_DELAYED_WORK(&nfsd_filecache_laundrette, nfsd_file_gc_worker); 805 out: 806 return ret; 807 out_notifier: 808 lease_unregister_notifier(&nfsd_file_lease_notifier); 809 out_shrinker: 810 shrinker_free(nfsd_file_shrinker); 811 out_lru: 812 list_lru_destroy(&nfsd_file_lru); 813 out_err: 814 kmem_cache_destroy(nfsd_file_slab); 815 nfsd_file_slab = NULL; 816 kmem_cache_destroy(nfsd_file_mark_slab); 817 nfsd_file_mark_slab = NULL; 818 rhltable_destroy(&nfsd_file_rhltable); 819 goto out; 820 } 821 822 /** 823 * __nfsd_file_cache_purge: clean out the cache for shutdown 824 * @net: net-namespace to shut down the cache (may be NULL) 825 * 826 * Walk the nfsd_file cache and close out any that match @net. If @net is NULL, 827 * then close out everything. Called when an nfsd instance is being shut down, 828 * and when the exports table is flushed. 829 */ 830 static void 831 __nfsd_file_cache_purge(struct net *net) 832 { 833 struct rhashtable_iter iter; 834 struct nfsd_file *nf; 835 LIST_HEAD(dispose); 836 837 rhltable_walk_enter(&nfsd_file_rhltable, &iter); 838 do { 839 rhashtable_walk_start(&iter); 840 841 nf = rhashtable_walk_next(&iter); 842 while (!IS_ERR_OR_NULL(nf)) { 843 if (!net || nf->nf_net == net) 844 nfsd_file_cond_queue(nf, &dispose); 845 nf = rhashtable_walk_next(&iter); 846 } 847 848 rhashtable_walk_stop(&iter); 849 } while (nf == ERR_PTR(-EAGAIN)); 850 rhashtable_walk_exit(&iter); 851 852 nfsd_file_dispose_list(&dispose); 853 } 854 855 static struct nfsd_fcache_disposal * 856 nfsd_alloc_fcache_disposal(void) 857 { 858 struct nfsd_fcache_disposal *l; 859 860 l = kmalloc(sizeof(*l), GFP_KERNEL); 861 if (!l) 862 return NULL; 863 spin_lock_init(&l->lock); 864 INIT_LIST_HEAD(&l->freeme); 865 return l; 866 } 867 868 static void 869 nfsd_free_fcache_disposal(struct nfsd_fcache_disposal *l) 870 { 871 nfsd_file_dispose_list(&l->freeme); 872 kfree(l); 873 } 874 875 static void 876 nfsd_free_fcache_disposal_net(struct net *net) 877 { 878 struct nfsd_net *nn = net_generic(net, nfsd_net_id); 879 struct nfsd_fcache_disposal *l = nn->fcache_disposal; 880 881 nfsd_free_fcache_disposal(l); 882 } 883 884 int 885 nfsd_file_cache_start_net(struct net *net) 886 { 887 struct nfsd_net *nn = net_generic(net, nfsd_net_id); 888 889 nn->fcache_disposal = nfsd_alloc_fcache_disposal(); 890 return nn->fcache_disposal ? 0 : -ENOMEM; 891 } 892 893 /** 894 * nfsd_file_cache_purge - Remove all cache items associated with @net 895 * @net: target net namespace 896 * 897 */ 898 void 899 nfsd_file_cache_purge(struct net *net) 900 { 901 lockdep_assert_held(&nfsd_mutex); 902 if (test_bit(NFSD_FILE_CACHE_UP, &nfsd_file_flags) == 1) 903 __nfsd_file_cache_purge(net); 904 } 905 906 void 907 nfsd_file_cache_shutdown_net(struct net *net) 908 { 909 nfsd_file_cache_purge(net); 910 nfsd_free_fcache_disposal_net(net); 911 } 912 913 void 914 nfsd_file_cache_shutdown(void) 915 { 916 int i; 917 918 lockdep_assert_held(&nfsd_mutex); 919 if (test_and_clear_bit(NFSD_FILE_CACHE_UP, &nfsd_file_flags) == 0) 920 return; 921 922 lease_unregister_notifier(&nfsd_file_lease_notifier); 923 shrinker_free(nfsd_file_shrinker); 924 /* 925 * make sure all callers of nfsd_file_lru_cb are done before 926 * calling nfsd_file_cache_purge 927 */ 928 cancel_delayed_work_sync(&nfsd_filecache_laundrette); 929 __nfsd_file_cache_purge(NULL); 930 list_lru_destroy(&nfsd_file_lru); 931 rcu_barrier(); 932 fsnotify_put_group(nfsd_file_fsnotify_group); 933 nfsd_file_fsnotify_group = NULL; 934 kmem_cache_destroy(nfsd_file_slab); 935 nfsd_file_slab = NULL; 936 fsnotify_wait_marks_destroyed(); 937 kmem_cache_destroy(nfsd_file_mark_slab); 938 nfsd_file_mark_slab = NULL; 939 rhltable_destroy(&nfsd_file_rhltable); 940 941 for_each_possible_cpu(i) { 942 per_cpu(nfsd_file_cache_hits, i) = 0; 943 per_cpu(nfsd_file_acquisitions, i) = 0; 944 per_cpu(nfsd_file_allocations, i) = 0; 945 per_cpu(nfsd_file_releases, i) = 0; 946 per_cpu(nfsd_file_total_age, i) = 0; 947 per_cpu(nfsd_file_evictions, i) = 0; 948 } 949 } 950 951 static struct nfsd_file * 952 nfsd_file_lookup_locked(const struct net *net, const struct cred *cred, 953 struct inode *inode, unsigned char need, 954 bool want_gc) 955 { 956 struct rhlist_head *tmp, *list; 957 struct nfsd_file *nf; 958 959 list = rhltable_lookup(&nfsd_file_rhltable, &inode, 960 nfsd_file_rhash_params); 961 rhl_for_each_entry_rcu(nf, tmp, list, nf_rlist) { 962 if (nf->nf_may != need) 963 continue; 964 if (nf->nf_net != net) 965 continue; 966 if (!nfsd_match_cred(nf->nf_cred, cred)) 967 continue; 968 if (test_bit(NFSD_FILE_GC, &nf->nf_flags) != want_gc) 969 continue; 970 if (test_bit(NFSD_FILE_HASHED, &nf->nf_flags) == 0) 971 continue; 972 973 if (!nfsd_file_get(nf)) 974 continue; 975 return nf; 976 } 977 return NULL; 978 } 979 980 /** 981 * nfsd_file_is_cached - are there any cached open files for this inode? 982 * @inode: inode to check 983 * 984 * The lookup matches inodes in all net namespaces and is atomic wrt 985 * nfsd_file_acquire(). 986 * 987 * Return values: 988 * %true: filecache contains at least one file matching this inode 989 * %false: filecache contains no files matching this inode 990 */ 991 bool 992 nfsd_file_is_cached(struct inode *inode) 993 { 994 struct rhlist_head *tmp, *list; 995 struct nfsd_file *nf; 996 bool ret = false; 997 998 rcu_read_lock(); 999 list = rhltable_lookup(&nfsd_file_rhltable, &inode, 1000 nfsd_file_rhash_params); 1001 rhl_for_each_entry_rcu(nf, tmp, list, nf_rlist) 1002 if (test_bit(NFSD_FILE_GC, &nf->nf_flags)) { 1003 ret = true; 1004 break; 1005 } 1006 rcu_read_unlock(); 1007 1008 trace_nfsd_file_is_cached(inode, (int)ret); 1009 return ret; 1010 } 1011 1012 static __be32 1013 nfsd_file_do_acquire(struct svc_rqst *rqstp, struct net *net, 1014 struct svc_cred *cred, 1015 struct auth_domain *client, 1016 struct svc_fh *fhp, 1017 unsigned int may_flags, struct file *file, 1018 struct nfsd_file **pnf, bool want_gc) 1019 { 1020 unsigned char need = may_flags & NFSD_FILE_MAY_MASK; 1021 struct nfsd_file *new, *nf; 1022 bool stale_retry = true; 1023 bool open_retry = true; 1024 struct inode *inode; 1025 __be32 status; 1026 int ret; 1027 1028 retry: 1029 if (rqstp) { 1030 status = fh_verify(rqstp, fhp, S_IFREG, 1031 may_flags|NFSD_MAY_OWNER_OVERRIDE); 1032 } else { 1033 status = fh_verify_local(net, cred, client, fhp, S_IFREG, 1034 may_flags|NFSD_MAY_OWNER_OVERRIDE); 1035 } 1036 if (status != nfs_ok) 1037 return status; 1038 inode = d_inode(fhp->fh_dentry); 1039 1040 rcu_read_lock(); 1041 nf = nfsd_file_lookup_locked(net, current_cred(), inode, need, want_gc); 1042 rcu_read_unlock(); 1043 1044 if (nf) { 1045 /* 1046 * If the nf is on the LRU then it holds an extra reference 1047 * that must be put if it's removed. It had better not be 1048 * the last one however, since we should hold another. 1049 */ 1050 if (nfsd_file_lru_remove(nf)) 1051 WARN_ON_ONCE(refcount_dec_and_test(&nf->nf_ref)); 1052 goto wait_for_construction; 1053 } 1054 1055 new = nfsd_file_alloc(net, inode, need, want_gc); 1056 if (!new) { 1057 status = nfserr_jukebox; 1058 goto out; 1059 } 1060 1061 rcu_read_lock(); 1062 spin_lock(&inode->i_lock); 1063 nf = nfsd_file_lookup_locked(net, current_cred(), inode, need, want_gc); 1064 if (unlikely(nf)) { 1065 spin_unlock(&inode->i_lock); 1066 rcu_read_unlock(); 1067 nfsd_file_free(new); 1068 goto wait_for_construction; 1069 } 1070 nf = new; 1071 ret = rhltable_insert(&nfsd_file_rhltable, &nf->nf_rlist, 1072 nfsd_file_rhash_params); 1073 spin_unlock(&inode->i_lock); 1074 rcu_read_unlock(); 1075 if (likely(ret == 0)) 1076 goto open_file; 1077 1078 trace_nfsd_file_insert_err(rqstp, inode, may_flags, ret); 1079 status = nfserr_jukebox; 1080 goto construction_err; 1081 1082 wait_for_construction: 1083 wait_on_bit(&nf->nf_flags, NFSD_FILE_PENDING, TASK_UNINTERRUPTIBLE); 1084 1085 /* Did construction of this file fail? */ 1086 if (!test_bit(NFSD_FILE_HASHED, &nf->nf_flags)) { 1087 trace_nfsd_file_cons_err(rqstp, inode, may_flags, nf); 1088 if (!open_retry) { 1089 status = nfserr_jukebox; 1090 goto construction_err; 1091 } 1092 nfsd_file_put(nf); 1093 open_retry = false; 1094 fh_put(fhp); 1095 goto retry; 1096 } 1097 this_cpu_inc(nfsd_file_cache_hits); 1098 1099 status = nfserrno(nfsd_open_break_lease(file_inode(nf->nf_file), may_flags)); 1100 if (status != nfs_ok) { 1101 nfsd_file_put(nf); 1102 nf = NULL; 1103 } 1104 1105 out: 1106 if (status == nfs_ok) { 1107 this_cpu_inc(nfsd_file_acquisitions); 1108 nfsd_file_check_write_error(nf); 1109 *pnf = nf; 1110 } 1111 trace_nfsd_file_acquire(rqstp, inode, may_flags, nf, status); 1112 return status; 1113 1114 open_file: 1115 trace_nfsd_file_alloc(nf); 1116 nf->nf_mark = nfsd_file_mark_find_or_create(inode); 1117 if (nf->nf_mark) { 1118 if (file) { 1119 get_file(file); 1120 nf->nf_file = file; 1121 status = nfs_ok; 1122 trace_nfsd_file_opened(nf, status); 1123 } else { 1124 ret = nfsd_open_verified(rqstp, fhp, may_flags, 1125 &nf->nf_file); 1126 if (ret == -EOPENSTALE && stale_retry) { 1127 stale_retry = false; 1128 nfsd_file_unhash(nf); 1129 clear_and_wake_up_bit(NFSD_FILE_PENDING, 1130 &nf->nf_flags); 1131 if (refcount_dec_and_test(&nf->nf_ref)) 1132 nfsd_file_free(nf); 1133 nf = NULL; 1134 fh_put(fhp); 1135 goto retry; 1136 } 1137 status = nfserrno(ret); 1138 trace_nfsd_file_open(nf, status); 1139 } 1140 } else 1141 status = nfserr_jukebox; 1142 /* 1143 * If construction failed, or we raced with a call to unlink() 1144 * then unhash. 1145 */ 1146 if (status != nfs_ok || inode->i_nlink == 0) 1147 nfsd_file_unhash(nf); 1148 clear_and_wake_up_bit(NFSD_FILE_PENDING, &nf->nf_flags); 1149 if (status == nfs_ok) 1150 goto out; 1151 1152 construction_err: 1153 if (refcount_dec_and_test(&nf->nf_ref)) 1154 nfsd_file_free(nf); 1155 nf = NULL; 1156 goto out; 1157 } 1158 1159 /** 1160 * nfsd_file_acquire_gc - Get a struct nfsd_file with an open file 1161 * @rqstp: the RPC transaction being executed 1162 * @fhp: the NFS filehandle of the file to be opened 1163 * @may_flags: NFSD_MAY_ settings for the file 1164 * @pnf: OUT: new or found "struct nfsd_file" object 1165 * 1166 * The nfsd_file object returned by this API is reference-counted 1167 * and garbage-collected. The object is retained for a few 1168 * seconds after the final nfsd_file_put() in case the caller 1169 * wants to re-use it. 1170 * 1171 * Return values: 1172 * %nfs_ok - @pnf points to an nfsd_file with its reference 1173 * count boosted. 1174 * 1175 * On error, an nfsstat value in network byte order is returned. 1176 */ 1177 __be32 1178 nfsd_file_acquire_gc(struct svc_rqst *rqstp, struct svc_fh *fhp, 1179 unsigned int may_flags, struct nfsd_file **pnf) 1180 { 1181 return nfsd_file_do_acquire(rqstp, SVC_NET(rqstp), NULL, NULL, 1182 fhp, may_flags, NULL, pnf, true); 1183 } 1184 1185 /** 1186 * nfsd_file_acquire - Get a struct nfsd_file with an open file 1187 * @rqstp: the RPC transaction being executed 1188 * @fhp: the NFS filehandle of the file to be opened 1189 * @may_flags: NFSD_MAY_ settings for the file 1190 * @pnf: OUT: new or found "struct nfsd_file" object 1191 * 1192 * The nfsd_file_object returned by this API is reference-counted 1193 * but not garbage-collected. The object is unhashed after the 1194 * final nfsd_file_put(). 1195 * 1196 * Return values: 1197 * %nfs_ok - @pnf points to an nfsd_file with its reference 1198 * count boosted. 1199 * 1200 * On error, an nfsstat value in network byte order is returned. 1201 */ 1202 __be32 1203 nfsd_file_acquire(struct svc_rqst *rqstp, struct svc_fh *fhp, 1204 unsigned int may_flags, struct nfsd_file **pnf) 1205 { 1206 return nfsd_file_do_acquire(rqstp, SVC_NET(rqstp), NULL, NULL, 1207 fhp, may_flags, NULL, pnf, false); 1208 } 1209 1210 /** 1211 * nfsd_file_acquire_local - Get a struct nfsd_file with an open file for localio 1212 * @net: The network namespace in which to perform a lookup 1213 * @cred: the user credential with which to validate access 1214 * @client: the auth_domain for LOCALIO lookup 1215 * @fhp: the NFS filehandle of the file to be opened 1216 * @may_flags: NFSD_MAY_ settings for the file 1217 * @pnf: OUT: new or found "struct nfsd_file" object 1218 * 1219 * This file lookup interface provide access to a file given the 1220 * filehandle and credential. No connection-based authorisation 1221 * is performed and in that way it is quite different to other 1222 * file access mediated by nfsd. It allows a kernel module such as the NFS 1223 * client to reach across network and filesystem namespaces to access 1224 * a file. The security implications of this should be carefully 1225 * considered before use. 1226 * 1227 * The nfsd_file object returned by this API is reference-counted 1228 * and garbage-collected. The object is retained for a few 1229 * seconds after the final nfsd_file_put() in case the caller 1230 * wants to re-use it. 1231 * 1232 * Return values: 1233 * %nfs_ok - @pnf points to an nfsd_file with its reference 1234 * count boosted. 1235 * 1236 * On error, an nfsstat value in network byte order is returned. 1237 */ 1238 __be32 1239 nfsd_file_acquire_local(struct net *net, struct svc_cred *cred, 1240 struct auth_domain *client, struct svc_fh *fhp, 1241 unsigned int may_flags, struct nfsd_file **pnf) 1242 { 1243 /* 1244 * Save creds before calling nfsd_file_do_acquire() (which calls 1245 * nfsd_setuser). Important because caller (LOCALIO) is from 1246 * client context. 1247 */ 1248 const struct cred *save_cred = get_current_cred(); 1249 __be32 beres; 1250 1251 beres = nfsd_file_do_acquire(NULL, net, cred, client, 1252 fhp, may_flags, NULL, pnf, true); 1253 revert_creds(save_cred); 1254 return beres; 1255 } 1256 1257 /** 1258 * nfsd_file_acquire_opened - Get a struct nfsd_file using existing open file 1259 * @rqstp: the RPC transaction being executed 1260 * @fhp: the NFS filehandle of the file just created 1261 * @may_flags: NFSD_MAY_ settings for the file 1262 * @file: cached, already-open file (may be NULL) 1263 * @pnf: OUT: new or found "struct nfsd_file" object 1264 * 1265 * Acquire a nfsd_file object that is not GC'ed. If one doesn't already exist, 1266 * and @file is non-NULL, use it to instantiate a new nfsd_file instead of 1267 * opening a new one. 1268 * 1269 * Return values: 1270 * %nfs_ok - @pnf points to an nfsd_file with its reference 1271 * count boosted. 1272 * 1273 * On error, an nfsstat value in network byte order is returned. 1274 */ 1275 __be32 1276 nfsd_file_acquire_opened(struct svc_rqst *rqstp, struct svc_fh *fhp, 1277 unsigned int may_flags, struct file *file, 1278 struct nfsd_file **pnf) 1279 { 1280 return nfsd_file_do_acquire(rqstp, SVC_NET(rqstp), NULL, NULL, 1281 fhp, may_flags, file, pnf, false); 1282 } 1283 1284 /* 1285 * Note that fields may be added, removed or reordered in the future. Programs 1286 * scraping this file for info should test the labels to ensure they're 1287 * getting the correct field. 1288 */ 1289 int nfsd_file_cache_stats_show(struct seq_file *m, void *v) 1290 { 1291 unsigned long allocations = 0, releases = 0, evictions = 0; 1292 unsigned long hits = 0, acquisitions = 0; 1293 unsigned int i, count = 0, buckets = 0; 1294 unsigned long lru = 0, total_age = 0; 1295 1296 /* Serialize with server shutdown */ 1297 mutex_lock(&nfsd_mutex); 1298 if (test_bit(NFSD_FILE_CACHE_UP, &nfsd_file_flags) == 1) { 1299 struct bucket_table *tbl; 1300 struct rhashtable *ht; 1301 1302 lru = list_lru_count(&nfsd_file_lru); 1303 1304 rcu_read_lock(); 1305 ht = &nfsd_file_rhltable.ht; 1306 count = atomic_read(&ht->nelems); 1307 tbl = rht_dereference_rcu(ht->tbl, ht); 1308 buckets = tbl->size; 1309 rcu_read_unlock(); 1310 } 1311 mutex_unlock(&nfsd_mutex); 1312 1313 for_each_possible_cpu(i) { 1314 hits += per_cpu(nfsd_file_cache_hits, i); 1315 acquisitions += per_cpu(nfsd_file_acquisitions, i); 1316 allocations += per_cpu(nfsd_file_allocations, i); 1317 releases += per_cpu(nfsd_file_releases, i); 1318 total_age += per_cpu(nfsd_file_total_age, i); 1319 evictions += per_cpu(nfsd_file_evictions, i); 1320 } 1321 1322 seq_printf(m, "total inodes: %u\n", count); 1323 seq_printf(m, "hash buckets: %u\n", buckets); 1324 seq_printf(m, "lru entries: %lu\n", lru); 1325 seq_printf(m, "cache hits: %lu\n", hits); 1326 seq_printf(m, "acquisitions: %lu\n", acquisitions); 1327 seq_printf(m, "allocations: %lu\n", allocations); 1328 seq_printf(m, "releases: %lu\n", releases); 1329 seq_printf(m, "evictions: %lu\n", evictions); 1330 if (releases) 1331 seq_printf(m, "mean age (ms): %ld\n", total_age / releases); 1332 else 1333 seq_printf(m, "mean age (ms): -\n"); 1334 return 0; 1335 } 1336