Searched refs:lists (Results 1 – 5 of 5) sorted by relevance
| /fs/xfs/ |
| A D | xfs_mru_cache.c | 271 ASSERT(mru && mru->lists); in _xfs_mru_cache_reap()
272 if (!mru || !mru->lists) in _xfs_mru_cache_reap()
341 mru->lists = kzalloc(mru->grp_count * sizeof(*mru->lists), in xfs_mru_cache_create()
343 if (!mru->lists) { in xfs_mru_cache_create()
377 if (!mru || !mru->lists) in xfs_mru_cache_flush()
397 if (!mru || !mru->lists) in xfs_mru_cache_destroy()
402 kfree(mru->lists); in xfs_mru_cache_destroy()
457 ASSERT(mru && mru->lists); in xfs_mru_cache_remove()
458 if (!mru || !mru->lists) in xfs_mru_cache_remove()
513 ASSERT(mru && mru->lists); in xfs_mru_cache_lookup()
[all …]
|
| /fs/bcachefs/ |
| A D | rcu_pending.c | 124 static_array_for_each(p->lists, i) in __rcu_pending_has_pending()
174 for (struct rcu_pending_list *i = p->lists; i < expired; i++) in merge_expired_lists()
288 (p->lists[0].head && __poll_state_synchronize_rcu(pending->srcu, p->lists[0].seq)) || in process_finished_items()
289 (p->lists[1].head && __poll_state_synchronize_rcu(pending->srcu, p->lists[1].seq)) || in process_finished_items()
290 p->lists[2].head) { in process_finished_items()
376 for (struct rcu_pending_list *i = p->lists; in rcu_pending_enqueue_list()
377 i < p->lists + NUM_ACTIVE_RCU_POLL_OLDSTATE; i++) { in rcu_pending_enqueue_list()
384 for (struct rcu_pending_list *i = p->lists; in rcu_pending_enqueue_list()
385 i < p->lists + NUM_ACTIVE_RCU_POLL_OLDSTATE; i++) { in rcu_pending_enqueue_list()
548 static_array_for_each(p->lists, i) in rcu_pending_pcpu_dequeue()
[all …]
|
| /fs/ocfs2/ |
| A D | Kconfig | 23 OCFS2 mailing lists: https://subspace.kernel.org/lists.linux.dev.html
|
| /fs/jffs2/ |
| A D | README.Locking | 74 This is used to serialise access to the eraseblock lists, to the
75 per-eraseblock lists of physical jffs2_raw_node_ref structures, and
|
| /fs/nilfs2/ |
| A D | btree.c | 2132 struct list_head *lists, in nilfs_btree_add_dirty_buffer() argument
2156 list_for_each(head, &lists[level]) { in nilfs_btree_add_dirty_buffer()
2171 struct list_head lists[NILFS_BTREE_LEVEL_MAX]; in nilfs_btree_lookup_dirty_buffers() local
2180 INIT_LIST_HEAD(&lists[level]); in nilfs_btree_lookup_dirty_buffers()
2191 lists, bh); in nilfs_btree_lookup_dirty_buffers()
2201 list_splice_tail(&lists[level], listp); in nilfs_btree_lookup_dirty_buffers()
|
Completed in 16 milliseconds