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
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
3633
3634
3635
3636
3637
3638
3639
3640
3641
3642
3643
3644
3645
3646
3647
3648
3649
3650
3651
3652
3653
3654
3655
3656
3657
3658
3659
3660
3661
3662
3663
3664
3665
3666
3667
3668
3669
3670
3671
3672
3673
3674
3675
3676
3677
3678
3679
3680
3681
3682
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
3700
3701
3702
3703
3704
3705
3706
3707
3708
3709
3710
3711
3712
3713
3714
3715
3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
3726
3727
3728
3729
3730
3731
3732
3733
3734
3735
3736
3737
3738
3739
3740
3741
3742
3743
3744
3745
3746
3747
3748
3749
3750
3751
3752
3753
3754
3755
3756
3757
3758
3759
3760
3761
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
3783
3784
3785
3786
3787
3788
3789
3790
3791
3792
3793
3794
3795
3796
3797
3798
3799
3800
3801
3802
3803
3804
3805
3806
3807
3808
3809
3810
3811
3812
3813
3814
3815
3816
3817
3818
3819
3820
3821
3822
3823
3824
3825
3826
3827
3828
3829
3830
3831
3832
3833
3834
3835
3836
3837
3838
3839
3840
3841
3842
3843
3844
3845
3846
3847
3848
3849
3850
3851
3852
3853
3854
3855
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
4000
4001
4002
4003
4004
4005
4006
4007
4008
4009
4010
4011
4012
4013
4014
4015
4016
4017
4018
4019
4020
4021
4022
4023
4024
4025
4026
4027
4028
4029
4030
4031
4032
4033
4034
4035
4036
4037
4038
4039
4040
4041
4042
4043
4044
4045
4046
4047
4048
4049
4050
4051
4052
4053
4054
4055
4056
4057
4058
4059
4060
4061
4062
4063
4064
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
4076
4077
4078
4079
4080
4081
4082
4083
4084
4085
4086
4087
4088
4089
4090
4091
4092
4093
4094
4095
4096
4097
4098
4099
4100
4101
4102
4103
4104
4105
4106
4107
4108
4109
4110
4111
4112
4113
4114
4115
4116
4117
4118
4119
4120
4121
4122
4123
4124
4125
4126
4127
4128
4129
4130
4131
4132
4133
4134
4135
4136
4137
4138
4139
4140
4141
4142
4143
4144
4145
4146
4147
4148
4149
4150
4151
4152
4153
4154
4155
4156
4157
4158
4159
4160
4161
4162
4163
4164
4165
4166
4167
4168
4169
4170
4171
4172
4173
4174
4175
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196
4197
4198
4199
4200
4201
4202
4203
4204
4205
4206
4207
4208
4209
4210
4211
4212
4213
4214
4215
4216
4217
4218
4219
4220
4221
4222
4223
4224
4225
4226
4227
4228
4229
4230
4231
4232
4233
4234
4235
4236
4237
4238
4239
4240
4241
4242
4243
4244
4245
4246
4247
4248
4249
4250
4251
4252
4253
4254
4255
4256
4257
4258
4259
4260
4261
4262
4263
4264
4265
4266
4267
4268
4269
4270
4271
4272
4273
4274
4275
4276
4277
4278
4279
4280
4281
4282
4283
4284
4285
4286
4287
4288
4289
4290
4291
4292
4293
4294
4295
4296
4297
4298
4299
4300
4301
4302
4303
4304
4305
4306
4307
4308
4309
4310
4311
4312
4313
4314
4315
4316
4317
4318
4319
4320
4321
4322
4323
4324
4325
4326
4327
4328
4329
4330
4331
4332
4333
4334
4335
4336
4337
4338
4339
4340
4341
4342
4343
4344
4345
4346
4347
4348
4349
4350
4351
4352
4353
4354
4355
4356
4357
4358
4359
4360
4361
4362
4363
4364
4365
4366
4367
4368
4369
4370
4371
4372
4373
4374
4375
4376
4377
4378
4379
4380
4381
4382
4383
4384
4385
4386
4387
4388
4389
4390
4391
4392
4393
4394
4395
4396
4397
4398
4399
4400
4401
4402
4403
4404
4405
4406
4407
4408
4409
4410
4411
4412
4413
4414
4415
4416
4417
4418
4419
4420
4421
4422
4423
4424
4425
4426
4427
4428
4429
4430
4431
4432
4433
4434
4435
4436
4437
4438
4439
4440
4441
4442
4443
4444
4445
4446
4447
4448
4449
4450
4451
4452
4453
4454
4455
4456
4457
4458
4459
4460
4461
4462
4463
4464
4465
4466
4467
4468
4469
4470
4471
4472
4473
4474
4475
4476
4477
4478
4479
4480
4481
4482
4483
4484
4485
4486
4487
4488
4489
4490
4491
4492
4493
4494
4495
4496
4497
4498
4499
4500
4501
4502
4503
4504
4505
4506
4507
4508
4509
4510
4511
4512
4513
4514
4515
4516
4517
4518
4519
4520
4521
4522
4523
4524
4525
4526
4527
4528
4529
4530
4531
4532
4533
4534
4535
4536
4537
4538
4539
4540
4541
4542
4543
4544
4545
4546
4547
4548
4549
4550
4551
4552
4553
4554
4555
4556
4557
4558
4559
4560
4561
4562
4563
4564
4565
4566
4567
4568
4569
4570
4571
4572
4573
4574
4575
4576
4577
4578
4579
4580
4581
4582
4583
4584
4585
4586
4587
4588
4589
4590
4591
4592
4593
4594
4595
4596
4597
4598
4599
4600
4601
4602
4603
4604
4605
4606
4607
4608
4609
4610
4611
4612
4613
4614
4615
4616
4617
4618
4619
4620
4621
4622
4623
4624
4625
4626
4627
4628
4629
4630
4631
4632
4633
4634
4635
4636
4637
4638
4639
4640
4641
4642
4643
4644
4645
4646
4647
4648
4649
4650
4651
4652
4653
4654
4655
4656
4657
4658
4659
4660
4661
4662
4663
4664
4665
4666
4667
4668
4669
4670
4671
4672
4673
4674
4675
4676
4677
4678
4679
4680
4681
4682
4683
4684
4685
4686
4687
4688
4689
4690
4691
4692
4693
4694
4695
4696
4697
4698
4699
4700
4701
4702
4703
4704
4705
4706
4707
4708
4709
4710
4711
4712
4713
4714
4715
4716
4717
4718
4719
4720
4721
4722
4723
4724
4725
4726
4727
4728
4729
4730
4731
4732
4733
4734
4735
4736
4737
4738
4739
4740
4741
4742
4743
4744
4745
4746
4747
4748
4749
4750
4751
4752
4753
4754
4755
4756
4757
4758
4759
4760
4761
4762
4763
4764
4765
4766
4767
4768
4769
4770
4771
4772
4773
4774
4775
4776
4777
4778
4779
4780
4781
4782
4783
4784
4785
4786
4787
4788
4789
4790
4791
4792
4793
4794
4795
4796
4797
4798
4799
4800
4801
4802
4803
4804
4805
4806
4807
4808
4809
4810
4811
4812
4813
4814
4815
4816
4817
4818
4819
4820
4821
4822
4823
4824
4825
4826
4827
4828
4829
4830
4831
4832
4833
4834
4835
4836
4837
4838
4839
4840
4841
4842
4843
4844
4845
4846
4847
4848
4849
4850
4851
4852
4853
4854
4855
4856
4857
4858
4859
4860
4861
4862
4863
4864
4865
4866
4867
4868
4869
4870
4871
4872
4873
4874
4875
4876
4877
4878
4879
4880
4881
4882
4883
4884
4885
4886
4887
4888
4889
4890
4891
4892
4893
4894
4895
4896
4897
4898
4899
4900
4901
4902
4903
4904
4905
4906
4907
4908
4909
4910
4911
4912
4913
4914
4915
4916
4917
4918
4919
4920
4921
4922
4923
4924
4925
4926
4927
4928
4929
4930
4931
4932
4933
4934
4935
4936
4937
4938
4939
4940
4941
4942
4943
4944
4945
4946
4947
4948
4949
4950
4951
4952
4953
4954
4955
4956
4957
4958
4959
4960
4961
4962
4963
4964
4965
4966
4967
4968
4969
4970
4971
4972
4973
4974
4975
4976
4977
4978
4979
4980
4981
4982
4983
4984
4985
4986
4987
4988
4989
4990
4991
4992
4993
4994
4995
4996
4997
4998
4999
5000
5001
5002
5003
5004
5005
5006
5007
5008
5009
5010
5011
5012
5013
5014
5015
5016
5017
5018
5019
5020
5021
5022
5023
5024
5025
5026
5027
5028
5029
5030
5031
5032
5033
5034
5035
5036
5037
5038
5039
5040
5041
5042
5043
5044
5045
5046
5047
5048
5049
5050
5051
5052
5053
5054
5055
5056
5057
5058
5059
5060
5061
5062
5063
5064
5065
5066
5067
5068
5069
5070
5071
5072
5073
5074
5075
5076
5077
5078
5079
5080
5081
5082
5083
5084
5085
5086
5087
5088
5089
5090
5091
5092
5093
5094
5095
5096
5097
5098
5099
5100
5101
5102
5103
5104
5105
5106
5107
5108
5109
5110
5111
5112
5113
5114
5115
5116
5117
5118
5119
5120
5121
5122
5123
5124
5125
5126
5127
5128
5129
5130
5131
5132
5133
5134
5135
5136
5137
5138
5139
5140
5141
5142
5143
5144
5145
5146
5147
5148
5149
5150
5151
5152
5153
5154
5155
5156
5157
5158
5159
5160
5161
5162
5163
5164
5165
5166
5167
5168
5169
5170
5171
5172
5173
5174
5175
5176
5177
5178
5179
5180
5181
5182
5183
5184
5185
5186
5187
5188
5189
5190
5191
5192
5193
5194
5195
5196
5197
5198
5199
5200
5201
5202
5203
5204
5205
5206
5207
5208
5209
5210
5211
5212
5213
5214
5215
5216
5217
5218
5219
5220
5221
5222
5223
5224
5225
5226
5227
5228
5229
5230
5231
5232
5233
5234
5235
5236
5237
5238
5239
5240
5241
5242
5243
5244
5245
5246
5247
5248
5249
5250
5251
5252
5253
5254
5255
5256
5257
5258
5259
5260
5261
5262
5263
5264
5265
5266
5267
5268
5269
5270
5271
5272
5273
5274
5275
5276
5277
5278
5279
5280
5281
5282
5283
5284
5285
5286
5287
5288
5289
5290
5291
5292
5293
5294
5295
5296
5297
5298
5299
5300
5301
5302
5303
5304
5305
5306
5307
5308
5309
5310
5311
5312
5313
5314
5315
5316
5317
5318
5319
5320
5321
5322
5323
5324
5325
5326
5327
5328
5329
5330
5331
5332
5333
5334
5335
5336
5337
5338
5339
5340
5341
5342
5343
5344
5345
5346
5347
5348
5349
5350
5351
5352
5353
5354
5355
5356
5357
5358
5359
5360
5361
5362
5363
5364
5365
5366
5367
5368
5369
5370
5371
5372
5373
5374
5375
5376
5377
5378
5379
5380
5381
5382
5383
5384
5385
5386
5387
5388
5389
5390
5391
5392
5393
5394
5395
5396
5397
5398
5399
5400
5401
5402
5403
5404
5405
5406
5407
5408
5409
5410
5411
5412
5413
5414
5415
5416
5417
5418
5419
5420
5421
5422
5423
5424
5425
5426
5427
5428
5429
5430
5431
5432
5433
5434
5435
5436
5437
5438
5439
5440
5441
5442
5443
5444
5445
5446
5447
5448
5449
5450
5451
5452
5453
5454
5455
5456
5457
5458
5459
5460
5461
5462
5463
5464
5465
5466
5467
5468
5469
5470
5471
5472
5473
5474
5475
5476
5477
5478
5479
5480
5481
5482
5483
5484
5485
5486
5487
5488
5489
5490
5491
5492
5493
5494
5495
5496
5497
5498
5499
5500
5501
5502
5503
5504
5505
5506
5507
5508
5509
5510
5511
5512
5513
5514
5515
5516
5517
5518
5519
5520
5521
5522
5523
5524
5525
5526
5527
5528
5529
5530
5531
5532
5533
5534
5535
5536
5537
5538
5539
5540
5541
5542
5543
5544
5545
5546
5547
5548
5549
5550
5551
5552
5553
5554
5555
5556
5557
5558
5559
5560
5561
5562
5563
5564
5565
5566
5567
5568
5569
5570
5571
5572
5573
5574
5575
5576
5577
5578
5579
5580
5581
5582
5583
5584
5585
5586
5587
5588
5589
5590
5591
5592
5593
5594
5595
5596
5597
5598
5599
5600
5601
5602
5603
5604
5605
5606
5607
5608
5609
5610
5611
5612
5613
5614
5615
5616
5617
5618
5619
5620
5621
5622
5623
5624
5625
5626
5627
5628
5629
5630
5631
5632
5633
5634
5635
5636
5637
5638
5639
5640
5641
5642
5643
5644
5645
5646
5647
5648
5649
5650
5651
5652
5653
5654
5655
5656
5657
5658
5659
5660
5661
5662
5663
5664
5665
5666
5667
5668
5669
5670
5671
5672
5673
5674
5675
5676
5677
5678
5679
5680
5681
5682
5683
5684
5685
5686
5687
5688
5689
5690
5691
5692
5693
5694
5695
5696
5697
5698
5699
5700
5701
5702
5703
5704
5705
5706
5707
5708
5709
5710
5711
5712
5713
5714
5715
5716
5717
5718
5719
5720
5721
5722
5723
5724
5725
5726
5727
5728
5729
5730
5731
5732
5733
5734
5735
5736
5737
5738
5739
5740
5741
5742
5743
5744
5745
5746
5747
5748
5749
5750
5751
5752
5753
5754
5755
5756
5757
5758
5759
5760
5761
5762
5763
5764
5765
5766
5767
5768
5769
5770
5771
5772
5773
5774
5775
5776
5777
5778
5779
5780
5781
5782
5783
5784
5785
5786
5787
5788
5789
5790
5791
5792
5793
5794
5795
5796
5797
5798
5799
5800
5801
5802
5803
5804
5805
5806
5807
5808
5809
5810
5811
5812
5813
5814
5815
5816
5817
5818
5819
5820
5821
5822
5823
5824
5825
5826
5827
5828
5829
5830
5831
5832
5833
5834
5835
5836
5837
5838
5839
5840
5841
5842
5843
5844
5845
5846
5847
5848
5849
5850
5851
5852
5853
5854
5855
5856
5857
5858
5859
5860
5861
5862
5863
5864
5865
5866
5867
5868
5869
5870
5871
5872
5873
5874
5875
5876
5877
5878
5879
5880
5881
5882
5883
5884
5885
5886
5887
5888
5889
5890
5891
5892
5893
5894
5895
5896
5897
5898
5899
5900
5901
5902
5903
5904
5905
5906
5907
5908
5909
5910
5911
5912
5913
5914
5915
5916
5917
5918
5919
5920
5921
5922
5923
5924
5925
5926
5927
5928
5929
5930
5931
5932
5933
5934
5935
5936
5937
5938
5939
5940
5941
5942
5943
5944
5945
5946
5947
5948
5949
5950
5951
5952
5953
5954
5955
5956
5957
5958
5959
5960
5961
5962
5963
5964
5965
5966
5967
5968
5969
5970
5971
5972
5973
5974
5975
5976
5977
5978
5979
5980
5981
5982
5983
5984
5985
5986
5987
5988
5989
5990
5991
5992
5993
5994
5995
5996
5997
5998
5999
6000
6001
6002
6003
6004
6005
6006
6007
6008
6009
6010
6011
6012
6013
6014
6015
6016
6017
6018
6019
6020
6021
6022
6023
6024
6025
6026
6027
6028
6029
6030
6031
6032
6033
6034
6035
6036
6037
6038
6039
6040
6041
6042
6043
6044
6045
6046
6047
6048
6049
6050
6051
6052
6053
6054
6055
6056
6057
6058
6059
6060
6061
6062
6063
6064
6065
6066
6067
6068
6069
6070
6071
6072
6073
6074
6075
6076
6077
6078
6079
6080
6081
6082
6083
6084
6085
6086
6087
6088
6089
6090
6091
6092
6093
6094
6095
6096
6097
6098
6099
6100
6101
6102
6103
6104
6105
6106
6107
6108
6109
6110
6111
6112
6113
6114
6115
6116
6117
6118
6119
6120
6121
6122
6123
6124
6125
6126
6127
6128
6129
6130
6131
6132
6133
6134
6135
6136
6137
6138
6139
6140
6141
6142
6143
6144
6145
6146
6147
6148
6149
6150
6151
6152
6153
6154
6155
6156
6157
6158
6159
6160
6161
6162
6163
6164
6165
6166
6167
6168
6169
6170
6171
6172
6173
6174
6175
6176
6177
6178
6179
6180
6181
6182
6183
6184
6185
6186
6187
6188
6189
6190
6191
6192
6193
6194
6195
6196
6197
6198
6199
6200
6201
6202
6203
6204
6205
6206
6207
6208
6209
6210
6211
6212
6213
6214
6215
6216
6217
6218
6219
6220
6221
6222
6223
6224
6225
6226
6227
6228
6229
6230
6231
6232
6233
6234
6235
6236
6237
6238
6239
6240
6241
6242
6243
6244
6245
6246
6247
6248
6249
6250
6251
6252
6253
6254
6255
6256
6257
6258
6259
6260
6261
6262
6263
6264
6265
6266
6267
6268
6269
6270
6271
6272
6273
6274
6275
6276
6277
6278
6279
6280
6281
6282
6283
6284
6285
6286
6287
6288
6289
6290
6291
6292
6293
6294
6295
6296
6297
6298
6299
6300
6301
6302
6303
6304
6305
6306
6307
6308
6309
6310
6311
6312
6313
6314
6315
6316
6317
6318
6319
6320
6321
6322
6323
6324
6325
6326
6327
6328
6329
6330
6331
6332
6333
6334
6335
6336
6337
6338
6339
6340
6341
6342
6343
6344
6345
6346
6347
6348
6349
6350
6351
6352
6353
6354
6355
6356
6357
6358
6359
6360
6361
6362
6363
6364
6365
6366
6367
6368
6369
6370
6371
6372
6373
6374
6375
6376
6377
6378
6379
6380
6381
6382
6383
6384
6385
6386
6387
6388
6389
6390
6391
6392
6393
6394
6395
6396
6397
6398
6399
6400
6401
6402
6403
6404
6405
6406
6407
6408
6409
6410
6411
6412
6413
6414
6415
6416
6417
6418
6419
6420
6421
6422
6423
6424
6425
6426
6427
6428
6429
6430
6431
6432
6433
6434
6435
6436
6437
6438
6439
6440
6441
6442
6443
6444
6445
6446
6447
6448
6449
6450
6451
6452
6453
6454
6455
6456
6457
6458
6459
6460
6461
6462
6463
6464
6465
6466
6467
6468
6469
6470
6471
6472
6473
6474
6475
6476
6477
6478
6479
6480
6481
6482
6483
6484
6485
6486
6487
6488
6489
6490
6491
6492
6493
6494
6495
6496
6497
6498
6499
6500
6501
6502
6503
6504
6505
6506
6507
6508
6509
6510
6511
6512
6513
6514
6515
6516
6517
6518
6519
6520
6521
6522
6523
6524
6525
6526
6527
6528
6529
6530
6531
6532
6533
6534
6535
6536
6537
6538
6539
6540
6541
6542
6543
6544
6545
6546
6547
6548
6549
6550
6551
6552
6553
6554
6555
6556
6557
6558
6559
6560
6561
6562
6563
6564
6565
6566
6567
6568
6569
6570
6571
6572
6573
6574
6575
6576
6577
|
/*
* tkText.c --
*
* This module provides a big chunk of the implementation of multi-line
* editable text widgets for Tk. Among other things, it provides the Tcl
* command interfaces to text widgets. The B-tree representation of text
* and its actual display are implemented elsewhere.
*
* Copyright (c) 1992-1994 The Regents of the University of California.
* Copyright (c) 1994-1996 Sun Microsystems, Inc.
* Copyright (c) 1999 by Scriptics Corporation.
*
* See the file "license.terms" for information on usage and redistribution of
* this file, and for a DISCLAIMER OF ALL WARRANTIES.
*
* RCS: @(#) $Id: tkText.c,v 1.75.2.2 2007/12/12 14:13:09 dgp Exp $
*/
#include "default.h"
#include "tkInt.h"
#include "tkUndo.h"
#if defined(MAC_OSX_TK)
#define Style TkStyle
#define DInfo TkDInfo
#endif
/*
* For compatibility with Tk 4.0 through 8.4.x, we allow tabs to be
* mis-specified with non-increasing values. These are converted into tabs
* which are the equivalent of at least a character width apart.
*/
#if (TK_MAJOR_VERSION < 9)
#define _TK_ALLOW_DECREASING_TABS
#endif
#include "tkText.h"
/*
* Used to avoid having to allocate and deallocate arrays on the fly for
* commonly used functions. Must be > 0.
*/
#define PIXEL_CLIENTS 5
/*
* The 'TkTextState' enum in tkText.h is used to define a type for the -state
* option of the Text widget. These values are used as indices into the string
* table below.
*/
static char *stateStrings[] = {
"disabled", "normal", NULL
};
/*
* The 'TkWrapMode' enum in tkText.h is used to define a type for the -wrap
* option of the Text widget. These values are used as indices into the string
* table below.
*/
static char *wrapStrings[] = {
"char", "none", "word", NULL
};
/*
* The 'TkTextTabStyle' enum in tkText.h is used to define a type for the
* -tabstyle option of the Text widget. These values are used as indices into
* the string table below.
*/
static char *tabStyleStrings[] = {
"tabular", "wordprocessor", NULL
};
/*
* The following functions and custom option type are used to define the
* "line" option type, and thereby handle the text widget '-startline',
* '-endline' configuration options which are of that type.
*
* We do not need a 'freeProc' because all changes to these two options are
* handled through the TK_TEXT_LINE_RANGE flag in the optionSpecs list, and
* the internal storage is just a pointer, which therefore doesn't need
* freeing.
*/
static int SetLineStartEnd(ClientData clientData,
Tcl_Interp *interp, Tk_Window tkwin,
Tcl_Obj **value, char *recordPtr,
int internalOffset, char *oldInternalPtr,
int flags);
static Tcl_Obj * GetLineStartEnd(ClientData clientData,
Tk_Window tkwin, char *recordPtr,
int internalOffset);
static void RestoreLineStartEnd(ClientData clientData,
Tk_Window tkwin, char *internalPtr,
char *oldInternalPtr);
static int ObjectIsEmpty(Tcl_Obj *objPtr);
static Tk_ObjCustomOption lineOption = {
"line", /* name */
SetLineStartEnd, /* setProc */
GetLineStartEnd, /* getProc */
RestoreLineStartEnd, /* restoreProc */
NULL, /* freeProc */
0
};
/*
* Information used to parse text configuration options:
*/
static const Tk_OptionSpec optionSpecs[] = {
{TK_OPTION_BOOLEAN, "-autoseparators", "autoSeparators",
"AutoSeparators", DEF_TEXT_AUTO_SEPARATORS, -1,
Tk_Offset(TkText, autoSeparators), 0, 0, 0},
{TK_OPTION_BORDER, "-background", "background", "Background",
DEF_TEXT_BG_COLOR, -1, Tk_Offset(TkText, border),
0, (ClientData) DEF_TEXT_BG_MONO, 0},
{TK_OPTION_SYNONYM, "-bd", NULL, NULL,
NULL, 0, -1, 0, (ClientData) "-borderwidth",
TK_TEXT_LINE_GEOMETRY},
{TK_OPTION_SYNONYM, "-bg", NULL, NULL,
NULL, 0, -1, 0, (ClientData) "-background", 0},
{TK_OPTION_BOOLEAN, "-blockcursor", "blockCursor",
"BlockCursor", DEF_TEXT_BLOCK_CURSOR, -1,
Tk_Offset(TkText, insertCursorType), 0, 0, 0},
{TK_OPTION_PIXELS, "-borderwidth", "borderWidth", "BorderWidth",
DEF_TEXT_BORDER_WIDTH, -1, Tk_Offset(TkText, borderWidth),
0, 0, TK_TEXT_LINE_GEOMETRY},
{TK_OPTION_CURSOR, "-cursor", "cursor", "Cursor",
DEF_TEXT_CURSOR, -1, Tk_Offset(TkText, cursor),
TK_OPTION_NULL_OK, 0, 0},
{TK_OPTION_CUSTOM, "-endline", NULL, NULL,
NULL, -1, Tk_Offset(TkText, end), TK_OPTION_NULL_OK,
(ClientData) &lineOption, TK_TEXT_LINE_RANGE},
{TK_OPTION_BOOLEAN, "-exportselection", "exportSelection",
"ExportSelection", DEF_TEXT_EXPORT_SELECTION, -1,
Tk_Offset(TkText, exportSelection), 0, 0, 0},
{TK_OPTION_SYNONYM, "-fg", "foreground", NULL,
NULL, 0, -1, 0, (ClientData) "-foreground", 0},
{TK_OPTION_FONT, "-font", "font", "Font",
DEF_TEXT_FONT, -1, Tk_Offset(TkText, tkfont), 0, 0,
TK_TEXT_LINE_GEOMETRY},
{TK_OPTION_COLOR, "-foreground", "foreground", "Foreground",
DEF_TEXT_FG, -1, Tk_Offset(TkText, fgColor), 0,
0, 0},
{TK_OPTION_PIXELS, "-height", "height", "Height",
DEF_TEXT_HEIGHT, -1, Tk_Offset(TkText, height), 0, 0, 0},
{TK_OPTION_COLOR, "-highlightbackground", "highlightBackground",
"HighlightBackground", DEF_TEXT_HIGHLIGHT_BG,
-1, Tk_Offset(TkText, highlightBgColorPtr),
0, 0, 0},
{TK_OPTION_COLOR, "-highlightcolor", "highlightColor", "HighlightColor",
DEF_TEXT_HIGHLIGHT, -1, Tk_Offset(TkText, highlightColorPtr),
0, 0, 0},
{TK_OPTION_PIXELS, "-highlightthickness", "highlightThickness",
"HighlightThickness", DEF_TEXT_HIGHLIGHT_WIDTH, -1,
Tk_Offset(TkText, highlightWidth), 0, 0, TK_TEXT_LINE_GEOMETRY},
{TK_OPTION_BORDER, "-inactiveselectbackground","inactiveSelectBackground",
"Foreground",
DEF_TEXT_INACTIVE_SELECT_COLOR,
-1, Tk_Offset(TkText, inactiveSelBorder),
TK_OPTION_NULL_OK, (ClientData) DEF_TEXT_SELECT_MONO, 0},
{TK_OPTION_BORDER, "-insertbackground", "insertBackground", "Foreground",
DEF_TEXT_INSERT_BG,
-1, Tk_Offset(TkText, insertBorder),
0, 0, 0},
{TK_OPTION_PIXELS, "-insertborderwidth", "insertBorderWidth",
"BorderWidth", DEF_TEXT_INSERT_BD_COLOR, -1,
Tk_Offset(TkText, insertBorderWidth), 0,
(ClientData) DEF_TEXT_INSERT_BD_MONO, 0},
{TK_OPTION_INT, "-insertofftime", "insertOffTime", "OffTime",
DEF_TEXT_INSERT_OFF_TIME, -1, Tk_Offset(TkText, insertOffTime),
0, 0, 0},
{TK_OPTION_INT, "-insertontime", "insertOnTime", "OnTime",
DEF_TEXT_INSERT_ON_TIME, -1, Tk_Offset(TkText, insertOnTime),
0, 0, 0},
{TK_OPTION_PIXELS, "-insertwidth", "insertWidth", "InsertWidth",
DEF_TEXT_INSERT_WIDTH, -1, Tk_Offset(TkText, insertWidth),
0, 0, 0},
{TK_OPTION_INT, "-maxundo", "maxUndo", "MaxUndo",
DEF_TEXT_MAX_UNDO, -1, Tk_Offset(TkText, maxUndo), 0, 0, 0},
{TK_OPTION_PIXELS, "-padx", "padX", "Pad",
DEF_TEXT_PADX, -1, Tk_Offset(TkText, padX), 0, 0,
TK_TEXT_LINE_GEOMETRY},
{TK_OPTION_PIXELS, "-pady", "padY", "Pad",
DEF_TEXT_PADY, -1, Tk_Offset(TkText, padY), 0, 0, 0},
{TK_OPTION_RELIEF, "-relief", "relief", "Relief",
DEF_TEXT_RELIEF, -1, Tk_Offset(TkText, relief), 0, 0, 0},
{TK_OPTION_BORDER, "-selectbackground", "selectBackground", "Foreground",
DEF_TEXT_SELECT_COLOR, -1, Tk_Offset(TkText, selBorder),
0, (ClientData) DEF_TEXT_SELECT_MONO, 0},
{TK_OPTION_PIXELS, "-selectborderwidth", "selectBorderWidth",
"BorderWidth", DEF_TEXT_SELECT_BD_COLOR,
Tk_Offset(TkText, selBorderWidthPtr),
Tk_Offset(TkText, selBorderWidth),
TK_OPTION_NULL_OK, (ClientData) DEF_TEXT_SELECT_BD_MONO, 0},
{TK_OPTION_COLOR, "-selectforeground", "selectForeground", "Background",
DEF_TEXT_SELECT_FG_COLOR, -1, Tk_Offset(TkText, selFgColorPtr),
TK_CONFIG_NULL_OK, (ClientData) DEF_TEXT_SELECT_FG_MONO, 0},
{TK_OPTION_BOOLEAN, "-setgrid", "setGrid", "SetGrid",
DEF_TEXT_SET_GRID, -1, Tk_Offset(TkText, setGrid), 0, 0, 0},
{TK_OPTION_PIXELS, "-spacing1", "spacing1", "Spacing",
DEF_TEXT_SPACING1, -1, Tk_Offset(TkText, spacing1),
TK_OPTION_DONT_SET_DEFAULT, 0 , TK_TEXT_LINE_GEOMETRY },
{TK_OPTION_PIXELS, "-spacing2", "spacing2", "Spacing",
DEF_TEXT_SPACING2, -1, Tk_Offset(TkText, spacing2),
TK_OPTION_DONT_SET_DEFAULT, 0 , TK_TEXT_LINE_GEOMETRY },
{TK_OPTION_PIXELS, "-spacing3", "spacing3", "Spacing",
DEF_TEXT_SPACING3, -1, Tk_Offset(TkText, spacing3),
TK_OPTION_DONT_SET_DEFAULT, 0 , TK_TEXT_LINE_GEOMETRY },
{TK_OPTION_CUSTOM, "-startline", NULL, NULL,
NULL, -1, Tk_Offset(TkText, start), TK_OPTION_NULL_OK,
(ClientData) &lineOption, TK_TEXT_LINE_RANGE},
{TK_OPTION_STRING_TABLE, "-state", "state", "State",
DEF_TEXT_STATE, -1, Tk_Offset(TkText, state),
0, (ClientData) stateStrings, 0},
{TK_OPTION_STRING, "-tabs", "tabs", "Tabs",
DEF_TEXT_TABS, Tk_Offset(TkText, tabOptionPtr), -1,
TK_OPTION_NULL_OK, 0, TK_TEXT_LINE_GEOMETRY},
{TK_OPTION_STRING_TABLE, "-tabstyle", "tabStyle", "TabStyle",
DEF_TEXT_TABSTYLE, -1, Tk_Offset(TkText, tabStyle),
0, (ClientData) tabStyleStrings, TK_TEXT_LINE_GEOMETRY},
{TK_OPTION_STRING, "-takefocus", "takeFocus", "TakeFocus",
DEF_TEXT_TAKE_FOCUS, -1, Tk_Offset(TkText, takeFocus),
TK_OPTION_NULL_OK, 0, 0},
{TK_OPTION_BOOLEAN, "-undo", "undo", "Undo",
DEF_TEXT_UNDO, -1, Tk_Offset(TkText, undo), 0, 0 , 0},
{TK_OPTION_INT, "-width", "width", "Width",
DEF_TEXT_WIDTH, -1, Tk_Offset(TkText, width), 0, 0,
TK_TEXT_LINE_GEOMETRY},
{TK_OPTION_STRING_TABLE, "-wrap", "wrap", "Wrap",
DEF_TEXT_WRAP, -1, Tk_Offset(TkText, wrapMode),
0, (ClientData) wrapStrings, TK_TEXT_LINE_GEOMETRY},
{TK_OPTION_STRING, "-xscrollcommand", "xScrollCommand", "ScrollCommand",
DEF_TEXT_XSCROLL_COMMAND, -1, Tk_Offset(TkText, xScrollCmd),
TK_OPTION_NULL_OK, 0, 0},
{TK_OPTION_STRING, "-yscrollcommand", "yScrollCommand", "ScrollCommand",
DEF_TEXT_YSCROLL_COMMAND, -1, Tk_Offset(TkText, yScrollCmd),
TK_OPTION_NULL_OK, 0, 0},
{TK_OPTION_END}
};
/*
* These three typedefs, the structure and the SearchPerform, SearchCore
* functions below are used for line-based searches of the text widget, and,
* in particular, to handle multi-line matching even though the text widget is
* a single-line based data structure. They are completely abstracted away
* from the Text widget internals, however, so could easily be re-used with
* any line-based entity to provide multi-line matching.
*
* We have abstracted this code away from the text widget to try to keep Tk as
* modular as possible.
*/
struct SearchSpec; /* Forward declaration. */
typedef ClientData SearchAddLineProc(int lineNum,
struct SearchSpec *searchSpecPtr,
Tcl_Obj *theLine, int *lenPtr,
int *extraLinesPtr);
typedef int SearchMatchProc(int lineNum,
struct SearchSpec *searchSpecPtr,
ClientData clientData, Tcl_Obj *theLine,
int matchOffset, int matchLength);
typedef int SearchLineIndexProc(Tcl_Interp *interp,
Tcl_Obj *objPtr, struct SearchSpec *searchSpecPtr,
int *linePosPtr, int *offsetPosPtr);
typedef struct SearchSpec {
int exact; /* Whether search is exact or regexp. */
int noCase; /* Case-insenstivive? */
int noLineStop; /* If not set, a regexp search will use the
* TCL_REG_NLSTOP flag. */
int overlap; /* If set, results from multiple searches
* (-all) are allowed to overlap each
* other. */
int strictLimits; /* If set, matches must be completely inside
* the from,to range. Otherwise the limits
* only apply to the start of each match. */
int all; /* Whether all or the first match should be
* reported. */
int startLine; /* First line to examine. */
int startOffset; /* Index in first line to start at. */
int stopLine; /* Last line to examine, or -1 when we search
* all available text. */
int stopOffset; /* Index to stop at, provided stopLine is not
* -1. */
int numLines; /* Total lines which are available. */
int backwards; /* Searching forwards or backwards. */
Tcl_Obj *varPtr; /* If non-NULL, store length(s) of match(es)
* in this variable. */
Tcl_Obj *countPtr; /* Keeps track of currently found lengths. */
Tcl_Obj *resPtr; /* Keeps track of currently found locations */
int searchElide; /* Search in hidden text as well. */
SearchAddLineProc *addLineProc;
/* Function to call when we need to add
* another line to the search string so far */
SearchMatchProc *foundMatchProc;
/* Function to call when we have found a
* match. */
SearchLineIndexProc *lineIndexProc;
/* Function to call when we have found a
* match. */
ClientData clientData; /* Information about structure being searched,
* in this case a text widget. */
} SearchSpec;
/*
* The text-widget-independent functions which actually perform the search,
* handling both regexp and exact searches.
*/
static int SearchCore(Tcl_Interp *interp,
SearchSpec *searchSpecPtr, Tcl_Obj *patObj);
static int SearchPerform(Tcl_Interp *interp,
SearchSpec *searchSpecPtr, Tcl_Obj *patObj,
Tcl_Obj *fromPtr, Tcl_Obj *toPtr);
/*
* Boolean variable indicating whether or not special debugging code should be
* executed.
*/
int tkTextDebug = 0;
/*
* Forward declarations for functions defined later in this file:
*/
static int ConfigureText(Tcl_Interp *interp,
TkText *textPtr, int objc, Tcl_Obj *CONST objv[]);
static int DeleteIndexRange(TkSharedText *sharedPtr,
TkText *textPtr, CONST TkTextIndex *indexPtr1,
CONST TkTextIndex *indexPtr2, int viewUpdate);
static int CountIndices(CONST TkText *textPtr,
CONST TkTextIndex *indexPtr1,
CONST TkTextIndex *indexPtr2,
TkTextCountType type);
static void DestroyText(TkText *textPtr);
static int InsertChars(TkSharedText *sharedTextPtr,
TkText *textPtr, TkTextIndex *indexPtr,
Tcl_Obj *stringPtr, int viewUpdate);
static void TextBlinkProc(ClientData clientData);
static void TextCmdDeletedProc(ClientData clientData);
static int CreateWidget(TkSharedText *sharedPtr, Tk_Window tkwin,
Tcl_Interp *interp, CONST TkText *parent,
int objc, Tcl_Obj *CONST objv[]);
static void TextEventProc(ClientData clientData,
XEvent *eventPtr);
static int TextFetchSelection(ClientData clientData, int offset,
char *buffer, int maxBytes);
static int TextIndexSortProc(CONST void *first,
CONST void *second);
static int TextInsertCmd(TkSharedText *sharedTextPtr,
TkText *textPtr, Tcl_Interp *interp,
int objc, Tcl_Obj *CONST objv[],
CONST TkTextIndex *indexPtr, int viewUpdate);
static int TextReplaceCmd(TkText *textPtr, Tcl_Interp *interp,
CONST TkTextIndex *indexFromPtr,
CONST TkTextIndex *indexToPtr,
int objc, Tcl_Obj *CONST objv[], int viewUpdate);
static int TextSearchCmd(TkText *textPtr, Tcl_Interp *interp,
int objc, Tcl_Obj *CONST objv[]);
static int TextEditCmd(TkText *textPtr, Tcl_Interp *interp,
int objc, Tcl_Obj *CONST objv[]);
static int TextWidgetObjCmd(ClientData clientData,
Tcl_Interp *interp,
int objc, Tcl_Obj *CONST objv[]);
static int SharedTextObjCmd(ClientData clientData,
Tcl_Interp *interp,
int objc, Tcl_Obj *CONST objv[]);
static void TextWorldChangedCallback(ClientData instanceData);
static void TextWorldChanged(TkText *textPtr, int mask);
static int TextDumpCmd(TkText *textPtr, Tcl_Interp *interp,
int objc, Tcl_Obj *CONST objv[]);
static int DumpLine(Tcl_Interp *interp, TkText *textPtr,
int what, TkTextLine *linePtr, int start, int end,
int lineno, Tcl_Obj *command);
static int DumpSegment(TkText *textPtr, Tcl_Interp *interp,
CONST char *key, CONST char *value,
Tcl_Obj *command, CONST TkTextIndex *index,
int what);
static int TextEditUndo(TkText *textPtr);
static int TextEditRedo(TkText *textPtr);
static Tcl_Obj * TextGetText(CONST TkText *textPtr,
CONST TkTextIndex *index1,
CONST TkTextIndex *index2, int visibleOnly);
static void UpdateDirtyFlag(TkSharedText *sharedPtr);
static void TextPushUndoAction(TkText *textPtr,
Tcl_Obj *undoString, int insert,
CONST TkTextIndex *index1Ptr,
CONST TkTextIndex *index2Ptr);
static int TextSearchIndexInLine(CONST SearchSpec *searchSpecPtr,
TkTextLine *linePtr, int byteIndex);
static int TextPeerCmd(TkText *textPtr, Tcl_Interp *interp,
int objc, Tcl_Obj *CONST objv[]);
static TkUndoProc TextUndoRedoCallback;
/*
* Declarations of the three search procs required by the multi-line search
* routines.
*/
static SearchMatchProc TextSearchFoundMatch;
static SearchAddLineProc TextSearchAddNextLine;
static SearchLineIndexProc TextSearchGetLineIndex;
/*
* The structure below defines text class behavior by means of functions that
* can be invoked from generic window code.
*/
static Tk_ClassProcs textClass = {
sizeof(Tk_ClassProcs), /* size */
TextWorldChangedCallback, /* worldChangedProc */
};
/*
*--------------------------------------------------------------
*
* Tk_TextObjCmd --
*
* This function is invoked to process the "text" Tcl command. See the
* user documentation for details on what it does.
*
* Results:
* A standard Tcl result.
*
* Side effects:
* See the user documentation.
*
*--------------------------------------------------------------
*/
int
Tk_TextObjCmd(
ClientData clientData, /* Main window associated with interpreter. */
Tcl_Interp *interp, /* Current interpreter. */
int objc, /* Number of arguments. */
Tcl_Obj *CONST objv[]) /* Argument objects. */
{
Tk_Window tkwin = (Tk_Window) clientData;
if (objc < 2) {
Tcl_WrongNumArgs(interp, 1, objv, "pathName ?options?");
return TCL_ERROR;
}
return CreateWidget(NULL, tkwin, interp, NULL, objc, objv);
}
/*
*--------------------------------------------------------------
*
* CreateWidget --
*
* This function is invoked to process the "text" Tcl command, (when
* called by Tk_TextObjCmd) and the "$text peer create" text widget
* sub-command (called from TextPeerCmd).
*
* See the user documentation for details on what it does.
*
* Results:
* A standard Tcl result, places the name of the widget created into the
* interp's result.
*
* Side effects:
* See the user documentation.
*
*--------------------------------------------------------------
*/
static int
CreateWidget(
TkSharedText *sharedPtr, /* Shared widget info, or NULL. */
Tk_Window tkwin, /* Main window associated with interpreter. */
Tcl_Interp *interp, /* Current interpreter. */
CONST TkText *parent, /* If non-NULL then take default start, end
* from this parent. */
int objc, /* Number of arguments. */
Tcl_Obj *CONST objv[]) /* Argument objects. */
{
register TkText *textPtr;
Tk_OptionTable optionTable;
TkTextIndex startIndex;
Tk_Window newWin;
/*
* Create the window.
*/
newWin = Tk_CreateWindowFromPath(interp, tkwin, Tcl_GetString(objv[1]),
NULL);
if (newWin == NULL) {
return TCL_ERROR;
}
/*
* Create the text widget and initialize everything to zero, then set the
* necessary initial (non-NULL) values. It is important that the 'set' tag
* and 'insert', 'current' mark pointers are all NULL to start.
*/
textPtr = (TkText *) ckalloc(sizeof(TkText));
memset(textPtr, 0, sizeof(TkText));
textPtr->tkwin = newWin;
textPtr->display = Tk_Display(newWin);
textPtr->interp = interp;
textPtr->widgetCmd = Tcl_CreateObjCommand(interp,
Tk_PathName(textPtr->tkwin), TextWidgetObjCmd,
(ClientData) textPtr, TextCmdDeletedProc);
if (sharedPtr == NULL) {
sharedPtr = (TkSharedText *) ckalloc(sizeof(TkSharedText));
memset(sharedPtr, 0, sizeof(TkSharedText));
sharedPtr->refCount = 0;
sharedPtr->peers = NULL;
sharedPtr->tree = TkBTreeCreate(sharedPtr);
Tcl_InitHashTable(&sharedPtr->tagTable, TCL_STRING_KEYS);
Tcl_InitHashTable(&sharedPtr->markTable, TCL_STRING_KEYS);
Tcl_InitHashTable(&sharedPtr->windowTable, TCL_STRING_KEYS);
Tcl_InitHashTable(&sharedPtr->imageTable, TCL_STRING_KEYS);
sharedPtr->undoStack = TkUndoInitStack(interp,0);
sharedPtr->undo = 1;
sharedPtr->isDirtyIncrement = 1;
sharedPtr->autoSeparators = 1;
sharedPtr->lastEditMode = TK_TEXT_EDIT_OTHER;
sharedPtr->stateEpoch = 0;
}
/*
* Add the new widget to the shared list.
*/
textPtr->sharedTextPtr = sharedPtr;
sharedPtr->refCount++;
textPtr->next = sharedPtr->peers;
sharedPtr->peers = textPtr;
/*
* This refCount will be held until DestroyText is called. Note also that
* the later call to 'TkTextCreateDInfo' will add more refCounts.
*/
textPtr->refCount = 1;
/*
* Specify start and end lines in the B-tree. The default is the same as
* the parent, but this can be adjusted to display more or less if the
* start, end where given as configuration options.
*/
if (parent != NULL) {
textPtr->start = parent->start;
textPtr->end = parent->end;
} else {
textPtr->start = NULL;
textPtr->end = NULL;
}
/*
* Register with the B-tree. In some sense it would be best if we could do
* this later (after configuration options), so that any changes to
* start,end do not require a total recalculation.
*/
TkBTreeAddClient(sharedPtr->tree, textPtr, textPtr->charHeight);
textPtr->state = TK_TEXT_STATE_NORMAL;
textPtr->relief = TK_RELIEF_FLAT;
textPtr->cursor = None;
textPtr->charWidth = 1;
textPtr->charHeight = 10;
textPtr->wrapMode = TEXT_WRAPMODE_CHAR;
textPtr->prevWidth = Tk_Width(newWin);
textPtr->prevHeight = Tk_Height(newWin);
/*
* This will add refCounts to textPtr.
*/
TkTextCreateDInfo(textPtr);
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, textPtr, 0, 0,
&startIndex);
TkTextSetYView(textPtr, &startIndex, 0);
textPtr->exportSelection = 1;
textPtr->pickEvent.type = LeaveNotify;
textPtr->undo = textPtr->sharedTextPtr->undo;
textPtr->maxUndo = textPtr->sharedTextPtr->maxUndo;
textPtr->autoSeparators = textPtr->sharedTextPtr->autoSeparators;
textPtr->tabOptionPtr = NULL;
/*
* Create the "sel" tag and the "current" and "insert" marks.
*/
textPtr->selBorder = NULL;
textPtr->inactiveSelBorder = NULL;
textPtr->selBorderWidth = 0;
textPtr->selBorderWidthPtr = NULL;
textPtr->selFgColorPtr = NULL;
/*
* Note: it is important that textPtr->selTagPtr is NULL before this
* initial call.
*/
textPtr->selTagPtr = TkTextCreateTag(textPtr, "sel", NULL);
textPtr->selTagPtr->reliefString = (char *)
ckalloc(sizeof(DEF_TEXT_SELECT_RELIEF));
strcpy(textPtr->selTagPtr->reliefString, DEF_TEXT_SELECT_RELIEF);
Tk_GetRelief(interp, DEF_TEXT_SELECT_RELIEF, &textPtr->selTagPtr->relief);
textPtr->currentMarkPtr = TkTextSetMark(textPtr, "current", &startIndex);
textPtr->insertMarkPtr = TkTextSetMark(textPtr, "insert", &startIndex);
/*
* Create the option table for this widget class. If it has already been
* created, the cached pointer will be returned.
*/
optionTable = Tk_CreateOptionTable(interp, optionSpecs);
Tk_SetClass(textPtr->tkwin, "Text");
Tk_SetClassProcs(textPtr->tkwin, &textClass, (ClientData) textPtr);
textPtr->optionTable = optionTable;
Tk_CreateEventHandler(textPtr->tkwin,
ExposureMask|StructureNotifyMask|FocusChangeMask,
TextEventProc, (ClientData) textPtr);
Tk_CreateEventHandler(textPtr->tkwin, KeyPressMask|KeyReleaseMask
|ButtonPressMask|ButtonReleaseMask|EnterWindowMask
|LeaveWindowMask|PointerMotionMask|VirtualEventMask,
TkTextBindProc, (ClientData) textPtr);
Tk_CreateSelHandler(textPtr->tkwin, XA_PRIMARY, XA_STRING,
TextFetchSelection, (ClientData) textPtr, XA_STRING);
if (Tk_InitOptions(interp, (char *) textPtr, optionTable, textPtr->tkwin)
!= TCL_OK) {
Tk_DestroyWindow(textPtr->tkwin);
return TCL_ERROR;
}
if (ConfigureText(interp, textPtr, objc-2, objv+2) != TCL_OK) {
Tk_DestroyWindow(textPtr->tkwin);
return TCL_ERROR;
}
Tcl_SetObjResult(interp,
Tcl_NewStringObj(Tk_PathName(textPtr->tkwin),-1));
return TCL_OK;
}
/*
*--------------------------------------------------------------
*
* TextWidgetObjCmd --
*
* This function is invoked to process the Tcl command that corresponds
* to a text widget. See the user documentation for details on what it
* does.
*
* Results:
* A standard Tcl result.
*
* Side effects:
* See the user documentation.
*
*--------------------------------------------------------------
*/
static int
TextWidgetObjCmd(
ClientData clientData, /* Information about text widget. */
Tcl_Interp *interp, /* Current interpreter. */
int objc, /* Number of arguments. */
Tcl_Obj *CONST objv[]) /* Argument objects. */
{
register TkText *textPtr = (TkText *) clientData;
int result = TCL_OK;
int index;
static CONST char *optionStrings[] = {
"bbox", "cget", "compare", "configure", "count", "debug", "delete",
"dlineinfo", "dump", "edit", "get", "image", "index", "insert",
"mark", "peer", "replace", "scan", "search", "see", "tag", "window",
"xview", "yview", NULL
};
enum options {
TEXT_BBOX, TEXT_CGET, TEXT_COMPARE, TEXT_CONFIGURE, TEXT_COUNT,
TEXT_DEBUG, TEXT_DELETE, TEXT_DLINEINFO, TEXT_DUMP, TEXT_EDIT,
TEXT_GET, TEXT_IMAGE, TEXT_INDEX, TEXT_INSERT, TEXT_MARK,
TEXT_PEER, TEXT_REPLACE, TEXT_SCAN, TEXT_SEARCH, TEXT_SEE,
TEXT_TAG, TEXT_WINDOW, TEXT_XVIEW, TEXT_YVIEW
};
if (objc < 2) {
Tcl_WrongNumArgs(interp, 1, objv, "option ?arg arg ...?");
return TCL_ERROR;
}
if (Tcl_GetIndexFromObj(interp, objv[1], optionStrings, "option", 0,
&index) != TCL_OK) {
return TCL_ERROR;
}
textPtr->refCount++;
switch ((enum options) index) {
case TEXT_BBOX: {
int x, y, width, height;
CONST TkTextIndex *indexPtr;
if (objc != 3) {
Tcl_WrongNumArgs(interp, 2, objv, "index");
result = TCL_ERROR;
goto done;
}
indexPtr = TkTextGetIndexFromObj(interp, textPtr, objv[2]);
if (indexPtr == NULL) {
result = TCL_ERROR;
goto done;
}
if (TkTextIndexBbox(textPtr, indexPtr, &x, &y, &width, &height,
NULL) == 0) {
Tcl_Obj *listObj = Tcl_NewListObj(0, NULL);
Tcl_ListObjAppendElement(interp, listObj, Tcl_NewIntObj(x));
Tcl_ListObjAppendElement(interp, listObj, Tcl_NewIntObj(y));
Tcl_ListObjAppendElement(interp, listObj, Tcl_NewIntObj(width));
Tcl_ListObjAppendElement(interp, listObj, Tcl_NewIntObj(height));
Tcl_SetObjResult(interp, listObj);
}
break;
}
case TEXT_CGET:
if (objc != 3) {
Tcl_WrongNumArgs(interp, 2, objv, "option");
result = TCL_ERROR;
goto done;
} else {
Tcl_Obj *objPtr = Tk_GetOptionValue(interp, (char *) textPtr,
textPtr->optionTable, objv[2], textPtr->tkwin);
if (objPtr == NULL) {
result = TCL_ERROR;
goto done;
} else {
Tcl_SetObjResult(interp, objPtr);
result = TCL_OK;
}
}
break;
case TEXT_COMPARE: {
int relation, value;
CONST char *p;
CONST TkTextIndex *index1Ptr, *index2Ptr;
if (objc != 5) {
Tcl_WrongNumArgs(interp, 2, objv, "index1 op index2");
result = TCL_ERROR;
goto done;
}
index1Ptr = TkTextGetIndexFromObj(interp, textPtr, objv[2]);
index2Ptr = TkTextGetIndexFromObj(interp, textPtr, objv[4]);
if (index1Ptr == NULL || index2Ptr == NULL) {
result = TCL_ERROR;
goto done;
}
relation = TkTextIndexCmp(index1Ptr, index2Ptr);
p = Tcl_GetString(objv[3]);
if (p[0] == '<') {
value = (relation < 0);
if ((p[1] == '=') && (p[2] == 0)) {
value = (relation <= 0);
} else if (p[1] != 0) {
compareError:
Tcl_AppendResult(interp, "bad comparison operator \"",
Tcl_GetString(objv[3]),
"\": must be <, <=, ==, >=, >, or !=", NULL);
result = TCL_ERROR;
goto done;
}
} else if (p[0] == '>') {
value = (relation > 0);
if ((p[1] == '=') && (p[2] == 0)) {
value = (relation >= 0);
} else if (p[1] != 0) {
goto compareError;
}
} else if ((p[0] == '=') && (p[1] == '=') && (p[2] == 0)) {
value = (relation == 0);
} else if ((p[0] == '!') && (p[1] == '=') && (p[2] == 0)) {
value = (relation != 0);
} else {
goto compareError;
}
Tcl_SetObjResult(interp, Tcl_NewBooleanObj(value));
break;
}
case TEXT_CONFIGURE:
if (objc <= 3) {
Tcl_Obj *objPtr = Tk_GetOptionInfo(interp, (char *) textPtr,
textPtr->optionTable, ((objc == 3) ? objv[2] : NULL),
textPtr->tkwin);
if (objPtr == NULL) {
result = TCL_ERROR;
goto done;
} else {
Tcl_SetObjResult(interp, objPtr);
}
} else {
result = ConfigureText(interp, textPtr, objc-2, objv+2);
}
break;
case TEXT_COUNT: {
CONST TkTextIndex *indexFromPtr, *indexToPtr;
int i, found = 0, update = 0;
Tcl_Obj *objPtr = NULL;
if (objc < 4) {
Tcl_WrongNumArgs(interp, 2, objv, "?options? index1 index2");
result = TCL_ERROR;
goto done;
}
indexFromPtr = TkTextGetIndexFromObj(interp, textPtr, objv[objc-2]);
if (indexFromPtr == NULL) {
result = TCL_ERROR;
goto done;
}
indexToPtr = TkTextGetIndexFromObj(interp, textPtr, objv[objc-1]);
if (indexToPtr == NULL) {
result = TCL_ERROR;
goto done;
}
for (i = 2; i < objc-2; i++) {
int value, length;
CONST char *option = Tcl_GetStringFromObj(objv[i], &length);
char c;
if (length < 2 || option[0] != '-') {
badOption:
Tcl_ResetResult(interp);
Tcl_AppendResult(interp, "bad option \"",
Tcl_GetString(objv[i]),
"\" must be -chars, -displaychars, -displayindices, ",
"-displaylines, -indices, -lines, -update, ",
"-xpixels, or -ypixels", NULL);
result = TCL_ERROR;
goto done;
}
c = option[1];
if (c == 'c' && !strncmp("-chars", option, (unsigned) length)) {
value = CountIndices(textPtr, indexFromPtr, indexToPtr,
COUNT_CHARS);
} else if (c == 'd' && (length > 8)
&& !strncmp("-displaychars", option, (unsigned) length)) {
value = CountIndices(textPtr, indexFromPtr, indexToPtr,
COUNT_DISPLAY_CHARS);
} else if (c == 'd' && (length > 8)
&& !strncmp("-displayindices", option,(unsigned)length)) {
value = CountIndices(textPtr, indexFromPtr, indexToPtr,
COUNT_DISPLAY_INDICES);
} else if (c == 'd' && (length > 8)
&& !strncmp("-displaylines", option, (unsigned) length)) {
TkTextLine *fromPtr, *lastPtr;
TkTextIndex index;
int compare = TkTextIndexCmp(indexFromPtr, indexToPtr);
value = 0;
if (compare == 0) {
goto countDone;
}
if (compare > 0) {
CONST TkTextIndex *tmpPtr = indexFromPtr;
indexFromPtr = indexToPtr;
indexToPtr = tmpPtr;
}
lastPtr = TkBTreeFindLine(textPtr->sharedTextPtr->tree,
textPtr,
TkBTreeNumLines(textPtr->sharedTextPtr->tree,textPtr));
fromPtr = indexFromPtr->linePtr;
if (fromPtr == lastPtr) {
goto countDone;
}
/*
* Caution: we must NEVER call TkTextUpdateOneLine with the
* last artificial line in the widget.
*/
index = *indexFromPtr;
index.byteIndex = 0;
/*
* We're going to count up all display lines in the logical
* line of 'indexFromPtr' up to, but not including the logical
* line of 'indexToPtr', and then subtract off what we didn't
* what from 'from' and add on what we didn't count from 'to.
*/
while (index.linePtr != indexToPtr->linePtr) {
value += TkTextUpdateOneLine(textPtr, fromPtr,0,&index,0);
/*
* We might have skipped past indexToPtr, if we have
* multiple logical lines in a single display line.
* Therefore we iterate through each intermediate logical
* line, just to check. Another approach would be just to
* use TkTextIndexCmp on every while() iteration, but that
* would be less efficient.
*/
while (fromPtr != index.linePtr) {
fromPtr = TkBTreeNextLine(textPtr, fromPtr);
if (fromPtr == indexToPtr->linePtr) {
break;
}
}
}
/*
* Now we need to adjust the count to add on the number of
* display lines in the last logical line, and subtract off
* the number of display lines overcounted in the first
* logical line. This logic is still ok if both indices are in
* the same logical line.
*/
index.linePtr = indexFromPtr->linePtr;
index.byteIndex = 0;
while (1) {
TkTextFindDisplayLineEnd(textPtr, &index, 1, NULL);
if (index.byteIndex >= indexFromPtr->byteIndex) {
break;
}
TkTextIndexForwBytes(textPtr, &index, 1, &index);
value--;
}
if (indexToPtr->linePtr != lastPtr) {
index.linePtr = indexToPtr->linePtr;
index.byteIndex = 0;
while (1) {
TkTextFindDisplayLineEnd(textPtr, &index, 1, NULL);
if (index.byteIndex >= indexToPtr->byteIndex) {
break;
}
TkTextIndexForwBytes(textPtr, &index, 1, &index);
value++;
}
}
if (compare > 0) {
value = -value;
}
} else if (c == 'i'
&& !strncmp("-indices", option, (unsigned) length)) {
value = CountIndices(textPtr, indexFromPtr, indexToPtr,
COUNT_INDICES);
} else if (c == 'l'
&& !strncmp("-lines", option, (unsigned) length)) {
value = TkBTreeLinesTo(textPtr, indexToPtr->linePtr)
- TkBTreeLinesTo(textPtr, indexFromPtr->linePtr);
} else if (c == 'u'
&& !strncmp("-update", option, (unsigned) length)) {
update = 1;
continue;
} else if (c == 'x'
&& !strncmp("-xpixels", option, (unsigned) length)) {
int x1, x2;
TkTextIndex index;
index = *indexFromPtr;
TkTextFindDisplayLineEnd(textPtr, &index, 0, &x1);
index = *indexToPtr;
TkTextFindDisplayLineEnd(textPtr, &index, 0, &x2);
value = x2 - x1;
} else if (c == 'y'
&& !strncmp("-ypixels", option, (unsigned) length)) {
if (update) {
TkTextUpdateLineMetrics(textPtr,
TkBTreeLinesTo(textPtr, indexFromPtr->linePtr),
TkBTreeLinesTo(textPtr, indexToPtr->linePtr), -1);
}
value = TkTextIndexYPixels(textPtr, indexToPtr)
- TkTextIndexYPixels(textPtr, indexFromPtr);
} else {
goto badOption;
}
countDone:
found++;
if (found == 1) {
Tcl_SetObjResult(interp, Tcl_NewIntObj(value));
} else {
if (found == 2) {
/*
* Move the first item we put into the result into the
* first element of the list object.
*/
objPtr = Tcl_NewObj();
Tcl_ListObjAppendElement(NULL, objPtr,
Tcl_GetObjResult(interp));
}
Tcl_ListObjAppendElement(NULL, objPtr, Tcl_NewIntObj(value));
}
}
if (found == 0) {
/*
* Use the default '-indices'.
*/
int value = CountIndices(textPtr, indexFromPtr, indexToPtr,
COUNT_INDICES);
Tcl_SetObjResult(interp, Tcl_NewIntObj(value));
} else if (found > 1) {
Tcl_SetObjResult(interp, objPtr);
}
break;
}
case TEXT_DEBUG:
if (objc > 3) {
Tcl_WrongNumArgs(interp, 2, objv, "boolean");
result = TCL_ERROR;
goto done;
}
if (objc == 2) {
Tcl_SetObjResult(interp, Tcl_NewBooleanObj(tkBTreeDebug));
} else {
if (Tcl_GetBooleanFromObj(interp, objv[2],
&tkBTreeDebug) != TCL_OK) {
result = TCL_ERROR;
goto done;
}
tkTextDebug = tkBTreeDebug;
}
break;
case TEXT_DELETE:
if (objc < 3) {
Tcl_WrongNumArgs(interp, 2, objv, "index1 ?index2 ...?");
result = TCL_ERROR;
goto done;
}
if (textPtr->state == TK_TEXT_STATE_NORMAL) {
if (objc < 5) {
/*
* Simple case requires no predetermination of indices.
*/
CONST TkTextIndex *indexPtr1, *indexPtr2;
/*
* Parse the starting and stopping indices.
*/
indexPtr1 = TkTextGetIndexFromObj(textPtr->interp, textPtr,
objv[2]);
if (indexPtr1 == NULL) {
result = TCL_ERROR;
goto done;
}
if (objc == 4) {
indexPtr2 = TkTextGetIndexFromObj(textPtr->interp,
textPtr, objv[3]);
if (indexPtr2 == NULL) {
result = TCL_ERROR;
goto done;
}
} else {
indexPtr2 = NULL;
}
DeleteIndexRange(NULL, textPtr, indexPtr1, indexPtr2, 1);
} else {
/*
* Multi-index pair case requires that we prevalidate the
* indices and sort from last to first so that deletes occur
* in the exact (unshifted) text. It also needs to handle
* partial and fully overlapping ranges. We have to do this
* with multiple passes.
*/
TkTextIndex *indices, *ixStart, *ixEnd, *lastStart;
char *useIdx;
int i;
objc -= 2;
objv += 2;
indices = (TkTextIndex *)
ckalloc((objc + 1) * sizeof(TkTextIndex));
/*
* First pass verifies that all indices are valid.
*/
for (i = 0; i < objc; i++) {
CONST TkTextIndex *indexPtr =
TkTextGetIndexFromObj(interp, textPtr, objv[i]);
if (indexPtr == NULL) {
result = TCL_ERROR;
ckfree((char *) indices);
goto done;
}
indices[i] = *indexPtr;
}
/*
* Pad out the pairs evenly to make later code easier.
*/
if (objc & 1) {
indices[i] = indices[i-1];
TkTextIndexForwChars(NULL, &indices[i], 1, &indices[i],
COUNT_INDICES);
objc++;
}
useIdx = (char *) ckalloc((unsigned) objc);
memset(useIdx, 0, (unsigned) objc);
/*
* Do a decreasing order sort so that we delete the end ranges
* first to maintain index consistency.
*/
qsort(indices, (unsigned) objc / 2,
2 * sizeof(TkTextIndex), TextIndexSortProc);
lastStart = NULL;
/*
* Second pass will handle bogus ranges (end < start) and
* overlapping ranges.
*/
for (i = 0; i < objc; i += 2) {
ixStart = &indices[i];
ixEnd = &indices[i+1];
if (TkTextIndexCmp(ixEnd, ixStart) <= 0) {
continue;
}
if (lastStart) {
if (TkTextIndexCmp(ixStart, lastStart) == 0) {
/*
* Start indices were equal, and the sort placed
* the longest range first, so skip this one.
*/
continue;
} else if (TkTextIndexCmp(lastStart, ixEnd) < 0) {
/*
* The next pair has a start range before the end
* point of the last range. Constrain the delete
* range, but use the pointer values.
*/
*ixEnd = *lastStart;
if (TkTextIndexCmp(ixEnd, ixStart) <= 0) {
continue;
}
}
}
lastStart = ixStart;
useIdx[i] = 1;
}
/*
* Final pass take the input from the previous and deletes the
* ranges which are flagged to be deleted.
*/
for (i = 0; i < objc; i += 2) {
if (useIdx[i]) {
/*
* We don't need to check the return value because all
* indices are preparsed above.
*/
DeleteIndexRange(NULL, textPtr, &indices[i],
&indices[i+1], 1);
}
}
ckfree((char *) indices);
}
}
break;
case TEXT_DLINEINFO: {
int x, y, width, height, base;
CONST TkTextIndex *indexPtr;
if (objc != 3) {
Tcl_WrongNumArgs(interp, 2, objv, "index");
result = TCL_ERROR;
goto done;
}
indexPtr = TkTextGetIndexFromObj(interp, textPtr, objv[2]);
if (indexPtr == NULL) {
result = TCL_ERROR;
goto done;
}
if (TkTextDLineInfo(textPtr, indexPtr, &x, &y, &width, &height,
&base) == 0) {
Tcl_Obj *listObj = Tcl_NewListObj(0, NULL);
Tcl_ListObjAppendElement(interp, listObj, Tcl_NewIntObj(x));
Tcl_ListObjAppendElement(interp, listObj, Tcl_NewIntObj(y));
Tcl_ListObjAppendElement(interp, listObj, Tcl_NewIntObj(width));
Tcl_ListObjAppendElement(interp, listObj, Tcl_NewIntObj(height));
Tcl_ListObjAppendElement(interp, listObj, Tcl_NewIntObj(base));
Tcl_SetObjResult(interp, listObj);
}
break;
}
case TEXT_DUMP:
result = TextDumpCmd(textPtr, interp, objc, objv);
break;
case TEXT_EDIT:
result = TextEditCmd(textPtr, interp, objc, objv);
break;
case TEXT_GET: {
Tcl_Obj *objPtr = NULL;
int i, found = 0, visible = 0;
CONST char *name;
int length;
if (objc < 3) {
Tcl_WrongNumArgs(interp, 2, objv,
"?-displaychars? ?--? index1 ?index2 ...?");
result = TCL_ERROR;
goto done;
}
/*
* Simple, restrictive argument parsing. The only options are -- and
* -displaychars (or any unique prefix).
*/
i = 2;
if (objc > 3) {
name = Tcl_GetStringFromObj(objv[i], &length);
if (length > 1 && name[0] == '-') {
if (strncmp("-displaychars", name, (unsigned)length)==0) {
i++;
visible = 1;
name = Tcl_GetStringFromObj(objv[i], &length);
}
if ((i < objc-1) && (length == 2) && !strcmp("--", name)) {
i++;
}
}
}
for (; i < objc; i += 2) {
CONST TkTextIndex *index1Ptr, *index2Ptr;
TkTextIndex index2;
index1Ptr = TkTextGetIndexFromObj(interp, textPtr, objv[i]);
if (index1Ptr == NULL) {
if (objPtr) {
Tcl_DecrRefCount(objPtr);
}
result = TCL_ERROR;
goto done;
}
if (i+1 == objc) {
TkTextIndexForwChars(NULL, index1Ptr, 1, &index2,
COUNT_INDICES);
index2Ptr = &index2;
} else {
index2Ptr = TkTextGetIndexFromObj(interp, textPtr, objv[i+1]);
if (index2Ptr == NULL) {
if (objPtr) {
Tcl_DecrRefCount(objPtr);
}
result = TCL_ERROR;
goto done;
}
}
if (TkTextIndexCmp(index1Ptr, index2Ptr) < 0) {
/*
* We want to move the text we get from the window into the
* result, but since this could in principle be a megabyte or
* more, we want to do it efficiently!
*/
Tcl_Obj *get = TextGetText(textPtr, index1Ptr, index2Ptr,
visible);
found++;
if (found == 1) {
Tcl_SetObjResult(interp, get);
} else {
if (found == 2) {
/*
* Move the first item we put into the result into the
* first element of the list object.
*/
objPtr = Tcl_NewObj();
Tcl_ListObjAppendElement(NULL, objPtr,
Tcl_GetObjResult(interp));
}
Tcl_ListObjAppendElement(NULL, objPtr, get);
}
}
}
if (found > 1) {
Tcl_SetObjResult(interp, objPtr);
}
break;
}
case TEXT_IMAGE:
result = TkTextImageCmd(textPtr, interp, objc, objv);
break;
case TEXT_INDEX: {
CONST TkTextIndex *indexPtr;
if (objc != 3) {
Tcl_WrongNumArgs(interp, 2, objv, "index");
result = TCL_ERROR;
goto done;
}
indexPtr = TkTextGetIndexFromObj(interp, textPtr, objv[2]);
if (indexPtr == NULL) {
result = TCL_ERROR;
goto done;
}
Tcl_SetObjResult(interp, TkTextNewIndexObj(textPtr, indexPtr));
break;
}
case TEXT_INSERT: {
CONST TkTextIndex *indexPtr;
if (objc < 4) {
Tcl_WrongNumArgs(interp, 2, objv,
"index chars ?tagList chars tagList ...?");
result = TCL_ERROR;
goto done;
}
indexPtr = TkTextGetIndexFromObj(interp, textPtr, objv[2]);
if (indexPtr == NULL) {
result = TCL_ERROR;
goto done;
}
if (textPtr->state == TK_TEXT_STATE_NORMAL) {
result = TextInsertCmd(NULL, textPtr, interp, objc-3, objv+3,
indexPtr, 1);
}
break;
}
case TEXT_MARK:
result = TkTextMarkCmd(textPtr, interp, objc, objv);
break;
case TEXT_PEER:
result = TextPeerCmd(textPtr, interp, objc, objv);
break;
case TEXT_REPLACE: {
CONST TkTextIndex *indexFromPtr, *indexToPtr;
if (objc < 5) {
Tcl_WrongNumArgs(interp, 2, objv,
"index1 index2 chars ?tagList chars tagList ...?");
result = TCL_ERROR;
goto done;
}
indexFromPtr = TkTextGetIndexFromObj(interp, textPtr, objv[2]);
if (indexFromPtr == NULL) {
result = TCL_ERROR;
goto done;
}
indexToPtr = TkTextGetIndexFromObj(interp, textPtr, objv[3]);
if (indexToPtr == NULL) {
result = TCL_ERROR;
goto done;
}
if (TkTextIndexCmp(indexFromPtr, indexToPtr) > 0) {
Tcl_AppendResult(interp, "Index \"", Tcl_GetString(objv[3]),
"\" before \"", Tcl_GetString(objv[2]),
"\" in the text", NULL);
result = TCL_ERROR;
goto done;
}
if (textPtr->state == TK_TEXT_STATE_NORMAL) {
int lineNum, byteIndex;
TkTextIndex index;
/*
* The 'replace' operation is quite complex to do correctly,
* because we want a number of criteria to hold:
*
* 1. The insertion point shouldn't move, unless it is within the
* deleted range. In this case it should end up after the new
* text.
*
* 2. The window should not change the text it shows - should not
* scroll vertically - unless the result of the replace is
* that the insertion position which used to be on-screen is
* now off-screen.
*/
byteIndex = textPtr->topIndex.byteIndex;
lineNum = TkBTreeLinesTo(textPtr, textPtr->topIndex.linePtr);
TkTextMarkSegToIndex(textPtr, textPtr->insertMarkPtr, &index);
if ((TkTextIndexCmp(indexFromPtr, &index) < 0)
&& (TkTextIndexCmp(indexToPtr, &index) > 0)) {
/*
* The insertion point is inside the range to be replaced, so
* we have to do some calculations to ensure it doesn't move
* unnecessarily.
*/
int deleteInsertOffset, insertLength, j;
insertLength = 0;
for (j = 4; j < objc; j += 2) {
insertLength += Tcl_GetCharLength(objv[j]);
}
/*
* Calculate 'deleteInsertOffset' as an offset we will apply
* to the insertion point after this operation.
*/
deleteInsertOffset = CountIndices(textPtr, indexFromPtr,
&index, COUNT_CHARS);
if (deleteInsertOffset > insertLength) {
deleteInsertOffset = insertLength;
}
result = TextReplaceCmd(textPtr, interp, indexFromPtr,
indexToPtr, objc, objv, 0);
if (result == TCL_OK) {
/*
* Move the insertion position to the correct place.
*/
TkTextIndexForwChars(NULL, indexFromPtr,
deleteInsertOffset, &index, COUNT_INDICES);
TkBTreeUnlinkSegment(textPtr->insertMarkPtr,
textPtr->insertMarkPtr->body.mark.linePtr);
TkBTreeLinkSegment(textPtr->insertMarkPtr, &index);
}
} else {
result = TextReplaceCmd(textPtr, interp, indexFromPtr,
indexToPtr, objc, objv, 1);
}
if (result == TCL_OK) {
/*
* Now ensure the top-line is in the right place.
*/
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, textPtr,
lineNum, byteIndex, &index);
TkTextSetYView(textPtr, &index, TK_TEXT_NOPIXELADJUST);
}
}
break;
}
case TEXT_SCAN:
result = TkTextScanCmd(textPtr, interp, objc, objv);
break;
case TEXT_SEARCH:
result = TextSearchCmd(textPtr, interp, objc, objv);
break;
case TEXT_SEE:
result = TkTextSeeCmd(textPtr, interp, objc, objv);
break;
case TEXT_TAG:
result = TkTextTagCmd(textPtr, interp, objc, objv);
break;
case TEXT_WINDOW:
result = TkTextWindowCmd(textPtr, interp, objc, objv);
break;
case TEXT_XVIEW:
result = TkTextXviewCmd(textPtr, interp, objc, objv);
break;
case TEXT_YVIEW:
result = TkTextYviewCmd(textPtr, interp, objc, objv);
break;
}
done:
textPtr->refCount--;
if (textPtr->refCount == 0) {
ckfree((char *) textPtr);
}
return result;
}
/*
*--------------------------------------------------------------
*
* SharedTextObjCmd --
*
* This function is invoked to process commands on the shared portion of
* a text widget. Currently it is not actually exported as a Tcl command,
* and is only used internally to process parts of undo/redo scripts.
* See the user documentation for 'text' for details on what it does -
* the only subcommands it currently supports are 'insert' and 'delete'.
*
* Results:
* A standard Tcl result.
*
* Side effects:
* See the user documentation for "text".
*
*--------------------------------------------------------------
*/
static int
SharedTextObjCmd(
ClientData clientData, /* Information about shared test B-tree. */
Tcl_Interp *interp, /* Current interpreter. */
int objc, /* Number of arguments. */
Tcl_Obj *CONST objv[]) /* Argument objects. */
{
register TkSharedText *sharedPtr = (TkSharedText *) clientData;
int result = TCL_OK;
int index;
static CONST char *optionStrings[] = {
"delete", "insert", NULL
};
enum options {
TEXT_DELETE, TEXT_INSERT
};
if (objc < 2) {
Tcl_WrongNumArgs(interp, 1, objv, "option ?arg arg ...?");
return TCL_ERROR;
}
if (Tcl_GetIndexFromObj(interp, objv[1], optionStrings, "option", 0,
&index) != TCL_OK) {
return TCL_ERROR;
}
switch ((enum options) index) {
case TEXT_DELETE:
if (objc < 3) {
Tcl_WrongNumArgs(interp, 2, objv, "index1 ?index2 ...?");
return TCL_ERROR;
}
if (objc < 5) {
/*
* Simple case requires no predetermination of indices.
*/
TkTextIndex index1;
/*
* Parse the starting and stopping indices.
*/
result = TkTextSharedGetObjIndex(interp, sharedPtr, objv[2],
&index1);
if (result != TCL_OK) {
return result;
}
if (objc == 4) {
TkTextIndex index2;
result = TkTextSharedGetObjIndex(interp, sharedPtr, objv[3],
&index2);
if (result != TCL_OK) {
return result;
}
DeleteIndexRange(sharedPtr, NULL, &index1, &index2, 1);
} else {
DeleteIndexRange(sharedPtr, NULL, &index1, NULL, 1);
}
return TCL_OK;
} else {
/* Too many arguments */
return TCL_ERROR;
}
break;
case TEXT_INSERT: {
TkTextIndex index1;
if (objc < 4) {
Tcl_WrongNumArgs(interp, 2, objv,
"index chars ?tagList chars tagList ...?");
return TCL_ERROR;
}
result = TkTextSharedGetObjIndex(interp, sharedPtr, objv[2],
&index1);
if (result != TCL_OK) {
return result;
}
return TextInsertCmd(sharedPtr, NULL, interp, objc-3, objv+3, &index1,
1);
}
default:
return TCL_OK;
}
}
/*
*--------------------------------------------------------------
*
* TextPeerCmd --
*
* This function is invoked to process the "text peer" Tcl command. See
* the user documentation for details on what it does.
*
* Results:
* A standard Tcl result.
*
* Side effects:
* See the user documentation.
*
*--------------------------------------------------------------
*/
static int
TextPeerCmd(
TkText *textPtr, /* Information about text widget. */
Tcl_Interp *interp, /* Current interpreter. */
int objc, /* Number of arguments. */
Tcl_Obj *CONST objv[]) /* Argument objects. */
{
Tk_Window tkwin = textPtr->tkwin;
int index;
static CONST char *peerOptionStrings[] = {
"create", "names", NULL
};
enum peerOptions {
PEER_CREATE, PEER_NAMES
};
if (objc < 3) {
Tcl_WrongNumArgs(interp, 2, objv, "option ?arg arg ...?");
return TCL_ERROR;
}
if (Tcl_GetIndexFromObj(interp, objv[2], peerOptionStrings,
"peer option", 0, &index) != TCL_OK) {
return TCL_ERROR;
}
switch ((enum peerOptions)index) {
case PEER_CREATE:
if (objc < 4) {
Tcl_WrongNumArgs(interp, 3, objv, "pathName ?options?");
return TCL_ERROR;
}
return CreateWidget(textPtr->sharedTextPtr, tkwin, interp, textPtr,
objc-2, objv+2);
case PEER_NAMES: {
TkText *tPtr = textPtr->sharedTextPtr->peers;
if (objc > 3) {
Tcl_WrongNumArgs(interp, 3, objv, NULL);
return TCL_ERROR;
}
while (tPtr != NULL) {
if (tPtr != textPtr) {
Tcl_AppendElement(interp, Tk_PathName(tPtr->tkwin));
}
tPtr = tPtr->next;
}
}
}
return TCL_OK;
}
/*
*----------------------------------------------------------------------
*
* TextReplaceCmd --
*
* This function is invoked to process part of the "replace" widget
* command for text widgets.
*
* Results:
* A standard Tcl result.
*
* Side effects:
* See the user documentation.
*
* If 'viewUpdate' is false, then textPtr->topIndex may no longer be a
* valid index after this function returns. The caller is responsible for
* ensuring a correct index is in place.
*
*----------------------------------------------------------------------
*/
static int
TextReplaceCmd(
TkText *textPtr, /* Information about text widget. */
Tcl_Interp *interp, /* Current interpreter. */
CONST TkTextIndex *indexFromPtr,
/* Index from which to replace. */
CONST TkTextIndex *indexToPtr,
/* Index to which to replace. */
int objc, /* Number of arguments. */
Tcl_Obj *CONST objv[], /* Argument objects. */
int viewUpdate) /* Update vertical view if set. */
{
/*
* Perform the deletion and insertion, but ensure no undo-separator is
* placed between the two operations. Since we are using the helper
* functions 'DeleteIndexRange' and 'TextInsertCmd' we have to pretend
* that the autoSeparators setting is off, so that we don't get an
* undo-separator between the delete and insert.
*/
int origAutoSep = textPtr->sharedTextPtr->autoSeparators;
int result, lineNumber;
TkTextIndex indexTmp;
if (textPtr->sharedTextPtr->undo) {
textPtr->sharedTextPtr->autoSeparators = 0;
if (origAutoSep &&
textPtr->sharedTextPtr->lastEditMode!=TK_TEXT_EDIT_REPLACE) {
TkUndoInsertUndoSeparator(textPtr->sharedTextPtr->undoStack);
}
}
/*
* Must save and restore line in indexFromPtr based on line number; can't
* keep the line itself as that might be eliminated/invalidated when
* deleting the range. [Bug 1602537]
*/
indexTmp = *indexFromPtr;
lineNumber = TkBTreeLinesTo(textPtr, indexFromPtr->linePtr);
DeleteIndexRange(NULL, textPtr, indexFromPtr, indexToPtr, viewUpdate);
indexTmp.linePtr = TkBTreeFindLine(indexTmp.tree, textPtr, lineNumber);
result = TextInsertCmd(NULL, textPtr, interp, objc-4, objv+4,
&indexTmp, viewUpdate);
if (textPtr->sharedTextPtr->undo) {
textPtr->sharedTextPtr->lastEditMode = TK_TEXT_EDIT_REPLACE;
textPtr->sharedTextPtr->autoSeparators = origAutoSep;
}
return result;
}
/*
*----------------------------------------------------------------------
*
* TextIndexSortProc --
*
* This function is called by qsort when sorting an array of indices in
* *decreasing* order (last to first).
*
* Results:
* The return value is -1 if the first argument should be before the
* second element, 0 if it's equivalent, and 1 if it should be after the
* second element.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
static int
TextIndexSortProc(
CONST void *first, /* Elements to be compared. */
CONST void *second)
{
TkTextIndex *pair1 = (TkTextIndex *) first;
TkTextIndex *pair2 = (TkTextIndex *) second;
int cmp = TkTextIndexCmp(&pair1[1], &pair2[1]);
if (cmp == 0) {
/*
* If the first indices were equal, we want the second index of the
* pair also to be the greater. Use pointer magic to access the second
* index pair.
*/
cmp = TkTextIndexCmp(&pair1[0], &pair2[0]);
}
if (cmp > 0) {
return -1;
} else if (cmp < 0) {
return 1;
}
return 0;
}
/*
*----------------------------------------------------------------------
*
* DestroyText --
*
* This function is invoked when we receive a destroy event to clean up
* the internal structure of a text widget. We will free up most of the
* internal structure and delete the associated Tcl command. If there are
* no outstanding references to the widget, we also free up the textPtr
* itself.
*
* The widget has already been flagged as deleted.
*
* Results:
* None.
*
* Side effects:
* Either everything or almost everything associated with the text is
* freed up.
*
*----------------------------------------------------------------------
*/
static void
DestroyText(
TkText *textPtr) /* Info about text widget. */
{
Tcl_HashSearch search;
Tcl_HashEntry *hPtr;
TkTextTag *tagPtr;
TkSharedText *sharedTextPtr = textPtr->sharedTextPtr;
/*
* Free up all the stuff that requires special handling. We have already
* called let Tk_FreeConfigOptions to handle all the standard
* option-related stuff (and so none of that exists when we are called).
* Special note: free up display-related information before deleting the
* B-tree, since display-related stuff may refer to stuff in the B-tree.
*/
TkTextFreeDInfo(textPtr);
textPtr->dInfoPtr = NULL;
/*
* Remove ourselves from the peer list.
*/
if (sharedTextPtr->peers == textPtr) {
sharedTextPtr->peers = textPtr->next;
} else {
TkText *nextPtr = sharedTextPtr->peers;
while (nextPtr != NULL) {
if (nextPtr->next == textPtr) {
nextPtr->next = textPtr->next;
break;
}
nextPtr = nextPtr->next;
}
}
/*
* Always clean up the widget-specific tags first. Common tags (i.e. most)
* will only be cleaned up when the shared structure is cleaned up.
*
* We also need to clean up widget-specific marks ('insert', 'current'),
* since otherwise marks will never disappear from the B-tree.
*/
TkTextDeleteTag(textPtr, textPtr->selTagPtr);
TkBTreeUnlinkSegment(textPtr->insertMarkPtr,
textPtr->insertMarkPtr->body.mark.linePtr);
ckfree((char *) textPtr->insertMarkPtr);
TkBTreeUnlinkSegment(textPtr->currentMarkPtr,
textPtr->currentMarkPtr->body.mark.linePtr);
ckfree((char *) textPtr->currentMarkPtr);
/*
* Now we've cleaned up everything of relevance to us in the B-tree, so we
* disassociate outselves from it.
*
* When the refCount reaches zero, it's time to clean up the shared
* portion of the text widget.
*/
sharedTextPtr->refCount--;
if (sharedTextPtr->refCount > 0) {
TkBTreeRemoveClient(sharedTextPtr->tree, textPtr);
/*
* Free up any embedded windows which belong to this widget.
*/
for (hPtr = Tcl_FirstHashEntry(&sharedTextPtr->windowTable, &search);
hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
TkTextEmbWindowClient *loop;
TkTextSegment *ewPtr = (TkTextSegment *) Tcl_GetHashValue(hPtr);
loop = ewPtr->body.ew.clients;
if (loop->textPtr == textPtr) {
ewPtr->body.ew.clients = loop->next;
TkTextWinFreeClient(hPtr, loop);
} else {
TkTextEmbWindowClient *client = ewPtr->body.ew.clients;
client = loop->next;
while (client != NULL) {
if (client->textPtr == textPtr) {
loop->next = client->next;
TkTextWinFreeClient(hPtr, client);
break;
} else {
loop = loop->next;
}
client = loop->next;
}
}
}
} else {
/*
* No need to call 'TkBTreeRemoveClient' first, since this will do
* everything in one go, more quickly.
*/
TkBTreeDestroy(sharedTextPtr->tree);
for (hPtr = Tcl_FirstHashEntry(&sharedTextPtr->tagTable, &search);
hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
tagPtr = (TkTextTag *) Tcl_GetHashValue(hPtr);
/*
* No need to use 'TkTextDeleteTag' since we've already removed
* the B-tree completely.
*/
TkTextFreeTag(textPtr, tagPtr);
}
Tcl_DeleteHashTable(&sharedTextPtr->tagTable);
for (hPtr = Tcl_FirstHashEntry(&sharedTextPtr->markTable, &search);
hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
ckfree((char *) Tcl_GetHashValue(hPtr));
}
Tcl_DeleteHashTable(&sharedTextPtr->markTable);
TkUndoFreeStack(sharedTextPtr->undoStack);
Tcl_DeleteHashTable(&sharedTextPtr->windowTable);
Tcl_DeleteHashTable(&sharedTextPtr->imageTable);
if (sharedTextPtr->bindingTable != NULL) {
Tk_DeleteBindingTable(sharedTextPtr->bindingTable);
}
}
if (textPtr->tabArrayPtr != NULL) {
ckfree((char *) textPtr->tabArrayPtr);
}
if (textPtr->insertBlinkHandler != NULL) {
Tcl_DeleteTimerHandler(textPtr->insertBlinkHandler);
}
textPtr->tkwin = NULL;
textPtr->refCount--;
Tcl_DeleteCommandFromToken(textPtr->interp, textPtr->widgetCmd);
if (textPtr->refCount == 0) {
ckfree((char *) textPtr);
}
}
/*
*----------------------------------------------------------------------
*
* ConfigureText --
*
* This function is called to process an objv/objc list, plus the Tk
* option database, in order to configure (or reconfigure) a text widget.
*
* Results:
* The return value is a standard Tcl result. If TCL_ERROR is returned,
* then the interp's result contains an error message.
*
* Side effects:
* Configuration information, such as text string, colors, font, etc. get
* set for textPtr; old resources get freed, if there were any.
*
*----------------------------------------------------------------------
*/
static int
ConfigureText(
Tcl_Interp *interp, /* Used for error reporting. */
register TkText *textPtr, /* Information about widget; may or may not
* already have values for some fields. */
int objc, /* Number of arguments. */
Tcl_Obj *CONST objv[]) /* Argument objects. */
{
Tk_SavedOptions savedOptions;
int oldExport = textPtr->exportSelection;
int mask = 0;
if (Tk_SetOptions(interp, (char *) textPtr, textPtr->optionTable,
objc, objv, textPtr->tkwin, &savedOptions, &mask) != TCL_OK) {
return TCL_ERROR;
}
/*
* Copy down shared flags.
*/
textPtr->sharedTextPtr->undo = textPtr->undo;
textPtr->sharedTextPtr->maxUndo = textPtr->maxUndo;
textPtr->sharedTextPtr->autoSeparators = textPtr->autoSeparators;
TkUndoSetDepth(textPtr->sharedTextPtr->undoStack,
textPtr->sharedTextPtr->maxUndo);
/*
* A few other options also need special processing, such as parsing the
* geometry and setting the background from a 3-D border.
*/
Tk_SetBackgroundFromBorder(textPtr->tkwin, textPtr->border);
if (mask & TK_TEXT_LINE_RANGE) {
int start, end, current;
/*
* Line start and/or end have been adjusted. We need to validate the
* first displayed line and arrange for re-layout.
*/
TkBTreeClientRangeChanged(textPtr, textPtr->charHeight);
if (textPtr->start != NULL) {
start = TkBTreeLinesTo(NULL, textPtr->start);
} else {
start = 0;
}
if (textPtr->end != NULL) {
end = TkBTreeLinesTo(NULL, textPtr->end);
} else {
end = TkBTreeNumLines(textPtr->sharedTextPtr->tree, NULL);
}
if (start > end) {
Tcl_AppendResult(interp,
"-startline must be less than or equal to -endline",
NULL);
Tk_RestoreSavedOptions(&savedOptions);
return TCL_ERROR;
}
current = TkBTreeLinesTo(NULL, textPtr->topIndex.linePtr);
if (current < start || current > end) {
TkTextSearch search;
TkTextIndex index1, first, last;
int selChanged = 0;
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, NULL, start, 0,
&index1);
TkTextSetYView(textPtr, &index1, 0);
/*
* We may need to adjust the selection. So we have to check
* whether the "sel" tag was applied to anything outside the
* current start,end.
*/
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, NULL, 0, 0,
&first);
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, NULL,
TkBTreeNumLines(textPtr->sharedTextPtr->tree, NULL),
0, &last);
TkBTreeStartSearch(&first, &last, textPtr->selTagPtr, &search);
if (!TkBTreeCharTagged(&first, textPtr->selTagPtr)
&& !TkBTreeNextTag(&search)) {
/* Nothing tagged with "sel" */
} else {
int line = TkBTreeLinesTo(NULL, search.curIndex.linePtr);
if (line < start) {
selChanged = 1;
} else {
TkTextLine *linePtr = search.curIndex.linePtr;
while (TkBTreeNextTag(&search)) {
linePtr = search.curIndex.linePtr;
}
line = TkBTreeLinesTo(NULL, linePtr);
if (line >= end) {
selChanged = 1;
}
}
}
if (selChanged) {
/*
* Send an event that the selection has changed, and abort any
* partial-selections in progress.
*/
TkTextSelectionEvent(textPtr);
textPtr->abortSelections = 1;
}
}
}
/*
* Don't allow negative spacings.
*/
if (textPtr->spacing1 < 0) {
textPtr->spacing1 = 0;
}
if (textPtr->spacing2 < 0) {
textPtr->spacing2 = 0;
}
if (textPtr->spacing3 < 0) {
textPtr->spacing3 = 0;
}
/*
* Parse tab stops.
*/
if (textPtr->tabArrayPtr != NULL) {
ckfree((char *) textPtr->tabArrayPtr);
textPtr->tabArrayPtr = NULL;
}
if (textPtr->tabOptionPtr != NULL) {
textPtr->tabArrayPtr = TkTextGetTabs(interp, textPtr,
textPtr->tabOptionPtr);
if (textPtr->tabArrayPtr == NULL) {
Tcl_AddErrorInfo(interp,"\n (while processing -tabs option)");
Tk_RestoreSavedOptions(&savedOptions);
return TCL_ERROR;
}
}
/*
* Make sure that configuration options are properly mirrored between the
* widget record and the "sel" tags. NOTE: we don't have to free up
* information during the mirroring; old information was freed when it was
* replaced in the widget record.
*/
textPtr->selTagPtr->border = textPtr->selBorder;
if (textPtr->selTagPtr->borderWidthPtr != textPtr->selBorderWidthPtr) {
textPtr->selTagPtr->borderWidthPtr = textPtr->selBorderWidthPtr;
textPtr->selTagPtr->borderWidth = textPtr->selBorderWidth;
}
textPtr->selTagPtr->fgColor = textPtr->selFgColorPtr;
textPtr->selTagPtr->affectsDisplay = 0;
textPtr->selTagPtr->affectsDisplayGeometry = 0;
if ((textPtr->selTagPtr->elideString != NULL)
|| (textPtr->selTagPtr->tkfont != None)
|| (textPtr->selTagPtr->justifyString != NULL)
|| (textPtr->selTagPtr->lMargin1String != NULL)
|| (textPtr->selTagPtr->lMargin2String != NULL)
|| (textPtr->selTagPtr->offsetString != NULL)
|| (textPtr->selTagPtr->rMarginString != NULL)
|| (textPtr->selTagPtr->spacing1String != NULL)
|| (textPtr->selTagPtr->spacing2String != NULL)
|| (textPtr->selTagPtr->spacing3String != NULL)
|| (textPtr->selTagPtr->tabStringPtr != NULL)
|| (textPtr->selTagPtr->wrapMode != TEXT_WRAPMODE_NULL)) {
textPtr->selTagPtr->affectsDisplay = 1;
textPtr->selTagPtr->affectsDisplayGeometry = 1;
}
if ((textPtr->selTagPtr->border != NULL)
|| (textPtr->selTagPtr->reliefString != NULL)
|| (textPtr->selTagPtr->bgStipple != None)
|| (textPtr->selTagPtr->fgColor != NULL)
|| (textPtr->selTagPtr->fgStipple != None)
|| (textPtr->selTagPtr->overstrikeString != NULL)
|| (textPtr->selTagPtr->underlineString != NULL)) {
textPtr->selTagPtr->affectsDisplay = 1;
}
TkTextRedrawTag(NULL, textPtr, NULL, NULL, textPtr->selTagPtr, 1);
/*
* Claim the selection if we've suddenly started exporting it and there
* are tagged characters.
*/
if (textPtr->exportSelection && (!oldExport)) {
TkTextSearch search;
TkTextIndex first, last;
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, textPtr, 0, 0,
&first);
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, textPtr,
TkBTreeNumLines(textPtr->sharedTextPtr->tree, textPtr),
0, &last);
TkBTreeStartSearch(&first, &last, textPtr->selTagPtr, &search);
if (TkBTreeCharTagged(&first, textPtr->selTagPtr)
|| TkBTreeNextTag(&search)) {
Tk_OwnSelection(textPtr->tkwin, XA_PRIMARY, TkTextLostSelection,
(ClientData) textPtr);
textPtr->flags |= GOT_SELECTION;
}
}
/*
* Account for state changes that would reenable blinking cursor state.
*/
if (textPtr->flags & GOT_FOCUS) {
Tcl_DeleteTimerHandler(textPtr->insertBlinkHandler);
textPtr->insertBlinkHandler = (Tcl_TimerToken) NULL;
TextBlinkProc((ClientData) textPtr);
}
/*
* Register the desired geometry for the window, and arrange for the
* window to be redisplayed.
*/
if (textPtr->width <= 0) {
textPtr->width = 1;
}
if (textPtr->height <= 0) {
textPtr->height = 1;
}
Tk_FreeSavedOptions(&savedOptions);
TextWorldChanged(textPtr, mask);
return TCL_OK;
}
/*
*---------------------------------------------------------------------------
*
* TextWorldChangedCallback --
*
* This function is called when the world has changed in some way and the
* widget needs to recompute all its graphics contexts and determine its
* new geometry.
*
* Results:
* None.
*
* Side effects:
* Configures all tags in the Text with a empty objc/objv, for the side
* effect of causing all the items to recompute their geometry and to be
* redisplayed.
*
*---------------------------------------------------------------------------
*/
static void
TextWorldChangedCallback(
ClientData instanceData) /* Information about widget. */
{
TkText *textPtr;
textPtr = (TkText *) instanceData;
TextWorldChanged(textPtr, TK_TEXT_LINE_GEOMETRY);
}
/*
*---------------------------------------------------------------------------
*
* TextWorldChanged --
*
* This function is called when the world has changed in some way and the
* widget needs to recompute all its graphics contexts and determine its
* new geometry.
*
* Results:
* None.
*
* Side effects:
* Configures all tags in the Text with a empty objc/objv, for the side
* effect of causing all the items to recompute their geometry and to be
* redisplayed.
*
*---------------------------------------------------------------------------
*/
static void
TextWorldChanged(
TkText *textPtr, /* Information about widget. */
int mask) /* OR'd collection of bits showing what has
* changed. */
{
Tk_FontMetrics fm;
int border;
textPtr->charWidth = Tk_TextWidth(textPtr->tkfont, "0", 1);
if (textPtr->charWidth <= 0) {
textPtr->charWidth = 1;
}
Tk_GetFontMetrics(textPtr->tkfont, &fm);
textPtr->charHeight = fm.linespace;
if (textPtr->charHeight <= 0) {
textPtr->charHeight = 1;
}
border = textPtr->borderWidth + textPtr->highlightWidth;
Tk_GeometryRequest(textPtr->tkwin,
textPtr->width * textPtr->charWidth + 2*textPtr->padX + 2*border,
textPtr->height*(fm.linespace+textPtr->spacing1+textPtr->spacing3)
+ 2*textPtr->padY + 2*border);
Tk_SetInternalBorderEx(textPtr->tkwin,
border + textPtr->padX, border + textPtr->padX,
border + textPtr->padY, border + textPtr->padY);
if (textPtr->setGrid) {
Tk_SetGrid(textPtr->tkwin, textPtr->width, textPtr->height,
textPtr->charWidth, textPtr->charHeight);
} else {
Tk_UnsetGrid(textPtr->tkwin);
}
TkTextRelayoutWindow(textPtr, mask);
}
/*
*--------------------------------------------------------------
*
* TextEventProc --
*
* This function is invoked by the Tk dispatcher on structure changes to
* a text. For texts with 3D borders, this function is also invoked for
* exposures.
*
* Results:
* None.
*
* Side effects:
* When the window gets deleted, internal structures get cleaned up.
* When it gets exposed, it is redisplayed.
*
*--------------------------------------------------------------
*/
static void
TextEventProc(
ClientData clientData, /* Information about window. */
register XEvent *eventPtr) /* Information about event. */
{
register TkText *textPtr = (TkText *) clientData;
TkTextIndex index, index2;
if (eventPtr->type == Expose) {
TkTextRedrawRegion(textPtr, eventPtr->xexpose.x,
eventPtr->xexpose.y, eventPtr->xexpose.width,
eventPtr->xexpose.height);
} else if (eventPtr->type == ConfigureNotify) {
if ((textPtr->prevWidth != Tk_Width(textPtr->tkwin))
|| (textPtr->prevHeight != Tk_Height(textPtr->tkwin))) {
int mask = 0;
if (textPtr->prevWidth != Tk_Width(textPtr->tkwin)) {
mask = TK_TEXT_LINE_GEOMETRY;
}
TkTextRelayoutWindow(textPtr, mask);
textPtr->prevWidth = Tk_Width(textPtr->tkwin);
textPtr->prevHeight = Tk_Height(textPtr->tkwin);
}
} else if (eventPtr->type == DestroyNotify) {
/*
* NOTE: we must zero out selBorder, selBorderWidthPtr and
* selFgColorPtr: they are duplicates of information in the "sel" tag,
* which will be freed up when we delete all tags. Hence we don't want
* the automatic config options freeing process to delete them as
* well.
*/
textPtr->selBorder = NULL;
textPtr->selBorderWidthPtr = NULL;
textPtr->selBorderWidth = 0;
textPtr->selFgColorPtr = NULL;
if (textPtr->setGrid) {
Tk_UnsetGrid(textPtr->tkwin);
textPtr->setGrid = 0;
}
if (!(textPtr->flags & OPTIONS_FREED)) {
Tk_FreeConfigOptions((char *) textPtr, textPtr->optionTable,
textPtr->tkwin);
textPtr->flags |= OPTIONS_FREED;
}
textPtr->flags |= DESTROYED;
/*
* Call 'DestroyTest' to handle the deletion for us. The actual
* textPtr may still exist after this, if there are some outstanding
* references. But we have flagged it as DESTROYED just above, so
* nothing will try to make use of it very extensively.
*/
DestroyText(textPtr);
} else if ((eventPtr->type == FocusIn) || (eventPtr->type == FocusOut)) {
if (eventPtr->xfocus.detail == NotifyInferior
|| eventPtr->xfocus.detail == NotifyAncestor
|| eventPtr->xfocus.detail == NotifyNonlinear) {
Tcl_DeleteTimerHandler(textPtr->insertBlinkHandler);
if (eventPtr->type == FocusIn) {
textPtr->flags |= GOT_FOCUS | INSERT_ON;
if (textPtr->insertOffTime != 0) {
textPtr->insertBlinkHandler = Tcl_CreateTimerHandler(
textPtr->insertOnTime, TextBlinkProc,
(ClientData) textPtr);
}
} else {
textPtr->flags &= ~(GOT_FOCUS | INSERT_ON);
textPtr->insertBlinkHandler = (Tcl_TimerToken) NULL;
}
if (textPtr->inactiveSelBorder != textPtr->selBorder) {
TkTextRedrawTag(NULL, textPtr, NULL, NULL, textPtr->selTagPtr,
1);
}
TkTextMarkSegToIndex(textPtr, textPtr->insertMarkPtr, &index);
TkTextIndexForwChars(NULL, &index, 1, &index2, COUNT_INDICES);
/*
* While we wish to redisplay, no heights have changed, so no need
* to call TkTextInvalidateLineMetrics.
*/
TkTextChanged(NULL, textPtr, &index, &index2);
if (textPtr->highlightWidth > 0) {
TkTextRedrawRegion(textPtr, 0, 0, textPtr->highlightWidth,
textPtr->highlightWidth);
}
}
}
}
/*
*----------------------------------------------------------------------
*
* TextCmdDeletedProc --
*
* This function is invoked when a widget command is deleted. If the
* widget isn't already in the process of being destroyed, this command
* destroys it.
*
* Results:
* None.
*
* Side effects:
* The widget is destroyed.
*
*----------------------------------------------------------------------
*/
static void
TextCmdDeletedProc(
ClientData clientData) /* Pointer to widget record for widget. */
{
TkText *textPtr = (TkText *) clientData;
Tk_Window tkwin = textPtr->tkwin;
/*
* This function could be invoked either because the window was destroyed
* and the command was then deleted (in which this flag is already set) or
* because the command was deleted, and then this function destroys the
* widget.
*/
if (!(textPtr->flags & DESTROYED)) {
if (textPtr->setGrid) {
Tk_UnsetGrid(textPtr->tkwin);
textPtr->setGrid = 0;
}
textPtr->flags |= DESTROYED;
Tk_DestroyWindow(tkwin);
}
}
/*
*----------------------------------------------------------------------
*
* InsertChars --
*
* This function implements most of the functionality of the "insert"
* widget command.
*
* Results:
* The length of the inserted string.
*
* Side effects:
* The characters in "stringPtr" get added to the text just before the
* character indicated by "indexPtr".
*
* If 'viewUpdate' is true, we may adjust the window contents'
* y-position, and scrollbar setting.
*
*----------------------------------------------------------------------
*/
static int
InsertChars(
TkSharedText *sharedTextPtr,
TkText *textPtr, /* Overall information about text widget. */
TkTextIndex *indexPtr, /* Where to insert new characters. May be
* modified if the index is not valid for
* insertion (e.g. if at "end"). */
Tcl_Obj *stringPtr, /* Null-terminated string containing new
* information to add to text. */
int viewUpdate) /* Update the view if set. */
{
int lineIndex, length;
TkText *tPtr;
int *lineAndByteIndex;
int resetViewCount;
int pixels[2*PIXEL_CLIENTS];
CONST char *string = Tcl_GetStringFromObj(stringPtr, &length);
if (sharedTextPtr == NULL) {
sharedTextPtr = textPtr->sharedTextPtr;
}
/*
* Don't allow insertions on the last (dummy) line of the text. This is
* the only place in this function where the indexPtr is modified.
*/
lineIndex = TkBTreeLinesTo(textPtr, indexPtr->linePtr);
if (lineIndex == TkBTreeNumLines(sharedTextPtr->tree, textPtr)) {
lineIndex--;
TkTextMakeByteIndex(sharedTextPtr->tree, textPtr, lineIndex, 1000000,
indexPtr);
}
/*
* Notify the display module that lines are about to change, then do the
* insertion. If the insertion occurs on the top line of the widget
* (textPtr->topIndex), then we have to recompute topIndex after the
* insertion, since the insertion could invalidate it.
*/
resetViewCount = 0;
if (sharedTextPtr->refCount > PIXEL_CLIENTS) {
lineAndByteIndex = (int *)
ckalloc(sizeof(int) * 2 * sharedTextPtr->refCount);
} else {
lineAndByteIndex = pixels;
}
for (tPtr = sharedTextPtr->peers; tPtr != NULL ; tPtr = tPtr->next) {
lineAndByteIndex[resetViewCount] = -1;
if (indexPtr->linePtr == tPtr->topIndex.linePtr) {
lineAndByteIndex[resetViewCount] =
TkBTreeLinesTo(tPtr, indexPtr->linePtr);
lineAndByteIndex[resetViewCount+1] = tPtr->topIndex.byteIndex;
if (lineAndByteIndex[resetViewCount+1] > indexPtr->byteIndex) {
lineAndByteIndex[resetViewCount+1] += length;
}
}
resetViewCount += 2;
}
TkTextChanged(sharedTextPtr, NULL, indexPtr, indexPtr);
sharedTextPtr->stateEpoch++;
TkBTreeInsertChars(sharedTextPtr->tree, indexPtr, string);
/*
* Push the insertion on the undo stack, and update the modified status of
* the widget.
*/
if (length > 0) {
if (sharedTextPtr->undo) {
TkTextIndex toIndex;
if (sharedTextPtr->autoSeparators &&
sharedTextPtr->lastEditMode != TK_TEXT_EDIT_INSERT) {
TkUndoInsertUndoSeparator(sharedTextPtr->undoStack);
}
sharedTextPtr->lastEditMode = TK_TEXT_EDIT_INSERT;
TkTextIndexForwBytes(textPtr, indexPtr, length, &toIndex);
TextPushUndoAction(textPtr, stringPtr, 1, indexPtr, &toIndex);
}
UpdateDirtyFlag(sharedTextPtr);
}
resetViewCount = 0;
for (tPtr = sharedTextPtr->peers; tPtr != NULL ; tPtr = tPtr->next) {
if (lineAndByteIndex[resetViewCount] != -1) {
if ((tPtr != textPtr) || viewUpdate) {
TkTextIndex newTop;
TkTextMakeByteIndex(sharedTextPtr->tree, tPtr,
lineAndByteIndex[resetViewCount], 0, &newTop);
TkTextIndexForwBytes(tPtr, &newTop,
lineAndByteIndex[resetViewCount+1], &newTop);
TkTextSetYView(tPtr, &newTop, 0);
}
}
resetViewCount += 2;
}
if (sharedTextPtr->refCount > PIXEL_CLIENTS) {
ckfree((char *) lineAndByteIndex);
}
/*
* Invalidate any selection retrievals in progress.
*/
for (tPtr = sharedTextPtr->peers; tPtr != NULL ; tPtr = tPtr->next) {
tPtr->abortSelections = 1;
}
/*
* For convenience, return the length of the string.
*/
return length;
}
/*
*----------------------------------------------------------------------
*
* TextPushUndoAction --
*
* Shared by insert and delete actions. Stores the appropriate scripts
* into our undo stack. We will add a single refCount to the 'undoString'
* object, so, if it previously had a refCount of zero, the caller should
* not free it.
*
* Results:
* None.
*
* Side effects:
* Items pushed onto stack.
*
*----------------------------------------------------------------------
*/
static void
TextPushUndoAction(
TkText *textPtr, /* Overall information about text widget. */
Tcl_Obj *undoString, /* New text. */
int insert, /* 1 if insert, else delete. */
CONST TkTextIndex *index1Ptr,
/* Index describing first location. */
CONST TkTextIndex *index2Ptr)
/* Index describing second location. */
{
TkUndoSubAtom *iAtom, *dAtom;
/*
* Create the helpers.
*/
Tcl_Obj *seeInsertObj = Tcl_NewObj();
Tcl_Obj *markSet1InsertObj = Tcl_NewObj();
Tcl_Obj *markSet2InsertObj = Tcl_NewObj();
Tcl_Obj *insertCmdObj = Tcl_NewObj();
Tcl_Obj *deleteCmdObj = Tcl_NewObj();
/*
* Get the index positions.
*/
Tcl_Obj *index1Obj = TkTextNewIndexObj(NULL, index1Ptr);
Tcl_Obj *index2Obj = TkTextNewIndexObj(NULL, index2Ptr);
/*
* These need refCounts, because they are used more than once below.
*/
Tcl_IncrRefCount(seeInsertObj);
Tcl_IncrRefCount(index1Obj);
Tcl_IncrRefCount(index2Obj);
Tcl_ListObjAppendElement(NULL, seeInsertObj,
Tcl_NewStringObj(Tk_PathName(textPtr->tkwin), -1));
Tcl_ListObjAppendElement(NULL, seeInsertObj, Tcl_NewStringObj("see", 3));
Tcl_ListObjAppendElement(NULL, seeInsertObj,
Tcl_NewStringObj("insert", 6));
Tcl_ListObjAppendElement(NULL, markSet1InsertObj,
Tcl_NewStringObj(Tk_PathName(textPtr->tkwin), -1));
Tcl_ListObjAppendElement(NULL, markSet1InsertObj,
Tcl_NewStringObj("mark", 4));
Tcl_ListObjAppendElement(NULL, markSet1InsertObj,
Tcl_NewStringObj("set", 3));
Tcl_ListObjAppendElement(NULL, markSet1InsertObj,
Tcl_NewStringObj("insert", 6));
markSet2InsertObj = Tcl_DuplicateObj(markSet1InsertObj);
Tcl_ListObjAppendElement(NULL, markSet1InsertObj, index1Obj);
Tcl_ListObjAppendElement(NULL, markSet2InsertObj, index2Obj);
Tcl_ListObjAppendElement(NULL, insertCmdObj,
Tcl_NewStringObj("insert", 6));
Tcl_ListObjAppendElement(NULL, insertCmdObj, index1Obj);
/*
* Only use of 'undoString' is here.
*/
Tcl_ListObjAppendElement(NULL, insertCmdObj, undoString);
Tcl_ListObjAppendElement(NULL, deleteCmdObj,
Tcl_NewStringObj("delete", 6));
Tcl_ListObjAppendElement(NULL, deleteCmdObj, index1Obj);
Tcl_ListObjAppendElement(NULL, deleteCmdObj, index2Obj);
/*
* Note: we don't wish to use textPtr->widgetCmd in these callbacks
* because if we delete the textPtr, but peers still exist, we will then
* have references to a non-existent Tcl_Command in the undo stack, which
* will lead to crashes later. Also, the behaviour of the widget w.r.t.
* bindings (%W substitutions) always uses the widget path name, so there
* is no good reason the undo stack should do otherwise.
*
* For the 'insert' and 'delete' actions, we have to register a functional
* callback, because these actions are defined to operate on the
* underlying data shared by all peers.
*/
iAtom = TkUndoMakeSubAtom(&TextUndoRedoCallback,
(ClientData)textPtr->sharedTextPtr, insertCmdObj, NULL);
TkUndoMakeCmdSubAtom(NULL, markSet2InsertObj, iAtom);
TkUndoMakeCmdSubAtom(NULL, seeInsertObj, iAtom);
dAtom = TkUndoMakeSubAtom(&TextUndoRedoCallback,
(ClientData)textPtr->sharedTextPtr, deleteCmdObj, NULL);
TkUndoMakeCmdSubAtom(NULL, markSet1InsertObj, dAtom);
TkUndoMakeCmdSubAtom(NULL, seeInsertObj, dAtom);
Tcl_DecrRefCount(seeInsertObj);
Tcl_DecrRefCount(index1Obj);
Tcl_DecrRefCount(index2Obj);
/*
* Depending whether the action is to insert or delete, we provide the
* appropriate second and third arguments to TkUndoPushAction. (The first
* is the 'actionCommand', and the second the 'revertCommand').
*/
if (insert) {
TkUndoPushAction(textPtr->sharedTextPtr->undoStack, iAtom, dAtom);
} else {
TkUndoPushAction(textPtr->sharedTextPtr->undoStack, dAtom, iAtom);
}
}
/*
*----------------------------------------------------------------------
*
* TextUndoRedoCallback --
*
* This function is registered with the generic undo/redo code to handle
* 'insert' and 'delete' actions on all text widgets. We cannot perform
* those actions on any particular text widget, because that text widget
* might have been deleted by the time we get here.
*
* Results:
* A standard Tcl result.
*
* Side effects:
* Will insert or delete text, depending on the first word contained in
* objPtr.
*
*----------------------------------------------------------------------
*/
int
TextUndoRedoCallback(
Tcl_Interp *interp, /* Current interpreter. */
ClientData clientData, /* Passed from undo code, but contains our
* shared text data structure. */
Tcl_Obj *objPtr) /* Arguments of a command to be handled by the
* shared text data structure. */
{
TkSharedText *sharedPtr = (TkSharedText *) clientData;
int res, objc;
Tcl_Obj **objv;
TkText *textPtr;
res = Tcl_ListObjGetElements(interp, objPtr, &objc, &objv);
if (res != TCL_OK) {
return res;
}
/*
* If possible, use a real text widget to perform the undo/redo action
* (i.e. insertion or deletion of text). This provides maximum
* compatibility with older versions of Tk, in which the user may rename
* the text widget to allow capture of undo or redo actions.
*
* In particular, this sorting of capture is useful in text editors based
* on the Tk text widget, which need to know which new text needs
* re-coloring.
*
* It would be better if the text widget provided some other mechanism to
* allow capture of this information ("What has just changed in the text
* widget?"). What we have here is not entirely satisfactory under all
* circumstances.
*/
textPtr = sharedPtr->peers;
while (textPtr != NULL) {
if (textPtr->start == NULL && textPtr->end == NULL) {
Tcl_Obj *cmdNameObj, *evalObj;
evalObj = Tcl_NewObj();
Tcl_IncrRefCount(evalObj);
/*
* We might wish to use the real, current command-name for the
* widget, but this will break any code that has over-ridden the
* widget, and is expecting to observe the insert/delete actions
* which are caused by undo/redo operations.
*
* cmdNameObj = Tcl_NewObj();
* Tcl_GetCommandFullName(interp, textPtr->widgetCmd, cmdNameObj);
*
* While such interception is not explicitly documented as
* supported, it does occur, and so until we can provide some
* alternative mechanism for such code to do what it needs, we
* allow it to take place here.
*/
cmdNameObj = Tcl_NewStringObj(Tk_PathName(textPtr->tkwin), -1);
Tcl_ListObjAppendElement(NULL, evalObj, cmdNameObj);
Tcl_ListObjAppendList(NULL, evalObj, objPtr);
res = Tcl_EvalObjEx(interp, evalObj, TCL_EVAL_GLOBAL);
Tcl_DecrRefCount(evalObj);
return res;
}
textPtr = textPtr->next;
}
/*
* If there's no current text widget which shows everything, then we fall
* back on acting directly. This means there is no way to intercept from
* the Tcl level.
*/
return SharedTextObjCmd((ClientData)sharedPtr, interp, objc+1, objv-1);
}
/*
*----------------------------------------------------------------------
*
* CountIndices --
*
* This function implements most of the functionality of the "count"
* widget command.
*
* Note that 'textPtr' is only used if we need to check for elided
* attributes, i.e. if type is COUNT_DISPLAY_INDICES or
* COUNT_DISPLAY_CHARS
*
* Results:
* Returns the number of characters in the range.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
static int
CountIndices(
CONST TkText *textPtr, /* Overall information about text widget. */
CONST TkTextIndex *indexPtr1,
/* Index describing location of first
* character to delete. */
CONST TkTextIndex *indexPtr2,
/* Index describing location of last character
* to delete. NULL means just delete the one
* character given by indexPtr1. */
TkTextCountType type) /* The kind of indices to count. */
{
/*
* Order the starting and stopping indices.
*/
int compare = TkTextIndexCmp(indexPtr1, indexPtr2);
if (compare == 0) {
return 0;
} else if (compare > 0) {
return -TkTextIndexCount(textPtr, indexPtr2, indexPtr1, type);
} else {
return TkTextIndexCount(textPtr, indexPtr1, indexPtr2, type);
}
}
/*
*----------------------------------------------------------------------
*
* DeleteIndexRange --
*
* This function implements most of the functionality of the "delete"
* widget command.
*
* Results:
* Returns a standard Tcl result, currently always TCL_OK.
*
* Side effects:
* Characters and other entities (windows, images) get deleted from the
* text.
*
* If 'viewUpdate' is true, we may adjust the window contents'
* y-position, and scrollbar setting.
*
* If 'viewUpdate' is false, true we can guarantee that textPtr->topIndex
* points to a valid TkTextLine after this function returns. However, if
* 'viewUpdate' is false, then there is no such guarantee (since
* topIndex.linePtr can be garbage). The caller is expected to take
* actions to ensure the topIndex is validated before laying out the
* window again.
*
*----------------------------------------------------------------------
*/
static int
DeleteIndexRange(
TkSharedText *sharedTextPtr,/* Shared portion of peer widgets. */
TkText *textPtr, /* Overall information about text widget. */
CONST TkTextIndex *indexPtr1,
/* Index describing location of first
* character (or other entity) to delete. */
CONST TkTextIndex *indexPtr2,
/* Index describing location of last
* character (or other entity) to delete.
* NULL means just delete the one character
* given by indexPtr1. */
int viewUpdate) /* Update vertical view if set. */
{
int line1, line2;
TkTextIndex index1, index2;
TkText *tPtr;
int *lineAndByteIndex;
int resetViewCount;
int pixels[2*PIXEL_CLIENTS];
if (sharedTextPtr == NULL) {
sharedTextPtr = textPtr->sharedTextPtr;
}
/*
* Prepare the starting and stopping indices.
*/
index1 = *indexPtr1;
if (indexPtr2 != NULL) {
index2 = *indexPtr2;
} else {
index2 = index1;
TkTextIndexForwChars(NULL, &index2, 1, &index2, COUNT_INDICES);
}
/*
* Make sure there's really something to delete.
*/
if (TkTextIndexCmp(&index1, &index2) >= 0) {
return TCL_OK;
}
/*
* The code below is ugly, but it's needed to make sure there is always a
* dummy empty line at the end of the text. If the final newline of the
* file (just before the dummy line) is being deleted, then back up index
* to just before the newline. If there is a newline just before the first
* character being deleted, then back up the first index too, so that an
* even number of lines gets deleted. Furthermore, remove any tags that
* are present on the newline that isn't going to be deleted after all
* (this simulates deleting the newline and then adding a "clean" one back
* again). Note that index1 and index2 might now be equal again which
* means that no text will be deleted but tags might be removed.
*/
line1 = TkBTreeLinesTo(textPtr, index1.linePtr);
line2 = TkBTreeLinesTo(textPtr, index2.linePtr);
if (line2 == TkBTreeNumLines(sharedTextPtr->tree, textPtr)) {
TkTextTag **arrayPtr;
int arraySize, i;
TkTextIndex oldIndex2;
oldIndex2 = index2;
TkTextIndexBackChars(NULL, &oldIndex2, 1, &index2, COUNT_INDICES);
line2--;
if ((index1.byteIndex == 0) && (line1 != 0)) {
TkTextIndexBackChars(NULL, &index1, 1, &index1, COUNT_INDICES);
line1--;
}
arrayPtr = TkBTreeGetTags(&index2, NULL, &arraySize);
if (arrayPtr != NULL) {
for (i = 0; i < arraySize; i++) {
TkBTreeTag(&index2, &oldIndex2, arrayPtr[i], 0);
}
ckfree((char *) arrayPtr);
}
}
if (line1 < line2) {
/*
* We are deleting more than one line. For speed, we remove all tags
* from the range first. If we don't do this, the code below can (when
* there are many tags) grow non-linearly in execution time.
*/
Tcl_HashSearch search;
Tcl_HashEntry *hPtr;
int i;
for (i=0, hPtr=Tcl_FirstHashEntry(&sharedTextPtr->tagTable, &search);
hPtr != NULL; i++, hPtr = Tcl_NextHashEntry(&search)) {
TkTextTag *tagPtr = (TkTextTag *) Tcl_GetHashValue(hPtr);
TkBTreeTag(&index1, &index2, tagPtr, 0);
}
/*
* Special case for the sel tag which is not in the hash table. We
* need to do this once for each peer text widget.
*/
for (tPtr = sharedTextPtr->peers; tPtr != NULL ;
tPtr = tPtr->next) {
if (TkBTreeTag(&index1, &index2, tPtr->selTagPtr, 0)) {
/*
* Send an event that the selection changed. This is
* equivalent to:
* event generate $textWidget <<Selection>>
*/
TkTextSelectionEvent(textPtr);
tPtr->abortSelections = 1;
}
}
}
/*
* Tell the display what's about to happen so it can discard obsolete
* display information, then do the deletion. Also, if the deletion
* involves the top line on the screen, then we have to reset the view
* (the deletion will invalidate textPtr->topIndex). Compute what the new
* first character will be, then do the deletion, then reset the view.
*/
TkTextChanged(sharedTextPtr, NULL, &index1, &index2);
resetViewCount = 0;
if (sharedTextPtr->refCount > PIXEL_CLIENTS) {
lineAndByteIndex = (int *)
ckalloc(sizeof(int) * 2 * sharedTextPtr->refCount);
} else {
lineAndByteIndex = pixels;
}
for (tPtr = sharedTextPtr->peers; tPtr != NULL ; tPtr = tPtr->next) {
int line = 0;
int byteIndex = 0;
int resetView = 0;
if (TkTextIndexCmp(&index2, &tPtr->topIndex) >= 0) {
if (TkTextIndexCmp(&index1, &tPtr->topIndex) <= 0) {
/*
* Deletion range straddles topIndex: use the beginning of the
* range as the new topIndex.
*/
resetView = 1;
line = line1;
byteIndex = index1.byteIndex;
} else if (index1.linePtr == tPtr->topIndex.linePtr) {
/*
* Deletion range starts on top line but after topIndex. Use
* the current topIndex as the new one.
*/
resetView = 1;
line = line1;
byteIndex = tPtr->topIndex.byteIndex;
}
} else if (index2.linePtr == tPtr->topIndex.linePtr) {
/*
* Deletion range ends on top line but before topIndex. Figure out
* what will be the new character index for the character
* currently pointed to by topIndex.
*/
resetView = 1;
line = line2;
byteIndex = tPtr->topIndex.byteIndex;
if (index1.linePtr != index2.linePtr) {
byteIndex -= index2.byteIndex;
} else {
byteIndex -= (index2.byteIndex - index1.byteIndex);
}
}
if (resetView) {
lineAndByteIndex[resetViewCount] = line;
lineAndByteIndex[resetViewCount+1] = byteIndex;
} else {
lineAndByteIndex[resetViewCount] = -1;
}
resetViewCount+=2;
}
/*
* Push the deletion on the undo stack if something was actually deleted.
*/
if (TkTextIndexCmp(&index1, &index2) < 0) {
if (sharedTextPtr->undo) {
Tcl_Obj *get;
if (sharedTextPtr->autoSeparators
&& (sharedTextPtr->lastEditMode != TK_TEXT_EDIT_DELETE)) {
TkUndoInsertUndoSeparator(sharedTextPtr->undoStack);
}
sharedTextPtr->lastEditMode = TK_TEXT_EDIT_DELETE;
get = TextGetText(textPtr, &index1, &index2, 0);
TextPushUndoAction(textPtr, get, 0, &index1, &index2);
}
UpdateDirtyFlag(sharedTextPtr);
sharedTextPtr->stateEpoch++;
TkBTreeDeleteIndexRange(sharedTextPtr->tree, &index1, &index2);
}
resetViewCount = 0;
for (tPtr = sharedTextPtr->peers; tPtr != NULL ; tPtr = tPtr->next) {
int line = lineAndByteIndex[resetViewCount];
if (line != -1) {
int byteIndex = lineAndByteIndex[resetViewCount+1];
TkTextIndex indexTmp;
if (tPtr == textPtr) {
if (viewUpdate) {
TkTextMakeByteIndex(sharedTextPtr->tree, textPtr, line,
byteIndex, &indexTmp);
TkTextSetYView(tPtr, &indexTmp, 0);
}
} else {
TkTextMakeByteIndex(sharedTextPtr->tree, NULL, line,
byteIndex, &indexTmp);
TkTextSetYView(tPtr, &indexTmp, 0);
}
}
resetViewCount += 2;
}
if (sharedTextPtr->refCount > PIXEL_CLIENTS) {
ckfree((char *) lineAndByteIndex);
}
if (line1 >= line2) {
/*
* Invalidate any selection retrievals in progress, assuming we didn't
* check for this case above.
*/
for (tPtr = sharedTextPtr->peers; tPtr != NULL ; tPtr = tPtr->next) {
tPtr->abortSelections = 1;
}
}
return TCL_OK;
}
/*
*----------------------------------------------------------------------
*
* TextFetchSelection --
*
* This function is called back by Tk when the selection is requested by
* someone. It returns part or all of the selection in a buffer provided
* by the caller.
*
* Results:
* The return value is the number of non-NULL bytes stored at buffer.
* Buffer is filled (or partially filled) with a NULL-terminated string
* containing part or all of the selection, as given by offset and
* maxBytes.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
static int
TextFetchSelection(
ClientData clientData, /* Information about text widget. */
int offset, /* Offset within selection of first character
* to be returned. */
char *buffer, /* Location in which to place selection. */
int maxBytes) /* Maximum number of bytes to place at buffer,
* not including terminating NULL
* character. */
{
register TkText *textPtr = (TkText *) clientData;
TkTextIndex eof;
int count, chunkSize, offsetInSeg;
TkTextSearch search;
TkTextSegment *segPtr;
if (!textPtr->exportSelection) {
return -1;
}
/*
* Find the beginning of the next range of selected text. Note: if the
* selection is being retrieved in multiple pieces (offset != 0) and some
* modification has been made to the text that affects the selection then
* reject the selection request (make 'em start over again).
*/
if (offset == 0) {
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, textPtr, 0, 0,
&textPtr->selIndex);
textPtr->abortSelections = 0;
} else if (textPtr->abortSelections) {
return 0;
}
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, textPtr,
TkBTreeNumLines(textPtr->sharedTextPtr->tree, textPtr), 0, &eof);
TkBTreeStartSearch(&textPtr->selIndex, &eof, textPtr->selTagPtr, &search);
if (!TkBTreeCharTagged(&textPtr->selIndex, textPtr->selTagPtr)) {
if (!TkBTreeNextTag(&search)) {
if (offset == 0) {
return -1;
} else {
return 0;
}
}
textPtr->selIndex = search.curIndex;
}
/*
* Each iteration through the outer loop below scans one selected range.
* Each iteration through the inner loop scans one segment in the selected
* range.
*/
count = 0;
while (1) {
/*
* Find the end of the current range of selected text.
*/
if (!TkBTreeNextTag(&search)) {
Tcl_Panic("TextFetchSelection couldn't find end of range");
}
/*
* Copy information from character segments into the buffer until
* either we run out of space in the buffer or we get to the end of
* this range of text.
*/
while (1) {
if (maxBytes == 0) {
goto fetchDone;
}
segPtr = TkTextIndexToSeg(&textPtr->selIndex, &offsetInSeg);
chunkSize = segPtr->size - offsetInSeg;
if (chunkSize > maxBytes) {
chunkSize = maxBytes;
}
if (textPtr->selIndex.linePtr == search.curIndex.linePtr) {
int leftInRange;
leftInRange = search.curIndex.byteIndex
- textPtr->selIndex.byteIndex;
if (leftInRange < chunkSize) {
chunkSize = leftInRange;
if (chunkSize <= 0) {
break;
}
}
}
if ((segPtr->typePtr == &tkTextCharType)
&& !TkTextIsElided(textPtr, &textPtr->selIndex, NULL)) {
memcpy(buffer, segPtr->body.chars + offsetInSeg,
(size_t) chunkSize);
buffer += chunkSize;
maxBytes -= chunkSize;
count += chunkSize;
}
TkTextIndexForwBytes(textPtr, &textPtr->selIndex, chunkSize,
&textPtr->selIndex);
}
/*
* Find the beginning of the next range of selected text.
*/
if (!TkBTreeNextTag(&search)) {
break;
}
textPtr->selIndex = search.curIndex;
}
fetchDone:
*buffer = 0;
return count;
}
/*
*----------------------------------------------------------------------
*
* TkTextLostSelection --
*
* This function is called back by Tk when the selection is grabbed away
* from a text widget. On Windows and Mac systems, we want to remember
* the selection for the next time the focus enters the window. On Unix,
* just remove the "sel" tag from everything in the widget.
*
* Results:
* None.
*
* Side effects:
* The "sel" tag is cleared from the window.
*
*----------------------------------------------------------------------
*/
void
TkTextLostSelection(
ClientData clientData) /* Information about text widget. */
{
register TkText *textPtr = (TkText *) clientData;
if (TkpAlwaysShowSelection(textPtr->tkwin)) {
TkTextIndex start, end;
if (!textPtr->exportSelection) {
return;
}
/*
* On Windows and Mac systems, we want to remember the selection for
* the next time the focus enters the window. On Unix, just remove the
* "sel" tag from everything in the widget.
*/
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, textPtr,
0, 0, &start);
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, textPtr,
TkBTreeNumLines(textPtr->sharedTextPtr->tree, textPtr),
0, &end);
TkTextRedrawTag(NULL, textPtr, &start, &end, textPtr->selTagPtr, 1);
TkBTreeTag(&start, &end, textPtr->selTagPtr, 0);
}
/*
* Send an event that the selection changed. This is equivalent to:
* event generate $textWidget <<Selection>>
*/
TkTextSelectionEvent(textPtr);
textPtr->flags &= ~GOT_SELECTION;
}
/*
*----------------------------------------------------------------------
*
* TkTextSelectionEvent --
*
* When anything relevant to the "sel" tag has been changed, call this
* function to generate a <<Selection>> event.
*
* Results:
* None.
*
* Side effects:
* If <<Selection>> bindings are present, they will trigger.
*
*----------------------------------------------------------------------
*/
void
TkTextSelectionEvent(
TkText *textPtr)
{
/*
* Send an event that the selection changed. This is equivalent to:
* event generate $textWidget <<Selection>>
*/
XEvent event;
memset(&event, 0, sizeof(event));
event.xany.type = VirtualEvent;
event.xany.serial = NextRequest(Tk_Display(textPtr->tkwin));
event.xany.send_event = False;
event.xany.window = Tk_WindowId(textPtr->tkwin);
event.xany.display = Tk_Display(textPtr->tkwin);
((XVirtualEvent *) &event)->name = Tk_GetUid("Selection");
Tk_HandleEvent(&event);
}
/*
*----------------------------------------------------------------------
*
* TextBlinkProc --
*
* This function is called as a timer handler to blink the insertion
* cursor off and on.
*
* Results:
* None.
*
* Side effects:
* The cursor gets turned on or off, redisplay gets invoked, and this
* function reschedules itself.
*
*----------------------------------------------------------------------
*/
static void
TextBlinkProc(
ClientData clientData) /* Pointer to record describing text. */
{
register TkText *textPtr = (TkText *) clientData;
TkTextIndex index;
int x, y, w, h, charWidth;
if ((textPtr->state == TK_TEXT_STATE_DISABLED) ||
!(textPtr->flags & GOT_FOCUS) || (textPtr->insertOffTime == 0)) {
if ((textPtr->insertOffTime == 0) && !(textPtr->flags & INSERT_ON)) {
/*
* The widget was configured to have zero offtime while the
* insertion point was not displayed. We have to display it once.
*/
textPtr->flags |= INSERT_ON;
goto redrawInsert;
}
return;
}
if (textPtr->flags & INSERT_ON) {
textPtr->flags &= ~INSERT_ON;
textPtr->insertBlinkHandler = Tcl_CreateTimerHandler(
textPtr->insertOffTime, TextBlinkProc, (ClientData) textPtr);
} else {
textPtr->flags |= INSERT_ON;
textPtr->insertBlinkHandler = Tcl_CreateTimerHandler(
textPtr->insertOnTime, TextBlinkProc, (ClientData) textPtr);
}
redrawInsert:
TkTextMarkSegToIndex(textPtr, textPtr->insertMarkPtr, &index);
if (TkTextIndexBbox(textPtr, &index, &x, &y, &w, &h, &charWidth) == 0) {
if (textPtr->insertCursorType) {
/* Block cursor */
TkTextRedrawRegion(textPtr, x - textPtr->width / 2, y,
charWidth + textPtr->insertWidth / 2, h);
} else {
/* I-beam cursor */
TkTextRedrawRegion(textPtr, x - textPtr->insertWidth / 2, y,
textPtr->insertWidth, h);
}
}
}
/*
*----------------------------------------------------------------------
*
* TextInsertCmd --
*
* This function is invoked to process the "insert" and "replace" widget
* commands for text widgets.
*
* Results:
* A standard Tcl result.
*
* Side effects:
* See the user documentation.
*
* If 'viewUpdate' is true, we may adjust the window contents'
* y-position, and scrollbar setting.
*
*----------------------------------------------------------------------
*/
static int
TextInsertCmd(
TkSharedText *sharedTextPtr,/* Shared portion of peer widgets. */
TkText *textPtr, /* Information about text widget. */
Tcl_Interp *interp, /* Current interpreter. */
int objc, /* Number of arguments. */
Tcl_Obj *CONST objv[], /* Argument objects. */
CONST TkTextIndex *indexPtr,/* Index at which to insert. */
int viewUpdate) /* Update the view if set. */
{
TkTextIndex index1, index2;
int j;
if (sharedTextPtr == NULL) {
sharedTextPtr = textPtr->sharedTextPtr;
}
index1 = *indexPtr;
for (j = 0; j < objc; j += 2) {
/*
* Here we rely on this call to modify index1 if it is outside the
* acceptable range. In particular, if index1 is "end", it must be set
* to the last allowable index for insertion, otherwise subsequent tag
* insertions will fail.
*/
int length = InsertChars(sharedTextPtr, textPtr, &index1, objv[j],
viewUpdate);
if (objc > (j+1)) {
Tcl_Obj **tagNamePtrs;
TkTextTag **oldTagArrayPtr;
int numTags;
TkTextIndexForwBytes(textPtr, &index1, length, &index2);
oldTagArrayPtr = TkBTreeGetTags(&index1, NULL, &numTags);
if (oldTagArrayPtr != NULL) {
int i;
for (i = 0; i < numTags; i++) {
TkBTreeTag(&index1, &index2, oldTagArrayPtr[i], 0);
}
ckfree((char *) oldTagArrayPtr);
}
if (Tcl_ListObjGetElements(interp, objv[j+1], &numTags,
&tagNamePtrs) != TCL_OK) {
return TCL_ERROR;
} else {
int i;
for (i = 0; i < numTags; i++) {
CONST char *strTag = Tcl_GetString(tagNamePtrs[i]);
TkBTreeTag(&index1, &index2,
TkTextCreateTag(textPtr, strTag, NULL), 1);
}
index1 = index2;
}
}
}
return TCL_OK;
}
/*
*----------------------------------------------------------------------
*
* TextSearchCmd --
*
* This function is invoked to process the "search" widget command for
* text widgets. See the user documentation for details on what it does.
*
* Results:
* A standard Tcl result.
*
* Side effects:
* See the user documentation.
*
*----------------------------------------------------------------------
*/
static int
TextSearchCmd(
TkText *textPtr, /* Information about text widget. */
Tcl_Interp *interp, /* Current interpreter. */
int objc, /* Number of arguments. */
Tcl_Obj *CONST objv[]) /* Argument objects. */
{
int i, argsLeft, code;
SearchSpec searchSpec;
static CONST char *switchStrings[] = {
"--", "-all", "-backwards", "-count", "-elide", "-exact", "-forwards",
"-hidden", "-nocase", "-nolinestop", "-overlap", "-regexp",
"-strictlimits", NULL
};
enum SearchSwitches {
SEARCH_END, SEARCH_ALL, SEARCH_BACK, SEARCH_COUNT, SEARCH_ELIDE,
SEARCH_EXACT, SEARCH_FWD, SEARCH_HIDDEN, SEARCH_NOCASE,
SEARCH_NOLINESTOP, SEARCH_OVERLAP, SEARCH_REGEXP, SEARCH_STRICTLIMITS
};
/*
* Set up the search specification, including the last 4 fields which are
* text widget specific.
*/
searchSpec.exact = 1;
searchSpec.noCase = 0;
searchSpec.all = 0;
searchSpec.backwards = 0;
searchSpec.varPtr = NULL;
searchSpec.countPtr = NULL;
searchSpec.resPtr = NULL;
searchSpec.searchElide = 0;
searchSpec.noLineStop = 0;
searchSpec.overlap = 0;
searchSpec.strictLimits = 0;
searchSpec.numLines =
TkBTreeNumLines(textPtr->sharedTextPtr->tree, textPtr);
searchSpec.clientData = (ClientData)textPtr;
searchSpec.addLineProc = &TextSearchAddNextLine;
searchSpec.foundMatchProc = &TextSearchFoundMatch;
searchSpec.lineIndexProc = &TextSearchGetLineIndex;
/*
* Parse switches and other arguments.
*/
for (i=2 ; i<objc ; i++) {
int index;
if (Tcl_GetString(objv[i])[0] != '-') {
break;
}
if (Tcl_GetIndexFromObj(interp, objv[i], switchStrings, "switch", 0,
&index) != TCL_OK) {
/*
* Hide the -hidden option.
*/
Tcl_ResetResult(interp);
Tcl_AppendResult(interp, "bad switch \"", Tcl_GetString(objv[i]),
"\": must be --, -all, -backward, -count, -elide, ",
"-exact, -forward, -nocase, -nolinestop, -overlap, ",
"-regexp, or -strictlimits", NULL);
return TCL_ERROR;
}
switch ((enum SearchSwitches) index) {
case SEARCH_END:
i++;
goto endOfSwitchProcessing;
case SEARCH_ALL:
searchSpec.all = 1;
break;
case SEARCH_BACK:
searchSpec.backwards = 1;
break;
case SEARCH_COUNT:
if (i >= objc-1) {
Tcl_SetResult(interp, "no value given for \"-count\" option",
TCL_STATIC);
return TCL_ERROR;
}
i++;
/*
* Assumption objv[i] isn't going to disappear on us during this
* function, which is fair.
*/
searchSpec.varPtr = objv[i];
break;
case SEARCH_ELIDE:
case SEARCH_HIDDEN:
searchSpec.searchElide = 1;
break;
case SEARCH_EXACT:
searchSpec.exact = 1;
break;
case SEARCH_FWD:
searchSpec.backwards = 0;
break;
case SEARCH_NOCASE:
searchSpec.noCase = 1;
break;
case SEARCH_NOLINESTOP:
searchSpec.noLineStop = 1;
break;
case SEARCH_OVERLAP:
searchSpec.overlap = 1;
break;
case SEARCH_STRICTLIMITS:
searchSpec.strictLimits = 1;
break;
case SEARCH_REGEXP:
searchSpec.exact = 0;
break;
default:
Tcl_Panic("unexpected switch fallthrough");
}
}
endOfSwitchProcessing:
argsLeft = objc - (i+2);
if ((argsLeft != 0) && (argsLeft != 1)) {
Tcl_WrongNumArgs(interp, 2, objv,
"?switches? pattern index ?stopIndex?");
return TCL_ERROR;
}
if (searchSpec.noLineStop && searchSpec.exact) {
Tcl_SetResult(interp, "the \"-nolinestop\" option requires the "
"\"-regexp\" option to be present", TCL_STATIC);
return TCL_ERROR;
}
if (searchSpec.overlap && !searchSpec.all) {
Tcl_SetResult(interp, "the \"-overlap\" option requires the "
"\"-all\" option to be present", TCL_STATIC);
return TCL_ERROR;
}
/*
* Scan through all of the lines of the text circularly, starting at the
* given index. 'objv[i]' is the pattern which may be an exact string or a
* regexp pattern depending on the flags set above.
*/
code = SearchPerform(interp, &searchSpec, objv[i], objv[i+1],
(argsLeft == 1 ? objv[i+2] : NULL));
if (code != TCL_OK) {
goto cleanup;
}
/*
* Set the '-count' variable, if given.
*/
if (searchSpec.varPtr != NULL && searchSpec.countPtr != NULL) {
Tcl_IncrRefCount(searchSpec.countPtr);
if (Tcl_ObjSetVar2(interp, searchSpec.varPtr, NULL,
searchSpec.countPtr, TCL_LEAVE_ERR_MSG) == NULL) {
code = TCL_ERROR;
goto cleanup;
}
}
/*
* Set the result.
*/
if (searchSpec.resPtr != NULL) {
Tcl_SetObjResult(interp, searchSpec.resPtr);
searchSpec.resPtr = NULL;
}
cleanup:
if (searchSpec.countPtr != NULL) {
Tcl_DecrRefCount(searchSpec.countPtr);
}
if (searchSpec.resPtr != NULL) {
Tcl_DecrRefCount(searchSpec.resPtr);
}
return code;
}
/*
*----------------------------------------------------------------------
*
* TextSearchGetLineIndex --
*
* Extract a row, text offset index position from an objPtr
*
* This means we ignore any embedded windows/images and elidden text
* (unless we are searching that).
*
* Results:
* Standard Tcl error code (with a message in the interpreter on error
* conditions).
*
* The offset placed in offsetPosPtr is a utf-8 char* byte index for
* exact searches, and a Unicode character index for regexp searches.
*
* The line number should start at zero (searches which wrap around
* assume the first line is numbered 0).
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
static int
TextSearchGetLineIndex(
Tcl_Interp *interp, /* For error messages. */
Tcl_Obj *objPtr, /* Contains a textual index like "1.2" */
SearchSpec *searchSpecPtr, /* Contains other search parameters. */
int *linePosPtr, /* For returning the line number. */
int *offsetPosPtr) /* For returning the text offset in the
* line. */
{
CONST TkTextIndex *indexPtr;
int line;
TkText *textPtr = (TkText *) searchSpecPtr->clientData;
indexPtr = TkTextGetIndexFromObj(interp, textPtr, objPtr);
if (indexPtr == NULL) {
return TCL_ERROR;
}
line = TkBTreeLinesTo(textPtr, indexPtr->linePtr);
if (line >= searchSpecPtr->numLines) {
TkTextLine *linePtr;
int count = 0;
TkTextSegment *segPtr;
line = searchSpecPtr->numLines-1;
linePtr = TkBTreeFindLine(textPtr->sharedTextPtr->tree, textPtr, line);
/*
* Count the number of bytes in this line.
*/
for (segPtr=linePtr->segPtr ; segPtr!=NULL ; segPtr=segPtr->nextPtr) {
count += segPtr->size;
}
*offsetPosPtr = TextSearchIndexInLine(searchSpecPtr, linePtr, count);
} else {
*offsetPosPtr = TextSearchIndexInLine(searchSpecPtr,
indexPtr->linePtr, indexPtr->byteIndex);
}
*linePosPtr = line;
return TCL_OK;
}
/*
*----------------------------------------------------------------------
*
* TextSearchIndexInLine --
*
* Find textual index of 'byteIndex' in the searchable characters of
* 'linePtr'.
*
* This means we ignore any embedded windows/images and elidden text
* (unless we are searching that).
*
* Results:
* The returned index is a utf-8 char* byte index for exact searches, and
* a Unicode character index for regexp searches.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
static int
TextSearchIndexInLine(
CONST SearchSpec *searchSpecPtr,
/* Search parameters. */
TkTextLine *linePtr, /* The line we're looking at. */
int byteIndex) /* Index into the line. */
{
TkTextSegment *segPtr;
TkTextIndex curIndex;
int index, leftToScan;
TkText *textPtr = (TkText *) searchSpecPtr->clientData;
index = 0;
curIndex.tree = textPtr->sharedTextPtr->tree;
curIndex.linePtr = linePtr; curIndex.byteIndex = 0;
for (segPtr = linePtr->segPtr, leftToScan = byteIndex;
leftToScan > 0;
curIndex.byteIndex += segPtr->size, segPtr = segPtr->nextPtr) {
if ((segPtr->typePtr == &tkTextCharType) &&
(searchSpecPtr->searchElide
|| !TkTextIsElided(textPtr, &curIndex, NULL))) {
if (leftToScan < segPtr->size) {
if (searchSpecPtr->exact) {
index += leftToScan;
} else {
index += Tcl_NumUtfChars(segPtr->body.chars, leftToScan);
}
} else if (searchSpecPtr->exact) {
index += segPtr->size;
} else {
index += Tcl_NumUtfChars(segPtr->body.chars, -1);
}
}
leftToScan -= segPtr->size;
}
return index;
}
/*
*----------------------------------------------------------------------
*
* TextSearchAddNextLine --
*
* Adds a line from the text widget to the object 'theLine'.
*
* Results:
* A pointer to the TkTextLine corresponding to the given line, or NULL
* if there was no available line.
*
* Also 'lenPtr' (if non-NULL) is filled in with the total length of
* 'theLine' (not just what we added to it, but the length including what
* was already in there). This is in bytes for an exact search and in
* chars for a regexp search.
*
* Also 'extraLinesPtr' (if non-NULL) will have its value incremented by
* 1 for each additional logical line we have added because a newline is
* elided (this will only ever happen if we have chosen not to search
* elided text, of course).
*
* Side effects:
* Memory may be allocated or re-allocated for theLine's string
* representation.
*
*----------------------------------------------------------------------
*/
static ClientData
TextSearchAddNextLine(
int lineNum, /* Line we must add. */
SearchSpec *searchSpecPtr, /* Search parameters. */
Tcl_Obj *theLine, /* Object to append to. */
int *lenPtr, /* For returning the total length. */
int *extraLinesPtr) /* If non-NULL, will have its value
* incremented by the number of additional
* logical lines which are merged into this
* one by newlines being elided. */
{
TkTextLine *linePtr, *thisLinePtr;
TkTextIndex curIndex;
TkTextSegment *segPtr;
TkText *textPtr = (TkText *) searchSpecPtr->clientData;
int nothingYet = 1;
/*
* Extract the text from the line.
*/
linePtr = TkBTreeFindLine(textPtr->sharedTextPtr->tree, textPtr, lineNum);
if (linePtr == NULL) {
return NULL;
}
curIndex.tree = textPtr->sharedTextPtr->tree;
thisLinePtr = linePtr;
while (thisLinePtr != NULL) {
int elideWraps = 0;
curIndex.linePtr = thisLinePtr;
curIndex.byteIndex = 0;
for (segPtr = thisLinePtr->segPtr; segPtr != NULL;
curIndex.byteIndex += segPtr->size, segPtr = segPtr->nextPtr) {
if (!searchSpecPtr->searchElide
&& TkTextIsElided(textPtr, &curIndex, NULL)) {
/*
* If we reach the end of the logical line, and if we have at
* least one character in the string, then we continue
* wrapping to the next logical line. If there are no
* characters yet, then the entire line of characters is
* elided and there's no need to complicate matters by
* wrapping - we'll look at the next line in due course.
*/
if (segPtr->nextPtr == NULL && !nothingYet) {
elideWraps = 1;
}
continue;
}
if (segPtr->typePtr != &tkTextCharType) {
continue;
}
Tcl_AppendToObj(theLine, segPtr->body.chars, segPtr->size);
nothingYet = 0;
}
if (!elideWraps) {
break;
}
lineNum++;
if (lineNum >= searchSpecPtr->numLines) {
break;
}
thisLinePtr = TkBTreeNextLine(textPtr, thisLinePtr);
if (thisLinePtr != NULL && extraLinesPtr != NULL) {
/*
* Tell our caller we have an extra line merged in.
*/
*extraLinesPtr = (*extraLinesPtr) + 1;
}
}
/*
* If we're ignoring case, convert the line to lower case. There is no
* need to do this for regexp searches, since they handle a flag for this
* purpose.
*/
if (searchSpecPtr->exact && searchSpecPtr->noCase) {
Tcl_SetObjLength(theLine, Tcl_UtfToLower(Tcl_GetString(theLine)));
}
if (lenPtr != NULL) {
if (searchSpecPtr->exact) {
Tcl_GetStringFromObj(theLine, lenPtr);
} else {
*lenPtr = Tcl_GetCharLength(theLine);
}
}
return (ClientData)linePtr;
}
/*
*----------------------------------------------------------------------
*
* TextSearchFoundMatch --
*
* Stores information from a successful search.
*
* Results:
* 1 if the information was stored, 0 if the position at which the match
* was found actually falls outside the allowable search region (and
* therefore the search is actually complete).
*
* Side effects:
* Memory may be allocated in the 'countPtr' and 'resPtr' fields of
* 'searchSpecPtr'. Each of those objects will have refCount zero and
* must eventually be freed or stored elsewhere as appropriate.
*
*----------------------------------------------------------------------
*/
static int
TextSearchFoundMatch(
int lineNum, /* Line on which match was found. */
SearchSpec *searchSpecPtr, /* Search parameters. */
ClientData clientData, /* Token returned by the 'addNextLineProc',
* TextSearchAddNextLine. May be NULL, in
* which we case we must generate it (from
* lineNum). */
Tcl_Obj *theLine, /* Text from current line, only accessed for
* exact searches, and is allowed to be NULL
* for regexp searches. */
int matchOffset, /* Offset of found item in utf-8 bytes for
* exact search, Unicode chars for regexp. */
int matchLength) /* Length also in bytes/chars as per search
* type. */
{
int numChars;
int leftToScan;
TkTextIndex curIndex, foundIndex;
TkTextSegment *segPtr;
TkTextLine *linePtr;
TkText *textPtr = (TkText *) searchSpecPtr->clientData;
if (lineNum == searchSpecPtr->stopLine) {
/*
* If the current index is on the wrong side of the stopIndex, then
* the item we just found is actually outside the acceptable range,
* and the search is over.
*/
if (searchSpecPtr->backwards ^
(matchOffset >= searchSpecPtr->stopOffset)) {
return 0;
}
}
/*
* Calculate the character count, which may need augmenting if there are
* embedded windows or elidden text.
*/
if (searchSpecPtr->exact) {
CONST char *startOfLine = Tcl_GetString(theLine);
numChars = Tcl_NumUtfChars(startOfLine + matchOffset, matchLength);
} else {
numChars = matchLength;
}
/*
* If we're using strict limits checking, ensure that the match with its
* full length fits inside the given range.
*/
if (searchSpecPtr->strictLimits && lineNum == searchSpecPtr->stopLine) {
if (searchSpecPtr->backwards ^
((matchOffset + numChars) > searchSpecPtr->stopOffset)) {
return 0;
}
}
/*
* The index information returned by the regular expression parser only
* considers textual information: it doesn't account for embedded windows,
* elided text (when we are not searching elided text) or any other
* non-textual info. Scan through the line's segments again to adjust both
* matchChar and matchCount.
*
* We will walk through the segments of this line until we have either
* reached the end of the match or we have reached the end of the line.
*/
linePtr = (TkTextLine *)clientData;
if (linePtr == NULL) {
linePtr = TkBTreeFindLine(textPtr->sharedTextPtr->tree, textPtr,
lineNum);
}
curIndex.tree = textPtr->sharedTextPtr->tree;
/*
* Find the starting point.
*/
leftToScan = matchOffset;
while (1) {
curIndex.linePtr = linePtr;
curIndex.byteIndex = 0;
/*
* Note that we allow leftToScan to be zero because we want to skip
* over any preceding non-textual items.
*/
for (segPtr = linePtr->segPtr; leftToScan >= 0 && segPtr;
segPtr = segPtr->nextPtr) {
if (segPtr->typePtr != &tkTextCharType) {
matchOffset += segPtr->size;
} else if (!searchSpecPtr->searchElide
&& TkTextIsElided(textPtr, &curIndex, NULL)) {
if (searchSpecPtr->exact) {
matchOffset += segPtr->size;
} else {
matchOffset += Tcl_NumUtfChars(segPtr->body.chars, -1);
}
} else {
leftToScan -= segPtr->size;
}
curIndex.byteIndex += segPtr->size;
}
if (segPtr == NULL && leftToScan >= 0) {
/*
* This will only happen if we are eliding newlines.
*/
linePtr = TkBTreeNextLine(textPtr, linePtr);
if (linePtr == NULL) {
/*
* If we reach the end of the text, we have a serious problem,
* unless there's actually nothing left to look for.
*/
if (leftToScan == 0) {
break;
} else {
Tcl_Panic("Reached end of text in a match");
}
}
/*
* We've wrapped to the beginning of the next logical line, which
* has been merged with the previous one whose newline was elided.
*/
lineNum++;
matchOffset = 0;
} else {
break;
}
}
/*
* Calculate and store the found index in the result.
*/
if (searchSpecPtr->exact) {
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, textPtr, lineNum,
matchOffset, &foundIndex);
} else {
TkTextMakeCharIndex(textPtr->sharedTextPtr->tree, textPtr, lineNum,
matchOffset, &foundIndex);
}
if (searchSpecPtr->all) {
if (searchSpecPtr->resPtr == NULL) {
searchSpecPtr->resPtr = Tcl_NewObj();
}
Tcl_ListObjAppendElement(NULL, searchSpecPtr->resPtr,
TkTextNewIndexObj(textPtr, &foundIndex));
} else {
searchSpecPtr->resPtr = TkTextNewIndexObj(textPtr, &foundIndex);
}
/*
* Find the end point. Here 'leftToScan' could be negative already as a
* result of the above loop if the segment we reached spanned the start of
* the string. When we add matchLength it will become non-negative.
*/
for (leftToScan += matchLength; leftToScan > 0;
curIndex.byteIndex += segPtr->size, segPtr = segPtr->nextPtr) {
if (segPtr == NULL) {
/*
* We are on the next line - this of course should only ever
* happen with searches which have matched across multiple lines.
*/
linePtr = TkBTreeNextLine(textPtr, linePtr);
segPtr = linePtr->segPtr;
curIndex.linePtr = linePtr; curIndex.byteIndex = 0;
}
if (segPtr->typePtr != &tkTextCharType) {
/*
* Anything we didn't count in the search needs adding.
*/
numChars += segPtr->size;
continue;
} else if (!searchSpecPtr->searchElide
&& TkTextIsElided(textPtr, &curIndex, NULL)) {
numChars += Tcl_NumUtfChars(segPtr->body.chars, -1);
continue;
}
if (searchSpecPtr->exact) {
leftToScan -= segPtr->size;
} else {
leftToScan -= Tcl_NumUtfChars(segPtr->body.chars, -1);
}
}
/*
* Now store the count result, if it is wanted.
*/
if (searchSpecPtr->varPtr != NULL) {
Tcl_Obj *tmpPtr = Tcl_NewIntObj(numChars);
if (searchSpecPtr->all) {
if (searchSpecPtr->countPtr == NULL) {
searchSpecPtr->countPtr = Tcl_NewObj();
}
Tcl_ListObjAppendElement(NULL, searchSpecPtr->countPtr, tmpPtr);
} else {
searchSpecPtr->countPtr = tmpPtr;
}
}
return 1;
}
/*
*----------------------------------------------------------------------
*
* TkTextGetTabs --
*
* Parses a string description of a set of tab stops.
*
* Results:
* The return value is a pointer to a malloc'ed structure holding parsed
* information about the tab stops. If an error occurred then the return
* value is NULL and an error message is left in the interp's result.
*
* Side effects:
* Memory is allocated for the structure that is returned. It is up to
* the caller to free this structure when it is no longer needed.
*
*----------------------------------------------------------------------
*/
TkTextTabArray *
TkTextGetTabs(
Tcl_Interp *interp, /* Used for error reporting. */
TkText *textPtr, /* Information about the text widget. */
Tcl_Obj *stringPtr) /* Description of the tab stops. See the text
* manual entry for details. */
{
int objc, i, count;
Tcl_Obj **objv;
TkTextTabArray *tabArrayPtr;
TkTextTab *tabPtr;
Tcl_UniChar ch;
double prevStop, lastStop;
/*
* Map these strings to TkTextTabAlign values.
*/
static CONST char *tabOptionStrings[] = {
"left", "right", "center", "numeric", NULL
};
if (Tcl_ListObjGetElements(interp, stringPtr, &objc, &objv) != TCL_OK) {
return NULL;
}
/*
* First find out how many entries we need to allocate in the tab array.
*/
count = 0;
for (i = 0; i < objc; i++) {
char c = Tcl_GetString(objv[i])[0];
if ((c != 'l') && (c != 'r') && (c != 'c') && (c != 'n')) {
count++;
}
}
/*
* Parse the elements of the list one at a time to fill in the array.
*/
tabArrayPtr = (TkTextTabArray *) ckalloc((unsigned)
(sizeof(TkTextTabArray) + (count-1)*sizeof(TkTextTab)));
tabArrayPtr->numTabs = 0;
prevStop = 0.0;
lastStop = 0.0;
for (i = 0, tabPtr = &tabArrayPtr->tabs[0]; i < objc; i++, tabPtr++) {
int index;
/*
* This will round fractional pixels above 0.5 upwards, and otherwise
* downwards, to find the right integer pixel position.
*/
if (Tk_GetPixelsFromObj(interp, textPtr->tkwin, objv[i],
&tabPtr->location) != TCL_OK) {
goto error;
}
if (tabPtr->location <= 0) {
Tcl_AppendResult(interp, "tab stop \"", Tcl_GetString(objv[i]),
"\" is not at a positive distance", NULL);
goto error;
}
prevStop = lastStop;
if (Tk_GetMMFromObj(interp, textPtr->tkwin, objv[i],
&lastStop) != TCL_OK) {
goto error;
}
lastStop *= WidthOfScreen(Tk_Screen(textPtr->tkwin));
lastStop /= WidthMMOfScreen(Tk_Screen(textPtr->tkwin));
if (i > 0 && (tabPtr->location <= (tabPtr-1)->location)) {
/*
* This tab is actually to the left of the previous one, which is
* illegal.
*/
#ifdef _TK_ALLOW_DECREASING_TABS
/*
* Force the tab to be a typical character width to the right of
* the previous one, and update the 'lastStop' with the changed
* position.
*/
if (textPtr->charWidth > 0) {
tabPtr->location = (tabPtr-1)->location + textPtr->charWidth;
} else {
tabPtr->location = (tabPtr-1)->location + 8;
}
lastStop = tabPtr->location;
#else
Tcl_AppendResult(interp,
"tabs must be monotonically increasing, but \"",
Tcl_GetString(objv[i]),
"\" is smaller than or equal to the previous tab",
NULL);
goto error;
#endif /* _TK_ALLOW_DECREASING_TABS */
}
tabArrayPtr->numTabs++;
/*
* See if there is an explicit alignment in the next list element.
* Otherwise just use "left".
*/
tabPtr->alignment = LEFT;
if ((i+1) == objc) {
continue;
}
/*
* There may be a more efficient way of getting this.
*/
Tcl_UtfToUniChar(Tcl_GetString(objv[i+1]), &ch);
if (!Tcl_UniCharIsAlpha(ch)) {
continue;
}
i += 1;
if (Tcl_GetIndexFromObj(interp, objv[i], tabOptionStrings,
"tab alignment", 0, &index) != TCL_OK) {
goto error;
}
tabPtr->alignment = ((TkTextTabAlign)index);
}
/*
* For when we need to interpolate tab stops, store these two so we know
* the tab stop size to very high precision. With the above checks, we can
* guarantee that tabIncrement is strictly positive here.
*/
tabArrayPtr->lastTab = lastStop;
tabArrayPtr->tabIncrement = lastStop - prevStop;
return tabArrayPtr;
error:
ckfree((char *) tabArrayPtr);
return NULL;
}
/*
*----------------------------------------------------------------------
*
* TextDumpCmd --
*
* Return information about the text, tags, marks, and embedded windows
* and images in a text widget. See the man page for the description of
* the text dump operation for all the details.
*
* Results:
* A standard Tcl result.
*
* Side effects:
* Memory is allocated for the result, if needed (standard Tcl result
* side effects).
*
*----------------------------------------------------------------------
*/
static int
TextDumpCmd(
register TkText *textPtr, /* Information about text widget. */
Tcl_Interp *interp, /* Current interpreter. */
int objc, /* Number of arguments. */
Tcl_Obj *CONST objv[]) /* Argument objects. Someone else has already
* parsed this command enough to know that
* objv[1] is "dump". */
{
TkTextIndex index1, index2;
int arg;
int lineno; /* Current line number. */
int what = 0; /* bitfield to select segment types. */
int atEnd; /* True if dumping up to logical end. */
TkTextLine *linePtr;
Tcl_Obj *command = NULL; /* Script callback to apply to segments. */
#define TK_DUMP_TEXT 0x1
#define TK_DUMP_MARK 0x2
#define TK_DUMP_TAG 0x4
#define TK_DUMP_WIN 0x8
#define TK_DUMP_IMG 0x10
#define TK_DUMP_ALL (TK_DUMP_TEXT|TK_DUMP_MARK|TK_DUMP_TAG| \
TK_DUMP_WIN|TK_DUMP_IMG)
static CONST char *optStrings[] = {
"-all", "-command", "-image", "-mark", "-tag", "-text", "-window",
NULL
};
enum opts {
DUMP_ALL, DUMP_CMD, DUMP_IMG, DUMP_MARK, DUMP_TAG, DUMP_TXT, DUMP_WIN
};
for (arg=2 ; arg < objc ; arg++) {
int index;
if (Tcl_GetString(objv[arg])[0] != '-') {
break;
}
if (Tcl_GetIndexFromObj(interp, objv[arg], optStrings, "option", 0,
&index) != TCL_OK) {
return TCL_ERROR;
}
switch ((enum opts) index) {
case DUMP_ALL:
what = TK_DUMP_ALL;
break;
case DUMP_TXT:
what |= TK_DUMP_TEXT;
break;
case DUMP_TAG:
what |= TK_DUMP_TAG;
break;
case DUMP_MARK:
what |= TK_DUMP_MARK;
break;
case DUMP_IMG:
what |= TK_DUMP_IMG;
break;
case DUMP_WIN:
what |= TK_DUMP_WIN;
break;
case DUMP_CMD:
arg++;
if (arg >= objc) {
Tcl_AppendResult(interp, "Usage: ", Tcl_GetString(objv[0]),
" dump ?-all -image -text -mark -tag -window? ",
"?-command script? index ?index2?", NULL);
return TCL_ERROR;
}
command = objv[arg];
break;
default:
Tcl_Panic("unexpected switch fallthrough");
}
}
if (arg >= objc || arg+2 < objc) {
Tcl_AppendResult(interp, "Usage: ", Tcl_GetString(objv[0]),
" dump ?-all -image -text -mark -tag -window? ",
"?-command script? index ?index2?", NULL);
return TCL_ERROR;
}
if (what == 0) {
what = TK_DUMP_ALL;
}
if (TkTextGetObjIndex(interp, textPtr, objv[arg], &index1) != TCL_OK) {
return TCL_ERROR;
}
arg++;
atEnd = 0;
if (objc == arg) {
TkTextIndexForwChars(NULL, &index1, 1, &index2, COUNT_INDICES);
} else {
int length;
char *str;
if (TkTextGetObjIndex(interp, textPtr, objv[arg], &index2) != TCL_OK) {
return TCL_ERROR;
}
str = Tcl_GetStringFromObj(objv[arg], &length);
if (strncmp(str, "end", (unsigned)length) == 0) {
atEnd = 1;
}
}
if (TkTextIndexCmp(&index1, &index2) >= 0) {
return TCL_OK;
}
lineno = TkBTreeLinesTo(textPtr, index1.linePtr);
if (index1.linePtr == index2.linePtr) {
DumpLine(interp, textPtr, what, index1.linePtr,
index1.byteIndex, index2.byteIndex, lineno, command);
} else {
int textChanged;
int lineend = TkBTreeLinesTo(textPtr, index2.linePtr);
int endByteIndex = index2.byteIndex;
textChanged = DumpLine(interp, textPtr, what, index1.linePtr,
index1.byteIndex, 32000000, lineno, command);
if (textChanged) {
if (textPtr->flags & DESTROYED) {
return TCL_OK;
}
linePtr = TkBTreeFindLine(textPtr->sharedTextPtr->tree,
textPtr, lineno);
textChanged = 0;
} else {
linePtr = index1.linePtr;
}
while ((linePtr = TkBTreeNextLine(textPtr, linePtr)) != NULL) {
lineno++;
if (lineno == lineend) {
break;
}
textChanged = DumpLine(interp, textPtr, what, linePtr, 0, 32000000,
lineno, command);
if (textChanged) {
if (textPtr->flags & DESTROYED) {
return TCL_OK;
}
linePtr = TkBTreeFindLine(textPtr->sharedTextPtr->tree,
textPtr, lineno);
textChanged = 0;
}
}
if (linePtr != NULL) {
DumpLine(interp, textPtr, what, linePtr, 0, endByteIndex, lineno,
command);
if (textPtr->flags & DESTROYED) {
return TCL_OK;
}
}
}
/*
* Special case to get the leftovers hiding at the end mark.
*/
if (atEnd) {
if (textPtr->flags & DESTROYED) {
return TCL_OK;
}
/*
* Re-get the end index, in case it has changed.
*/
if (TkTextGetObjIndex(interp, textPtr, objv[arg], &index2) != TCL_OK) {
return TCL_ERROR;
}
DumpLine(interp, textPtr, what & ~TK_DUMP_TEXT, index2.linePtr,
0, 1, lineno, command);
}
return TCL_OK;
}
/*
*----------------------------------------------------------------------
*
* DumpLine
*
* Return information about a given text line from character position
* "start" up to, but not including, "end".
*
* Results:
* Returns 1 if the command callback made any changes to the text widget
* which will have invalidated internal structures such as TkTextSegment,
* TkTextIndex, pointers. Our caller can then take action to recompute
* such entities. Returns 0 otherwise.
*
* Side effects:
* None, but see DumpSegment which can have arbitrary side-effects
*
*----------------------------------------------------------------------
*/
static int
DumpLine(
Tcl_Interp *interp,
TkText *textPtr,
int what, /* Bit flags to select segment types. */
TkTextLine *linePtr, /* The current line. */
int startByte, int endByte, /* Byte range to dump. */
int lineno, /* Line number for indices dump. */
Tcl_Obj *command) /* Script to apply to the segment. */
{
TkTextSegment *segPtr;
TkTextIndex index;
int offset = 0, textChanged = 0;
/*
* Must loop through line looking at its segments.
* character
* toggleOn, toggleOff
* mark
* image
* window
*/
segPtr = linePtr->segPtr;
while ((offset < endByte) && (segPtr != NULL)) {
int lineChanged = 0;
int currentSize = segPtr->size;
if ((what & TK_DUMP_TEXT) && (segPtr->typePtr == &tkTextCharType) &&
(offset + segPtr->size > startByte)) {
int last = segPtr->size; /* Index of last char in seg. */
int first = 0; /* Index of first char in seg. */
if (offset + segPtr->size > endByte) {
last = endByte - offset;
}
if (startByte > offset) {
first = startByte - offset;
}
if (last != segPtr->size) {
/*
* To avoid modifying the string in place we copy over just
* the segment that we want. Since DumpSegment can modify the
* text, we could not confidently revert the modification
* here.
*/
int length = last - first;
char *range = ckalloc((length + 1) * sizeof(char));
memcpy(range, segPtr->body.chars + first,
length * sizeof(char));
range[length] = '\0';
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, textPtr,
lineno, offset + first, &index);
lineChanged = DumpSegment(textPtr, interp, "text", range,
command, &index, what);
ckfree(range);
} else {
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, textPtr,
lineno, offset + first, &index);
lineChanged = DumpSegment(textPtr, interp, "text",
segPtr->body.chars + first, command, &index, what);
}
} else if ((offset >= startByte)) {
if ((what & TK_DUMP_MARK) && (segPtr->typePtr->name[0] == 'm')) {
char *name;
TkTextMark *markPtr = (TkTextMark *) &segPtr->body;
if (segPtr == textPtr->insertMarkPtr) {
name = "insert";
} else if (segPtr == textPtr->currentMarkPtr) {
name = "current";
} else {
name = Tcl_GetHashKey(&textPtr->sharedTextPtr->markTable,
markPtr->hPtr);
}
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, textPtr,
lineno, offset, &index);
lineChanged = DumpSegment(textPtr, interp, "mark", name,
command, &index, what);
} else if ((what & TK_DUMP_TAG) &&
(segPtr->typePtr == &tkTextToggleOnType)) {
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, textPtr,
lineno, offset, &index);
lineChanged = DumpSegment(textPtr, interp, "tagon",
segPtr->body.toggle.tagPtr->name, command, &index,
what);
} else if ((what & TK_DUMP_TAG) &&
(segPtr->typePtr == &tkTextToggleOffType)) {
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, textPtr,
lineno, offset, &index);
lineChanged = DumpSegment(textPtr, interp, "tagoff",
segPtr->body.toggle.tagPtr->name, command, &index,
what);
} else if ((what & TK_DUMP_IMG) &&
(segPtr->typePtr->name[0] == 'i')) {
TkTextEmbImage *eiPtr = (TkTextEmbImage *)&segPtr->body;
char *name = (eiPtr->name == NULL) ? "" : eiPtr->name;
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, textPtr,
lineno, offset, &index);
lineChanged = DumpSegment(textPtr, interp, "image", name,
command, &index, what);
} else if ((what & TK_DUMP_WIN) &&
(segPtr->typePtr->name[0] == 'w')) {
TkTextEmbWindow *ewPtr = (TkTextEmbWindow *)&segPtr->body;
char *pathname;
if (ewPtr->tkwin == (Tk_Window) NULL) {
pathname = "";
} else {
pathname = Tk_PathName(ewPtr->tkwin);
}
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, textPtr,
lineno, offset, &index);
lineChanged = DumpSegment(textPtr, interp, "window", pathname,
command, &index, what);
}
}
offset += currentSize;
if (lineChanged) {
TkTextSegment *newSegPtr;
int newOffset = 0;
textChanged = 1;
/*
* Our indices are no longer valid.
*/
if (textPtr->flags & DESTROYED) {
return textChanged;
}
linePtr = TkBTreeFindLine(textPtr->sharedTextPtr->tree,
textPtr, lineno);
newSegPtr = linePtr->segPtr;
if (segPtr == newSegPtr) {
segPtr = segPtr->nextPtr;
} else {
while ((newOffset < endByte) && (newOffset < offset)
&& (newSegPtr != NULL)) {
newOffset += segPtr->size;
newSegPtr = newSegPtr->nextPtr;
if (segPtr == newSegPtr) {
break;
}
}
if (segPtr != newSegPtr && newOffset == offset
&& currentSize == 0) {
TkTextSegment *searchPtr = newSegPtr;
while (searchPtr != NULL && searchPtr->size == 0) {
if (searchPtr == segPtr) {
newSegPtr = searchPtr;
break;
}
searchPtr = searchPtr->nextPtr;
}
}
segPtr = newSegPtr;
if (segPtr != NULL) {
segPtr = segPtr->nextPtr;
}
}
} else {
segPtr = segPtr->nextPtr;
}
}
return textChanged;
}
/*
*----------------------------------------------------------------------
*
* DumpSegment
*
* Either append information about the current segment to the result, or
* make a script callback with that information as arguments.
*
* Results:
* Returns 1 if the command callback made any changes to the text widget
* which will have invalidated internal structures such as TkTextSegment,
* TkTextIndex, pointers. Our caller can then take action to recompute
* such entities. Returns 0 otherwise.
*
* Side effects:
* Either evals the callback or appends elements to the result string.
* The callback can have arbitrary side-effects.
*
*----------------------------------------------------------------------
*/
static int
DumpSegment(
TkText *textPtr,
Tcl_Interp *interp,
CONST char *key, /* Segment type key. */
CONST char *value, /* Segment value. */
Tcl_Obj *command, /* Script callback. */
CONST TkTextIndex *index, /* index with line/byte position info. */
int what) /* Look for TK_DUMP_INDEX bit. */
{
char buffer[TK_POS_CHARS];
TkTextPrintIndex(textPtr, index, buffer);
if (command == NULL) {
Tcl_AppendElement(interp, key);
Tcl_AppendElement(interp, value);
Tcl_AppendElement(interp, buffer);
return 0;
} else {
CONST char *argv[4];
char *list;
int oldStateEpoch = TkBTreeEpoch(textPtr->sharedTextPtr->tree);
argv[0] = key;
argv[1] = value;
argv[2] = buffer;
argv[3] = NULL;
list = Tcl_Merge(3, argv);
Tcl_VarEval(interp, Tcl_GetString(command), " ", list, NULL);
ckfree(list);
if ((textPtr->flags & DESTROYED) ||
TkBTreeEpoch(textPtr->sharedTextPtr->tree) != oldStateEpoch) {
return 1;
} else {
return 0;
}
}
}
/*
*----------------------------------------------------------------------
*
* TextEditUndo --
*
* Undo the last change.
*
* Results:
* None.
*
* Side effects:
* Apart from manipulating the undo and redo stacks, the state of the
* rest of the widget may also change (due to whatever is being undone).
*
*----------------------------------------------------------------------
*/
static int
TextEditUndo(
TkText *textPtr) /* Overall information about text widget. */
{
int status;
if (!textPtr->sharedTextPtr->undo) {
return TCL_OK;
}
/*
* Turn off the undo feature while we revert a compound action. Note that
* the dirty counter counts backwards while we are undoing...
*/
textPtr->sharedTextPtr->undo = 0;
textPtr->sharedTextPtr->isDirtyIncrement = -1;
status = TkUndoRevert(textPtr->sharedTextPtr->undoStack);
textPtr->sharedTextPtr->isDirtyIncrement = 1;
textPtr->sharedTextPtr->undo = 1;
return status;
}
/*
*----------------------------------------------------------------------
*
* TextEditRedo --
*
* Redo the last undone change.
*
* Results:
* None.
*
* Side effects:
* Apart from manipulating the undo and redo stacks, the state of the
* rest of the widget may also change (due to whatever is being redone).
*
*----------------------------------------------------------------------
*/
static int
TextEditRedo(
TkText *textPtr) /* Overall information about text widget. */
{
int status;
if (!textPtr->sharedTextPtr->undo) {
return TCL_OK;
}
/*
* Turn off the undo feature temporarily while we revert a previously
* undone compound action.
*/
textPtr->sharedTextPtr->undo = 0;
status = TkUndoApply(textPtr->sharedTextPtr->undoStack);
textPtr->sharedTextPtr->undo = 1;
return status;
}
/*
*----------------------------------------------------------------------
*
* TextEditCmd --
*
* Handle the subcommands to "$text edit ...". See documentation for
* details.
*
* Results:
* None
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
static int
TextEditCmd(
TkText *textPtr, /* Information about text widget. */
Tcl_Interp *interp, /* Current interpreter. */
int objc, /* Number of arguments. */
Tcl_Obj *CONST objv[]) /* Argument objects. */
{
int index;
static CONST char *editOptionStrings[] = {
"modified", "redo", "reset", "separator", "undo", NULL
};
enum editOptions {
EDIT_MODIFIED, EDIT_REDO, EDIT_RESET, EDIT_SEPARATOR, EDIT_UNDO
};
if (objc < 3) {
Tcl_WrongNumArgs(interp, 2, objv, "option ?arg arg ...?");
return TCL_ERROR;
}
if (Tcl_GetIndexFromObj(interp, objv[2], editOptionStrings,
"edit option", 0, &index) != TCL_OK) {
return TCL_ERROR;
}
switch ((enum editOptions) index) {
case EDIT_MODIFIED:
if (objc == 3) {
Tcl_SetObjResult(interp,
Tcl_NewBooleanObj(textPtr->sharedTextPtr->isDirty));
} else if (objc != 4) {
Tcl_WrongNumArgs(interp, 3, objv, "?boolean?");
return TCL_ERROR;
} else {
int setModified;
XEvent event;
if (Tcl_GetBooleanFromObj(interp, objv[3],
&setModified) != TCL_OK) {
return TCL_ERROR;
}
/*
* Set or reset the dirty info and trigger a Modified event.
*/
if (setModified) {
textPtr->sharedTextPtr->isDirty = 1;
textPtr->sharedTextPtr->modifiedSet = 1;
} else {
textPtr->sharedTextPtr->isDirty = 0;
textPtr->sharedTextPtr->modifiedSet = 0;
}
/*
* Send an event that the text was modified. This is equivalent to
* "event generate $textWidget <<Modified>>"
*/
memset(&event, 0, sizeof(event));
event.xany.type = VirtualEvent;
event.xany.serial = NextRequest(Tk_Display(textPtr->tkwin));
event.xany.send_event = False;
event.xany.window = Tk_WindowId(textPtr->tkwin);
event.xany.display = Tk_Display(textPtr->tkwin);
((XVirtualEvent *) &event)->name = Tk_GetUid("Modified");
Tk_HandleEvent(&event);
}
break;
case EDIT_REDO:
if (objc != 3) {
Tcl_WrongNumArgs(interp, 3, objv, NULL);
return TCL_ERROR;
}
if (TextEditRedo(textPtr)) {
Tcl_AppendResult(interp, "nothing to redo", NULL);
return TCL_ERROR;
}
break;
case EDIT_RESET:
if (objc != 3) {
Tcl_WrongNumArgs(interp, 3, objv, NULL);
return TCL_ERROR;
}
TkUndoClearStacks(textPtr->sharedTextPtr->undoStack);
break;
case EDIT_SEPARATOR:
if (objc != 3) {
Tcl_WrongNumArgs(interp, 3, objv, NULL);
return TCL_ERROR;
}
TkUndoInsertUndoSeparator(textPtr->sharedTextPtr->undoStack);
break;
case EDIT_UNDO:
if (objc != 3) {
Tcl_WrongNumArgs(interp, 3, objv, NULL);
return TCL_ERROR;
}
if (TextEditUndo(textPtr)) {
Tcl_AppendResult(interp, "nothing to undo", NULL);
return TCL_ERROR;
}
break;
}
return TCL_OK;
}
/*
*----------------------------------------------------------------------
*
* TextGetText --
*
* Returns the text from indexPtr1 to indexPtr2, placing that text in a
* string object which is returned with a refCount of zero.
*
* Since the amount of text may potentially be several megabytes (e.g.
* in text editors built on the text widget), efficiency is very
* important. We may want to investigate the efficiency of the
* Tcl_AppendToObj more carefully (e.g. if we know we are going to be
* appending several thousand lines, we could attempt to pre-allocate a
* larger space).
*
* Also the result is built up as a utf-8 string, but, if we knew we
* wanted it as Unicode, we could potentially save a huge conversion by
* building it up as Unicode directly. This could be as simple as
* replacing Tcl_NewObj by Tcl_NewUnicodeObj.
*
* Results:
* Tcl_Obj of string type containing the specified text. If the
* visibleOnly flag is set to 1, then only those characters which are not
* elided will be returned. Otherwise (flag is 0) all characters in the
* given range are returned.
*
* Side effects:
* Memory will be allocated for the new object. Remember to free it if it
* isn't going to be stored appropriately.
*
*----------------------------------------------------------------------
*/
static Tcl_Obj *
TextGetText(
CONST TkText *textPtr, /* Information about text widget. */
CONST TkTextIndex *indexPtr1,
/* Get text from this index... */
CONST TkTextIndex *indexPtr2,
/* ...to this index. */
int visibleOnly) /* If non-zero, then only return non-elided
* characters. */
{
TkTextIndex tmpIndex;
Tcl_Obj *resultPtr = Tcl_NewObj();
TkTextMakeByteIndex(indexPtr1->tree, textPtr,
TkBTreeLinesTo(textPtr, indexPtr1->linePtr),
indexPtr1->byteIndex, &tmpIndex);
if (TkTextIndexCmp(indexPtr1, indexPtr2) < 0) {
while (1) {
int offset, last;
TkTextSegment *segPtr;
segPtr = TkTextIndexToSeg(&tmpIndex, &offset);
last = segPtr->size;
if (tmpIndex.linePtr == indexPtr2->linePtr) {
/*
* The last line that was requested must be handled carefully,
* because we may need to break out of this loop in the middle
* of the line.
*/
if (indexPtr2->byteIndex == tmpIndex.byteIndex) {
break;
} else {
int last2 = indexPtr2->byteIndex - tmpIndex.byteIndex
+ offset;
if (last2 < last) {
last = last2;
}
}
}
if (segPtr->typePtr == &tkTextCharType) {
if (!visibleOnly || !TkTextIsElided(textPtr,&tmpIndex,NULL)) {
Tcl_AppendToObj(resultPtr, segPtr->body.chars + offset,
last - offset);
}
}
TkTextIndexForwBytes(textPtr, &tmpIndex, last-offset, &tmpIndex);
}
}
return resultPtr;
}
/*
*----------------------------------------------------------------------
*
* UpdateDirtyFlag --
*
* Increases the dirtyness of the text widget
*
* Results:
* None
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
static void
UpdateDirtyFlag(
TkSharedText *sharedTextPtr)/* Information about text widget. */
{
int oldDirtyFlag;
if (sharedTextPtr->modifiedSet) {
return;
}
oldDirtyFlag = sharedTextPtr->isDirty;
sharedTextPtr->isDirty += sharedTextPtr->isDirtyIncrement;
if (sharedTextPtr->isDirty == 0 || oldDirtyFlag == 0) {
TkText *textPtr;
for (textPtr = sharedTextPtr->peers; textPtr != NULL;
textPtr = textPtr->next) {
/*
* Send an event that the text was modified. This is equivalent to
* event generate $textWidget <<Modified>>
*/
XEvent event;
memset(&event, 0, sizeof(event));
event.xany.type = VirtualEvent;
event.xany.serial = NextRequest(Tk_Display(textPtr->tkwin));
event.xany.send_event = False;
event.xany.window = Tk_WindowId(textPtr->tkwin);
event.xany.display = Tk_Display(textPtr->tkwin);
((XVirtualEvent *) &event)->name = Tk_GetUid("Modified");
Tk_HandleEvent(&event);
}
}
}
/*
*----------------------------------------------------------------------
*
* SearchPerform --
*
* Overall control of search process. Is given a pattern, a starting
* index and an ending index, and attempts to perform a search. This
* function is actually completely independent of Tk, and could in the
* future be split off.
*
* Results:
* Standard Tcl result code. In particular, if fromPtr or toPtr are not
* considered valid by the 'lineIndexProc', an error will be thrown and
* no search performed.
*
* Side effects:
* See 'SearchCore'.
*
*----------------------------------------------------------------------
*/
static int
SearchPerform(
Tcl_Interp *interp, /* For error messages. */
SearchSpec *searchSpecPtr, /* Search parameters. */
Tcl_Obj *patObj, /* Contains an exact string or a regexp
* pattern. Must have a refCount > 0. */
Tcl_Obj *fromPtr, /* Contains information describing the first
* index. */
Tcl_Obj *toPtr) /* NULL or information describing the last
* index. */
{
/*
* Find the starting line and starting offset (measured in Unicode chars
* for regexp search, utf-8 bytes for exact search).
*/
if ((*searchSpecPtr->lineIndexProc)(interp, fromPtr, searchSpecPtr,
&searchSpecPtr->startLine,
&searchSpecPtr->startOffset) != TCL_OK) {
return TCL_ERROR;
}
/*
* Find the optional end location, similarly.
*/
if (toPtr != NULL) {
CONST TkTextIndex *indexToPtr, *indexFromPtr;
TkText *textPtr = (TkText *) searchSpecPtr->clientData;
indexToPtr = TkTextGetIndexFromObj(interp, textPtr, toPtr);
if (indexToPtr == NULL) {
return TCL_ERROR;
}
indexFromPtr = TkTextGetIndexFromObj(interp, textPtr, fromPtr);
/*
* Check for any empty search range here. It might be better in the
* future to embed that in SearchCore (whose default behaviour is to
* wrap when given a negative search range).
*/
if (searchSpecPtr->backwards) {
if (TkTextIndexCmp(indexFromPtr, indexToPtr) == -1) {
return TCL_OK;
}
} else {
if (TkTextIndexCmp(indexFromPtr, indexToPtr) == 1) {
return TCL_OK;
}
}
if ((*searchSpecPtr->lineIndexProc)(interp, toPtr, searchSpecPtr,
&searchSpecPtr->stopLine,
&searchSpecPtr->stopOffset) != TCL_OK) {
return TCL_ERROR;
}
} else {
searchSpecPtr->stopLine = -1;
}
/*
* Scan through all of the lines of the text circularly, starting at the
* given index. 'patObj' is the pattern which may be an exact string or a
* regexp pattern depending on the flags in searchSpecPtr.
*/
return SearchCore(interp, searchSpecPtr, patObj);
}
/*
*----------------------------------------------------------------------
*
* SearchCore --
*
* The core of the search function. This function is actually completely
* independent of Tk, and could in the future be split off.
*
* The function assumes regexp-based searches operate on Unicode strings,
* and exact searches on utf-8 strings. Therefore the 'foundMatchProc'
* and 'addLineProc' need to be aware of this distinction.
*
* Results:
* Standard Tcl result code.
*
* Side effects:
* Only those of the 'searchSpecPtr->foundMatchProc' which is called
* whenever a match is found.
*
* Note that the way matching across multiple lines is implemented, we
* start afresh with each line we have available, even though we may
* already have examined the contents of that line (and further ones) if
* we were attempting a multi-line match using the previous line. This
* means there may be ways to speed this up a lot by not throwing away
* all the multi-line information one has accumulated. Profiling should
* be done to see where the bottlenecks lie before attempting this,
* however. We would also need to be very careful such optimisation keep
* within the specified search bounds.
*
*----------------------------------------------------------------------
*/
static int
SearchCore(
Tcl_Interp *interp, /* For error messages. */
SearchSpec *searchSpecPtr, /* Search parameters. */
Tcl_Obj *patObj) /* Contains an exact string or a regexp
* pattern. Must have a refCount > 0. */
{
/*
* For exact searches these are utf-8 char* offsets, for regexp searches
* they are Unicode char offsets.
*/
int firstOffset, lastOffset, matchOffset, matchLength;
int passes;
int lineNum = searchSpecPtr->startLine;
int code = TCL_OK;
Tcl_Obj *theLine;
int alreadySearchOffset = -1;
CONST char *pattern = NULL; /* For exact searches only. */
int firstNewLine = -1; /* For exact searches only. */
Tcl_RegExp regexp = NULL; /* For regexp searches only. */
/*
* These items are for backward regexp searches only. They are for two
* purposes: to allow us to report backwards matches in the correct order,
* even though the implementation uses repeated forward searches; and to
* provide for overlap checking between backwards matches on different
* text lines.
*/
#define LOTS_OF_MATCHES 20
int matchNum = LOTS_OF_MATCHES;
int smArray[2 * LOTS_OF_MATCHES];
int *storeMatch = smArray;
int *storeLength = smArray + LOTS_OF_MATCHES;
int lastBackwardsLineMatch = -1;
int lastBackwardsMatchOffset = -1;
if (searchSpecPtr->exact) {
/*
* Convert the pattern to lower-case if we're supposed to ignore case.
*/
if (searchSpecPtr->noCase) {
patObj = Tcl_DuplicateObj(patObj);
/*
* This can change the length of the string behind the object's
* back, so ensure it is correctly synchronised.
*/
Tcl_SetObjLength(patObj, Tcl_UtfToLower(Tcl_GetString(patObj)));
}
} else {
/*
* Compile the regular expression. We want '^$' to match after and
* before \n respectively, so use the TCL_REG_NLANCH flag.
*/
regexp = Tcl_GetRegExpFromObj(interp, patObj,
(searchSpecPtr->noCase ? TCL_REG_NOCASE : 0)
| (searchSpecPtr->noLineStop ? 0 : TCL_REG_NLSTOP)
| TCL_REG_ADVANCED | TCL_REG_CANMATCH | TCL_REG_NLANCH);
if (regexp == NULL) {
return TCL_ERROR;
}
}
/*
* For exact strings, we want to know where the first newline is, and we
* will also use this as a flag to test whether it is even possible to
* match the pattern on a single line. If not we will have to search
* across multiple lines.
*/
if (searchSpecPtr->exact) {
CONST char *nl;
/*
* We only need to set the matchLength once for exact searches, and we
* do it here. It is also used below as the actual pattern length, so
* it has dual purpose.
*/
pattern = Tcl_GetStringFromObj(patObj, &matchLength);
nl = strchr(pattern, '\n');
/*
* If there is no newline, or it is the very end of the string, then
* we don't need any special treatment, since single-line matching
* will work fine.
*/
if (nl != NULL && nl[1] != '\0') {
firstNewLine = (nl - pattern);
}
} else {
matchLength = 0; /* Only needed to prevent compiler warnings. */
}
/*
* Keep a reference here, so that we can be sure the object doesn't
* disappear behind our backs and invalidate its contents which we are
* using.
*/
Tcl_IncrRefCount(patObj);
/*
* For building up the current line being checked.
*/
theLine = Tcl_NewObj();
Tcl_IncrRefCount(theLine);
for (passes = 0; passes < 2; ) {
ClientData lineInfo;
int linesSearched = 1;
int extraLinesSearched = 0;
if (lineNum >= searchSpecPtr->numLines) {
/*
* Don't search the dummy last line of the text.
*/
goto nextLine;
}
/*
* Extract the text from the line, storing its length in 'lastOffset'
* (in bytes if exact, chars if regexp), since obviously the length is
* the maximum offset at which it is possible to find something on
* this line, which is what 'lastOffset' represents.
*/
lineInfo = (*searchSpecPtr->addLineProc)(lineNum, searchSpecPtr,
theLine, &lastOffset, &linesSearched);
if (lineInfo == NULL) {
/*
* This should not happen, since 'lineNum' should be valid in the
* call above. However, let's try to be flexible and not cause a
* crash below.
*/
goto nextLine;
}
if (lineNum == searchSpecPtr->stopLine && searchSpecPtr->backwards) {
firstOffset = searchSpecPtr->stopOffset;
} else {
firstOffset = 0;
}
if (alreadySearchOffset != -1) {
if (searchSpecPtr->backwards) {
if (alreadySearchOffset < lastOffset) {
lastOffset = alreadySearchOffset;
}
} else {
if (alreadySearchOffset > firstOffset) {
firstOffset = alreadySearchOffset;
}
}
alreadySearchOffset = -1;
}
if (lineNum == searchSpecPtr->startLine) {
/*
* The starting line is tricky: the first time we see it we check
* one part of the line, and the second pass through we check the
* other part of the line.
*/
passes++;
if ((passes == 1) ^ searchSpecPtr->backwards) {
/*
* Forward search and first pass, or backward search and
* second pass.
*
* Only use the last part of the line.
*/
if (searchSpecPtr->startOffset > firstOffset) {
firstOffset = searchSpecPtr->startOffset;
}
if ((firstOffset >= lastOffset)
&& ((lastOffset != 0) || searchSpecPtr->exact)) {
goto nextLine;
}
} else {
/*
* Use only the first part of the line.
*/
if (searchSpecPtr->startOffset < lastOffset) {
lastOffset = searchSpecPtr->startOffset;
}
}
}
/*
* Check for matches within the current line 'lineNum'. If so, and if
* we're searching backwards or for all matches, repeat the search
* until we find the last match in the line. The 'lastOffset' is one
* beyond the last position in the line at which a match is allowed to
* begin.
*/
matchOffset = -1;
if (searchSpecPtr->exact) {
int maxExtraLines = 0;
CONST char *startOfLine = Tcl_GetString(theLine);
do {
Tcl_UniChar ch;
CONST char *p;
int lastFullLine = lastOffset;
if (firstNewLine == -1) {
if (searchSpecPtr->strictLimits
&& (firstOffset + matchLength > lastOffset)) {
/*
* Not enough characters to match.
*/
break;
}
/*
* Single line matching. We want to scan forwards or
* backwards as appropriate.
*/
if (searchSpecPtr->backwards) {
/*
* Search back either from the previous match or from
* 'startOfLine + lastOffset - 1' until we find a
* match.
*/
CONST char c = pattern[0];
if (alreadySearchOffset != -1) {
p = startOfLine + alreadySearchOffset;
alreadySearchOffset = -1;
} else {
p = startOfLine + lastOffset -1;
}
while (p >= startOfLine + firstOffset) {
if (p[0] == c && !strncmp(p, pattern,
(unsigned)matchLength)) {
goto backwardsMatch;
}
p--;
}
break;
} else {
p = strstr(startOfLine + firstOffset, pattern);
}
if (p == NULL) {
/*
* Single line match failed.
*/
break;
}
} else if (firstNewLine >= (lastOffset - firstOffset)) {
/*
* Multi-line match, but not enough characters to match.
*/
break;
} else {
/*
* Multi-line match has only one possible match position,
* because we know where the '\n' is.
*/
p = startOfLine + lastOffset - firstNewLine - 1;
if (strncmp(p, pattern, (unsigned)(firstNewLine + 1))) {
/*
* No match.
*/
break;
} else {
int extraLines = 1;
/*
* If we find a match that overlaps more than one
* line, we will use this value to determine the first
* allowed starting offset for the following search
* (to avoid overlapping results).
*/
int lastTotal = lastOffset;
int skipFirst = lastOffset - firstNewLine -1;
/*
* We may be able to match if given more text. The
* following 'while' block handles multi-line exact
* searches.
*/
while (1) {
lastFullLine = lastTotal;
if (lineNum+extraLines>=searchSpecPtr->numLines) {
p = NULL;
break;
}
/*
* Only add the line if we haven't already done so
* already.
*/
if (extraLines > maxExtraLines) {
if ((*searchSpecPtr->addLineProc)(lineNum
+ extraLines, searchSpecPtr, theLine,
&lastTotal, &extraLines) == NULL) {
p = NULL;
if (!searchSpecPtr->backwards) {
extraLinesSearched = extraLines;
}
break;
}
maxExtraLines = extraLines;
}
startOfLine = Tcl_GetString(theLine);
p = startOfLine + skipFirst;
/*
* Use the fact that 'matchLength = patLength' for
* exact searches.
*/
if ((lastTotal - skipFirst) >= matchLength) {
/*
* We now have enough text to match, so we
* make a final test and break whatever the
* result.
*/
if (strncmp(p,pattern,(unsigned)matchLength)) {
p = NULL;
}
break;
} else {
/*
* Not enough text yet, but check the prefix.
*/
if (strncmp(p, pattern,
(unsigned)(lastTotal - skipFirst))) {
p = NULL;
break;
}
/*
* The prefix matches, so keep looking.
*/
}
extraLines++;
}
/*
* If we reach here, with p != NULL, we've found a
* multi-line match, else we started a multi-match but
* didn't finish it off, so we go to the next line.
*/
if (p == NULL) {
break;
}
/*
* We've found a multi-line match.
*/
if (extraLines > 0) {
extraLinesSearched = extraLines - 1;
}
}
}
backwardsMatch:
if ((p - startOfLine) >= lastOffset) {
break;
}
/*
* Remember the match.
*/
matchOffset = p - startOfLine;
if (searchSpecPtr->all &&
!(*searchSpecPtr->foundMatchProc)(lineNum,
searchSpecPtr, lineInfo, theLine, matchOffset,
matchLength)) {
/*
* We reached the end of the search.
*/
goto searchDone;
}
if (!searchSpecPtr->overlap) {
if (searchSpecPtr->backwards) {
alreadySearchOffset = p - startOfLine;
if (firstNewLine != -1) {
break;
} else {
alreadySearchOffset -= matchLength;
}
} else {
firstOffset = p - startOfLine + matchLength;
if (firstOffset >= lastOffset) {
/*
* Now, we have to be careful not to find
* overlapping matches either on the same or
* following lines. Assume that if we did find
* something, it goes until the last extra line we
* added.
*
* We can break out of the loop, since we know no
* more will be found.
*/
if (!searchSpecPtr->backwards) {
alreadySearchOffset =
firstOffset - lastFullLine;
break;
}
}
}
} else {
if (searchSpecPtr->backwards) {
alreadySearchOffset = p - startOfLine - 1;
if (alreadySearchOffset < 0) {
break;
}
} else {
firstOffset = p - startOfLine +
Tcl_UtfToUniChar(startOfLine+matchOffset,&ch);
}
}
} while (searchSpecPtr->all);
} else {
int maxExtraLines = 0;
int matches = 0;
int lastNonOverlap = -1;
do {
Tcl_RegExpInfo info;
int match;
int lastFullLine = lastOffset;
match = Tcl_RegExpExecObj(interp, regexp, theLine,
firstOffset, 1, (firstOffset>0 ? TCL_REG_NOTBOL : 0));
if (match < 0) {
code = TCL_ERROR;
goto searchDone;
}
Tcl_RegExpGetInfo(regexp, &info);
/*
* If we don't have a match, or if we do, but it extends to
* the end of the line, we must try to add more lines to get a
* full greedy match.
*/
if (!match ||
((info.extendStart == info.matches[0].start)
&& (info.matches[0].end == lastOffset-firstOffset))) {
int extraLines = 0;
int prevFullLine;
/*
* If we find a match that overlaps more than one line, we
* will use this value to determine the first allowed
* starting offset for the following search (to avoid
* overlapping results).
*/
int lastTotal = lastOffset;
if ((lastBackwardsLineMatch != -1)
&& (lastBackwardsLineMatch == (lineNum + 1))) {
lastNonOverlap = lastTotal;
}
if (info.extendStart < 0) {
/*
* No multi-line match is possible.
*/
break;
}
/*
* We may be able to match if given more text. The
* following 'while' block handles multi-line regexp
* searches.
*/
while (1) {
prevFullLine = lastTotal;
/*
* Move firstOffset to first possible start.
*/
if (!match) {
firstOffset += info.extendStart;
}
if (firstOffset >= lastOffset) {
/*
* We're being told that the only possible new
* match is starting after the end of the line.
* But, that is the next line which we will handle
* when we look at that line.
*/
if (!match && !searchSpecPtr->backwards
&& (firstOffset == 0)) {
extraLinesSearched = extraLines;
}
break;
}
if (lineNum + extraLines >= searchSpecPtr->numLines) {
break;
}
/*
* Add next line, provided we haven't already done so.
*/
if (extraLines > maxExtraLines) {
if ((*searchSpecPtr->addLineProc)(lineNum
+ extraLines, searchSpecPtr, theLine,
&lastTotal, &extraLines) == NULL) {
/*
* There are no more acceptable lines, so we
* can say we have searched all of these.
*/
if (!match && !searchSpecPtr->backwards) {
extraLinesSearched = extraLines;
}
break;
}
maxExtraLines = extraLines;
if ((lastBackwardsLineMatch != -1)
&& (lastBackwardsLineMatch
== (lineNum + extraLines + 1))) {
lastNonOverlap = lastTotal;
}
}
match = Tcl_RegExpExecObj(interp, regexp, theLine,
firstOffset, 1,
((firstOffset > 0) ? TCL_REG_NOTBOL : 0));
if (match < 0) {
code = TCL_ERROR;
goto searchDone;
}
Tcl_RegExpGetInfo(regexp, &info);
/*
* Unfortunately there are bugs in Tcl's regexp
* library, which tells us that info.extendStart is
* zero when it should not be (should be -1), which
* makes our task a bit more complicated here. We
* check if there was a match, and the end of the
* match leaves an entire extra line unmatched, then
* we stop searching. Clearly it still might sometimes
* be possible to add more text and match again, but
* Tcl's regexp library doesn't tell us that.
*
* This means we often add and search one more line
* than might be necessary if Tcl were able to give us
* a correct value of info.extendStart under all
* circumstances.
*/
if ((match &&
firstOffset+info.matches[0].end != lastTotal &&
firstOffset+info.matches[0].end < prevFullLine)
|| info.extendStart < 0) {
break;
}
/*
* If there is a match, but that match starts after
* the end of the first line, then we'll handle that
* next time around, when we're actually looking at
* that line.
*/
if (match && (info.matches[0].start >= lastOffset)) {
break;
}
if (match && ((firstOffset + info.matches[0].end)
>= prevFullLine)) {
if (extraLines > 0) {
extraLinesSearched = extraLines - 1;
}
lastFullLine = prevFullLine;
}
/*
* The prefix matches, so keep looking.
*/
extraLines++;
}
/*
* If we reach here with 'match == 1', we've found a
* multi-line match, which we will record in the code
* which follows directly else we started a multi-line
* match but didn't finish it off, so we go to the next
* line.
*/
if (!match) {
/*
* Here is where we could perform an optimisation,
* since we have already retrieved the contents of the
* next line (perhaps many more), so we shouldn't
* really throw it all away and start again. This
* could be particularly important for complex regexp
* searches.
*
* This 'break' will take us to just before the
* 'nextLine:' below.
*/
break;
}
if (lastBackwardsLineMatch != -1) {
if ((lineNum + linesSearched + extraLinesSearched)
== lastBackwardsLineMatch) {
/*
* Possible overlap or inclusion.
*/
int thisOffset = firstOffset + info.matches[0].end
- info.matches[0].start;
if (lastNonOverlap != -1) {
/*
* Possible overlap or enclosure.
*/
if (thisOffset-lastNonOverlap >=
lastBackwardsMatchOffset+matchLength){
/*
* Totally encloses previous match, so
* forget the previous match.
*/
lastBackwardsLineMatch = -1;
} else if ((thisOffset - lastNonOverlap)
> lastBackwardsMatchOffset) {
/*
* Overlap. Previous match is ok, and the
* current match is only ok if we are
* searching with -overlap.
*/
if (searchSpecPtr->overlap) {
goto recordBackwardsMatch;
} else {
match = 0;
break;
}
} else {
/*
* No overlap, although the same line was
* reached.
*/
goto recordBackwardsMatch;
}
} else {
/*
* No overlap.
*/
goto recordBackwardsMatch;
}
} else if (lineNum+linesSearched+extraLinesSearched
< lastBackwardsLineMatch) {
/*
* No overlap.
*/
goto recordBackwardsMatch;
} else {
/*
* Totally enclosed.
*/
lastBackwardsLineMatch = -1;
}
}
} else {
/*
* Matched in a single line.
*/
if (lastBackwardsLineMatch != -1) {
recordBackwardsMatch:
(*searchSpecPtr->foundMatchProc)(
lastBackwardsLineMatch, searchSpecPtr, NULL,
NULL, lastBackwardsMatchOffset, matchLength);
lastBackwardsLineMatch = -1;
if (!searchSpecPtr->all) {
goto searchDone;
}
}
}
firstOffset += info.matches[0].start;
if (firstOffset >= lastOffset) {
break;
}
/*
* Update our local variables with the match, if we haven't
* yet found anything, or if we're doing '-all' or
* '-backwards' _and_ this match isn't fully enclosed in the
* previous match.
*/
if (matchOffset == -1 ||
((searchSpecPtr->all || searchSpecPtr->backwards)
&& ((firstOffset < matchOffset)
|| ((firstOffset + info.matches[0].end
- info.matches[0].start)
> (matchOffset + matchLength))))) {
matchOffset = firstOffset;
matchLength = info.matches[0].end - info.matches[0].start;
if (searchSpecPtr->backwards) {
/*
* To get backwards searches in the correct order, we
* must store them away here.
*/
if (matches == matchNum) {
/*
* We've run out of space in our normal store, so
* we must allocate space for these backwards
* matches on the heap.
*/
int *newArray = (int *)
ckalloc(4 * matchNum * sizeof(int));
memcpy(newArray, storeMatch, matchNum*sizeof(int));
memcpy(newArray + 2*matchNum, storeLength,
matchNum * sizeof(int));
if (storeMatch != smArray) {
ckfree((char *) storeMatch);
}
matchNum *= 2;
storeMatch = newArray;
storeLength = newArray + matchNum;
}
storeMatch[matches] = matchOffset;
storeLength[matches] = matchLength;
matches++;
} else {
/*
* Now actually record the match, but only if we are
* doing an '-all' search.
*/
if (searchSpecPtr->all &&
!(*searchSpecPtr->foundMatchProc)(lineNum,
searchSpecPtr, lineInfo, theLine, matchOffset,
matchLength)) {
/*
* We reached the end of the search.
*/
goto searchDone;
}
}
/*
* For forward matches, unless we allow overlaps, we move
* this on by the length of the current match so that we
* explicitly disallow overlapping matches.
*/
if (matchLength > 0 && !searchSpecPtr->overlap
&& !searchSpecPtr->backwards) {
firstOffset += matchLength;
if (firstOffset >= lastOffset) {
/*
* Now, we have to be careful not to find
* overlapping matches either on the same or
* following lines. Assume that if we did find
* something, it goes until the last extra line we
* added.
*
* We can break out of the loop, since we know no
* more will be found.
*/
alreadySearchOffset = firstOffset - lastFullLine;
break;
}
/*
* We'll add this on again just below.
*/
firstOffset --;
}
}
/*
* Move the starting point on, in case we are doing repeated
* or backwards searches (for the latter, we actually do
* repeated forward searches).
*/
firstOffset++;
} while (searchSpecPtr->backwards || searchSpecPtr->all);
if (matches > 0) {
/*
* Now we have all the matches in our array, but not stored
* with 'foundMatchProc' yet.
*/
matches--;
matchOffset = storeMatch[matches];
matchLength = storeLength[matches];
while (--matches >= 0) {
if (lineNum == searchSpecPtr->stopLine) {
/*
* It appears as if a condition like:
*
* if (storeMatch[matches]<searchSpecPtr->stopOffset)
* break;
*
* might be needed here, but no test case has been
* found which would exercise such a problem.
*/
}
if (storeMatch[matches] + storeLength[matches]
>= matchOffset + matchLength) {
/*
* The new match totally encloses the previous one, so
* we overwrite the previous one.
*/
matchOffset = storeMatch[matches];
matchLength = storeLength[matches];
continue;
}
if (!searchSpecPtr->overlap) {
if (storeMatch[matches] + storeLength[matches]
> matchOffset) {
continue;
}
}
(*searchSpecPtr->foundMatchProc)(lineNum, searchSpecPtr,
lineInfo, theLine, matchOffset, matchLength);
if (!searchSpecPtr->all) {
goto searchDone;
}
matchOffset = storeMatch[matches];
matchLength = storeLength[matches];
}
if (searchSpecPtr->all && matches > 0) {
/*
* We only need to do this for the '-all' case, because
* just below we will call the foundMatchProc for the
* non-all case.
*/
(*searchSpecPtr->foundMatchProc)(lineNum, searchSpecPtr,
lineInfo, theLine, matchOffset, matchLength);
} else {
lastBackwardsLineMatch = lineNum;
lastBackwardsMatchOffset = matchOffset;
}
}
}
/*
* If the 'all' flag is set, we will already have stored all matches,
* so we just proceed to the next line.
*
* If not, and there is a match we need to store that information and
* we are done.
*/
if ((lastBackwardsLineMatch == -1) && (matchOffset >= 0)
&& !searchSpecPtr->all) {
(*searchSpecPtr->foundMatchProc)(lineNum, searchSpecPtr, lineInfo,
theLine, matchOffset, matchLength);
goto searchDone;
}
/*
* Go to the next (or previous) line;
*/
nextLine:
linesSearched += extraLinesSearched;
while (linesSearched-- > 0) {
/*
* If we have just completed the 'stopLine', we are done.
*/
if (lineNum == searchSpecPtr->stopLine) {
goto searchDone;
}
if (searchSpecPtr->backwards) {
lineNum--;
if (lastBackwardsLineMatch != -1
&& ((lineNum < 0)
|| (lineNum + 2 < lastBackwardsLineMatch))) {
(*searchSpecPtr->foundMatchProc)(lastBackwardsLineMatch,
searchSpecPtr, NULL, NULL,
lastBackwardsMatchOffset, matchLength);
lastBackwardsLineMatch = -1;
if (!searchSpecPtr->all) {
goto searchDone;
}
}
if (lineNum < 0) {
lineNum = searchSpecPtr->numLines-1;
}
if (!searchSpecPtr->exact) {
/*
* The 'exact' search loops above are designed to give us
* an accurate picture of the number of lines which we can
* skip here. For 'regexp' searches, on the other hand,
* which can match potentially variable lengths, we cannot
* skip multiple lines when searching backwards. Therefore
* we only allow one line to be skipped here.
*/
break;
}
} else {
lineNum++;
if (lineNum >= searchSpecPtr->numLines) {
lineNum = 0;
}
}
if (lineNum == searchSpecPtr->startLine && linesSearched > 0) {
/*
* We've just searched all the way round and have gone right
* through the start line without finding anything in the last
* attempt.
*/
break;
}
}
Tcl_SetObjLength(theLine, 0);
}
searchDone:
if (lastBackwardsLineMatch != -1) {
(*searchSpecPtr->foundMatchProc)(lastBackwardsLineMatch, searchSpecPtr,
NULL, NULL, lastBackwardsMatchOffset, matchLength);
}
/*
* Free up the cached line and pattern.
*/
Tcl_DecrRefCount(theLine);
Tcl_DecrRefCount(patObj);
/*
* Free up any extra space we allocated.
*/
if (storeMatch != smArray) {
ckfree((char *) storeMatch);
}
return code;
}
/*
*----------------------------------------------------------------------
*
* GetLineStartEnd -
*
* Converts an internal TkTextLine ptr into a Tcl string obj containing
* the line number. (Handler for the 'line' configuration option type.)
*
* Results:
* Tcl_Obj containing the string representation of the line value.
*
* Side effects:
* Creates a new Tcl_Obj.
*
*----------------------------------------------------------------------
*/
static Tcl_Obj *
GetLineStartEnd(
ClientData clientData,
Tk_Window tkwin,
char *recordPtr, /* Pointer to widget record. */
int internalOffset) /* Offset within *recordPtr containing the
* line value. */
{
TkTextLine *linePtr = *(TkTextLine **)(recordPtr + internalOffset);
if (linePtr == NULL) {
return Tcl_NewObj();
} else {
return Tcl_NewIntObj(1+TkBTreeLinesTo(NULL, linePtr));
}
}
/*
*----------------------------------------------------------------------
*
* SetLineStartEnd --
*
* Converts a Tcl_Obj representing a widget's (start or end) line into a
* TkTextLine* value. (Handler for the 'line' configuration option type.)
*
* Results:
* Standard Tcl result.
*
* Side effects:
* May store the TkTextLine* value into the internal representation
* pointer. May change the pointer to the Tcl_Obj to NULL to indicate
* that the specified string was empty and that is acceptable.
*
*----------------------------------------------------------------------
*/
static int
SetLineStartEnd(
ClientData clientData,
Tcl_Interp *interp, /* Current interp; may be used for errors. */
Tk_Window tkwin, /* Window for which option is being set. */
Tcl_Obj **value, /* Pointer to the pointer to the value object.
* We use a pointer to the pointer because we
* may need to return a value (NULL). */
char *recordPtr, /* Pointer to storage for the widget record. */
int internalOffset, /* Offset within *recordPtr at which the
* internal value is to be stored. */
char *oldInternalPtr, /* Pointer to storage for the old value. */
int flags) /* Flags for the option, set Tk_SetOptions. */
{
TkTextLine *linePtr = NULL;
char *internalPtr;
TkText *textPtr = (TkText *) recordPtr;
if (internalOffset >= 0) {
internalPtr = recordPtr + internalOffset;
} else {
internalPtr = NULL;
}
if (flags & TK_OPTION_NULL_OK && ObjectIsEmpty(*value)) {
*value = NULL;
} else {
int line;
if (Tcl_GetIntFromObj(interp, *value, &line) != TCL_OK) {
return TCL_ERROR;
}
linePtr = TkBTreeFindLine(textPtr->sharedTextPtr->tree, NULL, line-1);
}
if (internalPtr != NULL) {
*((TkTextLine **) oldInternalPtr) = *((TkTextLine **) internalPtr);
*((TkTextLine **) internalPtr) = linePtr;
}
return TCL_OK;
}
/*
*----------------------------------------------------------------------
*
* RestoreLineStartEnd --
*
* Restore a line option value from a saved value. (Handler for the
* 'line' configuration option type.)
*
* Results:
* None.
*
* Side effects:
* Restores the old value.
*
*----------------------------------------------------------------------
*/
static void
RestoreLineStartEnd(
ClientData clientData,
Tk_Window tkwin,
char *internalPtr, /* Pointer to storage for value. */
char *oldInternalPtr) /* Pointer to old value. */
{
*(TkTextLine **)internalPtr = *(TkTextLine **)oldInternalPtr;
}
/*
*----------------------------------------------------------------------
*
* ObjectIsEmpty --
*
* This function tests whether the string value of an object is empty.
*
* Results:
* The return value is 1 if the string value of objPtr has length zero,
* and 0 otherwise.
*
* Side effects:
* May cause object shimmering, since this function can force a
* conversion to a string object.
*
*----------------------------------------------------------------------
*/
static int
ObjectIsEmpty(
Tcl_Obj *objPtr) /* Object to test. May be NULL. */
{
int length;
if (objPtr == NULL) {
return 1;
}
if (objPtr->bytes != NULL) {
return (objPtr->length == 0);
}
Tcl_GetStringFromObj(objPtr, &length);
return (length == 0);
}
/*
*----------------------------------------------------------------------
*
* TkpTesttextCmd --
*
* This function implements the "testtext" command. It provides a set of
* functions for testing text widgets and the associated functions in
* tkText*.c.
*
* Results:
* A standard Tcl result.
*
* Side effects:
* Depends on option; see below.
*
*----------------------------------------------------------------------
*/
int
TkpTesttextCmd(
ClientData clientData, /* Main window for application. */
Tcl_Interp *interp, /* Current interpreter. */
int argc, /* Number of arguments. */
CONST char **argv) /* Argument strings. */
{
TkText *textPtr;
size_t len;
int lineIndex, byteIndex, byteOffset;
TkTextIndex index;
char buf[64];
Tcl_CmdInfo info;
if (argc < 3) {
return TCL_ERROR;
}
if (Tcl_GetCommandInfo(interp, argv[1], &info) == 0) {
return TCL_ERROR;
}
if (info.isNativeObjectProc) {
textPtr = (TkText *) info.objClientData;
} else {
textPtr = (TkText *) info.clientData;
}
len = strlen(argv[2]);
if (strncmp(argv[2], "byteindex", len) == 0) {
if (argc != 5) {
return TCL_ERROR;
}
lineIndex = atoi(argv[3]) - 1;
byteIndex = atoi(argv[4]);
TkTextMakeByteIndex(textPtr->sharedTextPtr->tree, textPtr, lineIndex,
byteIndex, &index);
} else if (strncmp(argv[2], "forwbytes", len) == 0) {
if (argc != 5) {
return TCL_ERROR;
}
if (TkTextGetIndex(interp, textPtr, argv[3], &index) != TCL_OK) {
return TCL_ERROR;
}
byteOffset = atoi(argv[4]);
TkTextIndexForwBytes(textPtr, &index, byteOffset, &index);
} else if (strncmp(argv[2], "backbytes", len) == 0) {
if (argc != 5) {
return TCL_ERROR;
}
if (TkTextGetIndex(interp, textPtr, argv[3], &index) != TCL_OK) {
return TCL_ERROR;
}
byteOffset = atoi(argv[4]);
TkTextIndexBackBytes(textPtr, &index, byteOffset, &index);
} else {
return TCL_ERROR;
}
TkTextSetMark(textPtr, "insert", &index);
TkTextPrintIndex(textPtr, &index, buf);
sprintf(buf + strlen(buf), " %d", index.byteIndex);
Tcl_AppendResult(interp, buf, NULL);
return TCL_OK;
}
/*
* Local Variables:
* mode: c
* c-basic-offset: 4
* fill-column: 78
* End:
*/
|