2 * SPDX-License-Identifier: (BSD-4-Clause AND MIT-CMU)
4 * Copyright (c) 1991 Regents of the University of California.
6 * Copyright (c) 1994 John S. Dyson
8 * Copyright (c) 1994 David Greenman
10 * Copyright (c) 2005 Yahoo! Technologies Norway AS
11 * All rights reserved.
13 * This code is derived from software contributed to Berkeley by
14 * The Mach Operating System project at Carnegie-Mellon University.
16 * Redistribution and use in source and binary forms, with or without
17 * modification, are permitted provided that the following conditions
19 * 1. Redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer.
21 * 2. Redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the distribution.
24 * 3. All advertising materials mentioning features or use of this software
25 * must display the following acknowledgement:
26 * This product includes software developed by the University of
27 * California, Berkeley and its contributors.
28 * 4. Neither the name of the University nor the names of its contributors
29 * may be used to endorse or promote products derived from this software
30 * without specific prior written permission.
32 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
33 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
34 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
35 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
36 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
37 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
38 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
39 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
40 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
41 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
44 * from: @(#)vm_pageout.c 7.4 (Berkeley) 5/7/91
47 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
48 * All rights reserved.
50 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
52 * Permission to use, copy, modify and distribute this software and
53 * its documentation is hereby granted, provided that both the copyright
54 * notice and this permission notice appear in all copies of the
55 * software, derivative works or modified versions, and any portions
56 * thereof, and that both notices appear in supporting documentation.
58 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
59 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
60 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
62 * Carnegie Mellon requests users of this software to return to
64 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
65 * School of Computer Science
66 * Carnegie Mellon University
67 * Pittsburgh PA 15213-3890
69 * any improvements or extensions that they make and grant Carnegie the
70 * rights to redistribute these changes.
73 #include <sys/cdefs.h>
74 __FBSDID("$FreeBSD$");
76 #include "opt_kstack_pages.h"
77 #include "opt_kstack_max_pages.h"
80 #include <sys/param.h>
81 #include <sys/systm.h>
82 #include <sys/limits.h>
83 #include <sys/kernel.h>
84 #include <sys/eventhandler.h>
86 #include <sys/mutex.h>
88 #include <sys/kthread.h>
90 #include <sys/mount.h>
91 #include <sys/racct.h>
92 #include <sys/resourcevar.h>
93 #include <sys/refcount.h>
94 #include <sys/sched.h>
96 #include <sys/signalvar.h>
99 #include <sys/vnode.h>
100 #include <sys/vmmeter.h>
101 #include <sys/rwlock.h>
103 #include <sys/sysctl.h>
106 #include <vm/vm_param.h>
107 #include <vm/vm_object.h>
108 #include <vm/vm_page.h>
109 #include <vm/vm_map.h>
110 #include <vm/vm_pageout.h>
111 #include <vm/vm_pager.h>
112 #include <vm/vm_phys.h>
113 #include <vm/swap_pager.h>
114 #include <vm/vm_extern.h>
117 /* the kernel process "vm_daemon" */
118 static void vm_daemon(void);
119 static struct proc *vmproc;
121 static struct kproc_desc vm_kp = {
126 SYSINIT(vmdaemon, SI_SUB_KTHREAD_VM, SI_ORDER_FIRST, kproc_start, &vm_kp);
128 static int vm_swap_enabled = 1;
129 static int vm_swap_idle_enabled = 0;
131 SYSCTL_INT(_vm, VM_SWAPPING_ENABLED, swap_enabled, CTLFLAG_RW,
133 "Enable entire process swapout");
134 SYSCTL_INT(_vm, OID_AUTO, swap_idle_enabled, CTLFLAG_RW,
135 &vm_swap_idle_enabled, 0,
136 "Allow swapout on idle criteria");
139 * Swap_idle_threshold1 is the guaranteed swapped in time for a process
141 static int swap_idle_threshold1 = 2;
142 SYSCTL_INT(_vm, OID_AUTO, swap_idle_threshold1, CTLFLAG_RW,
143 &swap_idle_threshold1, 0,
144 "Guaranteed swapped in time for a process");
147 * Swap_idle_threshold2 is the time that a process can be idle before
148 * it will be swapped out, if idle swapping is enabled.
150 static int swap_idle_threshold2 = 10;
151 SYSCTL_INT(_vm, OID_AUTO, swap_idle_threshold2, CTLFLAG_RW,
152 &swap_idle_threshold2, 0,
153 "Time before a process will be swapped out");
155 static int vm_pageout_req_swapout; /* XXX */
156 static int vm_daemon_needed;
157 static struct mtx vm_daemon_mtx;
158 /* Allow for use by vm_pageout before vm_daemon is initialized. */
159 MTX_SYSINIT(vm_daemon, &vm_daemon_mtx, "vm daemon", MTX_DEF);
161 static int swapped_cnt;
162 static int swap_inprogress; /* Pending swap-ins done outside swapper. */
163 static int last_swapin;
165 static void swapclear(struct proc *);
166 static int swapout(struct proc *);
167 static void vm_swapout_map_deactivate_pages(vm_map_t, long);
168 static void vm_swapout_object_deactivate(pmap_t, vm_object_t, long);
169 static void swapout_procs(int action);
170 static void vm_req_vmdaemon(int req);
171 static void vm_thread_swapout(struct thread *td);
174 vm_swapout_object_deactivate_page(pmap_t pmap, vm_page_t m, bool unmap)
178 * Ignore unreclaimable wired pages. Repeat the check after busying
179 * since a busy holder may wire the page.
181 if (vm_page_wired(m) || !vm_page_tryxbusy(m))
184 if (vm_page_wired(m) || !pmap_page_exists_quick(pmap, m)) {
188 if (!pmap_is_referenced(m)) {
189 if (!vm_page_active(m))
190 (void)vm_page_try_remove_all(m);
191 else if (unmap && vm_page_try_remove_all(m))
192 vm_page_deactivate(m);
198 * vm_swapout_object_deactivate
200 * Deactivate enough pages to satisfy the inactive target
203 * The object and map must be locked.
206 vm_swapout_object_deactivate(pmap_t pmap, vm_object_t first_object,
209 vm_object_t backing_object, object;
213 VM_OBJECT_ASSERT_LOCKED(first_object);
214 if ((first_object->flags & OBJ_FICTITIOUS) != 0)
216 for (object = first_object;; object = backing_object) {
217 if (pmap_resident_count(pmap) <= desired)
219 VM_OBJECT_ASSERT_LOCKED(object);
220 if ((object->flags & OBJ_UNMANAGED) != 0 ||
221 REFCOUNT_COUNT(object->paging_in_progress) > 0)
225 if (object->shadow_count > 1)
229 * Scan the object's entire memory queue.
231 TAILQ_FOREACH(m, &object->memq, listq) {
232 if (pmap_resident_count(pmap) <= desired)
236 vm_swapout_object_deactivate_page(pmap, m, unmap);
238 if ((backing_object = object->backing_object) == NULL)
240 VM_OBJECT_RLOCK(backing_object);
241 if (object != first_object)
242 VM_OBJECT_RUNLOCK(object);
245 if (object != first_object)
246 VM_OBJECT_RUNLOCK(object);
250 * deactivate some number of pages in a map, try to do it fairly, but
251 * that is really hard to do.
254 vm_swapout_map_deactivate_pages(vm_map_t map, long desired)
257 vm_object_t obj, bigobj;
260 if (!vm_map_trylock_read(map))
267 * first, search out the biggest object, and try to free pages from
270 VM_MAP_ENTRY_FOREACH(tmpe, map) {
271 if ((tmpe->eflags & MAP_ENTRY_IS_SUB_MAP) == 0) {
272 obj = tmpe->object.vm_object;
273 if (obj != NULL && VM_OBJECT_TRYRLOCK(obj)) {
274 if (obj->shadow_count <= 1 &&
276 bigobj->resident_page_count <
277 obj->resident_page_count)) {
279 VM_OBJECT_RUNLOCK(bigobj);
282 VM_OBJECT_RUNLOCK(obj);
285 if (tmpe->wired_count > 0)
286 nothingwired = FALSE;
289 if (bigobj != NULL) {
290 vm_swapout_object_deactivate(map->pmap, bigobj, desired);
291 VM_OBJECT_RUNLOCK(bigobj);
294 * Next, hunt around for other pages to deactivate. We actually
295 * do this search sort of wrong -- .text first is not the best idea.
297 VM_MAP_ENTRY_FOREACH(tmpe, map) {
298 if (pmap_resident_count(vm_map_pmap(map)) <= desired)
300 if ((tmpe->eflags & MAP_ENTRY_IS_SUB_MAP) == 0) {
301 obj = tmpe->object.vm_object;
303 VM_OBJECT_RLOCK(obj);
304 vm_swapout_object_deactivate(map->pmap, obj,
306 VM_OBJECT_RUNLOCK(obj);
312 * Remove all mappings if a process is swapped out, this will free page
315 if (desired == 0 && nothingwired) {
316 pmap_remove(vm_map_pmap(map), vm_map_min(map),
320 vm_map_unlock_read(map);
326 #define VM_SWAP_NORMAL 1
327 #define VM_SWAP_IDLE 2
334 vm_req_vmdaemon(VM_SWAP_NORMAL);
338 * Idle process swapout -- run once per second when pagedaemons are
342 vm_swapout_run_idle(void)
346 if (!vm_swap_idle_enabled || time_second == lsec)
348 vm_req_vmdaemon(VM_SWAP_IDLE);
353 vm_req_vmdaemon(int req)
355 static int lastrun = 0;
357 mtx_lock(&vm_daemon_mtx);
358 vm_pageout_req_swapout |= req;
359 if ((ticks > (lastrun + hz)) || (ticks < lastrun)) {
360 wakeup(&vm_daemon_needed);
363 mtx_unlock(&vm_daemon_mtx);
369 struct rlimit rsslim;
373 int breakout, swapout_flags, tryagain, attempts;
375 uint64_t rsize, ravailable;
379 mtx_lock(&vm_daemon_mtx);
380 msleep(&vm_daemon_needed, &vm_daemon_mtx, PPAUSE, "psleep",
382 racct_enable ? hz : 0
387 swapout_flags = vm_pageout_req_swapout;
388 vm_pageout_req_swapout = 0;
389 mtx_unlock(&vm_daemon_mtx);
390 if (swapout_flags != 0) {
392 * Drain the per-CPU page queue batches as a deadlock
395 if ((swapout_flags & VM_SWAP_NORMAL) != 0)
396 vm_page_pqbatch_drain();
397 swapout_procs(swapout_flags);
401 * scan the processes for exceeding their rlimits or if
402 * process is swapped out -- deactivate pages
408 sx_slock(&allproc_lock);
409 FOREACH_PROC_IN_SYSTEM(p) {
410 vm_pindex_t limit, size;
413 * if this is a system process or if we have already
414 * looked at this process, skip it.
417 if (p->p_state != PRS_NORMAL ||
418 p->p_flag & (P_INEXEC | P_SYSTEM | P_WEXIT)) {
423 * if the process is in a non-running type state,
427 FOREACH_THREAD_IN_PROC(p, td) {
429 if (!TD_ON_RUNQ(td) &&
430 !TD_IS_RUNNING(td) &&
431 !TD_IS_SLEEPING(td) &&
432 !TD_IS_SUSPENDED(td)) {
446 lim_rlimit_proc(p, RLIMIT_RSS, &rsslim);
448 qmin(rsslim.rlim_cur, rsslim.rlim_max));
451 * let processes that are swapped out really be
452 * swapped out set the limit to nothing (will force a
455 if ((p->p_flag & P_INMEM) == 0)
457 vm = vmspace_acquire_ref(p);
464 sx_sunlock(&allproc_lock);
466 size = vmspace_resident_count(vm);
468 vm_swapout_map_deactivate_pages(
470 size = vmspace_resident_count(vm);
474 rsize = IDX_TO_OFF(size);
476 if (p->p_state == PRS_NORMAL)
477 racct_set(p, RACCT_RSS, rsize);
478 ravailable = racct_get_available(p, RACCT_RSS);
480 if (rsize > ravailable) {
482 * Don't be overly aggressive; this
483 * might be an innocent process,
484 * and the limit could've been exceeded
485 * by some memory hog. Don't try
486 * to deactivate more than 1/4th
487 * of process' resident set size.
490 if (ravailable < rsize -
496 vm_swapout_map_deactivate_pages(
498 OFF_TO_IDX(ravailable));
499 /* Update RSS usage after paging out. */
500 size = vmspace_resident_count(vm);
501 rsize = IDX_TO_OFF(size);
503 if (p->p_state == PRS_NORMAL)
504 racct_set(p, RACCT_RSS, rsize);
506 if (rsize > ravailable)
512 sx_slock(&allproc_lock);
515 sx_sunlock(&allproc_lock);
516 if (tryagain != 0 && attempts <= 10) {
524 * Allow a thread's kernel stack to be paged out.
527 vm_thread_swapout(struct thread *td)
533 cpu_thread_swapout(td);
534 pages = td->td_kstack_pages;
535 ksobj = td->td_kstack_obj;
536 pmap_qremove(td->td_kstack, pages);
537 VM_OBJECT_WLOCK(ksobj);
538 for (i = 0; i < pages; i++) {
539 m = vm_page_lookup(ksobj, i);
541 panic("vm_thread_swapout: kstack already missing?");
543 vm_page_unwire(m, PQ_LAUNDRY);
545 VM_OBJECT_WUNLOCK(ksobj);
549 * Bring the kernel stack for a specified thread back in.
552 vm_thread_swapin(struct thread *td, int oom_alloc)
555 vm_page_t ma[KSTACK_MAX_PAGES];
556 int a, count, i, j, pages, rv;
558 pages = td->td_kstack_pages;
559 ksobj = td->td_kstack_obj;
560 VM_OBJECT_WLOCK(ksobj);
561 (void)vm_page_grab_pages(ksobj, 0, oom_alloc | VM_ALLOC_WIRED, ma,
563 VM_OBJECT_WUNLOCK(ksobj);
564 for (i = 0; i < pages;) {
565 vm_page_assert_xbusied(ma[i]);
566 if (vm_page_all_valid(ma[i])) {
567 vm_page_xunbusy(ma[i]);
571 vm_object_pip_add(ksobj, 1);
572 for (j = i + 1; j < pages; j++)
573 if (vm_page_all_valid(ma[j]))
575 VM_OBJECT_WLOCK(ksobj);
576 rv = vm_pager_has_page(ksobj, ma[i]->pindex, NULL, &a);
577 VM_OBJECT_WUNLOCK(ksobj);
578 KASSERT(rv == 1, ("%s: missing page %p", __func__, ma[i]));
579 count = min(a + 1, j - i);
580 rv = vm_pager_get_pages(ksobj, ma + i, count, NULL, NULL);
581 KASSERT(rv == VM_PAGER_OK, ("%s: cannot get kstack for proc %d",
582 __func__, td->td_proc->p_pid));
583 vm_object_pip_wakeup(ksobj);
584 for (j = i; j < i + count; j++)
585 vm_page_xunbusy(ma[j]);
588 pmap_qenter(td->td_kstack, ma, pages);
589 cpu_thread_swapin(td);
593 faultin(struct proc *p)
598 PROC_LOCK_ASSERT(p, MA_OWNED);
601 * If another process is swapping in this process,
602 * just wait until it finishes.
604 if (p->p_flag & P_SWAPPINGIN) {
605 while (p->p_flag & P_SWAPPINGIN)
606 msleep(&p->p_flag, &p->p_mtx, PVM, "faultin", 0);
610 if ((p->p_flag & P_INMEM) == 0) {
611 oom_alloc = (p->p_flag & P_WKILLED) != 0 ? VM_ALLOC_SYSTEM :
615 * Don't let another thread swap process p out while we are
616 * busy swapping it in.
619 p->p_flag |= P_SWAPPINGIN;
621 sx_xlock(&allproc_lock);
622 MPASS(swapped_cnt > 0);
624 if (curthread != &thread0)
626 sx_xunlock(&allproc_lock);
629 * We hold no lock here because the list of threads
630 * can not change while all threads in the process are
633 FOREACH_THREAD_IN_PROC(p, td)
634 vm_thread_swapin(td, oom_alloc);
636 if (curthread != &thread0) {
637 sx_xlock(&allproc_lock);
638 MPASS(swap_inprogress > 0);
641 sx_xunlock(&allproc_lock);
647 /* Allow other threads to swap p out now. */
654 * This swapin algorithm attempts to swap-in processes only if there
655 * is enough space for them. Of course, if a process waits for a long
656 * time, it will be swapped in anyway.
660 swapper_selector(bool wkilled_only)
662 struct proc *p, *res;
664 int ppri, pri, slptime, swtime;
666 sx_assert(&allproc_lock, SA_SLOCKED);
667 if (swapped_cnt == 0)
671 FOREACH_PROC_IN_SYSTEM(p) {
673 if (p->p_state == PRS_NEW || (p->p_flag & (P_SWAPPINGOUT |
674 P_SWAPPINGIN | P_INMEM)) != 0) {
678 if (p->p_state == PRS_NORMAL && (p->p_flag & P_WKILLED) != 0) {
680 * A swapped-out process might have mapped a
681 * large portion of the system's pages as
682 * anonymous memory. There is no other way to
683 * release the memory other than to kill the
684 * process, for which we need to swap it in.
692 swtime = (ticks - p->p_swtick) / hz;
693 FOREACH_THREAD_IN_PROC(p, td) {
695 * An otherwise runnable thread of a process
696 * swapped out has only the TDI_SWAPPED bit set.
699 if (td->td_inhibitors == TDI_SWAPPED) {
700 slptime = (ticks - td->td_slptick) / hz;
701 pri = swtime + slptime;
702 if ((td->td_flags & TDF_SWAPINREQ) == 0)
703 pri -= p->p_nice * 8;
705 * if this thread is higher priority
706 * and there is enough space, then select
707 * this process instead of the previous
725 #define SWAPIN_INTERVAL (MAXSLP * hz / 2)
728 * Limit swapper to swap in one non-WKILLED process in MAXSLP/2
729 * interval, assuming that there is:
730 * - at least one domain that is not suffering from a shortage of free memory;
731 * - no parallel swap-ins;
732 * - no other swap-ins in the current SWAPIN_INTERVAL.
735 swapper_wkilled_only(void)
738 return (vm_page_count_min_set(&all_domains) || swap_inprogress > 0 ||
739 (u_int)(ticks - last_swapin) < SWAPIN_INTERVAL);
748 sx_slock(&allproc_lock);
749 p = swapper_selector(swapper_wkilled_only());
750 sx_sunlock(&allproc_lock);
753 tsleep(&proc0, PVM, "swapin", SWAPIN_INTERVAL);
755 PROC_LOCK_ASSERT(p, MA_OWNED);
758 * Another process may be bringing or may have
759 * already brought this process in while we
760 * traverse all threads. Or, this process may
761 * have exited or even being swapped out
764 if (p->p_state == PRS_NORMAL && (p->p_flag & (P_INMEM |
765 P_SWAPPINGOUT | P_SWAPPINGIN)) == 0) {
774 * First, if any processes have been sleeping or stopped for at least
775 * "swap_idle_threshold1" seconds, they are swapped out. If, however,
776 * no such processes exist, then the longest-sleeping or stopped
777 * process is swapped out. Finally, and only as a last resort, if
778 * there are no sleeping or stopped processes, the longest-resident
779 * process is swapped out.
782 swapout_procs(int action)
787 bool didswap, doswap;
789 MPASS((action & (VM_SWAP_NORMAL | VM_SWAP_IDLE)) != 0);
792 sx_slock(&allproc_lock);
793 FOREACH_PROC_IN_SYSTEM(p) {
795 * Filter out not yet fully constructed processes. Do
796 * not swap out held processes. Avoid processes which
797 * are system, exiting, execing, traced, already swapped
798 * out or are in the process of being swapped in or out.
801 if (p->p_state != PRS_NORMAL || p->p_lock != 0 || (p->p_flag &
802 (P_SYSTEM | P_WEXIT | P_INEXEC | P_STOPPED_SINGLE |
803 P_TRACED | P_SWAPPINGOUT | P_SWAPPINGIN | P_INMEM)) !=
810 * Further consideration of this process for swap out
811 * requires iterating over its threads. We release
812 * allproc_lock here so that process creation and
813 * destruction are not blocked while we iterate.
815 * To later reacquire allproc_lock and resume
816 * iteration over the allproc list, we will first have
817 * to release the lock on the process. We place a
818 * hold on the process so that it remains in the
819 * allproc list while it is unlocked.
822 sx_sunlock(&allproc_lock);
825 * Do not swapout a realtime process.
826 * Guarantee swap_idle_threshold1 time in memory.
827 * If the system is under memory stress, or if we are
828 * swapping idle processes >= swap_idle_threshold2,
829 * then swap the process out.
832 FOREACH_THREAD_IN_PROC(p, td) {
834 slptime = (ticks - td->td_slptick) / hz;
835 if (PRI_IS_REALTIME(td->td_pri_class) ||
836 slptime < swap_idle_threshold1 ||
837 !thread_safetoswapout(td) ||
838 ((action & VM_SWAP_NORMAL) == 0 &&
839 slptime < swap_idle_threshold2))
845 if (doswap && swapout(p) == 0)
850 sx_xlock(&allproc_lock);
852 sx_downgrade(&allproc_lock);
854 sx_slock(&allproc_lock);
857 sx_sunlock(&allproc_lock);
860 * If we swapped something out, and another process needed memory,
861 * then wakeup the sched process.
868 swapclear(struct proc *p)
872 PROC_LOCK_ASSERT(p, MA_OWNED);
874 FOREACH_THREAD_IN_PROC(p, td) {
876 td->td_flags |= TDF_INMEM;
877 td->td_flags &= ~TDF_SWAPINREQ;
879 if (TD_CAN_RUN(td)) {
880 if (setrunnable(td, 0)) {
883 * XXX: We just cleared TDI_SWAPPED
884 * above and set TDF_INMEM, so this
885 * should never happen.
887 panic("not waking up swapper");
893 p->p_flag &= ~(P_SWAPPINGIN | P_SWAPPINGOUT);
894 p->p_flag |= P_INMEM;
898 swapout(struct proc *p)
902 PROC_LOCK_ASSERT(p, MA_OWNED);
905 * The states of this process and its threads may have changed
906 * by now. Assuming that there is only one pageout daemon thread,
907 * this process should still be in memory.
909 KASSERT((p->p_flag & (P_INMEM | P_SWAPPINGOUT | P_SWAPPINGIN)) ==
910 P_INMEM, ("swapout: lost a swapout race?"));
913 * Remember the resident count.
915 p->p_vmspace->vm_swrss = vmspace_resident_count(p->p_vmspace);
918 * Check and mark all threads before we proceed.
920 p->p_flag &= ~P_INMEM;
921 p->p_flag |= P_SWAPPINGOUT;
922 FOREACH_THREAD_IN_PROC(p, td) {
924 if (!thread_safetoswapout(td)) {
929 td->td_flags &= ~TDF_INMEM;
933 td = FIRST_THREAD_IN_PROC(p);
934 ++td->td_ru.ru_nswap;
938 * This list is stable because all threads are now prevented from
939 * running. The list is only modified in the context of a running
940 * thread in this process.
942 FOREACH_THREAD_IN_PROC(p, td)
943 vm_thread_swapout(td);
946 p->p_flag &= ~P_SWAPPINGOUT;