slabinfo.c 37 KB

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