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
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
| | /* Buffer insertion/deletion and gap motion for GNU Emacs. -*- coding: utf-8 -*-
Copyright (C) 1985-1986, 1993-1995, 1997-2020 Free Software
Foundation, Inc.
This file is part of GNU Emacs.
GNU Emacs is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or (at
your option) any later version.
GNU Emacs is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with GNU Emacs. If not, see <https://www.gnu.org/licenses/>. */
#include <config.h>
#include <intprops.h>
#include "lisp.h"
#include "composite.h"
#include "intervals.h"
#include "character.h"
#include "buffer.h"
#include "window.h"
#include "region-cache.h"
#include "pdumper.h"
static void insert_from_string_1 (Lisp_Object, ptrdiff_t, ptrdiff_t, ptrdiff_t,
ptrdiff_t, bool, bool);
static void insert_from_buffer_1 (struct buffer *, ptrdiff_t, ptrdiff_t, bool);
static void gap_left (ptrdiff_t, ptrdiff_t, bool);
static void gap_right (ptrdiff_t, ptrdiff_t);
/* List of elements of the form (BEG-UNCHANGED END-UNCHANGED CHANGE-AMOUNT)
describing changes which happened while combine_after_change_calls
was non-nil. We use this to decide how to call them
once the deferral ends.
In each element.
BEG-UNCHANGED is the number of chars before the changed range.
END-UNCHANGED is the number of chars after the changed range,
and CHANGE-AMOUNT is the number of characters inserted by the change
(negative for a deletion). */
static Lisp_Object combine_after_change_list;
/* Buffer which combine_after_change_list is about. */
static Lisp_Object combine_after_change_buffer;
static void signal_before_change (ptrdiff_t, ptrdiff_t, ptrdiff_t *);
/* Also used in marker.c to enable expensive marker checks. */
#ifdef MARKER_DEBUG
static void
check_markers (void)
{
struct Lisp_Marker *tail;
bool multibyte = ! NILP (BVAR (current_buffer, enable_multibyte_characters));
for (tail = BUF_MARKERS (current_buffer); tail; tail = tail->next)
{
if (tail->buffer->text != current_buffer->text)
emacs_abort ();
if (tail->charpos > Z)
emacs_abort ();
if (tail->bytepos > Z_BYTE)
emacs_abort ();
if (multibyte && ! CHAR_HEAD_P (FETCH_BYTE (tail->bytepos)))
emacs_abort ();
}
}
#else /* not MARKER_DEBUG */
#define check_markers() do { } while (0)
#endif /* MARKER_DEBUG */
/* Move gap to byte position BYTEPOS, which is also char position CHARPOS.
Note that this can quit! */
void
move_gap_both (ptrdiff_t charpos, ptrdiff_t bytepos)
{
eassert (charpos == BYTE_TO_CHAR (bytepos)
&& bytepos == CHAR_TO_BYTE (charpos));
if (bytepos < GPT_BYTE)
gap_left (charpos, bytepos, 0);
else if (bytepos > GPT_BYTE)
gap_right (charpos, bytepos);
}
/* Move the gap to a position less than the current GPT.
BYTEPOS describes the new position as a byte position,
and CHARPOS is the corresponding char position.
If NEWGAP, then don't update beg_unchanged and end_unchanged. */
static void
gap_left (ptrdiff_t charpos, ptrdiff_t bytepos, bool newgap)
{
unsigned char *to, *from;
ptrdiff_t i;
ptrdiff_t new_s1;
if (!newgap)
BUF_COMPUTE_UNCHANGED (current_buffer, charpos, GPT);
i = GPT_BYTE;
to = GAP_END_ADDR;
from = GPT_ADDR;
new_s1 = GPT_BYTE; /* May point in the middle of multibyte sequences. */
/* Now copy the characters. To move the gap down,
copy characters up. */
while (1)
{
/* I gets number of characters left to copy. */
i = new_s1 - bytepos;
if (i == 0)
break;
/* If a quit is requested, stop copying now.
Change BYTEPOS to be where we have actually moved the gap to.
Note that this cannot happen when we are called to make the
gap larger or smaller, since make_gap_larger and
make_gap_smaller set inhibit-quit. */
if (QUITP)
{
/* FIXME: This can point in the middle of a multibyte character. */
bytepos = new_s1;
charpos = BYTE_TO_CHAR (bytepos);
break;
}
/* Move at most 32000 chars before checking again for a quit. */
/* FIXME: This 32KB chunk size dates back to before 1991.
Maybe we should bump it to reflect the >1000x increase
in memory size and bandwidth since that time.
Is it even worthwhile checking `quit` within this loop?
Especially since make_gap_smaller/larger binds inhibit-quit anyway! */
if (i > 32000)
i = 32000;
new_s1 -= i;
from -= i, to -= i;
memmove (to, from, i);
}
/* Adjust buffer data structure, to put the gap at BYTEPOS.
BYTEPOS is where the loop above stopped, which may be what
was specified or may be where a quit was detected. */
GPT_BYTE = bytepos;
GPT = charpos;
eassert (charpos <= bytepos);
if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */
maybe_quit ();
}
/* Move the gap to a position greater than the current GPT.
BYTEPOS describes the new position as a byte position,
and CHARPOS is the corresponding char position. */
static void
gap_right (ptrdiff_t charpos, ptrdiff_t bytepos)
{
register unsigned char *to, *from;
register ptrdiff_t i;
ptrdiff_t new_s1; /* May point in the middle of multibyte sequences. */
BUF_COMPUTE_UNCHANGED (current_buffer, charpos, GPT);
i = GPT_BYTE;
from = GAP_END_ADDR;
to = GPT_ADDR;
new_s1 = GPT_BYTE;
/* Now copy the characters. To move the gap up,
copy characters down. */
while (1)
{
/* I gets number of characters left to copy. */
i = bytepos - new_s1;
if (i == 0)
break;
/* If a quit is requested, stop copying now.
Change BYTEPOS to be where we have actually moved the gap to.
Note that this cannot happen when we are called to make the
gap larger or smaller, since make_gap_larger and
make_gap_smaller set inhibit-quit. */
if (QUITP)
{
/* FIXME: This can point in the middle of a multibyte character. */
bytepos = new_s1;
charpos = BYTE_TO_CHAR (bytepos);
break;
}
/* Move at most 32000 chars before checking again for a quit. */
if (i > 32000)
i = 32000;
new_s1 += i;
memmove (to, from, i);
from += i, to += i;
}
GPT = charpos;
GPT_BYTE = bytepos;
eassert (charpos <= bytepos);
if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */
maybe_quit ();
}
\f
/* If the selected window's old pointm is adjacent or covered by the
region from FROM to TO, unsuspend auto hscroll in that window. */
static void
adjust_suspend_auto_hscroll (ptrdiff_t from, ptrdiff_t to)
{
if (WINDOWP (selected_window))
{
struct window *w = XWINDOW (selected_window);
if (BUFFERP (w->contents)
&& XBUFFER (w->contents) == current_buffer
&& XMARKER (w->old_pointm)->charpos >= from
&& XMARKER (w->old_pointm)->charpos <= to)
w->suspend_auto_hscroll = 0;
}
}
/* Adjust all markers for a deletion
whose range in bytes is FROM_BYTE to TO_BYTE.
The range in charpos is FROM to TO.
This function assumes that the gap is adjacent to
or inside of the range being deleted. */
void
adjust_markers_for_delete (ptrdiff_t from, ptrdiff_t from_byte,
ptrdiff_t to, ptrdiff_t to_byte)
{
struct Lisp_Marker *m;
ptrdiff_t charpos;
adjust_suspend_auto_hscroll (from, to);
for (m = BUF_MARKERS (current_buffer); m; m = m->next)
{
charpos = m->charpos;
eassert (charpos <= Z);
/* If the marker is after the deletion,
relocate by number of chars / bytes deleted. */
if (charpos > to)
{
m->charpos -= to - from;
m->bytepos -= to_byte - from_byte;
}
/* Here's the case where a marker is inside text being deleted. */
else if (charpos > from)
{
m->charpos = from;
m->bytepos = from_byte;
}
}
}
\f
/* Adjust markers for an insertion that stretches from FROM / FROM_BYTE
to TO / TO_BYTE. We have to relocate the charpos of every marker
that points after the insertion (but not their bytepos).
When a marker points at the insertion point,
we advance it if either its insertion-type is t
or BEFORE_MARKERS is true. */
static void
adjust_markers_for_insert (ptrdiff_t from, ptrdiff_t from_byte,
ptrdiff_t to, ptrdiff_t to_byte, bool before_markers)
{
struct Lisp_Marker *m;
bool adjusted = 0;
ptrdiff_t nchars = to - from;
ptrdiff_t nbytes = to_byte - from_byte;
adjust_suspend_auto_hscroll (from, to);
for (m = BUF_MARKERS (current_buffer); m; m = m->next)
{
eassert (m->bytepos >= m->charpos
&& m->bytepos - m->charpos <= Z_BYTE - Z);
if (m->bytepos == from_byte)
{
if (m->insertion_type || before_markers)
{
m->bytepos = to_byte;
m->charpos = to;
if (m->insertion_type)
adjusted = 1;
}
}
else if (m->bytepos > from_byte)
{
m->bytepos += nbytes;
m->charpos += nchars;
}
}
/* Adjusting only markers whose insertion-type is t may result in
- disordered start and end in overlays, and
- disordered overlays in the slot `overlays_before' of current_buffer. */
if (adjusted)
{
fix_start_end_in_overlays (from, to);
fix_overlays_before (current_buffer, from, to);
}
}
/* Adjust point for an insertion of NBYTES bytes, which are NCHARS characters.
This is used only when the value of point changes due to an insert
or delete; it does not represent a conceptual change in point as a
marker. In particular, point is not crossing any interval
boundaries, so there's no need to use the usual SET_PT macro. In
fact it would be incorrect to do so, because either the old or the
new value of point is out of sync with the current set of
intervals. */
static void
adjust_point (ptrdiff_t nchars, ptrdiff_t nbytes)
{
SET_BUF_PT_BOTH (current_buffer, PT + nchars, PT_BYTE + nbytes);
/* In a single-byte buffer, the two positions must be equal. */
eassert (PT_BYTE >= PT && PT_BYTE - PT <= ZV_BYTE - ZV);
}
\f
/* Adjust markers for a replacement of a text at FROM (FROM_BYTE) of
length OLD_CHARS (OLD_BYTES) to a new text of length NEW_CHARS
(NEW_BYTES). It is assumed that OLD_CHARS > 0, i.e., this is not
an insertion. */
static void
adjust_markers_for_replace (ptrdiff_t from, ptrdiff_t from_byte,
ptrdiff_t old_chars, ptrdiff_t old_bytes,
ptrdiff_t new_chars, ptrdiff_t new_bytes)
{
register struct Lisp_Marker *m;
ptrdiff_t prev_to_byte = from_byte + old_bytes;
ptrdiff_t diff_chars = new_chars - old_chars;
ptrdiff_t diff_bytes = new_bytes - old_bytes;
adjust_suspend_auto_hscroll (from, from + old_chars);
for (m = BUF_MARKERS (current_buffer); m; m = m->next)
{
if (m->bytepos >= prev_to_byte)
{
m->charpos += diff_chars;
m->bytepos += diff_bytes;
}
else if (m->bytepos > from_byte)
{
m->charpos = from;
m->bytepos = from_byte;
}
}
check_markers ();
}
/* Starting at POS (BYTEPOS), find the byte position corresponding to
ENDPOS, which could be either before or after POS. */
static ptrdiff_t
count_bytes (ptrdiff_t pos, ptrdiff_t bytepos, ptrdiff_t endpos)
{
eassert (BEG_BYTE <= bytepos && bytepos <= Z_BYTE
&& BEG <= endpos && endpos <= Z);
if (pos <= endpos)
for ( ; pos < endpos; pos++)
INC_POS (bytepos);
else
for ( ; pos > endpos; pos--)
DEC_POS (bytepos);
return bytepos;
}
/* Adjust byte positions of markers when their character positions
didn't change. This is used in several places that replace text,
but keep the character positions of the markers unchanged -- the
byte positions could still change due to different numbers of bytes
in the new text.
FROM (FROM_BYTE) and TO (TO_BYTE) specify the region of text where
changes have been done. TO_Z, if non-zero, means all the markers
whose positions are after TO should also be adjusted. */
void
adjust_markers_bytepos (ptrdiff_t from, ptrdiff_t from_byte,
ptrdiff_t to, ptrdiff_t to_byte, int to_z)
{
register struct Lisp_Marker *m;
ptrdiff_t beg = from, begbyte = from_byte;
adjust_suspend_auto_hscroll (from, to);
if (Z == Z_BYTE || (!to_z && to == to_byte))
{
/* Make sure each affected marker's bytepos is equal to
its charpos. */
for (m = BUF_MARKERS (current_buffer); m; m = m->next)
{
if (m->bytepos > from_byte
&& (to_z || m->bytepos <= to_byte))
m->bytepos = m->charpos;
}
}
else
{
for (m = BUF_MARKERS (current_buffer); m; m = m->next)
{
/* Recompute each affected marker's bytepos. */
if (m->bytepos > from_byte
&& (to_z || m->bytepos <= to_byte))
{
if (m->charpos < beg
&& beg - m->charpos > m->charpos - from)
{
beg = from;
begbyte = from_byte;
}
m->bytepos = count_bytes (beg, begbyte, m->charpos);
beg = m->charpos;
begbyte = m->bytepos;
}
}
}
/* Make sure cached charpos/bytepos is invalid. */
clear_charpos_cache (current_buffer);
}
\f
void
buffer_overflow (void)
{
error ("Maximum buffer size exceeded");
}
/* Make the gap NBYTES_ADDED bytes longer. */
static void
make_gap_larger (ptrdiff_t nbytes_added)
{
Lisp_Object tem;
ptrdiff_t real_gap_loc;
ptrdiff_t real_gap_loc_byte;
ptrdiff_t old_gap_size;
ptrdiff_t current_size = Z_BYTE - BEG_BYTE + GAP_SIZE;
if (BUF_BYTES_MAX - current_size < nbytes_added)
buffer_overflow ();
/* If we have to get more space, get enough to last a while;
but do not exceed the maximum buffer size. */
nbytes_added = min (nbytes_added + GAP_BYTES_DFL,
BUF_BYTES_MAX - current_size);
enlarge_buffer_text (current_buffer, nbytes_added);
/* Prevent quitting in gap_left. We cannot allow a quit there,
because that would leave the buffer text in an inconsistent
state, with 2 gap holes instead of just one. */
tem = Vinhibit_quit;
Vinhibit_quit = Qt;
real_gap_loc = GPT;
real_gap_loc_byte = GPT_BYTE;
old_gap_size = GAP_SIZE;
/* Call the newly allocated space a gap at the end of the whole space. */
GPT = Z + GAP_SIZE;
GPT_BYTE = Z_BYTE + GAP_SIZE;
GAP_SIZE = nbytes_added;
/* Move the new gap down to be consecutive with the end of the old one. */
gap_left (real_gap_loc + old_gap_size, real_gap_loc_byte + old_gap_size, 1);
/* Now combine the two into one large gap. */
GAP_SIZE += old_gap_size;
GPT = real_gap_loc;
GPT_BYTE = real_gap_loc_byte;
/* Put an anchor. */
*(Z_ADDR) = 0;
Vinhibit_quit = tem;
}
#if defined USE_MMAP_FOR_BUFFERS || defined REL_ALLOC || defined DOUG_LEA_MALLOC
/* Make the gap NBYTES_REMOVED bytes shorter. */
static void
make_gap_smaller (ptrdiff_t nbytes_removed)
{
Lisp_Object tem;
ptrdiff_t real_gap_loc;
ptrdiff_t real_gap_loc_byte;
ptrdiff_t real_Z;
ptrdiff_t real_Z_byte;
ptrdiff_t real_beg_unchanged;
ptrdiff_t new_gap_size;
/* Make sure the gap is at least GAP_BYTES_MIN bytes. */
if (GAP_SIZE - nbytes_removed < GAP_BYTES_MIN)
nbytes_removed = GAP_SIZE - GAP_BYTES_MIN;
/* Prevent quitting in gap_right. We cannot allow a quit there,
because that would leave the buffer text in an inconsistent
state, with 2 gap holes instead of just one. */
tem = Vinhibit_quit;
Vinhibit_quit = Qt;
real_gap_loc = GPT;
real_gap_loc_byte = GPT_BYTE;
new_gap_size = GAP_SIZE - nbytes_removed;
real_Z = Z;
real_Z_byte = Z_BYTE;
real_beg_unchanged = BEG_UNCHANGED;
/* Pretend that the last unwanted part of the gap is the entire gap,
and that the first desired part of the gap is part of the buffer
text. */
memset (GPT_ADDR, 0, new_gap_size);
GPT += new_gap_size;
GPT_BYTE += new_gap_size;
Z += new_gap_size;
Z_BYTE += new_gap_size;
GAP_SIZE = nbytes_removed;
/* Move the unwanted pretend gap to the end of the buffer. */
gap_right (Z, Z_BYTE);
enlarge_buffer_text (current_buffer, -nbytes_removed);
/* Now restore the desired gap. */
GAP_SIZE = new_gap_size;
GPT = real_gap_loc;
GPT_BYTE = real_gap_loc_byte;
Z = real_Z;
Z_BYTE = real_Z_byte;
BEG_UNCHANGED = real_beg_unchanged;
/* Put an anchor. */
*(Z_ADDR) = 0;
Vinhibit_quit = tem;
}
#endif /* USE_MMAP_FOR_BUFFERS || REL_ALLOC || DOUG_LEA_MALLOC */
void
make_gap (ptrdiff_t nbytes_added)
{
if (nbytes_added >= 0)
/* With set-buffer-multibyte on a large buffer, we can end up growing the
* buffer *many* times. Avoid an O(N^2) behavior by increasing by an
* amount at least proportional to the size of the buffer.
* On my test (a 223.9MB zip file on a Thinkpad T61):
* With /5 => 24s
* With /32 => 25s
* With /64 => 26s
* With /128 => 28s
* With /1024 => 51s
* With /4096 => 131s
* With /∞ => gave up after 858s
* Of course, ideally we should never call set-buffer-multibyte on
* a non-empty buffer (e.g. use buffer-swap-text instead).
* We chose /64 because it already brings almost the best performance while
* limiting the potential wasted memory to 1.5%. */
make_gap_larger (max (nbytes_added, (Z - BEG) / 64));
#if defined USE_MMAP_FOR_BUFFERS || defined REL_ALLOC || defined DOUG_LEA_MALLOC
else
make_gap_smaller (-nbytes_added);
#endif
}
/* Add NBYTES to B's gap. It's enough to temporarily
fake current_buffer and avoid real switch to B. */
void
make_gap_1 (struct buffer *b, ptrdiff_t nbytes)
{
struct buffer *oldb = current_buffer;
current_buffer = b;
make_gap (nbytes);
current_buffer = oldb;
}
/* Copy NBYTES bytes of text from FROM_ADDR to TO_ADDR.
FROM_MULTIBYTE says whether the incoming text is multibyte.
TO_MULTIBYTE says whether to store the text as multibyte.
If FROM_MULTIBYTE != TO_MULTIBYTE, we convert.
Return the number of bytes stored at TO_ADDR. */
ptrdiff_t
copy_text (const unsigned char *from_addr, unsigned char *to_addr,
ptrdiff_t nbytes, bool from_multibyte, bool to_multibyte)
{
if (from_multibyte == to_multibyte)
{
memcpy (to_addr, from_addr, nbytes);
return nbytes;
}
else if (from_multibyte)
{
ptrdiff_t nchars = 0;
ptrdiff_t bytes_left = nbytes;
while (bytes_left > 0)
{
int thislen, c;
c = STRING_CHAR_AND_LENGTH (from_addr, thislen);
if (! ASCII_CHAR_P (c))
c &= 0xFF;
*to_addr++ = c;
from_addr += thislen;
bytes_left -= thislen;
nchars++;
}
return nchars;
}
else
{
unsigned char *initial_to_addr = to_addr;
/* Convert single-byte to multibyte. */
while (nbytes > 0)
{
int c = *from_addr++;
if (!ASCII_CHAR_P (c))
{
c = BYTE8_TO_CHAR (c);
to_addr += CHAR_STRING (c, to_addr);
nbytes--;
}
else
/* Special case for speed. */
*to_addr++ = c, nbytes--;
}
return to_addr - initial_to_addr;
}
}
\f
/* Insert a string of specified length before point.
This function judges multibyteness based on
enable_multibyte_characters in the current buffer;
it never converts between single-byte and multibyte.
DO NOT use this for the contents of a Lisp string or a Lisp buffer!
prepare_to_modify_buffer could relocate the text. */
void
insert (const char *string, ptrdiff_t nbytes)
{
if (nbytes > 0)
{
ptrdiff_t len = chars_in_text ((unsigned char *) string, nbytes), opoint;
insert_1_both (string, len, nbytes, 0, 1, 0);
opoint = PT - len;
signal_after_change (opoint, 0, len);
update_compositions (opoint, PT, CHECK_BORDER);
}
}
/* Likewise, but inherit text properties from neighboring characters. */
void
insert_and_inherit (const char *string, ptrdiff_t nbytes)
{
if (nbytes > 0)
{
ptrdiff_t len = chars_in_text ((unsigned char *) string, nbytes), opoint;
insert_1_both (string, len, nbytes, 1, 1, 0);
opoint = PT - len;
signal_after_change (opoint, 0, len);
update_compositions (opoint, PT, CHECK_BORDER);
}
}
/* Insert the character C before point. Do not inherit text properties. */
void
insert_char (int c)
{
unsigned char str[MAX_MULTIBYTE_LENGTH];
int len;
if (! NILP (BVAR (current_buffer, enable_multibyte_characters)))
len = CHAR_STRING (c, str);
else
{
len = 1;
str[0] = c;
}
insert ((char *) str, len);
}
/* Insert the NUL-terminated string S before point. */
void
insert_string (const char *s)
{
insert (s, strlen (s));
}
/* Like `insert' except that all markers pointing at the place where
the insertion happens are adjusted to point after it.
Don't use this function to insert part of a Lisp string,
since gc could happen and relocate it. */
void
insert_before_markers (const char *string, ptrdiff_t nbytes)
{
if (nbytes > 0)
{
ptrdiff_t len = chars_in_text ((unsigned char *) string, nbytes), opoint;
insert_1_both (string, len, nbytes, 0, 1, 1);
opoint = PT - len;
signal_after_change (opoint, 0, len);
update_compositions (opoint, PT, CHECK_BORDER);
}
}
/* Likewise, but inherit text properties from neighboring characters. */
void
insert_before_markers_and_inherit (const char *string,
ptrdiff_t nbytes)
{
if (nbytes > 0)
{
ptrdiff_t len = chars_in_text ((unsigned char *) string, nbytes), opoint;
insert_1_both (string, len, nbytes, 1, 1, 1);
opoint = PT - len;
signal_after_change (opoint, 0, len);
update_compositions (opoint, PT, CHECK_BORDER);
}
}
#ifdef BYTE_COMBINING_DEBUG
/* See if the bytes before POS/POS_BYTE combine with bytes
at the start of STRING to form a single character.
If so, return the number of bytes at the start of STRING
which combine in this way. Otherwise, return 0. */
int
count_combining_before (const unsigned char *string, ptrdiff_t length,
ptrdiff_t pos, ptrdiff_t pos_byte)
{
int len, combining_bytes;
const unsigned char *p;
if (NILP (current_buffer->enable_multibyte_characters))
return 0;
/* At first, we can exclude the following cases:
(1) STRING[0] can't be a following byte of multibyte sequence.
(2) POS is the start of the current buffer.
(3) A character before POS is not a multibyte character. */
if (length == 0 || CHAR_HEAD_P (*string)) /* case (1) */
return 0;
if (pos_byte == BEG_BYTE) /* case (2) */
return 0;
len = 1;
p = BYTE_POS_ADDR (pos_byte - 1);
while (! CHAR_HEAD_P (*p)) p--, len++;
if (! LEADING_CODE_P (*p)) /* case (3) */
return 0;
combining_bytes = BYTES_BY_CHAR_HEAD (*p) - len;
if (combining_bytes <= 0)
/* The character preceding POS is, complete and no room for
combining bytes (combining_bytes == 0), or an independent 8-bit
character (combining_bytes < 0). */
return 0;
/* We have a combination situation. Count the bytes at STRING that
may combine. */
p = string + 1;
while (!CHAR_HEAD_P (*p) && p < string + length)
p++;
return (combining_bytes < p - string ? combining_bytes : p - string);
}
/* See if the bytes after POS/POS_BYTE combine with bytes
at the end of STRING to form a single character.
If so, return the number of bytes after POS/POS_BYTE
which combine in this way. Otherwise, return 0. */
int
count_combining_after (const unsigned char *string,
ptrdiff_t length, ptrdiff_t pos, ptrdiff_t pos_byte)
{
ptrdiff_t opos_byte = pos_byte;
ptrdiff_t i;
ptrdiff_t bytes;
unsigned char *bufp;
if (NILP (current_buffer->enable_multibyte_characters))
return 0;
/* At first, we can exclude the following cases:
(1) The last byte of STRING is an ASCII.
(2) POS is the last of the current buffer.
(3) A character at POS can't be a following byte of multibyte
character. */
if (length > 0 && ASCII_CHAR_P (string[length - 1])) /* case (1) */
return 0;
if (pos_byte == Z_BYTE) /* case (2) */
return 0;
bufp = BYTE_POS_ADDR (pos_byte);
if (CHAR_HEAD_P (*bufp)) /* case (3) */
return 0;
i = length - 1;
while (i >= 0 && ! CHAR_HEAD_P (string[i]))
{
i--;
}
if (i < 0)
{
/* All characters in STRING are not character head. We must
check also preceding bytes at POS. We are sure that the gap
is at POS. */
unsigned char *p = BEG_ADDR;
i = pos_byte - 2;
while (i >= 0 && ! CHAR_HEAD_P (p[i]))
i--;
if (i < 0 || !LEADING_CODE_P (p[i]))
return 0;
bytes = BYTES_BY_CHAR_HEAD (p[i]);
return (bytes <= pos_byte - 1 - i + length
? 0
: bytes - (pos_byte - 1 - i + length));
}
if (!LEADING_CODE_P (string[i]))
return 0;
bytes = BYTES_BY_CHAR_HEAD (string[i]) - (length - i);
bufp++, pos_byte++;
while (!CHAR_HEAD_P (*bufp)) bufp++, pos_byte++;
return (bytes <= pos_byte - opos_byte ? bytes : pos_byte - opos_byte);
}
#endif
\f
/* Insert a sequence of NCHARS chars which occupy NBYTES bytes
starting at STRING. INHERIT non-zero means inherit the text
properties from neighboring characters; zero means inserted text
will have no text properties. PREPARE non-zero means call
prepare_to_modify_buffer, which checks that the region is not
read-only, and calls before-change-function and any modification
properties the text may have. BEFORE_MARKERS non-zero means adjust
all markers that point at the insertion place to point after it. */
void
insert_1_both (const char *string,
ptrdiff_t nchars, ptrdiff_t nbytes,
bool inherit, bool prepare, bool before_markers)
{
if (nchars == 0)
return;
if (NILP (BVAR (current_buffer, enable_multibyte_characters)))
nchars = nbytes;
if (prepare)
/* Do this before moving and increasing the gap,
because the before-change hooks might move the gap
or make it smaller. */
prepare_to_modify_buffer (PT, PT, NULL);
if (PT != GPT)
move_gap_both (PT, PT_BYTE);
if (GAP_SIZE < nbytes)
make_gap (nbytes - GAP_SIZE);
#ifdef BYTE_COMBINING_DEBUG
if (count_combining_before (string, nbytes, PT, PT_BYTE)
|| count_combining_after (string, nbytes, PT, PT_BYTE))
emacs_abort ();
#endif
/* Record deletion of the surrounding text that combines with
the insertion. This, together with recording the insertion,
will add up to the right stuff in the undo list. */
record_insert (PT, nchars);
modiff_incr (&MODIFF);
CHARS_MODIFF = MODIFF;
memcpy (GPT_ADDR, string, nbytes);
GAP_SIZE -= nbytes;
GPT += nchars;
ZV += nchars;
Z += nchars;
GPT_BYTE += nbytes;
ZV_BYTE += nbytes;
Z_BYTE += nbytes;
if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */
eassert (GPT <= GPT_BYTE);
/* The insert may have been in the unchanged region, so check again. */
if (Z - GPT < END_UNCHANGED)
END_UNCHANGED = Z - GPT;
adjust_overlays_for_insert (PT, nchars);
adjust_markers_for_insert (PT, PT_BYTE,
PT + nchars, PT_BYTE + nbytes,
before_markers);
offset_intervals (current_buffer, PT, nchars);
if (!inherit && buffer_intervals (current_buffer))
set_text_properties (make_fixnum (PT), make_fixnum (PT + nchars),
Qnil, Qnil, Qnil);
adjust_point (nchars, nbytes);
check_markers ();
}
\f
/* Insert the part of the text of STRING, a Lisp object assumed to be
of type string, consisting of the LENGTH characters (LENGTH_BYTE bytes)
starting at position POS / POS_BYTE. If the text of STRING has properties,
copy them into the buffer.
It does not work to use `insert' for this, because a GC could happen
before we copy the stuff into the buffer, and relocate the string
without insert noticing. */
void
insert_from_string (Lisp_Object string, ptrdiff_t pos, ptrdiff_t pos_byte,
ptrdiff_t length, ptrdiff_t length_byte, bool inherit)
{
ptrdiff_t opoint = PT;
if (SCHARS (string) == 0)
return;
insert_from_string_1 (string, pos, pos_byte, length, length_byte,
inherit, 0);
signal_after_change (opoint, 0, PT - opoint);
update_compositions (opoint, PT, CHECK_BORDER);
}
/* Like `insert_from_string' except that all markers pointing
at the place where the insertion happens are adjusted to point after it. */
void
insert_from_string_before_markers (Lisp_Object string,
ptrdiff_t pos, ptrdiff_t pos_byte,
ptrdiff_t length, ptrdiff_t length_byte,
bool inherit)
{
ptrdiff_t opoint = PT;
if (SCHARS (string) == 0)
return;
insert_from_string_1 (string, pos, pos_byte, length, length_byte,
inherit, 1);
signal_after_change (opoint, 0, PT - opoint);
update_compositions (opoint, PT, CHECK_BORDER);
}
/* Subroutine of the insertion functions above. */
static void
insert_from_string_1 (Lisp_Object string, ptrdiff_t pos, ptrdiff_t pos_byte,
ptrdiff_t nchars, ptrdiff_t nbytes,
bool inherit, bool before_markers)
{
ptrdiff_t outgoing_nbytes = nbytes;
INTERVAL intervals;
/* Make OUTGOING_NBYTES describe the text
as it will be inserted in this buffer. */
if (NILP (BVAR (current_buffer, enable_multibyte_characters)))
outgoing_nbytes = nchars;
else if (! STRING_MULTIBYTE (string))
outgoing_nbytes
= count_size_as_multibyte (SDATA (string) + pos_byte,
nbytes);
/* Do this before moving and increasing the gap,
because the before-change hooks might move the gap
or make it smaller. */
prepare_to_modify_buffer (PT, PT, NULL);
if (PT != GPT)
move_gap_both (PT, PT_BYTE);
if (GAP_SIZE < outgoing_nbytes)
make_gap (outgoing_nbytes - GAP_SIZE);
/* Copy the string text into the buffer, perhaps converting
between single-byte and multibyte. */
copy_text (SDATA (string) + pos_byte, GPT_ADDR, nbytes,
STRING_MULTIBYTE (string),
! NILP (BVAR (current_buffer, enable_multibyte_characters)));
#ifdef BYTE_COMBINING_DEBUG
/* We have copied text into the gap, but we have not altered
PT or PT_BYTE yet. So we can pass PT and PT_BYTE
to these functions and get the same results as we would
have got earlier on. Meanwhile, PT_ADDR does point to
the text that has been stored by copy_text. */
if (count_combining_before (GPT_ADDR, outgoing_nbytes, PT, PT_BYTE)
|| count_combining_after (GPT_ADDR, outgoing_nbytes, PT, PT_BYTE))
emacs_abort ();
#endif
record_insert (PT, nchars);
modiff_incr (&MODIFF);
CHARS_MODIFF = MODIFF;
GAP_SIZE -= outgoing_nbytes;
GPT += nchars;
ZV += nchars;
Z += nchars;
GPT_BYTE += outgoing_nbytes;
ZV_BYTE += outgoing_nbytes;
Z_BYTE += outgoing_nbytes;
if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */
eassert (GPT <= GPT_BYTE);
/* The insert may have been in the unchanged region, so check again. */
if (Z - GPT < END_UNCHANGED)
END_UNCHANGED = Z - GPT;
adjust_overlays_for_insert (PT, nchars);
adjust_markers_for_insert (PT, PT_BYTE, PT + nchars,
PT_BYTE + outgoing_nbytes,
before_markers);
offset_intervals (current_buffer, PT, nchars);
intervals = string_intervals (string);
/* Get the intervals for the part of the string we are inserting. */
if (nbytes < SBYTES (string))
intervals = copy_intervals (intervals, pos, nchars);
/* Insert those intervals. */
graft_intervals_into_buffer (intervals, PT, nchars,
current_buffer, inherit);
adjust_point (nchars, outgoing_nbytes);
check_markers ();
}
\f
/* Insert a sequence of NCHARS chars which occupy NBYTES bytes
starting at GAP_END_ADDR - NBYTES (if text_at_gap_tail) and at
GPT_ADDR (if not text_at_gap_tail).
Contrary to insert_from_gap, this does not invalidate any cache,
nor update any markers, nor record any buffer modification information
of any sort. */
void
insert_from_gap_1 (ptrdiff_t nchars, ptrdiff_t nbytes, bool text_at_gap_tail)
{
eassert (NILP (BVAR (current_buffer, enable_multibyte_characters))
? nchars == nbytes : nchars <= nbytes);
GAP_SIZE -= nbytes;
if (! text_at_gap_tail)
{
GPT += nchars;
GPT_BYTE += nbytes;
}
ZV += nchars;
Z += nchars;
ZV_BYTE += nbytes;
Z_BYTE += nbytes;
/* Put an anchor to ensure multi-byte form ends at gap. */
if (GAP_SIZE > 0) *(GPT_ADDR) = 0;
eassert (GPT <= GPT_BYTE);
}
/* Insert a sequence of NCHARS chars which occupy NBYTES bytes
starting at GAP_END_ADDR - NBYTES (if text_at_gap_tail) and at
GPT_ADDR (if not text_at_gap_tail). */
void
insert_from_gap (ptrdiff_t nchars, ptrdiff_t nbytes, bool text_at_gap_tail)
{
ptrdiff_t ins_charpos = GPT, ins_bytepos = GPT_BYTE;
if (NILP (BVAR (current_buffer, enable_multibyte_characters)))
nchars = nbytes;
/* No need to call prepare_to_modify_buffer, since this is called
from places that replace some region with a different text, so
prepare_to_modify_buffer was already called by the deletion part
of this dance. */
invalidate_buffer_caches (current_buffer, GPT, GPT);
record_insert (GPT, nchars);
modiff_incr (&MODIFF);
insert_from_gap_1 (nchars, nbytes, text_at_gap_tail);
adjust_overlays_for_insert (ins_charpos, nchars);
adjust_markers_for_insert (ins_charpos, ins_bytepos,
ins_charpos + nchars, ins_bytepos + nbytes, 0);
if (buffer_intervals (current_buffer))
{
offset_intervals (current_buffer, ins_charpos, nchars);
graft_intervals_into_buffer (NULL, ins_charpos, nchars,
current_buffer, 0);
}
if (ins_charpos < PT)
adjust_point (nchars, nbytes);
check_markers ();
}
\f
/* Insert text from BUF, NCHARS characters starting at CHARPOS, into the
current buffer. If the text in BUF has properties, they are absorbed
into the current buffer.
It does not work to use `insert' for this, because a malloc could happen
and relocate BUF's text before the copy happens. */
void
insert_from_buffer (struct buffer *buf,
ptrdiff_t charpos, ptrdiff_t nchars, bool inherit)
{
ptrdiff_t opoint = PT;
insert_from_buffer_1 (buf, charpos, nchars, inherit);
signal_after_change (opoint, 0, PT - opoint);
update_compositions (opoint, PT, CHECK_BORDER);
}
static void
insert_from_buffer_1 (struct buffer *buf,
ptrdiff_t from, ptrdiff_t nchars, bool inherit)
{
ptrdiff_t chunk, chunk_expanded;
ptrdiff_t from_byte = buf_charpos_to_bytepos (buf, from);
ptrdiff_t to_byte = buf_charpos_to_bytepos (buf, from + nchars);
ptrdiff_t incoming_nbytes = to_byte - from_byte;
ptrdiff_t outgoing_nbytes = incoming_nbytes;
INTERVAL intervals;
if (nchars == 0)
return;
/* Make OUTGOING_NBYTES describe the text
as it will be inserted in this buffer. */
if (NILP (BVAR (current_buffer, enable_multibyte_characters)))
outgoing_nbytes = nchars;
else if (NILP (BVAR (buf, enable_multibyte_characters)))
{
ptrdiff_t outgoing_before_gap = 0;
ptrdiff_t outgoing_after_gap = 0;
if (from < BUF_GPT (buf))
{
chunk = BUF_GPT_BYTE (buf) - from_byte;
if (chunk > incoming_nbytes)
chunk = incoming_nbytes;
outgoing_before_gap
= count_size_as_multibyte (BUF_BYTE_ADDRESS (buf, from_byte),
chunk);
}
else
chunk = 0;
if (chunk < incoming_nbytes)
outgoing_after_gap
= count_size_as_multibyte (BUF_BYTE_ADDRESS (buf,
from_byte + chunk),
incoming_nbytes - chunk);
outgoing_nbytes = outgoing_before_gap + outgoing_after_gap;
}
/* Do this before moving and increasing the gap,
because the before-change hooks might move the gap
or make it smaller. */
prepare_to_modify_buffer (PT, PT, NULL);
if (PT != GPT)
move_gap_both (PT, PT_BYTE);
if (GAP_SIZE < outgoing_nbytes)
make_gap (outgoing_nbytes - GAP_SIZE);
if (from < BUF_GPT (buf))
{
chunk = BUF_GPT_BYTE (buf) - from_byte;
if (chunk > incoming_nbytes)
chunk = incoming_nbytes;
/* Record number of output bytes, so we know where
to put the output from the second copy_text. */
chunk_expanded
= copy_text (BUF_BYTE_ADDRESS (buf, from_byte),
GPT_ADDR, chunk,
! NILP (BVAR (buf, enable_multibyte_characters)),
! NILP (BVAR (current_buffer, enable_multibyte_characters)));
}
else
chunk_expanded = chunk = 0;
if (chunk < incoming_nbytes)
copy_text (BUF_BYTE_ADDRESS (buf, from_byte + chunk),
GPT_ADDR + chunk_expanded, incoming_nbytes - chunk,
! NILP (BVAR (buf, enable_multibyte_characters)),
! NILP (BVAR (current_buffer, enable_multibyte_characters)));
#ifdef BYTE_COMBINING_DEBUG
/* We have copied text into the gap, but we have not altered
PT or PT_BYTE yet. So we can pass PT and PT_BYTE
to these functions and get the same results as we would
have got earlier on. Meanwhile, GPT_ADDR does point to
the text that has been stored by copy_text. */
if (count_combining_before (GPT_ADDR, outgoing_nbytes, PT, PT_BYTE)
|| count_combining_after (GPT_ADDR, outgoing_nbytes, PT, PT_BYTE))
emacs_abort ();
#endif
record_insert (PT, nchars);
modiff_incr (&MODIFF);
CHARS_MODIFF = MODIFF;
GAP_SIZE -= outgoing_nbytes;
GPT += nchars;
ZV += nchars;
Z += nchars;
GPT_BYTE += outgoing_nbytes;
ZV_BYTE += outgoing_nbytes;
Z_BYTE += outgoing_nbytes;
if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */
eassert (GPT <= GPT_BYTE);
/* The insert may have been in the unchanged region, so check again. */
if (Z - GPT < END_UNCHANGED)
END_UNCHANGED = Z - GPT;
adjust_overlays_for_insert (PT, nchars);
adjust_markers_for_insert (PT, PT_BYTE, PT + nchars,
PT_BYTE + outgoing_nbytes,
0);
offset_intervals (current_buffer, PT, nchars);
/* Get the intervals for the part of the string we are inserting. */
intervals = buffer_intervals (buf);
if (nchars < BUF_Z (buf) - BUF_BEG (buf))
{
if (buf == current_buffer && PT <= from)
from += nchars;
intervals = copy_intervals (intervals, from, nchars);
}
/* Insert those intervals. */
graft_intervals_into_buffer (intervals, PT, nchars, current_buffer, inherit);
adjust_point (nchars, outgoing_nbytes);
}
\f
/* Record undo information and adjust markers and position keepers for
a replacement of a text PREV_TEXT at FROM to a new text of LEN
chars (LEN_BYTE bytes) which resides in the gap just after
GPT_ADDR.
PREV_TEXT nil means the new text was just inserted. */
static void
adjust_after_replace (ptrdiff_t from, ptrdiff_t from_byte,
Lisp_Object prev_text, ptrdiff_t len, ptrdiff_t len_byte)
{
ptrdiff_t nchars_del = 0, nbytes_del = 0;
#ifdef BYTE_COMBINING_DEBUG
if (count_combining_before (GPT_ADDR, len_byte, from, from_byte)
|| count_combining_after (GPT_ADDR, len_byte, from, from_byte))
emacs_abort ();
#endif
if (STRINGP (prev_text))
{
nchars_del = SCHARS (prev_text);
nbytes_del = SBYTES (prev_text);
}
/* Update various buffer positions for the new text. */
GAP_SIZE -= len_byte;
ZV += len; Z += len;
ZV_BYTE += len_byte; Z_BYTE += len_byte;
GPT += len; GPT_BYTE += len_byte;
if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */
if (nchars_del > 0)
adjust_markers_for_replace (from, from_byte, nchars_del, nbytes_del,
len, len_byte);
else
adjust_markers_for_insert (from, from_byte,
from + len, from_byte + len_byte, 0);
if (nchars_del > 0)
record_delete (from, prev_text, false);
record_insert (from, len);
if (len > nchars_del)
adjust_overlays_for_insert (from, len - nchars_del);
else if (len < nchars_del)
adjust_overlays_for_delete (from, nchars_del - len);
offset_intervals (current_buffer, from, len - nchars_del);
if (from < PT)
adjust_point (len - nchars_del, len_byte - nbytes_del);
/* As byte combining will decrease Z, we must check this again. */
if (Z - GPT < END_UNCHANGED)
END_UNCHANGED = Z - GPT;
check_markers ();
if (len == 0)
evaporate_overlays (from);
modiff_incr (&MODIFF);
CHARS_MODIFF = MODIFF;
}
/* Record undo information, adjust markers and position keepers for an
insertion of a text from FROM (FROM_BYTE) to TO (TO_BYTE). The
text already exists in the current buffer but character length (TO
- FROM) may be incorrect, the correct length is NEWLEN. */
void
adjust_after_insert (ptrdiff_t from, ptrdiff_t from_byte,
ptrdiff_t to, ptrdiff_t to_byte, ptrdiff_t newlen)
{
ptrdiff_t len = to - from, len_byte = to_byte - from_byte;
if (GPT != to)
move_gap_both (to, to_byte);
GAP_SIZE += len_byte;
GPT -= len; GPT_BYTE -= len_byte;
ZV -= len; ZV_BYTE -= len_byte;
Z -= len; Z_BYTE -= len_byte;
adjust_after_replace (from, from_byte, Qnil, newlen, len_byte);
}
\f
/* Replace the text from character positions FROM to TO with NEW,
If PREPARE, call prepare_to_modify_buffer.
If INHERIT, the newly inserted text should inherit text properties
from the surrounding non-deleted text.
If ADJUST_MATCH_DATA, then adjust the match data before calling
signal_after_change. */
/* Note that this does not yet handle markers quite right.
Also it needs to record a single undo-entry that does a replacement
rather than a separate delete and insert.
That way, undo will also handle markers properly.
But if MARKERS is 0, don't relocate markers. */
void
replace_range (ptrdiff_t from, ptrdiff_t to, Lisp_Object new,
bool prepare, bool inherit, bool markers,
bool adjust_match_data)
{
ptrdiff_t inschars = SCHARS (new);
ptrdiff_t insbytes = SBYTES (new);
ptrdiff_t from_byte, to_byte;
ptrdiff_t nbytes_del, nchars_del;
INTERVAL intervals;
ptrdiff_t outgoing_insbytes = insbytes;
Lisp_Object deletion;
check_markers ();
deletion = Qnil;
if (prepare)
{
ptrdiff_t range_length = to - from;
prepare_to_modify_buffer (from, to, &from);
to = from + range_length;
}
/* Make args be valid. */
if (from < BEGV)
from = BEGV;
if (to > ZV)
to = ZV;
from_byte = CHAR_TO_BYTE (from);
to_byte = CHAR_TO_BYTE (to);
nchars_del = to - from;
nbytes_del = to_byte - from_byte;
if (nbytes_del <= 0 && insbytes == 0)
return;
/* Make OUTGOING_INSBYTES describe the text
as it will be inserted in this buffer. */
if (NILP (BVAR (current_buffer, enable_multibyte_characters)))
outgoing_insbytes = inschars;
else if (! STRING_MULTIBYTE (new))
outgoing_insbytes
= count_size_as_multibyte (SDATA (new), insbytes);
/* Make sure the gap is somewhere in or next to what we are deleting. */
if (from > GPT)
gap_right (from, from_byte);
if (to < GPT)
gap_left (to, to_byte, 0);
/* Even if we don't record for undo, we must keep the original text
because we may have to recover it because of inappropriate byte
combining. */
if (! EQ (BVAR (current_buffer, undo_list), Qt))
deletion = make_buffer_string_both (from, from_byte, to, to_byte, 1);
GAP_SIZE += nbytes_del;
ZV -= nchars_del;
Z -= nchars_del;
ZV_BYTE -= nbytes_del;
Z_BYTE -= nbytes_del;
GPT = from;
GPT_BYTE = from_byte;
if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */
eassert (GPT <= GPT_BYTE);
if (GPT - BEG < BEG_UNCHANGED)
BEG_UNCHANGED = GPT - BEG;
if (Z - GPT < END_UNCHANGED)
END_UNCHANGED = Z - GPT;
if (GAP_SIZE < outgoing_insbytes)
make_gap (outgoing_insbytes - GAP_SIZE);
/* Copy the string text into the buffer, perhaps converting
between single-byte and multibyte. */
copy_text (SDATA (new), GPT_ADDR, insbytes,
STRING_MULTIBYTE (new),
! NILP (BVAR (current_buffer, enable_multibyte_characters)));
#ifdef BYTE_COMBINING_DEBUG
/* We have copied text into the gap, but we have not marked
it as part of the buffer. So we can use the old FROM and FROM_BYTE
here, for both the previous text and the following text.
Meanwhile, GPT_ADDR does point to
the text that has been stored by copy_text. */
if (count_combining_before (GPT_ADDR, outgoing_insbytes, from, from_byte)
|| count_combining_after (GPT_ADDR, outgoing_insbytes, from, from_byte))
emacs_abort ();
#endif
/* Record the insertion first, so that when we undo,
the deletion will be undone first. Thus, undo
will insert before deleting, and thus will keep
the markers before and after this text separate. */
if (!NILP (deletion))
{
record_insert (from + SCHARS (deletion), inschars);
record_delete (from, deletion, false);
}
GAP_SIZE -= outgoing_insbytes;
GPT += inschars;
ZV += inschars;
Z += inschars;
GPT_BYTE += outgoing_insbytes;
ZV_BYTE += outgoing_insbytes;
Z_BYTE += outgoing_insbytes;
if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */
eassert (GPT <= GPT_BYTE);
/* Adjust markers for the deletion and the insertion. */
if (markers)
adjust_markers_for_replace (from, from_byte, nchars_del, nbytes_del,
inschars, outgoing_insbytes);
else
{
/* The character positions of the markers remain intact, but we
still need to update their byte positions, because the
deleted and the inserted text might have multibyte sequences
which make the original byte positions of the markers
invalid. */
adjust_markers_bytepos (from, from_byte, from + inschars,
from_byte + outgoing_insbytes, 1);
}
/* Adjust the overlay center as needed. This must be done after
adjusting the markers that bound the overlays. */
adjust_overlays_for_delete (from, nchars_del);
adjust_overlays_for_insert (from, inschars);
offset_intervals (current_buffer, from, inschars - nchars_del);
/* Get the intervals for the part of the string we are inserting--
not including the combined-before bytes. */
intervals = string_intervals (new);
/* Insert those intervals. */
graft_intervals_into_buffer (intervals, from, inschars,
current_buffer, inherit);
/* Relocate point as if it were a marker. */
if (from < PT)
adjust_point ((from + inschars - (PT < to ? PT : to)),
(from_byte + outgoing_insbytes
- (PT_BYTE < to_byte ? PT_BYTE : to_byte)));
if (outgoing_insbytes == 0)
evaporate_overlays (from);
check_markers ();
modiff_incr (&MODIFF);
CHARS_MODIFF = MODIFF;
if (adjust_match_data)
update_search_regs (from, to, from + SCHARS (new));
signal_after_change (from, nchars_del, GPT - from);
update_compositions (from, GPT, CHECK_BORDER);
}
\f
/* Replace the text from character positions FROM to TO with
the text in INS of length INSCHARS.
Keep the text properties that applied to the old characters
(extending them to all the new chars if there are more new chars).
Note that this does not yet handle markers quite right.
If MARKERS, relocate markers.
Unlike most functions at this level, never call
prepare_to_modify_buffer and never call signal_after_change. */
void
replace_range_2 (ptrdiff_t from, ptrdiff_t from_byte,
ptrdiff_t to, ptrdiff_t to_byte,
const char *ins, ptrdiff_t inschars, ptrdiff_t insbytes,
bool markers)
{
ptrdiff_t nbytes_del, nchars_del;
check_markers ();
nchars_del = to - from;
nbytes_del = to_byte - from_byte;
if (nbytes_del <= 0 && insbytes == 0)
return;
/* Make sure the gap is somewhere in or next to what we are deleting. */
if (from > GPT)
gap_right (from, from_byte);
if (to < GPT)
gap_left (to, to_byte, 0);
GAP_SIZE += nbytes_del;
ZV -= nchars_del;
Z -= nchars_del;
ZV_BYTE -= nbytes_del;
Z_BYTE -= nbytes_del;
GPT = from;
GPT_BYTE = from_byte;
if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */
eassert (GPT <= GPT_BYTE);
if (GPT - BEG < BEG_UNCHANGED)
BEG_UNCHANGED = GPT - BEG;
if (Z - GPT < END_UNCHANGED)
END_UNCHANGED = Z - GPT;
if (GAP_SIZE < insbytes)
make_gap (insbytes - GAP_SIZE);
/* Copy the replacement text into the buffer. */
memcpy (GPT_ADDR, ins, insbytes);
#ifdef BYTE_COMBINING_DEBUG
/* We have copied text into the gap, but we have not marked
it as part of the buffer. So we can use the old FROM and FROM_BYTE
here, for both the previous text and the following text.
Meanwhile, GPT_ADDR does point to
the text that has been stored by copy_text. */
if (count_combining_before (GPT_ADDR, insbytes, from, from_byte)
|| count_combining_after (GPT_ADDR, insbytes, from, from_byte))
emacs_abort ();
#endif
GAP_SIZE -= insbytes;
GPT += inschars;
ZV += inschars;
Z += inschars;
GPT_BYTE += insbytes;
ZV_BYTE += insbytes;
Z_BYTE += insbytes;
if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */
eassert (GPT <= GPT_BYTE);
/* Adjust markers for the deletion and the insertion. */
if (! (nchars_del == 1 && inschars == 1 && nbytes_del == insbytes))
{
if (markers)
adjust_markers_for_replace (from, from_byte, nchars_del, nbytes_del,
inschars, insbytes);
else
{
/* The character positions of the markers remain intact, but
we still need to update their byte positions, because the
deleted and the inserted text might have multibyte
sequences which make the original byte positions of the
markers invalid. */
adjust_markers_bytepos (from, from_byte, from + inschars,
from_byte + insbytes, 1);
}
}
/* Adjust the overlay center as needed. This must be done after
adjusting the markers that bound the overlays. */
if (nchars_del != inschars)
{
adjust_overlays_for_insert (from, inschars);
adjust_overlays_for_delete (from + inschars, nchars_del);
}
offset_intervals (current_buffer, from, inschars - nchars_del);
/* Relocate point as if it were a marker. */
if (from < PT && (nchars_del != inschars || nbytes_del != insbytes))
{
if (PT < to)
/* PT was within the deleted text. Move it to FROM. */
adjust_point (from - PT, from_byte - PT_BYTE);
else
adjust_point (inschars - nchars_del, insbytes - nbytes_del);
}
if (insbytes == 0)
evaporate_overlays (from);
check_markers ();
modiff_incr (&MODIFF);
CHARS_MODIFF = MODIFF;
}
\f
/* Delete characters in current buffer
from FROM up to (but not including) TO.
If TO comes before FROM, we delete nothing. */
void
del_range (ptrdiff_t from, ptrdiff_t to)
{
del_range_1 (from, to, 1, 0);
}
/* Like del_range; PREPARE says whether to call prepare_to_modify_buffer.
RET_STRING says to return the deleted text. */
Lisp_Object
del_range_1 (ptrdiff_t from, ptrdiff_t to, bool prepare, bool ret_string)
{
ptrdiff_t from_byte, to_byte;
Lisp_Object deletion;
/* Make args be valid */
if (from < BEGV)
from = BEGV;
if (to > ZV)
to = ZV;
if (to <= from)
return Qnil;
if (prepare)
{
ptrdiff_t range_length = to - from;
prepare_to_modify_buffer (from, to, &from);
to = min (ZV, from + range_length);
}
from_byte = CHAR_TO_BYTE (from);
to_byte = CHAR_TO_BYTE (to);
deletion = del_range_2 (from, from_byte, to, to_byte, ret_string);
signal_after_change (from, to - from, 0);
update_compositions (from, from, CHECK_HEAD);
return deletion;
}
/* Like del_range_1 but args are byte positions, not char positions. */
void
del_range_byte (ptrdiff_t from_byte, ptrdiff_t to_byte)
{
ptrdiff_t from, to;
/* Make args be valid. */
if (from_byte < BEGV_BYTE)
from_byte = BEGV_BYTE;
if (to_byte > ZV_BYTE)
to_byte = ZV_BYTE;
if (to_byte <= from_byte)
return;
from = BYTE_TO_CHAR (from_byte);
to = BYTE_TO_CHAR (to_byte);
{
ptrdiff_t old_from = from, old_to = Z - to;
ptrdiff_t range_length = to - from;
prepare_to_modify_buffer (from, to, &from);
to = from + range_length;
if (old_from != from)
from_byte = CHAR_TO_BYTE (from);
if (to > ZV)
{
to = ZV;
to_byte = ZV_BYTE;
}
else if (old_to == Z - to)
to_byte = CHAR_TO_BYTE (to);
}
del_range_2 (from, from_byte, to, to_byte, 0);
signal_after_change (from, to - from, 0);
update_compositions (from, from, CHECK_HEAD);
}
/* Like del_range_1, but positions are specified both as charpos
and bytepos. */
void
del_range_both (ptrdiff_t from, ptrdiff_t from_byte,
ptrdiff_t to, ptrdiff_t to_byte, bool prepare)
{
/* Make args be valid */
if (from_byte < BEGV_BYTE)
from_byte = BEGV_BYTE;
if (to_byte > ZV_BYTE)
to_byte = ZV_BYTE;
if (to_byte <= from_byte)
return;
if (from < BEGV)
from = BEGV;
if (to > ZV)
to = ZV;
if (prepare)
{
ptrdiff_t old_from = from, old_to = Z - to;
ptrdiff_t range_length = to - from;
prepare_to_modify_buffer (from, to, &from);
to = from + range_length;
if (old_from != from)
from_byte = CHAR_TO_BYTE (from);
if (to > ZV)
{
to = ZV;
to_byte = ZV_BYTE;
}
else if (old_to == Z - to)
to_byte = CHAR_TO_BYTE (to);
}
del_range_2 (from, from_byte, to, to_byte, 0);
signal_after_change (from, to - from, 0);
update_compositions (from, from, CHECK_HEAD);
}
/* Delete a range of text, specified both as character positions
and byte positions. FROM and TO are character positions,
while FROM_BYTE and TO_BYTE are byte positions.
If RET_STRING, the deleted area is returned as a string. */
Lisp_Object
del_range_2 (ptrdiff_t from, ptrdiff_t from_byte,
ptrdiff_t to, ptrdiff_t to_byte, bool ret_string)
{
ptrdiff_t nbytes_del, nchars_del;
Lisp_Object deletion;
check_markers ();
nchars_del = to - from;
nbytes_del = to_byte - from_byte;
/* Make sure the gap is somewhere in or next to what we are deleting. */
if (from > GPT)
gap_right (from, from_byte);
if (to < GPT)
gap_left (to, to_byte, 0);
#ifdef BYTE_COMBINING_DEBUG
if (count_combining_before (BUF_BYTE_ADDRESS (current_buffer, to_byte),
Z_BYTE - to_byte, from, from_byte))
emacs_abort ();
#endif
if (ret_string || ! EQ (BVAR (current_buffer, undo_list), Qt))
deletion = make_buffer_string_both (from, from_byte, to, to_byte, 1);
else
deletion = Qnil;
/* Record marker adjustments, and text deletion into undo
history. */
record_delete (from, deletion, true);
/* Relocate all markers pointing into the new, larger gap to point
at the end of the text before the gap. */
adjust_markers_for_delete (from, from_byte, to, to_byte);
modiff_incr (&MODIFF);
CHARS_MODIFF = MODIFF;
/* Relocate point as if it were a marker. */
if (from < PT)
adjust_point (from - (PT < to ? PT : to),
from_byte - (PT_BYTE < to_byte ? PT_BYTE : to_byte));
offset_intervals (current_buffer, from, - nchars_del);
/* Adjust the overlay center as needed. This must be done after
adjusting the markers that bound the overlays. */
adjust_overlays_for_delete (from, nchars_del);
GAP_SIZE += nbytes_del;
ZV_BYTE -= nbytes_del;
Z_BYTE -= nbytes_del;
ZV -= nchars_del;
Z -= nchars_del;
GPT = from;
GPT_BYTE = from_byte;
if (GAP_SIZE > 0 && !current_buffer->text->inhibit_shrinking)
/* Put an anchor, unless called from decode_coding_object which
needs to access the previous gap contents. */
*(GPT_ADDR) = 0;
eassert (GPT <= GPT_BYTE);
if (GPT - BEG < BEG_UNCHANGED)
BEG_UNCHANGED = GPT - BEG;
if (Z - GPT < END_UNCHANGED)
END_UNCHANGED = Z - GPT;
check_markers ();
evaporate_overlays (from);
return deletion;
}
/* Call this if you're about to change the text of current buffer
from character positions START to END. This checks the read-only
properties of the region, calls the necessary modification hooks,
and warns the next redisplay that it should pay attention to that
area. */
void
modify_text (ptrdiff_t start, ptrdiff_t end)
{
prepare_to_modify_buffer (start, end, NULL);
BUF_COMPUTE_UNCHANGED (current_buffer, start - 1, end);
if (MODIFF <= SAVE_MODIFF)
record_first_change ();
modiff_incr (&MODIFF);
CHARS_MODIFF = MODIFF;
bset_point_before_scroll (current_buffer, Qnil);
}
/* Signal that we are about to make a change that may result in new
undo information.
*/
static void
run_undoable_change (void)
{
if (EQ (BVAR (current_buffer, undo_list), Qt))
return;
call0 (Qundo_auto__undoable_change);
}
/* Check that it is okay to modify the buffer between START and END,
which are char positions.
Run the before-change-function, if any. If intervals are in use,
verify that the text to be modified is not read-only, and call
any modification properties the text may have.
If PRESERVE_PTR is nonzero, we relocate *PRESERVE_PTR
by holding its value temporarily in a marker.
This function runs Lisp, which means it can GC, which means it can
compact buffers, including the current buffer being worked on here.
So don't you dare calling this function while manipulating the gap,
or during some other similar "critical section". */
void
prepare_to_modify_buffer_1 (ptrdiff_t start, ptrdiff_t end,
ptrdiff_t *preserve_ptr)
{
struct buffer *base_buffer;
Lisp_Object temp;
XSETFASTINT (temp, start);
if (!NILP (BVAR (current_buffer, read_only)))
Fbarf_if_buffer_read_only (temp);
/* If we're about to modify a buffer the contents of which come from
a dump file, copy the contents to private storage first so we
don't take a COW fault on the buffer text and keep it around
forever. */
if (pdumper_object_p (BEG_ADDR))
enlarge_buffer_text (current_buffer, 0);
eassert (!pdumper_object_p (BEG_ADDR));
run_undoable_change();
bset_redisplay (current_buffer);
if (buffer_intervals (current_buffer))
{
if (preserve_ptr)
{
Lisp_Object preserve_marker;
preserve_marker = Fcopy_marker (make_fixnum (*preserve_ptr), Qnil);
verify_interval_modification (current_buffer, start, end);
*preserve_ptr = marker_position (preserve_marker);
unchain_marker (XMARKER (preserve_marker));
}
else
verify_interval_modification (current_buffer, start, end);
}
/* For indirect buffers, use the base buffer to check clashes. */
if (current_buffer->base_buffer != 0)
base_buffer = current_buffer->base_buffer;
else
base_buffer = current_buffer;
if (inhibit_modification_hooks)
return;
if (!NILP (BVAR (base_buffer, file_truename))
/* Make binding buffer-file-name to nil effective. */
&& !NILP (BVAR (base_buffer, filename))
&& SAVE_MODIFF >= MODIFF)
lock_file (BVAR (base_buffer, file_truename));
/* If `select-active-regions' is non-nil, save the region text. */
/* FIXME: Move this to Elisp (via before-change-functions). */
if (!NILP (BVAR (current_buffer, mark_active))
&& XMARKER (BVAR (current_buffer, mark))->buffer
&& NILP (Vsaved_region_selection)
&& (EQ (Vselect_active_regions, Qonly)
? EQ (CAR_SAFE (Vtransient_mark_mode), Qonly)
: (!NILP (Vselect_active_regions)
&& !NILP (Vtransient_mark_mode))))
Vsaved_region_selection
= call1 (Vregion_extract_function, Qnil);
signal_before_change (start, end, preserve_ptr);
Fset (Qdeactivate_mark, Qt);
}
/* Like above, but called when we know that the buffer text
will be modified and region caches should be invalidated. */
void
prepare_to_modify_buffer (ptrdiff_t start, ptrdiff_t end,
ptrdiff_t *preserve_ptr)
{
prepare_to_modify_buffer_1 (start, end, preserve_ptr);
invalidate_buffer_caches (current_buffer, start, end);
}
/* Invalidate the caches maintained by the buffer BUF, if any, for the
region between buffer positions START and END. */
void
invalidate_buffer_caches (struct buffer *buf, ptrdiff_t start, ptrdiff_t end)
{
/* Indirect buffers usually have their caches set to NULL, but we
need to consider the caches of their base buffer. */
if (buf->base_buffer)
buf = buf->base_buffer;
/* The bidi_paragraph_cache must be invalidated first, because doing
so might need to use the newline_cache (via find_newline_no_quit,
see below). */
if (buf->bidi_paragraph_cache)
{
if (start > BUF_BEG (buf))
{
/* If we are deleting or replacing characters, we could
create a paragraph start, because all of the characters
from START to the beginning of START's line are
whitespace. Therefore, we must extend the region to be
invalidated up to the newline before START. Similarly,
if we are inserting characters immediately after a
newline, we could create a paragraph start if the
inserted characters start with a newline. */
ptrdiff_t line_beg = start;
ptrdiff_t start_byte = buf_charpos_to_bytepos (buf, start);
int prev_char = BUF_FETCH_BYTE (buf, start_byte - 1);
if ((start == end) == (prev_char == '\n'))
{
struct buffer *old = current_buffer;
set_buffer_internal (buf);
line_beg = find_newline_no_quit (start, start_byte, -1,
&start_byte);
set_buffer_internal (old);
}
start = line_beg - (line_beg > BUF_BEG (buf));
}
invalidate_region_cache (buf,
buf->bidi_paragraph_cache,
start - BUF_BEG (buf), BUF_Z (buf) - end);
}
if (buf->newline_cache)
invalidate_region_cache (buf,
buf->newline_cache,
start - BUF_BEG (buf), BUF_Z (buf) - end);
if (buf->width_run_cache)
invalidate_region_cache (buf,
buf->width_run_cache,
start - BUF_BEG (buf), BUF_Z (buf) - end);
}
/* These macros work with an argument named `preserve_ptr'
and a local variable named `preserve_marker'. */
#define PRESERVE_VALUE \
if (preserve_ptr && NILP (preserve_marker)) \
preserve_marker = Fcopy_marker (make_fixnum (*preserve_ptr), Qnil)
#define RESTORE_VALUE \
if (! NILP (preserve_marker)) \
{ \
*preserve_ptr = marker_position (preserve_marker); \
unchain_marker (XMARKER (preserve_marker)); \
}
#define PRESERVE_START_END \
if (NILP (start_marker)) \
start_marker = Fcopy_marker (start, Qnil); \
if (NILP (end_marker)) \
end_marker = Fcopy_marker (end, Qnil);
#define FETCH_START \
(! NILP (start_marker) ? Fmarker_position (start_marker) : start)
#define FETCH_END \
(! NILP (end_marker) ? Fmarker_position (end_marker) : end)
/* Set a variable to nil if an error occurred.
Don't change the variable if there was no error.
VAL is a cons-cell (VARIABLE . NO-ERROR-FLAG).
VARIABLE is the variable to maybe set to nil.
NO-ERROR-FLAG is nil if there was an error,
anything else meaning no error (so this function does nothing). */
struct rvoe_arg
{
Lisp_Object *location;
bool errorp;
};
static void
reset_var_on_error (void *ptr)
{
struct rvoe_arg *p = ptr;
if (p->errorp)
*p->location = Qnil;
}
/* Signal a change to the buffer immediately before it happens.
START_INT and END_INT are the bounds of the text to be changed.
If PRESERVE_PTR is nonzero, we relocate *PRESERVE_PTR
by holding its value temporarily in a marker. */
static void
signal_before_change (ptrdiff_t start_int, ptrdiff_t end_int,
ptrdiff_t *preserve_ptr)
{
Lisp_Object start, end;
Lisp_Object start_marker, end_marker;
Lisp_Object preserve_marker;
ptrdiff_t count = SPECPDL_INDEX ();
struct rvoe_arg rvoe_arg;
start = make_fixnum (start_int);
end = make_fixnum (end_int);
preserve_marker = Qnil;
start_marker = Qnil;
end_marker = Qnil;
specbind (Qinhibit_modification_hooks, Qt);
/* If buffer is unmodified, run a special hook for that case. The
check for Vfirst_change_hook is just a minor optimization. */
if (SAVE_MODIFF >= MODIFF
&& !NILP (Vfirst_change_hook))
{
PRESERVE_VALUE;
PRESERVE_START_END;
run_hook (Qfirst_change_hook);
}
/* Now run the before-change-functions if any. */
if (!NILP (Vbefore_change_functions))
{
rvoe_arg.location = &Vbefore_change_functions;
rvoe_arg.errorp = 1;
PRESERVE_VALUE;
PRESERVE_START_END;
/* Mark before-change-functions to be reset to nil in case of error. */
record_unwind_protect_ptr (reset_var_on_error, &rvoe_arg);
/* Actually run the hook functions. */
CALLN (Frun_hook_with_args, Qbefore_change_functions,
FETCH_START, FETCH_END);
/* There was no error: unarm the reset_on_error. */
rvoe_arg.errorp = 0;
}
if (buffer_has_overlays ())
{
PRESERVE_VALUE;
report_overlay_modification (FETCH_START, FETCH_END, 0,
FETCH_START, FETCH_END, Qnil);
}
if (! NILP (start_marker))
detach_marker (start_marker);
if (! NILP (end_marker))
detach_marker (end_marker);
RESTORE_VALUE;
unbind_to (count, Qnil);
}
/* Signal a change immediately after it happens.
CHARPOS is the character position of the start of the changed text.
LENDEL is the number of characters of the text before the change.
(Not the whole buffer; just the part that was changed.)
LENINS is the number of characters in that part of the text
after the change. */
void
signal_after_change (ptrdiff_t charpos, ptrdiff_t lendel, ptrdiff_t lenins)
{
ptrdiff_t count = SPECPDL_INDEX ();
struct rvoe_arg rvoe_arg;
Lisp_Object tmp, save_insert_behind_hooks, save_insert_in_from_hooks;
if (inhibit_modification_hooks)
return;
/* If we are deferring calls to the after-change functions
and there are no before-change functions,
just record the args that we were going to use. */
if (! NILP (Vcombine_after_change_calls)
/* It's OK to defer after-changes even if syntax-ppss-flush-cache
* is on before-change-functions, which is common enough to be worth
* adding a special case for it. */
&& (NILP (Vbefore_change_functions)
|| (CONSP (Vbefore_change_functions)
&& EQ (Qt, XCAR (Vbefore_change_functions))
&& NILP (Fdefault_value (Qbefore_change_functions))
&& CONSP (tmp = XCDR (Vbefore_change_functions))
&& NILP (XCDR (tmp))
&& EQ (XCAR (tmp), Qsyntax_ppss_flush_cache)))
&& !buffer_has_overlays ())
{
Lisp_Object elt;
if (!NILP (combine_after_change_list)
&& current_buffer != XBUFFER (combine_after_change_buffer))
Fcombine_after_change_execute ();
elt = list3i (charpos - BEG, Z - (charpos - lendel + lenins),
lenins - lendel);
combine_after_change_list
= Fcons (elt, combine_after_change_list);
combine_after_change_buffer = Fcurrent_buffer ();
return;
}
/* Save and restore the insert-*-hooks, because other hooks like
after-change-functions, called below, could clobber them if they
manipulate text properties. */
save_insert_behind_hooks = interval_insert_behind_hooks;
save_insert_in_from_hooks = interval_insert_in_front_hooks;
if (!NILP (combine_after_change_list))
Fcombine_after_change_execute ();
specbind (Qinhibit_modification_hooks, Qt);
if (!NILP (Vafter_change_functions))
{
rvoe_arg.location = &Vafter_change_functions;
rvoe_arg.errorp = 1;
/* Mark after-change-functions to be reset to nil in case of error. */
record_unwind_protect_ptr (reset_var_on_error, &rvoe_arg);
/* Actually run the hook functions. */
CALLN (Frun_hook_with_args, Qafter_change_functions,
make_fixnum (charpos), make_fixnum (charpos + lenins),
make_fixnum (lendel));
/* There was no error: unarm the reset_on_error. */
rvoe_arg.errorp = 0;
}
interval_insert_behind_hooks = save_insert_behind_hooks;
interval_insert_in_front_hooks = save_insert_in_from_hooks;
if (buffer_has_overlays ())
report_overlay_modification (make_fixnum (charpos),
make_fixnum (charpos + lenins),
1,
make_fixnum (charpos),
make_fixnum (charpos + lenins),
make_fixnum (lendel));
/* After an insertion, call the text properties
insert-behind-hooks or insert-in-front-hooks. */
if (lendel == 0)
report_interval_modification (make_fixnum (charpos),
make_fixnum (charpos + lenins));
unbind_to (count, Qnil);
}
static void
Fcombine_after_change_execute_1 (Lisp_Object val)
{
Vcombine_after_change_calls = val;
}
DEFUN ("combine-after-change-execute", Fcombine_after_change_execute,
Scombine_after_change_execute, 0, 0, 0,
doc: /* This function is for use internally in the function `combine-after-change-calls'. */)
(void)
{
ptrdiff_t count = SPECPDL_INDEX ();
ptrdiff_t beg, end, change;
ptrdiff_t begpos, endpos;
Lisp_Object tail;
if (NILP (combine_after_change_list))
return Qnil;
/* It is rare for combine_after_change_buffer to be invalid, but
possible. It can happen when combine-after-change-calls is
non-nil, and insertion calls a file name handler (e.g. through
lock_file) which scribbles into a temp file -- cyd */
if (!BUFFERP (combine_after_change_buffer)
|| !BUFFER_LIVE_P (XBUFFER (combine_after_change_buffer)))
{
combine_after_change_list = Qnil;
return Qnil;
}
record_unwind_current_buffer ();
Fset_buffer (combine_after_change_buffer);
/* # chars unchanged at beginning of buffer. */
beg = Z - BEG;
/* # chars unchanged at end of buffer. */
end = beg;
/* Total amount of insertion (negative for deletion). */
change = 0;
/* Scan the various individual changes,
accumulating the range info in BEG, END and CHANGE. */
for (tail = combine_after_change_list; CONSP (tail);
tail = XCDR (tail))
{
Lisp_Object elt;
ptrdiff_t thisbeg, thisend, thischange;
/* Extract the info from the next element. */
elt = XCAR (tail);
if (! CONSP (elt))
continue;
thisbeg = XFIXNUM (XCAR (elt));
elt = XCDR (elt);
if (! CONSP (elt))
continue;
thisend = XFIXNUM (XCAR (elt));
elt = XCDR (elt);
if (! CONSP (elt))
continue;
thischange = XFIXNUM (XCAR (elt));
/* Merge this range into the accumulated range. */
change += thischange;
if (thisbeg < beg)
beg = thisbeg;
if (thisend < end)
end = thisend;
}
/* Get the current start and end positions of the range
that was changed. */
begpos = BEG + beg;
endpos = Z - end;
/* We are about to handle these, so discard them. */
combine_after_change_list = Qnil;
/* Now run the after-change functions for real.
Turn off the flag that defers them. */
record_unwind_protect (Fcombine_after_change_execute_1,
Vcombine_after_change_calls);
signal_after_change (begpos, endpos - begpos - change, endpos - begpos);
update_compositions (begpos, endpos, CHECK_ALL);
return unbind_to (count, Qnil);
}
\f
void
syms_of_insdel (void)
{
staticpro (&combine_after_change_list);
staticpro (&combine_after_change_buffer);
combine_after_change_list = Qnil;
combine_after_change_buffer = Qnil;
DEFSYM (Qundo_auto__undoable_change, "undo-auto--undoable-change");
DEFSYM (Qsyntax_ppss_flush_cache, "syntax-ppss-flush-cache");
DEFVAR_LISP ("combine-after-change-calls", Vcombine_after_change_calls,
doc: /* Used internally by the function `combine-after-change-calls' macro. */);
Vcombine_after_change_calls = Qnil;
DEFVAR_BOOL ("inhibit-modification-hooks", inhibit_modification_hooks,
doc: /* Non-nil means don't run any of the hooks that respond to buffer changes.
This affects `before-change-functions' and `after-change-functions',
as well as hooks attached to text properties and overlays.
Setting this variable non-nil also inhibits file locks and checks
whether files are locked by another Emacs session, as well as
handling of the active region per `select-active-regions'. */);
inhibit_modification_hooks = 0;
DEFSYM (Qinhibit_modification_hooks, "inhibit-modification-hooks");
defsubr (&Scombine_after_change_execute);
}
|