|
|
researchv10 Norman
#include <stdio.h>
#include "ps.h"
#include <sys/text.h>
#include <sys/inode.h>
#include <sys/file.h>
#define Error(msg) return (fprintf(stderr, "%s %s: %s\n", progname, s, msg), \
-1)
#define Reject return (close(fd), -1)
#define Accept return fd
doselect(s, pp, up)
char *s; register struct proc *pp; register struct user *up;
{
char *error; register Select *sp;
register int fd;
up->u_procp = 0;
if ((fd = getproc(s, pp)) == -1)
return -1;
if (!Nflag && !tflag && !Fflag) {
if (!aflag && !rflag && pp->p_uid != myuid && pp->p_pid != mypid)
Reject;
if (error = getuarea(fd, pp, up))
Error(error);
if (!aflag && rflag && up->u_uid != myuid && up->u_ruid != myuid)
Reject;
if (!xflag && xreject(pp, up))
Reject;
Accept;
}
for (sp=selbeg; sp<selend; sp++) {
if (sp->flag & SELTTY) {
if (error = getuarea(fd, pp, up))
Error(error);
if (strncmp(sp->id, gettty(up->u_ttydev, up->u_ttyino), 5))
continue;
if (!(sp->flag & SELXFL) && xreject(pp, up))
continue;
Accept;
} else if (sp->flag & SELFIL) {
if (error = getuarea(fd, pp, up))
Error(error);
if (fdselect(sp->dev, sp->ino, pp, up))
Accept;
} else if (atoi(sp->id) == pp->p_pid) {
if (error = getuarea(fd, pp, up))
Error(error);
Accept;
}
}
Reject;
}
xreject(pp, up)
register struct proc *pp; register struct user *up;
{
return (pp->p_stat != SSTOP &&
(strcmp(up->u_comm, "sh") == 0 ||
strcmp(up->u_comm, "csh") == 0 ||
strcmp(up->u_comm, "init") == 0 ||
up->u_comm[0] == 0));
}
fdselect(dev, ino, pp, up)
register struct proc *pp; register struct user *up;
{
register k;
struct text x; struct file f; struct inode i;
if (Kread(pp->p_textp, &x) && Kread(x.x_iptr, &i) &&
dev == i.i_dev && ino == i.i_number)
return 1;
if (Kread(up->u_cdir, &i) && dev == i.i_dev && ino == i.i_number)
return 1;
if (Kread(up->u_rdir, &i) && dev == i.i_dev && ino == i.i_number)
return 1;
for (k = 0; k < NOFILE; k++) {
if (!Kread(up->u_ofile[k], &f) || !Kread(f.f_inode, &i))
continue;
if (dev == i.i_dev && ino == i.i_number)
return 1;
}
return 0;
}
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.