| 1 |
/* |
| 2 |
* i-scream libstatgrab |
| 3 |
* http://www.i-scream.org |
| 4 |
* Copyright (C) 2000-2004 i-scream |
| 5 |
* |
| 6 |
* This library is free software; you can redistribute it and/or |
| 7 |
* modify it under the terms of the GNU Lesser General Public |
| 8 |
* License as published by the Free Software Foundation; either |
| 9 |
* version 2.1 of the License, or (at your option) any later version. |
| 10 |
* |
| 11 |
* This library is distributed in the hope that it will be useful, |
| 12 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 14 |
* Lesser General Public License for more details. |
| 15 |
* |
| 16 |
* You should have received a copy of the GNU Lesser General Public |
| 17 |
* License along with this library; if not, write to the Free Software |
| 18 |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA |
| 19 |
* 02111-1307 USA |
| 20 |
* |
| 21 |
* $Id: process_stats.c,v 1.71 2004/04/08 17:20:51 tdb Exp $ |
| 22 |
*/ |
| 23 |
|
| 24 |
#ifdef HAVE_CONFIG_H |
| 25 |
#include "config.h" |
| 26 |
#endif |
| 27 |
|
| 28 |
#include "statgrab.h" |
| 29 |
#include "tools.h" |
| 30 |
#include "vector.h" |
| 31 |
#if defined(SOLARIS) || defined(LINUX) |
| 32 |
#include <stdio.h> |
| 33 |
#include <stdlib.h> |
| 34 |
#include <sys/types.h> |
| 35 |
#include <dirent.h> |
| 36 |
#include <string.h> |
| 37 |
#endif |
| 38 |
|
| 39 |
#ifdef SOLARIS |
| 40 |
#include <procfs.h> |
| 41 |
#include <limits.h> |
| 42 |
#define PROC_LOCATION "/proc" |
| 43 |
#define MAX_FILE_LENGTH PATH_MAX |
| 44 |
#endif |
| 45 |
#ifdef LINUX |
| 46 |
#include <limits.h> |
| 47 |
#include <unistd.h> |
| 48 |
#include <sys/stat.h> |
| 49 |
#include <fcntl.h> |
| 50 |
#define PROC_LOCATION "/proc" |
| 51 |
#define MAX_FILE_LENGTH PATH_MAX |
| 52 |
#endif |
| 53 |
#ifdef ALLBSD |
| 54 |
#include <errno.h> |
| 55 |
#include <stdlib.h> |
| 56 |
#include <sys/param.h> |
| 57 |
#include <sys/sysctl.h> |
| 58 |
#if defined(FREEBSD) || defined(DFBSD) |
| 59 |
#include <sys/user.h> |
| 60 |
#else |
| 61 |
#include <sys/proc.h> |
| 62 |
#endif |
| 63 |
#include <string.h> |
| 64 |
#include <paths.h> |
| 65 |
#include <fcntl.h> |
| 66 |
#include <limits.h> |
| 67 |
#if (defined(FREEBSD) && !defined(FREEBSD5)) || defined(DFBSD) |
| 68 |
#include <kvm.h> |
| 69 |
#endif |
| 70 |
#include <unistd.h> |
| 71 |
#ifdef NETBSD2 |
| 72 |
#include <sys/lwp.h> |
| 73 |
#endif |
| 74 |
#endif |
| 75 |
|
| 76 |
static void proc_state_init(sg_process_stats *s) { |
| 77 |
s->process_name = NULL; |
| 78 |
s->proctitle = NULL; |
| 79 |
} |
| 80 |
|
| 81 |
static void proc_state_destroy(sg_process_stats *s) { |
| 82 |
free(s->process_name); |
| 83 |
free(s->proctitle); |
| 84 |
} |
| 85 |
|
| 86 |
sg_process_stats *sg_get_process_stats(int *entries){ |
| 87 |
VECTOR_DECLARE_STATIC(proc_state, sg_process_stats, 64, |
| 88 |
proc_state_init, proc_state_destroy); |
| 89 |
int proc_state_size = 0; |
| 90 |
sg_process_stats *proc_state_ptr; |
| 91 |
#ifdef ALLBSD |
| 92 |
int mib[4]; |
| 93 |
size_t size; |
| 94 |
struct kinfo_proc *kp_stats; |
| 95 |
int procs, i; |
| 96 |
char *proctitle; |
| 97 |
#if (defined(FREEBSD) && !defined(FREEBSD5)) || defined(DFBSD) |
| 98 |
kvm_t *kvmd; |
| 99 |
char **args, **argsp; |
| 100 |
int argslen = 0; |
| 101 |
#else |
| 102 |
long buflen; |
| 103 |
char *p, *proctitletmp; |
| 104 |
#endif |
| 105 |
#ifdef NETBSD2 |
| 106 |
int lwps; |
| 107 |
struct kinfo_lwp *kl_stats; |
| 108 |
#endif |
| 109 |
#endif |
| 110 |
#if defined(SOLARIS) || defined(LINUX) |
| 111 |
DIR *proc_dir; |
| 112 |
struct dirent *dir_entry; |
| 113 |
char filename[MAX_FILE_LENGTH]; |
| 114 |
FILE *f; |
| 115 |
#ifdef SOLARIS |
| 116 |
psinfo_t process_info; |
| 117 |
#endif |
| 118 |
#ifdef LINUX |
| 119 |
char s; |
| 120 |
/* If someone has a executable of 4k filename length, they deserve to get it truncated :) */ |
| 121 |
char ps_name[4096]; |
| 122 |
char *ptr; |
| 123 |
VECTOR_DECLARE_STATIC(psargs, char, 128, NULL, NULL); |
| 124 |
unsigned long stime, utime, starttime; |
| 125 |
int x; |
| 126 |
int fn; |
| 127 |
int len; |
| 128 |
int rc; |
| 129 |
time_t uptime; |
| 130 |
#endif |
| 131 |
|
| 132 |
#ifdef LINUX |
| 133 |
if ((f=fopen("/proc/uptime", "r")) == NULL) { |
| 134 |
sg_set_error(SG_ERROR_OPEN, "/proc/uptime"); |
| 135 |
return NULL; |
| 136 |
} |
| 137 |
if((fscanf(f,"%lu %*d",&uptime)) != 1){ |
| 138 |
sg_set_error(SG_ERROR_PARSE, NULL); |
| 139 |
return NULL; |
| 140 |
} |
| 141 |
fclose(f); |
| 142 |
#endif |
| 143 |
|
| 144 |
if((proc_dir=opendir(PROC_LOCATION))==NULL){ |
| 145 |
sg_set_error(SG_ERROR_OPENDIR, PROC_LOCATION); |
| 146 |
return NULL; |
| 147 |
} |
| 148 |
|
| 149 |
while((dir_entry=readdir(proc_dir))!=NULL){ |
| 150 |
if(atoi(dir_entry->d_name) == 0) continue; |
| 151 |
|
| 152 |
#ifdef SOLARIS |
| 153 |
snprintf(filename, MAX_FILE_LENGTH, "/proc/%s/psinfo", dir_entry->d_name); |
| 154 |
#endif |
| 155 |
#ifdef LINUX |
| 156 |
snprintf(filename, MAX_FILE_LENGTH, "/proc/%s/stat", dir_entry->d_name); |
| 157 |
#endif |
| 158 |
if((f=fopen(filename, "r"))==NULL){ |
| 159 |
/* Open failed.. Process since vanished, or the path was too long. |
| 160 |
* Ah well, move onwards to the next one */ |
| 161 |
continue; |
| 162 |
} |
| 163 |
#ifdef SOLARIS |
| 164 |
fread(&process_info, sizeof(psinfo_t), 1, f); |
| 165 |
fclose(f); |
| 166 |
#endif |
| 167 |
|
| 168 |
if (VECTOR_RESIZE(proc_state, proc_state_size + 1) < 0) { |
| 169 |
return NULL; |
| 170 |
} |
| 171 |
proc_state_ptr = proc_state+proc_state_size; |
| 172 |
|
| 173 |
#ifdef SOLARIS |
| 174 |
proc_state_ptr->pid = process_info.pr_pid; |
| 175 |
proc_state_ptr->parent = process_info.pr_ppid; |
| 176 |
proc_state_ptr->pgid = process_info.pr_pgid; |
| 177 |
proc_state_ptr->uid = process_info.pr_uid; |
| 178 |
proc_state_ptr->euid = process_info.pr_euid; |
| 179 |
proc_state_ptr->gid = process_info.pr_gid; |
| 180 |
proc_state_ptr->egid = process_info.pr_egid; |
| 181 |
proc_state_ptr->proc_size = (process_info.pr_size) * 1024; |
| 182 |
proc_state_ptr->proc_resident = (process_info.pr_rssize) * 1024; |
| 183 |
proc_state_ptr->time_spent = process_info.pr_time.tv_sec; |
| 184 |
proc_state_ptr->cpu_percent = (process_info.pr_pctcpu * 100.0) / 0x8000; |
| 185 |
proc_state_ptr->nice = (int)process_info.pr_lwp.pr_nice - 20; |
| 186 |
if (sg_update_string(&proc_state_ptr->process_name, |
| 187 |
process_info.pr_fname) < 0) { |
| 188 |
return NULL; |
| 189 |
} |
| 190 |
if (sg_update_string(&proc_state_ptr->proctitle, |
| 191 |
process_info.pr_psargs) < 0) { |
| 192 |
return NULL; |
| 193 |
} |
| 194 |
|
| 195 |
if(process_info.pr_lwp.pr_state==1) proc_state_ptr->state = SG_PROCESS_STATE_SLEEPING; |
| 196 |
if(process_info.pr_lwp.pr_state==2) proc_state_ptr->state = SG_PROCESS_STATE_RUNNING; |
| 197 |
if(process_info.pr_lwp.pr_state==3) proc_state_ptr->state = SG_PROCESS_STATE_ZOMBIE; |
| 198 |
if(process_info.pr_lwp.pr_state==4) proc_state_ptr->state = SG_PROCESS_STATE_STOPPED; |
| 199 |
if(process_info.pr_lwp.pr_state==6) proc_state_ptr->state = SG_PROCESS_STATE_RUNNING; |
| 200 |
#endif |
| 201 |
#ifdef LINUX |
| 202 |
x = fscanf(f, "%d %4096s %c %d %d %*d %*d %*d %*u %*u %*u %*u %*u %lu %lu %*d %*d %*d %d %*d %*d %lu %llu %llu %*u %*u %*u %*u %*u %*u %*u %*u %*u %*u %*u %*u %*u %*d %*d\n", &(proc_state_ptr->pid), ps_name, &s, &(proc_state_ptr->parent), &(proc_state_ptr->pgid), &utime, &stime, &(proc_state_ptr->nice), &starttime, &(proc_state_ptr->proc_size), &(proc_state_ptr->proc_resident)); |
| 203 |
/* +3 becuase man page says "Resident Set Size: number of pages the process has in real memory, minus 3 for administrative purposes." */ |
| 204 |
proc_state_ptr->proc_resident = (proc_state_ptr->proc_resident + 3) * getpagesize(); |
| 205 |
if(s == 'S') proc_state_ptr->state = SG_PROCESS_STATE_SLEEPING; |
| 206 |
if(s == 'R') proc_state_ptr->state = SG_PROCESS_STATE_RUNNING; |
| 207 |
if(s == 'Z') proc_state_ptr->state = SG_PROCESS_STATE_ZOMBIE; |
| 208 |
if(s == 'T') proc_state_ptr->state = SG_PROCESS_STATE_STOPPED; |
| 209 |
if(s == 'D') proc_state_ptr->state = SG_PROCESS_STATE_STOPPED; |
| 210 |
|
| 211 |
/* pa_name[0] should = '(' */ |
| 212 |
ptr = strchr(&ps_name[1], ')'); |
| 213 |
if(ptr !=NULL) *ptr='\0'; |
| 214 |
|
| 215 |
if (sg_update_string(&proc_state_ptr->process_name, |
| 216 |
&ps_name[1]) < 0) { |
| 217 |
return NULL; |
| 218 |
} |
| 219 |
|
| 220 |
/* cpu */ |
| 221 |
proc_state_ptr->cpu_percent = (100.0 * (utime + stime)) / ((uptime * 100.0) - starttime); |
| 222 |
|
| 223 |
fclose(f); |
| 224 |
|
| 225 |
/* uid / gid */ |
| 226 |
snprintf(filename, MAX_FILE_LENGTH, "/proc/%s/status", dir_entry->d_name); |
| 227 |
if ((f=fopen(filename, "r")) == NULL) { |
| 228 |
/* Open failed.. Process since vanished, or the path was too long. |
| 229 |
* Ah well, move onwards to the next one */ |
| 230 |
continue; |
| 231 |
} |
| 232 |
|
| 233 |
if((ptr=sg_f_read_line(f, "Uid:"))==NULL){ |
| 234 |
fclose(f); |
| 235 |
continue; |
| 236 |
} |
| 237 |
sscanf(ptr, "Uid:\t%d\t%d\t%*d\t%*d\n", &(proc_state_ptr->uid), &(proc_state_ptr->euid)); |
| 238 |
|
| 239 |
if((ptr=sg_f_read_line(f, "Gid:"))==NULL){ |
| 240 |
fclose(f); |
| 241 |
continue; |
| 242 |
} |
| 243 |
sscanf(ptr, "Gid:\t%d\t%d\t%*d\t%*d\n", &(proc_state_ptr->gid), &(proc_state_ptr->egid)); |
| 244 |
|
| 245 |
fclose(f); |
| 246 |
|
| 247 |
/* proctitle */ |
| 248 |
snprintf(filename, MAX_FILE_LENGTH, "/proc/%s/cmdline", dir_entry->d_name); |
| 249 |
|
| 250 |
if((fn=open(filename, O_RDONLY)) == -1){ |
| 251 |
/* Open failed.. Process since vanished, or the path was too long. |
| 252 |
* Ah well, move onwards to the next one */ |
| 253 |
continue; |
| 254 |
} |
| 255 |
|
| 256 |
#define READ_BLOCK_SIZE 128 |
| 257 |
len = 0; |
| 258 |
do { |
| 259 |
if (VECTOR_RESIZE(psargs, len + READ_BLOCK_SIZE) < 0) { |
| 260 |
return NULL; |
| 261 |
} |
| 262 |
rc = read(fn, psargs + len, READ_BLOCK_SIZE); |
| 263 |
if (rc > 0) { |
| 264 |
len += rc; |
| 265 |
} |
| 266 |
} while (rc == READ_BLOCK_SIZE); |
| 267 |
close(fn); |
| 268 |
|
| 269 |
if (rc == -1) { |
| 270 |
/* Read failed; move on. */ |
| 271 |
continue; |
| 272 |
} |
| 273 |
|
| 274 |
/* Turn \0s into spaces within the command line. */ |
| 275 |
ptr = psargs; |
| 276 |
for(x = 0; x < len; x++) { |
| 277 |
if (*ptr == '\0') *ptr = ' '; |
| 278 |
ptr++; |
| 279 |
} |
| 280 |
|
| 281 |
if (len == 0) { |
| 282 |
/* We want psargs to be NULL. */ |
| 283 |
if (VECTOR_RESIZE(psargs, 0) < 0) { |
| 284 |
return NULL; |
| 285 |
} |
| 286 |
} else { |
| 287 |
/* Not empty, so append a \0. */ |
| 288 |
if (VECTOR_RESIZE(psargs, len + 1) < 0) { |
| 289 |
return NULL; |
| 290 |
} |
| 291 |
psargs[len] = '\0'; |
| 292 |
} |
| 293 |
|
| 294 |
if (sg_update_string(&proc_state_ptr->proctitle, psargs) < 0) { |
| 295 |
return NULL; |
| 296 |
} |
| 297 |
#endif |
| 298 |
|
| 299 |
proc_state_size++; |
| 300 |
} |
| 301 |
closedir(proc_dir); |
| 302 |
#endif |
| 303 |
|
| 304 |
#ifdef ALLBSD |
| 305 |
mib[0] = CTL_KERN; |
| 306 |
mib[1] = KERN_PROC; |
| 307 |
mib[2] = KERN_PROC_ALL; |
| 308 |
|
| 309 |
if(sysctl(mib, 3, NULL, &size, NULL, 0) < 0) { |
| 310 |
sg_set_error(SG_ERROR_SYSCTL, "CTL_KERN.KERN_PROC.KERN_PROC_ALL"); |
| 311 |
return NULL; |
| 312 |
} |
| 313 |
|
| 314 |
procs = size / sizeof(struct kinfo_proc); |
| 315 |
|
| 316 |
kp_stats = sg_malloc(size); |
| 317 |
if(kp_stats == NULL) { |
| 318 |
return NULL; |
| 319 |
} |
| 320 |
memset(kp_stats, 0, size); |
| 321 |
|
| 322 |
if(sysctl(mib, 3, kp_stats, &size, NULL, 0) < 0) { |
| 323 |
sg_set_error(SG_ERROR_SYSCTL, "CTL_KERN.KERN_PROC.KERN_PROC_ALL"); |
| 324 |
free(kp_stats); |
| 325 |
return NULL; |
| 326 |
} |
| 327 |
|
| 328 |
#if (defined(FREEBSD) && !defined(FREEBSD5)) || defined(DFBSD) |
| 329 |
kvmd = sg_get_kvm2(); |
| 330 |
#endif |
| 331 |
|
| 332 |
for (i = 0; i < procs; i++) { |
| 333 |
const char *name; |
| 334 |
|
| 335 |
#ifdef FREEBSD5 |
| 336 |
if (kp_stats[i].ki_stat == 0) { |
| 337 |
#else |
| 338 |
if (kp_stats[i].kp_proc.p_stat == 0) { |
| 339 |
#endif |
| 340 |
/* FreeBSD 5 deliberately overallocates the array that |
| 341 |
* the sysctl returns, so we'll get a few junk |
| 342 |
* processes on the end that we have to ignore. (Search |
| 343 |
* for "overestimate by 5 procs" in |
| 344 |
* src/sys/kern/kern_proc.c for more details.) */ |
| 345 |
continue; |
| 346 |
} |
| 347 |
|
| 348 |
if (VECTOR_RESIZE(proc_state, proc_state_size + 1) < 0) { |
| 349 |
return NULL; |
| 350 |
} |
| 351 |
proc_state_ptr = proc_state+proc_state_size; |
| 352 |
|
| 353 |
#ifdef FREEBSD5 |
| 354 |
name = kp_stats[i].ki_comm; |
| 355 |
#elif defined(DFBSD) |
| 356 |
name = kp_stats[i].kp_thread.td_comm; |
| 357 |
#else |
| 358 |
name = kp_stats[i].kp_proc.p_comm; |
| 359 |
#endif |
| 360 |
if (sg_update_string(&proc_state_ptr->process_name, name) < 0) { |
| 361 |
return NULL; |
| 362 |
} |
| 363 |
|
| 364 |
#if defined(FREEBSD5) || defined(NETBSD) || defined(OPENBSD) |
| 365 |
|
| 366 |
#ifdef FREEBSD5 |
| 367 |
mib[2] = KERN_PROC_ARGS; |
| 368 |
mib[3] = kp_stats[i].ki_pid; |
| 369 |
#else |
| 370 |
mib[1] = KERN_PROC_ARGS; |
| 371 |
mib[2] = kp_stats[i].kp_proc.p_pid; |
| 372 |
mib[3] = KERN_PROC_ARGV; |
| 373 |
#endif |
| 374 |
|
| 375 |
free(proc_state_ptr->proctitle); |
| 376 |
proc_state_ptr->proctitle = NULL; |
| 377 |
|
| 378 |
/* Starting size - we'll double this straight away */ |
| 379 |
#define PROCTITLE_START_SIZE 64 |
| 380 |
buflen = PROCTITLE_START_SIZE; |
| 381 |
size = buflen; |
| 382 |
proctitle = NULL; |
| 383 |
|
| 384 |
do { |
| 385 |
if(size >= buflen) { |
| 386 |
buflen *= 2; |
| 387 |
size = buflen; |
| 388 |
proctitletmp = sg_realloc(proctitle, buflen); |
| 389 |
if(proctitletmp == NULL) { |
| 390 |
free(proctitle); |
| 391 |
proctitle = NULL; |
| 392 |
proc_state_ptr->proctitle = NULL; |
| 393 |
size = 0; |
| 394 |
break; |
| 395 |
} |
| 396 |
proctitle = proctitletmp; |
| 397 |
bzero(proctitle, buflen); |
| 398 |
} |
| 399 |
|
| 400 |
if(sysctl(mib, 4, proctitle, &size, NULL, 0) < 0) { |
| 401 |
free(proctitle); |
| 402 |
proctitle = NULL; |
| 403 |
proc_state_ptr->proctitle = NULL; |
| 404 |
size = 0; |
| 405 |
break; |
| 406 |
} |
| 407 |
} while(size >= buflen); |
| 408 |
|
| 409 |
if(size > 0) { |
| 410 |
proc_state_ptr->proctitle = sg_malloc(size+1); |
| 411 |
if(proc_state_ptr->proctitle == NULL) { |
| 412 |
return NULL; |
| 413 |
} |
| 414 |
p = proctitle; |
| 415 |
#ifdef OPENBSD |
| 416 |
/* On OpenBSD, this value has the argv pointers (which |
| 417 |
* are terminated by a NULL) at the front, so we have |
| 418 |
* to skip over them to get to the strings. */ |
| 419 |
while (*(char ***)p != NULL) { |
| 420 |
p += sizeof(char **); |
| 421 |
} |
| 422 |
p += sizeof(char **); |
| 423 |
#endif |
| 424 |
proc_state_ptr->proctitle[0] = '\0'; |
| 425 |
do { |
| 426 |
sg_strlcat(proc_state_ptr->proctitle, p, size+1); |
| 427 |
sg_strlcat(proc_state_ptr->proctitle, " ", size+1); |
| 428 |
p += strlen(p) + 1; |
| 429 |
} while (p < proctitle + size); |
| 430 |
free(proctitle); |
| 431 |
proctitle = NULL; |
| 432 |
/* remove trailing space */ |
| 433 |
proc_state_ptr->proctitle[strlen(proc_state_ptr->proctitle)-1] = '\0'; |
| 434 |
} |
| 435 |
else { |
| 436 |
if(proctitle != NULL) { |
| 437 |
free(proctitle); |
| 438 |
proctitle = NULL; |
| 439 |
} |
| 440 |
proc_state_ptr->proctitle = NULL; |
| 441 |
} |
| 442 |
#else |
| 443 |
free(proc_state_ptr->proctitle); |
| 444 |
proc_state_ptr->proctitle = NULL; |
| 445 |
if(kvmd != NULL) { |
| 446 |
args = kvm_getargv(kvmd, &(kp_stats[i]), 0); |
| 447 |
if(args != NULL) { |
| 448 |
argsp = args; |
| 449 |
while(*argsp != NULL) { |
| 450 |
argslen += strlen(*argsp) + 1; |
| 451 |
argsp++; |
| 452 |
} |
| 453 |
proctitle = sg_malloc(argslen + 1); |
| 454 |
proctitle[0] = '\0'; |
| 455 |
if(proctitle == NULL) { |
| 456 |
return NULL; |
| 457 |
} |
| 458 |
while(*args != NULL) { |
| 459 |
sg_strlcat(proctitle, *args, argslen + 1); |
| 460 |
sg_strlcat(proctitle, " ", argslen + 1); |
| 461 |
args++; |
| 462 |
} |
| 463 |
/* remove trailing space */ |
| 464 |
proctitle[strlen(proctitle)-1] = '\0'; |
| 465 |
proc_state_ptr->proctitle = proctitle; |
| 466 |
} |
| 467 |
else { |
| 468 |
proc_state_ptr->proctitle = NULL; |
| 469 |
} |
| 470 |
} |
| 471 |
else { |
| 472 |
proc_state_ptr->proctitle = NULL; |
| 473 |
} |
| 474 |
#endif |
| 475 |
|
| 476 |
#ifdef FREEBSD5 |
| 477 |
proc_state_ptr->pid = kp_stats[i].ki_pid; |
| 478 |
proc_state_ptr->parent = kp_stats[i].ki_ppid; |
| 479 |
proc_state_ptr->pgid = kp_stats[i].ki_pgid; |
| 480 |
#else |
| 481 |
proc_state_ptr->pid = kp_stats[i].kp_proc.p_pid; |
| 482 |
proc_state_ptr->parent = kp_stats[i].kp_eproc.e_ppid; |
| 483 |
proc_state_ptr->pgid = kp_stats[i].kp_eproc.e_pgid; |
| 484 |
#endif |
| 485 |
|
| 486 |
#ifdef FREEBSD5 |
| 487 |
proc_state_ptr->uid = kp_stats[i].ki_ruid; |
| 488 |
proc_state_ptr->euid = kp_stats[i].ki_uid; |
| 489 |
proc_state_ptr->gid = kp_stats[i].ki_rgid; |
| 490 |
proc_state_ptr->egid = kp_stats[i].ki_svgid; |
| 491 |
#elif defined(DFBSD) |
| 492 |
proc_state_ptr->uid = kp_stats[i].kp_eproc.e_ucred.cr_ruid; |
| 493 |
proc_state_ptr->euid = kp_stats[i].kp_eproc.e_ucred.cr_svuid; |
| 494 |
proc_state_ptr->gid = kp_stats[i].kp_eproc.e_ucred.cr_rgid; |
| 495 |
proc_state_ptr->egid = kp_stats[i].kp_eproc.e_ucred.cr_svgid; |
| 496 |
#else |
| 497 |
proc_state_ptr->uid = kp_stats[i].kp_eproc.e_pcred.p_ruid; |
| 498 |
proc_state_ptr->euid = kp_stats[i].kp_eproc.e_pcred.p_svuid; |
| 499 |
proc_state_ptr->gid = kp_stats[i].kp_eproc.e_pcred.p_rgid; |
| 500 |
proc_state_ptr->egid = kp_stats[i].kp_eproc.e_pcred.p_svgid; |
| 501 |
#endif |
| 502 |
|
| 503 |
#ifdef FREEBSD5 |
| 504 |
proc_state_ptr->proc_size = kp_stats[i].ki_size; |
| 505 |
/* This is in pages */ |
| 506 |
proc_state_ptr->proc_resident = |
| 507 |
kp_stats[i].ki_rssize * getpagesize(); |
| 508 |
/* This is in microseconds */ |
| 509 |
proc_state_ptr->time_spent = kp_stats[i].ki_runtime / 1000000; |
| 510 |
proc_state_ptr->cpu_percent = |
| 511 |
((double)kp_stats[i].ki_pctcpu / FSCALE) * 100.0; |
| 512 |
proc_state_ptr->nice = kp_stats[i].ki_nice; |
| 513 |
#else |
| 514 |
proc_state_ptr->proc_size = |
| 515 |
kp_stats[i].kp_eproc.e_vm.vm_map.size; |
| 516 |
/* This is in pages */ |
| 517 |
proc_state_ptr->proc_resident = |
| 518 |
kp_stats[i].kp_eproc.e_vm.vm_rssize * getpagesize(); |
| 519 |
#if defined(NETBSD) || defined(OPENBSD) |
| 520 |
proc_state_ptr->time_spent = |
| 521 |
kp_stats[i].kp_proc.p_rtime.tv_sec; |
| 522 |
#elif defined(DFBSD) |
| 523 |
proc_state_ptr->time_spent = |
| 524 |
( kp_stats[i].kp_thread.td_uticks + |
| 525 |
kp_stats[i].kp_thread.td_sticks + |
| 526 |
kp_stats[i].kp_thread.td_iticks ) / 1000000; |
| 527 |
#else |
| 528 |
/* This is in microseconds */ |
| 529 |
proc_state_ptr->time_spent = |
| 530 |
kp_stats[i].kp_proc.p_runtime / 1000000; |
| 531 |
#endif |
| 532 |
proc_state_ptr->cpu_percent = |
| 533 |
((double)kp_stats[i].kp_proc.p_pctcpu / FSCALE) * 100.0; |
| 534 |
proc_state_ptr->nice = kp_stats[i].kp_proc.p_nice; |
| 535 |
#endif |
| 536 |
|
| 537 |
#ifdef NETBSD2 |
| 538 |
{ |
| 539 |
size_t size; |
| 540 |
int mib[5]; |
| 541 |
|
| 542 |
mib[0] = CTL_KERN; |
| 543 |
mib[1] = KERN_LWP; |
| 544 |
mib[2] = kp_stats[i].kp_proc.p_pid; |
| 545 |
mib[3] = sizeof(struct kinfo_lwp); |
| 546 |
mib[4] = 0; |
| 547 |
|
| 548 |
if(sysctl(mib, 5, NULL, &size, NULL, 0) < 0) { |
| 549 |
sg_set_error(SG_ERROR_SYSCTL, "CTL_KERN.KERN_LWP.pid.structsize.0"); |
| 550 |
return NULL; |
| 551 |
} |
| 552 |
|
| 553 |
lwps = size / sizeof(struct kinfo_lwp); |
| 554 |
mib[4] = lwps; |
| 555 |
|
| 556 |
kl_stats = sg_malloc(size); |
| 557 |
if(kl_stats == NULL) { |
| 558 |
return NULL; |
| 559 |
} |
| 560 |
|
| 561 |
if(sysctl(mib, 5, kl_stats, &size, NULL, 0) < 0) { |
| 562 |
sg_set_error(SG_ERROR_SYSCTL, "CTL_KERN.KERN_LWP.pid.structsize.buffersize"); |
| 563 |
return NULL; |
| 564 |
} |
| 565 |
} |
| 566 |
|
| 567 |
switch(kp_stats[i].kp_proc.p_stat) { |
| 568 |
case SIDL: |
| 569 |
proc_state_ptr->state = SG_PROCESS_STATE_RUNNING; |
| 570 |
break; |
| 571 |
case SACTIVE: |
| 572 |
{ |
| 573 |
int i; |
| 574 |
|
| 575 |
for(i = 0; i < lwps; i++) { |
| 576 |
switch(kl_stats[i].l_stat) { |
| 577 |
case LSONPROC: |
| 578 |
case LSRUN: |
| 579 |
proc_state_ptr->state = SG_PROCESS_STATE_RUNNING; |
| 580 |
goto end; |
| 581 |
case LSSLEEP: |
| 582 |
proc_state_ptr->state = SG_PROCESS_STATE_SLEEPING; |
| 583 |
goto end; |
| 584 |
case LSSTOP: |
| 585 |
case LSSUSPENDED: |
| 586 |
proc_state_ptr->state = SG_PROCESS_STATE_STOPPED; |
| 587 |
goto end; |
| 588 |
} |
| 589 |
proc_state_ptr->state = SG_PROCESS_STATE_UNKNOWN; |
| 590 |
} |
| 591 |
end: ; |
| 592 |
} |
| 593 |
break; |
| 594 |
case SSTOP: |
| 595 |
proc_state_ptr->state = SG_PROCESS_STATE_STOPPED; |
| 596 |
break; |
| 597 |
case SZOMB: |
| 598 |
proc_state_ptr->state = SG_PROCESS_STATE_ZOMBIE; |
| 599 |
break; |
| 600 |
default: |
| 601 |
proc_state_ptr->state = SG_PROCESS_STATE_UNKNOWN; |
| 602 |
break; |
| 603 |
} |
| 604 |
#else |
| 605 |
#ifdef FREEBSD5 |
| 606 |
switch (kp_stats[i].ki_stat) { |
| 607 |
#else |
| 608 |
switch (kp_stats[i].kp_proc.p_stat) { |
| 609 |
#endif |
| 610 |
case SIDL: |
| 611 |
case SRUN: |
| 612 |
#ifdef SONPROC |
| 613 |
case SONPROC: /* NetBSD */ |
| 614 |
#endif |
| 615 |
proc_state_ptr->state = SG_PROCESS_STATE_RUNNING; |
| 616 |
break; |
| 617 |
case SSLEEP: |
| 618 |
#ifdef SWAIT |
| 619 |
case SWAIT: /* FreeBSD 5 */ |
| 620 |
#endif |
| 621 |
#ifdef SLOCK |
| 622 |
case SLOCK: /* FreeBSD 5 */ |
| 623 |
#endif |
| 624 |
proc_state_ptr->state = SG_PROCESS_STATE_SLEEPING; |
| 625 |
break; |
| 626 |
case SSTOP: |
| 627 |
proc_state_ptr->state = SG_PROCESS_STATE_STOPPED; |
| 628 |
break; |
| 629 |
case SZOMB: |
| 630 |
#ifdef SDEAD |
| 631 |
case SDEAD: /* OpenBSD & NetBSD */ |
| 632 |
#endif |
| 633 |
proc_state_ptr->state = SG_PROCESS_STATE_ZOMBIE; |
| 634 |
break; |
| 635 |
default: |
| 636 |
proc_state_ptr->state = SG_PROCESS_STATE_UNKNOWN; |
| 637 |
break; |
| 638 |
} |
| 639 |
#endif |
| 640 |
proc_state_size++; |
| 641 |
} |
| 642 |
|
| 643 |
free(kp_stats); |
| 644 |
#endif |
| 645 |
|
| 646 |
#ifdef CYGWIN |
| 647 |
sg_set_error(SG_ERROR_UNSUPPORTED, "Cygwin"); |
| 648 |
return NULL; |
| 649 |
#endif |
| 650 |
|
| 651 |
*entries = proc_state_size; |
| 652 |
return proc_state; |
| 653 |
} |
| 654 |
|
| 655 |
sg_process_count *sg_get_process_count() { |
| 656 |
static sg_process_count process_stat; |
| 657 |
sg_process_stats *ps; |
| 658 |
int ps_size, x; |
| 659 |
|
| 660 |
process_stat.sleeping = 0; |
| 661 |
process_stat.running = 0; |
| 662 |
process_stat.zombie = 0; |
| 663 |
process_stat.stopped = 0; |
| 664 |
process_stat.total = 0; |
| 665 |
|
| 666 |
ps = sg_get_process_stats(&ps_size); |
| 667 |
if (ps == NULL) { |
| 668 |
return NULL; |
| 669 |
} |
| 670 |
|
| 671 |
for(x = 0; x < ps_size; x++) { |
| 672 |
switch (ps->state) { |
| 673 |
case SG_PROCESS_STATE_RUNNING: |
| 674 |
process_stat.running++; |
| 675 |
break; |
| 676 |
case SG_PROCESS_STATE_SLEEPING: |
| 677 |
process_stat.sleeping++; |
| 678 |
break; |
| 679 |
case SG_PROCESS_STATE_STOPPED: |
| 680 |
process_stat.stopped++; |
| 681 |
break; |
| 682 |
case SG_PROCESS_STATE_ZOMBIE: |
| 683 |
process_stat.zombie++; |
| 684 |
break; |
| 685 |
default: |
| 686 |
/* currently no mapping for SG_PROCESS_STATE_UNKNOWN in |
| 687 |
* sg_process_count */ |
| 688 |
break; |
| 689 |
} |
| 690 |
ps++; |
| 691 |
} |
| 692 |
|
| 693 |
process_stat.total = ps_size; |
| 694 |
|
| 695 |
return &process_stat; |
| 696 |
} |
| 697 |
|
| 698 |
int sg_process_compare_name(const void *va, const void *vb) { |
| 699 |
const sg_process_stats *a = (sg_process_stats *)va; |
| 700 |
const sg_process_stats *b = (sg_process_stats *)vb; |
| 701 |
|
| 702 |
return strcmp(a->process_name, b->process_name); |
| 703 |
} |
| 704 |
|
| 705 |
int sg_process_compare_pid(const void *va, const void *vb) { |
| 706 |
const sg_process_stats *a = (sg_process_stats *)va; |
| 707 |
const sg_process_stats *b = (sg_process_stats *)vb; |
| 708 |
|
| 709 |
if (a->pid < b->pid) { |
| 710 |
return -1; |
| 711 |
} else if (a->pid == b->pid) { |
| 712 |
return 0; |
| 713 |
} else { |
| 714 |
return 1; |
| 715 |
} |
| 716 |
} |
| 717 |
|
| 718 |
int sg_process_compare_uid(const void *va, const void *vb) { |
| 719 |
const sg_process_stats *a = (sg_process_stats *)va; |
| 720 |
const sg_process_stats *b = (sg_process_stats *)vb; |
| 721 |
|
| 722 |
if (a->uid < b->uid) { |
| 723 |
return -1; |
| 724 |
} else if (a->uid == b->uid) { |
| 725 |
return 0; |
| 726 |
} else { |
| 727 |
return 1; |
| 728 |
} |
| 729 |
} |
| 730 |
|
| 731 |
int sg_process_compare_gid(const void *va, const void *vb) { |
| 732 |
const sg_process_stats *a = (sg_process_stats *)va; |
| 733 |
const sg_process_stats *b = (sg_process_stats *)vb; |
| 734 |
|
| 735 |
if (a->gid < b->gid) { |
| 736 |
return -1; |
| 737 |
} else if (a->gid == b->gid) { |
| 738 |
return 0; |
| 739 |
} else { |
| 740 |
return 1; |
| 741 |
} |
| 742 |
} |
| 743 |
|
| 744 |
int sg_process_compare_size(const void *va, const void *vb) { |
| 745 |
const sg_process_stats *a = (sg_process_stats *)va; |
| 746 |
const sg_process_stats *b = (sg_process_stats *)vb; |
| 747 |
|
| 748 |
if (a->proc_size < b->proc_size) { |
| 749 |
return -1; |
| 750 |
} else if (a->proc_size == b->proc_size) { |
| 751 |
return 0; |
| 752 |
} else { |
| 753 |
return 1; |
| 754 |
} |
| 755 |
} |
| 756 |
|
| 757 |
int sg_process_compare_res(const void *va, const void *vb) { |
| 758 |
const sg_process_stats *a = (sg_process_stats *)va; |
| 759 |
const sg_process_stats *b = (sg_process_stats *)vb; |
| 760 |
|
| 761 |
if (a->proc_resident < b->proc_resident) { |
| 762 |
return -1; |
| 763 |
} else if (a->proc_resident == b->proc_resident) { |
| 764 |
return 0; |
| 765 |
} else { |
| 766 |
return 1; |
| 767 |
} |
| 768 |
} |
| 769 |
|
| 770 |
int sg_process_compare_cpu(const void *va, const void *vb) { |
| 771 |
const sg_process_stats *a = (sg_process_stats *)va; |
| 772 |
const sg_process_stats *b = (sg_process_stats *)vb; |
| 773 |
|
| 774 |
if (a->cpu_percent < b->cpu_percent) { |
| 775 |
return -1; |
| 776 |
} else if (a->cpu_percent == b->cpu_percent) { |
| 777 |
return 0; |
| 778 |
} else { |
| 779 |
return 1; |
| 780 |
} |
| 781 |
} |
| 782 |
|
| 783 |
int sg_process_compare_time(const void *va, const void *vb) { |
| 784 |
const sg_process_stats *a = (sg_process_stats *)va; |
| 785 |
const sg_process_stats *b = (sg_process_stats *)vb; |
| 786 |
|
| 787 |
if (a->time_spent < b->time_spent) { |
| 788 |
return -1; |
| 789 |
} else if (a->time_spent == b->time_spent) { |
| 790 |
return 0; |
| 791 |
} else { |
| 792 |
return 1; |
| 793 |
} |
| 794 |
} |
| 795 |
|
