xref: /freebsd/sys/vm/vm_meter.c (revision 33b77e2decd50e53798014b70bf7ca3bdc4c0c7e)
1 /*
2  * Copyright (c) 1982, 1986, 1989, 1993
3  *	The Regents of the University of California.  All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions
7  * are met:
8  * 1. Redistributions of source code must retain the above copyright
9  *    notice, this list of conditions and the following disclaimer.
10  * 2. Redistributions in binary form must reproduce the above copyright
11  *    notice, this list of conditions and the following disclaimer in the
12  *    documentation and/or other materials provided with the distribution.
13  * 3. All advertising materials mentioning features or use of this software
14  *    must display the following acknowledgement:
15  *	This product includes software developed by the University of
16  *	California, Berkeley and its contributors.
17  * 4. Neither the name of the University nor the names of its contributors
18  *    may be used to endorse or promote products derived from this software
19  *    without specific prior written permission.
20  *
21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31  * SUCH DAMAGE.
32  *
33  *	@(#)vm_meter.c	8.4 (Berkeley) 1/4/94
34  * $Id: vm_meter.c,v 1.22 1997/09/01 03:17:19 bde Exp $
35  */
36 
37 #include <sys/param.h>
38 #include <sys/proc.h>
39 #include <sys/systm.h>
40 #include <sys/kernel.h>
41 #include <sys/vmmeter.h>
42 
43 #include <vm/vm.h>
44 #include <vm/vm_extern.h>
45 #include <vm/vm_param.h>
46 #include <sys/lock.h>
47 #include <vm/pmap.h>
48 #include <vm/vm_map.h>
49 #include <vm/vm_object.h>
50 #include <sys/sysctl.h>
51 
52 struct loadavg averunnable =
53 	{ {0, 0, 0}, FSCALE };	/* load average, of runnable procs */
54 
55 struct vmmeter cnt;
56 
57 static int maxslp = MAXSLP;
58 
59 /*
60  * Constants for averages over 1, 5, and 15 minutes
61  * when sampling at 5 second intervals.
62  */
63 static fixpt_t cexp[3] = {
64 	0.9200444146293232 * FSCALE,	/* exp(-1/12) */
65 	0.9834714538216174 * FSCALE,	/* exp(-1/60) */
66 	0.9944598480048967 * FSCALE,	/* exp(-1/180) */
67 };
68 
69 /*
70  * Compute a tenex style load average of a quantity on
71  * 1, 5 and 15 minute intervals.
72  */
73 static void
74 loadav(struct loadavg *avg)
75 {
76 	register int i, nrun;
77 	register struct proc *p;
78 
79 	for (nrun = 0, p = allproc.lh_first; p != 0; p = p->p_list.le_next) {
80 		switch (p->p_stat) {
81 		case SSLEEP:
82 			if (p->p_priority > PZERO || p->p_slptime != 0)
83 				continue;
84 			/* fall through */
85 		case SRUN:
86 		case SIDL:
87 			nrun++;
88 		}
89 	}
90 	for (i = 0; i < 3; i++)
91 		avg->ldavg[i] = (cexp[i] * avg->ldavg[i] +
92 		    nrun * FSCALE * (FSCALE - cexp[i])) >> FSHIFT;
93 }
94 
95 void
96 vmmeter()
97 {
98 
99 	if (time.tv_sec % 5 == 0)
100 		loadav(&averunnable);
101 	if (proc0.p_slptime > maxslp / 2)
102 		wakeup(&proc0);
103 }
104 
105 SYSCTL_INT(_vm, VM_V_FREE_MIN, v_free_min,
106 	CTLFLAG_RW, &cnt.v_free_min, 0, "");
107 SYSCTL_INT(_vm, VM_V_FREE_TARGET, v_free_target,
108 	CTLFLAG_RW, &cnt.v_free_target, 0, "");
109 SYSCTL_INT(_vm, VM_V_FREE_RESERVED, v_free_reserved,
110 	CTLFLAG_RW, &cnt.v_free_reserved, 0, "");
111 SYSCTL_INT(_vm, VM_V_INACTIVE_TARGET, v_inactive_target,
112 	CTLFLAG_RW, &cnt.v_inactive_target, 0, "");
113 SYSCTL_INT(_vm, VM_V_CACHE_MIN, v_cache_min,
114 	CTLFLAG_RW, &cnt.v_cache_min, 0, "");
115 SYSCTL_INT(_vm, VM_V_CACHE_MAX, v_cache_max,
116 	CTLFLAG_RW, &cnt.v_cache_max, 0, "");
117 SYSCTL_INT(_vm, VM_V_PAGEOUT_FREE_MIN, v_pageout_free_min,
118 	CTLFLAG_RW, &cnt.v_pageout_free_min, 0, "");
119 
120 SYSCTL_STRUCT(_vm, VM_LOADAVG, loadavg, CTLFLAG_RD, &averunnable, loadavg, "");
121 
122 static int
123 vmtotal SYSCTL_HANDLER_ARGS
124 {
125 	struct proc *p;
126 	struct vmtotal total, *totalp;
127 	vm_map_entry_t entry;
128 	vm_object_t object;
129 	vm_map_t map;
130 	int paging;
131 
132 	totalp = &total;
133 	bzero(totalp, sizeof *totalp);
134 	/*
135 	 * Mark all objects as inactive.
136 	 */
137 	for (object = TAILQ_FIRST(&vm_object_list);
138 	    object != NULL;
139 	    object = TAILQ_NEXT(object,object_list))
140 		object->flags &= ~OBJ_ACTIVE;
141 	/*
142 	 * Calculate process statistics.
143 	 */
144 	for (p = allproc.lh_first; p != 0; p = p->p_list.le_next) {
145 		if (p->p_flag & P_SYSTEM)
146 			continue;
147 		switch (p->p_stat) {
148 		case 0:
149 			continue;
150 
151 		case SSLEEP:
152 		case SSTOP:
153 			if (p->p_flag & P_INMEM) {
154 				if (p->p_priority <= PZERO)
155 					totalp->t_dw++;
156 				else if (p->p_slptime < maxslp)
157 					totalp->t_sl++;
158 			} else if (p->p_slptime < maxslp)
159 				totalp->t_sw++;
160 			if (p->p_slptime >= maxslp)
161 				continue;
162 			break;
163 
164 		case SRUN:
165 		case SIDL:
166 			if (p->p_flag & P_INMEM)
167 				totalp->t_rq++;
168 			else
169 				totalp->t_sw++;
170 			if (p->p_stat == SIDL)
171 				continue;
172 			break;
173 		}
174 		/*
175 		 * Note active objects.
176 		 */
177 		paging = 0;
178 		for (map = &p->p_vmspace->vm_map, entry = map->header.next;
179 		    entry != &map->header; entry = entry->next) {
180 			if ((entry->eflags & (MAP_ENTRY_IS_A_MAP|MAP_ENTRY_IS_SUB_MAP)) ||
181 			    entry->object.vm_object == NULL)
182 				continue;
183 			entry->object.vm_object->flags |= OBJ_ACTIVE;
184 			paging |= entry->object.vm_object->paging_in_progress;
185 		}
186 		if (paging)
187 			totalp->t_pw++;
188 	}
189 	/*
190 	 * Calculate object memory usage statistics.
191 	 */
192 	for (object = TAILQ_FIRST(&vm_object_list);
193 	    object != NULL;
194 	    object = TAILQ_NEXT(object, object_list)) {
195 		totalp->t_vm += object->size;
196 		totalp->t_rm += object->resident_page_count;
197 		if (object->flags & OBJ_ACTIVE) {
198 			totalp->t_avm += object->size;
199 			totalp->t_arm += object->resident_page_count;
200 		}
201 		if (object->shadow_count > 1) {
202 			/* shared object */
203 			totalp->t_vmshr += object->size;
204 			totalp->t_rmshr += object->resident_page_count;
205 			if (object->flags & OBJ_ACTIVE) {
206 				totalp->t_avmshr += object->size;
207 				totalp->t_armshr += object->resident_page_count;
208 			}
209 		}
210 	}
211 	totalp->t_free = cnt.v_free_count + cnt.v_cache_count;
212 	return (sysctl_handle_opaque(oidp, totalp, sizeof total, req));
213 }
214 
215 SYSCTL_PROC(_vm, VM_METER, vmmeter, CTLTYPE_OPAQUE|CTLFLAG_RD,
216 	0, sizeof(struct vmtotal), vmtotal, "S,vmtotal", "");
217