-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathline.c
976 lines (926 loc) · 23.1 KB
/
line.c
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
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
/* $Id: line.c,v 1.23 2003/03/08 00:02:15 amura Exp $ */
/*
* Text line handling.
* The functions in this file
* are a general set of line management
* utilities. They are the only routines that
* touch the text. They also touch the buffer
* and window structures, to make sure that the
* necessary updating gets done. There are routines
* in this file that handle the kill buffer too.
* It isn't here for any good reason.
*
* Note that this code only updates the dot and
* mark values in the window list. Since all the code
* acts on the current window, the buffer that we
* are editing must be being displayed, which means
* that "b_nwnd" is non zero, which means that the
* dot and mark values in the buffer headers are
* nonsense.
*/
/* 90.01.29 Modified for Ng 1.0 by S.Yoshida */
#include "config.h" /* 90.12.20 by S.Yoshida */
#include "def.h"
#ifdef UNDO
#include "undo.h"
#endif
#ifdef CLIPBOARD
extern int send_clipboard _PRO((void));
extern int receive_clipboard _PRO((void));
#endif
/* number of bytes member is from start of structure type */
/* should be computed at compile time */
#ifndef OFFSET
#define OFFSET(type,member) ((char *)&(((type *)0)->member)-(char *)((type *)0))
#endif
#ifndef NBLOCK
#define NBLOCK 16 /* Line block chunk size */
#endif
#ifndef KBLOCK
#define KBLOCK 256 /* Kill buffer block size. */
#endif
static char *kbufp = NULL; /* Kill buffer data. */
static RSIZE kused = 0; /* # of bytes used in KB. */
static RSIZE ksize = 0; /* # of bytes allocated in KB. */
static RSIZE kstart = 0; /* # of first used byte in KB. */
/* this is small tricks for speed up of get_lineno() */
static int lineno_cache = FALSE;
int set_lineno = -1;
/*
* This routine allocates a block of memory large enough to hold a LINE
* containing "used" characters. The block is rounded up to whatever
* needs to be allocated. (use lallocx for lines likely to grow.)
* Return a pointer to the new block, or NULL if there isn't
* any memory left. Print a message in the message line if no space.
*/
LINE *
lalloc(used)
register int used;
{
register LINE *lp;
register int size;
/* any padding at the end of the structure is used */
if ((size = used + OFFSET(LINE, l_text[0])) < sizeof(LINE))
size = sizeof(LINE);
#ifdef MALLOCROUND
MALLOCROUND(size); /* round up to a size optimal to malloc */
#endif
if ((lp = (LINE *)malloc((unsigned)size)) == NULL) {
ewprintf("Can't get %d bytes", size);
return (LINE *)NULL;
}
lp->l_size = size - OFFSET(LINE, l_text[0]);
lp->l_used = used;
return lp;
}
/*
* Like lalloc, only round amount desired up because this line will
* probably grow. We always make room for at least one more char.
* (thus making 0 not a special case anymore.)
*/
LINE *
lallocx(used)
int used;
{
register int size;
register LINE *lp;
size = (NBLOCK+used) & ~(NBLOCK-1);
if ((lp = lalloc(size)) != NULL)
lp->l_used = used;
return lp;
}
/*
* Delete line "lp". Fix all of the
* links that might point at it (they are
* moved to offset 0 of the next line.
* Unlink the line from whatever buffer it
* might be in. Release the memory. The
* buffers are updated too; the magic conditions
* described in the above comments don't hold
* here.
*/
VOID
lfree(lp)
register LINE *lp;
{
register BUFFER *bp;
register WINDOW *wp;
for (wp = wheadp; wp != NULL; wp = wp->w_wndp) {
if (wp->w_linep == lp) {
wp->w_linep = lp->l_fp;
wp->w_lines = 0;
}
if (wp->w_dotp == lp) {
wp->w_dotp = lp->l_fp;
wp->w_doto = 0;
}
}
for (bp = bheadp; bp != NULL; bp = bp->b_bufp) {
if (bp->b_nwnd == 0) {
if (bp->b_dotp == lp) {
bp->b_dotp = lp->l_fp;
bp->b_doto = 0;
}
if (bp->b_markp == lp) {
bp->b_markp = lp->l_fp;
bp->b_marko = 0;
}
}
}
lp->l_bp->l_fp = lp->l_fp;
lp->l_fp->l_bp = lp->l_bp;
free((char *)lp);
}
/*
* This routine gets called when
* a character is changed in place in the
* current buffer. It updates all of the required
* flags in the buffer and window system. The flag
* used is passed as an argument; if the buffer is being
* displayed in more than 1 window we change EDIT to
* HARD. Set MODE if the mode line needs to be
* updated (the "*" has to be set).
*/
VOID
lchange(flag)
register int flag;
{
register WINDOW *wp;
#ifdef AUTOSAVE /* 96.12.24 by M.Suzuki */
curbp->b_flag |= BFACHG;
#endif /* AUTOSAVE */
if ((curbp->b_flag&BFCHG) == 0) { /* First change, so */
flag |= WFMODE; /* update mode lines. */
curbp->b_flag |= BFCHG;
}
for (wp = wheadp; wp != NULL; wp = wp->w_wndp) {
if (wp->w_bufp == curbp) {
wp->w_flag |= flag;
if (wp != curwp)
wp->w_flag |= WFHARD;
}
}
}
/*
* Insert "n" copies of the character "c"
* at the current location of dot. In the easy case
* all that happens is the text is stored in the line.
* In the hard case, the line has to be reallocated.
* When the window list is updated, take special
* care; I screwed it up once. You always update dot
* in the current window. You update mark, and a
* dot in another window, if it is greater than
* the place where you did the insert. Return TRUE
* if all is well, and FALSE on errors.
*/
int
linsert(n, c)
int n, c;
{
register char *cp1;
register char *cp2;
register LINE *lp1;
LINE *lp2;
LINE *lp3;
register int doto;
register RSIZE i;
WINDOW *wp;
#ifdef UNDO
UNDO_DATA *undo;
#endif
lchange(WFEDIT);
lp1 = curwp->w_dotp; /* Current line */
if (lp1 == curbp->b_linep) { /* At the end: special */
/* (now should only happen in empty buffer */
if (curwp->w_doto != 0) {
ewprintf("bug: linsert");
return FALSE;
}
if ((lp2=lallocx(n)) == NULL) /* Allocate new line */
return FALSE;
lp3 = lp1->l_bp; /* Previous line */
lp3->l_fp = lp2; /* Link in */
lp2->l_fp = lp1;
lp1->l_bp = lp2;
lp2->l_bp = lp3;
for (i=0; i<n; ++i)
lp2->l_text[i] = c;
#ifdef UNDO
undo_setup(undo);
if (isundo()) {
if (undo_type(undo) != UDINS) {
undo_bfree(undo);
undo->u_dotlno = get_lineno(curbp, lp2);
undo->u_doto = 0;
undo->u_used = 0;
undo->u_type = UDINS;
}
undo->u_used += n;
undo_finish(&(undo->u_next));
}
#endif
for (wp = wheadp; wp != NULL; wp = wp->w_wndp) {
if (wp->w_linep == lp1) {
wp->w_linep = lp2;
wp->w_lines = 0;
}
if (wp->w_dotp == lp1)
wp->w_dotp = lp2;
}
/*NOSTRICT*/
if (curbp->b_markp == lp1)
curbp->b_markp = lp2;
curwp->w_doto = n;
return TRUE;
}
doto = curwp->w_doto; /* Save for later. */
/*NOSTRICT (2) */
if (lp1->l_used+n > lp1->l_size) { /* Hard: reallocate */
if ((lp2=lallocx(lp1->l_used+n)) == NULL)
return FALSE;
cp1 = &lp1->l_text[0];
cp2 = &lp2->l_text[0];
while (cp1 != &lp1->l_text[doto])
*cp2++ = *cp1++;
/*NOSTRICT*/
cp2 += n;
while (cp1 != &lp1->l_text[lp1->l_used])
*cp2++ = *cp1++;
lp1->l_bp->l_fp = lp2;
lp2->l_fp = lp1->l_fp;
lp1->l_fp->l_bp = lp2;
lp2->l_bp = lp1->l_bp;
free((char *)lp1);
}
else { /* Easy: in place */
lp2 = lp1; /* Pretend new line */
/*NOSTRICT*/
lp2->l_used += n;
cp2 = &lp1->l_text[lp1->l_used];
cp1 = cp2-n;
while (cp1 != &lp1->l_text[doto])
*--cp2 = *--cp1;
}
for (i=0; i<n; ++i) /* Add the characters */
lp2->l_text[doto+i] = c;
#ifdef UNDO
undo_setup(undo);
if (isundo()) {
if (undo_type(undo) != UDINS) {
undo_bfree(undo);
undo->u_dotlno = get_lineno(curbp, lp2);
undo->u_doto = doto;
undo->u_used = 0;
undo->u_type = UDINS;
}
undo->u_used += n;
undo_finish(&(undo->u_next));
}
#endif
for (wp = wheadp; wp != NULL; wp = wp->w_wndp) {
if (wp->w_linep == lp1) {
wp->w_linep = lp2;
wp->w_lines = 0;
}
if (wp->w_dotp == lp1) {
wp->w_dotp = lp2;
if (wp==curwp || wp->w_doto>doto)
wp->w_doto += n;
}
}
if (curbp->b_markp == lp1) {
curbp->b_markp = lp2;
if (curbp->b_marko > doto)
curbp->b_marko += n;
}
return TRUE;
}
/*
* Insert a newline into the buffer
* at the current location of dot in the current
* window. The funny ass-backwards way is no longer used.
*/
int
lnewline()
{
register LINE *lp1;
register LINE *lp2;
register int doto;
register int nlen;
WINDOW *wp;
#ifdef UNDO
UNDO_DATA *undo;
lineno_cache = FALSE;
#endif
lchange(WFHARD);
lp1 = curwp->w_dotp; /* Get the address and */
doto = curwp->w_doto; /* offset of "." */
if (lp1 == curbp->b_linep) {
/* At the end: special */
/* (now should only happen in empty buffer */
if (doto != 0) {
ewprintf("bug: lnewline");
return FALSE;
}
if ((lp2=lallocx(0)) == NULL) /* Allocate new line */
return FALSE;
lp2->l_bp = lp1->l_bp;
lp1->l_bp->l_fp = lp2;
lp2->l_fp = lp1;
lp1->l_bp = lp2;
curwp->w_dotp = lp1 = lp2;
}
if (doto == 0) { /* avoid unnessisary copying */
if ((lp2 = lallocx(0)) == NULL) /* new first part */
return FALSE;
lp2->l_bp = lp1->l_bp;
lp1->l_bp->l_fp = lp2;
lp2->l_fp = lp1;
lp1->l_bp = lp2;
#ifdef UNDO
undo_setup(undo);
if (isundo()) {
undo_bfree(undo);
undo->u_dotlno = get_lineno(curbp,lp2);
undo->u_doto = 0;
undo->u_type = UDINSNL;
undo->u_used = 1;
undo_finish(&(undo->u_next));
}
#endif
for (wp = wheadp; wp!=NULL; wp = wp->w_wndp)
if (wp->w_linep == lp1) {
wp->w_linep = lp2;
wp->w_lines = 0;
}
return TRUE;
}
nlen = llength(lp1) - doto; /* length of new part */
if ((lp2=lallocx(nlen)) == NULL) /* New second half line */
return FALSE;
#ifdef UNDO
undo_setup(undo);
if (isundo()) {
undo_bfree(undo);
undo->u_dotlno = get_lineno(curbp,lp1);
undo->u_doto = doto;
undo->u_type = UDINSNL;
undo->u_used = 1;
undo_finish(&(undo->u_next));
}
#endif
if (nlen != 0)
bcopy(&lp1->l_text[doto], &lp2->l_text[0], nlen);
lp1->l_used = doto;
lp2->l_bp = lp1;
lp2->l_fp = lp1->l_fp;
lp1->l_fp = lp2;
lp2->l_fp->l_bp = lp2;
for (wp = wheadp; wp != NULL; wp = wp->w_wndp) { /* Windows */
if (wp->w_dotp == lp1 && wp->w_doto >= doto) {
wp->w_dotp = lp2;
wp->w_doto -= doto;
}
}
if (curbp->b_markp == lp1 && curbp->b_marko > doto) {
curbp->b_markp = lp2;
curbp->b_marko -= doto;
}
return TRUE;
}
/*
* This function deletes "n" bytes,
* starting at dot. It understands how do deal
* with end of lines, etc. It returns TRUE if all
* of the characters were deleted, and FALSE if
* they were not (because dot ran into the end of
* the buffer. The "kflag" indicates either no insertion,
* or direction of insertion into the kill buffer.
#ifdef KANJI
* (91.01.01 Add comment by S.Yoshida)
* When after deleting "n" bytes, here is KANJI 2nd byte,
* the KANJI 2nd byte is also deleted.
#endif
*/
int
ldelete(n, kflag)
RSIZE n;
int kflag;
{
register char *cp1;
register char *cp2;
register LINE *dotp;
register int doto;
register RSIZE chunk;
WINDOW *wp;
#ifdef KANJI /* 90.01.29 by S.Yoshida */
register int i;
register int kanji2nd;
#endif /* KANJI */
#ifdef UNDO
UNDO_DATA* undo = NULL;
int char_num = 0;
if (n != 0) {
undo_setup(undo);
if (isundo()) {
if (n == 1) {
char_num = 1;
undo_bfree(undo);
undo->u_used = 0;
undo->u_doto = curwp->w_doto;
undo->u_dotlno =
get_lineno(curbp, curwp->w_dotp);
undo->u_type = (kflag==KBACK) ? UDBS : UDDEL;
}
else if (undo_balloc(undo, n)) {
char_num = 2;
undo->u_used = 0;
undo->u_doto = curwp->w_doto;
undo->u_dotlno =
get_lineno(curbp, curwp->w_dotp);
undo->u_type = (kflag==KBACK) ? UDBS : UDDEL;
}
}
}
#endif
#ifdef KANJI
if (kflag & KNOKANJI)
kanji2nd = -1;
else
kanji2nd = 0;
kflag = KFLAGS(kflag);
#endif
/*
* HACK - doesn't matter, and fixes back-over-nl bug for empty
* kill buffers.
*/
if (kused == kstart)
kflag = KFORW;
while (n != 0) {
dotp = curwp->w_dotp;
doto = curwp->w_doto;
if (dotp == curbp->b_linep) /* Hit end of buffer. */
return FALSE;
chunk = dotp->l_used-doto; /* Size of chunk. */
if (chunk > n)
chunk = n;
if (chunk == 0) { /* End of line, merge. */
if(dotp == lback(curbp->b_linep))
return FALSE; /* End of buffer. */
lchange(WFHARD);
if (ldelnewline() == FALSE
|| (kflag!=KNONE && kinsert('\n', kflag)==FALSE)) {
#ifdef UNDO
undo_reset(curbp);
#endif
return FALSE;
}
#ifdef UNDO
if (isundo())
{
if (char_num == 1) {
undo->u_code[0] = '\n';
undo->u_code[1] = 0;
}
else if (undo_bgrow(undo, 1)) {
undo->u_buffer[undo->u_used] = '\n';
undo->u_used++;
}
}
#endif
--n;
continue;
}
lchange(WFEDIT);
cp1 = &dotp->l_text[doto]; /* Scrunch text. */
#ifdef KANJI /* 90.01.29 by S.Yoshida */
if (kanji2nd < 0) /* ignore KANJI */
cp2 = cp1 + chunk;
else {
kanji2nd = 0;
cp2 = cp1;
for (i = 0; i < chunk; i++, cp2++) {
if (kanji2nd) {
kanji2nd--;
#ifdef HOJO_KANJI
}
else if (ISHOJO(*cp2)) {
kanji2nd = 2;
#endif
}
else if (ISKANJI(*cp2)) {
kanji2nd = 1;
}
}
if (kanji2nd) {
cp2 += kanji2nd;
chunk += kanji2nd;
n += kanji2nd;
}
}
#else /* NOT KANJI */
cp2 = cp1 + chunk;
#endif /* KANJI */
#ifdef UNDO
if (isundo()) {
if (char_num == 1) {
if (chunk == 1) {
undo->u_code[0] = *cp1;
undo->u_code[1] = 0;
}
else {
undo->u_code[0] = *cp1;
undo->u_code[1] = *(cp1+1);
}
}
else if (undo_bgrow(undo, chunk)) {
bcopy(cp1, &(undo->u_buffer[undo->u_used]),
(int)chunk);
undo->u_used += chunk;
}
}
#endif
if (kflag == KFORW) {
while (ksize - kused < chunk) {
if (kgrow(FALSE) == FALSE)
return FALSE;
}
bcopy(cp1, &(kbufp[kused]), (int) chunk);
kused += chunk;
}
else if (kflag == KBACK) {
while (kstart < chunk) {
if (kgrow(TRUE) == FALSE)
return FALSE;
}
bcopy(cp1, &(kbufp[kstart-chunk]), (int) chunk);
kstart -= chunk;
}
else if (kflag != KNONE)
panic("broken ldelete call");
while (cp2 != &dotp->l_text[dotp->l_used])
*cp1++ = *cp2++;
dotp->l_used -= (int) chunk;
for (wp = wheadp; wp != NULL; wp = wp->w_wndp ) {
if (wp->w_dotp==dotp && wp->w_doto>=doto) {
/*NOSTRICT*/
wp->w_doto -= (short)chunk;
if (wp->w_doto < doto)
wp->w_doto = doto;
}
}
if (curbp->b_markp==dotp && curbp->b_marko>=doto) {
/*NOSTRICT*/
curbp->b_marko -= (short)chunk;
if (curbp->b_marko < doto)
curbp->b_marko = doto;
}
n -= chunk;
}
#ifdef CLIPBOARD
if (kflag != KNONE)
send_clipboard();
#endif
#ifdef UNDO
if (isundo() && char_num!=0)
undo_finish(&(undo->u_next));
#endif
return TRUE;
}
/*
* Delete a newline. Join the current line
* with the next line. If the next line is the magic
* header line always return TRUE; merging the last line
* with the header line can be thought of as always being a
* successful operation, even if nothing is done, and this makes
* the kill buffer work "right". Easy cases can be done by
* shuffling data around. Hard cases require that lines be moved
* about in memory. Return FALSE on error and TRUE if all
* looks ok.
*/
int
ldelnewline()
{
register LINE *lp1;
register LINE *lp2;
register WINDOW *wp;
LINE *lp3;
#ifdef UNDO
lineno_cache = FALSE;
#endif
lp1 = curwp->w_dotp;
lp2 = lp1->l_fp;
if (lp2 == curbp->b_linep) /* At the buffer end. */
return TRUE;
if (lp2->l_used <= lp1->l_size - lp1->l_used) {
bcopy(&lp2->l_text[0], &lp1->l_text[lp1->l_used], lp2->l_used);
for (wp = wheadp; wp != NULL; wp = wp->w_wndp) {
if (wp->w_linep == lp2) {
wp->w_linep = lp1;
wp->w_lines = 0;
}
if (wp->w_dotp == lp2) {
wp->w_dotp = lp1;
wp->w_doto += lp1->l_used;
}
}
if (curbp->b_markp == lp2) {
curbp->b_markp = lp1;
curbp->b_marko += lp1->l_used;
}
lp1->l_used += lp2->l_used;
lp1->l_fp = lp2->l_fp;
lp2->l_fp->l_bp = lp1;
free((char *)lp2);
return TRUE;
}
if ((lp3=lalloc(lp1->l_used + lp2->l_used)) == NULL)
return FALSE;
bcopy(&lp1->l_text[0], &lp3->l_text[0], lp1->l_used);
bcopy(&lp2->l_text[0], &lp3->l_text[lp1->l_used], lp2->l_used);
lp1->l_bp->l_fp = lp3;
lp3->l_fp = lp2->l_fp;
lp2->l_fp->l_bp = lp3;
lp3->l_bp = lp1->l_bp;
for (wp = wheadp; wp != NULL; wp = wp->w_wndp) {
if (wp->w_linep==lp1 || wp->w_linep==lp2) {
wp->w_linep = lp3;
wp->w_lines = 0;
}
if (wp->w_dotp == lp1)
wp->w_dotp = lp3;
else if (wp->w_dotp == lp2) {
wp->w_dotp = lp3;
wp->w_doto += lp1->l_used;
}
}
if (curbp->b_markp == lp1)
curbp->b_markp = lp3;
else if (curbp->b_markp == lp2) {
curbp->b_markp = lp3;
curbp->b_marko += lp1->l_used;
}
free((char *) lp1);
free((char *) lp2);
return TRUE;
}
/*
* Replace plen characters before dot with argument string.
* Control-J characters in st are interpreted as newlines.
* There is a casehack disable flag (normally it likes to match
* case of replacement to what was there).
*/
int
lreplace(plen, st, f)
register RSIZE plen; /* length to remove */
char *st; /* replacement string */
int f; /* case hack disable */
{
register RSIZE rlen; /* replacement length */
register int rtype; /* capitalization */
register int c; /* used for random characters */
register int doto; /* offset into line */
#ifdef UNDO
UNDO_DATA *undo;
UNDO_DATA **undoptr_save = NULL;
#endif
/*
* Find the capitalization of the word that was found.
* f says use exact case of replacement string (same thing that
* happens with lowercase found), so bypass check.
*/
/*NOSTRICT*/
(VOID) backchar(FFARG | FFRAND, (int) plen);
rtype = _NGC_L;
c = lgetc(curwp->w_dotp, curwp->w_doto);
if (ISUPPER(c)!=FALSE && f==FALSE) {
rtype = _NGC_U|_NGC_L;
if (curwp->w_doto+1 < llength(curwp->w_dotp)) {
c = lgetc(curwp->w_dotp, curwp->w_doto+1);
if (ISUPPER(c) != FALSE)
rtype = _NGC_U;
}
}
/*
* make the string lengths match (either pad the line
* so that it will fit, or scrunch out the excess).
* be careful with dot's offset.
*/
rlen = strlen(st);
doto = curwp->w_doto;
#ifdef UNDO
undo_setup(undo);
if (isundo()) {
/*
* In only this case, u_buffer is terminated by \0.
* Because do_undo() use this function 'lreplace',
*/
if (undo_balloc(undo, plen+1)) {
bcopy(&(curwp->w_dotp)->l_text[doto], undo->u_buffer, plen);
undo->u_buffer[plen] = '\0';
undo->u_dotlno = get_lineno(curbp,curwp->w_dotp);
undo->u_doto = doto;
undo->u_type = UDREPL;
undo->u_used = rlen;
undoptr_save = undoptr;
undoptr = NULL;
}
}
#endif
if (plen > rlen)
(VOID) ldelete((RSIZE) (plen-rlen), KNONE|KNOKANJI);
else if (plen < rlen) {
if (linsert((int)(rlen-plen), ' ') == FALSE)
return FALSE;
}
curwp->w_doto = doto;
/*
* do the replacement: If was capital, then place first
* char as if upper, and subsequent chars as if lower.
* If inserting upper, check replacement for case.
*/
while ((c = CHARMASK(*st++)) != '\0') {
if ((rtype&_NGC_U)!=0 && ISLOWER(c)!=0)
c = TOUPPER(c);
if (rtype == (_NGC_U|_NGC_L))
rtype = _NGC_L;
if (c == CCHR('J')) {
if (curwp->w_doto == llength(curwp->w_dotp))
(VOID) forwchar(FFRAND, 1);
else {
if (ldelete((RSIZE) 1, KNONE) != FALSE)
(VOID) lnewline();
}
}
else if (curwp->w_dotp == curbp->b_linep) {
(VOID) linsert(1, c);
}
else if (curwp->w_doto == llength(curwp->w_dotp)) {
if (ldelete((RSIZE) 1, KNONE) != FALSE)
(VOID) linsert(1, c);
}
else
lputc(curwp->w_dotp, curwp->w_doto++, c);
}
lchange(WFHARD);
#ifdef UNDO
if (undoptr_save != NULL) {
undobefore = undoptr_save;
undoptr = &(undo->u_next);
}
#endif
return (TRUE);
}
/*
* Delete all of the text
* saved in the kill buffer. Called by commands
* when a new kill context is being created. The kill
* buffer array is released, just in case the buffer has
* grown to immense size. No errors.
*/
VOID
kdelete()
{
if (kbufp != NULL) {
free((char *) kbufp);
kbufp = NULL;
kstart = kused = ksize = 0;
}
}
/*
* Insert a character to the kill buffer,
* enlarging the buffer if there isn't any room. Always
* grow the buffer in chunks, on the assumption that if you
* put something in the kill buffer you are going to put
* more stuff there too later. Return TRUE if all is
* well, and FALSE on errors. Print a message on
* errors. Dir says whether to put it at back or front.
*/
int
kinsert(c, dir)
int c, dir;
{
if (kused == ksize && dir == KFORW && kgrow(FALSE) == FALSE)
return FALSE;
if (kstart == 0 && dir == KBACK && kgrow(TRUE) == FALSE)
return FALSE;
if (dir == KFORW)
kbufp[kused++] = c;
else if (dir == KBACK)
kbufp[--kstart] = c;
else
panic("broken kinsert call"); /* Oh shit! */
return (TRUE);
}
/*
* kgrow - just get more kill buffer for the callee. back is true if
* we are trying to get space at the beginning of the kill buffer.
*/
int
kgrow(back)
int back;
{
register int nstart;
register char *nbufp;
if ((unsigned)(ksize+KBLOCK) <= (unsigned)ksize) {
/* probably 16 bit unsigned */
ewprintf("Kill buffer size at maximum");
return FALSE;
}
if ((nbufp=malloc((unsigned)(ksize+KBLOCK))) == NULL) {
ewprintf("Can't get %ld bytes", (long)(ksize+KBLOCK));
return FALSE;
}
nstart = (back == TRUE) ? (kstart + KBLOCK) : (KBLOCK / 4) ;
if (kused-kstart > 0)
bcopy(&(kbufp[kstart]), &(nbufp[nstart]),
(int) (kused-kstart));
if (kbufp != NULL)
free((char *) kbufp);
kbufp = nbufp;
ksize += KBLOCK;
kused = kused - kstart + nstart;
kstart = nstart;
return TRUE;
}
/*
* This function gets characters from
* the kill buffer. If the character index "n" is
* off the end, it returns "-1". This lets the caller
* just scan along until it gets a "-1" back.
*/
int
kremove(n)
int n;
{
if (n < 0 || n + kstart >= kused)
return -1;
return CHARMASK(kbufp[n + kstart]);
}
#ifdef CLIPBOARD
int send_clipboard_ _PRO((char *, int));
int size_clipboard_ _PRO((void));
int recieve_clipboard_ _PRO((char *, int *));
int
send_clipboard()
{
if (&kbufp[kstart] != NULL)
return send_clipboard_(&kbufp[kstart], kused-kstart);
else
return send_clipboard_("", 0);
}
int
receive_clipboard()
{
int size;
char *buf;
kdelete() ;
size = size_clipboard_();
if (size == 0)
return TRUE;
if ((buf=alloca(size)) == NULL)
return FALSE;
buf[0] = 0 ;
recieve_clipboard_(buf, &size);
ksize = size + 1;
ksize = (ksize + KBLOCK - 1) / KBLOCK * KBLOCK ;
kbufp = malloc(ksize);
if ((kbufp=malloc(ksize)) == NULL) {
ksize = 0;
return FALSE;
}
bcopy(buf, kbufp, size);
kused = size;
kstart = 0;
return TRUE;
}
#endif /* CLIPBOARD */
int
get_lineno(bp, blp)
BUFFER *bp;
LINE *blp;
{
register LINE *lp;
register int n = 0;
static BUFFER *before_bp;
static LINE *before_blp;
static int before_n;
if (set_lineno != -1)
return set_lineno;
if (lineno_cache && blp==before_blp && bp==before_bp)
return before_n;
before_blp = blp;
before_bp = bp;
lp = lforw(bp->b_linep);
while (lp != blp) {
lp = lforw(lp);
if (lp == bp->b_linep)
break;
n++;
}
if (lp == bp->b_linep)
n = 0;
before_n = n;
lineno_cache = TRUE;
return n;
}