DIR *dir;
/* Fields are set to 0/NULL if failed to determine (or not requested) */
char *cmd;
+ char *argv0;
+ /*char *exe;*/
USE_SELINUX(char *context;)
/* Everything below must contain no ptrs to malloc'ed data:
* it is memset(0) for each process in procps_scan() */
PSSCAN_UIDGID = 1 << 4,
PSSCAN_COMM = 1 << 5,
PSSCAN_CMD = 1 << 6,
- PSSCAN_STATE = 1 << 7,
- PSSCAN_VSZ = 1 << 8,
- PSSCAN_RSS = 1 << 9,
- PSSCAN_STIME = 1 << 10,
- PSSCAN_UTIME = 1 << 11,
- PSSCAN_TTY = 1 << 12,
- USE_SELINUX(PSSCAN_CONTEXT = 1 << 13,)
+ PSSCAN_ARGV0 = 1 << 7,
+ PSSCAN_EXE = 1 << 8, /* not implemented yet */
+ PSSCAN_STATE = 1 << 9,
+ PSSCAN_VSZ = 1 << 10,
+ PSSCAN_RSS = 1 << 11,
+ PSSCAN_STIME = 1 << 12,
+ PSSCAN_UTIME = 1 << 13,
+ PSSCAN_TTY = 1 << 14,
+ USE_SELINUX(PSSCAN_CONTEXT = 1 << 15,)
/* These are all retrieved from proc/NN/stat in one go: */
PSSCAN_STAT = PSSCAN_PPID | PSSCAN_PGID | PSSCAN_SID
| PSSCAN_COMM | PSSCAN_STATE
and therefore comm field contains "exe".
*/
+static const char *bb_basename(const char *name)
+{
+ const char *cp = strrchr(name, '/');
+ if (cp)
+ return cp + 1;
+ return name;
+}
+
/* find_pid_by_name()
*
* Modified by Vladimir Oleynik for use with libbb/procps.c
procps_status_t* p = NULL;
pidList = xmalloc(sizeof(*pidList));
- while ((p = procps_scan(p, PSSCAN_PID|PSSCAN_COMM))) {
- if (strncmp(p->comm, procName, sizeof(p->comm)-1) == 0) {
+ 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)
+ /* TOOD: we can also try exe, do we want that? */
+ ) {
pidList = xrealloc(pidList, sizeof(*pidList) * (i+2));
pidList[i++] = p->pid;
}
return ret;
}
-procps_status_t* alloc_procps_scan(int flags)
+procps_status_t *alloc_procps_scan(int flags)
{
procps_status_t* sp = xzalloc(sizeof(procps_status_t));
sp->dir = xopendir("/proc");
#endif
void BUG_comm_size(void);
-procps_status_t* procps_scan(procps_status_t* sp, int flags)
+procps_status_t *procps_scan(procps_status_t* sp, int flags)
{
struct dirent *entry;
char buf[PROCPS_BUFSIZE];
}
- if (flags & PSSCAN_CMD) {
- free(sp->cmd);
- sp->cmd = NULL;
+ if (flags & (PSSCAN_CMD|PSSCAN_ARGV0)) {
+ if (sp->argv0) {
+ free(sp->argv0);
+ sp->argv0 = NULL;
+ }
+ if (sp->cmd) {
+ free(sp->cmd);
+ sp->cmd = NULL;
+ }
strcpy(filename_tail, "/cmdline");
+ /* TODO: to get rid of size limits, read into malloc buf,
+ * then realloc it down to real size. */
n = read_to_buf(filename, buf);
if (n <= 0)
break;
- if (buf[n-1] == '\n') {
- if (!--n)
- break;
- buf[n] = '\0';
+ if (flags & PSSCAN_ARGV0)
+ sp->argv0 = xstrdup(buf);
+ if (flags & PSSCAN_CMD) {
+ do {
+ n--;
+ if ((unsigned char)(buf[n]) < ' ')
+ buf[n] = ' ';
+ } while (n);
+ sp->cmd = xstrdup(buf);
}
- do {
- n--;
- if ((unsigned char)(buf[n]) < ' ')
- buf[n] = ' ';
- } while (n);
- sp->cmd = xstrdup(buf);
}
break;
}
unsigned pid, ppid;
unsigned uid;
char state[4];
- char comm[COMM_LEN];
+/* TODO: read /proc/$PID/cmdline only for processes which are displayed */
+ char cmd[64];
} top_status_t;
typedef struct jiffy_counts_t{
#endif
);
if (col > 0)
- printf("%.*s", col, s->comm);
+ printf("%.*s", col, s->cmd);
/* printf(" %d/%d %lld/%lld", s->pcpu, total_pcpu,
jif.busy - prev_jif.busy, jif.total - prev_jif.total); */
s++;
| PSSCAN_UTIME
| PSSCAN_STATE
| PSSCAN_COMM
+ | PSSCAN_CMD
| PSSCAN_SID
| PSSCAN_UIDGID
))) {
#endif
top[n].uid = p->uid;
strcpy(top[n].state, p->state);
- strcpy(top[n].comm, p->comm);
+ if (p->cmd)
+ safe_strncpy(top[n].cmd, p->cmd, sizeof(top[n].cmd));
+ else /* mimic ps */
+ sprintf(top[n].cmd, "[%s]", p->comm);
}
if (ntop == 0) {
bb_error_msg_and_die("no process info in /proc");
continue;
}
do_stats();
+/* TODO: we don't need to sort all 10000 processes, we need to find top 24! */
qsort(top, ntop, sizeof(top_status_t), (void*)mult_lvl_cmp);
#else
qsort(top, ntop, sizeof(top_status_t), (void*)sort_function);