mirror of
https://git.hardenedbsd.org/hardenedbsd/HardenedBSD.git
synced 2024-12-30 15:38:06 +01:00
940cca66e2
VM structure (eg: credentials etc) and it's highly unlikely we'll ever get to see the "tainted" BSD<=4.3 VM code in public use. Although it indicated the way some things used to be done, it obfuscates things too much.
122 lines
3.5 KiB
C
122 lines
3.5 KiB
C
/*-
|
|
* Copyright (c) 1990, 1993, 1994
|
|
* The Regents of the University of California. 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. 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.
|
|
*
|
|
* $Id: nlist.c,v 1.8 1997/02/22 14:05:04 peter Exp $
|
|
*/
|
|
|
|
#ifndef lint
|
|
static char const sccsid[] = "@(#)nlist.c 8.4 (Berkeley) 4/2/94";
|
|
#endif /* not lint */
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/time.h>
|
|
#include <sys/proc.h>
|
|
#include <sys/resource.h>
|
|
|
|
#include <err.h>
|
|
#include <errno.h>
|
|
#include <kvm.h>
|
|
#include <nlist.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
|
|
#include "ps.h"
|
|
|
|
struct nlist psnl[] = {
|
|
{"_fscale"},
|
|
#define X_FSCALE 0
|
|
{"_ccpu"},
|
|
#define X_CCPU 1
|
|
{"_avail_start"},
|
|
#define X_AVAILSTART 2
|
|
{"_avail_end"},
|
|
#define X_AVAILEND 3
|
|
{NULL}
|
|
};
|
|
|
|
fixpt_t ccpu; /* kernel _ccpu variable */
|
|
int nlistread; /* if nlist already read. */
|
|
int mempages; /* number of pages of phys. memory */
|
|
int fscale; /* kernel _fscale variable */
|
|
|
|
extern kvm_t *kd;
|
|
|
|
#define kread(x, v) \
|
|
kvm_read(kd, psnl[x].n_value, (char *)&v, sizeof v) != sizeof(v)
|
|
|
|
int
|
|
donlist()
|
|
{
|
|
int rval;
|
|
int tmp;
|
|
|
|
rval = 0;
|
|
nlistread = 1;
|
|
if (kvm_nlist(kd, psnl)) {
|
|
nlisterr(psnl);
|
|
eval = 1;
|
|
return (1);
|
|
}
|
|
if (kread(X_FSCALE, fscale)) {
|
|
warnx("fscale: %s", kvm_geterr(kd));
|
|
eval = rval = 1;
|
|
}
|
|
if (kread(X_AVAILEND, mempages)) {
|
|
warnx("avail_start: %s", kvm_geterr(kd));
|
|
eval = rval = 1;
|
|
}
|
|
if (kread(X_AVAILSTART, tmp)) {
|
|
warnx("avail_end: %s", kvm_geterr(kd));
|
|
eval = rval = 1;
|
|
}
|
|
mempages -= tmp;
|
|
mempages /= PAGE_SIZE;
|
|
if (kread(X_CCPU, ccpu)) {
|
|
warnx("ccpu: %s", kvm_geterr(kd));
|
|
eval = rval = 1;
|
|
}
|
|
return (rval);
|
|
}
|
|
|
|
void
|
|
nlisterr(nl)
|
|
struct nlist nl[];
|
|
{
|
|
int i;
|
|
|
|
(void)fprintf(stderr, "ps: nlist: can't find following symbols:");
|
|
for (i = 0; nl[i].n_name != NULL; i++)
|
|
if (nl[i].n_value == 0)
|
|
(void)fprintf(stderr, " %s", nl[i].n_name);
|
|
(void)fprintf(stderr, "\n");
|
|
}
|