tree.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848
  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 "message.h"
  13. #include "scope.h"
  14. #include "symbol.h"
  15. #include "langdep.h"
  16. #include "type.h"
  17. #include "expr.h"
  18. extern FILE *db_out;
  19. t_lineno currline;
  20. static t_lineno listline;
  21. extern long pointer_size;
  22. extern char *strrindex();
  23. extern int interrupted;
  24. extern int stop_reason;
  25. p_tree print_command;
  26. static int wsize = 10;
  27. /*VARARGS1*/
  28. p_tree
  29. mknode(va_alist)
  30. va_dcl
  31. {
  32. va_list ap;
  33. register p_tree p = new_tree();
  34. va_start(ap);
  35. {
  36. register int i, na;
  37. p->t_oper = va_arg(ap, int);
  38. switch(p->t_oper) {
  39. case OP_NAME:
  40. case OP_HELP:
  41. p->t_idf = va_arg(ap, struct idf *);
  42. p->t_str = va_arg(ap, char *);
  43. break;
  44. case OP_STRING:
  45. p->t_sval = va_arg(ap, char *);
  46. break;
  47. case OP_REAL:
  48. p->t_fval = va_arg(ap, double);
  49. break;
  50. case OP_AT:
  51. p->t_lino = va_arg(ap, long);
  52. p->t_filename = va_arg(ap, char *);
  53. break;
  54. case OP_INTEGER:
  55. p->t_ival = va_arg(ap, long);
  56. break;
  57. default:
  58. na = nargs(p->t_oper);
  59. assert(na <= MAXARGS);
  60. for (i = 0; i < na; i++) {
  61. p->t_args[i] = va_arg(ap, p_tree);
  62. }
  63. break;
  64. }
  65. }
  66. va_end(ap);
  67. return p;
  68. }
  69. freenode(p)
  70. register p_tree p;
  71. {
  72. register int na, i;
  73. if (! p) return;
  74. na = nargs(p->t_oper);
  75. assert(na <= MAXARGS);
  76. for (i = 0; i < na; i++) {
  77. freenode(p->t_args[i]);
  78. }
  79. free_tree(p);
  80. }
  81. static t_addr
  82. get_addr_from_node(p)
  83. p_tree p;
  84. {
  85. t_addr a = ILL_ADDR;
  86. register p_symbol sym;
  87. if (! p) return NO_ADDR;
  88. if (p->t_address != 0) return p->t_address;
  89. switch(p->t_oper) {
  90. case OP_AT:
  91. if (! p->t_filename &&
  92. (! listfile || ! (p->t_filename = listfile->sy_idf->id_text))) {
  93. error("no current file");
  94. break;
  95. }
  96. a = get_addr_from_position(&(p->t_pos));
  97. if (a == ILL_ADDR) {
  98. error("could not determine address of \"%s\":%d",
  99. p->t_filename, p->t_lino);
  100. break;
  101. }
  102. p->t_address = a;
  103. break;
  104. case OP_IN:
  105. a = get_addr_from_node(p->t_args[0]);
  106. if (p->t_args[1]) {
  107. p_scope sc;
  108. a = get_addr_from_node(p->t_args[1]);
  109. sc = base_scope(get_scope_from_addr(a));
  110. sym = identify(p->t_args[0], FUNCTION|PROC|MODULE);
  111. if (! sym->sy_name.nm_scope ||
  112. ! sym->sy_name.nm_scope->sc_bp_opp) {
  113. error("could not determine address of \"%s\"", p->t_str);
  114. a = ILL_ADDR;
  115. break;
  116. }
  117. if (sc->sc_definedby != sym) {
  118. error("inconsistent address");
  119. a = ILL_ADDR;
  120. break;
  121. }
  122. }
  123. p->t_address = a;
  124. break;
  125. case OP_NAME:
  126. case OP_SELECT:
  127. sym = identify(p, FUNCTION|PROC|MODULE);
  128. if (! sym) {
  129. break;
  130. }
  131. if (! sym->sy_name.nm_scope || ! sym->sy_name.nm_scope->sc_bp_opp) {
  132. error("could not determine address of \"%s\"", p->t_str);
  133. break;
  134. }
  135. a = sym->sy_name.nm_scope->sc_bp_opp;
  136. break;
  137. default:
  138. assert(0);
  139. }
  140. return a;
  141. }
  142. print_node(p, top_level)
  143. register p_tree p;
  144. {
  145. if (!p) return;
  146. switch(p->t_oper) {
  147. case OP_LIST:
  148. fputs("list ", db_out);
  149. if (p->t_args[0]) {
  150. print_node(p->t_args[0], 0);
  151. if (p->t_args[1]) {
  152. if (p->t_args[1]->t_ival >= 0) {
  153. fputs(", ", db_out);
  154. print_node(p->t_args[1], 0);
  155. }
  156. else {
  157. if (p->t_args[1]->t_ival < -100000000) {
  158. fputs("-", db_out);
  159. }
  160. else print_node(p->t_args[1], 0);
  161. }
  162. }
  163. }
  164. break;
  165. case OP_PRINT:
  166. fputs("print ", db_out);
  167. print_node(p->t_args[0], 0);
  168. break;
  169. case OP_ENABLE:
  170. fputs("enable ", db_out);
  171. print_node(p->t_args[0], 0);
  172. break;
  173. case OP_DISABLE:
  174. fputs("disable ", db_out);
  175. print_node(p->t_args[0], 0);
  176. break;
  177. case OP_DISPLAY:
  178. fputs("display ", db_out);
  179. print_node(p->t_args[0], 0);
  180. break;
  181. case OP_LINK:
  182. print_node(p->t_args[0], 0);
  183. fputs(", ", db_out);
  184. print_node(p->t_args[1], 0);
  185. break;
  186. case OP_FILE:
  187. fputs("file ", db_out);
  188. print_node(p->t_args[0], 0);
  189. break;
  190. case OP_SET:
  191. fputs("set ", db_out);
  192. print_node(p->t_args[0], 0);
  193. fputs(" to ", db_out);
  194. print_node(p->t_args[1], 0);
  195. break;
  196. case OP_FIND:
  197. fputs("find ", db_out);
  198. print_node(p->t_args[0], 0);
  199. break;
  200. case OP_WHICH:
  201. fputs("which ", db_out);
  202. print_node(p->t_args[0], 0);
  203. break;
  204. case OP_DELETE:
  205. fputs("delete ", db_out);
  206. print_node(p->t_args[0], 0);
  207. break;
  208. case OP_REGS:
  209. fputs("regs ", db_out);
  210. print_node(p->t_args[0], 0);
  211. break;
  212. case OP_NEXT:
  213. fputs("next ", db_out);
  214. print_node(p->t_args[0], 0);
  215. break;
  216. case OP_STEP:
  217. fputs("step ", db_out);
  218. print_node(p->t_args[0], 0);
  219. break;
  220. case OP_STATUS:
  221. fputs("status", db_out);
  222. break;
  223. case OP_DUMP:
  224. fputs("dump ", db_out);
  225. print_position(p->t_address, 1);
  226. break;
  227. case OP_RESTORE:
  228. fputs("restore ", db_out);
  229. print_node(p->t_args[0], 0);
  230. break;
  231. case OP_WHERE:
  232. fputs("where ", db_out);
  233. print_node(p->t_args[0], 0);
  234. break;
  235. case OP_HELP:
  236. fputs("help ", db_out);
  237. print_node(p->t_args[0], 0);
  238. break;
  239. case OP_CONT:
  240. fputs("cont", db_out);
  241. if (p->t_args[0]) {
  242. fprintf(db_out, " %ld", p->t_args[0]->t_ival);
  243. }
  244. if (p->t_args[1]) {
  245. fputs(" ", db_out);
  246. print_node(p->t_args[1], 0);
  247. }
  248. break;
  249. case OP_WHEN:
  250. fputs("when ", db_out);
  251. if (p->t_address != NO_ADDR) {
  252. print_position(p->t_address, 1);
  253. }
  254. else print_node(p->t_args[0], 0);
  255. if (p->t_args[1]) {
  256. fputs(" if ", db_out);
  257. print_node(p->t_args[1], 0);
  258. }
  259. p = p->t_args[2];
  260. fputs(" { ", db_out);
  261. while (p && p->t_oper == OP_LINK) {
  262. print_node(p->t_args[0], 0);
  263. fputs("; ", db_out);
  264. p = p->t_args[1];
  265. }
  266. print_node(p, 0);
  267. fputs(" }", db_out);
  268. break;
  269. case OP_STOP:
  270. fputs("stop ", db_out);
  271. if (p->t_address != NO_ADDR) {
  272. print_position(p->t_address, 1);
  273. }
  274. else print_node(p->t_args[0], 0);
  275. if (p->t_args[1]) {
  276. fputs(" if ", db_out);
  277. print_node(p->t_args[1], 0);
  278. }
  279. break;
  280. case OP_TRACE:
  281. fputs("trace ", db_out);
  282. if (p->t_args[2]) {
  283. fputs("on ", db_out);
  284. print_node(p->t_args[2], 0);
  285. fputs(" ", db_out);
  286. }
  287. if (p->t_address != NO_ADDR) {
  288. print_position(p->t_address, 1);
  289. }
  290. else print_node(p->t_args[0], 0);
  291. if (p->t_args[1]) {
  292. fputs(" if ", db_out);
  293. print_node(p->t_args[1], 0);
  294. }
  295. break;
  296. case OP_AT:
  297. fprintf(db_out, "at \"%s\":%ld", p->t_filename, p->t_lino);
  298. break;
  299. case OP_IN:
  300. fputs("in ", db_out);
  301. print_node(p->t_args[0], 0);
  302. fputs(" ", db_out);
  303. print_node(p->t_args[1], 0);
  304. break;
  305. case OP_SELECT:
  306. print_node(p->t_args[0], 0);
  307. fputs("`", db_out);
  308. print_node(p->t_args[1], 0);
  309. break;
  310. case OP_NAME:
  311. fputs(p->t_str, db_out);
  312. break;
  313. case OP_INTEGER:
  314. fprintf(db_out, currlang->decint_fmt, p->t_ival);
  315. break;
  316. case OP_STRING:
  317. (*currlang->printstring)(p->t_sval, strlen(p->t_sval));
  318. break;
  319. case OP_REAL:
  320. fprintf(db_out, currlang->real_fmt, p->t_fval);
  321. break;
  322. case OP_FORMAT:
  323. print_node(p->t_args[0], 0);
  324. fputs("\\", db_out);
  325. print_node(p->t_args[1], 0);
  326. break;
  327. case OP_UNOP:
  328. case OP_BINOP:
  329. (*currlang->printop)(p);
  330. break;
  331. default:
  332. assert(0);
  333. }
  334. if (top_level) fputs("\n", db_out);
  335. }
  336. int
  337. repeatable(com)
  338. p_tree com;
  339. {
  340. switch(com->t_oper) {
  341. case OP_CONT:
  342. com->t_args[0]->t_ival = 1;
  343. freenode(com->t_args[1]);
  344. com->t_args[1] = 0;
  345. return 1;
  346. case OP_NEXT:
  347. case OP_STEP:
  348. freenode(com->t_args[0]);
  349. com->t_args[0] = 0;
  350. return 1;
  351. case OP_LIST:
  352. freenode(com->t_args[0]);
  353. com->t_args[0] = 0;
  354. freenode(com->t_args[1]);
  355. com->t_args[1] = 0;
  356. return 1;
  357. }
  358. return 0;
  359. }
  360. int
  361. in_status(com)
  362. p_tree com;
  363. {
  364. switch(com->t_oper) {
  365. case OP_STOP:
  366. case OP_WHEN:
  367. case OP_TRACE:
  368. case OP_DUMP:
  369. case OP_DISPLAY:
  370. return 1;
  371. }
  372. return 0;
  373. }
  374. eval(p)
  375. p_tree p;
  376. {
  377. if (p && operators[p->t_oper].op_fun) (*operators[p->t_oper].op_fun)(p);
  378. }
  379. do_list(p)
  380. p_tree p;
  381. {
  382. int l1, l2;
  383. if (p->t_args[1]) {
  384. l2 = p->t_args[1]->t_ival;
  385. if (l2 >= 0) {
  386. if (l2 == 0) l2 = 1;
  387. wsize = l2;
  388. }
  389. }
  390. else l2 = wsize;
  391. if (! p->t_args[0]) {
  392. l1 = listline;
  393. if (! l1) {
  394. listline = currline - (wsize/2);
  395. l1 = listline;
  396. }
  397. }
  398. else {
  399. if (p->t_args[0]->t_oper == OP_INTEGER) {
  400. l1 = p->t_args[0]->t_ival;
  401. }
  402. else {
  403. t_addr a = get_addr_from_node(p->t_args[0]);
  404. p_position pos;
  405. if (a == ILL_ADDR) {
  406. return;
  407. }
  408. pos = get_position_from_addr(a);
  409. newfile(str2idf(pos->filename, 1));
  410. l1 = pos->lineno - (l2 > 0 ? l2 : wsize)/2;
  411. if (l1 < 1) l1 = 1;
  412. }
  413. }
  414. if (listfile) {
  415. if (l2 < 0) {
  416. l2 = -l2;
  417. if (l1 > l2) l2 = 1;
  418. else l2 -= l1 - 1;
  419. }
  420. lines(listfile->sy_file, l1, l2);
  421. listline = l1 + l2;
  422. }
  423. else error("no current file");
  424. }
  425. do_file(p)
  426. p_tree p;
  427. {
  428. FILE *f;
  429. if (p->t_args[0]) {
  430. if ((f = fopen(p->t_args[0]->t_str, "r")) == NULL) {
  431. error("could not open %s", p->t_args[0]->t_str);
  432. return;
  433. }
  434. fclose(f);
  435. newfile(p->t_args[0]->t_idf);
  436. }
  437. else if (listfile) fprintf(db_out, "%s\n", listfile->sy_idf->id_text);
  438. else error("no current file");
  439. }
  440. newfile(id)
  441. register struct idf *id;
  442. {
  443. register p_symbol sym = Lookup(id, PervasiveScope, FILESYM);
  444. if (listfile != sym) listline = 1;
  445. listfile = sym;
  446. if (! listfile) {
  447. listline = 1;
  448. listfile = add_file(id->id_text);
  449. listfile->sy_file->f_scope = FileScope;
  450. }
  451. find_language(strrindex(id->id_text, '.'));
  452. }
  453. setstop(p, kind)
  454. p_tree p;
  455. int kind;
  456. {
  457. t_addr a = get_addr_from_node(p->t_args[0]);
  458. if (a == ILL_ADDR) return 0;
  459. p->t_address = a;
  460. if (a != NO_ADDR) {
  461. if (! set_or_clear_breakpoint(a, kind)) {
  462. return 0;
  463. }
  464. }
  465. return 1;
  466. }
  467. do_stop(p)
  468. p_tree p;
  469. {
  470. if (! setstop(p, SETBP)) {
  471. return;
  472. }
  473. add_to_item_list(p);
  474. }
  475. settrace(p, kind)
  476. p_tree p;
  477. int kind;
  478. {
  479. t_addr a, e;
  480. a = get_addr_from_node(p->t_args[0]);
  481. if (a == NO_ADDR) return 1;
  482. if (a == ILL_ADDR) return 0;
  483. if (p->t_args[0]->t_oper == OP_AT) {
  484. e = a;
  485. p->t_address = a;
  486. }
  487. else {
  488. p_scope sc = get_next_scope_from_addr(a+1);
  489. if (sc) e = sc->sc_start - 1;
  490. else e = 0xffffffff;
  491. }
  492. return set_or_clear_trace(a, e, kind);
  493. }
  494. do_trace(p)
  495. p_tree p;
  496. {
  497. p->t_address = NO_ADDR;
  498. if (! settrace(p, SETTRACE)) {
  499. return;
  500. }
  501. add_to_item_list(p);
  502. }
  503. static
  504. able(p, kind)
  505. p_tree p;
  506. int kind;
  507. {
  508. if (!p) {
  509. if (stop_reason) {
  510. able_item(stop_reason, kind);
  511. }
  512. else {
  513. error("no current stopping point");
  514. }
  515. return;
  516. }
  517. switch(p->t_oper) {
  518. case OP_LINK:
  519. able(p->t_args[0], kind);
  520. able(p->t_args[1], kind);
  521. break;
  522. case OP_INTEGER:
  523. able_item((int)p->t_ival, kind);
  524. break;
  525. default:
  526. assert(0);
  527. }
  528. }
  529. do_enable(p)
  530. p_tree p;
  531. {
  532. able(p->t_args[0], 0);
  533. }
  534. do_disable(p)
  535. p_tree p;
  536. {
  537. able(p->t_args[0], 1);
  538. }
  539. do_continue(p)
  540. p_tree p;
  541. {
  542. int count;
  543. if (p) {
  544. count = p->t_args[0]->t_ival;
  545. if (p->t_args[1]) {
  546. t_addr a = get_addr_from_position(&(p->t_args[1]->t_pos));
  547. p_scope sc = get_scope_from_addr(a);
  548. if (a == ILL_ADDR || base_scope(sc) != base_scope(CurrentScope)) {
  549. error("cannot continue at line %d",
  550. p->t_args[1]->t_lino);
  551. return;
  552. }
  553. if (! set_pc(a)) {
  554. return;
  555. }
  556. }
  557. }
  558. else count = 1;
  559. while (count--) {
  560. if (! send_cont(count==0)) {
  561. break;
  562. }
  563. }
  564. if (count > 0) {
  565. fprintf(db_out, "Only %d breakpoints skipped\n",
  566. p->t_args[0]->t_ival - count);
  567. }
  568. }
  569. do_step(p)
  570. p_tree p;
  571. {
  572. p = p->t_args[0];
  573. if (! do_single_step(SETSS, p ? p->t_ival : 1L)) {
  574. }
  575. }
  576. do_next(p)
  577. p_tree p;
  578. {
  579. p = p->t_args[0];
  580. if (! do_single_step(SETSSF, p? p->t_ival : 1L)) {
  581. }
  582. }
  583. extern t_addr *get_EM_regs();
  584. do_regs(p)
  585. p_tree p;
  586. {
  587. t_addr *buf;
  588. int n = 0;
  589. p = p->t_args[0];
  590. if (p) n = p->t_ival;
  591. if (! (buf = get_EM_regs(n))) {
  592. return;
  593. }
  594. fprintf(db_out, "EM registers %d levels back:\n", n);
  595. fprintf(db_out, "\tLocalBase =\t0x%lx\n\tArgumentBase =\t0x%lx\n",
  596. (long) buf[LB_OFF], (long) buf[AB_OFF]);
  597. fprintf(db_out, "\tProgramCounter=\t0x%lx\n\tHeapPointer = \t0x%lx\n",
  598. (long) buf[PC_OFF],
  599. (long) buf[HP_OFF]);
  600. fprintf(db_out, "\tStackPointer =\t0x%lx\n", (long) buf[SP_OFF]);
  601. }
  602. /*ARGSUSED*/
  603. do_where(p)
  604. p_tree p;
  605. {
  606. int i = 0;
  607. unsigned int cnt;
  608. unsigned int maxcnt = 0xffff;
  609. p_scope sc;
  610. t_addr *buf;
  611. t_addr PC;
  612. p = p->t_args[0];
  613. if (p && p->t_ival < 0) {
  614. for (;;) {
  615. buf = get_EM_regs(i++);
  616. if (! buf || ! buf[AB_OFF]) break;
  617. PC = buf[PC_OFF];
  618. sc = base_scope(get_scope_from_addr(PC));
  619. if (! sc || sc->sc_start > PC) break;
  620. if (interrupted) return;
  621. }
  622. i--;
  623. maxcnt = - p->t_ival;
  624. i -= maxcnt;
  625. if (i < 0) i = 0;
  626. }
  627. else if (p) maxcnt = p->t_ival;
  628. for (cnt = maxcnt; cnt != 0; cnt--) {
  629. t_addr AB;
  630. if (interrupted) return;
  631. if (! (buf = get_EM_regs(i++))) break;
  632. AB = buf[AB_OFF];
  633. PC = buf[PC_OFF];
  634. if (! AB) break;
  635. sc = base_scope(get_scope_from_addr(PC));
  636. if (! sc || sc->sc_start > PC) break;
  637. fprintf(db_out, "%s(", sc->sc_definedby->sy_idf->id_text);
  638. print_params(sc->sc_definedby->sy_type, AB, has_static_link(sc));
  639. fputs(") ", db_out);
  640. print_position(PC, 0);
  641. fputs("\n", db_out);
  642. }
  643. }
  644. extern p_tree remove_from_item_list();
  645. do_delete(p)
  646. p_tree p;
  647. {
  648. switch(p->t_oper) {
  649. case OP_DELETE:
  650. if (! p->t_args[0]) {
  651. if (stop_reason) {
  652. remove_from_item_list(stop_reason);
  653. stop_reason = 0;
  654. }
  655. else {
  656. error("no current stopping point");
  657. }
  658. }
  659. else do_delete(p->t_args[0]);
  660. break;
  661. case OP_LINK:
  662. do_delete(p->t_args[0]);
  663. do_delete(p->t_args[1]);
  664. break;
  665. case OP_INTEGER:
  666. p = remove_from_item_list((int) p->t_ival);
  667. if (p) switch(p->t_oper) {
  668. case OP_WHEN:
  669. case OP_STOP:
  670. setstop(p, CLRBP);
  671. break;
  672. case OP_TRACE:
  673. settrace(p, CLRTRACE);
  674. break;
  675. case OP_DUMP:
  676. free_dump(p);
  677. }
  678. freenode(p);
  679. break;
  680. default:
  681. assert(0);
  682. }
  683. }
  684. do_print(p)
  685. p_tree p;
  686. {
  687. char *buf = 0;
  688. char *format = 0;
  689. long size;
  690. p_type tp;
  691. switch(p->t_oper) {
  692. case OP_PRINT:
  693. if (p->t_args[0] == 0) {
  694. p = print_command;
  695. if (p == 0) {
  696. error("no previous print command");
  697. break;
  698. }
  699. }
  700. else if (p != print_command) {
  701. /* freenode(print_command); No, could be in when-list */
  702. print_command = p;
  703. }
  704. /* fall through */
  705. case OP_DISPLAY:
  706. do_print(p->t_args[0]);
  707. break;
  708. case OP_LINK:
  709. do_print(p->t_args[0]);
  710. do_print(p->t_args[1]);
  711. break;
  712. default:
  713. if (interrupted || ! eval_expr(p, &buf, &size, &tp)) return;
  714. print_node(p, 0);
  715. fputs(" = ", db_out);
  716. if (p->t_oper == OP_FORMAT) {
  717. format = p->t_args[1]->t_str;
  718. }
  719. print_val(tp, size, buf, 0, 0, format);
  720. if (buf) free(buf);
  721. fputs("\n", db_out);
  722. break;
  723. }
  724. }
  725. do_set(p)
  726. p_tree p;
  727. {
  728. char *buf = 0;
  729. long size, size2;
  730. p_type tp, tp2;
  731. t_addr a;
  732. if (interrupted || ! eval_desig(p->t_args[0], &a, &size, &tp) ||
  733. ! eval_expr(p->t_args[1], &buf, &size2, &tp2) ||
  734. ! convert(&buf, &size2, &tp2, tp, size)) {
  735. if (buf) free(buf);
  736. return;
  737. }
  738. if (interrupted) {
  739. free(buf);
  740. return;
  741. }
  742. set_bytes(size, buf, a);
  743. free(buf);
  744. }
  745. perform(p, a)
  746. register p_tree p;
  747. t_addr a;
  748. {
  749. switch(p->t_oper) {
  750. case OP_WHEN:
  751. if (p->t_args[1] && ! eval_cond(p->t_args[1])) break;
  752. p = p->t_args[2];
  753. while (p && p->t_oper == OP_LINK) {
  754. if (interrupted) return;
  755. if (p->t_args[0]) eval(p->t_args[0]);
  756. p = p->t_args[1];
  757. }
  758. if (interrupted) return;
  759. if (p) eval(p);
  760. break;
  761. case OP_TRACE:
  762. if (p->t_args[0] && p->t_args[0]->t_oper == OP_IN) {
  763. register p_scope sc = base_scope(CurrentScope);
  764. if (sc != get_scope_from_addr(p->t_args[0]->t_address)) {
  765. break;
  766. }
  767. }
  768. if (interrupted) return;
  769. if (p->t_args[1] && ! eval_cond(p->t_args[1])) break;
  770. list_position(get_position_from_addr(a));
  771. if (p->t_args[2]) do_print(p->t_args[2]);
  772. break;
  773. default:
  774. assert(0);
  775. }
  776. }
  777. list_position(pos)
  778. p_position pos;
  779. {
  780. newfile(str2idf(pos->filename, 1));
  781. currfile = listfile;
  782. currline = pos->lineno;
  783. lines(currfile->sy_file, (int)currline, (int)1);
  784. listline = 0;
  785. }