2 * top - a top users display for Unix
4 * SYNOPSIS: For FreeBSD-2.x and later
7 * Originally written for BSD4.4 system by Christos Zoulas.
8 * Ported to FreeBSD 2.x by Steven Wallace && Wolfram Schneider
9 * Order support hacked in from top-3.5beta6/machine/m_aix41.c
10 * by Monte Mitzelfelt (for latest top see http://www.groupsys.com/topinfo/)
12 * This is the machine-dependent module for FreeBSD 2.2
14 * FreeBSD 2.2.x, 3.x, 4.x, and probably FreeBSD 2.1.x
18 * AUTHOR: Christos Zoulas <christos@ee.cornell.edu>
19 * Steven Wallace <swallace@freebsd.org>
20 * Wolfram Schneider <wosch@FreeBSD.org>
21 * Hiten Pandya <hmp@backplane.com>
23 * $FreeBSD: src/usr.bin/top/machine.c,v 1.29.2.2 2001/07/31 20:27:05 tmm Exp $
24 * $DragonFly: src/usr.bin/top/machine.c,v 1.11 2004/05/29 05:11:15 hmp Exp $
29 #include <sys/types.h>
30 #include <sys/signal.h>
31 #include <sys/param.h>
39 #include <sys/errno.h>
40 #include <sys/sysctl.h>
41 #include <sys/dkstat.h>
45 #include <sys/vmmeter.h>
46 #include <sys/resource.h>
47 #include <sys/rtprio.h>
53 #include <osreldate.h> /* for changes in kernel structures */
58 static int check_nlist(struct nlist *);
59 static int getkval(unsigned long, int *, int, char *);
60 extern char* printable(char *);
61 int swapmode(int *retavail, int *retfree);
63 static int namelength;
67 * needs to be a global symbol, so wrapper can be
68 * modified accordingly.
70 static int show_threads = 0;
72 /* get_process_info passes back a handle. This is what it looks like: */
76 struct kinfo_proc **next_proc; /* points to next valid proc pointer */
77 int remaining; /* number of pointers remaining */
80 /* declarations for load_avg */
83 #define PP(pp, field) ((pp)->kp_proc . field)
84 #define EP(pp, field) ((pp)->kp_eproc . field)
85 #define TP(pp, field) ((pp)->kp_thread . field)
86 #define VP(pp, field) ((pp)->kp_eproc.e_vm . field)
88 /* define what weighted cpu is. */
89 #define weighted_cpu(pct, pp) (PP((pp), p_swtime) == 0 ? 0.0 : \
90 ((pct) / (1.0 - exp(PP((pp), p_swtime) * logcpu))))
92 /* what we consider to be process size: */
93 #define PROCSIZE(pp) (VP((pp), vm_map.size) / 1024)
95 /* definitions for indices in the nlist array */
97 static struct nlist nlst[] = {
106 { "_bufspace" }, /* K in buffer cache */
115 * These definitions control the format of the per-process area
118 static char smp_header[] =
119 " PID %-*.*s PRI NICE SIZE RES STATE C TIME WCPU CPU COMMAND";
121 #define smp_Proc_format \
122 "%5d %-*.*s %3d %3d%7s %6s %-6.6s %1x%7s %5.2f%% %5.2f%% %.*s"
124 static char up_header[] =
125 " PID %-*.*s PRI NICE SIZE RES STATE TIME WCPU CPU COMMAND";
127 #define up_Proc_format \
128 "%5d %-*.*s %3d %3d%7s %6s %-6.6s%.0d%7s %5.2f%% %5.2f%% %.*s"
132 /* process state names for the "STATE" column of the display */
133 /* the extra nulls in the string "run" are for adding a slash and
134 the processor number when needed */
136 char *state_abbrev[] =
138 "", "START", "RUN\0\0\0", "SLEEP", "STOP", "ZOMB",
144 /* values that we stash away in _init and use in later routines */
146 static double logcpu;
148 /* these are retrieved from the kernel in _init */
150 static load_avg ccpu;
152 /* these are offsets obtained via nlist and used in the get_ functions */
154 static unsigned long cp_time_offset;
155 static unsigned long avenrun_offset;
156 static unsigned long lastpid_offset;
158 static unsigned long bufspace_offset;
161 /* these are for calculating cpu state percentages */
163 static long cp_time[CPUSTATES];
164 static long cp_old[CPUSTATES];
165 static long cp_diff[CPUSTATES];
167 /* these are for detailing the process states */
169 int process_states[6];
170 char *procstatenames[] = {
171 "", " starting, ", " running, ", " sleeping, ", " stopped, ",
176 /* these are for detailing the cpu states */
178 int cpu_states[CPUSTATES];
179 char *cpustatenames[] = {
180 "user", "nice", "system", "interrupt", "idle", NULL
183 /* these are for detailing the memory statistics */
186 char *memorynames[] = {
187 "K Active, ", "K Inact, ", "K Wired, ", "K Cache, ", "K Buf, ", "K Free",
192 char *swapnames[] = {
194 "K Total, ", "K Used, ", "K Free, ", "% Inuse, ", "K In, ", "K Out",
199 /* these are for keeping track of the proc array */
202 static int onproc = -1;
204 static struct kinfo_proc *pbase;
205 static struct kinfo_proc **pref;
207 /* these are for getting the memory statistics */
209 static int pageshift; /* log base 2 of the pagesize */
211 /* define pagetok in terms of pageshift */
213 #define pagetok(size) ((size) << pageshift)
215 /* useful externals */
219 /* sorting orders. first is default */
220 char *ordernames[] = {
221 "cpu", "size", "res", "time", "pri", "thr", NULL
226 machine_init(struct statics *statics)
229 register int pagesize;
233 modelen = sizeof(smpmode);
234 if ((sysctlbyname("machdep.smp_active", &smpmode, &modelen, NULL, 0) < 0 &&
235 sysctlbyname("smp.smp_active", &smpmode, &modelen, NULL, 0) < 0) ||
236 modelen != sizeof(smpmode))
239 while ((pw = getpwent()) != NULL) {
240 if (strlen(pw->pw_name) > namelength)
241 namelength = strlen(pw->pw_name);
245 if (smpmode && namelength > 13)
247 else if (namelength > 15)
250 if ((kd = kvm_open(NULL, NULL, NULL, O_RDONLY, "kvm_open")) == NULL)
254 /* get the list of symbols we want to access in the kernel */
255 (void) kvm_nlist(kd, nlst);
256 if (nlst[0].n_type == 0)
258 fprintf(stderr, "top: nlist failed\n");
262 /* make sure they were all found */
263 if (i > 0 && check_nlist(nlst) > 0)
268 (void) getkval(nlst[X_CCPU].n_value, (int *)(&ccpu), sizeof(ccpu),
269 nlst[X_CCPU].n_name);
271 /* stash away certain offsets for later use */
272 cp_time_offset = nlst[X_CP_TIME].n_value;
273 avenrun_offset = nlst[X_AVENRUN].n_value;
274 lastpid_offset = nlst[X_LASTPID].n_value;
275 bufspace_offset = nlst[X_BUFSPACE].n_value;
277 /* this is used in calculating WCPU -- calculate it ahead of time */
278 logcpu = log(loaddouble(ccpu));
284 /* get the page size with "getpagesize" and calculate pageshift from it */
285 pagesize = getpagesize();
293 /* we only need the amount of log(2)1024 for our conversion */
294 pageshift -= LOG1024;
296 /* fill in the statics information */
297 statics->procstate_names = procstatenames;
298 statics->cpustate_names = cpustatenames;
299 statics->memory_names = memorynames;
300 statics->swap_names = swapnames;
302 statics->order_names = ordernames;
309 char *format_header(register char *uname_field)
312 static char Header[128];
314 snprintf(Header, sizeof(Header), smpmode ? smp_header : up_header,
315 namelength, namelength, uname_field);
317 if (screen_width <= 79)
322 cmdlength = cmdlength - strlen(Header) + 6;
327 static int swappgsin = -1;
328 static int swappgsout = -1;
329 extern struct timeval timeout;
332 get_system_info(struct system_info *si)
337 struct timeval boottime;
340 /* get the cp_time array */
341 (void) getkval(cp_time_offset, (int *)cp_time, sizeof(cp_time),
342 nlst[X_CP_TIME].n_name);
343 (void) getkval(avenrun_offset, (int *)avenrun, sizeof(avenrun),
344 nlst[X_AVENRUN].n_name);
346 (void) getkval(lastpid_offset, (int *)(&lastpid), sizeof(lastpid),
349 /* convert load averages to doubles */
352 register double *infoloadp;
356 struct loadavg sysload;
358 getkerninfo(KINFO_LOADAVG, &sysload, &size, 0);
361 infoloadp = si->load_avg;
363 for (i = 0; i < 3; i++)
366 *infoloadp++ = ((double) sysload.ldavg[i]) / sysload.fscale;
368 *infoloadp++ = loaddouble(*avenrunp++);
372 /* convert cp_time counts to percentages */
373 total = percentages(CPUSTATES, cpu_states, cp_time, cp_old, cp_diff);
375 /* sum memory & swap statistics */
379 int vms_size = sizeof(vms);
380 int vmm_size = sizeof(vmm);
381 static unsigned int swap_delay = 0;
382 static int swapavail = 0;
383 static int swapfree = 0;
384 static int bufspace = 0;
386 if (sysctlbyname("vm.vmstats", &vms, &vms_size, NULL, 0)) {
387 perror("sysctlbyname: vm.vmstats");
390 if (sysctlbyname("vm.vmmeter", &vmm, &vmm_size, NULL, 0)) {
391 perror("sysctlbyname: vm.vmstats");
394 (void) getkval(bufspace_offset, (int *)(&bufspace), sizeof(bufspace),
397 /* convert memory stats to Kbytes */
398 memory_stats[0] = pagetok(vms.v_active_count);
399 memory_stats[1] = pagetok(vms.v_inactive_count);
400 memory_stats[2] = pagetok(vms.v_wire_count);
401 memory_stats[3] = pagetok(vms.v_cache_count);
402 memory_stats[4] = bufspace / 1024;
403 memory_stats[5] = pagetok(vms.v_free_count);
404 memory_stats[6] = -1;
412 /* compute differences between old and new swap statistic */
414 swap_stats[4] = pagetok(((vmm.v_swappgsin - swappgsin)));
415 swap_stats[5] = pagetok(((vmm.v_swappgsout - swappgsout)));
418 swappgsin = vmm.v_swappgsin;
419 swappgsout = vmm.v_swappgsout;
421 /* call CPU heavy swapmode() only for changes */
422 if (swap_stats[4] > 0 || swap_stats[5] > 0 || swap_delay == 0) {
423 swap_stats[3] = swapmode(&swapavail, &swapfree);
424 swap_stats[0] = swapavail;
425 swap_stats[1] = swapavail - swapfree;
426 swap_stats[2] = swapfree;
432 /* set arrays and strings */
433 si->cpustates = cpu_states;
434 si->memory = memory_stats;
435 si->swap = swap_stats;
439 si->last_pid = lastpid;
445 * Print how long system has been up.
446 * (Found by looking getting "boottime" from the kernel)
449 mib[1] = KERN_BOOTTIME;
450 bt_size = sizeof(boottime);
451 if (sysctl(mib, 2, &boottime, &bt_size, NULL, 0) != -1 &&
452 boottime.tv_sec != 0) {
453 si->boottime = boottime;
455 si->boottime.tv_sec = -1;
459 static struct handle handle;
461 caddr_t get_process_info(struct system_info *si, struct process_select *sel,
465 register int total_procs;
466 register int active_procs;
467 register struct kinfo_proc **prefp;
468 register struct kinfo_proc *pp;
470 /* these are copied out of sel for speed */
478 pbase = kvm_getprocs(kd, KERN_PROC_ALL, 0, &nproc);
480 pref = (struct kinfo_proc **) realloc(pref, sizeof(struct kinfo_proc *)
482 if (pref == NULL || pbase == NULL) {
483 (void) fprintf(stderr, "top: Out of memory.\n");
486 /* get a pointer to the states summary array */
487 si->procstates = process_states;
489 /* set up flags which define what we are going to select */
490 show_idle = sel->idle;
491 show_self = sel->self;
492 show_system = sel->system;
493 show_threads = sel->threads;
494 show_uid = sel->uid != -1;
495 show_command = sel->command != NULL;
497 /* count up process states and get pointers to interesting procs */
500 memset((char *)process_states, 0, sizeof(process_states));
502 for (pp = pbase, i = 0; i < nproc; pp++, i++)
505 * Place pointers to each valid proc structure in pref[].
506 * Process slots that are actually in use have a non-zero
507 * status field. Processes with P_SYSTEM set are system
508 * processes---these get ignored unless show_sysprocs is set.
510 if ((show_threads && (TP(pp, td_proc) == NULL)) ||
511 PP(pp, p_stat) != 0 &&
512 (show_self != PP(pp, p_pid)) &&
513 (show_system || ((PP(pp, p_flag) & P_SYSTEM) == 0)))
516 process_states[(unsigned char) PP(pp, p_stat)]++;
517 if ((show_threads && (TP(pp, td_proc) == NULL)) ||
518 (PP(pp, p_stat) != SZOMB) &&
519 (show_idle || (PP(pp, p_pctcpu) != 0) ||
520 (PP(pp, p_stat) == SRUN)) &&
521 (!show_uid || EP(pp, e_ucred.cr_ruid) == (uid_t)sel->uid))
529 /* if requested, sort the "interesting" processes */
532 qsort((char *)pref, active_procs, sizeof(struct kinfo_proc *), compare);
535 /* remember active and total counts */
536 si->p_total = total_procs;
537 si->p_active = pref_len = active_procs;
539 /* pass back a handle */
540 handle.next_proc = pref;
541 handle.remaining = active_procs;
542 return((caddr_t)&handle);
545 char fmt[128]; /* static area where result is built */
547 char *format_next_process(caddr_t handle, char *(*get_userid)())
549 struct kinfo_proc *pp;
558 /* find and remember the next proc structure */
559 hp = (struct handle *)handle;
560 pp = *(hp->next_proc++);
563 /* set the wrapper for the process/thread name */
564 if ((PP(pp, p_flag) & P_INMEM) == 0)
565 wrapper = "[]"; /* swapped process [pname] */
566 else if (((PP(pp, p_flag) & P_SYSTEM) != 0) && (TP(pp, td_proc) != NULL))
567 wrapper = "()"; /* system process (pname) */
568 else if (show_threads && (TP(pp, td_proc) == NULL))
569 wrapper = "<>"; /* pure kernel threads <thread> */
573 /* get the process's command name */
574 if (wrapper != NULL) {
575 char *comm = TP(pp, td_comm);
576 #define COMSIZ sizeof(TP(pp, td_comm))
578 (void) strncpy(buf, comm, COMSIZ);
579 comm[0] = wrapper[0];
580 (void) strncpy(&comm[1], buf, COMSIZ - 2);
581 comm[COMSIZ - 2] = '\0';
582 (void) strncat(comm, &wrapper[1], COMSIZ - 1);
583 comm[COMSIZ - 1] = '\0';
587 * Convert the process's runtime from microseconds to seconds. This
588 * time includes the interrupt time although that is not wanted here.
589 * ps(1) is similarly sloppy.
591 cputime = (EP(pp, e_uticks) + EP(pp, e_sticks)) / 1000000;
593 /* calculate the base for cpu percentages */
594 pct = pctdouble(PP(pp, p_pctcpu));
596 /* generate "STATE" field */
597 switch (state = PP(pp, p_stat)) {
599 if (smpmode && TP(pp, td_flags) & TDF_RUNNING)
600 sprintf(status, "CPU%d", EP(pp, e_cpuid));
602 strcpy(status, "RUN");
605 if (TP(pp, td_wmesg) != NULL) {
606 sprintf(status, "%.6s", EP(pp, e_wmesg));
613 state < sizeof(state_abbrev) / sizeof(*state_abbrev))
614 sprintf(status, "%.6s", state_abbrev[(unsigned char) state]);
616 sprintf(status, "?%5d", state);
621 * idle time 0 - 31 -> nice value +21 - +52
622 * normal time -> nice value -20 - +20
623 * real time 0 - 31 -> nice value -52 - -21
624 * thread 0 - 31 -> nice value -53 -
626 switch(PP(pp, p_rtprio.type)) {
627 case RTP_PRIO_REALTIME:
628 nice = PRIO_MIN - 1 - RTP_PRIO_MAX + PP(pp, p_rtprio.prio);
631 nice = PRIO_MAX + 1 + PP(pp, p_rtprio.prio);
633 case RTP_PRIO_THREAD:
634 nice = PRIO_MIN - 1 - RTP_PRIO_MAX - PP(pp, p_rtprio.prio);
637 nice = PP(pp, p_nice);
642 /* format this entry */
643 snprintf(fmt, sizeof(fmt),
644 smpmode ? smp_Proc_format : up_Proc_format,
646 namelength, namelength,
647 (*get_userid)(EP(pp, e_ucred.cr_ruid)),
648 (show_threads && (TP(pp, td_proc) == NULL)) ? TP(pp, td_pri) :
651 format_k2(PROCSIZE(pp)),
652 format_k2(pagetok(VP(pp, vm_rssize))),
654 smpmode ? EP(pp, e_cpuid) : 0,
655 format_time(cputime),
656 100.0 * weighted_cpu(pct, pp),
659 printable(TP(pp, td_comm)));
661 /* return the result */
667 * check_nlist(nlst) - checks the nlist to see if any symbols were not
668 * found. For every symbol that was not found, a one-line
669 * message is printed to stderr. The routine returns the
670 * number of symbols NOT found.
673 static int check_nlist(register struct nlist *nlst)
677 /* check to see if we got ALL the symbols we requested */
678 /* this will write one line to stderr for every symbol not found */
681 while (nlst->n_name != NULL)
683 if (nlst->n_type == 0)
685 /* this one wasn't found */
686 (void) fprintf(stderr, "kernel: no symbol named `%s'\n",
698 * getkval(offset, ptr, size, refstr) - get a value out of the kernel.
699 * "offset" is the byte offset into the kernel for the desired value,
700 * "ptr" points to a buffer into which the value is retrieved,
701 * "size" is the size of the buffer (and the object to retrieve),
702 * "refstr" is a reference string used when printing error meessages,
703 * if "refstr" starts with a '!', then a failure on read will not
704 * be fatal (this may seem like a silly way to do things, but I
705 * really didn't want the overhead of another argument).
709 static int getkval(unsigned long offset, int *ptr, int size, char *refstr)
711 if (kvm_read(kd, offset, (char *) ptr, size) != size)
719 fprintf(stderr, "top: kvm_read for %s: %s\n",
720 refstr, strerror(errno));
727 /* comparison routines for qsort */
730 * proc_compare - comparison function for "qsort"
731 * Compares the resource consumption of two processes using five
732 * distinct keys. The keys (in descending order of importance) are:
733 * percent cpu, cpu ticks, state, resident set size, total virtual
734 * memory usage. The process states are ordered as follows (from least
735 * to most important): WAIT, zombie, sleep, stop, start, run. The
736 * array declaration below maps a process state index into a number
737 * that reflects this ordering.
740 static unsigned char sorted_state[] =
744 1, /* ABANDONED (WAIT) */
752 #define ORDERKEY_PCTCPU \
753 if (lresult = (long) PP(p2, p_pctcpu) - (long) PP(p1, p_pctcpu), \
754 (result = lresult > 0 ? 1 : lresult < 0 ? -1 : 0) == 0)
756 #define CPTICKS(p) (EP(p, e_uticks) + EP(p, e_sticks))
758 #define ORDERKEY_CPTICKS \
759 if ((result = CPTICKS(p2) > CPTICKS(p1) ? 1 : \
760 CPTICKS(p2) < CPTICKS(p1) ? -1 : 0) == 0)
762 #define ORDERKEY_STATE \
763 if ((result = sorted_state[(unsigned char) PP(p2, p_stat)] - \
764 sorted_state[(unsigned char) PP(p1, p_stat)]) == 0)
766 #define ORDERKEY_PRIO \
767 if ((result = PP(p2, p_priority) - PP(p1, p_priority)) == 0)
769 #define ORDERKEY_KTHREADS \
770 if ((result = (TP(p1, td_proc) == NULL) - (TP(p2, td_proc) == NULL)) == 0)
772 #define ORDERKEY_KTHREADS_PRIO \
773 if ((result = TP(p2, td_pri) - TP(p1, td_pri)) == 0)
775 #define ORDERKEY_RSSIZE \
776 if ((result = VP(p2, vm_rssize) - VP(p1, vm_rssize)) == 0)
778 #define ORDERKEY_MEM \
779 if ( (result = PROCSIZE(p2) - PROCSIZE(p1)) == 0 )
781 /* compare_cpu - the comparison function for sorting by cpu percentage */
785 compare_cpu(struct proc **pp1, struct proc **pp2)
787 proc_compare(struct proc **pp1, struct proc **pp2)
790 register struct kinfo_proc *p1;
791 register struct kinfo_proc *p2;
793 register pctcpu lresult;
795 /* remove one level of indirection */
796 p1 = *(struct kinfo_proc **) pp1;
797 p2 = *(struct kinfo_proc **) pp2;
811 /* compare routines */
812 int compare_size(), compare_res(), compare_time(), compare_prio(), compare_thr();
814 int (*proc_compares[])() = {
824 /* compare_size - the comparison function for sorting by total memory usage */
827 compare_size(struct proc **pp1, struct proc **pp2)
829 register struct kinfo_proc *p1;
830 register struct kinfo_proc *p2;
832 register pctcpu lresult;
834 /* remove one level of indirection */
835 p1 = *(struct kinfo_proc **) pp1;
836 p2 = *(struct kinfo_proc **) pp2;
849 /* compare_res - the comparison function for sorting by resident set size */
852 compare_res(struct proc **pp1, struct proc **pp2)
854 register struct kinfo_proc *p1;
855 register struct kinfo_proc *p2;
857 register pctcpu lresult;
859 /* remove one level of indirection */
860 p1 = *(struct kinfo_proc **) pp1;
861 p2 = *(struct kinfo_proc **) pp2;
874 /* compare_time - the comparison function for sorting by total cpu time */
877 compare_time(struct proc **pp1, struct proc **pp2)
879 register struct kinfo_proc *p1;
880 register struct kinfo_proc *p2;
882 register pctcpu lresult;
884 /* remove one level of indirection */
885 p1 = *(struct kinfo_proc **) pp1;
886 p2 = *(struct kinfo_proc **) pp2;
891 ORDERKEY_KTHREADS_PRIO
901 /* compare_prio - the comparison function for sorting by cpu percentage */
904 compare_prio(struct proc **pp1, struct proc **pp2)
906 register struct kinfo_proc *p1;
907 register struct kinfo_proc *p2;
909 register pctcpu lresult;
911 /* remove one level of indirection */
912 p1 = *(struct kinfo_proc **) pp1;
913 p2 = *(struct kinfo_proc **) pp2;
916 ORDERKEY_KTHREADS_PRIO
929 compare_thr(struct proc **pp1, struct proc **pp2)
931 register struct kinfo_proc *p1;
932 register struct kinfo_proc *p2;
934 register pctcpu lresult;
936 /* remove one level of indirection */
937 p1 = *(struct kinfo_proc **) pp1;
938 p2 = *(struct kinfo_proc **) pp2;
941 ORDERKEY_KTHREADS_PRIO
956 * proc_owner(pid) - returns the uid that owns process "pid", or -1 if
957 * the process does not exist.
958 * It is EXTREMLY IMPORTANT that this function work correctly.
959 * If top runs setuid root (as in SVR4), then this function
960 * is the only thing that stands in the way of a serious
961 * security problem. It validates requests for the "kill"
962 * and "renice" commands.
965 int proc_owner(int pid)
968 register struct kinfo_proc **prefp;
969 register struct kinfo_proc *pp;
976 if (PP(pp, p_pid) == (pid_t)pid)
978 return((int)EP(pp, e_ucred.cr_ruid));
986 * swapmode is based on a program called swapinfo written
987 * by Kevin Lahey <kml@rokkaku.atl.ga.us>.
990 #define SVAR(var) __STRING(var) /* to force expansion */
991 #define KGET(idx, var) \
992 KGET1(idx, &var, sizeof(var), SVAR(var))
993 #define KGET1(idx, p, s, msg) \
994 KGET2(nlst[idx].n_value, p, s, msg)
995 #define KGET2(addr, p, s, msg) \
996 if (kvm_read(kd, (u_long)(addr), p, s) != s) { \
997 warnx("cannot read %s: %s", msg, kvm_geterr(kd)); \
1000 #define KGETRET(addr, p, s, msg) \
1001 if (kvm_read(kd, (u_long)(addr), p, s) != s) { \
1002 warnx("cannot read %s: %s", msg, kvm_geterr(kd)); \
1008 swapmode(int *retavail, int *retfree)
1011 int pagesize = getpagesize();
1012 struct kvm_swap swapary[1];
1017 #define CONVERT(v) ((quad_t)(v) * pagesize / 1024)
1019 n = kvm_getswapinfo(kd, swapary, 1, 0);
1020 if (n < 0 || swapary[0].ksw_total == 0)
1023 *retavail = CONVERT(swapary[0].ksw_total);
1024 *retfree = CONVERT(swapary[0].ksw_total - swapary[0].ksw_used);
1026 n = (int)((double)swapary[0].ksw_used * 100.0 /
1027 (double)swapary[0].ksw_total);