trace.c 5.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300
  1. /*
  2. * Copyright 2014, Michael Ellerman, IBM Corp.
  3. * Licensed under GPLv2.
  4. */
  5. #include <errno.h>
  6. #include <stdio.h>
  7. #include <stdlib.h>
  8. #include <string.h>
  9. #include <sys/mman.h>
  10. #include "trace.h"
  11. struct trace_buffer *trace_buffer_allocate(u64 size)
  12. {
  13. struct trace_buffer *tb;
  14. if (size < sizeof(*tb)) {
  15. fprintf(stderr, "Error: trace buffer too small\n");
  16. return NULL;
  17. }
  18. tb = mmap(NULL, size, PROT_READ | PROT_WRITE,
  19. MAP_ANONYMOUS | MAP_PRIVATE, -1, 0);
  20. if (tb == MAP_FAILED) {
  21. perror("mmap");
  22. return NULL;
  23. }
  24. tb->size = size;
  25. tb->tail = tb->data;
  26. tb->overflow = false;
  27. return tb;
  28. }
  29. static bool trace_check_bounds(struct trace_buffer *tb, void *p)
  30. {
  31. return p < ((void *)tb + tb->size);
  32. }
  33. static bool trace_check_alloc(struct trace_buffer *tb, void *p)
  34. {
  35. /*
  36. * If we ever overflowed don't allow any more input. This prevents us
  37. * from dropping a large item and then later logging a small one. The
  38. * buffer should just stop when overflow happened, not be patchy. If
  39. * you're overflowing, make your buffer bigger.
  40. */
  41. if (tb->overflow)
  42. return false;
  43. if (!trace_check_bounds(tb, p)) {
  44. tb->overflow = true;
  45. return false;
  46. }
  47. return true;
  48. }
  49. static void *trace_alloc(struct trace_buffer *tb, int bytes)
  50. {
  51. void *p, *newtail;
  52. p = tb->tail;
  53. newtail = tb->tail + bytes;
  54. if (!trace_check_alloc(tb, newtail))
  55. return NULL;
  56. tb->tail = newtail;
  57. return p;
  58. }
  59. static struct trace_entry *trace_alloc_entry(struct trace_buffer *tb, int payload_size)
  60. {
  61. struct trace_entry *e;
  62. e = trace_alloc(tb, sizeof(*e) + payload_size);
  63. if (e)
  64. e->length = payload_size;
  65. return e;
  66. }
  67. int trace_log_reg(struct trace_buffer *tb, u64 reg, u64 value)
  68. {
  69. struct trace_entry *e;
  70. u64 *p;
  71. e = trace_alloc_entry(tb, sizeof(reg) + sizeof(value));
  72. if (!e)
  73. return -ENOSPC;
  74. e->type = TRACE_TYPE_REG;
  75. p = (u64 *)e->data;
  76. *p++ = reg;
  77. *p++ = value;
  78. return 0;
  79. }
  80. int trace_log_counter(struct trace_buffer *tb, u64 value)
  81. {
  82. struct trace_entry *e;
  83. u64 *p;
  84. e = trace_alloc_entry(tb, sizeof(value));
  85. if (!e)
  86. return -ENOSPC;
  87. e->type = TRACE_TYPE_COUNTER;
  88. p = (u64 *)e->data;
  89. *p++ = value;
  90. return 0;
  91. }
  92. int trace_log_string(struct trace_buffer *tb, char *str)
  93. {
  94. struct trace_entry *e;
  95. char *p;
  96. int len;
  97. len = strlen(str);
  98. /* We NULL terminate to make printing easier */
  99. e = trace_alloc_entry(tb, len + 1);
  100. if (!e)
  101. return -ENOSPC;
  102. e->type = TRACE_TYPE_STRING;
  103. p = (char *)e->data;
  104. memcpy(p, str, len);
  105. p += len;
  106. *p = '\0';
  107. return 0;
  108. }
  109. int trace_log_indent(struct trace_buffer *tb)
  110. {
  111. struct trace_entry *e;
  112. e = trace_alloc_entry(tb, 0);
  113. if (!e)
  114. return -ENOSPC;
  115. e->type = TRACE_TYPE_INDENT;
  116. return 0;
  117. }
  118. int trace_log_outdent(struct trace_buffer *tb)
  119. {
  120. struct trace_entry *e;
  121. e = trace_alloc_entry(tb, 0);
  122. if (!e)
  123. return -ENOSPC;
  124. e->type = TRACE_TYPE_OUTDENT;
  125. return 0;
  126. }
  127. static void trace_print_header(int seq, int prefix)
  128. {
  129. printf("%*s[%d]: ", prefix, "", seq);
  130. }
  131. static char *trace_decode_reg(int reg)
  132. {
  133. switch (reg) {
  134. case 769: return "SPRN_MMCR2"; break;
  135. case 770: return "SPRN_MMCRA"; break;
  136. case 779: return "SPRN_MMCR0"; break;
  137. case 804: return "SPRN_EBBHR"; break;
  138. case 805: return "SPRN_EBBRR"; break;
  139. case 806: return "SPRN_BESCR"; break;
  140. case 800: return "SPRN_BESCRS"; break;
  141. case 801: return "SPRN_BESCRSU"; break;
  142. case 802: return "SPRN_BESCRR"; break;
  143. case 803: return "SPRN_BESCRRU"; break;
  144. case 771: return "SPRN_PMC1"; break;
  145. case 772: return "SPRN_PMC2"; break;
  146. case 773: return "SPRN_PMC3"; break;
  147. case 774: return "SPRN_PMC4"; break;
  148. case 775: return "SPRN_PMC5"; break;
  149. case 776: return "SPRN_PMC6"; break;
  150. case 780: return "SPRN_SIAR"; break;
  151. case 781: return "SPRN_SDAR"; break;
  152. case 768: return "SPRN_SIER"; break;
  153. }
  154. return NULL;
  155. }
  156. static void trace_print_reg(struct trace_entry *e)
  157. {
  158. u64 *p, *reg, *value;
  159. char *name;
  160. p = (u64 *)e->data;
  161. reg = p++;
  162. value = p;
  163. name = trace_decode_reg(*reg);
  164. if (name)
  165. printf("register %-10s = 0x%016llx\n", name, *value);
  166. else
  167. printf("register %lld = 0x%016llx\n", *reg, *value);
  168. }
  169. static void trace_print_counter(struct trace_entry *e)
  170. {
  171. u64 *value;
  172. value = (u64 *)e->data;
  173. printf("counter = %lld\n", *value);
  174. }
  175. static void trace_print_string(struct trace_entry *e)
  176. {
  177. char *str;
  178. str = (char *)e->data;
  179. puts(str);
  180. }
  181. #define BASE_PREFIX 2
  182. #define PREFIX_DELTA 8
  183. static void trace_print_entry(struct trace_entry *e, int seq, int *prefix)
  184. {
  185. switch (e->type) {
  186. case TRACE_TYPE_REG:
  187. trace_print_header(seq, *prefix);
  188. trace_print_reg(e);
  189. break;
  190. case TRACE_TYPE_COUNTER:
  191. trace_print_header(seq, *prefix);
  192. trace_print_counter(e);
  193. break;
  194. case TRACE_TYPE_STRING:
  195. trace_print_header(seq, *prefix);
  196. trace_print_string(e);
  197. break;
  198. case TRACE_TYPE_INDENT:
  199. trace_print_header(seq, *prefix);
  200. puts("{");
  201. *prefix += PREFIX_DELTA;
  202. break;
  203. case TRACE_TYPE_OUTDENT:
  204. *prefix -= PREFIX_DELTA;
  205. if (*prefix < BASE_PREFIX)
  206. *prefix = BASE_PREFIX;
  207. trace_print_header(seq, *prefix);
  208. puts("}");
  209. break;
  210. default:
  211. trace_print_header(seq, *prefix);
  212. printf("entry @ %p type %d\n", e, e->type);
  213. break;
  214. }
  215. }
  216. void trace_buffer_print(struct trace_buffer *tb)
  217. {
  218. struct trace_entry *e;
  219. int i, prefix;
  220. void *p;
  221. printf("Trace buffer dump:\n");
  222. printf(" address %p \n", tb);
  223. printf(" tail %p\n", tb->tail);
  224. printf(" size %llu\n", tb->size);
  225. printf(" overflow %s\n", tb->overflow ? "TRUE" : "false");
  226. printf(" Content:\n");
  227. p = tb->data;
  228. i = 0;
  229. prefix = BASE_PREFIX;
  230. while (trace_check_bounds(tb, p) && p < tb->tail) {
  231. e = p;
  232. trace_print_entry(e, i, &prefix);
  233. i++;
  234. p = (void *)e + sizeof(*e) + e->length;
  235. }
  236. }
  237. void trace_print_location(struct trace_buffer *tb)
  238. {
  239. printf("Trace buffer 0x%llx bytes @ %p\n", tb->size, tb);
  240. }