slabinfo.c 36 KB

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