slabinfo.c 38 KB

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