elog.c 5.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312
  1. #include <u.h>
  2. #include <libc.h>
  3. #include <draw.h>
  4. #include <thread.h>
  5. #include <cursor.h>
  6. #include <mouse.h>
  7. #include <keyboard.h>
  8. #include <frame.h>
  9. #include <fcall.h>
  10. #include <plumb.h>
  11. #include "dat.h"
  12. #include "fns.h"
  13. #include "edit.h"
  14. static char Wsequence[] = "warning: changes out of sequence\n";
  15. static int warned = FALSE;
  16. /*
  17. * Log of changes made by editing commands. Three reasons for this:
  18. * 1) We want addresses in commands to apply to old file, not file-in-change.
  19. * 2) It's difficult to track changes correctly as things move, e.g. ,x m$
  20. * 3) This gives an opportunity to optimize by merging adjacent changes.
  21. * It's a little bit like the Undo/Redo log in Files, but Point 3) argues for a
  22. * separate implementation. To do this well, we use Replace as well as
  23. * Insert and Delete
  24. */
  25. typedef struct Buflog Buflog;
  26. struct Buflog
  27. {
  28. short type; /* Replace, Filename */
  29. uint q0; /* location of change (unused in f) */
  30. uint nd; /* # runes to delete */
  31. uint nr; /* # runes in string or file name */
  32. };
  33. enum
  34. {
  35. Buflogsize = sizeof(Buflog)/sizeof(Rune),
  36. };
  37. /*
  38. * Minstring shouldn't be very big or we will do lots of I/O for small changes.
  39. * Maxstring is RBUFSIZE so we can fbufalloc() once and not realloc elog.r.
  40. */
  41. enum
  42. {
  43. Minstring = 16, /* distance beneath which we merge changes */
  44. Maxstring = RBUFSIZE, /* maximum length of change we will merge into one */
  45. };
  46. void
  47. eloginit(File *f)
  48. {
  49. if(f->elog.type != Empty)
  50. return;
  51. f->elog.type = Null;
  52. if(f->elogbuf == nil)
  53. f->elogbuf = emalloc(sizeof(Buffer));
  54. if(f->elog.r == nil)
  55. f->elog.r = fbufalloc();
  56. bufreset(f->elogbuf);
  57. }
  58. void
  59. elogclose(File *f)
  60. {
  61. if(f->elogbuf){
  62. bufclose(f->elogbuf);
  63. free(f->elogbuf);
  64. f->elogbuf = nil;
  65. }
  66. }
  67. void
  68. elogreset(File *f)
  69. {
  70. f->elog.type = Null;
  71. f->elog.nd = 0;
  72. f->elog.nr = 0;
  73. }
  74. void
  75. elogterm(File *f)
  76. {
  77. elogreset(f);
  78. if(f->elogbuf)
  79. bufreset(f->elogbuf);
  80. f->elog.type = Empty;
  81. fbuffree(f->elog.r);
  82. f->elog.r = nil;
  83. warned = FALSE;
  84. }
  85. void
  86. elogflush(File *f)
  87. {
  88. Buflog b;
  89. b.type = f->elog.type;
  90. b.q0 = f->elog.q0;
  91. b.nd = f->elog.nd;
  92. b.nr = f->elog.nr;
  93. switch(f->elog.type){
  94. default:
  95. warning(nil, "unknown elog type 0x%ux\n", f->elog.type);
  96. break;
  97. case Null:
  98. break;
  99. case Insert:
  100. case Replace:
  101. if(f->elog.nr > 0)
  102. bufinsert(f->elogbuf, f->elogbuf->nc, f->elog.r, f->elog.nr);
  103. /* fall through */
  104. case Delete:
  105. bufinsert(f->elogbuf, f->elogbuf->nc, (Rune*)&b, Buflogsize);
  106. break;
  107. }
  108. elogreset(f);
  109. }
  110. void
  111. elogreplace(File *f, int q0, int q1, Rune *r, int nr)
  112. {
  113. uint gap;
  114. if(q0==q1 && nr==0)
  115. return;
  116. eloginit(f);
  117. if(f->elog.type!=Null && q0<f->elog.q0){
  118. if(warned++ == 0)
  119. warning(nil, Wsequence);
  120. elogflush(f);
  121. }
  122. /* try to merge with previous */
  123. gap = q0 - (f->elog.q0+f->elog.nd); /* gap between previous and this */
  124. if(f->elog.type==Replace && f->elog.nr+gap+nr<Maxstring){
  125. if(gap < Minstring){
  126. if(gap > 0){
  127. bufread(f, f->elog.q0+f->elog.nd, f->elog.r+f->elog.nr, gap);
  128. f->elog.nr += gap;
  129. }
  130. f->elog.nd += gap + q1-q0;
  131. runemove(f->elog.r+f->elog.nr, r, nr);
  132. f->elog.nr += nr;
  133. return;
  134. }
  135. }
  136. elogflush(f);
  137. f->elog.type = Replace;
  138. f->elog.q0 = q0;
  139. f->elog.nd = q1-q0;
  140. f->elog.nr = nr;
  141. if(nr > RBUFSIZE)
  142. editerror("internal error: replacement string too large(%d)", nr);
  143. runemove(f->elog.r, r, nr);
  144. }
  145. void
  146. eloginsert(File *f, int q0, Rune *r, int nr)
  147. {
  148. int n;
  149. if(nr == 0)
  150. return;
  151. eloginit(f);
  152. if(f->elog.type!=Null && q0<f->elog.q0){
  153. if(warned++ == 0)
  154. warning(nil, Wsequence);
  155. elogflush(f);
  156. }
  157. /* try to merge with previous */
  158. if(f->elog.type==Insert && q0==f->elog.q0 && (q0+nr)-f->elog.q0<Maxstring){
  159. f->elog.r = runerealloc(f->elog.r, f->elog.nr+nr);
  160. runemove(f->elog.r+f->elog.nr, r, nr);
  161. f->elog.nr += nr;
  162. return;
  163. }
  164. while(nr > 0){
  165. elogflush(f);
  166. f->elog.type = Insert;
  167. f->elog.q0 = q0;
  168. n = nr;
  169. if(n > RBUFSIZE)
  170. n = RBUFSIZE;
  171. f->elog.nr = n;
  172. runemove(f->elog.r, r, n);
  173. r += n;
  174. nr -= n;
  175. }
  176. }
  177. void
  178. elogdelete(File *f, int q0, int q1)
  179. {
  180. if(q0 == q1)
  181. return;
  182. eloginit(f);
  183. if(f->elog.type!=Null && q0<f->elog.q0+f->elog.nd){
  184. if(warned++ == 0)
  185. warning(nil, Wsequence);
  186. elogflush(f);
  187. }
  188. /* try to merge with previous */
  189. if(f->elog.type==Delete && f->elog.q0+f->elog.nd==q0){
  190. f->elog.nd += q1-q0;
  191. return;
  192. }
  193. elogflush(f);
  194. f->elog.type = Delete;
  195. f->elog.q0 = q0;
  196. f->elog.nd = q1-q0;
  197. }
  198. void
  199. elogapply(File *f)
  200. {
  201. Buflog b;
  202. Rune *buf;
  203. uint i, n, up, mod;
  204. uint q0, q1;
  205. Buffer *log;
  206. Text *t;
  207. elogflush(f);
  208. log = f->elogbuf;
  209. t = f->curtext;
  210. buf = fbufalloc();
  211. mod = FALSE;
  212. /*
  213. * The edit commands have already updated the selection in t->q0, t->q1.
  214. * The textinsert and textdelete calls below will update it again, so save the
  215. * current setting and restore it at the end.
  216. */
  217. q0 = t->q0;
  218. q1 = t->q1;
  219. while(log->nc > 0){
  220. up = log->nc-Buflogsize;
  221. bufread(log, up, (Rune*)&b, Buflogsize);
  222. switch(b.type){
  223. default:
  224. fprint(2, "elogapply: 0x%ux\n", b.type);
  225. abort();
  226. break;
  227. case Replace:
  228. if(!mod){
  229. mod = TRUE;
  230. filemark(f);
  231. }
  232. textdelete(t, b.q0, b.q0+b.nd, TRUE);
  233. up -= b.nr;
  234. for(i=0; i<b.nr; i+=n){
  235. n = b.nr - i;
  236. if(n > RBUFSIZE)
  237. n = RBUFSIZE;
  238. bufread(log, up+i, buf, n);
  239. textinsert(t, b.q0+i, buf, n, TRUE);
  240. }
  241. break;
  242. case Delete:
  243. if(!mod){
  244. mod = TRUE;
  245. filemark(f);
  246. }
  247. textdelete(t, b.q0, b.q0+b.nd, TRUE);
  248. break;
  249. case Insert:
  250. if(!mod){
  251. mod = TRUE;
  252. filemark(f);
  253. }
  254. up -= b.nr;
  255. for(i=0; i<b.nr; i+=n){
  256. n = b.nr - i;
  257. if(n > RBUFSIZE)
  258. n = RBUFSIZE;
  259. bufread(log, up+i, buf, n);
  260. textinsert(t, b.q0+i, buf, n, TRUE);
  261. }
  262. break;
  263. /* case Filename:
  264. f->seq = u.seq;
  265. fileunsetname(f, epsilon);
  266. f->mod = u.mod;
  267. up -= u.n;
  268. free(f->name);
  269. if(u.n == 0)
  270. f->name = nil;
  271. else
  272. f->name = runemalloc(u.n);
  273. bufread(delta, up, f->name, u.n);
  274. f->nname = u.n;
  275. break;
  276. */
  277. }
  278. bufdelete(log, up, log->nc);
  279. }
  280. fbuffree(buf);
  281. elogterm(f);
  282. t->q0 = q0;
  283. t->q1 = q1;
  284. if(t->q1 > f->nc) /* can't happen */
  285. t->q1 = f->nc;
  286. }