trace_seq.c 5.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303
  1. /*
  2. * trace_seq.c
  3. *
  4. * Copyright (C) 2008-2014 Red Hat Inc, Steven Rostedt <srostedt@redhat.com>
  5. *
  6. */
  7. #include <linux/uaccess.h>
  8. #include <linux/seq_file.h>
  9. #include <linux/trace_seq.h>
  10. int trace_print_seq(struct seq_file *m, struct trace_seq *s)
  11. {
  12. int len = s->len >= PAGE_SIZE ? PAGE_SIZE - 1 : s->len;
  13. int ret;
  14. ret = seq_write(m, s->buffer, len);
  15. /*
  16. * Only reset this buffer if we successfully wrote to the
  17. * seq_file buffer.
  18. */
  19. if (!ret)
  20. trace_seq_init(s);
  21. return ret;
  22. }
  23. /**
  24. * trace_seq_printf - sequence printing of trace information
  25. * @s: trace sequence descriptor
  26. * @fmt: printf format string
  27. *
  28. * It returns 0 if the trace oversizes the buffer's free
  29. * space, 1 otherwise.
  30. *
  31. * The tracer may use either sequence operations or its own
  32. * copy to user routines. To simplify formating of a trace
  33. * trace_seq_printf is used to store strings into a special
  34. * buffer (@s). Then the output may be either used by
  35. * the sequencer or pulled into another buffer.
  36. */
  37. int
  38. trace_seq_printf(struct trace_seq *s, const char *fmt, ...)
  39. {
  40. int len = (PAGE_SIZE - 1) - s->len;
  41. va_list ap;
  42. int ret;
  43. if (s->full || !len)
  44. return 0;
  45. va_start(ap, fmt);
  46. ret = vsnprintf(s->buffer + s->len, len, fmt, ap);
  47. va_end(ap);
  48. /* If we can't write it all, don't bother writing anything */
  49. if (ret >= len) {
  50. s->full = 1;
  51. return 0;
  52. }
  53. s->len += ret;
  54. return 1;
  55. }
  56. EXPORT_SYMBOL_GPL(trace_seq_printf);
  57. /**
  58. * trace_seq_bitmask - put a list of longs as a bitmask print output
  59. * @s: trace sequence descriptor
  60. * @maskp: points to an array of unsigned longs that represent a bitmask
  61. * @nmaskbits: The number of bits that are valid in @maskp
  62. *
  63. * It returns 0 if the trace oversizes the buffer's free
  64. * space, 1 otherwise.
  65. *
  66. * Writes a ASCII representation of a bitmask string into @s.
  67. */
  68. int
  69. trace_seq_bitmask(struct trace_seq *s, const unsigned long *maskp,
  70. int nmaskbits)
  71. {
  72. int len = (PAGE_SIZE - 1) - s->len;
  73. int ret;
  74. if (s->full || !len)
  75. return 0;
  76. ret = bitmap_scnprintf(s->buffer, len, maskp, nmaskbits);
  77. s->len += ret;
  78. return 1;
  79. }
  80. EXPORT_SYMBOL_GPL(trace_seq_bitmask);
  81. /**
  82. * trace_seq_vprintf - sequence printing of trace information
  83. * @s: trace sequence descriptor
  84. * @fmt: printf format string
  85. *
  86. * The tracer may use either sequence operations or its own
  87. * copy to user routines. To simplify formating of a trace
  88. * trace_seq_printf is used to store strings into a special
  89. * buffer (@s). Then the output may be either used by
  90. * the sequencer or pulled into another buffer.
  91. */
  92. int
  93. trace_seq_vprintf(struct trace_seq *s, const char *fmt, va_list args)
  94. {
  95. int len = (PAGE_SIZE - 1) - s->len;
  96. int ret;
  97. if (s->full || !len)
  98. return 0;
  99. ret = vsnprintf(s->buffer + s->len, len, fmt, args);
  100. /* If we can't write it all, don't bother writing anything */
  101. if (ret >= len) {
  102. s->full = 1;
  103. return 0;
  104. }
  105. s->len += ret;
  106. return len;
  107. }
  108. EXPORT_SYMBOL_GPL(trace_seq_vprintf);
  109. int trace_seq_bprintf(struct trace_seq *s, const char *fmt, const u32 *binary)
  110. {
  111. int len = (PAGE_SIZE - 1) - s->len;
  112. int ret;
  113. if (s->full || !len)
  114. return 0;
  115. ret = bstr_printf(s->buffer + s->len, len, fmt, binary);
  116. /* If we can't write it all, don't bother writing anything */
  117. if (ret >= len) {
  118. s->full = 1;
  119. return 0;
  120. }
  121. s->len += ret;
  122. return len;
  123. }
  124. /**
  125. * trace_seq_puts - trace sequence printing of simple string
  126. * @s: trace sequence descriptor
  127. * @str: simple string to record
  128. *
  129. * The tracer may use either the sequence operations or its own
  130. * copy to user routines. This function records a simple string
  131. * into a special buffer (@s) for later retrieval by a sequencer
  132. * or other mechanism.
  133. */
  134. int trace_seq_puts(struct trace_seq *s, const char *str)
  135. {
  136. int len = strlen(str);
  137. if (s->full)
  138. return 0;
  139. if (len > ((PAGE_SIZE - 1) - s->len)) {
  140. s->full = 1;
  141. return 0;
  142. }
  143. memcpy(s->buffer + s->len, str, len);
  144. s->len += len;
  145. return len;
  146. }
  147. int trace_seq_putc(struct trace_seq *s, unsigned char c)
  148. {
  149. if (s->full)
  150. return 0;
  151. if (s->len >= (PAGE_SIZE - 1)) {
  152. s->full = 1;
  153. return 0;
  154. }
  155. s->buffer[s->len++] = c;
  156. return 1;
  157. }
  158. EXPORT_SYMBOL(trace_seq_putc);
  159. int trace_seq_putmem(struct trace_seq *s, const void *mem, size_t len)
  160. {
  161. if (s->full)
  162. return 0;
  163. if (len > ((PAGE_SIZE - 1) - s->len)) {
  164. s->full = 1;
  165. return 0;
  166. }
  167. memcpy(s->buffer + s->len, mem, len);
  168. s->len += len;
  169. return len;
  170. }
  171. #define HEX_CHARS (MAX_MEMHEX_BYTES*2 + 1)
  172. int trace_seq_putmem_hex(struct trace_seq *s, const void *mem, size_t len)
  173. {
  174. unsigned char hex[HEX_CHARS];
  175. const unsigned char *data = mem;
  176. int i, j;
  177. if (s->full)
  178. return 0;
  179. #ifdef __BIG_ENDIAN
  180. for (i = 0, j = 0; i < len; i++) {
  181. #else
  182. for (i = len-1, j = 0; i >= 0; i--) {
  183. #endif
  184. hex[j++] = hex_asc_hi(data[i]);
  185. hex[j++] = hex_asc_lo(data[i]);
  186. }
  187. hex[j++] = ' ';
  188. return trace_seq_putmem(s, hex, j);
  189. }
  190. void *trace_seq_reserve(struct trace_seq *s, size_t len)
  191. {
  192. void *ret;
  193. if (s->full)
  194. return NULL;
  195. if (len > ((PAGE_SIZE - 1) - s->len)) {
  196. s->full = 1;
  197. return NULL;
  198. }
  199. ret = s->buffer + s->len;
  200. s->len += len;
  201. return ret;
  202. }
  203. int trace_seq_path(struct trace_seq *s, const struct path *path)
  204. {
  205. unsigned char *p;
  206. if (s->full)
  207. return 0;
  208. if (s->len >= (PAGE_SIZE - 1)) {
  209. s->full = 1;
  210. return 0;
  211. }
  212. p = d_path(path, s->buffer + s->len, PAGE_SIZE - s->len);
  213. if (!IS_ERR(p)) {
  214. p = mangle_path(s->buffer + s->len, p, "\n");
  215. if (p) {
  216. s->len = p - s->buffer;
  217. return 1;
  218. }
  219. } else {
  220. s->buffer[s->len++] = '?';
  221. return 1;
  222. }
  223. s->full = 1;
  224. return 0;
  225. }
  226. ssize_t trace_seq_to_user(struct trace_seq *s, char __user *ubuf, size_t cnt)
  227. {
  228. int len;
  229. int ret;
  230. if (!cnt)
  231. return 0;
  232. if (s->len <= s->readpos)
  233. return -EBUSY;
  234. len = s->len - s->readpos;
  235. if (cnt > len)
  236. cnt = len;
  237. ret = copy_to_user(ubuf, s->buffer + s->readpos, cnt);
  238. if (ret == cnt)
  239. return -EFAULT;
  240. cnt -= ret;
  241. s->readpos += cnt;
  242. return cnt;
  243. }