exec.c 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498
  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. vlong 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, uvlong addr, char fmt, Node *r)
  190. {
  191. int i;
  192. ulong lval;
  193. uvlong uvval;
  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 'W':
  227. r->type = TINT;
  228. ret = geta(m, addr, &uvval);
  229. if (ret < 0)
  230. error("indir: %r");
  231. r->ival = uvval;
  232. break;
  233. case 'B':
  234. case 'X':
  235. case 'D':
  236. case 'U':
  237. case 'O':
  238. case 'Q':
  239. r->type = TINT;
  240. ret = get4(m, addr, &lval);
  241. if (ret < 0)
  242. error("indir: %r");
  243. r->ival = lval;
  244. break;
  245. case 'V':
  246. case 'Y':
  247. case 'Z':
  248. r->type = TINT;
  249. ret = get8(m, addr, &uvval);
  250. if (ret < 0)
  251. error("indir: %r");
  252. r->ival = uvval;
  253. break;
  254. case 's':
  255. r->type = TSTRING;
  256. for(i = 0; i < sizeof(buf)-1; i++) {
  257. ret = get1(m, addr, (uchar*)&buf[i], 1);
  258. if (ret < 0)
  259. error("indir: %r");
  260. addr++;
  261. if(buf[i] == '\0')
  262. break;
  263. }
  264. buf[i] = 0;
  265. if(i == 0)
  266. strcpy(buf, "(null)");
  267. r->string = strnode(buf);
  268. break;
  269. case 'R':
  270. r->type = TSTRING;
  271. for(i = 0; i < sizeof(buf)-2; i += 2) {
  272. ret = get1(m, addr, (uchar*)&buf[i], 2);
  273. if (ret < 0)
  274. error("indir: %r");
  275. addr += 2;
  276. if(buf[i] == 0 && buf[i+1] == 0)
  277. break;
  278. }
  279. buf[i++] = 0;
  280. buf[i] = 0;
  281. r->string = runenode((Rune*)buf);
  282. break;
  283. case 'i':
  284. case 'I':
  285. if ((*machdata->das)(m, addr, fmt, buf, sizeof(buf)) < 0)
  286. error("indir: %r");
  287. r->type = TSTRING;
  288. r->fmt = 's';
  289. r->string = strnode(buf);
  290. break;
  291. case 'f':
  292. ret = get1(m, addr, (uchar*)buf, mach->szfloat);
  293. if (ret < 0)
  294. error("indir: %r");
  295. machdata->sftos(buf, sizeof(buf), (void*) buf);
  296. convflt(r, buf);
  297. break;
  298. case 'g':
  299. ret = get1(m, addr, (uchar*)buf, mach->szfloat);
  300. if (ret < 0)
  301. error("indir: %r");
  302. machdata->sftos(buf, sizeof(buf), (void*) buf);
  303. r->type = TSTRING;
  304. r->string = strnode(buf);
  305. break;
  306. case 'F':
  307. ret = get1(m, addr, (uchar*)buf, mach->szdouble);
  308. if (ret < 0)
  309. error("indir: %r");
  310. machdata->dftos(buf, sizeof(buf), (void*) buf);
  311. convflt(r, buf);
  312. break;
  313. case '3': /* little endian ieee 80 with hole in bytes 8&9 */
  314. ret = get1(m, addr, (uchar*)reg, 10);
  315. if (ret < 0)
  316. error("indir: %r");
  317. memmove(reg+10, reg+8, 2); /* open hole */
  318. memset(reg+8, 0, 2); /* fill it */
  319. leieee80ftos(buf, sizeof(buf), reg);
  320. convflt(r, buf);
  321. break;
  322. case '8': /* big-endian ieee 80 */
  323. ret = get1(m, addr, (uchar*)reg, 10);
  324. if (ret < 0)
  325. error("indir: %r");
  326. beieee80ftos(buf, sizeof(buf), reg);
  327. convflt(r, buf);
  328. break;
  329. case 'G':
  330. ret = get1(m, addr, (uchar*)buf, mach->szdouble);
  331. if (ret < 0)
  332. error("indir: %r");
  333. machdata->dftos(buf, sizeof(buf), (void*) buf);
  334. r->type = TSTRING;
  335. r->string = strnode(buf);
  336. break;
  337. }
  338. }
  339. void
  340. windir(Map *m, Node *addr, Node *rval, Node *r)
  341. {
  342. uchar cval;
  343. ushort sval;
  344. long lval;
  345. Node res, aes;
  346. int ret;
  347. if(m == 0)
  348. error("no map for */@=");
  349. expr(rval, &res);
  350. expr(addr, &aes);
  351. if(aes.type != TINT)
  352. error("bad type lhs of @/*");
  353. if(m != cormap && wtflag == 0)
  354. error("not in write mode");
  355. r->type = res.type;
  356. r->fmt = res.fmt;
  357. r->Store = res.Store;
  358. switch(res.fmt) {
  359. default:
  360. error("bad pointer format '%c' for */@=", res.fmt);
  361. case 'c':
  362. case 'C':
  363. case 'b':
  364. cval = res.ival;
  365. ret = put1(m, aes.ival, &cval, 1);
  366. break;
  367. case 'r':
  368. case 'x':
  369. case 'd':
  370. case 'u':
  371. case 'o':
  372. sval = res.ival;
  373. ret = put2(m, aes.ival, sval);
  374. r->ival = sval;
  375. break;
  376. case 'a':
  377. case 'A':
  378. case 'W':
  379. ret = puta(m, aes.ival, res.ival);
  380. break;
  381. case 'B':
  382. case 'X':
  383. case 'D':
  384. case 'U':
  385. case 'O':
  386. lval = res.ival;
  387. ret = put4(m, aes.ival, lval);
  388. break;
  389. case 'V':
  390. case 'Y':
  391. case 'Z':
  392. ret = put8(m, aes.ival, res.ival);
  393. break;
  394. case 's':
  395. case 'R':
  396. ret = put1(m, aes.ival, (uchar*)res.string->string, res.string->len);
  397. break;
  398. }
  399. if (ret < 0)
  400. error("windir: %r");
  401. }
  402. void
  403. call(char *fn, Node *parameters, Node *local, Node *body, Node *retexp)
  404. {
  405. int np, i;
  406. Rplace rlab;
  407. Node *n, res;
  408. Value *v, *f;
  409. Lsym *s, *next;
  410. Node *avp[Maxarg], *ava[Maxarg];
  411. rlab.local = 0;
  412. na = 0;
  413. flatten(avp, parameters);
  414. np = na;
  415. na = 0;
  416. flatten(ava, local);
  417. if(np != na) {
  418. if(np < na)
  419. error("%s: too few arguments", fn);
  420. error("%s: too many arguments", fn);
  421. }
  422. rlab.tail = &rlab.local;
  423. ret = &rlab;
  424. for(i = 0; i < np; i++) {
  425. n = ava[i];
  426. switch(n->op) {
  427. default:
  428. error("%s: %d formal not a name", fn, i);
  429. case ONAME:
  430. expr(avp[i], &res);
  431. s = n->sym;
  432. break;
  433. case OINDM:
  434. res.cc = avp[i];
  435. res.type = TCODE;
  436. res.comt = 0;
  437. if(n->left->op != ONAME)
  438. error("%s: %d formal not a name", fn, i);
  439. s = n->left->sym;
  440. break;
  441. }
  442. if(s->v->ret == ret)
  443. error("%s already declared at this scope", s->name);
  444. v = gmalloc(sizeof(Value));
  445. v->ret = ret;
  446. v->pop = s->v;
  447. s->v = v;
  448. v->scope = 0;
  449. *(rlab.tail) = s;
  450. rlab.tail = &v->scope;
  451. v->Store = res.Store;
  452. v->type = res.type;
  453. v->set = 1;
  454. }
  455. ret->val = retexp;
  456. if(setjmp(rlab.rlab) == 0)
  457. execute(body);
  458. for(s = rlab.local; s; s = next) {
  459. f = s->v;
  460. next = f->scope;
  461. s->v = f->pop;
  462. free(f);
  463. }
  464. }