/* Copyright (C) 1998-99 Martin Baulig This file is part of LibGTop 1.0. Contributed by Martin Baulig , April 1998. LibGTop is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. LibGTop is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with LibGTop; see the file COPYING. If not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include "safeio.h" #include "glibtop_private.h" #include #include #include #include #define GLIBTOP_PROCLIST_FLAGS 3 static const unsigned long _glibtop_sysdeps_proclist = (1L << GLIBTOP_PROCLIST_TOTAL) + (1L << GLIBTOP_PROCLIST_NUMBER) + (1L << GLIBTOP_PROCLIST_SIZE); /* Init function. */ void _glibtop_init_proclist_s (glibtop *server) { server->sysdeps.proclist = _glibtop_sysdeps_proclist; } #define BLOCK_COUNT 256 #define BLOCK_SIZE (BLOCK_COUNT * sizeof (pid_t)) /* Fetch list of currently running processes. * * IMPORTANT NOTE: * On error, this function MUST return NULL and set buf->flags to zero ! * On success, it returnes a pointer to a list of buf->number elements * each buf->size big. The total size is stored in buf->total. */ pid_t* glibtop_get_proclist_s (glibtop *server, glibtop_proclist *buf, gint64 which, gint64 arg) { DIR *proc; struct dirent *entry; char buffer [BUFSIZ]; unsigned count, total, pid = 0, mask; pid_t pids [BLOCK_COUNT], *pids_chain = NULL; unsigned pids_size = 0, pids_offset = 0, new_size; struct stat statb; int len, ok; memset (buf, 0, sizeof (glibtop_proclist)); mask = which & ~GLIBTOP_KERN_PROC_MASK; which &= GLIBTOP_KERN_PROC_MASK; /* Check if the user wanted only one process */ if(which == GLIBTOP_KERN_PROC_PID) { if(mask) { #ifdef HAVE_PROCFS_H struct psinfo psinfo; #else struct prpsinfo psinfo; #endif if(glibtop_get_proc_data_psinfo_s(server, &psinfo, pid)) return NULL; if(mask & GLIBTOP_EXCLUDE_IDLE && !psinfo.pr_pctcpu) return NULL; if(mask & GLIBTOP_EXCLUDE_SYSTEM && psinfo.pr_flag & SSYS) return NULL; if(mask & GLIBTOP_EXCLUDE_NOTTY && psinfo.pr_ttydev == PRNODEV) return NULL; } else { sprintf(buffer, "/proc/%lld", arg); if(s_stat(buffer, &statb) < 0) return NULL; } pids_chain = g_malloc(sizeof(pid_t)); *pids_chain = pid; return pids_chain; } proc = opendir ("/proc"); if (!proc) return NULL; /* read every every entry in /proc */ for (count = total = 0, entry = readdir (proc); entry; entry = readdir (proc)) { ok = 1; len = strlen (entry->d_name); /* does it consist entirely of digits? */ /* It does, except for "." and "..". Let's speed up */ if(entry->d_name[0] == '.') continue; /* convert it in a number */ pid = (unsigned)atol(entry->d_name); #ifdef HAVE_PROCFS_H /* Can we skip it based on the request? We have RUID and RGID in struct stat. But we can't do it like this for LP64 process, because stat() will fail. XXX Unimplemented for now */ if(!mask && which == GLIBTOP_KERN_PROC_RUID) { sprintf (buffer, "/proc/%d", pid); if (s_stat (buffer, &statb)) continue; if (!S_ISDIR (statb.st_mode)) continue; if(statb.st_uid != arg) continue; } if(mask || which != GLIBTOP_KERN_PROC_ALL) { struct psinfo psinfo; if(glibtop_get_proc_data_psinfo_s(server, &psinfo, pid)) continue; if(mask) { if(mask & GLIBTOP_EXCLUDE_IDLE && !psinfo.pr_pctcpu) continue; if(mask & GLIBTOP_EXCLUDE_SYSTEM && psinfo.pr_flag & SSYS) continue; if(mask & GLIBTOP_EXCLUDE_NOTTY && psinfo.pr_ttydev == PRNODEV) continue; } switch(which) { case GLIBTOP_KERN_PROC_PGRP: if(psinfo.pr_pgid != arg) continue; break; case GLIBTOP_KERN_PROC_SESSION: if(psinfo.pr_sid != arg) continue; break; case GLIBTOP_KERN_PROC_TTY: if(psinfo.pr_ttydev != arg) continue; break; case GLIBTOP_KERN_PROC_UID: if(psinfo.pr_euid != arg) continue; break; case GLIBTOP_KERN_PROC_RUID: if(psinfo.pr_uid != arg) continue; break; default: break; } } #endif /* Fine. Now we first try to store it in pids. If this buffer is * full, we copy it to the pids_chain. */ if (count >= BLOCK_COUNT) { /* The following call to g_realloc will be * equivalent to g_malloc () if `pids_chain' is * NULL. We just calculate the new size and copy `pids' * to the beginning of the newly allocated block. */ new_size = pids_size + BLOCK_SIZE; pids_chain = g_realloc (pids_chain, new_size); memcpy (pids_chain + pids_offset, pids, BLOCK_SIZE); pids_size = new_size; pids_offset += BLOCK_COUNT; count = 0; } /* pids is now big enough to hold at least one single pid. */ pids [count++] = pid; total++; } s_closedir (proc); /* count is only zero if an error occured (one a running Linux system, * we have at least one single process). */ if (!count) return NULL; /* The following call to g_realloc will be equivalent to * g_malloc if pids_chain is NULL. We just calculate the * new size and copy pids to the beginning of the newly allocated * block. */ new_size = pids_size + count * sizeof (pid_t); pids_chain = g_realloc (pids_chain, new_size); memcpy (pids_chain + pids_offset, pids, count * sizeof (pid_t)); pids_size = new_size; pids_offset += BLOCK_COUNT; /* Since everything is ok now, we can set buf->flags, fill in the * remaining fields and return the `pids_chain'. */ buf->flags = _glibtop_sysdeps_proclist; buf->size = sizeof (pid_t); buf->number = total; buf->total = buf->number * buf->size; return pids_chain; }