ed.c 22 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598
  1. /*
  2. * Editor
  3. */
  4. #include <u.h>
  5. #include <libc.h>
  6. #include <bio.h>
  7. #include <regexp.h>
  8. enum
  9. {
  10. FNSIZE = 128, /* file name */
  11. LBSIZE = 4096, /* max line size */
  12. BLKSIZE = 4096, /* block size in temp file */
  13. NBLK = 8191, /* max size of temp file */
  14. ESIZE = 256, /* max size of reg exp */
  15. GBSIZE = 256, /* max size of global command */
  16. MAXSUB = 9, /* max number of sub reg exp */
  17. ESCFLG = 0xFFFF, /* escape Rune - user defined code */
  18. EOF = -1,
  19. };
  20. void (*oldhup)(int);
  21. void (*oldquit)(int);
  22. int* addr1;
  23. int* addr2;
  24. int anymarks;
  25. int col;
  26. long count;
  27. int* dol;
  28. int* dot;
  29. int fchange;
  30. char file[FNSIZE];
  31. Rune genbuf[LBSIZE];
  32. int given;
  33. Rune* globp;
  34. int iblock;
  35. int ichanged;
  36. int io;
  37. Biobuf iobuf;
  38. int lastc;
  39. char line[70];
  40. Rune* linebp;
  41. Rune linebuf[LBSIZE];
  42. int listf;
  43. int listn;
  44. Rune* loc1;
  45. Rune* loc2;
  46. int names[26];
  47. int nleft;
  48. int oblock;
  49. int oflag;
  50. Reprog *pattern;
  51. int peekc;
  52. int pflag;
  53. int rescuing;
  54. Rune rhsbuf[LBSIZE/2];
  55. char savedfile[FNSIZE];
  56. jmp_buf savej;
  57. int subnewa;
  58. int subolda;
  59. Resub subexp[MAXSUB];
  60. char* tfname;
  61. int tline;
  62. int waiting;
  63. int wrapp;
  64. int* zero;
  65. char Q[] = "";
  66. char T[] = "TMP";
  67. char WRERR[] = "WRITE ERROR";
  68. int bpagesize = 20;
  69. char hex[] = "0123456789abcdef";
  70. char* linp = line;
  71. ulong nlall = 128;
  72. int tfile = -1;
  73. int vflag = 1;
  74. void add(int);
  75. int* address(void);
  76. int append(int(*)(void), int*);
  77. void browse(void);
  78. void callunix(void);
  79. void commands(void);
  80. void compile(int);
  81. int compsub(void);
  82. void dosub(void);
  83. void error(char*);
  84. int match(int*);
  85. void exfile(int);
  86. void filename(int);
  87. Rune* getblock(int, int);
  88. int getchr(void);
  89. int getcopy(void);
  90. int getfile(void);
  91. Rune* getline(int);
  92. int getnum(void);
  93. int getsub(void);
  94. int gettty(void);
  95. void global(int);
  96. void init(void);
  97. void join(void);
  98. void move(int);
  99. void newline(void);
  100. void nonzero(void);
  101. void notifyf(void*, char*);
  102. Rune* place(Rune*, Rune*, Rune*);
  103. void printcom(void);
  104. void putchr(int);
  105. void putd(void);
  106. void putfile(void);
  107. int putline(void);
  108. void putshst(Rune*);
  109. void putst(char*);
  110. void quit(void);
  111. void rdelete(int*, int*);
  112. void regerror(char *);
  113. void reverse(int*, int*);
  114. void setnoaddr(void);
  115. void setwide(void);
  116. void squeeze(int);
  117. void substitute(int);
  118. void
  119. main(int argc, char *argv[])
  120. {
  121. char *p1, *p2;
  122. notify(notifyf);
  123. ARGBEGIN {
  124. case 'o':
  125. oflag = 1;
  126. vflag = 0;
  127. break;
  128. } ARGEND
  129. USED(argc);
  130. if(*argv && (strcmp(*argv, "-") == 0)) {
  131. argv++;
  132. vflag = 0;
  133. }
  134. if(oflag) {
  135. p1 = "/fd/1";
  136. p2 = savedfile;
  137. while(*p2++ = *p1++)
  138. ;
  139. globp = L"a";
  140. } else
  141. if(*argv) {
  142. p1 = *argv;
  143. p2 = savedfile;
  144. while(*p2++ = *p1++)
  145. if(p2 >= &savedfile[sizeof(savedfile)])
  146. p2--;
  147. globp = L"r";
  148. }
  149. zero = malloc((nlall+5)*sizeof(int*));
  150. tfname = mktemp("/tmp/eXXXXX");
  151. init();
  152. setjmp(savej);
  153. commands();
  154. quit();
  155. }
  156. void
  157. commands(void)
  158. {
  159. int *a1, c, temp;
  160. char lastsep;
  161. Dir *d;
  162. for(;;) {
  163. if(pflag) {
  164. pflag = 0;
  165. addr1 = addr2 = dot;
  166. printcom();
  167. }
  168. c = '\n';
  169. for(addr1 = 0;;) {
  170. lastsep = c;
  171. a1 = address();
  172. c = getchr();
  173. if(c != ',' && c != ';')
  174. break;
  175. if(lastsep == ',')
  176. error(Q);
  177. if(a1 == 0) {
  178. a1 = zero+1;
  179. if(a1 > dol)
  180. a1--;
  181. }
  182. addr1 = a1;
  183. if(c == ';')
  184. dot = a1;
  185. }
  186. if(lastsep != '\n' && a1 == 0)
  187. a1 = dol;
  188. if((addr2=a1) == 0) {
  189. given = 0;
  190. addr2 = dot;
  191. } else
  192. given = 1;
  193. if(addr1 == 0)
  194. addr1 = addr2;
  195. switch(c) {
  196. case 'a':
  197. add(0);
  198. continue;
  199. case 'b':
  200. nonzero();
  201. browse();
  202. continue;
  203. case 'c':
  204. nonzero();
  205. newline();
  206. rdelete(addr1, addr2);
  207. append(gettty, addr1-1);
  208. continue;
  209. case 'd':
  210. nonzero();
  211. newline();
  212. rdelete(addr1, addr2);
  213. continue;
  214. case 'E':
  215. fchange = 0;
  216. c = 'e';
  217. case 'e':
  218. setnoaddr();
  219. if(vflag && fchange) {
  220. fchange = 0;
  221. error(Q);
  222. }
  223. filename(c);
  224. init();
  225. addr2 = zero;
  226. goto caseread;
  227. case 'f':
  228. setnoaddr();
  229. filename(c);
  230. putst(savedfile);
  231. continue;
  232. case 'g':
  233. global(1);
  234. continue;
  235. case 'i':
  236. add(-1);
  237. continue;
  238. case 'j':
  239. if(!given)
  240. addr2++;
  241. newline();
  242. join();
  243. continue;
  244. case 'k':
  245. nonzero();
  246. c = getchr();
  247. if(c < 'a' || c > 'z')
  248. error(Q);
  249. newline();
  250. names[c-'a'] = *addr2 & ~01;
  251. anymarks |= 01;
  252. continue;
  253. case 'm':
  254. move(0);
  255. continue;
  256. case 'n':
  257. listn++;
  258. newline();
  259. printcom();
  260. continue;
  261. case '\n':
  262. if(a1==0) {
  263. a1 = dot+1;
  264. addr2 = a1;
  265. addr1 = a1;
  266. }
  267. if(lastsep==';')
  268. addr1 = a1;
  269. printcom();
  270. continue;
  271. case 'l':
  272. listf++;
  273. case 'p':
  274. case 'P':
  275. newline();
  276. printcom();
  277. continue;
  278. case 'Q':
  279. fchange = 0;
  280. case 'q':
  281. setnoaddr();
  282. newline();
  283. quit();
  284. case 'r':
  285. filename(c);
  286. caseread:
  287. if((io=open(file, OREAD)) < 0) {
  288. lastc = '\n';
  289. error(file);
  290. }
  291. if((d = dirfstat(io)) != nil){
  292. if(d->mode & DMAPPEND)
  293. print("warning: %s is append only\n", file);
  294. free(d);
  295. }
  296. Binit(&iobuf, io, OREAD);
  297. setwide();
  298. squeeze(0);
  299. c = zero != dol;
  300. append(getfile, addr2);
  301. exfile(OREAD);
  302. fchange = c;
  303. continue;
  304. case 's':
  305. nonzero();
  306. substitute(globp != 0);
  307. continue;
  308. case 't':
  309. move(1);
  310. continue;
  311. case 'u':
  312. nonzero();
  313. newline();
  314. if((*addr2&~01) != subnewa)
  315. error(Q);
  316. *addr2 = subolda;
  317. dot = addr2;
  318. continue;
  319. case 'v':
  320. global(0);
  321. continue;
  322. case 'W':
  323. wrapp++;
  324. case 'w':
  325. setwide();
  326. squeeze(dol>zero);
  327. temp = getchr();
  328. if(temp != 'q' && temp != 'Q') {
  329. peekc = temp;
  330. temp = 0;
  331. }
  332. filename(c);
  333. if(!wrapp ||
  334. ((io = open(file, OWRITE)) == -1) ||
  335. ((seek(io, 0L, 2)) == -1))
  336. if((io = create(file, OWRITE, 0666)) < 0)
  337. error(file);
  338. Binit(&iobuf, io, OWRITE);
  339. wrapp = 0;
  340. if(dol > zero)
  341. putfile();
  342. exfile(OWRITE);
  343. if(addr1<=zero+1 && addr2==dol)
  344. fchange = 0;
  345. if(temp == 'Q')
  346. fchange = 0;
  347. if(temp)
  348. quit();
  349. continue;
  350. case '=':
  351. setwide();
  352. squeeze(0);
  353. newline();
  354. count = addr2 - zero;
  355. putd();
  356. putchr(L'\n');
  357. continue;
  358. case '!':
  359. callunix();
  360. continue;
  361. case EOF:
  362. return;
  363. }
  364. error(Q);
  365. }
  366. }
  367. void
  368. printcom(void)
  369. {
  370. int *a1;
  371. nonzero();
  372. a1 = addr1;
  373. do {
  374. if(listn) {
  375. count = a1-zero;
  376. putd();
  377. putchr(L'\t');
  378. }
  379. putshst(getline(*a1++));
  380. } while(a1 <= addr2);
  381. dot = addr2;
  382. listf = 0;
  383. listn = 0;
  384. pflag = 0;
  385. }
  386. int*
  387. address(void)
  388. {
  389. int sign, *a, opcnt, nextopand, *b, c;
  390. nextopand = -1;
  391. sign = 1;
  392. opcnt = 0;
  393. a = dot;
  394. do {
  395. do {
  396. c = getchr();
  397. } while(c == ' ' || c == '\t');
  398. if(c >= '0' && c <= '9') {
  399. peekc = c;
  400. if(!opcnt)
  401. a = zero;
  402. a += sign*getnum();
  403. } else
  404. switch(c) {
  405. case '$':
  406. a = dol;
  407. case '.':
  408. if(opcnt)
  409. error(Q);
  410. break;
  411. case '\'':
  412. c = getchr();
  413. if(opcnt || c < 'a' || c > 'z')
  414. error(Q);
  415. a = zero;
  416. do {
  417. a++;
  418. } while(a <= dol && names[c-'a'] != (*a & ~01));
  419. break;
  420. case '?':
  421. sign = -sign;
  422. case '/':
  423. compile(c);
  424. b = a;
  425. for(;;) {
  426. a += sign;
  427. if(a <= zero)
  428. a = dol;
  429. if(a > dol)
  430. a = zero;
  431. if(match(a))
  432. break;
  433. if(a == b)
  434. error(Q);
  435. }
  436. break;
  437. default:
  438. if(nextopand == opcnt) {
  439. a += sign;
  440. if(a < zero || dol < a)
  441. continue; /* error(Q); */
  442. }
  443. if(c != '+' && c != '-' && c != '^') {
  444. peekc = c;
  445. if(opcnt == 0)
  446. a = 0;
  447. return a;
  448. }
  449. sign = 1;
  450. if(c != '+')
  451. sign = -sign;
  452. nextopand = ++opcnt;
  453. continue;
  454. }
  455. sign = 1;
  456. opcnt++;
  457. } while(zero <= a && a <= dol);
  458. error(Q);
  459. return 0;
  460. }
  461. int
  462. getnum(void)
  463. {
  464. int r, c;
  465. r = 0;
  466. for(;;) {
  467. c = getchr();
  468. if(c < '0' || c > '9')
  469. break;
  470. r = r*10 + (c-'0');
  471. }
  472. peekc = c;
  473. return r;
  474. }
  475. void
  476. setwide(void)
  477. {
  478. if(!given) {
  479. addr1 = zero + (dol>zero);
  480. addr2 = dol;
  481. }
  482. }
  483. void
  484. setnoaddr(void)
  485. {
  486. if(given)
  487. error(Q);
  488. }
  489. void
  490. nonzero(void)
  491. {
  492. squeeze(1);
  493. }
  494. void
  495. squeeze(int i)
  496. {
  497. if(addr1 < zero+i || addr2 > dol || addr1 > addr2)
  498. error(Q);
  499. }
  500. void
  501. newline(void)
  502. {
  503. int c;
  504. c = getchr();
  505. if(c == '\n' || c == EOF)
  506. return;
  507. if(c == 'p' || c == 'l' || c == 'n') {
  508. pflag++;
  509. if(c == 'l')
  510. listf++;
  511. else
  512. if(c == 'n')
  513. listn++;
  514. c = getchr();
  515. if(c == '\n')
  516. return;
  517. }
  518. error(Q);
  519. }
  520. void
  521. filename(int comm)
  522. {
  523. char *p1, *p2;
  524. Rune rune;
  525. int c;
  526. count = 0;
  527. c = getchr();
  528. if(c == '\n' || c == EOF) {
  529. p1 = savedfile;
  530. if(*p1 == 0 && comm != 'f')
  531. error(Q);
  532. p2 = file;
  533. while(*p2++ = *p1++)
  534. ;
  535. return;
  536. }
  537. if(c != ' ')
  538. error(Q);
  539. while((c=getchr()) == ' ')
  540. ;
  541. if(c == '\n')
  542. error(Q);
  543. p1 = file;
  544. do {
  545. if(p1 >= &file[sizeof(file)-6] || c == ' ' || c == EOF)
  546. error(Q);
  547. rune = c;
  548. p1 += runetochar(p1, &rune);
  549. } while((c=getchr()) != '\n');
  550. *p1 = 0;
  551. if(savedfile[0] == 0 || comm == 'e' || comm == 'f') {
  552. p1 = savedfile;
  553. p2 = file;
  554. while(*p1++ = *p2++)
  555. ;
  556. }
  557. }
  558. void
  559. exfile(int om)
  560. {
  561. if(om == OWRITE)
  562. if(Bflush(&iobuf) < 0)
  563. error(Q);
  564. close(io);
  565. io = -1;
  566. if(vflag) {
  567. putd();
  568. putchr(L'\n');
  569. }
  570. }
  571. void
  572. error1(char *s)
  573. {
  574. int c;
  575. wrapp = 0;
  576. listf = 0;
  577. listn = 0;
  578. count = 0;
  579. seek(0, 0, 2);
  580. pflag = 0;
  581. if(globp)
  582. lastc = '\n';
  583. globp = 0;
  584. peekc = lastc;
  585. if(lastc)
  586. for(;;) {
  587. c = getchr();
  588. if(c == '\n' || c == EOF)
  589. break;
  590. }
  591. if(io > 0) {
  592. close(io);
  593. io = -1;
  594. }
  595. putchr(L'?');
  596. putst(s);
  597. }
  598. void
  599. error(char *s)
  600. {
  601. error1(s);
  602. longjmp(savej, 1);
  603. }
  604. void
  605. rescue(void)
  606. {
  607. rescuing = 1;
  608. if(dol > zero) {
  609. addr1 = zero+1;
  610. addr2 = dol;
  611. io = create("ed.hup", OWRITE, 0666);
  612. if(io > 0){
  613. Binit(&iobuf, io, OWRITE);
  614. putfile();
  615. }
  616. }
  617. fchange = 0;
  618. quit();
  619. }
  620. void
  621. notifyf(void *a, char *s)
  622. {
  623. if(strcmp(s, "interrupt") == 0){
  624. if(rescuing || waiting)
  625. noted(NCONT);
  626. putchr(L'\n');
  627. lastc = '\n';
  628. error1(Q);
  629. notejmp(a, savej, 0);
  630. }
  631. if(strcmp(s, "hangup") == 0){
  632. if(rescuing)
  633. noted(NDFLT);
  634. rescue();
  635. }
  636. fprint(2, "ed: note: %s\n", s);
  637. abort();
  638. }
  639. int
  640. getchr(void)
  641. {
  642. char s[UTFmax];
  643. int i;
  644. Rune r;
  645. if(lastc = peekc) {
  646. peekc = 0;
  647. return lastc;
  648. }
  649. if(globp) {
  650. if((lastc=*globp++) != 0)
  651. return lastc;
  652. globp = 0;
  653. return EOF;
  654. }
  655. for(i=0;;) {
  656. if(read(0, s+i, 1) <= 0)
  657. return lastc = EOF;
  658. i++;
  659. if(fullrune(s, i))
  660. break;
  661. }
  662. chartorune(&r, s);
  663. lastc = r;
  664. return lastc;
  665. }
  666. int
  667. gety(void)
  668. {
  669. int c;
  670. Rune *gf, *p;
  671. p = linebuf;
  672. gf = globp;
  673. for(;;) {
  674. c = getchr();
  675. if(c == '\n') {
  676. *p = 0;
  677. return 0;
  678. }
  679. if(c == EOF) {
  680. if(gf)
  681. peekc = c;
  682. return c;
  683. }
  684. if(c == 0)
  685. continue;
  686. *p++ = c;
  687. if(p >= &linebuf[LBSIZE-2])
  688. error(Q);
  689. }
  690. return 0;
  691. }
  692. int
  693. gettty(void)
  694. {
  695. int rc;
  696. rc = gety();
  697. if(rc)
  698. return rc;
  699. if(linebuf[0] == '.' && linebuf[1] == 0)
  700. return EOF;
  701. return 0;
  702. }
  703. int
  704. getfile(void)
  705. {
  706. int c;
  707. Rune *lp;
  708. lp = linebuf;
  709. do {
  710. c = Bgetrune(&iobuf);
  711. if(c < 0) {
  712. if(lp > linebuf) {
  713. putst("'\\n' appended");
  714. c = '\n';
  715. } else
  716. return EOF;
  717. }
  718. if(lp >= &linebuf[LBSIZE]) {
  719. lastc = '\n';
  720. error(Q);
  721. }
  722. *lp++ = c;
  723. count++;
  724. } while(c != '\n');
  725. lp[-1] = 0;
  726. return 0;
  727. }
  728. void
  729. putfile(void)
  730. {
  731. int *a1;
  732. Rune *lp;
  733. long c;
  734. a1 = addr1;
  735. do {
  736. lp = getline(*a1++);
  737. for(;;) {
  738. count++;
  739. c = *lp++;
  740. if(c == 0) {
  741. if(Bputrune(&iobuf, '\n') < 0)
  742. error(Q);
  743. break;
  744. }
  745. if(Bputrune(&iobuf, c) < 0)
  746. error(Q);
  747. }
  748. } while(a1 <= addr2);
  749. if(Bflush(&iobuf) < 0)
  750. error(Q);
  751. }
  752. int
  753. append(int (*f)(void), int *a)
  754. {
  755. int *a1, *a2, *rdot, nline, tl;
  756. nline = 0;
  757. dot = a;
  758. while((*f)() == 0) {
  759. if((dol-zero) >= nlall) {
  760. nlall += 512;
  761. a1 = realloc(zero, (nlall+5)*sizeof(int*));
  762. if(a1 == 0) {
  763. error("MEM?");
  764. rescue();
  765. }
  766. tl = a1 - zero; /* relocate pointers */
  767. zero += tl;
  768. addr1 += tl;
  769. addr2 += tl;
  770. dol += tl;
  771. dot += tl;
  772. }
  773. tl = putline();
  774. nline++;
  775. a1 = ++dol;
  776. a2 = a1+1;
  777. rdot = ++dot;
  778. while(a1 > rdot)
  779. *--a2 = *--a1;
  780. *rdot = tl;
  781. }
  782. return nline;
  783. }
  784. void
  785. add(int i)
  786. {
  787. if(i && (given || dol > zero)) {
  788. addr1--;
  789. addr2--;
  790. }
  791. squeeze(0);
  792. newline();
  793. append(gettty, addr2);
  794. }
  795. void
  796. browse(void)
  797. {
  798. int forward, n;
  799. static bformat, bnum; /* 0 */
  800. forward = 1;
  801. peekc = getchr();
  802. if(peekc != '\n'){
  803. if(peekc == '-' || peekc == '+') {
  804. if(peekc == '-')
  805. forward = 0;
  806. getchr();
  807. }
  808. n = getnum();
  809. if(n > 0)
  810. bpagesize = n;
  811. }
  812. newline();
  813. if(pflag) {
  814. bformat = listf;
  815. bnum = listn;
  816. } else {
  817. listf = bformat;
  818. listn = bnum;
  819. }
  820. if(forward) {
  821. addr1 = addr2;
  822. addr2 += bpagesize;
  823. if(addr2 > dol)
  824. addr2 = dol;
  825. } else {
  826. addr1 = addr2-bpagesize;
  827. if(addr1 <= zero)
  828. addr1 = zero+1;
  829. }
  830. printcom();
  831. }
  832. void
  833. callunix(void)
  834. {
  835. int c, pid;
  836. Rune rune;
  837. char buf[512];
  838. char *p;
  839. setnoaddr();
  840. p = buf;
  841. while((c=getchr()) != EOF && c != '\n')
  842. if(p < &buf[sizeof(buf) - 6]) {
  843. rune = c;
  844. p += runetochar(p, &rune);
  845. }
  846. *p = 0;
  847. pid = fork();
  848. if(pid == 0) {
  849. execl("/bin/rc", "rc", "-c", buf, 0);
  850. exits("execl failed");
  851. }
  852. waiting = 1;
  853. while(waitpid() != pid)
  854. ;
  855. waiting = 0;
  856. if(vflag)
  857. putst("!");
  858. }
  859. void
  860. quit(void)
  861. {
  862. if(vflag && fchange && dol!=zero) {
  863. fchange = 0;
  864. error(Q);
  865. }
  866. remove(tfname);
  867. exits(0);
  868. }
  869. void
  870. onquit(int sig)
  871. {
  872. USED(sig);
  873. quit();
  874. }
  875. void
  876. rdelete(int *ad1, int *ad2)
  877. {
  878. int *a1, *a2, *a3;
  879. a1 = ad1;
  880. a2 = ad2+1;
  881. a3 = dol;
  882. dol -= a2 - a1;
  883. do {
  884. *a1++ = *a2++;
  885. } while(a2 <= a3);
  886. a1 = ad1;
  887. if(a1 > dol)
  888. a1 = dol;
  889. dot = a1;
  890. fchange = 1;
  891. }
  892. void
  893. gdelete(void)
  894. {
  895. int *a1, *a2, *a3;
  896. a3 = dol;
  897. for(a1=zero; (*a1&01)==0; a1++)
  898. if(a1>=a3)
  899. return;
  900. for(a2=a1+1; a2<=a3;) {
  901. if(*a2 & 01) {
  902. a2++;
  903. dot = a1;
  904. } else
  905. *a1++ = *a2++;
  906. }
  907. dol = a1-1;
  908. if(dot > dol)
  909. dot = dol;
  910. fchange = 1;
  911. }
  912. Rune*
  913. getline(int tl)
  914. {
  915. Rune *lp, *bp;
  916. int nl;
  917. lp = linebuf;
  918. bp = getblock(tl, OREAD);
  919. nl = nleft;
  920. tl &= ~((BLKSIZE/2) - 1);
  921. while(*lp++ = *bp++) {
  922. nl -= sizeof(Rune);
  923. if(nl == 0) {
  924. bp = getblock(tl += BLKSIZE/2, OREAD);
  925. nl = nleft;
  926. }
  927. }
  928. return linebuf;
  929. }
  930. int
  931. putline(void)
  932. {
  933. Rune *lp, *bp;
  934. int nl, tl;
  935. fchange = 1;
  936. lp = linebuf;
  937. tl = tline;
  938. bp = getblock(tl, OWRITE);
  939. nl = nleft;
  940. tl &= ~((BLKSIZE/2)-1);
  941. while(*bp = *lp++) {
  942. if(*bp++ == '\n') {
  943. bp[-1] = 0;
  944. linebp = lp;
  945. break;
  946. }
  947. nl -= sizeof(Rune);
  948. if(nl == 0) {
  949. tl += BLKSIZE/2;
  950. bp = getblock(tl, OWRITE);
  951. nl = nleft;
  952. }
  953. }
  954. nl = tline;
  955. tline += ((lp-linebuf) + 03) & 077776;
  956. return nl;
  957. }
  958. void
  959. blkio(int b, uchar *buf, long (*iofcn)(int, void *, long))
  960. {
  961. seek(tfile, b*BLKSIZE, 0);
  962. if((*iofcn)(tfile, buf, BLKSIZE) != BLKSIZE) {
  963. error(T);
  964. }
  965. }
  966. Rune*
  967. getblock(int atl, int iof)
  968. {
  969. int bno, off;
  970. static uchar ibuff[BLKSIZE];
  971. static uchar obuff[BLKSIZE];
  972. bno = atl / (BLKSIZE/2);
  973. off = (atl<<1) & (BLKSIZE-1) & ~03;
  974. if(bno >= NBLK) {
  975. lastc = '\n';
  976. error(T);
  977. }
  978. nleft = BLKSIZE - off;
  979. if(bno == iblock) {
  980. ichanged |= iof;
  981. return (Rune*)(ibuff+off);
  982. }
  983. if(bno == oblock)
  984. return (Rune*)(obuff+off);
  985. if(iof == OREAD) {
  986. if(ichanged)
  987. blkio(iblock, ibuff, write);
  988. ichanged = 0;
  989. iblock = bno;
  990. blkio(bno, ibuff, read);
  991. return (Rune*)(ibuff+off);
  992. }
  993. if(oblock >= 0)
  994. blkio(oblock, obuff, write);
  995. oblock = bno;
  996. return (Rune*)(obuff+off);
  997. }
  998. void
  999. init(void)
  1000. {
  1001. int *markp;
  1002. close(tfile);
  1003. tline = 2;
  1004. for(markp = names; markp < &names[26]; )
  1005. *markp++ = 0;
  1006. subnewa = 0;
  1007. anymarks = 0;
  1008. iblock = -1;
  1009. oblock = -1;
  1010. ichanged = 0;
  1011. if((tfile = create(tfname, ORDWR, 0600)) < 0){
  1012. error1(T);
  1013. exits(0);
  1014. }
  1015. dot = dol = zero;
  1016. }
  1017. void
  1018. global(int k)
  1019. {
  1020. Rune *gp, globuf[GBSIZE];
  1021. int c, *a1;
  1022. if(globp)
  1023. error(Q);
  1024. setwide();
  1025. squeeze(dol > zero);
  1026. c = getchr();
  1027. if(c == '\n')
  1028. error(Q);
  1029. compile(c);
  1030. gp = globuf;
  1031. while((c=getchr()) != '\n') {
  1032. if(c == EOF)
  1033. error(Q);
  1034. if(c == '\\') {
  1035. c = getchr();
  1036. if(c != '\n')
  1037. *gp++ = '\\';
  1038. }
  1039. *gp++ = c;
  1040. if(gp >= &globuf[GBSIZE-2])
  1041. error(Q);
  1042. }
  1043. if(gp == globuf)
  1044. *gp++ = 'p';
  1045. *gp++ = '\n';
  1046. *gp = 0;
  1047. for(a1=zero; a1<=dol; a1++) {
  1048. *a1 &= ~01;
  1049. if(a1 >= addr1 && a1 <= addr2 && match(a1) == k)
  1050. *a1 |= 01;
  1051. }
  1052. /*
  1053. * Special case: g/.../d (avoid n^2 algorithm)
  1054. */
  1055. if(globuf[0] == 'd' && globuf[1] == '\n' && globuf[2] == 0) {
  1056. gdelete();
  1057. return;
  1058. }
  1059. for(a1=zero; a1<=dol; a1++) {
  1060. if(*a1 & 01) {
  1061. *a1 &= ~01;
  1062. dot = a1;
  1063. globp = globuf;
  1064. commands();
  1065. a1 = zero;
  1066. }
  1067. }
  1068. }
  1069. void
  1070. join(void)
  1071. {
  1072. Rune *gp, *lp;
  1073. int *a1;
  1074. nonzero();
  1075. gp = genbuf;
  1076. for(a1=addr1; a1<=addr2; a1++) {
  1077. lp = getline(*a1);
  1078. while(*gp = *lp++)
  1079. if(gp++ >= &genbuf[LBSIZE-2])
  1080. error(Q);
  1081. }
  1082. lp = linebuf;
  1083. gp = genbuf;
  1084. while(*lp++ = *gp++)
  1085. ;
  1086. *addr1 = putline();
  1087. if(addr1 < addr2)
  1088. rdelete(addr1+1, addr2);
  1089. dot = addr1;
  1090. }
  1091. void
  1092. substitute(int inglob)
  1093. {
  1094. int *mp, *a1, nl, gsubf, n;
  1095. n = getnum(); /* OK even if n==0 */
  1096. gsubf = compsub();
  1097. for(a1 = addr1; a1 <= addr2; a1++) {
  1098. if(match(a1)){
  1099. int *ozero;
  1100. int m = n;
  1101. do {
  1102. int span = loc2-loc1;
  1103. if(--m <= 0) {
  1104. dosub();
  1105. if(!gsubf)
  1106. break;
  1107. if(span == 0) { /* null RE match */
  1108. if(*loc2 == 0)
  1109. break;
  1110. loc2++;
  1111. }
  1112. }
  1113. } while(match(0));
  1114. if(m <= 0) {
  1115. inglob |= 01;
  1116. subnewa = putline();
  1117. *a1 &= ~01;
  1118. if(anymarks) {
  1119. for(mp=names; mp<&names[26]; mp++)
  1120. if(*mp == *a1)
  1121. *mp = subnewa;
  1122. }
  1123. subolda = *a1;
  1124. *a1 = subnewa;
  1125. ozero = zero;
  1126. nl = append(getsub, a1);
  1127. addr2 += nl;
  1128. nl += zero-ozero;
  1129. a1 += nl;
  1130. }
  1131. }
  1132. }
  1133. if(inglob == 0)
  1134. error(Q);
  1135. }
  1136. int
  1137. compsub(void)
  1138. {
  1139. int seof, c;
  1140. Rune *p;
  1141. seof = getchr();
  1142. if(seof == '\n' || seof == ' ')
  1143. error(Q);
  1144. compile(seof);
  1145. p = rhsbuf;
  1146. for(;;) {
  1147. c = getchr();
  1148. if(c == '\\') {
  1149. c = getchr();
  1150. *p++ = ESCFLG;
  1151. if(p >= &rhsbuf[LBSIZE/2])
  1152. error(Q);
  1153. } else
  1154. if(c == '\n' && (!globp || !globp[0])) {
  1155. peekc = c;
  1156. pflag++;
  1157. break;
  1158. } else
  1159. if(c == seof)
  1160. break;
  1161. *p++ = c;
  1162. if(p >= &rhsbuf[LBSIZE/2])
  1163. error(Q);
  1164. }
  1165. *p = 0;
  1166. peekc = getchr();
  1167. if(peekc == 'g') {
  1168. peekc = 0;
  1169. newline();
  1170. return 1;
  1171. }
  1172. newline();
  1173. return 0;
  1174. }
  1175. int
  1176. getsub(void)
  1177. {
  1178. Rune *p1, *p2;
  1179. p1 = linebuf;
  1180. if((p2 = linebp) == 0)
  1181. return EOF;
  1182. while(*p1++ = *p2++)
  1183. ;
  1184. linebp = 0;
  1185. return 0;
  1186. }
  1187. void
  1188. dosub(void)
  1189. {
  1190. Rune *lp, *sp, *rp;
  1191. int c, n;
  1192. lp = linebuf;
  1193. sp = genbuf;
  1194. rp = rhsbuf;
  1195. while(lp < loc1)
  1196. *sp++ = *lp++;
  1197. while(c = *rp++) {
  1198. if(c == '&'){
  1199. sp = place(sp, loc1, loc2);
  1200. continue;
  1201. }
  1202. if(c == ESCFLG && (c = *rp++) >= '1' && c < MAXSUB+'0') {
  1203. n = c-'0';
  1204. if(subexp[n].rsp && subexp[n].rep) {
  1205. sp = place(sp, subexp[n].rsp, subexp[n].rep);
  1206. continue;
  1207. }
  1208. error(Q);
  1209. }
  1210. *sp++ = c;
  1211. if(sp >= &genbuf[LBSIZE])
  1212. error(Q);
  1213. }
  1214. lp = loc2;
  1215. loc2 = sp - genbuf + linebuf;
  1216. while(*sp++ = *lp++)
  1217. if(sp >= &genbuf[LBSIZE])
  1218. error(Q);
  1219. lp = linebuf;
  1220. sp = genbuf;
  1221. while(*lp++ = *sp++)
  1222. ;
  1223. }
  1224. Rune*
  1225. place(Rune *sp, Rune *l1, Rune *l2)
  1226. {
  1227. while(l1 < l2) {
  1228. *sp++ = *l1++;
  1229. if(sp >= &genbuf[LBSIZE])
  1230. error(Q);
  1231. }
  1232. return sp;
  1233. }
  1234. void
  1235. move(int cflag)
  1236. {
  1237. int *adt, *ad1, *ad2;
  1238. nonzero();
  1239. if((adt = address())==0) /* address() guarantees addr is in range */
  1240. error(Q);
  1241. newline();
  1242. if(cflag) {
  1243. int *ozero, delta;
  1244. ad1 = dol;
  1245. ozero = zero;
  1246. append(getcopy, ad1++);
  1247. ad2 = dol;
  1248. delta = zero - ozero;
  1249. ad1 += delta;
  1250. adt += delta;
  1251. } else {
  1252. ad2 = addr2;
  1253. for(ad1 = addr1; ad1 <= ad2;)
  1254. *ad1++ &= ~01;
  1255. ad1 = addr1;
  1256. }
  1257. ad2++;
  1258. if(adt<ad1) {
  1259. dot = adt + (ad2-ad1);
  1260. if((++adt)==ad1)
  1261. return;
  1262. reverse(adt, ad1);
  1263. reverse(ad1, ad2);
  1264. reverse(adt, ad2);
  1265. } else
  1266. if(adt >= ad2) {
  1267. dot = adt++;
  1268. reverse(ad1, ad2);
  1269. reverse(ad2, adt);
  1270. reverse(ad1, adt);
  1271. } else
  1272. error(Q);
  1273. fchange = 1;
  1274. }
  1275. void
  1276. reverse(int *a1, int *a2)
  1277. {
  1278. int t;
  1279. for(;;) {
  1280. t = *--a2;
  1281. if(a2 <= a1)
  1282. return;
  1283. *a2 = *a1;
  1284. *a1++ = t;
  1285. }
  1286. }
  1287. int
  1288. getcopy(void)
  1289. {
  1290. if(addr1 > addr2)
  1291. return EOF;
  1292. getline(*addr1++);
  1293. return 0;
  1294. }
  1295. void
  1296. compile(int eof)
  1297. {
  1298. Rune c;
  1299. char *ep;
  1300. char expbuf[ESIZE];
  1301. if((c = getchr()) == '\n') {
  1302. peekc = c;
  1303. c = eof;
  1304. }
  1305. if(c == eof) {
  1306. if(!pattern)
  1307. error(Q);
  1308. return;
  1309. }
  1310. if(pattern) {
  1311. free(pattern);
  1312. pattern = 0;
  1313. }
  1314. ep = expbuf;
  1315. do {
  1316. if(c == '\\') {
  1317. if(ep >= expbuf+sizeof(expbuf)) {
  1318. error(Q);
  1319. return;
  1320. }
  1321. ep += runetochar(ep, &c);
  1322. if((c = getchr()) == '\n') {
  1323. error(Q);
  1324. return;
  1325. }
  1326. }
  1327. if(ep >= expbuf+sizeof(expbuf)) {
  1328. error(Q);
  1329. return;
  1330. }
  1331. ep += runetochar(ep, &c);
  1332. } while((c = getchr()) != eof && c != '\n');
  1333. if(c == '\n')
  1334. peekc = c;
  1335. *ep = 0;
  1336. pattern = regcomp(expbuf);
  1337. }
  1338. int
  1339. match(int *addr)
  1340. {
  1341. if(!pattern)
  1342. return 0;
  1343. if(addr){
  1344. if(addr == zero)
  1345. return 0;
  1346. subexp[0].rsp = getline(*addr);
  1347. } else
  1348. subexp[0].rsp = loc2;
  1349. subexp[0].rep = 0;
  1350. if(rregexec(pattern, linebuf, subexp, MAXSUB)) {
  1351. loc1 = subexp[0].rsp;
  1352. loc2 = subexp[0].rep;
  1353. return 1;
  1354. }
  1355. loc1 = loc2 = 0;
  1356. return 0;
  1357. }
  1358. void
  1359. putd(void)
  1360. {
  1361. int r;
  1362. r = count%10;
  1363. count /= 10;
  1364. if(count)
  1365. putd();
  1366. putchr(r + L'0');
  1367. }
  1368. void
  1369. putst(char *sp)
  1370. {
  1371. Rune r;
  1372. col = 0;
  1373. for(;;) {
  1374. sp += chartorune(&r, sp);
  1375. if(r == 0)
  1376. break;
  1377. putchr(r);
  1378. }
  1379. putchr(L'\n');
  1380. }
  1381. void
  1382. putshst(Rune *sp)
  1383. {
  1384. col = 0;
  1385. while(*sp)
  1386. putchr(*sp++);
  1387. putchr(L'\n');
  1388. }
  1389. void
  1390. putchr(int ac)
  1391. {
  1392. char *lp;
  1393. int c;
  1394. Rune rune;
  1395. lp = linp;
  1396. c = ac;
  1397. if(listf) {
  1398. if(c == '\n') {
  1399. if(linp != line && linp[-1] == ' ') {
  1400. *lp++ = '\\';
  1401. *lp++ = 'n';
  1402. }
  1403. } else {
  1404. if(col > (72-6-2)) {
  1405. col = 8;
  1406. *lp++ = '\\';
  1407. *lp++ = '\n';
  1408. *lp++ = '\t';
  1409. }
  1410. col++;
  1411. if(c=='\b' || c=='\t' || c=='\\') {
  1412. *lp++ = '\\';
  1413. if(c == '\b')
  1414. c = 'b';
  1415. else
  1416. if(c == '\t')
  1417. c = 't';
  1418. col++;
  1419. } else
  1420. if(c<' ' || c>='\177') {
  1421. *lp++ = '\\';
  1422. *lp++ = 'x';
  1423. *lp++ = hex[c>>12];
  1424. *lp++ = hex[c>>8&0xF];
  1425. *lp++ = hex[c>>4&0xF];
  1426. c = hex[c&0xF];
  1427. col += 5;
  1428. }
  1429. }
  1430. }
  1431. rune = c;
  1432. lp += runetochar(lp, &rune);
  1433. if(c == '\n' || lp >= &line[sizeof(line)-5]) {
  1434. linp = line;
  1435. write(oflag? 2: 1, line, lp-line);
  1436. return;
  1437. }
  1438. linp = lp;
  1439. }
  1440. char*
  1441. mktemp(char *as)
  1442. {
  1443. char *s;
  1444. unsigned pid;
  1445. int i;
  1446. pid = getpid();
  1447. s = as;
  1448. while(*s++)
  1449. ;
  1450. s--;
  1451. while(*--s == 'X') {
  1452. *s = pid % 10 + '0';
  1453. pid /= 10;
  1454. }
  1455. s++;
  1456. i = 'a';
  1457. while(access(as, 0) != -1) {
  1458. if(i == 'z')
  1459. return "/";
  1460. *s = i++;
  1461. }
  1462. return as;
  1463. }
  1464. void
  1465. regerror(char *s)
  1466. {
  1467. USED(s);
  1468. error(Q);
  1469. }