t7.c 8.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551
  1. /*
  2. * This file is part of the UCB release of Plan 9. It is subject to the license
  3. * terms in the LICENSE file found in the top-level directory of this
  4. * distribution and at http://akaros.cs.berkeley.edu/files/Plan9License. No
  5. * part of the UCB release of Plan 9, including this file, may be copied,
  6. * modified, propagated, or distributed except according to the terms contained
  7. * in the LICENSE file.
  8. */
  9. /*
  10. * 7. Macros, strings, diversion, and position traps.
  11. *
  12. * macros can override builtins
  13. * builtins can be renamed or removed!
  14. */
  15. #include "a.h"
  16. enum
  17. {
  18. MAXARG = 10,
  19. MAXMSTACK = 40
  20. };
  21. /* macro invocation frame */
  22. typedef struct Mac Mac;
  23. struct Mac
  24. {
  25. int argc;
  26. Rune *argv[MAXARG];
  27. };
  28. Mac mstack[MAXMSTACK];
  29. int nmstack;
  30. void emitdi(void);
  31. void flushdi(void);
  32. /*
  33. * Run a user-defined macro.
  34. */
  35. void popmacro(void);
  36. int
  37. runmacro(int dot, int argc, Rune **argv)
  38. {
  39. Rune *p;
  40. int i;
  41. Mac *m;
  42. if(verbose && isupperrune(argv[0][0])) fprint(2, "run: %S\n", argv[0]);
  43. p = getds(argv[0]);
  44. if(p == nil){
  45. if(verbose)
  46. warn("ignoring unknown request %C%S", dot, argv[0]);
  47. if(verbose > 1){
  48. for(i=0; i<argc; i++)
  49. fprint(2, " %S", argv[i]);
  50. fprint(2, "\n");
  51. }
  52. return -1;
  53. }
  54. if(nmstack >= nelem(mstack)){
  55. fprint(2, "%L: macro stack overflow:");
  56. for(i=0; i<nmstack; i++)
  57. fprint(2, " %S", mstack[i].argv[0]);
  58. fprint(2, "\n");
  59. return -1;
  60. }
  61. m = &mstack[nmstack++];
  62. m->argc = argc;
  63. for(i=0; i<argc; i++)
  64. m->argv[i] = erunestrdup(argv[i]);
  65. pushinputstring(p);
  66. nr(L(".$"), argc-1);
  67. inputnotify(popmacro);
  68. return 0;
  69. }
  70. void
  71. popmacro(void)
  72. {
  73. int i;
  74. Mac *m;
  75. if(--nmstack < 0){
  76. fprint(2, "%L: macro stack underflow\n");
  77. return;
  78. }
  79. m = &mstack[nmstack];
  80. for(i=0; i<m->argc; i++)
  81. free(m->argv[i]);
  82. if(nmstack > 0)
  83. nr(L(".$"), mstack[nmstack-1].argc-1);
  84. else
  85. nr(L(".$"), 0);
  86. }
  87. void popmacro1(void);
  88. jmp_buf runjb[10];
  89. int nrunjb;
  90. void
  91. runmacro1(Rune *name)
  92. {
  93. Rune *argv[2];
  94. int obol;
  95. if(verbose) fprint(2, "outcb %p\n", outcb);
  96. obol = bol;
  97. argv[0] = name;
  98. argv[1] = nil;
  99. bol = 1;
  100. if(runmacro('.', 1, argv) >= 0){
  101. inputnotify(popmacro1);
  102. if(!setjmp(runjb[nrunjb++]))
  103. runinput();
  104. else
  105. if(verbose) fprint(2, "finished %S\n", name);
  106. }
  107. bol = obol;
  108. }
  109. void
  110. popmacro1(void)
  111. {
  112. popmacro();
  113. if(nrunjb >= 0)
  114. longjmp(runjb[--nrunjb], 1);
  115. }
  116. /*
  117. * macro arguments
  118. *
  119. * "" means " inside " "
  120. * "" empty string
  121. * \newline can be done
  122. * argument separator is space (not tab)
  123. * number register .$ = number of arguments
  124. * no arguments outside macros or in strings
  125. *
  126. * arguments copied in copy mode
  127. */
  128. /*
  129. * diversions
  130. *
  131. * processed output diverted
  132. * dn dl registers vertical and horizontal size of last diversion
  133. * .z - current diversion name
  134. */
  135. /*
  136. * traps
  137. *
  138. * skip most
  139. * .t register - distance to next trap
  140. */
  141. static Rune *trap0;
  142. void
  143. outtrap(void)
  144. {
  145. Rune *t;
  146. if(outcb)
  147. return;
  148. if(trap0){
  149. if(verbose) fprint(2, "trap: %S\n", trap0);
  150. t = trap0;
  151. trap0 = nil;
  152. runmacro1(t);
  153. free(t);
  154. }
  155. }
  156. /* .wh - install trap */
  157. void
  158. r_wh(int argc, Rune **argv)
  159. {
  160. int i;
  161. if(argc < 2)
  162. return;
  163. i = eval(argv[1]);
  164. if(argc == 2){
  165. if(i == 0){
  166. free(trap0);
  167. trap0 = nil;
  168. }else
  169. if(verbose)
  170. warn("not removing trap at %d", i);
  171. }
  172. if(argc > 2){
  173. if(i == 0){
  174. free(trap0);
  175. trap0 = erunestrdup(argv[2]);
  176. }else
  177. if(verbose)
  178. warn("not installing %S trap at %d", argv[2], i);
  179. }
  180. }
  181. void
  182. r_ch(int argc, Rune **argv)
  183. {
  184. int i;
  185. if(argc == 2){
  186. if(trap0 && runestrcmp(argv[1], trap0) == 0){
  187. free(trap0);
  188. trap0 = nil;
  189. }else
  190. if(verbose)
  191. warn("not removing %S trap", argv[1]);
  192. return;
  193. }
  194. if(argc >= 3){
  195. i = eval(argv[2]);
  196. if(i == 0){
  197. free(trap0);
  198. trap0 = erunestrdup(argv[1]);
  199. }else
  200. if(verbose)
  201. warn("not moving %S trap to %d", argv[1], i);
  202. }
  203. }
  204. void
  205. r_dt(int argc, Rune **argv)
  206. {
  207. USED(argc);
  208. USED(argv);
  209. warn("ignoring diversion trap");
  210. }
  211. /* define macro - .de, .am, .ig */
  212. void
  213. r_de(int argc, Rune **argv)
  214. {
  215. Rune *end, *p;
  216. Fmt fmt;
  217. int ignore, len;
  218. delreq(argv[1]);
  219. delraw(argv[1]);
  220. ignore = runestrcmp(argv[0], L("ig")) == 0;
  221. if(!ignore)
  222. runefmtstrinit(&fmt);
  223. end = L("..");
  224. if(argc >= 3)
  225. end = argv[2];
  226. if(runestrcmp(argv[0], L("am")) == 0 && (p=getds(argv[1])) != nil)
  227. fmtrunestrcpy(&fmt, p);
  228. len = runestrlen(end);
  229. while((p = readline(CopyMode)) != nil){
  230. if(runestrncmp(p, end, len) == 0
  231. && (p[len]==' ' || p[len]==0 || p[len]=='\t'
  232. || (p[len]=='\\' && p[len+1]=='}'))){
  233. free(p);
  234. goto done;
  235. }
  236. if(!ignore)
  237. fmtprint(&fmt, "%S\n", p);
  238. free(p);
  239. }
  240. warn("eof in %C%S %S - looking for %#Q", dot, argv[0], argv[1], end);
  241. done:
  242. if(ignore)
  243. return;
  244. p = runefmtstrflush(&fmt);
  245. if(p == nil)
  246. sysfatal("out of memory");
  247. ds(argv[1], p);
  248. free(p);
  249. }
  250. /* define string .ds .as */
  251. void
  252. r_ds(Rune *cmd)
  253. {
  254. Rune *name, *line, *p;
  255. name = copyarg();
  256. line = readline(CopyMode);
  257. if(name == nil || line == nil){
  258. free(name);
  259. return;
  260. }
  261. p = line;
  262. if(*p == '"')
  263. p++;
  264. if(cmd[0] == 'd')
  265. ds(name, p);
  266. else
  267. as(name, p);
  268. free(name);
  269. free(line);
  270. }
  271. /* remove request, macro, or string */
  272. void
  273. r_rm(int argc, Rune **argv)
  274. {
  275. int i;
  276. emitdi();
  277. for(i=1; i<argc; i++){
  278. delreq(argv[i]);
  279. delraw(argv[i]);
  280. ds(argv[i], nil);
  281. }
  282. }
  283. /* .rn - rename request, macro, or string */
  284. void
  285. r_rn(int argc, Rune **argv)
  286. {
  287. USED(argc);
  288. renreq(argv[1], argv[2]);
  289. renraw(argv[1], argv[2]);
  290. ds(argv[2], getds(argv[1]));
  291. ds(argv[1], nil);
  292. }
  293. /* .di - divert output to macro xx */
  294. /* .da - divert, appending to macro */
  295. /* page offsetting is not done! */
  296. Fmt difmt;
  297. int difmtinit;
  298. Rune di[20][100];
  299. int ndi;
  300. void
  301. emitdi(void)
  302. {
  303. flushdi();
  304. runefmtstrinit(&difmt);
  305. difmtinit = 1;
  306. fmtrune(&difmt, Uformatted);
  307. }
  308. void
  309. flushdi(void)
  310. {
  311. int n;
  312. Rune *p;
  313. if(ndi == 0 || difmtinit == 0)
  314. return;
  315. fmtrune(&difmt, Uunformatted);
  316. p = runefmtstrflush(&difmt);
  317. memset(&difmt, 0, sizeof difmt);
  318. difmtinit = 0;
  319. if(p == nil)
  320. warn("out of memory in diversion %C%S", dot, di[ndi-1]);
  321. else{
  322. n = runestrlen(p);
  323. if(n > 0 && p[n-1] != '\n'){
  324. p = runerealloc(p, n+2);
  325. p[n] = '\n';
  326. p[n+1] = 0;
  327. }
  328. }
  329. as(di[ndi-1], p);
  330. free(p);
  331. }
  332. void
  333. outdi(Rune r)
  334. {
  335. if(!difmtinit) abort();
  336. if(r == Uempty)
  337. return;
  338. fmtrune(&difmt, r);
  339. }
  340. /* .di, .da */
  341. void
  342. r_di(int argc, Rune **argv)
  343. {
  344. br();
  345. if(argc > 2)
  346. warn("extra arguments to %C%S", dot, argv[0]);
  347. if(argc == 1){
  348. /* end diversion */
  349. if(ndi <= 0){
  350. // warn("unmatched %C%S", dot, argv[0]);
  351. return;
  352. }
  353. flushdi();
  354. if(--ndi == 0){
  355. _nr(L(".z"), nil);
  356. outcb = nil;
  357. }else{
  358. _nr(L(".z"), di[ndi-1]);
  359. runefmtstrinit(&difmt);
  360. fmtrune(&difmt, Uformatted);
  361. difmtinit = 1;
  362. }
  363. return;
  364. }
  365. /* start diversion */
  366. /* various register state should be saved, but it's all useless to us */
  367. flushdi();
  368. if(ndi >= nelem(di))
  369. sysfatal("%Cdi overflow", dot);
  370. if(argv[0][1] == 'i')
  371. ds(argv[1], nil);
  372. _nr(L(".z"), argv[1]);
  373. runestrcpy(di[ndi++], argv[1]);
  374. runefmtstrinit(&difmt);
  375. fmtrune(&difmt, Uformatted);
  376. difmtinit = 1;
  377. outcb = outdi;
  378. }
  379. /* .wh - install trap */
  380. /* .ch - change trap */
  381. /* .dt - install diversion trap */
  382. /* set input-line count trap */
  383. int itrapcount;
  384. int itrapwaiting;
  385. Rune *itrapname;
  386. void
  387. r_it(int argc, Rune **argv)
  388. {
  389. if(argc < 3){
  390. itrapcount = 0;
  391. return;
  392. }
  393. itrapcount = eval(argv[1]);
  394. free(itrapname);
  395. itrapname = erunestrdup(argv[2]);
  396. }
  397. void
  398. itrap(void)
  399. {
  400. itrapset();
  401. if(itrapwaiting){
  402. itrapwaiting = 0;
  403. runmacro1(itrapname);
  404. }
  405. }
  406. void
  407. itrapset(void)
  408. {
  409. if(itrapcount > 0 && --itrapcount == 0)
  410. itrapwaiting = 1;
  411. }
  412. /* .em - invoke macro when all input is over */
  413. void
  414. r_em(int argc, Rune **argv)
  415. {
  416. Rune buf[20];
  417. USED(argc);
  418. runesnprint(buf, nelem(buf), ".%S\n", argv[1]);
  419. as(L("eof"), buf);
  420. }
  421. int
  422. e_star(void)
  423. {
  424. Rune *p;
  425. p = getds(getname());
  426. if(p)
  427. pushinputstring(p);
  428. return 0;
  429. }
  430. int
  431. e_t(void)
  432. {
  433. if(inputmode&CopyMode)
  434. return '\t';
  435. return 0;
  436. }
  437. int
  438. e_a(void)
  439. {
  440. if(inputmode&CopyMode)
  441. return '\a';
  442. return 0;
  443. }
  444. int
  445. e_backslash(void)
  446. {
  447. if(inputmode&ArgMode)
  448. ungetrune('\\');
  449. return backslash;
  450. }
  451. int
  452. e_dot(void)
  453. {
  454. return '.';
  455. }
  456. int
  457. e_dollar(void)
  458. {
  459. int c;
  460. c = getnext();
  461. if(c < '1' || c > '9'){
  462. ungetnext(c);
  463. return 0;
  464. }
  465. c -= '0';
  466. if(nmstack <= 0 || mstack[nmstack-1].argc <= c)
  467. return 0;
  468. pushinputstring(mstack[nmstack-1].argv[c]);
  469. return 0;
  470. }
  471. void
  472. t7init(void)
  473. {
  474. addreq(L("de"), r_de, -1);
  475. addreq(L("am"), r_de, -1);
  476. addreq(L("ig"), r_de, -1);
  477. addraw(L("ds"), r_ds);
  478. addraw(L("as"), r_ds);
  479. addreq(L("rm"), r_rm, -1);
  480. addreq(L("rn"), r_rn, -1);
  481. addreq(L("di"), r_di, -1);
  482. addreq(L("da"), r_di, -1);
  483. addreq(L("it"), r_it, -1);
  484. addreq(L("em"), r_em, 1);
  485. addreq(L("wh"), r_wh, -1);
  486. addreq(L("ch"), r_ch, -1);
  487. addreq(L("dt"), r_dt, -1);
  488. addesc('$', e_dollar, CopyMode|ArgMode|HtmlMode);
  489. addesc('*', e_star, CopyMode|ArgMode|HtmlMode);
  490. addesc('t', e_t, CopyMode|ArgMode);
  491. addesc('a', e_a, CopyMode|ArgMode);
  492. addesc('\\', e_backslash, ArgMode|CopyMode);
  493. addesc('.', e_dot, CopyMode|ArgMode);
  494. ds(L("eof"), L(".sp 0.5i\n"));
  495. ds(L(".."), L(""));
  496. }