2001-03-16 22:47:14 +00:00
|
|
|
/* vi: set sw=4 ts=4: */
|
|
|
|
/*
|
|
|
|
* Utility routines.
|
|
|
|
*
|
2004-03-15 08:29:22 +00:00
|
|
|
* Copyright (C) 1999-2004 by Erik Andersen <andersen@codepoet.org>
|
2001-03-16 22:47:14 +00:00
|
|
|
*
|
2006-09-13 16:39:19 +00:00
|
|
|
* Licensed under the GPL v2 or later, see the file LICENSE in this tarball.
|
2001-03-16 22:47:14 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "libbb.h"
|
|
|
|
|
2007-06-23 14:56:43 +00:00
|
|
|
/*
|
|
|
|
In Linux we have three ways to determine "process name":
|
|
|
|
1. /proc/PID/stat has "...(name)...", among other things. It's so-called "comm" field.
|
|
|
|
2. /proc/PID/cmdline's first NUL-terminated string. It's argv[0] from exec syscall.
|
|
|
|
3. /proc/PID/exe symlink. Points to the running executable file.
|
|
|
|
|
|
|
|
kernel threads:
|
|
|
|
comm: thread name
|
|
|
|
cmdline: empty
|
|
|
|
exe: <readlink fails>
|
|
|
|
|
|
|
|
executable
|
|
|
|
comm: first 15 chars of base name
|
|
|
|
(if executable is a symlink, then first 15 chars of symlink name are used)
|
|
|
|
cmdline: argv[0] from exec syscall
|
|
|
|
exe: points to executable (resolves symlink, unlike comm)
|
|
|
|
|
|
|
|
script (an executable with #!/path/to/interpreter):
|
|
|
|
comm: first 15 chars of script's base name (symlinks are not resolved)
|
|
|
|
cmdline: /path/to/interpreter (symlinks are not resolved)
|
|
|
|
(script name is in argv[1], args are pushed into argv[2] etc)
|
|
|
|
exe: points to interpreter's executable (symlinks are resolved)
|
|
|
|
|
|
|
|
If FEATURE_PREFER_APPLETS=y (and more so if FEATURE_SH_STANDALONE=y),
|
|
|
|
some commands started from busybox shell, xargs or find are started by
|
|
|
|
execXXX("/proc/self/exe", applet_name, params....)
|
|
|
|
and therefore comm field contains "exe".
|
|
|
|
*/
|
|
|
|
|
2001-03-16 22:47:14 +00:00
|
|
|
/* find_pid_by_name()
|
2004-03-15 08:29:22 +00:00
|
|
|
*
|
2002-10-22 12:21:15 +00:00
|
|
|
* Modified by Vladimir Oleynik for use with libbb/procps.c
|
2001-03-16 22:47:14 +00:00
|
|
|
* This finds the pid of the specified process.
|
2004-03-15 08:29:22 +00:00
|
|
|
* Currently, it's implemented by rummaging through
|
2001-03-16 22:47:14 +00:00
|
|
|
* the proc filesystem.
|
|
|
|
*
|
|
|
|
* Returns a list of all matching PIDs
|
2005-10-06 12:10:48 +00:00
|
|
|
* It is the caller's duty to free the returned pidlist.
|
2001-03-16 22:47:14 +00:00
|
|
|
*/
|
2006-11-01 09:16:49 +00:00
|
|
|
pid_t* find_pid_by_name(const char* procName)
|
2001-03-16 22:47:14 +00:00
|
|
|
{
|
2006-11-01 09:16:49 +00:00
|
|
|
pid_t* pidList;
|
2006-09-27 14:17:31 +00:00
|
|
|
int i = 0;
|
2006-11-05 00:43:51 +00:00
|
|
|
procps_status_t* p = NULL;
|
2001-03-16 22:47:14 +00:00
|
|
|
|
2006-11-01 09:16:49 +00:00
|
|
|
pidList = xmalloc(sizeof(*pidList));
|
2007-06-30 08:03:26 +00:00
|
|
|
while ((p = procps_scan(p, PSSCAN_PID|PSSCAN_COMM|PSSCAN_ARGV0))) {
|
|
|
|
if (
|
|
|
|
/* we require comm to match and to not be truncated */
|
|
|
|
/* in Linux, if comm is 15 chars, it may be a truncated
|
|
|
|
* name, so we don't allow that to match */
|
|
|
|
(!p->comm[sizeof(p->comm)-2] && strcmp(p->comm, procName) == 0)
|
|
|
|
/* or we require argv0 to match (essential for matching reexeced /proc/self/exe)*/
|
|
|
|
|| (p->argv0 && strcmp(bb_basename(p->argv0), procName) == 0)
|
2007-11-25 04:54:13 +00:00
|
|
|
/* TOOD: we can also try /proc/NUM/exe link, do we want that? */
|
2007-06-30 08:03:26 +00:00
|
|
|
) {
|
2006-11-01 09:16:49 +00:00
|
|
|
pidList = xrealloc(pidList, sizeof(*pidList) * (i+2));
|
2006-09-27 14:17:31 +00:00
|
|
|
pidList[i++] = p->pid;
|
2001-03-16 22:47:14 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-11-01 09:16:49 +00:00
|
|
|
pidList[i] = 0;
|
2001-03-16 22:47:14 +00:00
|
|
|
return pidList;
|
|
|
|
}
|
|
|
|
|
2006-11-01 09:16:49 +00:00
|
|
|
pid_t *pidlist_reverse(pid_t *pidList)
|
2005-10-06 12:10:48 +00:00
|
|
|
{
|
2006-09-27 14:17:31 +00:00
|
|
|
int i = 0;
|
2006-11-01 09:16:49 +00:00
|
|
|
while (pidList[i])
|
|
|
|
i++;
|
|
|
|
if (--i >= 0) {
|
|
|
|
pid_t k;
|
2005-10-06 12:10:48 +00:00
|
|
|
int j;
|
|
|
|
for (j = 0; i > j; i--, j++) {
|
|
|
|
k = pidList[i];
|
|
|
|
pidList[i] = pidList[j];
|
|
|
|
pidList[j] = k;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return pidList;
|
|
|
|
}
|