Searched refs:reap (Results 1 – 7 of 7) sorted by relevance
| /linux-6.6.21/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.6.21/mm/ |
| D | oom_kill.c | 1202 bool reap = false; in SYSCALL_DEFINE2() local
1226 reap = true; in SYSCALL_DEFINE2()
1234 if (!reap) in SYSCALL_DEFINE2()
|
| /linux-6.6.21/fs/xfs/ |
| D | Makefile | 184 reap.o \
|
| /linux-6.6.21/lib/ |
| D | btree.c | 677 void *func2, int reap, int height, size_t count) in __btree_for_each() argument
688 func, func2, reap, height - 1, count); in __btree_for_each()
693 if (reap) in __btree_for_each()
|
| /linux-6.6.21/fs/ |
| D | inode.c | 849 unsigned long reap; in inode_lru_isolate() local
850 reap = invalidate_mapping_pages(&inode->i_data, 0, -1); in inode_lru_isolate()
852 __count_vm_events(KSWAPD_INODESTEAL, reap); in inode_lru_isolate()
854 __count_vm_events(PGINODESTEAL, reap); in inode_lru_isolate()
855 mm_account_reclaimed_pages(reap); in inode_lru_isolate()
|
| /linux-6.6.21/drivers/staging/wlan-ng/ |
| D | hfa384x_usb.c | 2618 int reap = 0; in hfa384x_usbctlx_completion_task() local
2643 reap = 0; in hfa384x_usbctlx_completion_task()
2660 reap = 1; in hfa384x_usbctlx_completion_task()
2667 if (reap) in hfa384x_usbctlx_completion_task()
|
| /linux-6.6.21/Documentation/filesystems/ |
| D | xfs-online-fsck-design.rst | 2542 clean up the space reservations that were made for the new btree, and reap the
2567 algorithm, because a log flush and a crash before the end of the reap step can
2861 Old reference count and inode btrees are the easiest to reap because they have
2864 Creating a list of extents to reap the old btree blocks is quite simple,
2935 Third, finding the blocks to reap after the repair is not overly
2963 Old reverse mapping btrees are less difficult to reap after a repair.
3000 4. Once the AGFL is full, reap any blocks leftover.
3834 to :ref:`reap after rmap btree repair <rmap_reap>`.
3865 system goes down during the reap, the iunlink code will delete the blocks
3879 reap phase and the fork extents are crosslinked, the iunlink processing will
[all …]
|