2006-05-14 07:00:45 +04:00
|
|
|
/* $NetBSD: commands.c,v 1.12 2006/05/14 03:00:45 christos Exp $ */
|
1999-04-12 10:02:25 +04:00
|
|
|
|
1999-02-15 02:54:06 +03:00
|
|
|
/*
|
|
|
|
* Top users/processes display for Unix
|
|
|
|
* Version 3
|
|
|
|
*
|
2002-07-16 04:40:51 +04:00
|
|
|
* Copyright (c) 1984, 1989, William LeFebvre, Rice University
|
|
|
|
* Copyright (c) 1989, 1990, 1992, William LeFebvre, Northwestern University
|
1999-02-15 02:54:06 +03:00
|
|
|
*
|
2002-07-16 04:40:51 +04: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.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 OR HIS EMPLOYER 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.
|
1999-02-15 02:54:06 +03:00
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This file contains the routines that implement some of the interactive
|
|
|
|
* mode commands. Note that some of the commands are implemented in-line
|
|
|
|
* in "main". This is necessary because they change the global state of
|
|
|
|
* "top" (i.e.: changing the number of processes to display).
|
|
|
|
*/
|
2003-06-23 17:05:47 +04:00
|
|
|
#include <sys/cdefs.h>
|
|
|
|
|
|
|
|
#ifndef lint
|
2006-05-14 07:00:45 +04:00
|
|
|
__RCSID("$NetBSD: commands.c,v 1.12 2006/05/14 03:00:45 christos Exp $");
|
2003-06-23 17:05:47 +04:00
|
|
|
#endif
|
1999-02-15 02:54:06 +03:00
|
|
|
|
|
|
|
#include "os.h"
|
|
|
|
#include <ctype.h>
|
|
|
|
#include <signal.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/resource.h>
|
|
|
|
|
1999-02-15 06:55:00 +03:00
|
|
|
#include "top.h"
|
|
|
|
#include "top.local.h"
|
1999-02-15 02:54:06 +03:00
|
|
|
#include "sigdesc.h" /* generated automatically */
|
|
|
|
#include "boolean.h"
|
1999-02-15 06:55:00 +03:00
|
|
|
#include "machine.h"
|
1999-02-15 02:54:06 +03:00
|
|
|
#include "utils.h"
|
1999-03-24 14:57:08 +03:00
|
|
|
#include "commands.h"
|
1999-02-15 02:54:06 +03:00
|
|
|
|
2002-08-03 00:03:36 +04:00
|
|
|
extern const char copyright[];
|
1999-02-15 02:54:06 +03:00
|
|
|
|
|
|
|
/* imported from screen.c */
|
|
|
|
extern int overstrike;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* show_help() - display the help screen; invoked in response to
|
|
|
|
* either 'h' or '?'.
|
|
|
|
*/
|
|
|
|
|
1999-03-24 14:57:08 +03:00
|
|
|
void
|
1999-02-15 06:55:00 +03:00
|
|
|
show_help(statics)
|
|
|
|
struct statics *statics;
|
1999-02-15 02:54:06 +03:00
|
|
|
{
|
|
|
|
printf("Top version %s, %s\n", version_string(), copyright);
|
|
|
|
fputs("\n\n\
|
|
|
|
A top users display for Unix\n\
|
|
|
|
\n\
|
|
|
|
These single-character commands are available:\n\
|
|
|
|
\n\
|
|
|
|
^L - redraw screen\n\
|
|
|
|
q - quit\n\
|
|
|
|
h or ? - help; show this text\n", stdout);
|
|
|
|
|
|
|
|
/* not all commands are availalbe with overstrike terminals */
|
|
|
|
if (overstrike)
|
|
|
|
{
|
|
|
|
fputs("\n\
|
|
|
|
Other commands are also available, but this terminal is not\n\
|
|
|
|
sophisticated enough to handle those commands gracefully.\n\n", stdout);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
fputs("\
|
|
|
|
d - change number of displays to show\n\
|
|
|
|
e - list errors generated by last \"kill\" or \"renice\" command\n\
|
|
|
|
i - toggle the displaying of idle processes\n\
|
|
|
|
I - same as 'i'\n\
|
|
|
|
k - kill processes; send a signal to a list of processes\n\
|
|
|
|
n or # - change number of processes to display\n", stdout);
|
|
|
|
#ifdef ORDER
|
1999-02-15 06:55:00 +03:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
1999-02-15 02:54:06 +03:00
|
|
|
fputs("\
|
1999-02-15 06:55:00 +03:00
|
|
|
o - specify sort order (", stdout);
|
|
|
|
for (i = 0; statics->order_names[i] != NULL; i++)
|
|
|
|
printf("%s%s", i == 0 ? "" : ", ", statics->order_names[i]);
|
|
|
|
puts(")");
|
|
|
|
}
|
1999-02-15 02:54:06 +03:00
|
|
|
#endif
|
|
|
|
fputs("\
|
|
|
|
r - renice a process\n\
|
|
|
|
s - change number of seconds to delay between updates\n\
|
2001-06-20 23:56:35 +04:00
|
|
|
S - toggle showing system processes\n\
|
1999-02-15 02:54:06 +03:00
|
|
|
u - display processes for only one user (+ selects all users)\n\
|
|
|
|
\n\
|
|
|
|
\n", stdout);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Utility routines that help with some of the commands.
|
|
|
|
*/
|
|
|
|
|
|
|
|
char *next_field(str)
|
|
|
|
|
|
|
|
register char *str;
|
|
|
|
|
|
|
|
{
|
|
|
|
if ((str = strchr(str, ' ')) == NULL)
|
|
|
|
{
|
|
|
|
return(NULL);
|
|
|
|
}
|
|
|
|
*str = '\0';
|
|
|
|
while (*++str == ' ') /* loop */;
|
|
|
|
|
|
|
|
/* if there is nothing left of the string, return NULL */
|
|
|
|
/* This fix is dedicated to Greg Earle */
|
|
|
|
return(*str == '\0' ? NULL : str);
|
|
|
|
}
|
|
|
|
|
1999-03-24 14:57:08 +03:00
|
|
|
int
|
1999-02-15 02:54:06 +03:00
|
|
|
scanint(str, intp)
|
|
|
|
|
|
|
|
char *str;
|
|
|
|
int *intp;
|
|
|
|
|
|
|
|
{
|
2004-11-04 10:35:15 +03:00
|
|
|
int val = 0;
|
|
|
|
int ch;
|
1999-02-15 02:54:06 +03:00
|
|
|
|
|
|
|
/* if there is nothing left of the string, flag it as an error */
|
|
|
|
/* This fix is dedicated to Greg Earle */
|
|
|
|
if (*str == '\0')
|
|
|
|
{
|
|
|
|
return(-1);
|
|
|
|
}
|
|
|
|
|
2004-11-04 10:35:15 +03:00
|
|
|
while ((ch = (unsigned char)*str++) != '\0')
|
1999-02-15 02:54:06 +03:00
|
|
|
{
|
|
|
|
if (isdigit(ch))
|
|
|
|
{
|
|
|
|
val = val * 10 + (ch - '0');
|
|
|
|
}
|
|
|
|
else if (isspace(ch))
|
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return(-1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
*intp = val;
|
|
|
|
return(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Some of the commands make system calls that could generate errors.
|
|
|
|
* These errors are collected up in an array of structures for later
|
|
|
|
* contemplation and display. Such routines return a string containing an
|
|
|
|
* error message, or NULL if no errors occurred. The next few routines are
|
|
|
|
* for manipulating and displaying these errors. We need an upper limit on
|
|
|
|
* the number of errors, so we arbitrarily choose 20.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define ERRMAX 20
|
|
|
|
|
|
|
|
struct errs /* structure for a system-call error */
|
|
|
|
{
|
|
|
|
int errnum; /* value of errno (that is, the actual error) */
|
|
|
|
char *arg; /* argument that caused the error */
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct errs errs[ERRMAX];
|
|
|
|
static int errcnt;
|
|
|
|
static char *err_toomany = " too many errors occurred";
|
|
|
|
static char *err_listem =
|
|
|
|
" Many errors occurred. Press `e' to display the list of errors.";
|
|
|
|
|
|
|
|
/* These macros get used to reset and log the errors */
|
|
|
|
#define ERR_RESET errcnt = 0
|
|
|
|
#define ERROR(p, e) if (errcnt >= ERRMAX) \
|
|
|
|
{ \
|
|
|
|
return(err_toomany); \
|
|
|
|
} \
|
|
|
|
else \
|
|
|
|
{ \
|
|
|
|
errs[errcnt].arg = (p); \
|
|
|
|
errs[errcnt++].errnum = (e); \
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* err_string() - return an appropriate error string. This is what the
|
|
|
|
* command will return for displaying. If no errors were logged, then
|
|
|
|
* return NULL. The maximum length of the error string is defined by
|
|
|
|
* "STRMAX".
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define STRMAX 80
|
|
|
|
|
|
|
|
char *err_string()
|
|
|
|
|
|
|
|
{
|
|
|
|
register struct errs *errp;
|
|
|
|
register int cnt = 0;
|
|
|
|
register int first = Yes;
|
|
|
|
register int currerr = -1;
|
|
|
|
int stringlen; /* characters still available in "string" */
|
|
|
|
static char string[STRMAX];
|
|
|
|
|
|
|
|
/* if there are no errors, return NULL */
|
|
|
|
if (errcnt == 0)
|
|
|
|
{
|
|
|
|
return(NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* sort the errors */
|
|
|
|
qsort((char *)errs, errcnt, sizeof(struct errs), err_compar);
|
|
|
|
|
|
|
|
/* need a space at the front of the error string */
|
|
|
|
string[0] = ' ';
|
|
|
|
string[1] = '\0';
|
|
|
|
stringlen = STRMAX - 2;
|
|
|
|
|
|
|
|
/* loop thru the sorted list, building an error string */
|
|
|
|
while (cnt < errcnt)
|
|
|
|
{
|
|
|
|
errp = &(errs[cnt++]);
|
|
|
|
if (errp->errnum != currerr)
|
|
|
|
{
|
|
|
|
if (currerr != -1)
|
|
|
|
{
|
|
|
|
if ((stringlen = str_adderr(string, stringlen, currerr)) < 2)
|
|
|
|
{
|
|
|
|
return(err_listem);
|
|
|
|
}
|
2003-07-12 18:08:37 +04:00
|
|
|
/* we know there's more */
|
|
|
|
(void) strlcat(string, "; ", sizeof(string));
|
1999-02-15 02:54:06 +03:00
|
|
|
}
|
|
|
|
currerr = errp->errnum;
|
|
|
|
first = Yes;
|
|
|
|
}
|
|
|
|
if ((stringlen = str_addarg(string, stringlen, errp->arg, first)) ==0)
|
|
|
|
{
|
|
|
|
return(err_listem);
|
|
|
|
}
|
|
|
|
first = No;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* add final message */
|
|
|
|
stringlen = str_adderr(string, stringlen, currerr);
|
|
|
|
|
|
|
|
/* return the error string */
|
|
|
|
return(stringlen == 0 ? err_listem : string);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* str_adderr(str, len, err) - add an explanation of error "err" to
|
|
|
|
* the string "str".
|
|
|
|
*/
|
|
|
|
|
1999-03-24 14:57:08 +03:00
|
|
|
int
|
1999-02-15 02:54:06 +03:00
|
|
|
str_adderr(str, len, err)
|
|
|
|
|
|
|
|
char *str;
|
|
|
|
int len;
|
|
|
|
int err;
|
|
|
|
|
|
|
|
{
|
|
|
|
register char *msg;
|
|
|
|
register int msglen;
|
|
|
|
|
|
|
|
msg = err == 0 ? "Not a number" : errmsg(err);
|
|
|
|
msglen = strlen(msg) + 2;
|
|
|
|
if (len <= msglen)
|
|
|
|
{
|
|
|
|
return(0);
|
|
|
|
}
|
2003-07-12 18:08:37 +04:00
|
|
|
(void) strlcat(str, ": ", len);
|
|
|
|
(void) strlcat(str, msg, len);
|
1999-02-15 02:54:06 +03:00
|
|
|
return(len - msglen);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* str_addarg(str, len, arg, first) - add the string argument "arg" to
|
|
|
|
* the string "str". This is the first in the group when "first"
|
|
|
|
* is set (indicating that a comma should NOT be added to the front).
|
|
|
|
*/
|
|
|
|
|
1999-03-24 14:57:08 +03:00
|
|
|
int
|
1999-02-15 02:54:06 +03:00
|
|
|
str_addarg(str, len, arg, first)
|
|
|
|
|
|
|
|
char *str;
|
|
|
|
int len;
|
|
|
|
char *arg;
|
|
|
|
int first;
|
|
|
|
|
|
|
|
{
|
|
|
|
register int arglen;
|
|
|
|
|
|
|
|
arglen = strlen(arg);
|
|
|
|
if (!first)
|
|
|
|
{
|
|
|
|
arglen += 2;
|
|
|
|
}
|
|
|
|
if (len <= arglen)
|
|
|
|
{
|
|
|
|
return(0);
|
|
|
|
}
|
|
|
|
if (!first)
|
|
|
|
{
|
2003-07-12 18:08:37 +04:00
|
|
|
(void) strlcat(str, ", ", len);
|
1999-02-15 02:54:06 +03:00
|
|
|
}
|
2003-07-12 18:08:37 +04:00
|
|
|
(void) strlcat(str, arg, len);
|
1999-02-15 02:54:06 +03:00
|
|
|
return(len - arglen);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* err_compar(p1, p2) - comparison routine used by "qsort"
|
|
|
|
* for sorting errors.
|
|
|
|
*/
|
|
|
|
|
1999-03-24 14:57:08 +03:00
|
|
|
int
|
|
|
|
err_compar(e1, e2)
|
1999-02-15 02:54:06 +03:00
|
|
|
|
1999-03-24 14:57:08 +03:00
|
|
|
const void *e1, *e2;
|
1999-02-15 02:54:06 +03:00
|
|
|
|
|
|
|
{
|
1999-03-24 14:57:08 +03:00
|
|
|
register const struct errs *p1 = e1, *p2 = e2;
|
1999-02-15 02:54:06 +03:00
|
|
|
register int result;
|
|
|
|
|
|
|
|
if ((result = p1->errnum - p2->errnum) == 0)
|
|
|
|
{
|
|
|
|
return(strcmp(p1->arg, p2->arg));
|
|
|
|
}
|
|
|
|
return(result);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* error_count() - return the number of errors currently logged.
|
|
|
|
*/
|
|
|
|
|
1999-03-24 14:57:08 +03:00
|
|
|
int
|
1999-02-15 02:54:06 +03:00
|
|
|
error_count()
|
|
|
|
|
|
|
|
{
|
|
|
|
return(errcnt);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* show_errors() - display on stdout the current log of errors.
|
|
|
|
*/
|
|
|
|
|
1999-03-24 14:57:08 +03:00
|
|
|
void
|
1999-02-15 02:54:06 +03:00
|
|
|
show_errors()
|
|
|
|
|
|
|
|
{
|
|
|
|
register int cnt = 0;
|
|
|
|
register struct errs *errp = errs;
|
|
|
|
|
|
|
|
printf("%d error%s:\n\n", errcnt, errcnt == 1 ? "" : "s");
|
|
|
|
while (cnt++ < errcnt)
|
|
|
|
{
|
|
|
|
printf("%5s: %s\n", errp->arg,
|
|
|
|
errp->errnum == 0 ? "Not a number" : errmsg(errp->errnum));
|
|
|
|
errp++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* kill_procs(str) - send signals to processes, much like the "kill"
|
|
|
|
* command does; invoked in response to 'k'.
|
|
|
|
*/
|
|
|
|
|
|
|
|
char *kill_procs(str)
|
|
|
|
|
|
|
|
char *str;
|
|
|
|
|
|
|
|
{
|
|
|
|
register char *nptr;
|
|
|
|
int signum = SIGTERM; /* default */
|
|
|
|
int procnum;
|
|
|
|
struct sigdesc *sigp;
|
|
|
|
int uid;
|
|
|
|
|
|
|
|
/* reset error array */
|
|
|
|
ERR_RESET;
|
|
|
|
|
|
|
|
/* remember our uid */
|
|
|
|
uid = getuid();
|
|
|
|
|
|
|
|
/* skip over leading white space */
|
2004-11-04 10:35:15 +03:00
|
|
|
while (isspace((unsigned char)*str)) str++;
|
1999-02-15 02:54:06 +03:00
|
|
|
|
|
|
|
if (str[0] == '-')
|
|
|
|
{
|
|
|
|
/* explicit signal specified */
|
|
|
|
if ((nptr = next_field(str)) == NULL)
|
|
|
|
{
|
|
|
|
return(" kill: no processes specified");
|
|
|
|
}
|
|
|
|
|
2004-11-04 10:35:15 +03:00
|
|
|
if (isdigit((unsigned char)str[1]))
|
1999-02-15 02:54:06 +03:00
|
|
|
{
|
|
|
|
(void) scanint(str + 1, &signum);
|
|
|
|
if (signum <= 0 || signum >= NSIG)
|
|
|
|
{
|
|
|
|
return(" invalid signal number");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* translate the name into a number */
|
|
|
|
for (sigp = sigdesc; sigp->name != NULL; sigp++)
|
|
|
|
{
|
|
|
|
if (strcmp(sigp->name, str + 1) == 0)
|
|
|
|
{
|
|
|
|
signum = sigp->number;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* was it ever found */
|
|
|
|
if (sigp->name == NULL)
|
|
|
|
{
|
|
|
|
return(" bad signal name");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* put the new pointer in place */
|
|
|
|
str = nptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* loop thru the string, killing processes */
|
|
|
|
do
|
|
|
|
{
|
|
|
|
if (scanint(str, &procnum) == -1)
|
|
|
|
{
|
|
|
|
ERROR(str, 0);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* check process owner if we're not root */
|
|
|
|
if (uid && (uid != proc_owner(procnum)))
|
|
|
|
{
|
|
|
|
ERROR(str, EACCES);
|
|
|
|
}
|
|
|
|
/* go in for the kill */
|
|
|
|
else if (kill(procnum, signum) == -1)
|
|
|
|
{
|
|
|
|
/* chalk up an error */
|
|
|
|
ERROR(str, errno);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} while ((str = next_field(str)) != NULL);
|
|
|
|
|
|
|
|
/* return appropriate error string */
|
|
|
|
return(err_string());
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* renice_procs(str) - change the "nice" of processes, much like the
|
|
|
|
* "renice" command does; invoked in response to 'r'.
|
|
|
|
*/
|
|
|
|
|
|
|
|
char *renice_procs(str)
|
|
|
|
|
|
|
|
char *str;
|
|
|
|
|
|
|
|
{
|
|
|
|
register char negate;
|
2006-05-14 07:00:45 +04:00
|
|
|
int prio = 0; /* XXX: GCC */
|
1999-02-15 02:54:06 +03:00
|
|
|
int procnum;
|
|
|
|
int uid;
|
|
|
|
|
|
|
|
ERR_RESET;
|
|
|
|
uid = getuid();
|
|
|
|
|
|
|
|
/* allow for negative priority values */
|
|
|
|
if ((negate = (*str == '-')) != 0)
|
|
|
|
{
|
|
|
|
/* move past the minus sign */
|
|
|
|
str++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* use procnum as a temporary holding place and get the number */
|
|
|
|
procnum = scanint(str, &prio);
|
|
|
|
|
|
|
|
/* negate if necessary */
|
|
|
|
if (negate)
|
|
|
|
{
|
|
|
|
prio = -prio;
|
|
|
|
}
|
|
|
|
|
|
|
|
#if defined(PRIO_MIN) && defined(PRIO_MAX)
|
|
|
|
/* check for validity */
|
|
|
|
if (procnum == -1 || prio < PRIO_MIN || prio > PRIO_MAX)
|
|
|
|
{
|
|
|
|
return(" bad priority value");
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* move to the first process number */
|
|
|
|
if ((str = next_field(str)) == NULL)
|
|
|
|
{
|
|
|
|
return(" no processes specified");
|
|
|
|
}
|
|
|
|
|
|
|
|
/* loop thru the process numbers, renicing each one */
|
|
|
|
do
|
|
|
|
{
|
|
|
|
if (scanint(str, &procnum) == -1)
|
|
|
|
{
|
|
|
|
ERROR(str, 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* check process owner if we're not root */
|
|
|
|
else if (uid && (uid != proc_owner(procnum)))
|
|
|
|
{
|
|
|
|
ERROR(str, EACCES);
|
|
|
|
}
|
|
|
|
else if (setpriority(PRIO_PROCESS, procnum, prio) == -1)
|
|
|
|
{
|
|
|
|
ERROR(str, errno);
|
|
|
|
}
|
|
|
|
} while ((str = next_field(str)) != NULL);
|
|
|
|
|
|
|
|
/* return appropriate error string */
|
|
|
|
return(err_string());
|
|
|
|
}
|
|
|
|
|