A dynamic tracer for Linux

ply.c 5.8KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304
  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_num("0"),
  71. node_expr("pid", NULL),
  72. NULL),
  73. node_expr("time", NULL),
  74. NULL),
  75. node_expr("=",
  76. node_expr("{}",
  77. node_ident("reads"),
  78. node_expr("pid", NULL),
  79. NULL),
  80. node_expr("quantize", node_ident("arg2"), NULL),
  81. NULL),
  82. NULL);
  83. prog->provider = provider_get("k");
  84. prog->provider->probe(prog);
  85. prog->ir = ir_new();
  86. ctx->progs[0] = prog;
  87. /* PROBE1 */
  88. prog = calloc(1, sizeof(*prog));
  89. prog->locals = calloc(1, sizeof(*prog->locals));
  90. prog->globals = ctx->globals;
  91. /* TODO: k -> kret */
  92. prog->probe = "k:SyS_read2";
  93. /* { times[pid()] = quantize(time() - t[0, pid()]) } */
  94. prog->ast =
  95. node_expr("=",
  96. node_expr("{}",
  97. node_ident("times"),
  98. node_expr("pid", NULL),
  99. NULL),
  100. node_expr("quantize",
  101. node_expr("-",
  102. node_expr("time", NULL),
  103. node_expr("{}",
  104. node_ident("t"),
  105. node_num("0"),
  106. node_expr("time", NULL),
  107. node_expr("pid", NULL),
  108. NULL),
  109. NULL),
  110. NULL),
  111. NULL);
  112. prog->provider = provider_get("k");
  113. prog->provider->probe(prog);
  114. prog->ir = ir_new();
  115. ctx->progs[1] = prog;
  116. return ctx;
  117. }
  118. int pass_sym_alloc(struct node *n, void *_prog)
  119. {
  120. struct prog *prog = _prog;
  121. struct provider *global = provider_get(":");
  122. int err = 0;
  123. switch (n->ntype) {
  124. case N_EXPR:
  125. case N_IDENT:
  126. err = prog->provider->sym_alloc(prog, n);
  127. if (!err || (err != -ENOENT))
  128. break;
  129. err = global->sym_alloc(prog, n);
  130. break;
  131. case N_NUM:
  132. case N_STRING:
  133. err = global->sym_alloc(prog, n);
  134. }
  135. if (err) {
  136. if ((err == -ENOENT))
  137. _e("%#N: unknown symbol %N.\n", n, n);
  138. }
  139. return err;
  140. }
  141. int pass_type_infer(struct node *n, void *_prog)
  142. {
  143. struct prog *prog = _prog;
  144. if (n->sym->func->type_infer)
  145. return n->sym->func->type_infer(n->sym->func, n);
  146. /* TODO recurse as long as we're infering new types */
  147. return 0;
  148. }
  149. int pass_rewrite(struct node *n, void *_prog)
  150. {
  151. struct prog *prog = _prog;
  152. if (n->sym->func->rewrite)
  153. return n->sym->func->rewrite(n->sym->func, n, prog);
  154. return 0;
  155. }
  156. int pass_ir_pre(struct node *n, void *_prog)
  157. {
  158. struct prog *prog = _prog;
  159. if (n->sym->func->ir_pre)
  160. return n->sym->func->ir_pre(n->sym->func, n, prog);
  161. return 0;
  162. }
  163. int pass_ir_post(struct node *n, void *_prog)
  164. {
  165. struct prog *prog = _prog;
  166. if (n->sym->func->ir_post)
  167. return n->sym->func->ir_post(n->sym->func, n, prog);
  168. return 0;
  169. }
  170. int run_ir(struct pass *pass, struct ctx *ctx)
  171. {
  172. struct prog **progp;
  173. int err;
  174. for (progp = ctx->progs; *progp; progp++) {
  175. struct prog *prog = *progp;
  176. err = prog->provider->ir_pre ?
  177. prog->provider->ir_pre(prog) : 0;
  178. if (err)
  179. return err;
  180. err = node_walk(prog->ast, pass_ir_pre, pass_ir_post, prog);
  181. if (err)
  182. return err;
  183. err = prog->provider->ir_post ?
  184. prog->provider->ir_post(prog) : 0;
  185. if (err)
  186. return err;
  187. ir_emit_insn(prog->ir, EXIT, 0, 0);
  188. }
  189. return 0;
  190. }
  191. int run_walk(struct pass *pass, struct ctx *ctx)
  192. {
  193. struct prog **prog;
  194. int err;
  195. for (prog = ctx->progs; *prog; prog++) {
  196. err = node_walk((*prog)->ast, pass->pre, pass->post, *prog);
  197. if (err)
  198. return err;
  199. }
  200. return 0;
  201. }
  202. struct pass passes[] = {
  203. { .run = run_walk, .post = pass_sym_alloc },
  204. /* node->sym ok */
  205. { .run = run_walk, .post = pass_type_infer },
  206. /* node->sym->type ok */
  207. /* user input is accepted. we'll now start rewriting the ast,
  208. * so errors beyond this point are internal errors. */
  209. { .run = run_walk, .post = pass_rewrite },
  210. { .run = run_ir },
  211. /* program flattened to vBPF instructions, now rewrite it to
  212. * fit into the actual hw/vm. */
  213. /* BPF program ready */
  214. { NULL }
  215. };
  216. int main(void)
  217. {
  218. struct ctx *ctx = ctx_get();
  219. struct prog **prog;
  220. struct pass *pass;
  221. int err = 0;
  222. for (pass = passes; pass->run; pass++) {
  223. err = pass->run(pass, ctx);
  224. if (err)
  225. break;
  226. }
  227. for (prog = ctx->progs; *prog; prog++) {
  228. printf("\n\e[34m%s\e[0m\n", (*prog)->probe);
  229. ast_fprint(stdout, (*prog)->ast);
  230. printf("\n-- locals\n");
  231. symtab_dump((*prog)->locals, stdout);
  232. printf("-- ir\n");
  233. ir_dump((*prog)->ir, stdout);
  234. }
  235. printf("\n\n-- globals\n");
  236. symtab_dump(ctx->globals, stdout);
  237. /* printf("\n\n-- decls\n"); */
  238. /* type_dump_decls(stdout); */
  239. if (err)
  240. printf("ERR: %d\n", err);
  241. return err;
  242. }