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
|
|
|
*
|
2005-10-06 12:10:48 +00:00
|
|
|
* Licensed under the GPL v2, see the file LICENSE in this tarball.
|
2001-03-16 22:47:14 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <ctype.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include "libbb.h"
|
|
|
|
|
|
|
|
/* 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-03-06 20:47:33 +00:00
|
|
|
long* find_pid_by_name( const char* pidName)
|
2001-03-16 22:47:14 +00:00
|
|
|
{
|
2002-10-22 12:21:15 +00:00
|
|
|
long* pidList;
|
2001-03-16 22:47:14 +00:00
|
|
|
int i=0;
|
2002-10-22 12:21:15 +00:00
|
|
|
procps_status_t * p;
|
2001-03-16 22:47:14 +00:00
|
|
|
|
2002-10-22 12:21:15 +00:00
|
|
|
pidList = xmalloc(sizeof(long));
|
2005-10-06 12:10:48 +00:00
|
|
|
while ((p = procps_scan(0)) != 0)
|
2005-05-03 06:25:50 +00:00
|
|
|
{
|
2003-08-06 08:22:10 +00:00
|
|
|
if (strncmp(p->short_cmd, pidName, COMM_LEN-1) == 0) {
|
2001-12-06 14:52:32 +00:00
|
|
|
pidList=xrealloc( pidList, sizeof(long) * (i+2));
|
2002-10-22 12:21:15 +00:00
|
|
|
pidList[i++]=p->pid;
|
2001-03-16 22:47:14 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-10-22 12:21:15 +00:00
|
|
|
pidList[i] = i==0 ? -1 : 0;
|
2001-03-16 22:47:14 +00:00
|
|
|
return pidList;
|
|
|
|
}
|
|
|
|
|
2006-03-06 20:47:33 +00:00
|
|
|
long *pidlist_reverse(long *pidList)
|
2005-10-06 12:10:48 +00:00
|
|
|
{
|
|
|
|
int i=0;
|
2005-10-07 15:44:37 +00:00
|
|
|
while (pidList[i] > 0 && ++i);
|
2005-10-06 12:10:48 +00:00
|
|
|
if ( i-- > 0) {
|
|
|
|
long k;
|
|
|
|
int j;
|
|
|
|
for (j = 0; i > j; i--, j++) {
|
|
|
|
k = pidList[i];
|
|
|
|
pidList[i] = pidList[j];
|
|
|
|
pidList[j] = k;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return pidList;
|
|
|
|
}
|