PageRenderTime 30ms CodeModel.GetById 18ms RepoModel.GetById 0ms app.codeStats 0ms

/tools/vm/slabinfo.c

https://github.com/mturquette/linux
C | 1472 lines | 1245 code | 186 blank | 41 comment | 268 complexity | 83ac4ba3d871e060b198484f30c71f22 MD5 | raw file
  1. /*
  2. * Slabinfo: Tool to get reports about slabs
  3. *
  4. * (C) 2007 sgi, Christoph Lameter
  5. * (C) 2011 Linux Foundation, Christoph Lameter
  6. *
  7. * Compile with:
  8. *
  9. * gcc -o slabinfo slabinfo.c
  10. */
  11. #include <stdio.h>
  12. #include <stdlib.h>
  13. #include <sys/types.h>
  14. #include <dirent.h>
  15. #include <strings.h>
  16. #include <string.h>
  17. #include <unistd.h>
  18. #include <stdarg.h>
  19. #include <getopt.h>
  20. #include <regex.h>
  21. #include <errno.h>
  22. #define MAX_SLABS 500
  23. #define MAX_ALIASES 500
  24. #define MAX_NODES 1024
  25. struct slabinfo {
  26. char *name;
  27. int alias;
  28. int refs;
  29. int aliases, align, cache_dma, cpu_slabs, destroy_by_rcu;
  30. int hwcache_align, object_size, objs_per_slab;
  31. int sanity_checks, slab_size, store_user, trace;
  32. int order, poison, reclaim_account, red_zone;
  33. unsigned long partial, objects, slabs, objects_partial, objects_total;
  34. unsigned long alloc_fastpath, alloc_slowpath;
  35. unsigned long free_fastpath, free_slowpath;
  36. unsigned long free_frozen, free_add_partial, free_remove_partial;
  37. unsigned long alloc_from_partial, alloc_slab, free_slab, alloc_refill;
  38. unsigned long cpuslab_flush, deactivate_full, deactivate_empty;
  39. unsigned long deactivate_to_head, deactivate_to_tail;
  40. unsigned long deactivate_remote_frees, order_fallback;
  41. unsigned long cmpxchg_double_cpu_fail, cmpxchg_double_fail;
  42. unsigned long alloc_node_mismatch, deactivate_bypass;
  43. unsigned long cpu_partial_alloc, cpu_partial_free;
  44. int numa[MAX_NODES];
  45. int numa_partial[MAX_NODES];
  46. } slabinfo[MAX_SLABS];
  47. struct aliasinfo {
  48. char *name;
  49. char *ref;
  50. struct slabinfo *slab;
  51. } aliasinfo[MAX_ALIASES];
  52. int slabs;
  53. int actual_slabs;
  54. int aliases;
  55. int alias_targets;
  56. int highest_node;
  57. char buffer[4096];
  58. int show_empty;
  59. int show_report;
  60. int show_alias;
  61. int show_slab;
  62. int skip_zero = 1;
  63. int show_numa;
  64. int show_track;
  65. int show_first_alias;
  66. int validate;
  67. int shrink;
  68. int show_inverted;
  69. int show_single_ref;
  70. int show_totals;
  71. int sort_size;
  72. int sort_active;
  73. int set_debug;
  74. int show_ops;
  75. int show_activity;
  76. int output_lines = -1;
  77. int sort_loss;
  78. int extended_totals;
  79. int show_bytes;
  80. /* Debug options */
  81. int sanity;
  82. int redzone;
  83. int poison;
  84. int tracking;
  85. int tracing;
  86. int page_size;
  87. regex_t pattern;
  88. static void fatal(const char *x, ...)
  89. {
  90. va_list ap;
  91. va_start(ap, x);
  92. vfprintf(stderr, x, ap);
  93. va_end(ap);
  94. exit(EXIT_FAILURE);
  95. }
  96. static void usage(void)
  97. {
  98. printf("slabinfo 4/15/2011. (c) 2007 sgi/(c) 2011 Linux Foundation.\n\n"
  99. "slabinfo [-ahnpvtsz] [-d debugopts] [slab-regexp]\n"
  100. "-a|--aliases Show aliases\n"
  101. "-A|--activity Most active slabs first\n"
  102. "-d<options>|--debug=<options> Set/Clear Debug options\n"
  103. "-D|--display-active Switch line format to activity\n"
  104. "-e|--empty Show empty slabs\n"
  105. "-f|--first-alias Show first alias\n"
  106. "-h|--help Show usage information\n"
  107. "-i|--inverted Inverted list\n"
  108. "-l|--slabs Show slabs\n"
  109. "-n|--numa Show NUMA information\n"
  110. "-o|--ops Show kmem_cache_ops\n"
  111. "-s|--shrink Shrink slabs\n"
  112. "-r|--report Detailed report on single slabs\n"
  113. "-S|--Size Sort by size\n"
  114. "-t|--tracking Show alloc/free information\n"
  115. "-T|--Totals Show summary information\n"
  116. "-v|--validate Validate slabs\n"
  117. "-z|--zero Include empty slabs\n"
  118. "-1|--1ref Single reference\n"
  119. "-N|--lines=K Show the first K slabs\n"
  120. "-L|--Loss Sort by loss\n"
  121. "-X|--Xtotals Show extended summary information\n"
  122. "-B|--Bytes Show size in bytes\n"
  123. "\nValid debug options (FZPUT may be combined)\n"
  124. "a / A Switch on all debug options (=FZUP)\n"
  125. "- Switch off all debug options\n"
  126. "f / F Sanity Checks (SLAB_CONSISTENCY_CHECKS)\n"
  127. "z / Z Redzoning\n"
  128. "p / P Poisoning\n"
  129. "u / U Tracking\n"
  130. "t / T Tracing\n"
  131. );
  132. }
  133. static unsigned long read_obj(const char *name)
  134. {
  135. FILE *f = fopen(name, "r");
  136. if (!f)
  137. buffer[0] = 0;
  138. else {
  139. if (!fgets(buffer, sizeof(buffer), f))
  140. buffer[0] = 0;
  141. fclose(f);
  142. if (buffer[strlen(buffer)] == '\n')
  143. buffer[strlen(buffer)] = 0;
  144. }
  145. return strlen(buffer);
  146. }
  147. /*
  148. * Get the contents of an attribute
  149. */
  150. static unsigned long get_obj(const char *name)
  151. {
  152. if (!read_obj(name))
  153. return 0;
  154. return atol(buffer);
  155. }
  156. static unsigned long get_obj_and_str(const char *name, char **x)
  157. {
  158. unsigned long result = 0;
  159. char *p;
  160. *x = NULL;
  161. if (!read_obj(name)) {
  162. x = NULL;
  163. return 0;
  164. }
  165. result = strtoul(buffer, &p, 10);
  166. while (*p == ' ')
  167. p++;
  168. if (*p)
  169. *x = strdup(p);
  170. return result;
  171. }
  172. static void set_obj(struct slabinfo *s, const char *name, int n)
  173. {
  174. char x[100];
  175. FILE *f;
  176. snprintf(x, 100, "%s/%s", s->name, name);
  177. f = fopen(x, "w");
  178. if (!f)
  179. fatal("Cannot write to %s\n", x);
  180. fprintf(f, "%d\n", n);
  181. fclose(f);
  182. }
  183. static unsigned long read_slab_obj(struct slabinfo *s, const char *name)
  184. {
  185. char x[100];
  186. FILE *f;
  187. size_t l;
  188. snprintf(x, 100, "%s/%s", s->name, name);
  189. f = fopen(x, "r");
  190. if (!f) {
  191. buffer[0] = 0;
  192. l = 0;
  193. } else {
  194. l = fread(buffer, 1, sizeof(buffer), f);
  195. buffer[l] = 0;
  196. fclose(f);
  197. }
  198. return l;
  199. }
  200. /*
  201. * Put a size string together
  202. */
  203. static int store_size(char *buffer, unsigned long value)
  204. {
  205. unsigned long divisor = 1;
  206. char trailer = 0;
  207. int n;
  208. if (!show_bytes) {
  209. if (value > 1000000000UL) {
  210. divisor = 100000000UL;
  211. trailer = 'G';
  212. } else if (value > 1000000UL) {
  213. divisor = 100000UL;
  214. trailer = 'M';
  215. } else if (value > 1000UL) {
  216. divisor = 100;
  217. trailer = 'K';
  218. }
  219. }
  220. value /= divisor;
  221. n = sprintf(buffer, "%ld",value);
  222. if (trailer) {
  223. buffer[n] = trailer;
  224. n++;
  225. buffer[n] = 0;
  226. }
  227. if (divisor != 1) {
  228. memmove(buffer + n - 2, buffer + n - 3, 4);
  229. buffer[n-2] = '.';
  230. n++;
  231. }
  232. return n;
  233. }
  234. static void decode_numa_list(int *numa, char *t)
  235. {
  236. int node;
  237. int nr;
  238. memset(numa, 0, MAX_NODES * sizeof(int));
  239. if (!t)
  240. return;
  241. while (*t == 'N') {
  242. t++;
  243. node = strtoul(t, &t, 10);
  244. if (*t == '=') {
  245. t++;
  246. nr = strtoul(t, &t, 10);
  247. numa[node] = nr;
  248. if (node > highest_node)
  249. highest_node = node;
  250. }
  251. while (*t == ' ')
  252. t++;
  253. }
  254. }
  255. static void slab_validate(struct slabinfo *s)
  256. {
  257. if (strcmp(s->name, "*") == 0)
  258. return;
  259. set_obj(s, "validate", 1);
  260. }
  261. static void slab_shrink(struct slabinfo *s)
  262. {
  263. if (strcmp(s->name, "*") == 0)
  264. return;
  265. set_obj(s, "shrink", 1);
  266. }
  267. int line = 0;
  268. static void first_line(void)
  269. {
  270. if (show_activity)
  271. printf("Name Objects Alloc Free"
  272. " %%Fast Fallb O CmpX UL\n");
  273. else
  274. printf("Name Objects Objsize %s "
  275. "Slabs/Part/Cpu O/S O %%Fr %%Ef Flg\n",
  276. sort_loss ? " Loss" : "Space");
  277. }
  278. /*
  279. * Find the shortest alias of a slab
  280. */
  281. static struct aliasinfo *find_one_alias(struct slabinfo *find)
  282. {
  283. struct aliasinfo *a;
  284. struct aliasinfo *best = NULL;
  285. for(a = aliasinfo;a < aliasinfo + aliases; a++) {
  286. if (a->slab == find &&
  287. (!best || strlen(best->name) < strlen(a->name))) {
  288. best = a;
  289. if (strncmp(a->name,"kmall", 5) == 0)
  290. return best;
  291. }
  292. }
  293. return best;
  294. }
  295. static unsigned long slab_size(struct slabinfo *s)
  296. {
  297. return s->slabs * (page_size << s->order);
  298. }
  299. static unsigned long slab_activity(struct slabinfo *s)
  300. {
  301. return s->alloc_fastpath + s->free_fastpath +
  302. s->alloc_slowpath + s->free_slowpath;
  303. }
  304. static unsigned long slab_waste(struct slabinfo *s)
  305. {
  306. return slab_size(s) - s->objects * s->object_size;
  307. }
  308. static void slab_numa(struct slabinfo *s, int mode)
  309. {
  310. int node;
  311. if (strcmp(s->name, "*") == 0)
  312. return;
  313. if (!highest_node) {
  314. printf("\n%s: No NUMA information available.\n", s->name);
  315. return;
  316. }
  317. if (skip_zero && !s->slabs)
  318. return;
  319. if (!line) {
  320. printf("\n%-21s:", mode ? "NUMA nodes" : "Slab");
  321. for(node = 0; node <= highest_node; node++)
  322. printf(" %4d", node);
  323. printf("\n----------------------");
  324. for(node = 0; node <= highest_node; node++)
  325. printf("-----");
  326. printf("\n");
  327. }
  328. printf("%-21s ", mode ? "All slabs" : s->name);
  329. for(node = 0; node <= highest_node; node++) {
  330. char b[20];
  331. store_size(b, s->numa[node]);
  332. printf(" %4s", b);
  333. }
  334. printf("\n");
  335. if (mode) {
  336. printf("%-21s ", "Partial slabs");
  337. for(node = 0; node <= highest_node; node++) {
  338. char b[20];
  339. store_size(b, s->numa_partial[node]);
  340. printf(" %4s", b);
  341. }
  342. printf("\n");
  343. }
  344. line++;
  345. }
  346. static void show_tracking(struct slabinfo *s)
  347. {
  348. printf("\n%s: Kernel object allocation\n", s->name);
  349. printf("-----------------------------------------------------------------------\n");
  350. if (read_slab_obj(s, "alloc_calls"))
  351. printf("%s", buffer);
  352. else
  353. printf("No Data\n");
  354. printf("\n%s: Kernel object freeing\n", s->name);
  355. printf("------------------------------------------------------------------------\n");
  356. if (read_slab_obj(s, "free_calls"))
  357. printf("%s", buffer);
  358. else
  359. printf("No Data\n");
  360. }
  361. static void ops(struct slabinfo *s)
  362. {
  363. if (strcmp(s->name, "*") == 0)
  364. return;
  365. if (read_slab_obj(s, "ops")) {
  366. printf("\n%s: kmem_cache operations\n", s->name);
  367. printf("--------------------------------------------\n");
  368. printf("%s", buffer);
  369. } else
  370. printf("\n%s has no kmem_cache operations\n", s->name);
  371. }
  372. static const char *onoff(int x)
  373. {
  374. if (x)
  375. return "On ";
  376. return "Off";
  377. }
  378. static void slab_stats(struct slabinfo *s)
  379. {
  380. unsigned long total_alloc;
  381. unsigned long total_free;
  382. unsigned long total;
  383. if (!s->alloc_slab)
  384. return;
  385. total_alloc = s->alloc_fastpath + s->alloc_slowpath;
  386. total_free = s->free_fastpath + s->free_slowpath;
  387. if (!total_alloc)
  388. return;
  389. printf("\n");
  390. printf("Slab Perf Counter Alloc Free %%Al %%Fr\n");
  391. printf("--------------------------------------------------\n");
  392. printf("Fastpath %8lu %8lu %3lu %3lu\n",
  393. s->alloc_fastpath, s->free_fastpath,
  394. s->alloc_fastpath * 100 / total_alloc,
  395. total_free ? s->free_fastpath * 100 / total_free : 0);
  396. printf("Slowpath %8lu %8lu %3lu %3lu\n",
  397. total_alloc - s->alloc_fastpath, s->free_slowpath,
  398. (total_alloc - s->alloc_fastpath) * 100 / total_alloc,
  399. total_free ? s->free_slowpath * 100 / total_free : 0);
  400. printf("Page Alloc %8lu %8lu %3lu %3lu\n",
  401. s->alloc_slab, s->free_slab,
  402. s->alloc_slab * 100 / total_alloc,
  403. total_free ? s->free_slab * 100 / total_free : 0);
  404. printf("Add partial %8lu %8lu %3lu %3lu\n",
  405. s->deactivate_to_head + s->deactivate_to_tail,
  406. s->free_add_partial,
  407. (s->deactivate_to_head + s->deactivate_to_tail) * 100 / total_alloc,
  408. total_free ? s->free_add_partial * 100 / total_free : 0);
  409. printf("Remove partial %8lu %8lu %3lu %3lu\n",
  410. s->alloc_from_partial, s->free_remove_partial,
  411. s->alloc_from_partial * 100 / total_alloc,
  412. total_free ? s->free_remove_partial * 100 / total_free : 0);
  413. printf("Cpu partial list %8lu %8lu %3lu %3lu\n",
  414. s->cpu_partial_alloc, s->cpu_partial_free,
  415. s->cpu_partial_alloc * 100 / total_alloc,
  416. total_free ? s->cpu_partial_free * 100 / total_free : 0);
  417. printf("RemoteObj/SlabFrozen %8lu %8lu %3lu %3lu\n",
  418. s->deactivate_remote_frees, s->free_frozen,
  419. s->deactivate_remote_frees * 100 / total_alloc,
  420. total_free ? s->free_frozen * 100 / total_free : 0);
  421. printf("Total %8lu %8lu\n\n", total_alloc, total_free);
  422. if (s->cpuslab_flush)
  423. printf("Flushes %8lu\n", s->cpuslab_flush);
  424. total = s->deactivate_full + s->deactivate_empty +
  425. s->deactivate_to_head + s->deactivate_to_tail + s->deactivate_bypass;
  426. if (total) {
  427. printf("\nSlab Deactivation Ocurrences %%\n");
  428. printf("-------------------------------------------------\n");
  429. printf("Slab full %7lu %3lu%%\n",
  430. s->deactivate_full, (s->deactivate_full * 100) / total);
  431. printf("Slab empty %7lu %3lu%%\n",
  432. s->deactivate_empty, (s->deactivate_empty * 100) / total);
  433. printf("Moved to head of partial list %7lu %3lu%%\n",
  434. s->deactivate_to_head, (s->deactivate_to_head * 100) / total);
  435. printf("Moved to tail of partial list %7lu %3lu%%\n",
  436. s->deactivate_to_tail, (s->deactivate_to_tail * 100) / total);
  437. printf("Deactivation bypass %7lu %3lu%%\n",
  438. s->deactivate_bypass, (s->deactivate_bypass * 100) / total);
  439. printf("Refilled from foreign frees %7lu %3lu%%\n",
  440. s->alloc_refill, (s->alloc_refill * 100) / total);
  441. printf("Node mismatch %7lu %3lu%%\n",
  442. s->alloc_node_mismatch, (s->alloc_node_mismatch * 100) / total);
  443. }
  444. if (s->cmpxchg_double_fail || s->cmpxchg_double_cpu_fail)
  445. printf("\nCmpxchg_double Looping\n------------------------\n");
  446. printf("Locked Cmpxchg Double redos %lu\nUnlocked Cmpxchg Double redos %lu\n",
  447. s->cmpxchg_double_fail, s->cmpxchg_double_cpu_fail);
  448. }
  449. static void report(struct slabinfo *s)
  450. {
  451. if (strcmp(s->name, "*") == 0)
  452. return;
  453. printf("\nSlabcache: %-15s Aliases: %2d Order : %2d Objects: %lu\n",
  454. s->name, s->aliases, s->order, s->objects);
  455. if (s->hwcache_align)
  456. printf("** Hardware cacheline aligned\n");
  457. if (s->cache_dma)
  458. printf("** Memory is allocated in a special DMA zone\n");
  459. if (s->destroy_by_rcu)
  460. printf("** Slabs are destroyed via RCU\n");
  461. if (s->reclaim_account)
  462. printf("** Reclaim accounting active\n");
  463. printf("\nSizes (bytes) Slabs Debug Memory\n");
  464. printf("------------------------------------------------------------------------\n");
  465. printf("Object : %7d Total : %7ld Sanity Checks : %s Total: %7ld\n",
  466. s->object_size, s->slabs, onoff(s->sanity_checks),
  467. s->slabs * (page_size << s->order));
  468. printf("SlabObj: %7d Full : %7ld Redzoning : %s Used : %7ld\n",
  469. s->slab_size, s->slabs - s->partial - s->cpu_slabs,
  470. onoff(s->red_zone), s->objects * s->object_size);
  471. printf("SlabSiz: %7d Partial: %7ld Poisoning : %s Loss : %7ld\n",
  472. page_size << s->order, s->partial, onoff(s->poison),
  473. s->slabs * (page_size << s->order) - s->objects * s->object_size);
  474. printf("Loss : %7d CpuSlab: %7d Tracking : %s Lalig: %7ld\n",
  475. s->slab_size - s->object_size, s->cpu_slabs, onoff(s->store_user),
  476. (s->slab_size - s->object_size) * s->objects);
  477. printf("Align : %7d Objects: %7d Tracing : %s Lpadd: %7ld\n",
  478. s->align, s->objs_per_slab, onoff(s->trace),
  479. ((page_size << s->order) - s->objs_per_slab * s->slab_size) *
  480. s->slabs);
  481. ops(s);
  482. show_tracking(s);
  483. slab_numa(s, 1);
  484. slab_stats(s);
  485. }
  486. static void slabcache(struct slabinfo *s)
  487. {
  488. char size_str[20];
  489. char dist_str[40];
  490. char flags[20];
  491. char *p = flags;
  492. if (strcmp(s->name, "*") == 0)
  493. return;
  494. if (actual_slabs == 1) {
  495. report(s);
  496. return;
  497. }
  498. if (skip_zero && !show_empty && !s->slabs)
  499. return;
  500. if (show_empty && s->slabs)
  501. return;
  502. if (sort_loss == 0)
  503. store_size(size_str, slab_size(s));
  504. else
  505. store_size(size_str, slab_waste(s));
  506. snprintf(dist_str, 40, "%lu/%lu/%d", s->slabs - s->cpu_slabs,
  507. s->partial, s->cpu_slabs);
  508. if (!line++)
  509. first_line();
  510. if (s->aliases)
  511. *p++ = '*';
  512. if (s->cache_dma)
  513. *p++ = 'd';
  514. if (s->hwcache_align)
  515. *p++ = 'A';
  516. if (s->poison)
  517. *p++ = 'P';
  518. if (s->reclaim_account)
  519. *p++ = 'a';
  520. if (s->red_zone)
  521. *p++ = 'Z';
  522. if (s->sanity_checks)
  523. *p++ = 'F';
  524. if (s->store_user)
  525. *p++ = 'U';
  526. if (s->trace)
  527. *p++ = 'T';
  528. *p = 0;
  529. if (show_activity) {
  530. unsigned long total_alloc;
  531. unsigned long total_free;
  532. total_alloc = s->alloc_fastpath + s->alloc_slowpath;
  533. total_free = s->free_fastpath + s->free_slowpath;
  534. printf("%-21s %8ld %10ld %10ld %3ld %3ld %5ld %1d %4ld %4ld\n",
  535. s->name, s->objects,
  536. total_alloc, total_free,
  537. total_alloc ? (s->alloc_fastpath * 100 / total_alloc) : 0,
  538. total_free ? (s->free_fastpath * 100 / total_free) : 0,
  539. s->order_fallback, s->order, s->cmpxchg_double_fail,
  540. s->cmpxchg_double_cpu_fail);
  541. } else {
  542. printf("%-21s %8ld %7d %15s %14s %4d %1d %3ld %3ld %s\n",
  543. s->name, s->objects, s->object_size, size_str, dist_str,
  544. s->objs_per_slab, s->order,
  545. s->slabs ? (s->partial * 100) / s->slabs : 100,
  546. s->slabs ? (s->objects * s->object_size * 100) /
  547. (s->slabs * (page_size << s->order)) : 100,
  548. flags);
  549. }
  550. }
  551. /*
  552. * Analyze debug options. Return false if something is amiss.
  553. */
  554. static int debug_opt_scan(char *opt)
  555. {
  556. if (!opt || !opt[0] || strcmp(opt, "-") == 0)
  557. return 1;
  558. if (strcasecmp(opt, "a") == 0) {
  559. sanity = 1;
  560. poison = 1;
  561. redzone = 1;
  562. tracking = 1;
  563. return 1;
  564. }
  565. for ( ; *opt; opt++)
  566. switch (*opt) {
  567. case 'F' : case 'f':
  568. if (sanity)
  569. return 0;
  570. sanity = 1;
  571. break;
  572. case 'P' : case 'p':
  573. if (poison)
  574. return 0;
  575. poison = 1;
  576. break;
  577. case 'Z' : case 'z':
  578. if (redzone)
  579. return 0;
  580. redzone = 1;
  581. break;
  582. case 'U' : case 'u':
  583. if (tracking)
  584. return 0;
  585. tracking = 1;
  586. break;
  587. case 'T' : case 't':
  588. if (tracing)
  589. return 0;
  590. tracing = 1;
  591. break;
  592. default:
  593. return 0;
  594. }
  595. return 1;
  596. }
  597. static int slab_empty(struct slabinfo *s)
  598. {
  599. if (s->objects > 0)
  600. return 0;
  601. /*
  602. * We may still have slabs even if there are no objects. Shrinking will
  603. * remove them.
  604. */
  605. if (s->slabs != 0)
  606. set_obj(s, "shrink", 1);
  607. return 1;
  608. }
  609. static void slab_debug(struct slabinfo *s)
  610. {
  611. if (strcmp(s->name, "*") == 0)
  612. return;
  613. if (sanity && !s->sanity_checks) {
  614. set_obj(s, "sanity", 1);
  615. }
  616. if (!sanity && s->sanity_checks) {
  617. if (slab_empty(s))
  618. set_obj(s, "sanity", 0);
  619. else
  620. fprintf(stderr, "%s not empty cannot disable sanity checks\n", s->name);
  621. }
  622. if (redzone && !s->red_zone) {
  623. if (slab_empty(s))
  624. set_obj(s, "red_zone", 1);
  625. else
  626. fprintf(stderr, "%s not empty cannot enable redzoning\n", s->name);
  627. }
  628. if (!redzone && s->red_zone) {
  629. if (slab_empty(s))
  630. set_obj(s, "red_zone", 0);
  631. else
  632. fprintf(stderr, "%s not empty cannot disable redzoning\n", s->name);
  633. }
  634. if (poison && !s->poison) {
  635. if (slab_empty(s))
  636. set_obj(s, "poison", 1);
  637. else
  638. fprintf(stderr, "%s not empty cannot enable poisoning\n", s->name);
  639. }
  640. if (!poison && s->poison) {
  641. if (slab_empty(s))
  642. set_obj(s, "poison", 0);
  643. else
  644. fprintf(stderr, "%s not empty cannot disable poisoning\n", s->name);
  645. }
  646. if (tracking && !s->store_user) {
  647. if (slab_empty(s))
  648. set_obj(s, "store_user", 1);
  649. else
  650. fprintf(stderr, "%s not empty cannot enable tracking\n", s->name);
  651. }
  652. if (!tracking && s->store_user) {
  653. if (slab_empty(s))
  654. set_obj(s, "store_user", 0);
  655. else
  656. fprintf(stderr, "%s not empty cannot disable tracking\n", s->name);
  657. }
  658. if (tracing && !s->trace) {
  659. if (slabs == 1)
  660. set_obj(s, "trace", 1);
  661. else
  662. fprintf(stderr, "%s can only enable trace for one slab at a time\n", s->name);
  663. }
  664. if (!tracing && s->trace)
  665. set_obj(s, "trace", 1);
  666. }
  667. static void totals(void)
  668. {
  669. struct slabinfo *s;
  670. int used_slabs = 0;
  671. char b1[20], b2[20], b3[20], b4[20];
  672. unsigned long long max = 1ULL << 63;
  673. /* Object size */
  674. unsigned long long min_objsize = max, max_objsize = 0, avg_objsize;
  675. /* Number of partial slabs in a slabcache */
  676. unsigned long long min_partial = max, max_partial = 0,
  677. avg_partial, total_partial = 0;
  678. /* Number of slabs in a slab cache */
  679. unsigned long long min_slabs = max, max_slabs = 0,
  680. avg_slabs, total_slabs = 0;
  681. /* Size of the whole slab */
  682. unsigned long long min_size = max, max_size = 0,
  683. avg_size, total_size = 0;
  684. /* Bytes used for object storage in a slab */
  685. unsigned long long min_used = max, max_used = 0,
  686. avg_used, total_used = 0;
  687. /* Waste: Bytes used for alignment and padding */
  688. unsigned long long min_waste = max, max_waste = 0,
  689. avg_waste, total_waste = 0;
  690. /* Number of objects in a slab */
  691. unsigned long long min_objects = max, max_objects = 0,
  692. avg_objects, total_objects = 0;
  693. /* Waste per object */
  694. unsigned long long min_objwaste = max,
  695. max_objwaste = 0, avg_objwaste,
  696. total_objwaste = 0;
  697. /* Memory per object */
  698. unsigned long long min_memobj = max,
  699. max_memobj = 0, avg_memobj,
  700. total_objsize = 0;
  701. /* Percentage of partial slabs per slab */
  702. unsigned long min_ppart = 100, max_ppart = 0,
  703. avg_ppart, total_ppart = 0;
  704. /* Number of objects in partial slabs */
  705. unsigned long min_partobj = max, max_partobj = 0,
  706. avg_partobj, total_partobj = 0;
  707. /* Percentage of partial objects of all objects in a slab */
  708. unsigned long min_ppartobj = 100, max_ppartobj = 0,
  709. avg_ppartobj, total_ppartobj = 0;
  710. for (s = slabinfo; s < slabinfo + slabs; s++) {
  711. unsigned long long size;
  712. unsigned long used;
  713. unsigned long long wasted;
  714. unsigned long long objwaste;
  715. unsigned long percentage_partial_slabs;
  716. unsigned long percentage_partial_objs;
  717. if (!s->slabs || !s->objects)
  718. continue;
  719. used_slabs++;
  720. size = slab_size(s);
  721. used = s->objects * s->object_size;
  722. wasted = size - used;
  723. objwaste = s->slab_size - s->object_size;
  724. percentage_partial_slabs = s->partial * 100 / s->slabs;
  725. if (percentage_partial_slabs > 100)
  726. percentage_partial_slabs = 100;
  727. percentage_partial_objs = s->objects_partial * 100
  728. / s->objects;
  729. if (percentage_partial_objs > 100)
  730. percentage_partial_objs = 100;
  731. if (s->object_size < min_objsize)
  732. min_objsize = s->object_size;
  733. if (s->partial < min_partial)
  734. min_partial = s->partial;
  735. if (s->slabs < min_slabs)
  736. min_slabs = s->slabs;
  737. if (size < min_size)
  738. min_size = size;
  739. if (wasted < min_waste)
  740. min_waste = wasted;
  741. if (objwaste < min_objwaste)
  742. min_objwaste = objwaste;
  743. if (s->objects < min_objects)
  744. min_objects = s->objects;
  745. if (used < min_used)
  746. min_used = used;
  747. if (s->objects_partial < min_partobj)
  748. min_partobj = s->objects_partial;
  749. if (percentage_partial_slabs < min_ppart)
  750. min_ppart = percentage_partial_slabs;
  751. if (percentage_partial_objs < min_ppartobj)
  752. min_ppartobj = percentage_partial_objs;
  753. if (s->slab_size < min_memobj)
  754. min_memobj = s->slab_size;
  755. if (s->object_size > max_objsize)
  756. max_objsize = s->object_size;
  757. if (s->partial > max_partial)
  758. max_partial = s->partial;
  759. if (s->slabs > max_slabs)
  760. max_slabs = s->slabs;
  761. if (size > max_size)
  762. max_size = size;
  763. if (wasted > max_waste)
  764. max_waste = wasted;
  765. if (objwaste > max_objwaste)
  766. max_objwaste = objwaste;
  767. if (s->objects > max_objects)
  768. max_objects = s->objects;
  769. if (used > max_used)
  770. max_used = used;
  771. if (s->objects_partial > max_partobj)
  772. max_partobj = s->objects_partial;
  773. if (percentage_partial_slabs > max_ppart)
  774. max_ppart = percentage_partial_slabs;
  775. if (percentage_partial_objs > max_ppartobj)
  776. max_ppartobj = percentage_partial_objs;
  777. if (s->slab_size > max_memobj)
  778. max_memobj = s->slab_size;
  779. total_partial += s->partial;
  780. total_slabs += s->slabs;
  781. total_size += size;
  782. total_waste += wasted;
  783. total_objects += s->objects;
  784. total_used += used;
  785. total_partobj += s->objects_partial;
  786. total_ppart += percentage_partial_slabs;
  787. total_ppartobj += percentage_partial_objs;
  788. total_objwaste += s->objects * objwaste;
  789. total_objsize += s->objects * s->slab_size;
  790. }
  791. if (!total_objects) {
  792. printf("No objects\n");
  793. return;
  794. }
  795. if (!used_slabs) {
  796. printf("No slabs\n");
  797. return;
  798. }
  799. /* Per slab averages */
  800. avg_partial = total_partial / used_slabs;
  801. avg_slabs = total_slabs / used_slabs;
  802. avg_size = total_size / used_slabs;
  803. avg_waste = total_waste / used_slabs;
  804. avg_objects = total_objects / used_slabs;
  805. avg_used = total_used / used_slabs;
  806. avg_partobj = total_partobj / used_slabs;
  807. avg_ppart = total_ppart / used_slabs;
  808. avg_ppartobj = total_ppartobj / used_slabs;
  809. /* Per object object sizes */
  810. avg_objsize = total_used / total_objects;
  811. avg_objwaste = total_objwaste / total_objects;
  812. avg_partobj = total_partobj * 100 / total_objects;
  813. avg_memobj = total_objsize / total_objects;
  814. printf("Slabcache Totals\n");
  815. printf("----------------\n");
  816. printf("Slabcaches : %15d Aliases : %11d->%-3d Active: %3d\n",
  817. slabs, aliases, alias_targets, used_slabs);
  818. store_size(b1, total_size);store_size(b2, total_waste);
  819. store_size(b3, total_waste * 100 / total_used);
  820. printf("Memory used: %15s # Loss : %15s MRatio:%6s%%\n", b1, b2, b3);
  821. store_size(b1, total_objects);store_size(b2, total_partobj);
  822. store_size(b3, total_partobj * 100 / total_objects);
  823. printf("# Objects : %15s # PartObj: %15s ORatio:%6s%%\n", b1, b2, b3);
  824. printf("\n");
  825. printf("Per Cache Average "
  826. "Min Max Total\n");
  827. printf("---------------------------------------"
  828. "-------------------------------------\n");
  829. store_size(b1, avg_objects);store_size(b2, min_objects);
  830. store_size(b3, max_objects);store_size(b4, total_objects);
  831. printf("#Objects %15s %15s %15s %15s\n",
  832. b1, b2, b3, b4);
  833. store_size(b1, avg_slabs);store_size(b2, min_slabs);
  834. store_size(b3, max_slabs);store_size(b4, total_slabs);
  835. printf("#Slabs %15s %15s %15s %15s\n",
  836. b1, b2, b3, b4);
  837. store_size(b1, avg_partial);store_size(b2, min_partial);
  838. store_size(b3, max_partial);store_size(b4, total_partial);
  839. printf("#PartSlab %15s %15s %15s %15s\n",
  840. b1, b2, b3, b4);
  841. store_size(b1, avg_ppart);store_size(b2, min_ppart);
  842. store_size(b3, max_ppart);
  843. store_size(b4, total_partial * 100 / total_slabs);
  844. printf("%%PartSlab%15s%% %15s%% %15s%% %15s%%\n",
  845. b1, b2, b3, b4);
  846. store_size(b1, avg_partobj);store_size(b2, min_partobj);
  847. store_size(b3, max_partobj);
  848. store_size(b4, total_partobj);
  849. printf("PartObjs %15s %15s %15s %15s\n",
  850. b1, b2, b3, b4);
  851. store_size(b1, avg_ppartobj);store_size(b2, min_ppartobj);
  852. store_size(b3, max_ppartobj);
  853. store_size(b4, total_partobj * 100 / total_objects);
  854. printf("%% PartObj%15s%% %15s%% %15s%% %15s%%\n",
  855. b1, b2, b3, b4);
  856. store_size(b1, avg_size);store_size(b2, min_size);
  857. store_size(b3, max_size);store_size(b4, total_size);
  858. printf("Memory %15s %15s %15s %15s\n",
  859. b1, b2, b3, b4);
  860. store_size(b1, avg_used);store_size(b2, min_used);
  861. store_size(b3, max_used);store_size(b4, total_used);
  862. printf("Used %15s %15s %15s %15s\n",
  863. b1, b2, b3, b4);
  864. store_size(b1, avg_waste);store_size(b2, min_waste);
  865. store_size(b3, max_waste);store_size(b4, total_waste);
  866. printf("Loss %15s %15s %15s %15s\n",
  867. b1, b2, b3, b4);
  868. printf("\n");
  869. printf("Per Object Average "
  870. "Min Max\n");
  871. printf("---------------------------------------"
  872. "--------------------\n");
  873. store_size(b1, avg_memobj);store_size(b2, min_memobj);
  874. store_size(b3, max_memobj);
  875. printf("Memory %15s %15s %15s\n",
  876. b1, b2, b3);
  877. store_size(b1, avg_objsize);store_size(b2, min_objsize);
  878. store_size(b3, max_objsize);
  879. printf("User %15s %15s %15s\n",
  880. b1, b2, b3);
  881. store_size(b1, avg_objwaste);store_size(b2, min_objwaste);
  882. store_size(b3, max_objwaste);
  883. printf("Loss %15s %15s %15s\n",
  884. b1, b2, b3);
  885. }
  886. static void sort_slabs(void)
  887. {
  888. struct slabinfo *s1,*s2;
  889. for (s1 = slabinfo; s1 < slabinfo + slabs; s1++) {
  890. for (s2 = s1 + 1; s2 < slabinfo + slabs; s2++) {
  891. int result;
  892. if (sort_size)
  893. result = slab_size(s1) < slab_size(s2);
  894. else if (sort_active)
  895. result = slab_activity(s1) < slab_activity(s2);
  896. else if (sort_loss)
  897. result = slab_waste(s1) < slab_waste(s2);
  898. else
  899. result = strcasecmp(s1->name, s2->name);
  900. if (show_inverted)
  901. result = -result;
  902. if (result > 0) {
  903. struct slabinfo t;
  904. memcpy(&t, s1, sizeof(struct slabinfo));
  905. memcpy(s1, s2, sizeof(struct slabinfo));
  906. memcpy(s2, &t, sizeof(struct slabinfo));
  907. }
  908. }
  909. }
  910. }
  911. static void sort_aliases(void)
  912. {
  913. struct aliasinfo *a1,*a2;
  914. for (a1 = aliasinfo; a1 < aliasinfo + aliases; a1++) {
  915. for (a2 = a1 + 1; a2 < aliasinfo + aliases; a2++) {
  916. char *n1, *n2;
  917. n1 = a1->name;
  918. n2 = a2->name;
  919. if (show_alias && !show_inverted) {
  920. n1 = a1->ref;
  921. n2 = a2->ref;
  922. }
  923. if (strcasecmp(n1, n2) > 0) {
  924. struct aliasinfo t;
  925. memcpy(&t, a1, sizeof(struct aliasinfo));
  926. memcpy(a1, a2, sizeof(struct aliasinfo));
  927. memcpy(a2, &t, sizeof(struct aliasinfo));
  928. }
  929. }
  930. }
  931. }
  932. static void link_slabs(void)
  933. {
  934. struct aliasinfo *a;
  935. struct slabinfo *s;
  936. for (a = aliasinfo; a < aliasinfo + aliases; a++) {
  937. for (s = slabinfo; s < slabinfo + slabs; s++)
  938. if (strcmp(a->ref, s->name) == 0) {
  939. a->slab = s;
  940. s->refs++;
  941. break;
  942. }
  943. if (s == slabinfo + slabs)
  944. fatal("Unresolved alias %s\n", a->ref);
  945. }
  946. }
  947. static void alias(void)
  948. {
  949. struct aliasinfo *a;
  950. char *active = NULL;
  951. sort_aliases();
  952. link_slabs();
  953. for(a = aliasinfo; a < aliasinfo + aliases; a++) {
  954. if (!show_single_ref && a->slab->refs == 1)
  955. continue;
  956. if (!show_inverted) {
  957. if (active) {
  958. if (strcmp(a->slab->name, active) == 0) {
  959. printf(" %s", a->name);
  960. continue;
  961. }
  962. }
  963. printf("\n%-12s <- %s", a->slab->name, a->name);
  964. active = a->slab->name;
  965. }
  966. else
  967. printf("%-15s -> %s\n", a->name, a->slab->name);
  968. }
  969. if (active)
  970. printf("\n");
  971. }
  972. static void rename_slabs(void)
  973. {
  974. struct slabinfo *s;
  975. struct aliasinfo *a;
  976. for (s = slabinfo; s < slabinfo + slabs; s++) {
  977. if (*s->name != ':')
  978. continue;
  979. if (s->refs > 1 && !show_first_alias)
  980. continue;
  981. a = find_one_alias(s);
  982. if (a)
  983. s->name = a->name;
  984. else {
  985. s->name = "*";
  986. actual_slabs--;
  987. }
  988. }
  989. }
  990. static int slab_mismatch(char *slab)
  991. {
  992. return regexec(&pattern, slab, 0, NULL, 0);
  993. }
  994. static void read_slab_dir(void)
  995. {
  996. DIR *dir;
  997. struct dirent *de;
  998. struct slabinfo *slab = slabinfo;
  999. struct aliasinfo *alias = aliasinfo;
  1000. char *p;
  1001. char *t;
  1002. int count;
  1003. if (chdir("/sys/kernel/slab") && chdir("/sys/slab"))
  1004. fatal("SYSFS support for SLUB not active\n");
  1005. dir = opendir(".");
  1006. while ((de = readdir(dir))) {
  1007. if (de->d_name[0] == '.' ||
  1008. (de->d_name[0] != ':' && slab_mismatch(de->d_name)))
  1009. continue;
  1010. switch (de->d_type) {
  1011. case DT_LNK:
  1012. alias->name = strdup(de->d_name);
  1013. count = readlink(de->d_name, buffer, sizeof(buffer)-1);
  1014. if (count < 0)
  1015. fatal("Cannot read symlink %s\n", de->d_name);
  1016. buffer[count] = 0;
  1017. p = buffer + count;
  1018. while (p > buffer && p[-1] != '/')
  1019. p--;
  1020. alias->ref = strdup(p);
  1021. alias++;
  1022. break;
  1023. case DT_DIR:
  1024. if (chdir(de->d_name))
  1025. fatal("Unable to access slab %s\n", slab->name);
  1026. slab->name = strdup(de->d_name);
  1027. slab->alias = 0;
  1028. slab->refs = 0;
  1029. slab->aliases = get_obj("aliases");
  1030. slab->align = get_obj("align");
  1031. slab->cache_dma = get_obj("cache_dma");
  1032. slab->cpu_slabs = get_obj("cpu_slabs");
  1033. slab->destroy_by_rcu = get_obj("destroy_by_rcu");
  1034. slab->hwcache_align = get_obj("hwcache_align");
  1035. slab->object_size = get_obj("object_size");
  1036. slab->objects = get_obj("objects");
  1037. slab->objects_partial = get_obj("objects_partial");
  1038. slab->objects_total = get_obj("objects_total");
  1039. slab->objs_per_slab = get_obj("objs_per_slab");
  1040. slab->order = get_obj("order");
  1041. slab->partial = get_obj("partial");
  1042. slab->partial = get_obj_and_str("partial", &t);
  1043. decode_numa_list(slab->numa_partial, t);
  1044. free(t);
  1045. slab->poison = get_obj("poison");
  1046. slab->reclaim_account = get_obj("reclaim_account");
  1047. slab->red_zone = get_obj("red_zone");
  1048. slab->sanity_checks = get_obj("sanity_checks");
  1049. slab->slab_size = get_obj("slab_size");
  1050. slab->slabs = get_obj_and_str("slabs", &t);
  1051. decode_numa_list(slab->numa, t);
  1052. free(t);
  1053. slab->store_user = get_obj("store_user");
  1054. slab->trace = get_obj("trace");
  1055. slab->alloc_fastpath = get_obj("alloc_fastpath");
  1056. slab->alloc_slowpath = get_obj("alloc_slowpath");
  1057. slab->free_fastpath = get_obj("free_fastpath");
  1058. slab->free_slowpath = get_obj("free_slowpath");
  1059. slab->free_frozen= get_obj("free_frozen");
  1060. slab->free_add_partial = get_obj("free_add_partial");
  1061. slab->free_remove_partial = get_obj("free_remove_partial");
  1062. slab->alloc_from_partial = get_obj("alloc_from_partial");
  1063. slab->alloc_slab = get_obj("alloc_slab");
  1064. slab->alloc_refill = get_obj("alloc_refill");
  1065. slab->free_slab = get_obj("free_slab");
  1066. slab->cpuslab_flush = get_obj("cpuslab_flush");
  1067. slab->deactivate_full = get_obj("deactivate_full");
  1068. slab->deactivate_empty = get_obj("deactivate_empty");
  1069. slab->deactivate_to_head = get_obj("deactivate_to_head");
  1070. slab->deactivate_to_tail = get_obj("deactivate_to_tail");
  1071. slab->deactivate_remote_frees = get_obj("deactivate_remote_frees");
  1072. slab->order_fallback = get_obj("order_fallback");
  1073. slab->cmpxchg_double_cpu_fail = get_obj("cmpxchg_double_cpu_fail");
  1074. slab->cmpxchg_double_fail = get_obj("cmpxchg_double_fail");
  1075. slab->cpu_partial_alloc = get_obj("cpu_partial_alloc");
  1076. slab->cpu_partial_free = get_obj("cpu_partial_free");
  1077. slab->alloc_node_mismatch = get_obj("alloc_node_mismatch");
  1078. slab->deactivate_bypass = get_obj("deactivate_bypass");
  1079. chdir("..");
  1080. if (slab->name[0] == ':')
  1081. alias_targets++;
  1082. slab++;
  1083. break;
  1084. default :
  1085. fatal("Unknown file type %lx\n", de->d_type);
  1086. }
  1087. }
  1088. closedir(dir);
  1089. slabs = slab - slabinfo;
  1090. actual_slabs = slabs;
  1091. aliases = alias - aliasinfo;
  1092. if (slabs > MAX_SLABS)
  1093. fatal("Too many slabs\n");
  1094. if (aliases > MAX_ALIASES)
  1095. fatal("Too many aliases\n");
  1096. }
  1097. static void output_slabs(void)
  1098. {
  1099. struct slabinfo *slab;
  1100. int lines = output_lines;
  1101. for (slab = slabinfo; (slab < slabinfo + slabs) &&
  1102. lines != 0; slab++) {
  1103. if (slab->alias)
  1104. continue;
  1105. if (lines != -1)
  1106. lines--;
  1107. if (show_numa)
  1108. slab_numa(slab, 0);
  1109. else if (show_track)
  1110. show_tracking(slab);
  1111. else if (validate)
  1112. slab_validate(slab);
  1113. else if (shrink)
  1114. slab_shrink(slab);
  1115. else if (set_debug)
  1116. slab_debug(slab);
  1117. else if (show_ops)
  1118. ops(slab);
  1119. else if (show_slab)
  1120. slabcache(slab);
  1121. else if (show_report)
  1122. report(slab);
  1123. }
  1124. }
  1125. static void xtotals(void)
  1126. {
  1127. totals();
  1128. link_slabs();
  1129. rename_slabs();
  1130. printf("\nSlabs sorted by size\n");
  1131. printf("--------------------\n");
  1132. sort_loss = 0;
  1133. sort_size = 1;
  1134. sort_slabs();
  1135. output_slabs();
  1136. printf("\nSlabs sorted by loss\n");
  1137. printf("--------------------\n");
  1138. line = 0;
  1139. sort_loss = 1;
  1140. sort_size = 0;
  1141. sort_slabs();
  1142. output_slabs();
  1143. printf("\n");
  1144. }
  1145. struct option opts[] = {
  1146. { "aliases", no_argument, NULL, 'a' },
  1147. { "activity", no_argument, NULL, 'A' },
  1148. { "debug", optional_argument, NULL, 'd' },
  1149. { "display-activity", no_argument, NULL, 'D' },
  1150. { "empty", no_argument, NULL, 'e' },
  1151. { "first-alias", no_argument, NULL, 'f' },
  1152. { "help", no_argument, NULL, 'h' },
  1153. { "inverted", no_argument, NULL, 'i'},
  1154. { "slabs", no_argument, NULL, 'l' },
  1155. { "numa", no_argument, NULL, 'n' },
  1156. { "ops", no_argument, NULL, 'o' },
  1157. { "shrink", no_argument, NULL, 's' },
  1158. { "report", no_argument, NULL, 'r' },
  1159. { "Size", no_argument, NULL, 'S'},
  1160. { "tracking", no_argument, NULL, 't'},
  1161. { "Totals", no_argument, NULL, 'T'},
  1162. { "validate", no_argument, NULL, 'v' },
  1163. { "zero", no_argument, NULL, 'z' },
  1164. { "1ref", no_argument, NULL, '1'},
  1165. { "lines", required_argument, NULL, 'N'},
  1166. { "Loss", no_argument, NULL, 'L'},
  1167. { "Xtotals", no_argument, NULL, 'X'},
  1168. { "Bytes", no_argument, NULL, 'B'},
  1169. { NULL, 0, NULL, 0 }
  1170. };
  1171. int main(int argc, char *argv[])
  1172. {
  1173. int c;
  1174. int err;
  1175. char *pattern_source;
  1176. page_size = getpagesize();
  1177. while ((c = getopt_long(argc, argv, "aAd::Defhil1noprstvzTSN:LXB",
  1178. opts, NULL)) != -1)
  1179. switch (c) {
  1180. case '1':
  1181. show_single_ref = 1;
  1182. break;
  1183. case 'a':
  1184. show_alias = 1;
  1185. break;
  1186. case 'A':
  1187. sort_active = 1;
  1188. break;
  1189. case 'd':
  1190. set_debug = 1;
  1191. if (!debug_opt_scan(optarg))
  1192. fatal("Invalid debug option '%s'\n", optarg);
  1193. break;
  1194. case 'D':
  1195. show_activity = 1;
  1196. break;
  1197. case 'e':
  1198. show_empty = 1;
  1199. break;
  1200. case 'f':
  1201. show_first_alias = 1;
  1202. break;
  1203. case 'h':
  1204. usage();
  1205. return 0;
  1206. case 'i':
  1207. show_inverted = 1;
  1208. break;
  1209. case 'n':
  1210. show_numa = 1;
  1211. break;
  1212. case 'o':
  1213. show_ops = 1;
  1214. break;
  1215. case 'r':
  1216. show_report = 1;
  1217. break;
  1218. case 's':
  1219. shrink = 1;
  1220. break;
  1221. case 'l':
  1222. show_slab = 1;
  1223. break;
  1224. case 't':
  1225. show_track = 1;
  1226. break;
  1227. case 'v':
  1228. validate = 1;
  1229. break;
  1230. case 'z':
  1231. skip_zero = 0;
  1232. break;
  1233. case 'T':
  1234. show_totals = 1;
  1235. break;
  1236. case 'S':
  1237. sort_size = 1;
  1238. break;
  1239. case 'N':
  1240. if (optarg) {
  1241. output_lines = atoi(optarg);
  1242. if (output_lines < 1)
  1243. output_lines = 1;
  1244. }
  1245. break;
  1246. case 'L':
  1247. sort_loss = 1;
  1248. break;
  1249. case 'X':
  1250. if (output_lines == -1)
  1251. output_lines = 1;
  1252. extended_totals = 1;
  1253. show_bytes = 1;
  1254. break;
  1255. case 'B':
  1256. show_bytes = 1;
  1257. break;
  1258. default:
  1259. fatal("%s: Invalid option '%c'\n", argv[0], optopt);
  1260. }
  1261. if (!show_slab && !show_alias && !show_track && !show_report
  1262. && !validate && !shrink && !set_debug && !show_ops)
  1263. show_slab = 1;
  1264. if (argc > optind)
  1265. pattern_source = argv[optind];
  1266. else
  1267. pattern_source = ".*";
  1268. err = regcomp(&pattern, pattern_source, REG_ICASE|REG_NOSUB);
  1269. if (err)
  1270. fatal("%s: Invalid pattern '%s' code %d\n",
  1271. argv[0], pattern_source, err);
  1272. read_slab_dir();
  1273. if (show_alias) {
  1274. alias();
  1275. } else if (extended_totals) {
  1276. xtotals();
  1277. } else if (show_totals) {
  1278. totals();
  1279. } else {
  1280. link_slabs();
  1281. rename_slabs();
  1282. sort_slabs();
  1283. output_slabs();
  1284. }
  1285. return 0;
  1286. }