elog.c (view raw)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 |
#include <u.h> #include <libc.h> #include <draw.h> #include <thread.h> #include <cursor.h> #include <mouse.h> #include <keyboard.h> #include <frame.h> #include <fcall.h> #include <plumb.h> #include <libsec.h> #include "dat.h" #include "fns.h" #include "edit.h" static char Wsequence[] = "warning: changes out of sequence\n"; static int warned = FALSE; /* * Log of changes made by editing commands. Three reasons for this: * 1) We want addresses in commands to apply to old file, not file-in-change. * 2) It's difficult to track changes correctly as things move, e.g. ,x m$ * 3) This gives an opportunity to optimize by merging adjacent changes. * It's a little bit like the Undo/Redo log in Files, but Point 3) argues for a * separate implementation. To do this well, we use Replace as well as * Insert and Delete */ typedef struct Buflog Buflog; struct Buflog { short type; /* Replace, Filename */ uint q0; /* location of change (unused in f) */ uint nd; /* # runes to delete */ uint nr; /* # runes in string or file name */ }; enum { Buflogsize = sizeof(Buflog)/sizeof(Rune) }; /* * Minstring shouldn't be very big or we will do lots of I/O for small changes. * Maxstring is RBUFSIZE so we can fbufalloc() once and not realloc elog.r. */ enum { Minstring = 16, /* distance beneath which we merge changes */ Maxstring = RBUFSIZE /* maximum length of change we will merge into one */ }; void eloginit(File *f) { if(f->elog.type != Empty) return; f->elog.type = Null; if(f->elogbuf == nil) f->elogbuf = emalloc(sizeof(Buffer)); if(f->elog.r == nil) f->elog.r = fbufalloc(); bufreset(f->elogbuf); } void elogclose(File *f) { if(f->elogbuf){ bufclose(f->elogbuf); free(f->elogbuf); f->elogbuf = nil; } } void elogreset(File *f) { f->elog.type = Null; f->elog.nd = 0; f->elog.nr = 0; } void elogterm(File *f) { elogreset(f); if(f->elogbuf) bufreset(f->elogbuf); f->elog.type = Empty; fbuffree(f->elog.r); f->elog.r = nil; warned = FALSE; } void elogflush(File *f) { Buflog b; b.type = f->elog.type; b.q0 = f->elog.q0; b.nd = f->elog.nd; b.nr = f->elog.nr; switch(f->elog.type){ default: warning(nil, "unknown elog type 0x%ux\n", f->elog.type); break; case Null: break; case Insert: case Replace: if(f->elog.nr > 0) bufinsert(f->elogbuf, f->elogbuf->nc, f->elog.r, f->elog.nr); /* fall through */ case Delete: bufinsert(f->elogbuf, f->elogbuf->nc, (Rune*)&b, Buflogsize); break; } elogreset(f); } void elogreplace(File *f, int q0, int q1, Rune *r, int nr) { uint gap; if(q0==q1 && nr==0) return; eloginit(f); if(f->elog.type!=Null && q0<f->elog.q0){ if(warned++ == 0) warning(nil, Wsequence); elogflush(f); } /* try to merge with previous */ gap = q0 - (f->elog.q0+f->elog.nd); /* gap between previous and this */ if(f->elog.type==Replace && f->elog.nr+gap+nr<Maxstring){ if(gap < Minstring){ if(gap > 0){ bufread(&f->b, f->elog.q0+f->elog.nd, f->elog.r+f->elog.nr, gap); f->elog.nr += gap; } f->elog.nd += gap + q1-q0; runemove(f->elog.r+f->elog.nr, r, nr); f->elog.nr += nr; return; } } elogflush(f); f->elog.type = Replace; f->elog.q0 = q0; f->elog.nd = q1-q0; f->elog.nr = nr; if(nr > RBUFSIZE) editerror("internal error: replacement string too large(%d)", nr); runemove(f->elog.r, r, nr); } void eloginsert(File *f, int q0, Rune *r, int nr) { int n; if(nr == 0) return; eloginit(f); if(f->elog.type!=Null && q0<f->elog.q0){ if(warned++ == 0) warning(nil, Wsequence); elogflush(f); } /* try to merge with previous */ if(f->elog.type==Insert && q0==f->elog.q0 && f->elog.nr+nr<Maxstring){ runemove(f->elog.r+f->elog.nr, r, nr); f->elog.nr += nr; return; } while(nr > 0){ elogflush(f); f->elog.type = Insert; f->elog.q0 = q0; n = nr; if(n > RBUFSIZE) n = RBUFSIZE; f->elog.nr = n; runemove(f->elog.r, r, n); r += n; nr -= n; } } void elogdelete(File *f, int q0, int q1) { if(q0 == q1) return; eloginit(f); if(f->elog.type!=Null && q0<f->elog.q0+f->elog.nd){ if(warned++ == 0) warning(nil, Wsequence); elogflush(f); } /* try to merge with previous */ if(f->elog.type==Delete && f->elog.q0+f->elog.nd==q0){ f->elog.nd += q1-q0; return; } elogflush(f); f->elog.type = Delete; f->elog.q0 = q0; f->elog.nd = q1-q0; } #define tracelog 0 void elogapply(File *f) { Buflog b; Rune *buf; uint i, n, up, mod; uint tq0, tq1; Buffer *log; Text *t; int owner; elogflush(f); log = f->elogbuf; t = f->curtext; buf = fbufalloc(); mod = FALSE; owner = 0; if(t->w){ owner = t->w->owner; if(owner == 0) t->w->owner = 'E'; } /* * The edit commands have already updated the selection in t->q0, t->q1, * but using coordinates relative to the unmodified buffer. As we apply the log, * we have to update the coordinates to be relative to the modified buffer. * Textinsert and textdelete will do this for us; our only work is to apply the * convention that an insertion at t->q0==t->q1 is intended to select the * inserted text. */ /* * We constrain the addresses in here (with textconstrain()) because * overlapping changes will generate bogus addresses. We will warn * about changes out of sequence but proceed anyway; here we must * keep things in range. */ while(log->nc > 0){ up = log->nc-Buflogsize; bufread(log, up, (Rune*)&b, Buflogsize); switch(b.type){ default: fprint(2, "elogapply: 0x%ux\n", b.type); abort(); break; case Replace: if(tracelog) warning(nil, "elog replace %d %d (%d %d)\n", b.q0, b.q0+b.nd, t->q0, t->q1); if(!mod){ mod = TRUE; filemark(f); } textconstrain(t, b.q0, b.q0+b.nd, &tq0, &tq1); textdelete(t, tq0, tq1, TRUE); up -= b.nr; for(i=0; i<b.nr; i+=n){ n = b.nr - i; if(n > RBUFSIZE) n = RBUFSIZE; bufread(log, up+i, buf, n); textinsert(t, tq0+i, buf, n, TRUE); } if(t->q0 == b.q0 && t->q1 == b.q0) t->q1 += b.nr; break; case Delete: if(tracelog) warning(nil, "elog delete %d %d (%d %d)\n", b.q0, b.q0+b.nd, t->q0, t->q1); if(!mod){ mod = TRUE; filemark(f); } textconstrain(t, b.q0, b.q0+b.nd, &tq0, &tq1); textdelete(t, tq0, tq1, TRUE); break; case Insert: if(tracelog) warning(nil, "elog insert %d %d (%d %d)\n", b.q0, b.q0+b.nr, t->q0, t->q1); if(!mod){ mod = TRUE; filemark(f); } textconstrain(t, b.q0, b.q0, &tq0, &tq1); up -= b.nr; for(i=0; i<b.nr; i+=n){ n = b.nr - i; if(n > RBUFSIZE) n = RBUFSIZE; bufread(log, up+i, buf, n); textinsert(t, tq0+i, buf, n, TRUE); } if(t->q0 == b.q0 && t->q1 == b.q0) t->q1 += b.nr; break; /* case Filename: f->seq = u.seq; fileunsetname(f, epsilon); f->mod = u.mod; up -= u.n; free(f->name); if(u.n == 0) f->name = nil; else f->name = runemalloc(u.n); bufread(delta, up, f->name, u.n); f->nname = u.n; break; */ } bufdelete(log, up, log->nc); } fbuffree(buf); elogterm(f); /* * Bad addresses will cause bufload to crash, so double check. * If changes were out of order, we expect problems so don't complain further. */ if(t->q0 > f->b.nc || t->q1 > f->b.nc || t->q0 > t->q1){ if(!warned) warning(nil, "elogapply: can't happen %d %d %d\n", t->q0, t->q1, f->b.nc); t->q1 = min(t->q1, f->b.nc); t->q0 = min(t->q0, t->q1); } if(t->w) t->w->owner = owner; } |