slabinfo.c 38 KB

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