slabinfo.c 32 KB

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