tree.c 9.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498
  1. /* $Header$ */
  2. #include <stdio.h>
  3. #include <varargs.h>
  4. #include <assert.h>
  5. #include <alloc.h>
  6. #include <out.h>
  7. #include "operator.h"
  8. #include "position.h"
  9. #include "file.h"
  10. #include "idf.h"
  11. #include "tree.h"
  12. #include "scope.h"
  13. #include "symbol.h"
  14. #include "langdep.h"
  15. #include "type.h"
  16. #include "expr.h"
  17. #include "misc.h"
  18. extern FILE *db_out;
  19. t_lineno currline;
  20. t_lineno listline;
  21. extern char *strrindex();
  22. extern int interrupted;
  23. /*VARARGS1*/
  24. p_tree
  25. mknode(va_alist)
  26. va_dcl
  27. {
  28. va_list ap;
  29. register p_tree p = new_tree();
  30. va_start(ap);
  31. {
  32. register int i, na;
  33. p->t_oper = va_arg(ap, int);
  34. switch(p->t_oper) {
  35. case OP_NAME:
  36. case OP_HELP:
  37. p->t_idf = va_arg(ap, struct idf *);
  38. p->t_str = va_arg(ap, char *);
  39. break;
  40. case OP_STRING:
  41. p->t_sval = va_arg(ap, char *);
  42. break;
  43. case OP_REAL:
  44. p->t_fval = va_arg(ap, double);
  45. break;
  46. case OP_AT:
  47. p->t_lino = va_arg(ap, long);
  48. p->t_filename = va_arg(ap, char *);
  49. break;
  50. case OP_INTEGER:
  51. p->t_ival = va_arg(ap, long);
  52. break;
  53. default:
  54. na = nargs(p->t_oper);
  55. assert(na <= MAXARGS);
  56. for (i = 0; i < na; i++) {
  57. p->t_args[i] = va_arg(ap, p_tree);
  58. }
  59. break;
  60. }
  61. }
  62. va_end(ap);
  63. return p;
  64. }
  65. freenode(p)
  66. register p_tree p;
  67. {
  68. register int na, i;
  69. if (! p) return;
  70. na = nargs(p->t_oper);
  71. assert(na <= MAXARGS);
  72. for (i = 0; i < na; i++) {
  73. freenode(p->t_args[i]);
  74. }
  75. free_tree(p);
  76. }
  77. t_addr
  78. get_addr_from_node(p)
  79. p_tree p;
  80. {
  81. t_addr a = ILL_ADDR;
  82. register p_symbol sym;
  83. if (! p) return NO_ADDR;
  84. if (p->t_address != 0) return p->t_address;
  85. switch(p->t_oper) {
  86. case OP_AT:
  87. if (! p->t_filename &&
  88. (! listfile || ! (p->t_filename = listfile->sy_idf->id_text))) {
  89. error("no current file");
  90. break;
  91. }
  92. a = get_addr_from_position(&(p->t_pos));
  93. if (a == ILL_ADDR) {
  94. error("could not determine address of \"%s\":%d",
  95. p->t_filename, p->t_lino);
  96. break;
  97. }
  98. p->t_address = a;
  99. break;
  100. case OP_IN:
  101. a = get_addr_from_node(p->t_args[0]);
  102. if (p->t_args[1]) {
  103. p_scope sc;
  104. a = get_addr_from_node(p->t_args[1]);
  105. sc = base_scope(get_scope_from_addr(a));
  106. sym = identify(p->t_args[0], FUNCTION|PROC|MODULE);
  107. if (! sym->sy_name.nm_scope ||
  108. ! sym->sy_name.nm_scope->sc_bp_opp) {
  109. error("could not determine address of \"%s\"", p->t_str);
  110. a = ILL_ADDR;
  111. break;
  112. }
  113. if (sc->sc_definedby != sym) {
  114. error("inconsistent address");
  115. a = ILL_ADDR;
  116. break;
  117. }
  118. }
  119. p->t_address = a;
  120. break;
  121. case OP_NAME:
  122. case OP_SELECT:
  123. sym = identify(p, FUNCTION|PROC|MODULE);
  124. if (! sym) {
  125. break;
  126. }
  127. if (! sym->sy_name.nm_scope || ! sym->sy_name.nm_scope->sc_bp_opp) {
  128. error("could not determine address of \"%s\"", p->t_str);
  129. break;
  130. }
  131. a = sym->sy_name.nm_scope->sc_bp_opp;
  132. break;
  133. default:
  134. assert(0);
  135. }
  136. return a;
  137. }
  138. static int ommit_commas = 0;
  139. print_node(f, p, top_level)
  140. register p_tree p;
  141. register FILE *f;
  142. {
  143. if (!p) return;
  144. switch(p->t_oper) {
  145. case OP_LOG:
  146. fputs("log ", f);
  147. print_node(f, p->t_args[0], 0);
  148. break;
  149. case OP_PRCOMM:
  150. fputs("rerun ?", f);
  151. break;
  152. case OP_RUN:
  153. fputs("run ", f);
  154. ommit_commas = 1;
  155. print_node(f, p->t_args[0], 0);
  156. ommit_commas = 0;
  157. break;
  158. case OP_LIST:
  159. fputs("list ", f);
  160. if (p->t_args[0]) {
  161. print_node(f, p->t_args[0], 0);
  162. if (p->t_args[1]) {
  163. if (p->t_args[1]->t_ival >= 0) {
  164. fputs(", ", f);
  165. print_node(f, p->t_args[1], 0);
  166. }
  167. else {
  168. if (p->t_args[1]->t_ival < -100000000) {
  169. fputs("-", f);
  170. }
  171. else print_node(f, p->t_args[1], 0);
  172. }
  173. }
  174. }
  175. break;
  176. case OP_PRINT:
  177. fputs("print ", f);
  178. print_node(f, p->t_args[0], 0);
  179. break;
  180. case OP_SOURCE:
  181. fputs("source ", f);
  182. print_node(f, p->t_args[0], 0);
  183. break;
  184. case OP_ENABLE:
  185. fputs("enable ", f);
  186. print_node(f, p->t_args[0], 0);
  187. break;
  188. case OP_DISABLE:
  189. fputs("disable ", f);
  190. print_node(f, p->t_args[0], 0);
  191. break;
  192. case OP_DISPLAY:
  193. fputs("display ", f);
  194. print_node(f, p->t_args[0], 0);
  195. break;
  196. case OP_LINK:
  197. print_node(f, p->t_args[0], 0);
  198. if (! ommit_commas) fputs(", ", f);
  199. else putc(' ', f);
  200. print_node(f, p->t_args[1], 0);
  201. break;
  202. case OP_FILE:
  203. fputs("file ", f);
  204. print_node(f, p->t_args[0], 0);
  205. break;
  206. case OP_FRAME:
  207. fputs("frame ", f);
  208. print_node(f, p->t_args[0], 0);
  209. break;
  210. case OP_UP:
  211. fputs("frame +", f);
  212. print_node(f, p->t_args[0], 0);
  213. break;
  214. case OP_DOWN:
  215. fputs("frame -", f);
  216. print_node(f, p->t_args[0], 0);
  217. break;
  218. case OP_SET:
  219. fputs("set ", f);
  220. print_node(f, p->t_args[0], 0);
  221. fputs(" to ", f);
  222. print_node(f, p->t_args[1], 0);
  223. break;
  224. case OP_FIND:
  225. fputs("find ", f);
  226. print_node(f, p->t_args[0], 0);
  227. break;
  228. case OP_WHICH:
  229. fputs("which ", f);
  230. print_node(f, p->t_args[0], 0);
  231. break;
  232. case OP_DELETE:
  233. fputs("delete ", f);
  234. print_node(f, p->t_args[0], 0);
  235. break;
  236. case OP_REGS:
  237. fputs("regs ", f);
  238. print_node(f, p->t_args[0], 0);
  239. break;
  240. case OP_NEXT:
  241. fputs("next ", f);
  242. print_node(f, p->t_args[0], 0);
  243. break;
  244. case OP_STEP:
  245. fputs("step ", f);
  246. print_node(f, p->t_args[0], 0);
  247. break;
  248. case OP_STATUS:
  249. fputs("status", f);
  250. break;
  251. case OP_DUMP:
  252. fputs("dump ", f);
  253. (void) print_position(p->t_address, 1);
  254. break;
  255. case OP_RESTORE:
  256. fputs("restore ", f);
  257. print_node(f, p->t_args[0], 0);
  258. break;
  259. case OP_WHERE:
  260. fputs("where ", f);
  261. print_node(f, p->t_args[0], 0);
  262. break;
  263. case OP_HELP:
  264. fputs("help ", f);
  265. print_node(f, p->t_args[0], 0);
  266. break;
  267. case OP_CONT:
  268. fputs("cont", f);
  269. if (p->t_args[0]) {
  270. fprintf(f, " %ld", p->t_args[0]->t_ival);
  271. }
  272. if (p->t_args[1]) {
  273. fputs(" ", f);
  274. print_node(f, p->t_args[1], 0);
  275. }
  276. break;
  277. case OP_WHEN:
  278. fputs("when ", f);
  279. if (p->t_address != NO_ADDR) {
  280. (void) print_position(p->t_address, 1);
  281. }
  282. else print_node(f, p->t_args[0], 0);
  283. if (p->t_args[1]) {
  284. fputs(" if ", f);
  285. print_node(f, p->t_args[1], 0);
  286. }
  287. p = p->t_args[2];
  288. fputs(" { ", f);
  289. while (p && p->t_oper == OP_LINK) {
  290. print_node(f, p->t_args[0], 0);
  291. fputs("; ", f);
  292. p = p->t_args[1];
  293. }
  294. print_node(f, p, 0);
  295. fputs(" }", f);
  296. break;
  297. case OP_STOP:
  298. fputs("stop ", f);
  299. if (p->t_address != NO_ADDR) {
  300. (void) print_position(p->t_address, 1);
  301. }
  302. else print_node(f, p->t_args[0], 0);
  303. if (p->t_args[1]) {
  304. fputs(" if ", f);
  305. print_node(f, p->t_args[1], 0);
  306. }
  307. break;
  308. case OP_TRACE:
  309. fputs("trace ", f);
  310. if (p->t_args[2]) {
  311. fputs("on ", f);
  312. print_node(f, p->t_args[2], 0);
  313. fputs(" ", f);
  314. }
  315. if (p->t_address != NO_ADDR) {
  316. (void) print_position(p->t_address, 1);
  317. }
  318. else print_node(f, p->t_args[0], 0);
  319. if (p->t_args[1]) {
  320. fputs(" if ", f);
  321. print_node(f, p->t_args[1], 0);
  322. }
  323. break;
  324. case OP_AT:
  325. fprintf(f, "at \"%s\":%d", p->t_filename, (int) p->t_lino);
  326. break;
  327. case OP_IN:
  328. fputs("in ", f);
  329. print_node(f, p->t_args[0], 0);
  330. fputs(" ", f);
  331. print_node(f, p->t_args[1], 0);
  332. break;
  333. case OP_SELECT:
  334. print_node(f, p->t_args[0], 0);
  335. fputs("`", f);
  336. print_node(f, p->t_args[1], 0);
  337. break;
  338. case OP_OUTPUT:
  339. fprintf(f, "> %s ", p->t_str);
  340. break;
  341. case OP_INPUT:
  342. fprintf(f, "< %s ", p->t_str);
  343. break;
  344. case OP_NAME:
  345. fputs(p->t_str, f);
  346. break;
  347. case OP_INTEGER:
  348. fprintf(f, currlang->decint_fmt, p->t_ival);
  349. break;
  350. case OP_STRING:
  351. (*currlang->printstring)(f, p->t_sval, strlen(p->t_sval));
  352. break;
  353. case OP_REAL:
  354. fprintf(f, currlang->real_fmt, p->t_fval);
  355. break;
  356. case OP_FORMAT:
  357. print_node(f, p->t_args[0], 0);
  358. fputs("\\", f);
  359. print_node(f, p->t_args[1], 0);
  360. break;
  361. case OP_UNOP:
  362. case OP_BINOP:
  363. (*currlang->printop)(f, p);
  364. break;
  365. default:
  366. assert(0);
  367. }
  368. if (top_level) fputs("\n", f);
  369. }
  370. int
  371. repeatable(com)
  372. p_tree com;
  373. {
  374. switch(com->t_oper) {
  375. case OP_CONT:
  376. com->t_args[0]->t_ival = 1;
  377. freenode(com->t_args[1]);
  378. com->t_args[1] = 0;
  379. return 1;
  380. case OP_NEXT:
  381. case OP_STEP:
  382. freenode(com->t_args[0]);
  383. com->t_args[0] = 0;
  384. return 1;
  385. case OP_LIST:
  386. freenode(com->t_args[0]);
  387. com->t_args[0] = 0;
  388. freenode(com->t_args[1]);
  389. com->t_args[1] = 0;
  390. return 1;
  391. }
  392. return 0;
  393. }
  394. int
  395. in_status(com)
  396. p_tree com;
  397. {
  398. switch(com->t_oper) {
  399. case OP_PRCOMM:
  400. /* not really in status but may not be removed */
  401. case OP_STOP:
  402. case OP_WHEN:
  403. case OP_TRACE:
  404. case OP_DUMP:
  405. case OP_DISPLAY:
  406. return 1;
  407. }
  408. return 0;
  409. }
  410. eval(p)
  411. p_tree p;
  412. {
  413. if (p && operators[p->t_oper].op_fun) (*operators[p->t_oper].op_fun)(p);
  414. }
  415. newfile(id)
  416. register struct idf *id;
  417. {
  418. register p_symbol sym = Lookup(id, PervasiveScope, FILESYM);
  419. if (listfile != sym) listline = 1;
  420. listfile = sym;
  421. if (! listfile) {
  422. listline = 1;
  423. listfile = add_file(id->id_text);
  424. listfile->sy_file->f_scope = FileScope;
  425. }
  426. find_language(strrindex(id->id_text, '.'));
  427. }
  428. int in_wheninvoked;
  429. perform(p, a)
  430. register p_tree p;
  431. t_addr a;
  432. {
  433. switch(p->t_oper) {
  434. case OP_WHEN:
  435. if (p->t_args[1] && ! eval_cond(p->t_args[1])) break;
  436. p = p->t_args[2];
  437. in_wheninvoked++;
  438. while (p && p->t_oper == OP_LINK) {
  439. if (interrupted) return;
  440. if (p->t_args[0]) eval(p->t_args[0]);
  441. p = p->t_args[1];
  442. }
  443. if (interrupted) return;
  444. if (p) eval(p);
  445. in_wheninvoked--;
  446. break;
  447. case OP_TRACE:
  448. if (p->t_args[0] && p->t_args[0]->t_oper == OP_IN) {
  449. register p_scope sc = base_scope(CurrentScope);
  450. if (sc != get_scope_from_addr(p->t_args[0]->t_address)) {
  451. break;
  452. }
  453. }
  454. if (interrupted) return;
  455. if (p->t_args[1] && ! eval_cond(p->t_args[1])) break;
  456. list_position(get_position_from_addr(a));
  457. if (p->t_args[2]) do_print(p->t_args[2]);
  458. break;
  459. default:
  460. assert(0);
  461. }
  462. }
  463. list_position(pos)
  464. p_position pos;
  465. {
  466. newfile(str2idf(pos->filename, 1));
  467. currfile = listfile;
  468. currline = pos->lineno;
  469. lines(currfile->sy_file, (int)currline, (int)1);
  470. listline = 0;
  471. }