A dynamic tracer for Linux

ply.c 6.5KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332
  1. #include <assert.h>
  2. #include <errno.h>
  3. #include <stdio.h>
  4. #include <stdlib.h>
  5. #include <string.h>
  6. #include "func.h"
  7. #include "ir.h"
  8. #include "node.h"
  9. #include "ply.h"
  10. #include "sym.h"
  11. #include "type.h"
  12. struct providers {
  13. struct provider **ps;
  14. size_t len;
  15. } providers;
  16. #define providers_foreach(_ps, _p) \
  17. for((_p) = (_ps)->ps; (_p) < &(_ps)->ps[(_ps)->len]; (_p)++)
  18. struct provider *provider_get(const char *name)
  19. {
  20. struct provider **p;
  21. providers_foreach(&providers, p) {
  22. if (strstr((*p)->name, name) == (*p)->name)
  23. return *p;
  24. }
  25. return NULL;
  26. }
  27. void provider_register(struct provider *p)
  28. {
  29. assert(p);
  30. assert(p->probe);
  31. assert(p->sym_alloc);
  32. providers.ps = realloc(providers.ps,
  33. ++providers.len * sizeof(*providers.ps));
  34. providers.ps[providers.len - 1] = p;
  35. }
  36. struct pass {
  37. int (*run)(struct pass *, struct ctx *);
  38. nwalk_fn pre;
  39. nwalk_fn post;
  40. };
  41. struct symtab syms = { .syms = NULL, .len = 0 };
  42. /* symtab_t locals = { .sym = NULL, .len = 0 }; */
  43. struct ctx *ctx_get(void)
  44. {
  45. struct ctx *ctx;
  46. struct prog *prog;
  47. ctx = calloc(1, sizeof(*ctx));
  48. ctx->globals = calloc(1, sizeof(*ctx->globals));
  49. ctx->progs = calloc(3, sizeof(*ctx->progs));
  50. /* PROBE0 */
  51. prog = calloc(1, sizeof(*prog));
  52. prog->locals = calloc(1, sizeof(*prog->locals));
  53. prog->globals = ctx->globals;
  54. prog->probe = "k:SyS_read";
  55. /* {
  56. * # us = pid();
  57. * t[0, pid()] = time();
  58. * reads[pid()] = quantize(arg2);
  59. * }
  60. */
  61. prog->ast =
  62. node_expr(":block",
  63. /* node_expr("=", */
  64. /* node_ident("us"), */
  65. /* node_expr("pid", NULL), */
  66. /* NULL), */
  67. /* node_expr("=", */
  68. /* node_expr("{}", */
  69. /* node_ident("t"), */
  70. /* node_expr("pid", NULL), */
  71. /* node_num("0x10000000"), */
  72. /* NULL), */
  73. /* node_expr("time", NULL), */
  74. /* NULL), */
  75. node_expr("count",
  76. node_expr("{}",
  77. node_ident("reads"),
  78. node_expr("pid", NULL),
  79. node_ident("arg0"),
  80. NULL),
  81. NULL),
  82. /* node_expr("=", */
  83. /* node_expr("{}", */
  84. /* node_ident("reads"), */
  85. /* node_expr("pid", NULL), */
  86. /* NULL), */
  87. /* node_expr("quantize", node_ident("arg2"), NULL), */
  88. /* NULL), */
  89. NULL);
  90. prog->provider = provider_get("k");
  91. prog->provider->probe(prog);
  92. prog->ir = ir_new();
  93. ctx->progs[0] = prog;
  94. /* PROBE1 */
  95. /* prog = calloc(1, sizeof(*prog)); */
  96. /* prog->locals = calloc(1, sizeof(*prog->locals)); */
  97. /* prog->globals = ctx->globals; */
  98. /* /\* TODO: k -> kret *\/ */
  99. /* prog->probe = "k:SyS_read2"; */
  100. /* /\* { times[pid()] = quantize(time() - t[0, pid()]) } *\/ */
  101. /* prog->ast = */
  102. /* node_expr("=", */
  103. /* node_expr("{}", */
  104. /* node_ident("times"), */
  105. /* node_expr("pid", NULL), */
  106. /* NULL), */
  107. /* node_expr("quantize", */
  108. /* node_expr("-", */
  109. /* node_expr("time", NULL), */
  110. /* node_expr("{}", */
  111. /* node_ident("t"), */
  112. /* node_num("0"), */
  113. /* node_expr("time", NULL), */
  114. /* node_expr("pid", NULL), */
  115. /* NULL), */
  116. /* NULL), */
  117. /* NULL), */
  118. /* NULL); */
  119. /* prog->provider = provider_get("k"); */
  120. /* prog->provider->probe(prog); */
  121. /* prog->ir = ir_new(); */
  122. /* ctx->progs[1] = prog; */
  123. return ctx;
  124. }
  125. int pass_sym_alloc(struct node *n, void *_prog)
  126. {
  127. struct prog *prog = _prog;
  128. struct provider *global = provider_get(":");
  129. int err = 0;
  130. if (n->sym)
  131. return 0;
  132. switch (n->ntype) {
  133. case N_EXPR:
  134. case N_IDENT:
  135. err = prog->provider->sym_alloc(prog, n);
  136. if (!err || (err != -ENOENT))
  137. break;
  138. err = global->sym_alloc(prog, n);
  139. break;
  140. case N_NUM:
  141. case N_STRING:
  142. err = global->sym_alloc(prog, n);
  143. }
  144. if (err) {
  145. if ((err == -ENOENT))
  146. _e("%#N: unknown symbol %N.\n", n, n);
  147. }
  148. return err;
  149. }
  150. int pass_type_infer(struct node *n, void *_prog)
  151. {
  152. struct prog *prog = _prog;
  153. if (n->sym->func->type_infer)
  154. return n->sym->func->type_infer(n->sym->func, n);
  155. /* TODO recurse as long as we're infering new types */
  156. return 0;
  157. }
  158. int pass_rewrite(struct node *n, void *_prog)
  159. {
  160. struct prog *prog = _prog;
  161. if (n->sym->func->rewrite)
  162. return n->sym->func->rewrite(n->sym->func, n, prog);
  163. return 0;
  164. }
  165. int pass_ir_pre(struct node *n, void *_prog)
  166. {
  167. struct prog *prog = _prog;
  168. if (n->sym->func->ir_pre)
  169. return n->sym->func->ir_pre(n->sym->func, n, prog);
  170. return 0;
  171. }
  172. int pass_ir_post(struct node *n, void *_prog)
  173. {
  174. struct prog *prog = _prog;
  175. if (n->sym->func->ir_post)
  176. return n->sym->func->ir_post(n->sym->func, n, prog);
  177. return 0;
  178. }
  179. int run_walk(struct pass *pass, struct ctx *ctx)
  180. {
  181. struct prog **prog;
  182. int err;
  183. for (prog = ctx->progs; *prog; prog++) {
  184. err = node_walk((*prog)->ast, pass->pre, pass->post, *prog);
  185. if (err)
  186. return err;
  187. }
  188. return 0;
  189. }
  190. int run_ir(struct pass *pass, struct ctx *ctx)
  191. {
  192. struct prog **progp;
  193. int err;
  194. for (progp = ctx->progs; *progp; progp++) {
  195. struct prog *prog = *progp;
  196. err = prog->provider->ir_pre ?
  197. prog->provider->ir_pre(prog) : 0;
  198. if (err)
  199. return err;
  200. err = node_walk(prog->ast, pass_ir_pre, pass_ir_post, prog);
  201. if (err)
  202. return err;
  203. err = prog->provider->ir_post ?
  204. prog->provider->ir_post(prog) : 0;
  205. if (err)
  206. return err;
  207. ir_emit_insn(prog->ir, EXIT, 0, 0);
  208. }
  209. return 0;
  210. }
  211. int run_bpf(struct pass *pass, struct ctx *ctx)
  212. {
  213. struct prog **progp;
  214. int err;
  215. for (progp = ctx->progs; *progp; progp++) {
  216. struct prog *prog = *progp;
  217. err = ir_bpf_generate(prog->ir);
  218. if (err)
  219. return err;
  220. }
  221. return 0;
  222. }
  223. struct pass passes[] = {
  224. { .run = run_walk, .post = pass_sym_alloc },
  225. { .run = run_walk, .post = pass_type_infer },
  226. { .run = run_walk, .post = pass_rewrite },
  227. { .run = run_walk, .post = pass_sym_alloc },
  228. { .run = run_walk, .post = pass_type_infer },
  229. { .run = run_ir },
  230. /* program flattened to vBPF instructions, now rewrite it to
  231. * fit into the actual hw/vm. */
  232. { .run = run_bpf },
  233. /* BPF program ready */
  234. { NULL }
  235. };
  236. int main(void)
  237. {
  238. struct ctx *ctx = ctx_get();
  239. struct prog **prog;
  240. struct pass *pass;
  241. int err = 0;
  242. for (pass = passes; pass->run; pass++) {
  243. err = pass->run(pass, ctx);
  244. if (err)
  245. break;
  246. }
  247. for (prog = ctx->progs; *prog; prog++) {
  248. printf("\n\e[34m%s\e[0m\n", (*prog)->probe);
  249. ast_fprint(stdout, (*prog)->ast);
  250. printf("\n-- locals\n");
  251. symtab_dump((*prog)->locals, stdout);
  252. printf("-- ir\n");
  253. ir_dump((*prog)->ir, stdout);
  254. }
  255. printf("\n\n-- globals\n");
  256. symtab_dump(ctx->globals, stdout);
  257. /* printf("\n\n-- decls\n"); */
  258. /* type_dump_decls(stdout); */
  259. if (err)
  260. printf("ERR: %d\n", err);
  261. return err;
  262. }