Searched refs:reap (Results 1 – 6 of 6) sorted by relevance
| /linux-6.12.1/tools/testing/selftests/bpf/prog_tests/ |
| D | htab_reuse.c | 83 goto reap; in test_htab_reuse()
90 goto reap; in test_htab_reuse()
94 reap: in test_htab_reuse()
|
| /linux-6.12.1/mm/ |
| D | oom_kill.c | 1206 bool reap = false; in SYSCALL_DEFINE2() local
1230 reap = true; in SYSCALL_DEFINE2()
1238 if (!reap) in SYSCALL_DEFINE2()
|
| /linux-6.12.1/lib/ |
| D | btree.c | 676 void *func2, int reap, int height, size_t count) in __btree_for_each() argument
687 func, func2, reap, height - 1, count); in __btree_for_each()
692 if (reap) in __btree_for_each()
|
| /linux-6.12.1/fs/xfs/ |
| D | Makefile | 219 reap.o \
|
| /linux-6.12.1/fs/ |
| D | inode.c | 928 unsigned long reap; in inode_lru_isolate() local
929 reap = invalidate_mapping_pages(&inode->i_data, 0, -1); in inode_lru_isolate()
931 __count_vm_events(KSWAPD_INODESTEAL, reap); in inode_lru_isolate()
933 __count_vm_events(PGINODESTEAL, reap); in inode_lru_isolate()
934 mm_account_reclaimed_pages(reap); in inode_lru_isolate()
|
| /linux-6.12.1/Documentation/filesystems/xfs/ |
| D | xfs-online-fsck-design.rst | 2534 clean up the space reservations that were made for the new btree, and reap the
2559 algorithm, because a log flush and a crash before the end of the reap step can
2854 Old reference count and inode btrees are the easiest to reap because they have
2857 Creating a list of extents to reap the old btree blocks is quite simple,
2928 Third, finding the blocks to reap after the repair is not overly
2956 Old reverse mapping btrees are less difficult to reap after a repair.
2993 4. Once the AGFL is full, reap any blocks leftover.
3827 to :ref:`reap after rmap btree repair <rmap_reap>`.
3858 system goes down during the reap, the iunlink code will delete the blocks
3873 reap phase and the fork extents are crosslinked, the iunlink processing will
[all …]
|