recordmcount.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608
  1. /*
  2. * recordmcount.c: construct a table of the locations of calls to 'mcount'
  3. * so that ftrace can find them quickly.
  4. * Copyright 2009 John F. Reiser <jreiser@BitWagon.com>. All rights reserved.
  5. * Licensed under the GNU General Public License, version 2 (GPLv2).
  6. *
  7. * Restructured to fit Linux format, as well as other updates:
  8. * Copyright 2010 Steven Rostedt <srostedt@redhat.com>, Red Hat Inc.
  9. */
  10. /*
  11. * Strategy: alter the .o file in-place.
  12. *
  13. * Append a new STRTAB that has the new section names, followed by a new array
  14. * ElfXX_Shdr[] that has the new section headers, followed by the section
  15. * contents for __mcount_loc and its relocations. The old shstrtab strings,
  16. * and the old ElfXX_Shdr[] array, remain as "garbage" (commonly, a couple
  17. * kilobytes.) Subsequent processing by /bin/ld (or the kernel module loader)
  18. * will ignore the garbage regions, because they are not designated by the
  19. * new .e_shoff nor the new ElfXX_Shdr[]. [In order to remove the garbage,
  20. * then use "ld -r" to create a new file that omits the garbage.]
  21. */
  22. #include <sys/types.h>
  23. #include <sys/mman.h>
  24. #include <sys/stat.h>
  25. #include <getopt.h>
  26. #include <elf.h>
  27. #include <fcntl.h>
  28. #include <setjmp.h>
  29. #include <stdio.h>
  30. #include <stdlib.h>
  31. #include <string.h>
  32. #include <unistd.h>
  33. /*
  34. * glibc synced up and added the metag number but didn't add the relocations.
  35. * Work around this in a crude manner for now.
  36. */
  37. #ifndef EM_METAG
  38. #define EM_METAG 174
  39. #endif
  40. #ifndef R_METAG_ADDR32
  41. #define R_METAG_ADDR32 2
  42. #endif
  43. #ifndef R_METAG_NONE
  44. #define R_METAG_NONE 3
  45. #endif
  46. #ifndef EM_AARCH64
  47. #define EM_AARCH64 183
  48. #define R_AARCH64_NONE 0
  49. #define R_AARCH64_ABS64 257
  50. #endif
  51. static int fd_map; /* File descriptor for file being modified. */
  52. static int mmap_failed; /* Boolean flag. */
  53. static char gpfx; /* prefix for global symbol name (sometimes '_') */
  54. static struct stat sb; /* Remember .st_size, etc. */
  55. static jmp_buf jmpenv; /* setjmp/longjmp per-file error escape */
  56. static const char *altmcount; /* alternate mcount symbol name */
  57. static int warn_on_notrace_sect; /* warn when section has mcount not being recorded */
  58. static void *file_map; /* pointer of the mapped file */
  59. static void *file_end; /* pointer to the end of the mapped file */
  60. static int file_updated; /* flag to state file was changed */
  61. static void *file_ptr; /* current file pointer location */
  62. static void *file_append; /* added to the end of the file */
  63. static size_t file_append_size; /* how much is added to end of file */
  64. /* setjmp() return values */
  65. enum {
  66. SJ_SETJMP = 0, /* hardwired first return */
  67. SJ_FAIL,
  68. SJ_SUCCEED
  69. };
  70. /* Per-file resource cleanup when multiple files. */
  71. static void
  72. cleanup(void)
  73. {
  74. if (!mmap_failed)
  75. munmap(file_map, sb.st_size);
  76. else
  77. free(file_map);
  78. file_map = NULL;
  79. free(file_append);
  80. file_append = NULL;
  81. file_append_size = 0;
  82. file_updated = 0;
  83. }
  84. static void __attribute__((noreturn))
  85. fail_file(void)
  86. {
  87. cleanup();
  88. longjmp(jmpenv, SJ_FAIL);
  89. }
  90. static void __attribute__((noreturn))
  91. succeed_file(void)
  92. {
  93. cleanup();
  94. longjmp(jmpenv, SJ_SUCCEED);
  95. }
  96. /* ulseek, uread, ...: Check return value for errors. */
  97. static off_t
  98. ulseek(int const fd, off_t const offset, int const whence)
  99. {
  100. switch (whence) {
  101. case SEEK_SET:
  102. file_ptr = file_map + offset;
  103. break;
  104. case SEEK_CUR:
  105. file_ptr += offset;
  106. break;
  107. case SEEK_END:
  108. file_ptr = file_map + (sb.st_size - offset);
  109. break;
  110. }
  111. if (file_ptr < file_map) {
  112. fprintf(stderr, "lseek: seek before file\n");
  113. fail_file();
  114. }
  115. return file_ptr - file_map;
  116. }
  117. static size_t
  118. uread(int const fd, void *const buf, size_t const count)
  119. {
  120. size_t const n = read(fd, buf, count);
  121. if (n != count) {
  122. perror("read");
  123. fail_file();
  124. }
  125. return n;
  126. }
  127. static size_t
  128. uwrite(int const fd, void const *const buf, size_t const count)
  129. {
  130. size_t cnt = count;
  131. off_t idx = 0;
  132. file_updated = 1;
  133. if (file_ptr + count >= file_end) {
  134. off_t aoffset = (file_ptr + count) - file_end;
  135. if (aoffset > file_append_size) {
  136. file_append = realloc(file_append, aoffset);
  137. file_append_size = aoffset;
  138. }
  139. if (!file_append) {
  140. perror("write");
  141. fail_file();
  142. }
  143. if (file_ptr < file_end) {
  144. cnt = file_end - file_ptr;
  145. } else {
  146. cnt = 0;
  147. idx = aoffset - count;
  148. }
  149. }
  150. if (cnt)
  151. memcpy(file_ptr, buf, cnt);
  152. if (cnt < count)
  153. memcpy(file_append + idx, buf + cnt, count - cnt);
  154. file_ptr += count;
  155. return count;
  156. }
  157. static void *
  158. umalloc(size_t size)
  159. {
  160. void *const addr = malloc(size);
  161. if (addr == 0) {
  162. fprintf(stderr, "malloc failed: %zu bytes\n", size);
  163. fail_file();
  164. }
  165. return addr;
  166. }
  167. static unsigned char ideal_nop5_x86_64[5] = { 0x0f, 0x1f, 0x44, 0x00, 0x00 };
  168. static unsigned char ideal_nop5_x86_32[5] = { 0x3e, 0x8d, 0x74, 0x26, 0x00 };
  169. static unsigned char *ideal_nop;
  170. static char rel_type_nop;
  171. static int (*make_nop)(void *map, size_t const offset);
  172. static int make_nop_x86(void *map, size_t const offset)
  173. {
  174. uint32_t *ptr;
  175. unsigned char *op;
  176. /* Confirm we have 0xe8 0x0 0x0 0x0 0x0 */
  177. ptr = map + offset;
  178. if (*ptr != 0)
  179. return -1;
  180. op = map + offset - 1;
  181. if (*op != 0xe8)
  182. return -1;
  183. /* convert to nop */
  184. ulseek(fd_map, offset - 1, SEEK_SET);
  185. uwrite(fd_map, ideal_nop, 5);
  186. return 0;
  187. }
  188. static unsigned char ideal_nop4_arm64[4] = {0x1f, 0x20, 0x03, 0xd5};
  189. static int make_nop_arm64(void *map, size_t const offset)
  190. {
  191. uint32_t *ptr;
  192. ptr = map + offset;
  193. /* bl <_mcount> is 0x94000000 before relocation */
  194. if (*ptr != 0x94000000)
  195. return -1;
  196. /* Convert to nop */
  197. ulseek(fd_map, offset, SEEK_SET);
  198. uwrite(fd_map, ideal_nop, 4);
  199. return 0;
  200. }
  201. /*
  202. * Get the whole file as a programming convenience in order to avoid
  203. * malloc+lseek+read+free of many pieces. If successful, then mmap
  204. * avoids copying unused pieces; else just read the whole file.
  205. * Open for both read and write; new info will be appended to the file.
  206. * Use MAP_PRIVATE so that a few changes to the in-memory ElfXX_Ehdr
  207. * do not propagate to the file until an explicit overwrite at the last.
  208. * This preserves most aspects of consistency (all except .st_size)
  209. * for simultaneous readers of the file while we are appending to it.
  210. * However, multiple writers still are bad. We choose not to use
  211. * locking because it is expensive and the use case of kernel build
  212. * makes multiple writers unlikely.
  213. */
  214. static void *mmap_file(char const *fname)
  215. {
  216. fd_map = open(fname, O_RDONLY);
  217. if (fd_map < 0 || fstat(fd_map, &sb) < 0) {
  218. perror(fname);
  219. fail_file();
  220. }
  221. if (!S_ISREG(sb.st_mode)) {
  222. fprintf(stderr, "not a regular file: %s\n", fname);
  223. fail_file();
  224. }
  225. file_map = mmap(0, sb.st_size, PROT_READ|PROT_WRITE, MAP_PRIVATE,
  226. fd_map, 0);
  227. mmap_failed = 0;
  228. if (file_map == MAP_FAILED) {
  229. mmap_failed = 1;
  230. file_map = umalloc(sb.st_size);
  231. uread(fd_map, file_map, sb.st_size);
  232. }
  233. close(fd_map);
  234. file_end = file_map + sb.st_size;
  235. return file_map;
  236. }
  237. static void write_file(const char *fname)
  238. {
  239. char tmp_file[strlen(fname) + 4];
  240. size_t n;
  241. if (!file_updated)
  242. return;
  243. sprintf(tmp_file, "%s.rc", fname);
  244. /*
  245. * After reading the entire file into memory, delete it
  246. * and write it back, to prevent weird side effects of modifying
  247. * an object file in place.
  248. */
  249. fd_map = open(tmp_file, O_WRONLY | O_TRUNC | O_CREAT, sb.st_mode);
  250. if (fd_map < 0) {
  251. perror(fname);
  252. fail_file();
  253. }
  254. n = write(fd_map, file_map, sb.st_size);
  255. if (n != sb.st_size) {
  256. perror("write");
  257. fail_file();
  258. }
  259. if (file_append_size) {
  260. n = write(fd_map, file_append, file_append_size);
  261. if (n != file_append_size) {
  262. perror("write");
  263. fail_file();
  264. }
  265. }
  266. close(fd_map);
  267. if (rename(tmp_file, fname) < 0) {
  268. perror(fname);
  269. fail_file();
  270. }
  271. }
  272. /* w8rev, w8nat, ...: Handle endianness. */
  273. static uint64_t w8rev(uint64_t const x)
  274. {
  275. return ((0xff & (x >> (0 * 8))) << (7 * 8))
  276. | ((0xff & (x >> (1 * 8))) << (6 * 8))
  277. | ((0xff & (x >> (2 * 8))) << (5 * 8))
  278. | ((0xff & (x >> (3 * 8))) << (4 * 8))
  279. | ((0xff & (x >> (4 * 8))) << (3 * 8))
  280. | ((0xff & (x >> (5 * 8))) << (2 * 8))
  281. | ((0xff & (x >> (6 * 8))) << (1 * 8))
  282. | ((0xff & (x >> (7 * 8))) << (0 * 8));
  283. }
  284. static uint32_t w4rev(uint32_t const x)
  285. {
  286. return ((0xff & (x >> (0 * 8))) << (3 * 8))
  287. | ((0xff & (x >> (1 * 8))) << (2 * 8))
  288. | ((0xff & (x >> (2 * 8))) << (1 * 8))
  289. | ((0xff & (x >> (3 * 8))) << (0 * 8));
  290. }
  291. static uint32_t w2rev(uint16_t const x)
  292. {
  293. return ((0xff & (x >> (0 * 8))) << (1 * 8))
  294. | ((0xff & (x >> (1 * 8))) << (0 * 8));
  295. }
  296. static uint64_t w8nat(uint64_t const x)
  297. {
  298. return x;
  299. }
  300. static uint32_t w4nat(uint32_t const x)
  301. {
  302. return x;
  303. }
  304. static uint32_t w2nat(uint16_t const x)
  305. {
  306. return x;
  307. }
  308. static uint64_t (*w8)(uint64_t);
  309. static uint32_t (*w)(uint32_t);
  310. static uint32_t (*w2)(uint16_t);
  311. /* Names of the sections that could contain calls to mcount. */
  312. static int
  313. is_mcounted_section_name(char const *const txtname)
  314. {
  315. return strcmp(".text", txtname) == 0 ||
  316. strcmp(".ref.text", txtname) == 0 ||
  317. strcmp(".sched.text", txtname) == 0 ||
  318. strcmp(".spinlock.text", txtname) == 0 ||
  319. strcmp(".irqentry.text", txtname) == 0 ||
  320. strcmp(".softirqentry.text", txtname) == 0 ||
  321. strcmp(".kprobes.text", txtname) == 0 ||
  322. strcmp(".cpuidle.text", txtname) == 0 ||
  323. strcmp(".text.unlikely", txtname) == 0;
  324. }
  325. /* 32 bit and 64 bit are very similar */
  326. #include "recordmcount.h"
  327. #define RECORD_MCOUNT_64
  328. #include "recordmcount.h"
  329. /* 64-bit EM_MIPS has weird ELF64_Rela.r_info.
  330. * http://techpubs.sgi.com/library/manuals/4000/007-4658-001/pdf/007-4658-001.pdf
  331. * We interpret Table 29 Relocation Operation (Elf64_Rel, Elf64_Rela) [p.40]
  332. * to imply the order of the members; the spec does not say so.
  333. * typedef unsigned char Elf64_Byte;
  334. * fails on MIPS64 because their <elf.h> already has it!
  335. */
  336. typedef uint8_t myElf64_Byte; /* Type for a 8-bit quantity. */
  337. union mips_r_info {
  338. Elf64_Xword r_info;
  339. struct {
  340. Elf64_Word r_sym; /* Symbol index. */
  341. myElf64_Byte r_ssym; /* Special symbol. */
  342. myElf64_Byte r_type3; /* Third relocation. */
  343. myElf64_Byte r_type2; /* Second relocation. */
  344. myElf64_Byte r_type; /* First relocation. */
  345. } r_mips;
  346. };
  347. static uint64_t MIPS64_r_sym(Elf64_Rel const *rp)
  348. {
  349. return w(((union mips_r_info){ .r_info = rp->r_info }).r_mips.r_sym);
  350. }
  351. static void MIPS64_r_info(Elf64_Rel *const rp, unsigned sym, unsigned type)
  352. {
  353. rp->r_info = ((union mips_r_info){
  354. .r_mips = { .r_sym = w(sym), .r_type = type }
  355. }).r_info;
  356. }
  357. static void
  358. do_file(char const *const fname)
  359. {
  360. Elf32_Ehdr *const ehdr = mmap_file(fname);
  361. unsigned int reltype = 0;
  362. w = w4nat;
  363. w2 = w2nat;
  364. w8 = w8nat;
  365. switch (ehdr->e_ident[EI_DATA]) {
  366. static unsigned int const endian = 1;
  367. default:
  368. fprintf(stderr, "unrecognized ELF data encoding %d: %s\n",
  369. ehdr->e_ident[EI_DATA], fname);
  370. fail_file();
  371. break;
  372. case ELFDATA2LSB:
  373. if (*(unsigned char const *)&endian != 1) {
  374. /* main() is big endian, file.o is little endian. */
  375. w = w4rev;
  376. w2 = w2rev;
  377. w8 = w8rev;
  378. }
  379. break;
  380. case ELFDATA2MSB:
  381. if (*(unsigned char const *)&endian != 0) {
  382. /* main() is little endian, file.o is big endian. */
  383. w = w4rev;
  384. w2 = w2rev;
  385. w8 = w8rev;
  386. }
  387. break;
  388. } /* end switch */
  389. if (memcmp(ELFMAG, ehdr->e_ident, SELFMAG) != 0
  390. || w2(ehdr->e_type) != ET_REL
  391. || ehdr->e_ident[EI_VERSION] != EV_CURRENT) {
  392. fprintf(stderr, "unrecognized ET_REL file %s\n", fname);
  393. fail_file();
  394. }
  395. gpfx = 0;
  396. switch (w2(ehdr->e_machine)) {
  397. default:
  398. fprintf(stderr, "unrecognized e_machine %d %s\n",
  399. w2(ehdr->e_machine), fname);
  400. fail_file();
  401. break;
  402. case EM_386:
  403. reltype = R_386_32;
  404. rel_type_nop = R_386_NONE;
  405. make_nop = make_nop_x86;
  406. ideal_nop = ideal_nop5_x86_32;
  407. mcount_adjust_32 = -1;
  408. break;
  409. case EM_ARM: reltype = R_ARM_ABS32;
  410. altmcount = "__gnu_mcount_nc";
  411. break;
  412. case EM_AARCH64:
  413. reltype = R_AARCH64_ABS64;
  414. make_nop = make_nop_arm64;
  415. rel_type_nop = R_AARCH64_NONE;
  416. ideal_nop = ideal_nop4_arm64;
  417. gpfx = '_';
  418. break;
  419. case EM_IA_64: reltype = R_IA64_IMM64; gpfx = '_'; break;
  420. case EM_METAG: reltype = R_METAG_ADDR32;
  421. altmcount = "_mcount_wrapper";
  422. rel_type_nop = R_METAG_NONE;
  423. /* We happen to have the same requirement as MIPS */
  424. is_fake_mcount32 = MIPS32_is_fake_mcount;
  425. break;
  426. case EM_MIPS: /* reltype: e_class */ gpfx = '_'; break;
  427. case EM_PPC: reltype = R_PPC_ADDR32; gpfx = '_'; break;
  428. case EM_PPC64: reltype = R_PPC64_ADDR64; gpfx = '_'; break;
  429. case EM_S390: /* reltype: e_class */ gpfx = '_'; break;
  430. case EM_SH: reltype = R_SH_DIR32; break;
  431. case EM_SPARCV9: reltype = R_SPARC_64; gpfx = '_'; break;
  432. case EM_X86_64:
  433. make_nop = make_nop_x86;
  434. ideal_nop = ideal_nop5_x86_64;
  435. reltype = R_X86_64_64;
  436. rel_type_nop = R_X86_64_NONE;
  437. mcount_adjust_64 = -1;
  438. break;
  439. } /* end switch */
  440. switch (ehdr->e_ident[EI_CLASS]) {
  441. default:
  442. fprintf(stderr, "unrecognized ELF class %d %s\n",
  443. ehdr->e_ident[EI_CLASS], fname);
  444. fail_file();
  445. break;
  446. case ELFCLASS32:
  447. if (w2(ehdr->e_ehsize) != sizeof(Elf32_Ehdr)
  448. || w2(ehdr->e_shentsize) != sizeof(Elf32_Shdr)) {
  449. fprintf(stderr,
  450. "unrecognized ET_REL file: %s\n", fname);
  451. fail_file();
  452. }
  453. if (w2(ehdr->e_machine) == EM_MIPS) {
  454. reltype = R_MIPS_32;
  455. is_fake_mcount32 = MIPS32_is_fake_mcount;
  456. }
  457. do32(ehdr, fname, reltype);
  458. break;
  459. case ELFCLASS64: {
  460. Elf64_Ehdr *const ghdr = (Elf64_Ehdr *)ehdr;
  461. if (w2(ghdr->e_ehsize) != sizeof(Elf64_Ehdr)
  462. || w2(ghdr->e_shentsize) != sizeof(Elf64_Shdr)) {
  463. fprintf(stderr,
  464. "unrecognized ET_REL file: %s\n", fname);
  465. fail_file();
  466. }
  467. if (w2(ghdr->e_machine) == EM_S390) {
  468. reltype = R_390_64;
  469. mcount_adjust_64 = -14;
  470. }
  471. if (w2(ghdr->e_machine) == EM_MIPS) {
  472. reltype = R_MIPS_64;
  473. Elf64_r_sym = MIPS64_r_sym;
  474. Elf64_r_info = MIPS64_r_info;
  475. is_fake_mcount64 = MIPS64_is_fake_mcount;
  476. }
  477. do64(ghdr, fname, reltype);
  478. break;
  479. }
  480. } /* end switch */
  481. write_file(fname);
  482. cleanup();
  483. }
  484. int
  485. main(int argc, char *argv[])
  486. {
  487. const char ftrace[] = "/ftrace.o";
  488. int ftrace_size = sizeof(ftrace) - 1;
  489. int n_error = 0; /* gcc-4.3.0 false positive complaint */
  490. int c;
  491. int i;
  492. while ((c = getopt(argc, argv, "w")) >= 0) {
  493. switch (c) {
  494. case 'w':
  495. warn_on_notrace_sect = 1;
  496. break;
  497. default:
  498. fprintf(stderr, "usage: recordmcount [-w] file.o...\n");
  499. return 0;
  500. }
  501. }
  502. if ((argc - optind) < 1) {
  503. fprintf(stderr, "usage: recordmcount [-w] file.o...\n");
  504. return 0;
  505. }
  506. /* Process each file in turn, allowing deep failure. */
  507. for (i = optind; i < argc; i++) {
  508. char *file = argv[i];
  509. int const sjval = setjmp(jmpenv);
  510. int len;
  511. /*
  512. * The file kernel/trace/ftrace.o references the mcount
  513. * function but does not call it. Since ftrace.o should
  514. * not be traced anyway, we just skip it.
  515. */
  516. len = strlen(file);
  517. if (len >= ftrace_size &&
  518. strcmp(file + (len - ftrace_size), ftrace) == 0)
  519. continue;
  520. switch (sjval) {
  521. default:
  522. fprintf(stderr, "internal error: %s\n", file);
  523. exit(1);
  524. break;
  525. case SJ_SETJMP: /* normal sequence */
  526. /* Avoid problems if early cleanup() */
  527. fd_map = -1;
  528. mmap_failed = 1;
  529. file_map = NULL;
  530. file_ptr = NULL;
  531. file_updated = 0;
  532. do_file(file);
  533. break;
  534. case SJ_FAIL: /* error in do_file or below */
  535. fprintf(stderr, "%s: failed\n", file);
  536. ++n_error;
  537. break;
  538. case SJ_SUCCEED: /* premature success */
  539. /* do nothing */
  540. break;
  541. } /* end switch */
  542. }
  543. return !!n_error;
  544. }