exec.c 8.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488
  1. #include <u.h>
  2. #include <libc.h>
  3. #include <bio.h>
  4. #include <ctype.h>
  5. #include <mach.h>
  6. #define Extern extern
  7. #include "acid.h"
  8. void
  9. error(char *fmt, ...)
  10. {
  11. int i;
  12. char buf[2048];
  13. va_list arg;
  14. /* Unstack io channels */
  15. if(iop != 0) {
  16. for(i = 1; i < iop; i++)
  17. Bterm(io[i]);
  18. bout = io[0];
  19. iop = 0;
  20. }
  21. ret = 0;
  22. gotint = 0;
  23. Bflush(bout);
  24. if(silent)
  25. silent = 0;
  26. else {
  27. va_start(arg, fmt);
  28. vseprint(buf, buf+sizeof(buf), fmt, arg);
  29. va_end(arg);
  30. fprint(2, "%L: (error) %s\n", buf);
  31. }
  32. while(popio())
  33. ;
  34. interactive = 1;
  35. longjmp(err, 1);
  36. }
  37. void
  38. unwind(void)
  39. {
  40. int i;
  41. Lsym *s;
  42. Value *v;
  43. for(i = 0; i < Hashsize; i++) {
  44. for(s = hash[i]; s; s = s->hash) {
  45. while(s->v->pop) {
  46. v = s->v->pop;
  47. free(s->v);
  48. s->v = v;
  49. }
  50. }
  51. }
  52. }
  53. void
  54. execute(Node *n)
  55. {
  56. Value *v;
  57. Lsym *sl;
  58. Node *l, *r;
  59. int i, s, e;
  60. Node res, xx;
  61. static int stmnt;
  62. gc();
  63. if(gotint)
  64. error("interrupted");
  65. if(n == 0)
  66. return;
  67. if(stmnt++ > 5000) {
  68. Bflush(bout);
  69. stmnt = 0;
  70. }
  71. l = n->left;
  72. r = n->right;
  73. switch(n->op) {
  74. default:
  75. expr(n, &res);
  76. if(ret || (res.type == TLIST && res.l == 0))
  77. break;
  78. prnt->right = &res;
  79. expr(prnt, &xx);
  80. break;
  81. case OASGN:
  82. case OCALL:
  83. expr(n, &res);
  84. break;
  85. case OCOMPLEX:
  86. decl(n);
  87. break;
  88. case OLOCAL:
  89. for(n = n->left; n; n = n->left) {
  90. if(ret == 0)
  91. error("local not in function");
  92. sl = n->sym;
  93. if(sl->v->ret == ret)
  94. error("%s declared twice", sl->name);
  95. v = gmalloc(sizeof(Value));
  96. v->ret = ret;
  97. v->pop = sl->v;
  98. sl->v = v;
  99. v->scope = 0;
  100. *(ret->tail) = sl;
  101. ret->tail = &v->scope;
  102. v->set = 0;
  103. }
  104. break;
  105. case ORET:
  106. if(ret == 0)
  107. error("return not in function");
  108. expr(n->left, ret->val);
  109. longjmp(ret->rlab, 1);
  110. case OLIST:
  111. execute(n->left);
  112. execute(n->right);
  113. break;
  114. case OIF:
  115. expr(l, &res);
  116. if(r && r->op == OELSE) {
  117. if(bool(&res))
  118. execute(r->left);
  119. else
  120. execute(r->right);
  121. }
  122. else if(bool(&res))
  123. execute(r);
  124. break;
  125. case OWHILE:
  126. for(;;) {
  127. expr(l, &res);
  128. if(!bool(&res))
  129. break;
  130. execute(r);
  131. }
  132. break;
  133. case ODO:
  134. expr(l->left, &res);
  135. if(res.type != TINT)
  136. error("loop must have integer start");
  137. s = res.ival;
  138. expr(l->right, &res);
  139. if(res.type != TINT)
  140. error("loop must have integer end");
  141. e = res.ival;
  142. for(i = s; i <= e; i++)
  143. execute(r);
  144. break;
  145. }
  146. }
  147. int
  148. bool(Node *n)
  149. {
  150. int true = 0;
  151. if(n->op != OCONST)
  152. fatal("bool: not const");
  153. switch(n->type) {
  154. case TINT:
  155. if(n->ival != 0)
  156. true = 1;
  157. break;
  158. case TFLOAT:
  159. if(n->fval != 0.0)
  160. true = 1;
  161. break;
  162. case TSTRING:
  163. if(n->string->len)
  164. true = 1;
  165. break;
  166. case TLIST:
  167. if(n->l)
  168. true = 1;
  169. break;
  170. }
  171. return true;
  172. }
  173. void
  174. convflt(Node *r, char *flt)
  175. {
  176. char c;
  177. c = flt[0];
  178. if(('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z')) {
  179. r->type = TSTRING;
  180. r->fmt = 's';
  181. r->string = strnode(flt);
  182. }
  183. else {
  184. r->type = TFLOAT;
  185. r->fval = atof(flt);
  186. }
  187. }
  188. void
  189. indir(Map *m, ulong addr, char fmt, Node *r)
  190. {
  191. int i;
  192. long ival;
  193. vlong vval;
  194. int ret;
  195. uchar cval;
  196. ushort sval;
  197. char buf[512], reg[12];
  198. r->op = OCONST;
  199. r->fmt = fmt;
  200. switch(fmt) {
  201. default:
  202. error("bad pointer format '%c' for *", fmt);
  203. case 'c':
  204. case 'C':
  205. case 'b':
  206. r->type = TINT;
  207. ret = get1(m, addr, &cval, 1);
  208. if (ret < 0)
  209. error("indir: %r");
  210. r->ival = cval;
  211. break;
  212. case 'x':
  213. case 'd':
  214. case 'u':
  215. case 'o':
  216. case 'q':
  217. case 'r':
  218. r->type = TINT;
  219. ret = get2(m, addr, &sval);
  220. if (ret < 0)
  221. error("indir: %r");
  222. r->ival = sval;
  223. break;
  224. case 'a':
  225. case 'A':
  226. case 'B':
  227. case 'X':
  228. case 'D':
  229. case 'U':
  230. case 'O':
  231. case 'Q':
  232. r->type = TINT;
  233. ret = get4(m, addr, &ival);
  234. if (ret < 0)
  235. error("indir: %r");
  236. r->ival = ival;
  237. break;
  238. case 'V':
  239. case 'W':
  240. case 'Y':
  241. case 'Z':
  242. r->type = TINT;
  243. ret = get8(m, addr, &vval);
  244. if (ret < 0)
  245. error("indir: %r");
  246. r->ival = vval;
  247. break;
  248. case 's':
  249. r->type = TSTRING;
  250. for(i = 0; i < sizeof(buf)-1; i++) {
  251. ret = get1(m, addr, (uchar*)&buf[i], 1);
  252. if (ret < 0)
  253. error("indir: %r");
  254. addr++;
  255. if(buf[i] == '\0')
  256. break;
  257. }
  258. buf[i] = 0;
  259. if(i == 0)
  260. strcpy(buf, "(null)");
  261. r->string = strnode(buf);
  262. break;
  263. case 'R':
  264. r->type = TSTRING;
  265. for(i = 0; i < sizeof(buf)-2; i += 2) {
  266. ret = get1(m, addr, (uchar*)&buf[i], 2);
  267. if (ret < 0)
  268. error("indir: %r");
  269. addr += 2;
  270. if(buf[i] == 0 && buf[i+1] == 0)
  271. break;
  272. }
  273. buf[i++] = 0;
  274. buf[i] = 0;
  275. r->string = runenode((Rune*)buf);
  276. break;
  277. case 'i':
  278. case 'I':
  279. if ((*machdata->das)(m, addr, fmt, buf, sizeof(buf)) < 0)
  280. error("indir: %r");
  281. r->type = TSTRING;
  282. r->fmt = 's';
  283. r->string = strnode(buf);
  284. break;
  285. case 'f':
  286. ret = get1(m, addr, (uchar*)buf, mach->szfloat);
  287. if (ret < 0)
  288. error("indir: %r");
  289. machdata->sftos(buf, sizeof(buf), (void*) buf);
  290. convflt(r, buf);
  291. break;
  292. case 'g':
  293. ret = get1(m, addr, (uchar*)buf, mach->szfloat);
  294. if (ret < 0)
  295. error("indir: %r");
  296. machdata->sftos(buf, sizeof(buf), (void*) buf);
  297. r->type = TSTRING;
  298. r->string = strnode(buf);
  299. break;
  300. case 'F':
  301. ret = get1(m, addr, (uchar*)buf, mach->szdouble);
  302. if (ret < 0)
  303. error("indir: %r");
  304. machdata->dftos(buf, sizeof(buf), (void*) buf);
  305. convflt(r, buf);
  306. break;
  307. case '3': /* little endian ieee 80 with hole in bytes 8&9 */
  308. ret = get1(m, addr, (uchar*)reg, 10);
  309. if (ret < 0)
  310. error("indir: %r");
  311. memmove(reg+10, reg+8, 2); /* open hole */
  312. memset(reg+8, 0, 2); /* fill it */
  313. leieee80ftos(buf, sizeof(buf), reg);
  314. convflt(r, buf);
  315. break;
  316. case '8': /* big-endian ieee 80 */
  317. ret = get1(m, addr, (uchar*)reg, 10);
  318. if (ret < 0)
  319. error("indir: %r");
  320. beieee80ftos(buf, sizeof(buf), reg);
  321. convflt(r, buf);
  322. break;
  323. case 'G':
  324. ret = get1(m, addr, (uchar*)buf, mach->szdouble);
  325. if (ret < 0)
  326. error("indir: %r");
  327. machdata->dftos(buf, sizeof(buf), (void*) buf);
  328. r->type = TSTRING;
  329. r->string = strnode(buf);
  330. break;
  331. }
  332. }
  333. void
  334. windir(Map *m, Node *addr, Node *rval, Node *r)
  335. {
  336. uchar cval;
  337. ushort sval;
  338. Node res, aes;
  339. int ret;
  340. if(m == 0)
  341. error("no map for */@=");
  342. expr(rval, &res);
  343. expr(addr, &aes);
  344. if(aes.type != TINT)
  345. error("bad type lhs of @/*");
  346. if(m != cormap && wtflag == 0)
  347. error("not in write mode");
  348. r->type = res.type;
  349. r->fmt = res.fmt;
  350. r->Store = res.Store;
  351. switch(res.fmt) {
  352. default:
  353. error("bad pointer format '%c' for */@=", res.fmt);
  354. case 'c':
  355. case 'C':
  356. case 'b':
  357. cval = res.ival;
  358. ret = put1(m, aes.ival, &cval, 1);
  359. break;
  360. case 'r':
  361. case 'x':
  362. case 'd':
  363. case 'u':
  364. case 'o':
  365. sval = res.ival;
  366. ret = put2(m, aes.ival, sval);
  367. r->ival = sval;
  368. break;
  369. case 'a':
  370. case 'A':
  371. case 'B':
  372. case 'X':
  373. case 'D':
  374. case 'U':
  375. case 'O':
  376. ret = put4(m, aes.ival, res.ival);
  377. break;
  378. case 'V':
  379. case 'W':
  380. case 'Y':
  381. case 'Z':
  382. ret = put8(m, aes.ival, res.ival);
  383. break;
  384. case 's':
  385. case 'R':
  386. ret = put1(m, aes.ival, (uchar*)res.string->string, res.string->len);
  387. break;
  388. }
  389. if (ret < 0)
  390. error("windir: %r");
  391. }
  392. void
  393. call(char *fn, Node *parameters, Node *local, Node *body, Node *retexp)
  394. {
  395. int np, i;
  396. Rplace rlab;
  397. Node *n, res;
  398. Value *v, *f;
  399. Lsym *s, *next;
  400. Node *avp[Maxarg], *ava[Maxarg];
  401. rlab.local = 0;
  402. na = 0;
  403. flatten(avp, parameters);
  404. np = na;
  405. na = 0;
  406. flatten(ava, local);
  407. if(np != na) {
  408. if(np < na)
  409. error("%s: too few arguments", fn);
  410. error("%s: too many arguments", fn);
  411. }
  412. rlab.tail = &rlab.local;
  413. ret = &rlab;
  414. for(i = 0; i < np; i++) {
  415. n = ava[i];
  416. switch(n->op) {
  417. default:
  418. error("%s: %d formal not a name", fn, i);
  419. case ONAME:
  420. expr(avp[i], &res);
  421. s = n->sym;
  422. break;
  423. case OINDM:
  424. res.cc = avp[i];
  425. res.type = TCODE;
  426. res.comt = 0;
  427. if(n->left->op != ONAME)
  428. error("%s: %d formal not a name", fn, i);
  429. s = n->left->sym;
  430. break;
  431. }
  432. if(s->v->ret == ret)
  433. error("%s already declared at this scope", s->name);
  434. v = gmalloc(sizeof(Value));
  435. v->ret = ret;
  436. v->pop = s->v;
  437. s->v = v;
  438. v->scope = 0;
  439. *(rlab.tail) = s;
  440. rlab.tail = &v->scope;
  441. v->Store = res.Store;
  442. v->type = res.type;
  443. v->set = 1;
  444. }
  445. ret->val = retexp;
  446. if(setjmp(rlab.rlab) == 0)
  447. execute(body);
  448. for(s = rlab.local; s; s = next) {
  449. f = s->v;
  450. next = f->scope;
  451. s->v = f->pop;
  452. free(f);
  453. }
  454. }