/* $OpenBSD: machine.c,v 1.86 2016/05/11 08:11:27 edd Exp $	 */

/*-

 * Copyright (c) 1994 Thorsten Lockert <tholo@sigmasoft.com>

 * All rights reserved.

 *

 * 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. The name of the author may not be used to endorse or promote products

 *    derived from this software without specific prior written permission.

 *

 * THIS SOFTWARE IS PROVIDED ``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 AUTHOR 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.

 *

 * AUTHOR:  Thorsten Lockert <tholo@sigmasoft.com>

 *          Adapted from BSD4.4 by Christos Zoulas <christos@ee.cornell.edu>

 *          Patch for process wait display by Jarl F. Greipsland <jarle@idt.unit.no>

 *	    Patch for -DORDER by Kenneth Stailey <kstailey@disclosure.com>

 *	    Patch for new swapctl(2) by Tobias Weingartner <weingart@openbsd.org>

 */

#include <sys/param.h>	/* DEV_BSIZE MAXCOMLEN PZERO */

#include <sys/types.h>

#include <sys/signal.h>

#include <sys/mount.h>

#include <sys/proc.h>

#include <sys/sched.h>

#include <sys/swap.h>

#include <sys/sysctl.h>

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <unistd.h>

#include <err.h>

#include <errno.h>

#include "top.h"

#include "display.h"

#include "machine.h"

#include "utils.h"

static int	swapmode(int *, int *);

static char	*state_abbr(struct kinfo_proc *);

static char	*format_comm(struct kinfo_proc *);

static int	cmd_matches(struct kinfo_proc *, char *);

static char	**get_proc_args(struct kinfo_proc *);

/* get_process_info passes back a handle.  This is what it looks like: */

struct handle {

	struct kinfo_proc **next_proc;	/* points to next valid proc pointer */

	int		remaining;	/* number of pointers remaining */

};

/* what we consider to be process size: */

#define PROCSIZE(pp) ((pp)->p_vm_tsize + (pp)->p_vm_dsize + (pp)->p_vm_ssize)

/*

 *  These definitions control the format of the per-process area

 */

static char header[] =

	"  PID X        PRI NICE  SIZE   RES STATE     WAIT      TIME    CPU COMMAND";

/* 0123456   -- field to fill in starts at header+6 */

#define UNAME_START 6

#define Proc_format \

	"%5d %-8.8s %3d %4d %5s %5s %-9s %-7.7s %6s %5.2f%% %s"

/* process state names for the "STATE" column of the display */

/*

 * the extra nulls in the string "run" are for adding a slash and the

 * processor number when needed

 */

char	*state_abbrev[] = {

	"", "start", "run", "sleep", "stop", "zomb", "dead", "onproc"

};

/* these are for calculating cpu state percentages */

static int64_t     **cp_time;

static int64_t     **cp_old;

static int64_t     **cp_diff;

/* these are for detailing the process states */

int process_states[8];

char *procstatenames[] = {

	"", " starting, ", " running, ", " idle, ",

	" stopped, ", " zombie, ", " dead, ", " on processor, ",

	NULL

};

/* these are for detailing the cpu states */

int64_t *cpu_states;

char *cpustatenames[] = {

	"user", "nice", "system", "interrupt", "idle", NULL

};

/* these are for detailing the memory statistics */

int memory_stats[10];

char *memorynames[] = {

	"Real: ", "K/", "K act/tot ", "Free: ", "K ",

	"Cache: ", "K ",

	"Swap: ", "K/", "K",

	NULL

};

/* these are names given to allowed sorting orders -- first is default */

char	*ordernames[] = {

	"cpu", "size", "res", "time", "pri", "pid", "command", NULL

};

/* these are for keeping track of the proc array */

static int      nproc;

static int      onproc = -1;

static int      pref_len;

static struct kinfo_proc *pbase;

static struct kinfo_proc **pref;

/* these are for getting the memory statistics */

static int      pageshift;	/* log base 2 of the pagesize */

/* define pagetok in terms of pageshift */

#define pagetok(size) ((size) << pageshift)

int		ncpu;

int		fscale;

unsigned int	maxslp;

int

getfscale(void)

	    &fscale, &size, NULL, 0) < 0)

}

int

getncpu(void)

	int ncpu;

	    &ncpu, &size, NULL, 0) == -1)

}

int

machine_init(struct statics *statics)

	int pagesize, cpu;

		    cp_diff[cpu] == NULL)

	}

	/*

	 * get the page size with "getpagesize" and calculate pageshift from

	 * it

	 */

	}

	/* we only need the amount of log(2)1024 for our conversion */

	/* fill in the statics information */

}

char *

format_header(char *second_field, int show_threads)

	char *ptr;

	else

}

void

get_system_info(struct system_info *si)

	static int sysload_mib[] = {CTL_VM, VM_LOADAVG};

	static int uvmexp_mib[] = {CTL_VM, VM_UVMEXP};

	static int bcstats_mib[] = {CTL_VFS, VFS_GENERIC, VFS_BCACHESTAT};

	struct loadavg sysload;

	struct uvmexp uvmexp;

	struct bcachestats bcstats;

	double *infoloadp;

	size_t size;

	int i;

	int64_t *tmpstate;

			/* convert cp_time2 counts to percentages */

			    cp_old[i], cp_diff[i]);

		}

	} else {

		long cp_time_tmp[CPUSTATES];

		/* convert cp_time counts to percentages */

		    cp_old[0], cp_diff[0]);

	}

	/* get total -- systemwide main memory usage structure */

	}

	}

	/* convert memory stats to Kbytes */

	}

	/* set arrays and strings */

static struct handle handle;

struct kinfo_proc *

getprocs(int op, int arg, int *cnt)

	size_t size;

	static int maxslp_mib[] = {CTL_VM, VM_MAXSLP};

	static struct kinfo_proc *procbase;

	int st;

	}

		/* _kvm_syserr(kd, kd->program, "kvm_getprocs"); */

	}

		/* _kvm_syserr(kd, kd->program, "kvm_getprocs"); */

	}

}

static char **

get_proc_args(struct kinfo_proc *kp)

	static char	**s;

	int		mib[4];

}

static int

cmd_matches(struct kinfo_proc *proc, char *term)

{

	extern int	show_args;

		/* No command filter set */

	} else {

		/* Filter set, process name needs to contain term */

		/* If showing arguments, search those as well */

				/* Failed to get args, so can't search them */

			}

			}

		}

	}

}

caddr_t

get_process_info(struct system_info *si, struct process_select *sel,

    int (*compare) (const void *, const void *))

	int show_idle, show_system, show_threads, show_uid, show_pid, show_cmd;

	int hide_uid;

	int total_procs, active_procs;

	struct kinfo_proc **prefp, *pp;

		/* warnx("%s", kvm_geterr(kd)); */

	}

		    sizeof(struct kinfo_proc *));

	}

	/* get a pointer to the states summary array */

	/* set up flags which define what we are going to select */

	/* count up process states and get pointers to interesting procs */

		/*

		 *  Place pointers to each valid proc structure in pref[].

		 *  Process slots that are actually in use have a non-zero

		 *  status field.  Processes with P_SYSTEM set are system

		 *  processes---these get ignored unless show_system is set.

		 */

		    (show_system || (pp->p_flag & P_SYSTEM) == 0) &&

		    (show_threads || (pp->p_flag & P_THREAD) == 0)) {

			    (show_idle || pp->p_pctcpu != 0 ||

			    pp->p_stat == SRUN) &&

			    (!hide_uid || pp->p_ruid != sel->huid) &&

			    (!show_uid || pp->p_ruid == sel->uid) &&

			    (!show_pid || pp->p_pid == sel->pid) &&

			    (!show_cmd || cmd_matches(pp, sel->command))) {

			}

		}

	}

	/* if requested, sort the "interesting" processes */

		    sizeof(struct kinfo_proc *), compare);

	/* remember active and total counts */

	/* pass back a handle */

}

char fmt[MAX_COLS];	/* static area where result is built */

static char *

state_abbr(struct kinfo_proc *pp)

	static char buf[10];

		    state_abbrev[(unsigned char)pp->p_stat], pp->p_cpuid);

	else

		    state_abbrev[(unsigned char)pp->p_stat]);

}

static char *

format_comm(struct kinfo_proc *kp)

	static char	buf[MAX_COLS];

	char		**p, **s;

	extern int	show_args;

	}

}

char *

format_next_process(caddr_t handle, char *(*get_userid)(uid_t), pid_t *pid,

    int show_threads)

	char *p_wait;

	struct kinfo_proc *pp;

	struct handle *hp;

	int cputime;

	double pct;

	char buf[16];

	/* find and remember the next proc structure */

	/* calculate the base for cpu percentages */

	else

	else

	/* format this entry */

	    pp->p_priority - PZERO, pp->p_nice - NZERO,

	    format_k(pagetok(PROCSIZE(pp))),

	    format_k(pagetok(pp->p_vm_rssize)),

	    (pp->p_stat == SSLEEP && pp->p_slptime > maxslp) ?

	    "idle" : state_abbr(pp),

	    p_wait, format_time(cputime), 100.0 * pct,

	    printable(format_comm(pp)));

	/* return the result */

}

/* comparison routine for qsort */

static unsigned char sorted_state[] =

{

	0,			/* not used		 */

	4,			/* start		 */

	5,			/* run			 */

	2,			/* sleep		 */

	3,			/* stop			 */

	1			/* zombie		 */

};

/*

 *  proc_compares - comparison functions for "qsort"

 */

/*

 * First, the possible comparison keys.  These are defined in such a way

 * that they can be merely listed in the source code to define the actual

 * desired ordering.

 */

#define ORDERKEY_PCTCPU \

	if ((result = (int)(p2->p_pctcpu - p1->p_pctcpu)) == 0)

#define ORDERKEY_CPUTIME \

	if ((result = p2->p_rtime_sec - p1->p_rtime_sec) == 0) \

		if ((result = p2->p_rtime_usec - p1->p_rtime_usec) == 0)

#define ORDERKEY_STATE \

	if ((result = sorted_state[(unsigned char)p2->p_stat] - \

	    sorted_state[(unsigned char)p1->p_stat])  == 0)

#define ORDERKEY_PRIO \

	if ((result = p2->p_priority - p1->p_priority) == 0)

#define ORDERKEY_RSSIZE \

	if ((result = p2->p_vm_rssize - p1->p_vm_rssize) == 0)

#define ORDERKEY_MEM \

	if ((result = PROCSIZE(p2) - PROCSIZE(p1)) == 0)

#define ORDERKEY_PID \

	if ((result = p1->p_pid - p2->p_pid) == 0)

#define ORDERKEY_CMD \

	if ((result = strcmp(p1->p_comm, p2->p_comm)) == 0)

/* compare_cpu - the comparison function for sorting by cpu percentage */

static int

compare_cpu(const void *v1, const void *v2)

	struct kinfo_proc *p1, *p2;

	int result;

	/* remove one level of indirection */

		;

}

/* compare_size - the comparison function for sorting by total memory usage */

static int

compare_size(const void *v1, const void *v2)

{

	struct kinfo_proc *p1, *p2;

	int result;

	/* remove one level of indirection */

		;

}

/* compare_res - the comparison function for sorting by resident set size */

static int

compare_res(const void *v1, const void *v2)

{

	struct kinfo_proc *p1, *p2;

	int result;

	/* remove one level of indirection */

		;

}

/* compare_time - the comparison function for sorting by CPU time */

static int

compare_time(const void *v1, const void *v2)

{

	struct kinfo_proc *p1, *p2;

	int result;

	/* remove one level of indirection */

		;

}

/* compare_prio - the comparison function for sorting by CPU time */

static int

compare_prio(const void *v1, const void *v2)

{

	struct kinfo_proc *p1, *p2;

	int result;

	/* remove one level of indirection */

		;

}

static int

compare_pid(const void *v1, const void *v2)

{

	struct kinfo_proc *p1, *p2;

	int result;

	/* remove one level of indirection */

		;

}

static int

compare_cmd(const void *v1, const void *v2)

{

	struct kinfo_proc *p1, *p2;

	int result;

	/* remove one level of indirection */

		;

}

int (*proc_compares[])(const void *, const void *) = {

	compare_cpu,

	compare_size,

	compare_res,

	compare_time,

	compare_prio,

	compare_pid,

	compare_cmd,

	NULL

};

/*

 * proc_owner(pid) - returns the uid that owns process "pid", or -1 if

 *		the process does not exist.

 *		It is EXTREMELY IMPORTANT that this function work correctly.

 *		If top runs setuid root (as in SVR4), then this function

 *		is the only thing that stands in the way of a serious

 *		security problem.  It validates requests for the "kill"

 *		and "renice" commands.

 */

uid_t

proc_owner(pid_t pid)

{

	struct kinfo_proc **prefp, *pp;

	int cnt;

	}

}

/*

 * swapmode is rewritten by Tobias Weingartner <weingart@openbsd.org>

 * to be based on the new swapctl(2) system call.

 */

static int

swapmode(int *used, int *total)

	struct swapent *swdev;

	int nswap, rnswap, i;

	}

	/* if rnswap != nswap, then what? */

	/* Total things up */

		}

	}

}