slabinfo.c 32 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362
  1. /*
  2. * Slabinfo: Tool to get reports about slabs
  3. *
  4. * (C) 2007 sgi, Christoph Lameter <clameter@sgi.com>
  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;
  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. clameter@sgi.com\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\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 %8ld %8ld %3ld %3ld \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. }
  500. else
  501. printf("%-21s %8ld %7d %8s %14s %4d %1d %3ld %3ld %s\n",
  502. s->name, s->objects, s->object_size, size_str, dist_str,
  503. s->objs_per_slab, s->order,
  504. s->slabs ? (s->partial * 100) / s->slabs : 100,
  505. s->slabs ? (s->objects * s->object_size * 100) /
  506. (s->slabs * (page_size << s->order)) : 100,
  507. flags);
  508. }
  509. /*
  510. * Analyze debug options. Return false if something is amiss.
  511. */
  512. int debug_opt_scan(char *opt)
  513. {
  514. if (!opt || !opt[0] || strcmp(opt, "-") == 0)
  515. return 1;
  516. if (strcasecmp(opt, "a") == 0) {
  517. sanity = 1;
  518. poison = 1;
  519. redzone = 1;
  520. tracking = 1;
  521. return 1;
  522. }
  523. for ( ; *opt; opt++)
  524. switch (*opt) {
  525. case 'F' : case 'f':
  526. if (sanity)
  527. return 0;
  528. sanity = 1;
  529. break;
  530. case 'P' : case 'p':
  531. if (poison)
  532. return 0;
  533. poison = 1;
  534. break;
  535. case 'Z' : case 'z':
  536. if (redzone)
  537. return 0;
  538. redzone = 1;
  539. break;
  540. case 'U' : case 'u':
  541. if (tracking)
  542. return 0;
  543. tracking = 1;
  544. break;
  545. case 'T' : case 't':
  546. if (tracing)
  547. return 0;
  548. tracing = 1;
  549. break;
  550. default:
  551. return 0;
  552. }
  553. return 1;
  554. }
  555. int slab_empty(struct slabinfo *s)
  556. {
  557. if (s->objects > 0)
  558. return 0;
  559. /*
  560. * We may still have slabs even if there are no objects. Shrinking will
  561. * remove them.
  562. */
  563. if (s->slabs != 0)
  564. set_obj(s, "shrink", 1);
  565. return 1;
  566. }
  567. void slab_debug(struct slabinfo *s)
  568. {
  569. if (strcmp(s->name, "*") == 0)
  570. return;
  571. if (sanity && !s->sanity_checks) {
  572. set_obj(s, "sanity", 1);
  573. }
  574. if (!sanity && s->sanity_checks) {
  575. if (slab_empty(s))
  576. set_obj(s, "sanity", 0);
  577. else
  578. fprintf(stderr, "%s not empty cannot disable sanity checks\n", s->name);
  579. }
  580. if (redzone && !s->red_zone) {
  581. if (slab_empty(s))
  582. set_obj(s, "red_zone", 1);
  583. else
  584. fprintf(stderr, "%s not empty cannot enable redzoning\n", s->name);
  585. }
  586. if (!redzone && s->red_zone) {
  587. if (slab_empty(s))
  588. set_obj(s, "red_zone", 0);
  589. else
  590. fprintf(stderr, "%s not empty cannot disable redzoning\n", s->name);
  591. }
  592. if (poison && !s->poison) {
  593. if (slab_empty(s))
  594. set_obj(s, "poison", 1);
  595. else
  596. fprintf(stderr, "%s not empty cannot enable poisoning\n", s->name);
  597. }
  598. if (!poison && s->poison) {
  599. if (slab_empty(s))
  600. set_obj(s, "poison", 0);
  601. else
  602. fprintf(stderr, "%s not empty cannot disable poisoning\n", s->name);
  603. }
  604. if (tracking && !s->store_user) {
  605. if (slab_empty(s))
  606. set_obj(s, "store_user", 1);
  607. else
  608. fprintf(stderr, "%s not empty cannot enable tracking\n", s->name);
  609. }
  610. if (!tracking && s->store_user) {
  611. if (slab_empty(s))
  612. set_obj(s, "store_user", 0);
  613. else
  614. fprintf(stderr, "%s not empty cannot disable tracking\n", s->name);
  615. }
  616. if (tracing && !s->trace) {
  617. if (slabs == 1)
  618. set_obj(s, "trace", 1);
  619. else
  620. fprintf(stderr, "%s can only enable trace for one slab at a time\n", s->name);
  621. }
  622. if (!tracing && s->trace)
  623. set_obj(s, "trace", 1);
  624. }
  625. void totals(void)
  626. {
  627. struct slabinfo *s;
  628. int used_slabs = 0;
  629. char b1[20], b2[20], b3[20], b4[20];
  630. unsigned long long max = 1ULL << 63;
  631. /* Object size */
  632. unsigned long long min_objsize = max, max_objsize = 0, avg_objsize;
  633. /* Number of partial slabs in a slabcache */
  634. unsigned long long min_partial = max, max_partial = 0,
  635. avg_partial, total_partial = 0;
  636. /* Number of slabs in a slab cache */
  637. unsigned long long min_slabs = max, max_slabs = 0,
  638. avg_slabs, total_slabs = 0;
  639. /* Size of the whole slab */
  640. unsigned long long min_size = max, max_size = 0,
  641. avg_size, total_size = 0;
  642. /* Bytes used for object storage in a slab */
  643. unsigned long long min_used = max, max_used = 0,
  644. avg_used, total_used = 0;
  645. /* Waste: Bytes used for alignment and padding */
  646. unsigned long long min_waste = max, max_waste = 0,
  647. avg_waste, total_waste = 0;
  648. /* Number of objects in a slab */
  649. unsigned long long min_objects = max, max_objects = 0,
  650. avg_objects, total_objects = 0;
  651. /* Waste per object */
  652. unsigned long long min_objwaste = max,
  653. max_objwaste = 0, avg_objwaste,
  654. total_objwaste = 0;
  655. /* Memory per object */
  656. unsigned long long min_memobj = max,
  657. max_memobj = 0, avg_memobj,
  658. total_objsize = 0;
  659. /* Percentage of partial slabs per slab */
  660. unsigned long min_ppart = 100, max_ppart = 0,
  661. avg_ppart, total_ppart = 0;
  662. /* Number of objects in partial slabs */
  663. unsigned long min_partobj = max, max_partobj = 0,
  664. avg_partobj, total_partobj = 0;
  665. /* Percentage of partial objects of all objects in a slab */
  666. unsigned long min_ppartobj = 100, max_ppartobj = 0,
  667. avg_ppartobj, total_ppartobj = 0;
  668. for (s = slabinfo; s < slabinfo + slabs; s++) {
  669. unsigned long long size;
  670. unsigned long used;
  671. unsigned long long wasted;
  672. unsigned long long objwaste;
  673. unsigned long percentage_partial_slabs;
  674. unsigned long percentage_partial_objs;
  675. if (!s->slabs || !s->objects)
  676. continue;
  677. used_slabs++;
  678. size = slab_size(s);
  679. used = s->objects * s->object_size;
  680. wasted = size - used;
  681. objwaste = s->slab_size - s->object_size;
  682. percentage_partial_slabs = s->partial * 100 / s->slabs;
  683. if (percentage_partial_slabs > 100)
  684. percentage_partial_slabs = 100;
  685. percentage_partial_objs = s->objects_partial * 100
  686. / s->objects;
  687. if (percentage_partial_objs > 100)
  688. percentage_partial_objs = 100;
  689. if (s->object_size < min_objsize)
  690. min_objsize = s->object_size;
  691. if (s->partial < min_partial)
  692. min_partial = s->partial;
  693. if (s->slabs < min_slabs)
  694. min_slabs = s->slabs;
  695. if (size < min_size)
  696. min_size = size;
  697. if (wasted < min_waste)
  698. min_waste = wasted;
  699. if (objwaste < min_objwaste)
  700. min_objwaste = objwaste;
  701. if (s->objects < min_objects)
  702. min_objects = s->objects;
  703. if (used < min_used)
  704. min_used = used;
  705. if (s->objects_partial < min_partobj)
  706. min_partobj = s->objects_partial;
  707. if (percentage_partial_slabs < min_ppart)
  708. min_ppart = percentage_partial_slabs;
  709. if (percentage_partial_objs < min_ppartobj)
  710. min_ppartobj = percentage_partial_objs;
  711. if (s->slab_size < min_memobj)
  712. min_memobj = s->slab_size;
  713. if (s->object_size > max_objsize)
  714. max_objsize = s->object_size;
  715. if (s->partial > max_partial)
  716. max_partial = s->partial;
  717. if (s->slabs > max_slabs)
  718. max_slabs = s->slabs;
  719. if (size > max_size)
  720. max_size = size;
  721. if (wasted > max_waste)
  722. max_waste = wasted;
  723. if (objwaste > max_objwaste)
  724. max_objwaste = objwaste;
  725. if (s->objects > max_objects)
  726. max_objects = s->objects;
  727. if (used > max_used)
  728. max_used = used;
  729. if (s->objects_partial > max_partobj)
  730. max_partobj = s->objects_partial;
  731. if (percentage_partial_slabs > max_ppart)
  732. max_ppart = percentage_partial_slabs;
  733. if (percentage_partial_objs > max_ppartobj)
  734. max_ppartobj = percentage_partial_objs;
  735. if (s->slab_size > max_memobj)
  736. max_memobj = s->slab_size;
  737. total_partial += s->partial;
  738. total_slabs += s->slabs;
  739. total_size += size;
  740. total_waste += wasted;
  741. total_objects += s->objects;
  742. total_used += used;
  743. total_partobj += s->objects_partial;
  744. total_ppart += percentage_partial_slabs;
  745. total_ppartobj += percentage_partial_objs;
  746. total_objwaste += s->objects * objwaste;
  747. total_objsize += s->objects * s->slab_size;
  748. }
  749. if (!total_objects) {
  750. printf("No objects\n");
  751. return;
  752. }
  753. if (!used_slabs) {
  754. printf("No slabs\n");
  755. return;
  756. }
  757. /* Per slab averages */
  758. avg_partial = total_partial / used_slabs;
  759. avg_slabs = total_slabs / used_slabs;
  760. avg_size = total_size / used_slabs;
  761. avg_waste = total_waste / used_slabs;
  762. avg_objects = total_objects / used_slabs;
  763. avg_used = total_used / used_slabs;
  764. avg_partobj = total_partobj / used_slabs;
  765. avg_ppart = total_ppart / used_slabs;
  766. avg_ppartobj = total_ppartobj / used_slabs;
  767. /* Per object object sizes */
  768. avg_objsize = total_used / total_objects;
  769. avg_objwaste = total_objwaste / total_objects;
  770. avg_partobj = total_partobj * 100 / total_objects;
  771. avg_memobj = total_objsize / total_objects;
  772. printf("Slabcache Totals\n");
  773. printf("----------------\n");
  774. printf("Slabcaches : %3d Aliases : %3d->%-3d Active: %3d\n",
  775. slabs, aliases, alias_targets, used_slabs);
  776. store_size(b1, total_size);store_size(b2, total_waste);
  777. store_size(b3, total_waste * 100 / total_used);
  778. printf("Memory used: %6s # Loss : %6s MRatio:%6s%%\n", b1, b2, b3);
  779. store_size(b1, total_objects);store_size(b2, total_partobj);
  780. store_size(b3, total_partobj * 100 / total_objects);
  781. printf("# Objects : %6s # PartObj: %6s ORatio:%6s%%\n", b1, b2, b3);
  782. printf("\n");
  783. printf("Per Cache Average Min Max Total\n");
  784. printf("---------------------------------------------------------\n");
  785. store_size(b1, avg_objects);store_size(b2, min_objects);
  786. store_size(b3, max_objects);store_size(b4, total_objects);
  787. printf("#Objects %10s %10s %10s %10s\n",
  788. b1, b2, b3, b4);
  789. store_size(b1, avg_slabs);store_size(b2, min_slabs);
  790. store_size(b3, max_slabs);store_size(b4, total_slabs);
  791. printf("#Slabs %10s %10s %10s %10s\n",
  792. b1, b2, b3, b4);
  793. store_size(b1, avg_partial);store_size(b2, min_partial);
  794. store_size(b3, max_partial);store_size(b4, total_partial);
  795. printf("#PartSlab %10s %10s %10s %10s\n",
  796. b1, b2, b3, b4);
  797. store_size(b1, avg_ppart);store_size(b2, min_ppart);
  798. store_size(b3, max_ppart);
  799. store_size(b4, total_partial * 100 / total_slabs);
  800. printf("%%PartSlab%10s%% %10s%% %10s%% %10s%%\n",
  801. b1, b2, b3, b4);
  802. store_size(b1, avg_partobj);store_size(b2, min_partobj);
  803. store_size(b3, max_partobj);
  804. store_size(b4, total_partobj);
  805. printf("PartObjs %10s %10s %10s %10s\n",
  806. b1, b2, b3, b4);
  807. store_size(b1, avg_ppartobj);store_size(b2, min_ppartobj);
  808. store_size(b3, max_ppartobj);
  809. store_size(b4, total_partobj * 100 / total_objects);
  810. printf("%% PartObj%10s%% %10s%% %10s%% %10s%%\n",
  811. b1, b2, b3, b4);
  812. store_size(b1, avg_size);store_size(b2, min_size);
  813. store_size(b3, max_size);store_size(b4, total_size);
  814. printf("Memory %10s %10s %10s %10s\n",
  815. b1, b2, b3, b4);
  816. store_size(b1, avg_used);store_size(b2, min_used);
  817. store_size(b3, max_used);store_size(b4, total_used);
  818. printf("Used %10s %10s %10s %10s\n",
  819. b1, b2, b3, b4);
  820. store_size(b1, avg_waste);store_size(b2, min_waste);
  821. store_size(b3, max_waste);store_size(b4, total_waste);
  822. printf("Loss %10s %10s %10s %10s\n",
  823. b1, b2, b3, b4);
  824. printf("\n");
  825. printf("Per Object Average Min Max\n");
  826. printf("---------------------------------------------\n");
  827. store_size(b1, avg_memobj);store_size(b2, min_memobj);
  828. store_size(b3, max_memobj);
  829. printf("Memory %10s %10s %10s\n",
  830. b1, b2, b3);
  831. store_size(b1, avg_objsize);store_size(b2, min_objsize);
  832. store_size(b3, max_objsize);
  833. printf("User %10s %10s %10s\n",
  834. b1, b2, b3);
  835. store_size(b1, avg_objwaste);store_size(b2, min_objwaste);
  836. store_size(b3, max_objwaste);
  837. printf("Loss %10s %10s %10s\n",
  838. b1, b2, b3);
  839. }
  840. void sort_slabs(void)
  841. {
  842. struct slabinfo *s1,*s2;
  843. for (s1 = slabinfo; s1 < slabinfo + slabs; s1++) {
  844. for (s2 = s1 + 1; s2 < slabinfo + slabs; s2++) {
  845. int result;
  846. if (sort_size)
  847. result = slab_size(s1) < slab_size(s2);
  848. else if (sort_active)
  849. result = slab_activity(s1) < slab_activity(s2);
  850. else
  851. result = strcasecmp(s1->name, s2->name);
  852. if (show_inverted)
  853. result = -result;
  854. if (result > 0) {
  855. struct slabinfo t;
  856. memcpy(&t, s1, sizeof(struct slabinfo));
  857. memcpy(s1, s2, sizeof(struct slabinfo));
  858. memcpy(s2, &t, sizeof(struct slabinfo));
  859. }
  860. }
  861. }
  862. }
  863. void sort_aliases(void)
  864. {
  865. struct aliasinfo *a1,*a2;
  866. for (a1 = aliasinfo; a1 < aliasinfo + aliases; a1++) {
  867. for (a2 = a1 + 1; a2 < aliasinfo + aliases; a2++) {
  868. char *n1, *n2;
  869. n1 = a1->name;
  870. n2 = a2->name;
  871. if (show_alias && !show_inverted) {
  872. n1 = a1->ref;
  873. n2 = a2->ref;
  874. }
  875. if (strcasecmp(n1, n2) > 0) {
  876. struct aliasinfo t;
  877. memcpy(&t, a1, sizeof(struct aliasinfo));
  878. memcpy(a1, a2, sizeof(struct aliasinfo));
  879. memcpy(a2, &t, sizeof(struct aliasinfo));
  880. }
  881. }
  882. }
  883. }
  884. void link_slabs(void)
  885. {
  886. struct aliasinfo *a;
  887. struct slabinfo *s;
  888. for (a = aliasinfo; a < aliasinfo + aliases; a++) {
  889. for (s = slabinfo; s < slabinfo + slabs; s++)
  890. if (strcmp(a->ref, s->name) == 0) {
  891. a->slab = s;
  892. s->refs++;
  893. break;
  894. }
  895. if (s == slabinfo + slabs)
  896. fatal("Unresolved alias %s\n", a->ref);
  897. }
  898. }
  899. void alias(void)
  900. {
  901. struct aliasinfo *a;
  902. char *active = NULL;
  903. sort_aliases();
  904. link_slabs();
  905. for(a = aliasinfo; a < aliasinfo + aliases; a++) {
  906. if (!show_single_ref && a->slab->refs == 1)
  907. continue;
  908. if (!show_inverted) {
  909. if (active) {
  910. if (strcmp(a->slab->name, active) == 0) {
  911. printf(" %s", a->name);
  912. continue;
  913. }
  914. }
  915. printf("\n%-12s <- %s", a->slab->name, a->name);
  916. active = a->slab->name;
  917. }
  918. else
  919. printf("%-20s -> %s\n", a->name, a->slab->name);
  920. }
  921. if (active)
  922. printf("\n");
  923. }
  924. void rename_slabs(void)
  925. {
  926. struct slabinfo *s;
  927. struct aliasinfo *a;
  928. for (s = slabinfo; s < slabinfo + slabs; s++) {
  929. if (*s->name != ':')
  930. continue;
  931. if (s->refs > 1 && !show_first_alias)
  932. continue;
  933. a = find_one_alias(s);
  934. if (a)
  935. s->name = a->name;
  936. else {
  937. s->name = "*";
  938. actual_slabs--;
  939. }
  940. }
  941. }
  942. int slab_mismatch(char *slab)
  943. {
  944. return regexec(&pattern, slab, 0, NULL, 0);
  945. }
  946. void read_slab_dir(void)
  947. {
  948. DIR *dir;
  949. struct dirent *de;
  950. struct slabinfo *slab = slabinfo;
  951. struct aliasinfo *alias = aliasinfo;
  952. char *p;
  953. char *t;
  954. int count;
  955. if (chdir("/sys/kernel/slab") && chdir("/sys/slab"))
  956. fatal("SYSFS support for SLUB not active\n");
  957. dir = opendir(".");
  958. while ((de = readdir(dir))) {
  959. if (de->d_name[0] == '.' ||
  960. (de->d_name[0] != ':' && slab_mismatch(de->d_name)))
  961. continue;
  962. switch (de->d_type) {
  963. case DT_LNK:
  964. alias->name = strdup(de->d_name);
  965. count = readlink(de->d_name, buffer, sizeof(buffer));
  966. if (count < 0)
  967. fatal("Cannot read symlink %s\n", de->d_name);
  968. buffer[count] = 0;
  969. p = buffer + count;
  970. while (p > buffer && p[-1] != '/')
  971. p--;
  972. alias->ref = strdup(p);
  973. alias++;
  974. break;
  975. case DT_DIR:
  976. if (chdir(de->d_name))
  977. fatal("Unable to access slab %s\n", slab->name);
  978. slab->name = strdup(de->d_name);
  979. slab->alias = 0;
  980. slab->refs = 0;
  981. slab->aliases = get_obj("aliases");
  982. slab->align = get_obj("align");
  983. slab->cache_dma = get_obj("cache_dma");
  984. slab->cpu_slabs = get_obj("cpu_slabs");
  985. slab->destroy_by_rcu = get_obj("destroy_by_rcu");
  986. slab->hwcache_align = get_obj("hwcache_align");
  987. slab->object_size = get_obj("object_size");
  988. slab->objects = get_obj("objects");
  989. slab->objects_partial = get_obj("objects_partial");
  990. slab->objects_total = get_obj("objects_total");
  991. slab->objs_per_slab = get_obj("objs_per_slab");
  992. slab->order = get_obj("order");
  993. slab->partial = get_obj("partial");
  994. slab->partial = get_obj_and_str("partial", &t);
  995. decode_numa_list(slab->numa_partial, t);
  996. free(t);
  997. slab->poison = get_obj("poison");
  998. slab->reclaim_account = get_obj("reclaim_account");
  999. slab->red_zone = get_obj("red_zone");
  1000. slab->sanity_checks = get_obj("sanity_checks");
  1001. slab->slab_size = get_obj("slab_size");
  1002. slab->slabs = get_obj_and_str("slabs", &t);
  1003. decode_numa_list(slab->numa, t);
  1004. free(t);
  1005. slab->store_user = get_obj("store_user");
  1006. slab->trace = get_obj("trace");
  1007. slab->alloc_fastpath = get_obj("alloc_fastpath");
  1008. slab->alloc_slowpath = get_obj("alloc_slowpath");
  1009. slab->free_fastpath = get_obj("free_fastpath");
  1010. slab->free_slowpath = get_obj("free_slowpath");
  1011. slab->free_frozen= get_obj("free_frozen");
  1012. slab->free_add_partial = get_obj("free_add_partial");
  1013. slab->free_remove_partial = get_obj("free_remove_partial");
  1014. slab->alloc_from_partial = get_obj("alloc_from_partial");
  1015. slab->alloc_slab = get_obj("alloc_slab");
  1016. slab->alloc_refill = get_obj("alloc_refill");
  1017. slab->free_slab = get_obj("free_slab");
  1018. slab->cpuslab_flush = get_obj("cpuslab_flush");
  1019. slab->deactivate_full = get_obj("deactivate_full");
  1020. slab->deactivate_empty = get_obj("deactivate_empty");
  1021. slab->deactivate_to_head = get_obj("deactivate_to_head");
  1022. slab->deactivate_to_tail = get_obj("deactivate_to_tail");
  1023. slab->deactivate_remote_frees = get_obj("deactivate_remote_frees");
  1024. chdir("..");
  1025. if (slab->name[0] == ':')
  1026. alias_targets++;
  1027. slab++;
  1028. break;
  1029. default :
  1030. fatal("Unknown file type %lx\n", de->d_type);
  1031. }
  1032. }
  1033. closedir(dir);
  1034. slabs = slab - slabinfo;
  1035. actual_slabs = slabs;
  1036. aliases = alias - aliasinfo;
  1037. if (slabs > MAX_SLABS)
  1038. fatal("Too many slabs\n");
  1039. if (aliases > MAX_ALIASES)
  1040. fatal("Too many aliases\n");
  1041. }
  1042. void output_slabs(void)
  1043. {
  1044. struct slabinfo *slab;
  1045. for (slab = slabinfo; slab < slabinfo + slabs; slab++) {
  1046. if (slab->alias)
  1047. continue;
  1048. if (show_numa)
  1049. slab_numa(slab, 0);
  1050. else if (show_track)
  1051. show_tracking(slab);
  1052. else if (validate)
  1053. slab_validate(slab);
  1054. else if (shrink)
  1055. slab_shrink(slab);
  1056. else if (set_debug)
  1057. slab_debug(slab);
  1058. else if (show_ops)
  1059. ops(slab);
  1060. else if (show_slab)
  1061. slabcache(slab);
  1062. else if (show_report)
  1063. report(slab);
  1064. }
  1065. }
  1066. struct option opts[] = {
  1067. { "aliases", 0, NULL, 'a' },
  1068. { "activity", 0, NULL, 'A' },
  1069. { "debug", 2, NULL, 'd' },
  1070. { "display-activity", 0, NULL, 'D' },
  1071. { "empty", 0, NULL, 'e' },
  1072. { "first-alias", 0, NULL, 'f' },
  1073. { "help", 0, NULL, 'h' },
  1074. { "inverted", 0, NULL, 'i'},
  1075. { "numa", 0, NULL, 'n' },
  1076. { "ops", 0, NULL, 'o' },
  1077. { "report", 0, NULL, 'r' },
  1078. { "shrink", 0, NULL, 's' },
  1079. { "slabs", 0, NULL, 'l' },
  1080. { "track", 0, NULL, 't'},
  1081. { "validate", 0, NULL, 'v' },
  1082. { "zero", 0, NULL, 'z' },
  1083. { "1ref", 0, NULL, '1'},
  1084. { NULL, 0, NULL, 0 }
  1085. };
  1086. int main(int argc, char *argv[])
  1087. {
  1088. int c;
  1089. int err;
  1090. char *pattern_source;
  1091. page_size = getpagesize();
  1092. while ((c = getopt_long(argc, argv, "aAd::Defhil1noprstvzTS",
  1093. opts, NULL)) != -1)
  1094. switch (c) {
  1095. case '1':
  1096. show_single_ref = 1;
  1097. break;
  1098. case 'a':
  1099. show_alias = 1;
  1100. break;
  1101. case 'A':
  1102. sort_active = 1;
  1103. break;
  1104. case 'd':
  1105. set_debug = 1;
  1106. if (!debug_opt_scan(optarg))
  1107. fatal("Invalid debug option '%s'\n", optarg);
  1108. break;
  1109. case 'D':
  1110. show_activity = 1;
  1111. break;
  1112. case 'e':
  1113. show_empty = 1;
  1114. break;
  1115. case 'f':
  1116. show_first_alias = 1;
  1117. break;
  1118. case 'h':
  1119. usage();
  1120. return 0;
  1121. case 'i':
  1122. show_inverted = 1;
  1123. break;
  1124. case 'n':
  1125. show_numa = 1;
  1126. break;
  1127. case 'o':
  1128. show_ops = 1;
  1129. break;
  1130. case 'r':
  1131. show_report = 1;
  1132. break;
  1133. case 's':
  1134. shrink = 1;
  1135. break;
  1136. case 'l':
  1137. show_slab = 1;
  1138. break;
  1139. case 't':
  1140. show_track = 1;
  1141. break;
  1142. case 'v':
  1143. validate = 1;
  1144. break;
  1145. case 'z':
  1146. skip_zero = 0;
  1147. break;
  1148. case 'T':
  1149. show_totals = 1;
  1150. break;
  1151. case 'S':
  1152. sort_size = 1;
  1153. break;
  1154. default:
  1155. fatal("%s: Invalid option '%c'\n", argv[0], optopt);
  1156. }
  1157. if (!show_slab && !show_alias && !show_track && !show_report
  1158. && !validate && !shrink && !set_debug && !show_ops)
  1159. show_slab = 1;
  1160. if (argc > optind)
  1161. pattern_source = argv[optind];
  1162. else
  1163. pattern_source = ".*";
  1164. err = regcomp(&pattern, pattern_source, REG_ICASE|REG_NOSUB);
  1165. if (err)
  1166. fatal("%s: Invalid pattern '%s' code %d\n",
  1167. argv[0], pattern_source, err);
  1168. read_slab_dir();
  1169. if (show_alias)
  1170. alias();
  1171. else
  1172. if (show_totals)
  1173. totals();
  1174. else {
  1175. link_slabs();
  1176. rename_slabs();
  1177. sort_slabs();
  1178. output_slabs();
  1179. }
  1180. return 0;
  1181. }