procps.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655
  1. /* vi: set sw=4 ts=4: */
  2. /*
  3. * Utility routines.
  4. *
  5. * Copyright 1998 by Albert Cahalan; all rights reserved.
  6. * Copyright (C) 2002 by Vladimir Oleynik <dzo@simtreas.ru>
  7. * SELinux support: (c) 2007 by Yuichi Nakamura <ynakam@hitachisoft.jp>
  8. *
  9. * Licensed under GPLv2 or later, see file LICENSE in this source tree.
  10. */
  11. #include "libbb.h"
  12. typedef struct id_to_name_map_t {
  13. uid_t id;
  14. char name[USERNAME_MAX_SIZE];
  15. } id_to_name_map_t;
  16. typedef struct cache_t {
  17. id_to_name_map_t *cache;
  18. int size;
  19. } cache_t;
  20. static cache_t username, groupname;
  21. static void clear_cache(cache_t *cp)
  22. {
  23. free(cp->cache);
  24. cp->cache = NULL;
  25. cp->size = 0;
  26. }
  27. void FAST_FUNC clear_username_cache(void)
  28. {
  29. clear_cache(&username);
  30. clear_cache(&groupname);
  31. }
  32. #if 0 /* more generic, but we don't need that yet */
  33. /* Returns -N-1 if not found. */
  34. /* cp->cache[N] is allocated and must be filled in this case */
  35. static int get_cached(cache_t *cp, uid_t id)
  36. {
  37. int i;
  38. for (i = 0; i < cp->size; i++)
  39. if (cp->cache[i].id == id)
  40. return i;
  41. i = cp->size++;
  42. cp->cache = xrealloc_vector(cp->cache, 2, i);
  43. cp->cache[i++].id = id;
  44. return -i;
  45. }
  46. #endif
  47. static char* get_cached(cache_t *cp, uid_t id,
  48. char* FAST_FUNC x2x_utoa(uid_t id))
  49. {
  50. int i;
  51. for (i = 0; i < cp->size; i++)
  52. if (cp->cache[i].id == id)
  53. return cp->cache[i].name;
  54. i = cp->size++;
  55. cp->cache = xrealloc_vector(cp->cache, 2, i);
  56. cp->cache[i].id = id;
  57. /* Never fails. Generates numeric string if name isn't found */
  58. safe_strncpy(cp->cache[i].name, x2x_utoa(id), sizeof(cp->cache[i].name));
  59. return cp->cache[i].name;
  60. }
  61. const char* FAST_FUNC get_cached_username(uid_t uid)
  62. {
  63. return get_cached(&username, uid, uid2uname_utoa);
  64. }
  65. const char* FAST_FUNC get_cached_groupname(gid_t gid)
  66. {
  67. return get_cached(&groupname, gid, gid2group_utoa);
  68. }
  69. #define PROCPS_BUFSIZE 1024
  70. static int read_to_buf(const char *filename, void *buf)
  71. {
  72. int fd;
  73. /* open_read_close() would do two reads, checking for EOF.
  74. * When you have 10000 /proc/$NUM/stat to read, it isn't desirable */
  75. ssize_t ret = -1;
  76. fd = open(filename, O_RDONLY);
  77. if (fd >= 0) {
  78. ret = read(fd, buf, PROCPS_BUFSIZE-1);
  79. close(fd);
  80. }
  81. ((char *)buf)[ret > 0 ? ret : 0] = '\0';
  82. return ret;
  83. }
  84. static procps_status_t* FAST_FUNC alloc_procps_scan(void)
  85. {
  86. unsigned n = getpagesize();
  87. procps_status_t* sp = xzalloc(sizeof(procps_status_t));
  88. sp->dir = xopendir("/proc");
  89. while (1) {
  90. n >>= 1;
  91. if (!n) break;
  92. sp->shift_pages_to_bytes++;
  93. }
  94. sp->shift_pages_to_kb = sp->shift_pages_to_bytes - 10;
  95. return sp;
  96. }
  97. void FAST_FUNC free_procps_scan(procps_status_t* sp)
  98. {
  99. closedir(sp->dir);
  100. #if ENABLE_FEATURE_SHOW_THREADS
  101. if (sp->task_dir)
  102. closedir(sp->task_dir);
  103. #endif
  104. free(sp->argv0);
  105. free(sp->exe);
  106. IF_SELINUX(free(sp->context);)
  107. free(sp);
  108. }
  109. #if ENABLE_FEATURE_TOPMEM || ENABLE_PMAP
  110. static unsigned long fast_strtoul_16(char **endptr)
  111. {
  112. unsigned char c;
  113. char *str = *endptr;
  114. unsigned long n = 0;
  115. while ((c = *str++) != ' ') {
  116. c = ((c|0x20) - '0');
  117. if (c > 9)
  118. // c = c + '0' - 'a' + 10:
  119. c = c - ('a' - '0' - 10);
  120. n = n*16 + c;
  121. }
  122. *endptr = str; /* We skip trailing space! */
  123. return n;
  124. }
  125. #endif
  126. #if ENABLE_FEATURE_FAST_TOP || ENABLE_FEATURE_TOPMEM || ENABLE_PMAP
  127. /* We cut a lot of corners here for speed */
  128. static unsigned long fast_strtoul_10(char **endptr)
  129. {
  130. char c;
  131. char *str = *endptr;
  132. unsigned long n = *str - '0';
  133. while ((c = *++str) != ' ')
  134. n = n*10 + (c - '0');
  135. *endptr = str + 1; /* We skip trailing space! */
  136. return n;
  137. }
  138. # if ENABLE_FEATURE_FAST_TOP
  139. static long fast_strtol_10(char **endptr)
  140. {
  141. if (**endptr != '-')
  142. return fast_strtoul_10(endptr);
  143. (*endptr)++;
  144. return - (long)fast_strtoul_10(endptr);
  145. }
  146. # endif
  147. static char *skip_fields(char *str, int count)
  148. {
  149. do {
  150. while (*str++ != ' ')
  151. continue;
  152. /* we found a space char, str points after it */
  153. } while (--count);
  154. return str;
  155. }
  156. #endif
  157. #if ENABLE_FEATURE_TOPMEM || ENABLE_PMAP
  158. int FAST_FUNC procps_read_smaps(pid_t pid, struct smaprec *total,
  159. void (*cb)(struct smaprec *, void *), void *data)
  160. {
  161. FILE *file;
  162. struct smaprec currec;
  163. char filename[sizeof("/proc/%u/smaps") + sizeof(int)*3];
  164. char buf[PROCPS_BUFSIZE];
  165. #if !ENABLE_PMAP
  166. void (*cb)(struct smaprec *, void *) = NULL;
  167. void *data = NULL;
  168. #endif
  169. sprintf(filename, "/proc/%u/smaps", (int)pid);
  170. file = fopen_for_read(filename);
  171. if (!file)
  172. return 1;
  173. memset(&currec, 0, sizeof(currec));
  174. while (fgets(buf, PROCPS_BUFSIZE, file)) {
  175. // Each mapping datum has this form:
  176. // f7d29000-f7d39000 rw-s ADR M:m OFS FILE
  177. // Size: nnn kB
  178. // Rss: nnn kB
  179. // .....
  180. char *tp = buf, *p;
  181. #define SCAN(S, X) \
  182. if (strncmp(tp, S, sizeof(S)-1) == 0) { \
  183. tp = skip_whitespace(tp + sizeof(S)-1); \
  184. total->X += currec.X = fast_strtoul_10(&tp); \
  185. continue; \
  186. }
  187. if (cb) {
  188. SCAN("Pss:" , smap_pss );
  189. SCAN("Swap:" , smap_swap );
  190. }
  191. SCAN("Private_Dirty:", private_dirty);
  192. SCAN("Private_Clean:", private_clean);
  193. SCAN("Shared_Dirty:" , shared_dirty );
  194. SCAN("Shared_Clean:" , shared_clean );
  195. #undef SCAN
  196. tp = strchr(buf, '-');
  197. if (tp) {
  198. // We reached next mapping - the line of this form:
  199. // f7d29000-f7d39000 rw-s ADR M:m OFS FILE
  200. if (cb) {
  201. /* If we have a previous record, there's nothing more
  202. * for it, call the callback and clear currec
  203. */
  204. if (currec.smap_size)
  205. cb(&currec, data);
  206. free(currec.smap_name);
  207. }
  208. memset(&currec, 0, sizeof(currec));
  209. *tp = ' ';
  210. tp = buf;
  211. currec.smap_start = fast_strtoul_16(&tp);
  212. currec.smap_size = (fast_strtoul_16(&tp) - currec.smap_start) >> 10;
  213. strncpy(currec.smap_mode, tp, sizeof(currec.smap_mode)-1);
  214. // skipping "rw-s ADR M:m OFS "
  215. tp = skip_whitespace(skip_fields(tp, 4));
  216. // filter out /dev/something (something != zero)
  217. if (strncmp(tp, "/dev/", 5) != 0 || strcmp(tp, "/dev/zero\n") == 0) {
  218. if (currec.smap_mode[1] == 'w') {
  219. currec.mapped_rw = currec.smap_size;
  220. total->mapped_rw += currec.smap_size;
  221. } else if (currec.smap_mode[1] == '-') {
  222. currec.mapped_ro = currec.smap_size;
  223. total->mapped_ro += currec.smap_size;
  224. }
  225. }
  226. if (strcmp(tp, "[stack]\n") == 0)
  227. total->stack += currec.smap_size;
  228. if (cb) {
  229. p = skip_non_whitespace(tp);
  230. if (p == tp) {
  231. currec.smap_name = xstrdup(" [ anon ]");
  232. } else {
  233. *p = '\0';
  234. currec.smap_name = xstrdup(tp);
  235. }
  236. }
  237. total->smap_size += currec.smap_size;
  238. }
  239. }
  240. fclose(file);
  241. if (cb) {
  242. if (currec.smap_size)
  243. cb(&currec, data);
  244. free(currec.smap_name);
  245. }
  246. return 0;
  247. }
  248. #endif
  249. void BUG_comm_size(void);
  250. procps_status_t* FAST_FUNC procps_scan(procps_status_t* sp, int flags)
  251. {
  252. if (!sp)
  253. sp = alloc_procps_scan();
  254. for (;;) {
  255. struct dirent *entry;
  256. char buf[PROCPS_BUFSIZE];
  257. long tasknice;
  258. unsigned pid;
  259. int n;
  260. char filename[sizeof("/proc/%u/task/%u/cmdline") + sizeof(int)*3 * 2];
  261. char *filename_tail;
  262. #if ENABLE_FEATURE_SHOW_THREADS
  263. if (sp->task_dir) {
  264. entry = readdir(sp->task_dir);
  265. if (entry)
  266. goto got_entry;
  267. closedir(sp->task_dir);
  268. sp->task_dir = NULL;
  269. }
  270. #endif
  271. entry = readdir(sp->dir);
  272. if (entry == NULL) {
  273. free_procps_scan(sp);
  274. return NULL;
  275. }
  276. IF_FEATURE_SHOW_THREADS(got_entry:)
  277. pid = bb_strtou(entry->d_name, NULL, 10);
  278. if (errno)
  279. continue;
  280. #if ENABLE_FEATURE_SHOW_THREADS
  281. if ((flags & PSSCAN_TASKS) && !sp->task_dir) {
  282. /* We found another /proc/PID. Do not use it,
  283. * there will be /proc/PID/task/PID (same PID!),
  284. * so just go ahead and dive into /proc/PID/task. */
  285. sprintf(filename, "/proc/%u/task", pid);
  286. /* Note: if opendir fails, we just go to next /proc/XXX */
  287. sp->task_dir = opendir(filename);
  288. sp->main_thread_pid = pid;
  289. continue;
  290. }
  291. #endif
  292. /* After this point we can:
  293. * "break": stop parsing, return the data
  294. * "continue": try next /proc/XXX
  295. */
  296. memset(&sp->vsz, 0, sizeof(*sp) - offsetof(procps_status_t, vsz));
  297. sp->pid = pid;
  298. if (!(flags & ~PSSCAN_PID))
  299. break; /* we needed only pid, we got it */
  300. #if ENABLE_SELINUX
  301. if (flags & PSSCAN_CONTEXT) {
  302. if (getpidcon(sp->pid, &sp->context) < 0)
  303. sp->context = NULL;
  304. }
  305. #endif
  306. #if ENABLE_FEATURE_SHOW_THREADS
  307. if (sp->task_dir)
  308. filename_tail = filename + sprintf(filename, "/proc/%u/task/%u/", sp->main_thread_pid, pid);
  309. else
  310. #endif
  311. filename_tail = filename + sprintf(filename, "/proc/%u/", pid);
  312. if (flags & PSSCAN_UIDGID) {
  313. struct stat sb;
  314. if (stat(filename, &sb))
  315. continue; /* process probably exited */
  316. /* Effective UID/GID, not real */
  317. sp->uid = sb.st_uid;
  318. sp->gid = sb.st_gid;
  319. }
  320. /* These are all retrieved from proc/NN/stat in one go: */
  321. if (flags & (PSSCAN_PPID | PSSCAN_PGID | PSSCAN_SID
  322. | PSSCAN_COMM | PSSCAN_STATE
  323. | PSSCAN_VSZ | PSSCAN_RSS
  324. | PSSCAN_STIME | PSSCAN_UTIME | PSSCAN_START_TIME
  325. | PSSCAN_TTY | PSSCAN_NICE
  326. | PSSCAN_CPU)
  327. ) {
  328. char *cp, *comm1;
  329. int tty;
  330. #if !ENABLE_FEATURE_FAST_TOP
  331. unsigned long vsz, rss;
  332. #endif
  333. /* see proc(5) for some details on this */
  334. strcpy(filename_tail, "stat");
  335. n = read_to_buf(filename, buf);
  336. if (n < 0)
  337. continue; /* process probably exited */
  338. cp = strrchr(buf, ')'); /* split into "PID (cmd" and "<rest>" */
  339. /*if (!cp || cp[1] != ' ')
  340. continue;*/
  341. cp[0] = '\0';
  342. if (sizeof(sp->comm) < 16)
  343. BUG_comm_size();
  344. comm1 = strchr(buf, '(');
  345. /*if (comm1)*/
  346. safe_strncpy(sp->comm, comm1 + 1, sizeof(sp->comm));
  347. #if !ENABLE_FEATURE_FAST_TOP
  348. n = sscanf(cp+2,
  349. "%c %u " /* state, ppid */
  350. "%u %u %d %*s " /* pgid, sid, tty, tpgid */
  351. "%*s %*s %*s %*s %*s " /* flags, min_flt, cmin_flt, maj_flt, cmaj_flt */
  352. "%lu %lu " /* utime, stime */
  353. "%*s %*s %*s " /* cutime, cstime, priority */
  354. "%ld " /* nice */
  355. "%*s %*s " /* timeout, it_real_value */
  356. "%lu " /* start_time */
  357. "%lu " /* vsize */
  358. "%lu " /* rss */
  359. # if ENABLE_FEATURE_TOP_SMP_PROCESS
  360. "%*s %*s %*s %*s %*s %*s " /*rss_rlim, start_code, end_code, start_stack, kstk_esp, kstk_eip */
  361. "%*s %*s %*s %*s " /*signal, blocked, sigignore, sigcatch */
  362. "%*s %*s %*s %*s " /*wchan, nswap, cnswap, exit_signal */
  363. "%d" /*cpu last seen on*/
  364. # endif
  365. ,
  366. sp->state, &sp->ppid,
  367. &sp->pgid, &sp->sid, &tty,
  368. &sp->utime, &sp->stime,
  369. &tasknice,
  370. &sp->start_time,
  371. &vsz,
  372. &rss
  373. # if ENABLE_FEATURE_TOP_SMP_PROCESS
  374. , &sp->last_seen_on_cpu
  375. # endif
  376. );
  377. if (n < 11)
  378. continue; /* bogus data, get next /proc/XXX */
  379. # if ENABLE_FEATURE_TOP_SMP_PROCESS
  380. if (n < 11+15)
  381. sp->last_seen_on_cpu = 0;
  382. # endif
  383. /* vsz is in bytes and we want kb */
  384. sp->vsz = vsz >> 10;
  385. /* vsz is in bytes but rss is in *PAGES*! Can you believe that? */
  386. sp->rss = rss << sp->shift_pages_to_kb;
  387. sp->tty_major = (tty >> 8) & 0xfff;
  388. sp->tty_minor = (tty & 0xff) | ((tty >> 12) & 0xfff00);
  389. #else
  390. /* This costs ~100 bytes more but makes top faster by 20%
  391. * If you run 10000 processes, this may be important for you */
  392. sp->state[0] = cp[2];
  393. cp += 4;
  394. sp->ppid = fast_strtoul_10(&cp);
  395. sp->pgid = fast_strtoul_10(&cp);
  396. sp->sid = fast_strtoul_10(&cp);
  397. tty = fast_strtoul_10(&cp);
  398. sp->tty_major = (tty >> 8) & 0xfff;
  399. sp->tty_minor = (tty & 0xff) | ((tty >> 12) & 0xfff00);
  400. cp = skip_fields(cp, 6); /* tpgid, flags, min_flt, cmin_flt, maj_flt, cmaj_flt */
  401. sp->utime = fast_strtoul_10(&cp);
  402. sp->stime = fast_strtoul_10(&cp);
  403. cp = skip_fields(cp, 3); /* cutime, cstime, priority */
  404. tasknice = fast_strtol_10(&cp);
  405. cp = skip_fields(cp, 2); /* timeout, it_real_value */
  406. sp->start_time = fast_strtoul_10(&cp);
  407. /* vsz is in bytes and we want kb */
  408. sp->vsz = fast_strtoul_10(&cp) >> 10;
  409. /* vsz is in bytes but rss is in *PAGES*! Can you believe that? */
  410. sp->rss = fast_strtoul_10(&cp) << sp->shift_pages_to_kb;
  411. # if ENABLE_FEATURE_TOP_SMP_PROCESS
  412. /* (6): rss_rlim, start_code, end_code, start_stack, kstk_esp, kstk_eip */
  413. /* (4): signal, blocked, sigignore, sigcatch */
  414. /* (4): wchan, nswap, cnswap, exit_signal */
  415. cp = skip_fields(cp, 14);
  416. //FIXME: is it safe to assume this field exists?
  417. sp->last_seen_on_cpu = fast_strtoul_10(&cp);
  418. # endif
  419. #endif /* FEATURE_FAST_TOP */
  420. #if ENABLE_FEATURE_PS_ADDITIONAL_COLUMNS
  421. sp->niceness = tasknice;
  422. #endif
  423. if (sp->vsz == 0 && sp->state[0] != 'Z')
  424. sp->state[1] = 'W';
  425. else
  426. sp->state[1] = ' ';
  427. if (tasknice < 0)
  428. sp->state[2] = '<';
  429. else if (tasknice) /* > 0 */
  430. sp->state[2] = 'N';
  431. else
  432. sp->state[2] = ' ';
  433. }
  434. #if ENABLE_FEATURE_TOPMEM
  435. if (flags & PSSCAN_SMAPS)
  436. procps_read_smaps(pid, &sp->smaps, NULL, NULL);
  437. #endif /* TOPMEM */
  438. #if ENABLE_FEATURE_PS_ADDITIONAL_COLUMNS
  439. if (flags & PSSCAN_RUIDGID) {
  440. FILE *file;
  441. strcpy(filename_tail, "status");
  442. file = fopen_for_read(filename);
  443. if (file) {
  444. while (fgets(buf, sizeof(buf), file)) {
  445. char *tp;
  446. #define SCAN_TWO(str, name, statement) \
  447. if (strncmp(buf, str, sizeof(str)-1) == 0) { \
  448. tp = skip_whitespace(buf + sizeof(str)-1); \
  449. sscanf(tp, "%u", &sp->name); \
  450. statement; \
  451. }
  452. SCAN_TWO("Uid:", ruid, continue);
  453. SCAN_TWO("Gid:", rgid, break);
  454. #undef SCAN_TWO
  455. }
  456. fclose(file);
  457. }
  458. }
  459. #endif /* PS_ADDITIONAL_COLUMNS */
  460. if (flags & PSSCAN_EXE) {
  461. strcpy(filename_tail, "exe");
  462. free(sp->exe);
  463. sp->exe = xmalloc_readlink(filename);
  464. }
  465. /* Note: if /proc/PID/cmdline is empty,
  466. * code below "breaks". Therefore it must be
  467. * the last code to parse /proc/PID/xxx data
  468. * (we used to have /proc/PID/exe parsing after it
  469. * and were getting stale sp->exe).
  470. */
  471. #if 0 /* PSSCAN_CMD is not used */
  472. if (flags & (PSSCAN_CMD|PSSCAN_ARGV0)) {
  473. free(sp->argv0);
  474. sp->argv0 = NULL;
  475. free(sp->cmd);
  476. sp->cmd = NULL;
  477. strcpy(filename_tail, "cmdline");
  478. /* TODO: to get rid of size limits, read into malloc buf,
  479. * then realloc it down to real size. */
  480. n = read_to_buf(filename, buf);
  481. if (n <= 0)
  482. break;
  483. if (flags & PSSCAN_ARGV0)
  484. sp->argv0 = xstrdup(buf);
  485. if (flags & PSSCAN_CMD) {
  486. do {
  487. n--;
  488. if ((unsigned char)(buf[n]) < ' ')
  489. buf[n] = ' ';
  490. } while (n);
  491. sp->cmd = xstrdup(buf);
  492. }
  493. }
  494. #else
  495. if (flags & (PSSCAN_ARGV0|PSSCAN_ARGVN)) {
  496. free(sp->argv0);
  497. sp->argv0 = NULL;
  498. strcpy(filename_tail, "cmdline");
  499. n = read_to_buf(filename, buf);
  500. if (n <= 0)
  501. break;
  502. if (flags & PSSCAN_ARGVN) {
  503. sp->argv_len = n;
  504. sp->argv0 = xmalloc(n + 1);
  505. memcpy(sp->argv0, buf, n + 1);
  506. /* sp->argv0[n] = '\0'; - buf has it */
  507. } else {
  508. sp->argv_len = 0;
  509. sp->argv0 = xstrdup(buf);
  510. }
  511. }
  512. #endif
  513. break;
  514. } /* for (;;) */
  515. return sp;
  516. }
  517. void FAST_FUNC read_cmdline(char *buf, int col, unsigned pid, const char *comm)
  518. {
  519. int sz;
  520. char filename[sizeof("/proc/%u/cmdline") + sizeof(int)*3];
  521. sprintf(filename, "/proc/%u/cmdline", pid);
  522. sz = open_read_close(filename, buf, col - 1);
  523. if (sz > 0) {
  524. const char *base;
  525. int comm_len;
  526. buf[sz] = '\0';
  527. while (--sz >= 0 && buf[sz] == '\0')
  528. continue;
  529. base = bb_basename(buf); /* before we replace argv0's NUL with space */
  530. while (sz >= 0) {
  531. if ((unsigned char)(buf[sz]) < ' ')
  532. buf[sz] = ' ';
  533. sz--;
  534. }
  535. /* If comm differs from argv0, prepend "{comm} ".
  536. * It allows to see thread names set by prctl(PR_SET_NAME).
  537. */
  538. if (base[0] == '-') /* "-sh" (login shell)? */
  539. base++;
  540. comm_len = strlen(comm);
  541. /* Why compare up to comm_len, not COMM_LEN-1?
  542. * Well, some processes rewrite argv, and use _spaces_ there
  543. * while rewriting. (KDE is observed to do it).
  544. * I prefer to still treat argv0 "process foo bar"
  545. * as 'equal' to comm "process".
  546. */
  547. if (strncmp(base, comm, comm_len) != 0) {
  548. comm_len += 3;
  549. if (col > comm_len)
  550. memmove(buf + comm_len, buf, col - comm_len);
  551. snprintf(buf, col, "{%s}", comm);
  552. if (col <= comm_len)
  553. return;
  554. buf[comm_len - 1] = ' ';
  555. buf[col - 1] = '\0';
  556. }
  557. } else {
  558. snprintf(buf, col, "[%s]", comm);
  559. }
  560. }
  561. /* from kernel:
  562. // pid comm S ppid pgid sid tty_nr tty_pgrp flg
  563. sprintf(buffer,"%d (%s) %c %d %d %d %d %d %lu %lu \
  564. %lu %lu %lu %lu %lu %ld %ld %ld %ld %d 0 %llu %lu %ld %lu %lu %lu %lu %lu \
  565. %lu %lu %lu %lu %lu %lu %lu %lu %d %d %lu %lu %llu\n",
  566. task->pid,
  567. tcomm,
  568. state,
  569. ppid,
  570. pgid,
  571. sid,
  572. tty_nr,
  573. tty_pgrp,
  574. task->flags,
  575. min_flt,
  576. cmin_flt,
  577. maj_flt,
  578. cmaj_flt,
  579. cputime_to_clock_t(utime),
  580. cputime_to_clock_t(stime),
  581. cputime_to_clock_t(cutime),
  582. cputime_to_clock_t(cstime),
  583. priority,
  584. nice,
  585. num_threads,
  586. // 0,
  587. start_time,
  588. vsize,
  589. mm ? get_mm_rss(mm) : 0,
  590. rsslim,
  591. mm ? mm->start_code : 0,
  592. mm ? mm->end_code : 0,
  593. mm ? mm->start_stack : 0,
  594. esp,
  595. eip,
  596. the rest is some obsolete cruft
  597. */