NetBSD/usr.bin/w/proc_compare.c

128 lines
4.2 KiB
C
Raw Normal View History

2003-01-18 13:52:16 +03:00
/* $NetBSD: proc_compare.c,v 1.11 2003/01/18 10:56:44 thorpej Exp $ */
1996-06-07 05:39:10 +04:00
1993-03-21 12:45:37 +03:00
/*-
1994-05-09 07:35:55 +04:00
* Copyright (c) 1990, 1993
* The Regents of the University of California. All rights reserved.
1993-03-21 12:45:37 +03:00
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
1993-03-21 12:45:37 +03:00
#ifndef lint
1996-06-07 05:39:10 +04:00
#if 0
1994-05-09 07:35:55 +04:00
static char sccsid[] = "@(#)proc_compare.c 8.2 (Berkeley) 9/23/93";
1996-06-07 05:39:10 +04:00
#else
2003-01-18 13:52:16 +03:00
__RCSID("$NetBSD: proc_compare.c,v 1.11 2003/01/18 10:56:44 thorpej Exp $");
1996-06-07 05:39:10 +04:00
#endif
1993-03-21 12:45:37 +03:00
#endif /* not lint */
1994-05-09 07:35:55 +04:00
#include <sys/param.h>
#include <sys/time.h>
#include <sys/sysctl.h>
1994-05-09 07:35:55 +04:00
#include "extern.h"
1993-03-21 12:45:37 +03:00
/*
1994-05-09 07:35:55 +04:00
* Returns 1 if p2 is "better" than p1
1993-03-21 12:45:37 +03:00
*
1994-05-09 07:35:55 +04:00
* The algorithm for picking the "interesting" process is thus:
1993-03-21 12:45:37 +03:00
*
1994-05-09 07:35:55 +04:00
* 1) Only foreground processes are eligible - implied.
* 2) Runnable processes are favored over anything else. The runner
* with the highest cpu utilization is picked (p_estcpu). Ties are
1993-03-21 12:45:37 +03:00
* broken by picking the highest pid.
1994-05-09 07:35:55 +04:00
* 3) The sleeper with the shortest sleep time is next. With ties,
* we pick out just "short-term" sleepers (P_SINTR == 0).
* 4) Further ties are broken by picking the highest pid.
1993-03-21 12:45:37 +03:00
*
1994-05-09 07:35:55 +04:00
* If you change this, be sure to consider making the change in the kernel
* too (^T in kern/tty.c).
1993-03-21 12:45:37 +03:00
*
1994-05-09 07:35:55 +04:00
* TODO - consider whether pctcpu should be used.
1993-03-21 12:45:37 +03:00
*/
2003-01-18 13:52:16 +03:00
#define ISRUN(p) (((p)->p_stat == LSRUN) || ((p)->p_stat == SIDL) || \
((p)->p_stat == LSONPROC))
1994-05-09 07:35:55 +04:00
#define TESTAB(a, b) ((a)<<1 | (b))
#define ONLYA 2
#define ONLYB 1
#define BOTH 3
1993-03-21 12:45:37 +03:00
1994-05-09 07:35:55 +04:00
int
2001-01-05 07:59:21 +03:00
proc_compare(struct kinfo_proc2 *p1, struct kinfo_proc2 *p2)
1993-03-21 12:45:37 +03:00
{
if (p1 == NULL)
return (1);
/*
* see if at least one of them is runnable
*/
1994-05-09 07:35:55 +04:00
switch (TESTAB(ISRUN(p1), ISRUN(p2))) {
1993-03-21 12:45:37 +03:00
case ONLYA:
return (0);
case ONLYB:
return (1);
case BOTH:
/*
* tie - favor one with highest recent cpu utilization
*/
1994-05-05 10:38:53 +04:00
if (p2->p_estcpu > p1->p_estcpu)
1993-03-21 12:45:37 +03:00
return (1);
1994-05-05 10:38:53 +04:00
if (p1->p_estcpu > p2->p_estcpu)
1993-03-21 12:45:37 +03:00
return (0);
return (p2->p_pid > p1->p_pid); /* tie - return highest pid */
}
/*
1994-05-09 07:35:55 +04:00
* weed out zombies
1993-03-21 12:45:37 +03:00
*/
switch (TESTAB(p1->p_stat == SZOMB, p2->p_stat == SZOMB)) {
case ONLYA:
return (1);
case ONLYB:
return (0);
case BOTH:
1994-05-09 07:35:55 +04:00
return (p2->p_pid > p1->p_pid); /* tie - return highest pid */
1993-03-21 12:45:37 +03:00
}
1994-05-09 07:35:55 +04:00
/*
1993-03-21 12:45:37 +03:00
* pick the one with the smallest sleep time
*/
if (p2->p_slptime > p1->p_slptime)
return (0);
if (p1->p_slptime > p2->p_slptime)
return (1);
/*
* favor one sleeping in a non-interruptible sleep
*/
2003-01-18 13:52:16 +03:00
if (p1->p_flag & L_SINTR && (p2->p_flag & L_SINTR) == 0)
1994-05-09 07:35:55 +04:00
return (1);
2003-01-18 13:52:16 +03:00
if (p2->p_flag & L_SINTR && (p1->p_flag & L_SINTR) == 0)
1994-05-09 07:35:55 +04:00
return (0);
return (p2->p_pid > p1->p_pid); /* tie - return highest pid */
1993-03-21 12:45:37 +03:00
}