slabinfo.c 38 KB

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