| /linux/security/keys/ |
| H A D | gc.c | 103 * Reap keys of dead type.
183 #define KEY_GC_REAPING_LINKS 0x02 /* - We need to reap links */ in key_garbage_collector()
185 #define KEY_GC_REAPING_DEAD_2 0x20 /* - We need to reap dead key links */ in key_garbage_collector()
186 #define KEY_GC_REAPING_DEAD_3 0x40 /* - We need to reap dead keys */ in key_garbage_collector()
280 * where we didn't reap any keys. in key_garbage_collector()
309 * keytype reap cycles. in key_garbage_collector()
352 * dead or expired keys. We don't flag another reap immediately as we in key_garbage_collector()
354 * can reap the keys to which it refers. in key_garbage_collector()
|
| /linux/fs/xfs/ |
| H A D | xfs_mru_cache.c | 43 * accumulate in the reap list until the reaper function is eventually called.
48 * representing discrete time intervals is that it's only practical to reap
51 * individual timeout with each element that specifies a more precise reap time.
66 * of the reap list. To keep the list maintenance portion of these operations
111 * will be well in the future to ensure that all items are moved to the reap
114 * This function enters a loop, moving the contents of the LRU list to the reap
143 * of the reap list. in _xfs_mru_cache_migrate()
158 * lists have been migrated to the reap list, it's now empty. in _xfs_mru_cache_migrate()
219 * When destroying or reaping, all the elements that were migrated to the reap
221 * data store, removing it from the reap list, calling the client's free
[all …]
|
| /linux/tools/testing/selftests/pid_namespace/ |
| H A D | pid_max.c | 198 goto reap; in pid_max_nested_outer()
209 goto reap; in pid_max_nested_outer()
214 goto reap; in pid_max_nested_outer()
219 reap: in pid_max_nested_outer()
273 goto reap; in pid_max_nested_limit_inner()
278 reap: in pid_max_nested_limit_inner()
|
| /linux/tools/testing/selftests/bpf/prog_tests/ |
| H A 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/tools/testing/selftests/mm/ |
| H A D | mrelease_test.c | 125 * Wait for the child to finish allocations, then kill and reap in main()
153 * If we failed to reap because the child exited too soon, in main()
|
| /linux/drivers/md/dm-vdo/ |
| H A D | recovery-journal.h | 162 /* Whether a reap is in progress */
192 /* The new block map reap head after reaping */
196 /* The new slab journal reap head after reaping */
|
| /linux/include/uapi/linux/ |
| H A D | wait.h | 10 #define WNOWAIT 0x01000000 /* Don't reap, just poll status. */
|
| /linux/net/rxrpc/ |
| H A D | conn_object.c | 275 * Set the service connection reap timer.
385 * reap dead service connections
416 _debug("reap CONN %d { a=%d,t=%ld }", in rxrpc_service_connection_reaper()
|
| H A D | conn_client.c | 20 * of connections is below the reap threshold, we use the normal duration; if
557 * Set the reap timer.
766 /* If the number of connections is over the reap limit, we in rxrpc_discard_expired_client_conns()
|
| H A D | conn_service.c | 118 * reap lists so that we don't have to get the lock from BH context.
|
| /linux/fs/ubifs/ |
| H A D | shrinker.c | 184 * it is safe to reap the cache. in shrink_tnc_trees()
289 * No clean znodes, nothing to reap. All we can do in this case in ubifs_shrink_scan()
|
| /linux/tools/perf/bench/ |
| H A D | sched-messaging.c | 262 /* Return number of children to reap */ in group()
331 /* Reap them all */ in bench_sched_messaging()
|
| /linux/include/linux/ |
| H A D | oom.h | 81 * This is no longer true if the oom reaper started to reap the
|
| /linux/drivers/infiniband/sw/siw/ |
| H A D | siw_cq.c | 44 * Reap one CQE from the CQ. Only used by kernel clients
|
| /linux/fs/xfs/scrub/ |
| H A D | cow_repair.c | 41 #include "scrub/reap.h"
604 /* Note the old CoW staging extents; we'll reap them all later. */ in xrep_cow_replace_range()
736 * Reap as many of the old CoW blocks as we can. They are owned ondisk in xrep_bmap_cow()
|
| H A D | rmap_repair.c | 49 #include "scrub/reap.h"
115 * IV) Reap the old btree blocks.
120 * 4. Reap the extents corresponding to the set areas in OLDRMBIT. These are
1200 * process to reap the old btree blocks will race with the AIL trying in xrep_rmap_reset_counters()
1494 * Reap the old rmapbt blocks. Now that the rmapbt is fully rebuilt, we make
|
| H A D | refcount_repair.c | 40 #include "scrub/reap.h"
560 * process to reap the old btree blocks will race with the AIL trying in xrep_refc_reset_counters()
|
| /linux/lib/ |
| H A 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()
|
| H A D | dynamic_queue_limits.c | 44 /* Advance start to continue from the last reap time */ in dql_check_stall()
|
| /linux/arch/um/os-Linux/ |
| H A D | process.c | 74 /* Try to reap a child */ in os_reap_child()
|
| /linux/tools/testing/selftests/sched_ext/ |
| H A D | init_enable_count.c | 48 * them to exit simultaneously. Auto-reap so we don't have to wait on in run_test()
|
| /linux/security/apparmor/include/ |
| H A D | policy_unpack.h | 139 * if the race to reap can be encountered when it is used.
|
| /linux/kernel/ |
| H A D | exit.c | 1201 * We own this thread, nobody else can reap it. in wait_task_zombie()
1227 * which can reap other children at the same time. in wait_task_zombie()
1483 * the caller is ptrace_do_wait() and reap this child if it in wait_consider_task()
1498 /* we don't reap group leaders with subthreads */ in wait_consider_task()
1669 * might later match our criteria, even if we are not able to reap in __do_wait()
|
| /linux/io_uring/ |
| H A D | wait.c | 187 * application must reap them itself, as they reside on the shared cq ring.
|
| /linux/tools/testing/selftests/pidfd/ |
| H A D | pidfd_info_test.c | 69 /* SIGKILL but don't reap. */ in FIXTURE_SETUP()
94 /* SIGKILL and reap. */ in FIXTURE_SETUP()
|