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
6578
6579
6580
6581
6582
6583
6584
6585
6586
6587
6588
6589
6590
6591
6592
6593
6594
6595
6596
6597
6598
6599
6600
6601
6602
6603
6604
6605
6606
6607
6608
6609
6610
6611
6612
6613
6614
6615
6616
6617
6618
6619
6620
6621
6622
6623
6624
6625
6626
6627
6628
6629
6630
6631
6632
6633
6634
6635
6636
6637
6638
6639
6640
6641
6642
6643
6644
6645
6646
6647
6648
6649
6650
6651
6652
6653
6654
6655
6656
6657
6658
6659
6660
6661
6662
6663
6664
6665
6666
6667
6668
6669
6670
6671
6672
6673
6674
6675
6676
6677
6678
6679
6680
6681
6682
6683
6684
6685
6686
6687
6688
6689
6690
6691
6692
6693
6694
6695
6696
6697
6698
6699
6700
6701
6702
6703
6704
6705
6706
6707
6708
6709
6710
6711
6712
6713
6714
6715
6716
6717
6718
6719
6720
6721
6722
6723
6724
6725
6726
6727
6728
6729
6730
6731
6732
6733
6734
6735
6736
6737
6738
6739
6740
6741
6742
6743
6744
6745
6746
6747
6748
6749
6750
6751
6752
6753
6754
6755
6756
6757
6758
6759
6760
6761
6762
6763
6764
6765
6766
6767
6768
6769
6770
6771
6772
6773
6774
6775
6776
6777
6778
6779
6780
6781
6782
6783
6784
6785
6786
6787
6788
6789
6790
6791
6792
6793
6794
6795
6796
6797
6798
6799
6800
6801
6802
6803
6804
6805
6806
6807
6808
6809
6810
6811
6812
6813
6814
6815
6816
6817
6818
6819
6820
6821
6822
6823
6824
6825
6826
6827
6828
6829
6830
6831
6832
6833
6834
6835
6836
6837
6838
6839
6840
6841
6842
6843
6844
6845
6846
6847
6848
6849
6850
6851
6852
6853
6854
6855
6856
6857
6858
6859
6860
6861
6862
6863
6864
6865
6866
6867
6868
6869
6870
6871
6872
6873
6874
6875
6876
6877
6878
6879
6880
6881
6882
6883
6884
6885
6886
6887
6888
6889
6890
6891
6892
6893
6894
6895
6896
6897
6898
6899
6900
6901
6902
6903
6904
6905
6906
6907
6908
6909
6910
6911
6912
6913
6914
6915
6916
6917
6918
6919
6920
6921
6922
6923
6924
6925
6926
6927
6928
6929
6930
6931
6932
6933
6934
6935
6936
6937
6938
6939
6940
6941
6942
6943
6944
6945
6946
6947
6948
6949
6950
6951
6952
6953
6954
6955
6956
6957
6958
6959
6960
6961
6962
6963
6964
6965
6966
6967
6968
6969
6970
6971
6972
6973
6974
6975
6976
6977
6978
6979
6980
6981
6982
6983
6984
6985
6986
6987
6988
6989
6990
6991
6992
6993
6994
6995
6996
6997
6998
6999
7000
7001
7002
7003
7004
7005
7006
7007
7008
7009
7010
7011
7012
7013
7014
7015
7016
7017
7018
7019
7020
7021
7022
7023
7024
7025
7026
7027
7028
7029
7030
7031
7032
7033
7034
7035
7036
7037
7038
7039
7040
7041
7042
7043
7044
7045
7046
7047
7048
7049
7050
7051
7052
7053
7054
7055
7056
7057
7058
7059
7060
7061
7062
7063
7064
7065
7066
7067
7068
7069
7070
7071
7072
7073
7074
7075
7076
7077
7078
7079
7080
7081
7082
7083
7084
7085
7086
7087
7088
7089
7090
7091
7092
7093
7094
7095
7096
7097
7098
7099
7100
7101
7102
7103
7104
7105
7106
7107
7108
7109
7110
7111
7112
7113
7114
7115
7116
7117
7118
7119
7120
7121
7122
7123
7124
7125
7126
7127
7128
7129
7130
7131
7132
7133
7134
7135
7136
7137
7138
7139
7140
7141
7142
7143
7144
7145
7146
7147
7148
7149
7150
7151
7152
7153
7154
7155
7156
7157
7158
7159
7160
7161
7162
7163
7164
7165
7166
7167
7168
7169
7170
7171
7172
7173
7174
7175
7176
7177
7178
7179
7180
7181
7182
7183
7184
7185
7186
7187
7188
7189
7190
7191
7192
7193
7194
7195
7196
7197
7198
7199
7200
7201
7202
7203
7204
7205
7206
7207
7208
7209
7210
7211
7212
7213
7214
7215
7216
7217
7218
7219
7220
7221
7222
7223
7224
7225
7226
7227
7228
7229
7230
7231
7232
7233
7234
7235
7236
7237
7238
7239
7240
7241
7242
7243
7244
7245
7246
7247
7248
7249
7250
7251
7252
7253
7254
7255
7256
7257
7258
7259
7260
7261
7262
7263
7264
7265
7266
7267
7268
7269
7270
7271
7272
7273
7274
7275
7276
7277
7278
7279
7280
7281
7282
7283
7284
7285
7286
7287
7288
7289
7290
7291
7292
7293
7294
7295
7296
7297
7298
7299
7300
7301
7302
7303
7304
7305
7306
7307
7308
7309
7310
7311
7312
7313
7314
7315
7316
7317
7318
7319
7320
7321
7322
7323
7324
7325
7326
7327
7328
7329
7330
7331
7332
7333
7334
7335
7336
7337
7338
7339
7340
7341
7342
7343
7344
7345
7346
7347
7348
7349
7350
7351
7352
7353
7354
7355
7356
7357
7358
7359
7360
7361
7362
7363
7364
7365
7366
7367
7368
7369
7370
7371
7372
7373
7374
7375
7376
7377
7378
7379
7380
7381
7382
7383
7384
7385
7386
7387
7388
7389
7390
7391
7392
7393
7394
7395
7396
7397
7398
7399
7400
7401
7402
7403
7404
7405
7406
7407
7408
7409
7410
7411
7412
7413
7414
7415
7416
7417
7418
7419
7420
7421
7422
7423
7424
7425
7426
7427
7428
7429
7430
7431
7432
7433
7434
7435
7436
7437
7438
7439
7440
7441
7442
7443
7444
7445
7446
7447
7448
7449
7450
7451
7452
7453
7454
7455
7456
7457
7458
7459
7460
7461
7462
7463
7464
7465
7466
7467
7468
7469
7470
7471
7472
7473
7474
7475
7476
7477
7478
7479
7480
7481
7482
7483
7484
7485
7486
7487
7488
7489
7490
7491
7492
7493
7494
7495
7496
7497
7498
7499
7500
7501
7502
7503
7504
7505
7506
7507
7508
7509
7510
7511
7512
7513
7514
7515
7516
7517
7518
7519
7520
7521
7522
7523
7524
7525
7526
7527
7528
7529
7530
7531
7532
7533
7534
7535
7536
7537
7538
7539
7540
7541
7542
7543
7544
7545
7546
7547
7548
7549
7550
7551
7552
7553
7554
7555
7556
7557
7558
7559
7560
7561
7562
7563
7564
7565
7566
7567
7568
7569
7570
7571
7572
7573
7574
7575
7576
7577
7578
7579
7580
7581
7582
7583
7584
7585
7586
7587
7588
7589
7590
7591
7592
7593
7594
7595
7596
7597
7598
7599
7600
7601
7602
7603
7604
7605
7606
7607
7608
7609
7610
7611
7612
7613
7614
7615
7616
7617
7618
7619
7620
7621
7622
7623
7624
7625
7626
7627
7628
7629
7630
7631
7632
7633
7634
7635
7636
7637
7638
7639
7640
7641
7642
7643
7644
7645
7646
7647
7648
7649
7650
7651
7652
7653
7654
7655
7656
7657
7658
7659
7660
7661
7662
7663
7664
7665
7666
7667
7668
7669
7670
7671
7672
7673
7674
7675
7676
7677
7678
7679
7680
7681
7682
7683
7684
7685
7686
7687
7688
7689
7690
7691
7692
7693
7694
7695
7696
7697
7698
7699
7700
7701
7702
7703
7704
7705
7706
7707
7708
7709
7710
7711
7712
7713
7714
7715
7716
7717
7718
7719
7720
7721
7722
7723
7724
7725
7726
7727
7728
7729
7730
7731
7732
7733
7734
7735
7736
7737
7738
7739
7740
7741
7742
7743
7744
7745
7746
7747
7748
7749
7750
7751
7752
7753
7754
7755
7756
7757
7758
7759
7760
7761
7762
7763
7764
7765
7766
7767
7768
7769
7770
7771
7772
7773
7774
7775
7776
7777
7778
7779
7780
7781
7782
7783
7784
7785
7786
7787
7788
7789
7790
7791
7792
7793
7794
7795
7796
7797
7798
7799
7800
7801
7802
7803
7804
7805
7806
7807
7808
7809
7810
7811
7812
7813
7814
7815
7816
7817
7818
7819
7820
7821
7822
7823
7824
7825
7826
7827
7828
7829
7830
7831
7832
7833
7834
7835
7836
7837
7838
7839
7840
7841
7842
7843
7844
7845
7846
7847
7848
7849
7850
7851
7852
7853
7854
7855
7856
7857
7858
7859
7860
7861
7862
7863
7864
7865
7866
7867
7868
7869
7870
7871
7872
7873
7874
7875
7876
7877
7878
7879
7880
7881
7882
7883
7884
7885
7886
7887
7888
7889
7890
7891
7892
7893
7894
7895
7896
7897
7898
7899
7900
7901
7902
7903
7904
7905
7906
7907
7908
7909
7910
7911
7912
7913
7914
7915
7916
7917
7918
7919
7920
7921
7922
7923
7924
7925
7926
7927
7928
7929
7930
7931
7932
7933
7934
7935
7936
7937
7938
7939
7940
7941
7942
7943
7944
7945
7946
7947
7948
7949
7950
7951
7952
7953
7954
7955
7956
7957
7958
7959
7960
7961
7962
7963
7964
7965
7966
7967
7968
7969
7970
7971
7972
7973
7974
7975
7976
7977
7978
7979
7980
7981
7982
7983
7984
7985
7986
7987
7988
7989
7990
7991
7992
7993
7994
7995
7996
7997
7998
7999
8000
8001
8002
8003
8004
8005
8006
8007
8008
8009
8010
8011
8012
8013
8014
8015
8016
8017
8018
8019
8020
8021
8022
8023
8024
8025
8026
8027
8028
8029
8030
8031
8032
8033
8034
8035
8036
8037
8038
8039
8040
8041
8042
8043
8044
8045
8046
8047
8048
8049
8050
8051
8052
8053
8054
8055
8056
8057
8058
8059
8060
8061
8062
8063
8064
8065
8066
8067
8068
8069
8070
8071
8072
8073
8074
8075
8076
8077
8078
8079
8080
8081
8082
8083
8084
8085
8086
8087
8088
8089
8090
8091
8092
8093
8094
8095
8096
8097
8098
8099
8100
8101
8102
8103
8104
8105
8106
8107
8108
8109
8110
8111
8112
8113
8114
8115
8116
8117
8118
8119
8120
8121
8122
8123
8124
8125
8126
8127
8128
8129
8130
8131
8132
8133
8134
8135
8136
8137
8138
8139
8140
8141
8142
8143
8144
8145
8146
8147
8148
8149
8150
8151
8152
8153
8154
8155
8156
8157
8158
8159
8160
8161
8162
8163
8164
8165
8166
8167
8168
8169
8170
8171
8172
8173
8174
8175
8176
8177
8178
8179
8180
8181
8182
8183
8184
8185
8186
8187
8188
8189
8190
8191
8192
8193
8194
8195
8196
8197
8198
8199
8200
8201
8202
8203
8204
8205
8206
8207
8208
8209
8210
8211
8212
8213
8214
8215
8216
8217
8218
8219
8220
8221
8222
8223
8224
8225
8226
8227
8228
8229
8230
8231
8232
8233
8234
8235
8236
8237
8238
8239
8240
8241
8242
8243
8244
8245
8246
8247
8248
8249
8250
8251
8252
8253
8254
8255
8256
8257
8258
8259
8260
8261
8262
8263
8264
8265
8266
8267
8268
8269
8270
8271
8272
8273
8274
8275
8276
8277
8278
8279
8280
8281
8282
8283
8284
8285
8286
8287
8288
8289
8290
8291
8292
8293
8294
8295
8296
8297
8298
8299
8300
8301
8302
8303
8304
8305
8306
8307
8308
8309
8310
8311
8312
8313
8314
8315
8316
8317
8318
8319
8320
8321
8322
8323
8324
8325
8326
8327
8328
8329
8330
8331
8332
8333
8334
8335
8336
8337
8338
8339
8340
8341
8342
8343
8344
8345
8346
8347
8348
8349
8350
8351
8352
8353
8354
8355
8356
8357
8358
8359
8360
8361
8362
8363
8364
8365
8366
8367
8368
8369
8370
8371
8372
8373
8374
8375
8376
8377
8378
8379
8380
8381
8382
8383
8384
8385
8386
8387
8388
8389
8390
8391
8392
8393
8394
8395
8396
8397
8398
8399
8400
8401
8402
8403
8404
8405
8406
8407
8408
8409
8410
8411
8412
8413
8414
8415
8416
8417
8418
8419
8420
8421
8422
8423
8424
8425
8426
8427
8428
8429
8430
8431
8432
8433
8434
8435
8436
8437
8438
8439
8440
8441
8442
8443
8444
8445
8446
8447
8448
8449
8450
8451
8452
8453
8454
8455
8456
8457
8458
8459
8460
8461
8462
8463
8464
8465
8466
8467
8468
8469
8470
8471
8472
8473
8474
8475
8476
8477
8478
8479
8480
8481
8482
8483
8484
8485
8486
8487
8488
8489
8490
8491
8492
8493
8494
8495
8496
8497
8498
8499
8500
8501
8502
8503
8504
8505
8506
8507
8508
8509
8510
8511
8512
8513
8514
8515
8516
8517
8518
8519
8520
8521
8522
8523
8524
8525
8526
8527
8528
8529
8530
8531
8532
8533
8534
8535
8536
8537
8538
8539
8540
8541
8542
8543
8544
8545
8546
8547
8548
8549
8550
8551
8552
8553
8554
8555
8556
8557
8558
8559
8560
8561
8562
8563
8564
8565
8566
8567
8568
8569
8570
8571
8572
8573
8574
8575
8576
8577
8578
8579
8580
8581
8582
8583
8584
8585
8586
8587
8588
8589
8590
8591
8592
8593
8594
8595
8596
8597
8598
8599
8600
8601
8602
8603
8604
8605
8606
8607
8608
8609
8610
8611
8612
8613
8614
8615
8616
8617
8618
8619
8620
8621
8622
8623
8624
8625
8626
8627
8628
8629
8630
8631
8632
8633
8634
8635
8636
8637
8638
8639
8640
8641
8642
8643
8644
8645
8646
8647
8648
8649
8650
8651
8652
8653
8654
8655
8656
8657
8658
8659
8660
8661
8662
8663
8664
8665
8666
8667
8668
8669
8670
8671
8672
8673
8674
8675
8676
8677
8678
8679
8680
8681
8682
8683
8684
8685
8686
8687
8688
8689
8690
8691
8692
8693
8694
8695
8696
8697
8698
8699
8700
8701
8702
8703
8704
|
/*
* Copyright (c) 1992, Brian Berliner and Jeff Polk
*
* You may distribute under the terms of the GNU General Public License as
* specified in the README file that comes with the CVS source distribution.
*
* The routines contained in this file do all the rcs file parsing and
* manipulation
*
* $FreeBSD$
*/
#include <assert.h>
#include "cvs.h"
#include "edit.h"
#include "hardlink.h"
/* These need to be source after cvs.h or HAVE_MMAP won't be set... */
#ifdef HAVE_MMAP
# include <sys/mman.h>
# ifndef HAVE_GETPAGESIZE
# include "getpagesize.h"
# endif
# ifndef MAP_FAILED
# define MAP_FAILED NULL
# endif
#endif
int preserve_perms = 0;
/* The RCS -k options, and a set of enums that must match the array.
These come first so that we can use enum kflag in function
prototypes. */
static const char *const kflags[] =
{"kv", "kvl", "k", "v", "o", "b", (char *) NULL};
enum kflag { KFLAG_KV = 0, KFLAG_KVL, KFLAG_K, KFLAG_V, KFLAG_O, KFLAG_B };
/* A structure we use to buffer the contents of an RCS file. The
various fields are only referenced directly by the rcsbuf_*
functions. We declare the struct here so that we can allocate it
on the stack, rather than in memory. */
struct rcsbuffer
{
/* Points to the current position in the buffer. */
char *ptr;
/* Points just after the last valid character in the buffer. */
char *ptrend;
/* The file. */
FILE *fp;
/* The name of the file, used for error messages. */
const char *filename;
/* The starting file position of the data in the buffer. */
unsigned long pos;
/* The length of the value. */
size_t vlen;
/* Whether the value contains an '@' string. If so, we can not
compress whitespace characters. */
int at_string;
/* The number of embedded '@' characters in an '@' string. If
this is non-zero, we must search the string for pairs of '@'
and convert them to a single '@'. */
int embedded_at;
};
static RCSNode *RCS_parsercsfile_i PROTO((FILE * fp, const char *rcsfile));
static char *RCS_getdatebranch PROTO((RCSNode * rcs, char *date, char *branch));
static void rcsbuf_open PROTO ((struct rcsbuffer *, FILE *fp,
const char *filename, unsigned long pos));
static void rcsbuf_close PROTO ((struct rcsbuffer *));
static int rcsbuf_getkey PROTO ((struct rcsbuffer *, char **keyp,
char **valp));
static int rcsbuf_getrevnum PROTO ((struct rcsbuffer *, char **revp));
#ifndef HAVE_MMAP
static char *rcsbuf_fill PROTO ((struct rcsbuffer *, char *ptr, char **keyp,
char **valp));
#endif
static int rcsbuf_valcmp PROTO ((struct rcsbuffer *));
static char *rcsbuf_valcopy PROTO ((struct rcsbuffer *, char *val, int polish,
size_t *lenp));
static void rcsbuf_valpolish PROTO ((struct rcsbuffer *, char *val, int polish,
size_t *lenp));
static void rcsbuf_valpolish_internal PROTO ((struct rcsbuffer *, char *to,
const char *from, size_t *lenp));
static unsigned long rcsbuf_ftell PROTO ((struct rcsbuffer *));
static void rcsbuf_get_buffered PROTO ((struct rcsbuffer *, char **datap,
size_t *lenp));
static void rcsbuf_cache PROTO ((RCSNode *, struct rcsbuffer *));
static void rcsbuf_cache_close PROTO ((void));
static void rcsbuf_cache_open PROTO ((RCSNode *, long, FILE **,
struct rcsbuffer *));
static int checkmagic_proc PROTO((Node *p, void *closure));
static void do_branches PROTO((List * list, char *val));
static void do_symbols PROTO((List * list, char *val));
static void do_locks PROTO((List * list, char *val));
static void free_rcsnode_contents PROTO((RCSNode *));
static void free_rcsvers_contents PROTO((RCSVers *));
static void rcsvers_delproc PROTO((Node * p));
static char *translate_symtag PROTO((RCSNode *, const char *));
static char *RCS_addbranch PROTO ((RCSNode *, const char *));
static char *truncate_revnum_in_place PROTO ((char *));
static char *truncate_revnum PROTO ((const char *));
static char *printable_date PROTO((const char *));
static char *escape_keyword_value PROTO ((const char *, int *));
static void expand_keywords PROTO((RCSNode *, RCSVers *, const char *,
const char *, size_t, enum kflag, char *,
size_t, char **, size_t *));
static void cmp_file_buffer PROTO((void *, const char *, size_t));
/* Routines for reading, parsing and writing RCS files. */
static RCSVers *getdelta PROTO ((struct rcsbuffer *, char *, char **,
char **));
static Deltatext *RCS_getdeltatext PROTO ((RCSNode *, FILE *,
struct rcsbuffer *));
static void freedeltatext PROTO ((Deltatext *));
static void RCS_putadmin PROTO ((RCSNode *, FILE *));
static void RCS_putdtree PROTO ((RCSNode *, char *, FILE *));
static void RCS_putdesc PROTO ((RCSNode *, FILE *));
static void putdelta PROTO ((RCSVers *, FILE *));
static int putrcsfield_proc PROTO ((Node *, void *));
static int putsymbol_proc PROTO ((Node *, void *));
static void RCS_copydeltas PROTO ((RCSNode *, FILE *, struct rcsbuffer *,
FILE *, Deltatext *, char *));
static int count_delta_actions PROTO ((Node *, void *));
static void putdeltatext PROTO ((FILE *, Deltatext *));
static FILE *rcs_internal_lockfile PROTO ((char *));
static void rcs_internal_unlockfile PROTO ((FILE *, char *));
static char *rcs_lockfilename PROTO ((char *));
/* The RCS file reading functions are called a lot, and they do some
string comparisons. This macro speeds things up a bit by skipping
the function call when the first characters are different. It
evaluates its arguments multiple times. */
#define STREQ(a, b) ((a)[0] == (b)[0] && strcmp ((a), (b)) == 0)
static char * getfullCVSname PROTO ((char *, char **));
/*
* We don't want to use isspace() from the C library because:
*
* 1. The definition of "whitespace" in RCS files includes ASCII
* backspace, but the C locale doesn't.
* 2. isspace is an very expensive function call in some implementations
* due to the addition of wide character support.
*/
static const char spacetab[] = {
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, /* 0x00 - 0x0f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x10 - 0x1f */
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x20 - 0x2f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x30 - 0x3f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x40 - 0x4f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x50 - 0x5f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x60 - 0x8f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x70 - 0x7f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x80 - 0x8f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x90 - 0x9f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xa0 - 0xaf */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xb0 - 0xbf */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xc0 - 0xcf */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xd0 - 0xdf */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xe0 - 0xef */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 /* 0xf0 - 0xff */
};
#define whitespace(c) (spacetab[(unsigned char)c] != 0)
static char *rcs_lockfile;
static int rcs_lockfd = -1;
/* A few generic thoughts on error handling, in particular the
printing of unexpected characters that we find in the RCS file
(that is, why we use '\x%x' rather than %c or some such).
* Avoiding %c means we don't have to worry about what is printable
and other such stuff. In error handling, often better to keep it
simple.
* Hex rather than decimal or octal because character set standards
tend to use hex.
* Saying "character 0x%x" might make it sound like we are printing
a file offset. So we use '\x%x'.
* Would be nice to print the offset within the file, but I can
imagine various portability hassles (in particular, whether
unsigned long is always big enough to hold file offsets). */
/* Parse an rcsfile given a user file name and a repository. If there is
an error, we print an error message and return NULL. If the file
does not exist, we return NULL without printing anything (I'm not
sure this allows the caller to do anything reasonable, but it is
the current behavior). */
RCSNode *
RCS_parse (file, repos)
const char *file;
const char *repos;
{
RCSNode *rcs;
FILE *fp;
RCSNode *retval;
char *rcsfile;
/* We're creating a new RCSNode, so there is no hope of finding it
in the cache. */
rcsbuf_cache_close ();
rcsfile = xmalloc (strlen (repos) + strlen (file)
+ sizeof (RCSEXT) + sizeof (CVSATTIC) + 10);
(void) sprintf (rcsfile, "%s/%s%s", repos, file, RCSEXT);
if ((fp = CVS_FOPEN (rcsfile, FOPEN_BINARY_READ)) != NULL)
{
rcs = RCS_parsercsfile_i(fp, rcsfile);
if (rcs != NULL)
rcs->flags |= VALID;
retval = rcs;
goto out;
}
else if (! existence_error (errno))
{
error (0, errno, "cannot open %s", rcsfile);
retval = NULL;
goto out;
}
(void) sprintf (rcsfile, "%s/%s/%s%s", repos, CVSATTIC, file, RCSEXT);
if ((fp = CVS_FOPEN (rcsfile, FOPEN_BINARY_READ)) != NULL)
{
rcs = RCS_parsercsfile_i(fp, rcsfile);
if (rcs != NULL)
{
rcs->flags |= INATTIC;
rcs->flags |= VALID;
}
retval = rcs;
goto out;
}
else if (! existence_error (errno))
{
error (0, errno, "cannot open %s", rcsfile);
retval = NULL;
goto out;
}
#if defined (SERVER_SUPPORT) && !defined (FILENAMES_CASE_INSENSITIVE)
else if (ign_case)
{
int status;
char *found_path;
/* The client might be asking for a file which we do have
(which the client doesn't know about), but for which the
filename case differs. We only consider this case if the
regular CVS_FOPENs fail, because fopen_case is such an
expensive call. */
(void) sprintf (rcsfile, "%s/%s%s", repos, file, RCSEXT);
status = fopen_case (rcsfile, "rb", &fp, &found_path);
if (status == 0)
{
rcs = RCS_parsercsfile_i (fp, rcsfile);
if (rcs != NULL)
rcs->flags |= VALID;
free (rcs->path);
rcs->path = found_path;
retval = rcs;
goto out;
}
else if (! existence_error (status))
{
error (0, status, "cannot open %s", rcsfile);
retval = NULL;
goto out;
}
(void) sprintf (rcsfile, "%s/%s/%s%s", repos, CVSATTIC, file, RCSEXT);
status = fopen_case (rcsfile, "rb", &fp, &found_path);
if (status == 0)
{
rcs = RCS_parsercsfile_i (fp, rcsfile);
if (rcs != NULL)
{
rcs->flags |= INATTIC;
rcs->flags |= VALID;
}
free (rcs->path);
rcs->path = found_path;
retval = rcs;
goto out;
}
else if (! existence_error (status))
{
error (0, status, "cannot open %s", rcsfile);
retval = NULL;
goto out;
}
}
#endif
retval = NULL;
out:
free (rcsfile);
return retval;
}
/*
* Parse a specific rcsfile.
*/
RCSNode *
RCS_parsercsfile (rcsfile)
char *rcsfile;
{
FILE *fp;
RCSNode *rcs;
/* We're creating a new RCSNode, so there is no hope of finding it
in the cache. */
rcsbuf_cache_close ();
/* open the rcsfile */
if ((fp = CVS_FOPEN (rcsfile, FOPEN_BINARY_READ)) == NULL)
{
error (0, errno, "Couldn't open rcs file `%s'", rcsfile);
return (NULL);
}
rcs = RCS_parsercsfile_i (fp, rcsfile);
return (rcs);
}
/*
*/
static RCSNode *
RCS_parsercsfile_i (fp, rcsfile)
FILE *fp;
const char *rcsfile;
{
RCSNode *rdata;
struct rcsbuffer rcsbuf;
char *key, *value;
/* make a node */
rdata = (RCSNode *) xmalloc (sizeof (RCSNode));
memset ((char *) rdata, 0, sizeof (RCSNode));
rdata->refcount = 1;
rdata->path = xstrdup (rcsfile);
/* Process HEAD, BRANCH, and EXPAND keywords from the RCS header.
Most cvs operations on the main branch don't need any more
information. Those that do call RCS_reparsercsfile to parse
the rest of the header and the deltas. */
rcsbuf_open (&rcsbuf, fp, rcsfile, 0);
if (! rcsbuf_getkey (&rcsbuf, &key, &value))
goto l_error;
if (STREQ (key, RCSDESC))
goto l_error;
if (STREQ (RCSHEAD, key) && value != NULL)
rdata->head = rcsbuf_valcopy (&rcsbuf, value, 0, (size_t *) NULL);
if (! rcsbuf_getkey (&rcsbuf, &key, &value))
goto l_error;
if (STREQ (key, RCSDESC))
goto l_error;
if (STREQ (RCSBRANCH, key) && value != NULL)
{
char *cp;
rdata->branch = rcsbuf_valcopy (&rcsbuf, value, 0, (size_t *) NULL);
if ((numdots (rdata->branch) & 1) != 0)
{
/* turn it into a branch if it's a revision */
cp = strrchr (rdata->branch, '.');
*cp = '\0';
}
}
/* Look ahead for expand, stopping when we see desc or a revision
number. */
while (1)
{
char *cp;
if (STREQ (RCSEXPAND, key))
{
rdata->expand = rcsbuf_valcopy (&rcsbuf, value, 0,
(size_t *) NULL);
break;
}
for (cp = key;
(isdigit ((unsigned char) *cp) || *cp == '.') && *cp != '\0';
cp++)
/* do nothing */ ;
if (*cp == '\0')
break;
if (STREQ (RCSDESC, key))
break;
if (! rcsbuf_getkey (&rcsbuf, &key, &value))
break;
}
rdata->flags |= PARTIAL;
rcsbuf_cache (rdata, &rcsbuf);
return rdata;
l_error:
error (0, 0, "`%s' does not appear to be a valid rcs file",
rcsfile);
rcsbuf_close (&rcsbuf);
freercsnode (&rdata);
fclose (fp);
return (NULL);
}
/* Do the real work of parsing an RCS file.
On error, die with a fatal error; if it returns at all it was successful.
If PFP is NULL, close the file when done. Otherwise, leave it open
and store the FILE * in *PFP. */
void
RCS_reparsercsfile (rdata, pfp, rcsbufp)
RCSNode *rdata;
FILE **pfp;
struct rcsbuffer *rcsbufp;
{
FILE *fp;
char *rcsfile;
struct rcsbuffer rcsbuf;
Node *q, *kv;
RCSVers *vnode;
int gotkey;
char *cp;
char *key, *value;
assert (rdata != NULL);
rcsfile = rdata->path;
rcsbuf_cache_open (rdata, 0, &fp, &rcsbuf);
/* make a node */
/* This probably shouldn't be done until later: if a file has an
empty revision tree (which is permissible), rdata->versions
should be NULL. -twp */
rdata->versions = getlist ();
/*
* process all the special header information, break out when we get to
* the first revision delta
*/
gotkey = 0;
for (;;)
{
/* get the next key/value pair */
if (!gotkey)
{
if (! rcsbuf_getkey (&rcsbuf, &key, &value))
{
error (1, 0, "`%s' does not appear to be a valid rcs file",
rcsfile);
}
}
gotkey = 0;
/* Skip head, branch and expand tags; we already have them. */
if (STREQ (key, RCSHEAD)
|| STREQ (key, RCSBRANCH)
|| STREQ (key, RCSEXPAND))
{
continue;
}
if (STREQ (key, "access"))
{
if (value != NULL)
{
/* We pass the POLISH parameter as 1 because
RCS_addaccess expects nothing but spaces. FIXME:
It would be easy and more efficient to change
RCS_addaccess. */
rdata->access = rcsbuf_valcopy (&rcsbuf, value, 1,
(size_t *) NULL);
}
continue;
}
/* We always save lock information, so that we can handle
-kkvl correctly when checking out a file. */
if (STREQ (key, "locks"))
{
if (value != NULL)
rdata->locks_data = rcsbuf_valcopy (&rcsbuf, value, 0,
(size_t *) NULL);
if (! rcsbuf_getkey (&rcsbuf, &key, &value))
{
error (1, 0, "premature end of file reading %s", rcsfile);
}
if (STREQ (key, "strict") && value == NULL)
{
rdata->strict_locks = 1;
}
else
gotkey = 1;
continue;
}
if (STREQ (RCSSYMBOLS, key))
{
if (value != NULL)
rdata->symbols_data = rcsbuf_valcopy (&rcsbuf, value, 0,
(size_t *) NULL);
continue;
}
/*
* check key for '.''s and digits (probably a rev) if it is a
* revision or `desc', we are done with the headers and are down to the
* revision deltas, so we break out of the loop
*/
for (cp = key;
(isdigit ((unsigned char) *cp) || *cp == '.') && *cp != '\0';
cp++)
/* do nothing */ ;
/* Note that when comparing with RCSDATE, we are not massaging
VALUE from the string found in the RCS file. This is OK
since we know exactly what to expect. */
if (*cp == '\0' && strncmp (RCSDATE, value, (sizeof RCSDATE) - 1) == 0)
break;
if (STREQ (key, RCSDESC))
break;
if (STREQ (key, "comment"))
{
rdata->comment = rcsbuf_valcopy (&rcsbuf, value, 0,
(size_t *) NULL);
continue;
}
if (rdata->other == NULL)
rdata->other = getlist ();
kv = getnode ();
kv->type = rcsbuf_valcmp (&rcsbuf) ? RCSCMPFLD : RCSFIELD;
kv->key = xstrdup (key);
kv->data = rcsbuf_valcopy (&rcsbuf, value, kv->type == RCSFIELD,
(size_t *) NULL);
if (addnode (rdata->other, kv) != 0)
{
error (0, 0, "warning: duplicate key `%s' in RCS file `%s'",
key, rcsfile);
freenode (kv);
}
/* if we haven't grabbed it yet, we didn't want it */
}
/* We got out of the loop, so we have the first part of the first
revision delta in KEY (the revision) and VALUE (the date key
and its value). This is what getdelta expects to receive. */
while ((vnode = getdelta (&rcsbuf, rcsfile, &key, &value)) != NULL)
{
/* get the node */
q = getnode ();
q->type = RCSVERS;
q->delproc = rcsvers_delproc;
q->data = (char *) vnode;
q->key = vnode->version;
/* add the nodes to the list */
if (addnode (rdata->versions, q) != 0)
{
#if 0
purify_printf("WARNING: Adding duplicate version: %s (%s)\n",
q->key, rcsfile);
freenode (q);
#endif
}
}
/* Here KEY and VALUE are whatever caused getdelta to return NULL. */
if (STREQ (key, RCSDESC))
{
if (rdata->desc != NULL)
{
error (0, 0,
"warning: duplicate key `%s' in RCS file `%s'",
key, rcsfile);
free (rdata->desc);
}
rdata->desc = rcsbuf_valcopy (&rcsbuf, value, 1, (size_t *) NULL);
}
rdata->delta_pos = rcsbuf_ftell (&rcsbuf);
if (pfp == NULL)
rcsbuf_cache (rdata, &rcsbuf);
else
{
*pfp = fp;
*rcsbufp = rcsbuf;
}
rdata->flags &= ~PARTIAL;
}
/* Move RCS into or out of the Attic, depending on TOATTIC. If the
file is already in the desired place, return without doing
anything. At some point may want to think about how this relates
to RCS_rewrite but that is a bit hairy (if one wants renames to be
atomic, or that kind of thing). If there is an error, print a message
and return 1. On success, return 0. */
int
RCS_setattic (rcs, toattic)
RCSNode *rcs;
int toattic;
{
char *newpath;
char *p;
char *q;
/* Some systems aren't going to let us rename an open file. */
rcsbuf_cache_close ();
/* Could make the pathname computations in this file, and probably
in other parts of rcs.c too, easier if the REPOS and FILE
arguments to RCS_parse got stashed in the RCSNode. */
if (toattic)
{
mode_t omask;
if (rcs->flags & INATTIC)
return 0;
/* Example: rcs->path is "/foo/bar/baz,v". */
newpath = xmalloc (strlen (rcs->path) + sizeof CVSATTIC + 5);
p = last_component (rcs->path);
strncpy (newpath, rcs->path, p - rcs->path);
strcpy (newpath + (p - rcs->path), CVSATTIC);
/* Create the Attic directory if it doesn't exist. */
omask = umask (cvsumask);
if (CVS_MKDIR (newpath, 0777) < 0 && errno != EEXIST)
error (0, errno, "cannot make directory %s", newpath);
(void) umask (omask);
strcat (newpath, "/");
strcat (newpath, p);
if (CVS_RENAME (rcs->path, newpath) < 0)
{
int save_errno = errno;
/* The checks for isreadable look awfully fishy, but
I'm going to leave them here for now until I
can think harder about whether they take care of
some cases which should be handled somehow. */
if (isreadable (rcs->path) || !isreadable (newpath))
{
error (0, save_errno, "cannot rename %s to %s",
rcs->path, newpath);
free (newpath);
return 1;
}
}
}
else
{
if (!(rcs->flags & INATTIC))
return 0;
newpath = xmalloc (strlen (rcs->path));
/* Example: rcs->path is "/foo/bar/Attic/baz,v". */
p = last_component (rcs->path);
strncpy (newpath, rcs->path, p - rcs->path - 1);
newpath[p - rcs->path - 1] = '\0';
q = newpath + (p - rcs->path - 1) - (sizeof CVSATTIC - 1);
assert (strncmp (q, CVSATTIC, sizeof CVSATTIC - 1) == 0);
strcpy (q, p);
if (CVS_RENAME (rcs->path, newpath) < 0)
{
error (0, errno, "failed to move `%s' out of the attic",
rcs->path);
free (newpath);
return 1;
}
}
free (rcs->path);
rcs->path = newpath;
return 0;
}
/*
* Fully parse the RCS file. Store all keyword/value pairs, fetch the
* log messages for each revision, and fetch add and delete counts for
* each revision (we could fetch the entire text for each revision,
* but the only caller, log_fileproc, doesn't need that information,
* so we don't waste the memory required to store it). The add and
* delete counts are stored on the OTHER field of the RCSVERSNODE
* structure, under the names ";add" and ";delete", so that we don't
* waste the memory space of extra fields in RCSVERSNODE for code
* which doesn't need this information.
*/
void
RCS_fully_parse (rcs)
RCSNode *rcs;
{
FILE *fp;
struct rcsbuffer rcsbuf;
RCS_reparsercsfile (rcs, &fp, &rcsbuf);
while (1)
{
char *key, *value;
Node *vers;
RCSVers *vnode;
/* Rather than try to keep track of how much information we
have read, just read to the end of the file. */
if (! rcsbuf_getrevnum (&rcsbuf, &key))
break;
vers = findnode (rcs->versions, key);
if (vers == NULL)
error (1, 0,
"mismatch in rcs file %s between deltas and deltatexts (%s)",
rcs->path, key);
vnode = (RCSVers *) vers->data;
while (rcsbuf_getkey (&rcsbuf, &key, &value))
{
if (! STREQ (key, "text"))
{
Node *kv;
if (vnode->other == NULL)
vnode->other = getlist ();
kv = getnode ();
kv->type = rcsbuf_valcmp (&rcsbuf) ? RCSCMPFLD : RCSFIELD;
kv->key = xstrdup (key);
kv->data = rcsbuf_valcopy (&rcsbuf, value, kv->type == RCSFIELD,
(size_t *) NULL);
if (addnode (vnode->other, kv) != 0)
{
error (0, 0,
"\
warning: duplicate key `%s' in version `%s' of RCS file `%s'",
key, vnode->version, rcs->path);
freenode (kv);
}
continue;
}
if (! STREQ (vnode->version, rcs->head))
{
unsigned long add, del;
char buf[50];
Node *kv;
/* This is a change text. Store the add and delete
counts. */
add = 0;
del = 0;
if (value != NULL)
{
size_t vallen;
const char *cp;
rcsbuf_valpolish (&rcsbuf, value, 0, &vallen);
cp = value;
while (cp < value + vallen)
{
char op;
unsigned long count;
op = *cp++;
if (op != 'a' && op != 'd')
error (1, 0, "\
unrecognized operation '\\x%x' in %s",
op, rcs->path);
(void) strtoul (cp, (char **) &cp, 10);
if (*cp++ != ' ')
error (1, 0, "space expected in %s revision %s",
rcs->path, vnode->version);
count = strtoul (cp, (char **) &cp, 10);
if (*cp++ != '\012')
error (1, 0, "linefeed expected in %s revision %s",
rcs->path, vnode->version);
if (op == 'd')
del += count;
else
{
add += count;
while (count != 0)
{
if (*cp == '\012')
--count;
else if (cp == value + vallen)
{
if (count != 1)
error (1, 0, "\
premature end of value in %s revision %s",
rcs->path, vnode->version);
else
break;
}
++cp;
}
}
}
}
sprintf (buf, "%lu", add);
kv = getnode ();
kv->type = RCSFIELD;
kv->key = xstrdup (";add");
kv->data = xstrdup (buf);
if (addnode (vnode->other, kv) != 0)
{
error (0, 0,
"\
warning: duplicate key `%s' in version `%s' of RCS file `%s'",
key, vnode->version, rcs->path);
freenode (kv);
}
sprintf (buf, "%lu", del);
kv = getnode ();
kv->type = RCSFIELD;
kv->key = xstrdup (";delete");
kv->data = xstrdup (buf);
if (addnode (vnode->other, kv) != 0)
{
error (0, 0,
"\
warning: duplicate key `%s' in version `%s' of RCS file `%s'",
key, vnode->version, rcs->path);
freenode (kv);
}
}
/* We have found the "text" key which ends the data for
this revision. Break out of the loop and go on to the
next revision. */
break;
}
}
rcsbuf_cache (rcs, &rcsbuf);
}
/*
* freercsnode - free up the info for an RCSNode
*/
void
freercsnode (rnodep)
RCSNode **rnodep;
{
if (rnodep == NULL || *rnodep == NULL)
return;
((*rnodep)->refcount)--;
if ((*rnodep)->refcount != 0)
{
*rnodep = (RCSNode *) NULL;
return;
}
free ((*rnodep)->path);
if ((*rnodep)->head != (char *) NULL)
free ((*rnodep)->head);
if ((*rnodep)->branch != (char *) NULL)
free ((*rnodep)->branch);
free_rcsnode_contents (*rnodep);
free ((char *) *rnodep);
*rnodep = (RCSNode *) NULL;
}
/*
* free_rcsnode_contents - free up the contents of an RCSNode without
* freeing the node itself, or the file name, or the head, or the
* path. This returns the RCSNode to the state it is in immediately
* after a call to RCS_parse.
*/
static void
free_rcsnode_contents (rnode)
RCSNode *rnode;
{
dellist (&rnode->versions);
if (rnode->symbols != (List *) NULL)
dellist (&rnode->symbols);
if (rnode->symbols_data != (char *) NULL)
free (rnode->symbols_data);
if (rnode->expand != NULL)
free (rnode->expand);
if (rnode->other != (List *) NULL)
dellist (&rnode->other);
if (rnode->access != NULL)
free (rnode->access);
if (rnode->locks_data != NULL)
free (rnode->locks_data);
if (rnode->locks != (List *) NULL)
dellist (&rnode->locks);
if (rnode->comment != NULL)
free (rnode->comment);
if (rnode->desc != NULL)
free (rnode->desc);
}
/* free_rcsvers_contents -- free up the contents of an RCSVers node,
but also free the pointer to the node itself. */
/* Note: The `hardlinks' list is *not* freed, since it is merely a
pointer into the `hardlist' structure (defined in hardlink.c), and
that structure is freed elsewhere in the program. */
static void
free_rcsvers_contents (rnode)
RCSVers *rnode;
{
if (rnode->branches != (List *) NULL)
dellist (&rnode->branches);
if (rnode->date != (char *) NULL)
free (rnode->date);
if (rnode->next != (char *) NULL)
free (rnode->next);
if (rnode->author != (char *) NULL)
free (rnode->author);
if (rnode->state != (char *) NULL)
free (rnode->state);
if (rnode->other != (List *) NULL)
dellist (&rnode->other);
if (rnode->other_delta != NULL)
dellist (&rnode->other_delta);
if (rnode->text != NULL)
freedeltatext (rnode->text);
free ((char *) rnode);
}
/*
* rcsvers_delproc - free up an RCSVers type node
*/
static void
rcsvers_delproc (p)
Node *p;
{
free_rcsvers_contents ((RCSVers *) p->data);
}
/* These functions retrieve keys and values from an RCS file using a
buffer. We use this somewhat complex approach because it turns out
that for many common operations, CVS spends most of its time
reading keys, so it's worth doing some fairly hairy optimization. */
/* The number of bytes we try to read each time we need more data. */
#define RCSBUF_BUFSIZE (8192)
/* The buffer we use to store data. This grows as needed. */
static char *rcsbuf_buffer = NULL;
static size_t rcsbuf_buffer_size = 0;
/* Whether rcsbuf_buffer is in use. This is used as a sanity check. */
static int rcsbuf_inuse;
/* Set up to start gathering keys and values from an RCS file. This
initializes RCSBUF. */
static void
rcsbuf_open (rcsbuf, fp, filename, pos)
struct rcsbuffer *rcsbuf;
FILE *fp;
const char *filename;
unsigned long pos;
{
if (rcsbuf_inuse)
error (1, 0, "rcsbuf_open: internal error");
rcsbuf_inuse = 1;
#ifdef HAVE_MMAP
{
/* When we have mmap, it is much more efficient to let the system do the
* buffering and caching for us
*/
struct stat fs;
size_t mmap_off = 0;
if ( fstat (fileno(fp), &fs) < 0 )
error ( 1, errno, "Could not stat RCS archive %s for mapping", filename );
if (pos)
{
size_t ps = getpagesize ();
mmap_off = ( pos / ps ) * ps;
}
/* Map private here since this particular buffer is read only */
rcsbuf_buffer = mmap ( NULL, fs.st_size - mmap_off,
PROT_READ | PROT_WRITE,
MAP_PRIVATE, fileno(fp), mmap_off );
if ( rcsbuf_buffer == NULL || rcsbuf_buffer == MAP_FAILED )
error ( 1, errno, "Could not map memory to RCS archive %s", filename );
rcsbuf_buffer_size = fs.st_size - mmap_off;
rcsbuf->ptr = rcsbuf_buffer + pos - mmap_off;
rcsbuf->ptrend = rcsbuf_buffer + fs.st_size - mmap_off;
rcsbuf->pos = mmap_off;
}
#else /* HAVE_MMAP */
if (rcsbuf_buffer_size < RCSBUF_BUFSIZE)
expand_string (&rcsbuf_buffer, &rcsbuf_buffer_size, RCSBUF_BUFSIZE);
rcsbuf->ptr = rcsbuf_buffer;
rcsbuf->ptrend = rcsbuf_buffer;
rcsbuf->pos = pos;
#endif /* HAVE_MMAP */
rcsbuf->fp = fp;
rcsbuf->filename = filename;
rcsbuf->vlen = 0;
rcsbuf->at_string = 0;
rcsbuf->embedded_at = 0;
}
/* Stop gathering keys from an RCS file. */
static void
rcsbuf_close (rcsbuf)
struct rcsbuffer *rcsbuf;
{
if (! rcsbuf_inuse)
error (1, 0, "rcsbuf_close: internal error");
#ifdef HAVE_MMAP
munmap ( rcsbuf_buffer, rcsbuf_buffer_size );
#endif
rcsbuf_inuse = 0;
}
/* Read a key/value pair from an RCS file. This sets *KEYP to point
to the key, and *VALUEP to point to the value. A missing or empty
value is indicated by setting *VALUEP to NULL.
This function returns 1 on success, or 0 on EOF. If there is an
error reading the file, or an EOF in an unexpected location, it
gives a fatal error.
This sets *KEYP and *VALUEP to point to storage managed by
rcsbuf_getkey. Moreover, *VALUEP has not been massaged from the
RCS format: it may contain embedded whitespace and embedded '@'
characters. Call rcsbuf_valcopy or rcsbuf_valpolish to do
appropriate massaging. */
/* Note that the extreme hair in rcsbuf_getkey is because profiling
statistics show that it was worth it. */
static int
rcsbuf_getkey (rcsbuf, keyp, valp)
struct rcsbuffer *rcsbuf;
char **keyp;
char **valp;
{
register const char * const my_spacetab = spacetab;
register char *ptr, *ptrend;
char c;
#define my_whitespace(c) (my_spacetab[(unsigned char)c] != 0)
rcsbuf->vlen = 0;
rcsbuf->at_string = 0;
rcsbuf->embedded_at = 0;
ptr = rcsbuf->ptr;
ptrend = rcsbuf->ptrend;
/* Sanity check. */
assert (ptr >= rcsbuf_buffer && ptr <= rcsbuf_buffer + rcsbuf_buffer_size);
assert (ptrend >= rcsbuf_buffer && ptrend <= rcsbuf_buffer + rcsbuf_buffer_size);
#ifndef HAVE_MMAP
/* If the pointer is more than RCSBUF_BUFSIZE bytes into the
buffer, move back to the start of the buffer. This keeps the
buffer from growing indefinitely. */
if (ptr - rcsbuf_buffer >= RCSBUF_BUFSIZE)
{
int len;
len = ptrend - ptr;
/* Sanity check: we don't read more than RCSBUF_BUFSIZE bytes
at a time, so we can't have more bytes than that past PTR. */
assert (len <= RCSBUF_BUFSIZE);
/* Update the POS field, which holds the file offset of the
first byte in the RCSBUF_BUFFER buffer. */
rcsbuf->pos += ptr - rcsbuf_buffer;
memcpy (rcsbuf_buffer, ptr, len);
ptr = rcsbuf_buffer;
ptrend = ptr + len;
rcsbuf->ptrend = ptrend;
}
#endif /* ndef HAVE_MMAP */
/* Skip leading whitespace. */
while (1)
{
if (ptr >= ptrend)
#ifndef HAVE_MMAP
{
ptr = rcsbuf_fill (rcsbuf, ptr, (char **) NULL, (char **) NULL);
if (ptr == NULL)
#endif
return 0;
#ifndef HAVE_MMAP
ptrend = rcsbuf->ptrend;
}
#endif
c = *ptr;
if (! my_whitespace (c))
break;
++ptr;
}
/* We've found the start of the key. */
*keyp = ptr;
if (c != ';')
{
while (1)
{
++ptr;
if (ptr >= ptrend)
#ifndef HAVE_MMAP
{
ptr = rcsbuf_fill (rcsbuf, ptr, keyp, (char **) NULL);
if (ptr == NULL)
#endif
error (1, 0, "EOF in key in RCS file %s",
rcsbuf->filename);
#ifndef HAVE_MMAP
ptrend = rcsbuf->ptrend;
}
#endif
c = *ptr;
if (c == ';' || my_whitespace (c))
break;
}
}
/* Here *KEYP points to the key in the buffer, C is the character
we found at the of the key, and PTR points to the location in
the buffer where we found C. We must set *PTR to \0 in order
to terminate the key. If the key ended with ';', then there is
no value. */
*ptr = '\0';
++ptr;
if (c == ';')
{
*valp = NULL;
rcsbuf->ptr = ptr;
return 1;
}
/* C must be whitespace. Skip whitespace between the key and the
value. If we find ';' now, there is no value. */
while (1)
{
if (ptr >= ptrend)
#ifndef HAVE_MMAP
{
ptr = rcsbuf_fill (rcsbuf, ptr, keyp, (char **) NULL);
if (ptr == NULL)
#endif
error (1, 0, "EOF while looking for value in RCS file %s",
rcsbuf->filename);
#ifndef HAVE_MMAP
ptrend = rcsbuf->ptrend;
}
#endif
c = *ptr;
if (c == ';')
{
*valp = NULL;
rcsbuf->ptr = ptr + 1;
return 1;
}
if (! my_whitespace (c))
break;
++ptr;
}
/* Now PTR points to the start of the value, and C is the first
character of the value. */
if (c != '@')
*valp = ptr;
else
{
char *pat;
size_t vlen;
/* Optimize the common case of a value composed of a single
'@' string. */
rcsbuf->at_string = 1;
++ptr;
*valp = ptr;
while (1)
{
while ((pat = memchr (ptr, '@', ptrend - ptr)) == NULL)
#ifndef HAVE_MMAP
{
/* Note that we pass PTREND as the PTR value to
rcsbuf_fill, so that we will wind up setting PTR to
the location corresponding to the old PTREND, so
that we don't search the same bytes again. */
ptr = rcsbuf_fill (rcsbuf, ptrend, keyp, valp);
if (ptr == NULL)
#endif
error (1, 0,
"EOF while looking for end of string in RCS file %s",
rcsbuf->filename);
#ifndef HAVE_MMAP
ptrend = rcsbuf->ptrend;
}
#endif
/* Handle the special case of an '@' right at the end of
the known bytes. */
if (pat + 1 >= ptrend)
#ifndef HAVE_MMAP
{
/* Note that we pass PAT, not PTR, here. */
pat = rcsbuf_fill (rcsbuf, pat, keyp, valp);
if (pat == NULL)
{
#endif
/* EOF here is OK; it just means that the last
character of the file was an '@' terminating a
value for a key type which does not require a
trailing ';'. */
pat = rcsbuf->ptrend - 1;
#ifndef HAVE_MMAP
}
ptrend = rcsbuf->ptrend;
/* Note that the value of PTR is bogus here. This is
OK, because we don't use it. */
}
#endif
if (pat + 1 >= ptrend || pat[1] != '@')
break;
/* We found an '@' pair in the string. Keep looking. */
++rcsbuf->embedded_at;
ptr = pat + 2;
}
/* Here PAT points to the final '@' in the string. */
*pat = '\0';
vlen = pat - *valp;
if (vlen == 0)
*valp = NULL;
rcsbuf->vlen = vlen;
ptr = pat + 1;
}
/* Certain keywords only have a '@' string. If there is no '@'
string, then the old getrcskey function assumed that they had
no value, and we do the same. */
{
char *k;
k = *keyp;
if (STREQ (k, RCSDESC)
|| STREQ (k, "text")
|| STREQ (k, "log"))
{
if (c != '@')
*valp = NULL;
rcsbuf->ptr = ptr;
return 1;
}
}
/* If we've already gathered a '@' string, try to skip whitespace
and find a ';'. */
if (c == '@')
{
while (1)
{
char n;
if (ptr >= ptrend)
#ifndef HAVE_MMAP
{
ptr = rcsbuf_fill (rcsbuf, ptr, keyp, valp);
if (ptr == NULL)
#endif
error (1, 0, "EOF in value in RCS file %s",
rcsbuf->filename);
#ifndef HAVE_MMAP
ptrend = rcsbuf->ptrend;
}
#endif
n = *ptr;
if (n == ';')
{
/* We're done. We already set everything up for this
case above. */
rcsbuf->ptr = ptr + 1;
return 1;
}
if (! my_whitespace (n))
break;
++ptr;
}
/* The value extends past the '@' string. We need to undo the
'@' stripping done in the default case above. This
case never happens in a plain RCS file, but it can happen
if user defined phrases are used. */
((*valp)--)[rcsbuf->vlen++] = '@';
}
/* Here we have a value which is not a simple '@' string. We need
to gather up everything until the next ';', including any '@'
strings. *VALP points to the start of the value. If
RCSBUF->VLEN is not zero, then we have already read an '@'
string, and PTR points to the data following the '@' string.
Otherwise, PTR points to the start of the value. */
while (1)
{
char *start, *psemi, *pat;
/* Find the ';' which must end the value. */
start = ptr;
while ((psemi = memchr (ptr, ';', ptrend - ptr)) == NULL)
#ifndef HAVE_MMAP
{
int slen;
/* Note that we pass PTREND as the PTR value to
rcsbuf_fill, so that we will wind up setting PTR to the
location corresponding to the old PTREND, so that we
don't search the same bytes again. */
slen = start - *valp;
ptr = rcsbuf_fill (rcsbuf, ptrend, keyp, valp);
if (ptr == NULL)
#endif
error (1, 0, "EOF in value in RCS file %s", rcsbuf->filename);
#ifndef HAVE_MMAP
start = *valp + slen;
ptrend = rcsbuf->ptrend;
}
#endif
/* See if there are any '@' strings in the value. */
pat = memchr (start, '@', psemi - start);
if (pat == NULL)
{
size_t vlen;
/* We're done with the value. Trim any trailing
whitespace. */
rcsbuf->ptr = psemi + 1;
start = *valp;
while (psemi > start && my_whitespace (psemi[-1]))
--psemi;
*psemi = '\0';
vlen = psemi - start;
if (vlen == 0)
*valp = NULL;
rcsbuf->vlen = vlen;
return 1;
}
/* We found an '@' string in the value. We set RCSBUF->AT_STRING
and RCSBUF->EMBEDDED_AT to indicate that we won't be able to
compress whitespace correctly for this type of value.
Since this type of value never arises in a normal RCS file,
this should not be a big deal. It means that if anybody
adds a phrase which can have both an '@' string and regular
text, they will have to handle whitespace compression
themselves. */
rcsbuf->at_string = 1;
rcsbuf->embedded_at = -1;
ptr = pat + 1;
while (1)
{
while ((pat = memchr (ptr, '@', ptrend - ptr)) == NULL)
#ifndef HAVE_MMAP
{
/* Note that we pass PTREND as the PTR value to
rcsbuff_fill, so that we will wind up setting PTR
to the location corresponding to the old PTREND, so
that we don't search the same bytes again. */
ptr = rcsbuf_fill (rcsbuf, ptrend, keyp, valp);
if (ptr == NULL)
#endif
error (1, 0,
"EOF while looking for end of string in RCS file %s",
rcsbuf->filename);
#ifndef HAVE_MMAP
ptrend = rcsbuf->ptrend;
}
#endif
/* Handle the special case of an '@' right at the end of
the known bytes. */
if (pat + 1 >= ptrend)
#ifndef HAVE_MMAP
{
ptr = rcsbuf_fill (rcsbuf, ptr, keyp, valp);
if (ptr == NULL)
#endif
error (1, 0, "EOF in value in RCS file %s",
rcsbuf->filename);
#ifndef HAVE_MMAP
ptrend = rcsbuf->ptrend;
}
#endif
if (pat[1] != '@')
break;
/* We found an '@' pair in the string. Keep looking. */
ptr = pat + 2;
}
/* Here PAT points to the final '@' in the string. */
ptr = pat + 1;
}
#undef my_whitespace
}
/* Read an RCS revision number from an RCS file. This sets *REVP to
point to the revision number; it will point to space that is
managed by the rcsbuf functions, and is only good until the next
call to rcsbuf_getkey or rcsbuf_getrevnum.
This function returns 1 on success, or 0 on EOF. If there is an
error reading the file, or an EOF in an unexpected location, it
gives a fatal error. */
static int
rcsbuf_getrevnum (rcsbuf, revp)
struct rcsbuffer *rcsbuf;
char **revp;
{
char *ptr, *ptrend;
char c;
ptr = rcsbuf->ptr;
ptrend = rcsbuf->ptrend;
*revp = NULL;
/* Skip leading whitespace. */
while (1)
{
if (ptr >= ptrend)
#ifndef HAVE_MMAP
{
ptr = rcsbuf_fill (rcsbuf, ptr, (char **) NULL, (char **) NULL);
if (ptr == NULL)
#endif
return 0;
#ifndef HAVE_MMAP
ptrend = rcsbuf->ptrend;
}
#endif
c = *ptr;
if (! whitespace (c))
break;
++ptr;
}
if (! isdigit ((unsigned char) c) && c != '.')
error (1, 0,
"\
unexpected '\\x%x' reading revision number in RCS file %s",
c, rcsbuf->filename);
*revp = ptr;
do
{
++ptr;
if (ptr >= ptrend)
#ifndef HAVE_MMAP
{
ptr = rcsbuf_fill (rcsbuf, ptr, revp, (char **) NULL);
if (ptr == NULL)
#endif
error (1, 0,
"unexpected EOF reading revision number in RCS file %s",
rcsbuf->filename);
#ifndef HAVE_MMAP
ptrend = rcsbuf->ptrend;
}
#endif
c = *ptr;
}
while (isdigit ((unsigned char) c) || c == '.');
if (! whitespace (c))
error (1, 0, "\
unexpected '\\x%x' reading revision number in RCS file %s",
c, rcsbuf->filename);
*ptr = '\0';
rcsbuf->ptr = ptr + 1;
return 1;
}
#ifndef HAVE_MMAP
/* Fill RCSBUF_BUFFER with bytes from the file associated with RCSBUF,
updating PTR and the PTREND field. If KEYP and *KEYP are not NULL,
then *KEYP points into the buffer, and must be adjusted if the
buffer is changed. Likewise for VALP. Returns the new value of
PTR, or NULL on error. */
static char *
rcsbuf_fill (rcsbuf, ptr, keyp, valp)
struct rcsbuffer *rcsbuf;
char *ptr;
char **keyp;
char **valp;
{
int got;
if (rcsbuf->ptrend - rcsbuf_buffer + RCSBUF_BUFSIZE > rcsbuf_buffer_size)
{
int poff, peoff, koff, voff;
poff = ptr - rcsbuf_buffer;
peoff = rcsbuf->ptrend - rcsbuf_buffer;
koff = keyp == NULL ? 0 : *keyp - rcsbuf_buffer;
voff = valp == NULL ? 0 : *valp - rcsbuf_buffer;
expand_string (&rcsbuf_buffer, &rcsbuf_buffer_size,
rcsbuf_buffer_size + RCSBUF_BUFSIZE);
ptr = rcsbuf_buffer + poff;
rcsbuf->ptrend = rcsbuf_buffer + peoff;
if (keyp != NULL)
*keyp = rcsbuf_buffer + koff;
if (valp != NULL)
*valp = rcsbuf_buffer + voff;
}
got = fread (rcsbuf->ptrend, 1, RCSBUF_BUFSIZE, rcsbuf->fp);
if (got == 0)
{
if (ferror (rcsbuf->fp))
error (1, errno, "cannot read %s", rcsbuf->filename);
return NULL;
}
rcsbuf->ptrend += got;
return ptr;
}
#endif /* HAVE_MMAP */
/* Test whether the last value returned by rcsbuf_getkey is a composite
value or not. */
static int
rcsbuf_valcmp (rcsbuf)
struct rcsbuffer *rcsbuf;
{
return rcsbuf->at_string && rcsbuf->embedded_at < 0;
}
/* Copy the value VAL returned by rcsbuf_getkey into a memory buffer,
returning the memory buffer. Polish the value like
rcsbuf_valpolish, q.v. */
static char *
rcsbuf_valcopy (rcsbuf, val, polish, lenp)
struct rcsbuffer *rcsbuf;
char *val;
int polish;
size_t *lenp;
{
size_t vlen;
int embedded_at;
char *ret;
if (val == NULL)
{
if (lenp != NULL)
*lenp = 0;
return NULL;
}
vlen = rcsbuf->vlen;
embedded_at = rcsbuf->embedded_at < 0 ? 0 : rcsbuf->embedded_at;
ret = xmalloc (vlen - embedded_at + 1);
if (rcsbuf->at_string ? embedded_at == 0 : ! polish)
{
/* No special action to take. */
memcpy (ret, val, vlen + 1);
if (lenp != NULL)
*lenp = vlen;
return ret;
}
rcsbuf_valpolish_internal (rcsbuf, ret, val, lenp);
return ret;
}
/* Polish the value VAL returned by rcsbuf_getkey. The POLISH
parameter is non-zero if multiple embedded whitespace characters
should be compressed into a single whitespace character. Note that
leading and trailing whitespace was already removed by
rcsbuf_getkey. Within an '@' string, pairs of '@' characters are
compressed into a single '@' character regardless of the value of
POLISH. If LENP is not NULL, set *LENP to the length of the value. */
static void
rcsbuf_valpolish (rcsbuf, val, polish, lenp)
struct rcsbuffer *rcsbuf;
char *val;
int polish;
size_t *lenp;
{
if (val == NULL)
{
if (lenp != NULL)
*lenp= 0;
return;
}
if (rcsbuf->at_string ? rcsbuf->embedded_at == 0 : ! polish)
{
/* No special action to take. */
if (lenp != NULL)
*lenp = rcsbuf->vlen;
return;
}
rcsbuf_valpolish_internal (rcsbuf, val, val, lenp);
}
/* Internal polishing routine, called from rcsbuf_valcopy and
rcsbuf_valpolish. */
static void
rcsbuf_valpolish_internal (rcsbuf, to, from, lenp)
struct rcsbuffer *rcsbuf;
char *to;
const char *from;
size_t *lenp;
{
size_t len;
len = rcsbuf->vlen;
if (! rcsbuf->at_string)
{
char *orig_to;
size_t clen;
orig_to = to;
for (clen = len; clen > 0; ++from, --clen)
{
char c;
c = *from;
if (whitespace (c))
{
/* Note that we know that clen can not drop to zero
while we have whitespace, because we know there is
no trailing whitespace. */
while (whitespace (from[1]))
{
++from;
--clen;
}
c = ' ';
}
*to++ = c;
}
*to = '\0';
if (lenp != NULL)
*lenp = to - orig_to;
}
else
{
const char *orig_from;
char *orig_to;
int embedded_at;
size_t clen;
orig_from = from;
orig_to = to;
embedded_at = rcsbuf->embedded_at;
assert (embedded_at > 0);
if (lenp != NULL)
*lenp = len - embedded_at;
for (clen = len; clen > 0; ++from, --clen)
{
char c;
c = *from;
*to++ = c;
if (c == '@')
{
++from;
/* Sanity check.
*
* FIXME: I restored this to an abort from an assert based on
* advice from Larry Jones that asserts should not be used to
* confirm the validity of an RCS file... This leaves two
* issues here: 1) I am uncertain that the fact that we will
* only find double '@'s hasn't already been confirmed; and:
* 2) If this is the proper place to spot the error in the RCS
* file, then we should print a much clearer error here for the
* user!!!!!!!
*
* - DRP
*/
if (*from != '@' || clen == 0)
abort ();
--clen;
--embedded_at;
if (embedded_at == 0)
{
/* We've found all the embedded '@' characters.
We can just memcpy the rest of the buffer after
this '@' character. */
if (orig_to != orig_from)
memcpy (to, from + 1, clen - 1);
else
memmove (to, from + 1, clen - 1);
from += clen;
to += clen - 1;
break;
}
}
}
/* Sanity check. */
assert (from == orig_from + len
&& to == orig_to + (len - rcsbuf->embedded_at));
*to = '\0';
}
}
#ifdef PRESERVE_PERMISSIONS_SUPPORT
/* Copy the next word from the value VALP returned by rcsbuf_getkey into a
memory buffer, updating VALP and returning the memory buffer. Return
NULL when there are no more words. */
static char *
rcsbuf_valword (rcsbuf, valp)
struct rcsbuffer *rcsbuf;
char **valp;
{
register const char * const my_spacetab = spacetab;
register char *ptr, *pat;
char c;
# define my_whitespace(c) (my_spacetab[(unsigned char)c] != 0)
if (*valp == NULL)
return NULL;
for (ptr = *valp; my_whitespace (*ptr); ++ptr) ;
if (*ptr == '\0')
{
assert (ptr - *valp == rcsbuf->vlen);
*valp = NULL;
rcsbuf->vlen = 0;
return NULL;
}
/* PTR now points to the start of a value. Find out whether it is
a num, an id, a string or a colon. */
c = *ptr;
if (c == ':')
{
rcsbuf->vlen -= ++ptr - *valp;
*valp = ptr;
return xstrdup (":");
}
if (c == '@')
{
int embedded_at = 0;
size_t vlen;
pat = ++ptr;
while ((pat = strchr (pat, '@')) != NULL)
{
if (pat[1] != '@')
break;
++embedded_at;
pat += 2;
}
/* Here PAT points to the final '@' in the string. */
*pat++ = '\0';
assert (rcsbuf->at_string);
vlen = rcsbuf->vlen - (pat - *valp);
rcsbuf->vlen = pat - ptr - 1;
rcsbuf->embedded_at = embedded_at;
ptr = rcsbuf_valcopy (rcsbuf, ptr, 0, (size_t *) NULL);
*valp = pat;
rcsbuf->vlen = vlen;
if (strchr (pat, '@') == NULL)
rcsbuf->at_string = 0;
else
rcsbuf->embedded_at = -1;
return ptr;
}
/* *PTR is neither `:', `;' nor `@', so it should be the start of a num
or an id. Make sure it is not another special character. */
if (c == '$' || c == '.' || c == ',')
{
error (1, 0, "invalid special character in RCS field in %s",
rcsbuf->filename);
}
pat = ptr;
while (1)
{
/* Legitimate ID characters are digits, dots and any `graphic
printing character that is not a special.' This test ought
to do the trick. */
c = *++pat;
if (!isprint ((unsigned char) c) ||
c == ';' || c == '$' || c == ',' || c == '@' || c == ':')
break;
}
/* PAT points to the last non-id character in this word, and C is
the character in its memory cell. Check to make sure that it
is a legitimate word delimiter -- whitespace or end. */
if (c != '\0' && !my_whitespace (c))
error (1, 0, "invalid special character in RCS field in %s",
rcsbuf->filename);
*pat = '\0';
rcsbuf->vlen -= pat - *valp;
*valp = pat;
return xstrdup (ptr);
# undef my_whitespace
}
#endif
/* Return the current position of an rcsbuf. */
static unsigned long
rcsbuf_ftell (rcsbuf)
struct rcsbuffer *rcsbuf;
{
return rcsbuf->pos + rcsbuf->ptr - rcsbuf_buffer;
}
/* Return a pointer to any data buffered for RCSBUF, along with the
length. */
static void
rcsbuf_get_buffered (rcsbuf, datap, lenp)
struct rcsbuffer *rcsbuf;
char **datap;
size_t *lenp;
{
*datap = rcsbuf->ptr;
*lenp = rcsbuf->ptrend - rcsbuf->ptr;
}
/* CVS optimizes by quickly reading some header information from a
file. If it decides it needs to do more with the file, it reopens
it. We speed that up here by maintaining a cache of a single open
file, to save the time it takes to reopen the file in the common
case. */
static RCSNode *cached_rcs;
static struct rcsbuffer cached_rcsbuf;
/* Cache RCS and RCSBUF. This takes responsibility for closing
RCSBUF->FP. */
static void
rcsbuf_cache (rcs, rcsbuf)
RCSNode *rcs;
struct rcsbuffer *rcsbuf;
{
if (cached_rcs != NULL)
rcsbuf_cache_close ();
cached_rcs = rcs;
++rcs->refcount;
cached_rcsbuf = *rcsbuf;
}
/* If there is anything in the cache, close it. */
static void
rcsbuf_cache_close ()
{
if (cached_rcs != NULL)
{
rcsbuf_close (&cached_rcsbuf);
if (fclose (cached_rcsbuf.fp) != 0)
error (0, errno, "cannot close %s", cached_rcsbuf.filename);
freercsnode (&cached_rcs);
cached_rcs = NULL;
}
}
/* Open an rcsbuffer for RCS, getting it from the cache if possible.
Set *FPP to the file, and *RCSBUFP to the rcsbuf. The file should
be put at position POS. */
static void
rcsbuf_cache_open (rcs, pos, pfp, prcsbuf)
RCSNode *rcs;
long pos;
FILE **pfp;
struct rcsbuffer *prcsbuf;
{
#ifndef HAVE_MMAP
if (cached_rcs == rcs)
{
if (rcsbuf_ftell (&cached_rcsbuf) != pos)
{
if (fseek (cached_rcsbuf.fp, pos, SEEK_SET) != 0)
error (1, 0, "cannot fseek RCS file %s",
cached_rcsbuf.filename);
cached_rcsbuf.ptr = rcsbuf_buffer;
cached_rcsbuf.ptrend = rcsbuf_buffer;
cached_rcsbuf.pos = pos;
}
*pfp = cached_rcsbuf.fp;
/* When RCS_parse opens a file using fopen_case, it frees the
filename which we cached in CACHED_RCSBUF and stores a new
file name in RCS->PATH. We avoid problems here by always
copying the filename over. FIXME: This is hackish. */
cached_rcsbuf.filename = rcs->path;
*prcsbuf = cached_rcsbuf;
cached_rcs = NULL;
/* Removing RCS from the cache removes a reference to it. */
--rcs->refcount;
if (rcs->refcount <= 0)
error (1, 0, "rcsbuf_cache_open: internal error");
}
else
{
#endif /* ifndef HAVE_MMAP */
/* FIXME: If these routines can be rewritten to not write to the
* rcs file buffer, there would be a considerably larger memory savings
* from using mmap since the shared file would never need be copied to
* process memory.
*
* If this happens, cached mmapped buffers would be usable, but don't
* forget to make sure rcs->pos < pos here...
*/
if (cached_rcs != NULL)
rcsbuf_cache_close ();
*pfp = CVS_FOPEN (rcs->path, FOPEN_BINARY_READ);
if (*pfp == NULL)
error (1, 0, "unable to reopen `%s'", rcs->path);
#ifndef HAVE_MMAP
if (pos != 0)
{
if (fseek (*pfp, pos, SEEK_SET) != 0)
error (1, 0, "cannot fseek RCS file %s", rcs->path);
}
#endif /* ifndef HAVE_MMAP */
rcsbuf_open (prcsbuf, *pfp, rcs->path, pos);
#ifndef HAVE_MMAP
}
#endif /* ifndef HAVE_MMAP */
}
/*
* process the symbols list of the rcs file
*/
static void
do_symbols (list, val)
List *list;
char *val;
{
Node *p;
char *cp = val;
char *tag, *rev;
for (;;)
{
/* skip leading whitespace */
while (whitespace (*cp))
cp++;
/* if we got to the end, we are done */
if (*cp == '\0')
break;
/* split it up into tag and rev */
tag = cp;
cp = strchr (cp, ':');
*cp++ = '\0';
rev = cp;
while (!whitespace (*cp) && *cp != '\0')
cp++;
if (*cp != '\0')
*cp++ = '\0';
/* make a new node and add it to the list */
p = getnode ();
p->key = xstrdup (tag);
p->data = xstrdup (rev);
(void) addnode (list, p);
}
}
/*
* process the locks list of the rcs file
* Like do_symbols, but hash entries are keyed backwards: i.e.
* an entry like `user:rev' is keyed on REV rather than on USER.
*/
static void
do_locks (list, val)
List *list;
char *val;
{
Node *p;
char *cp = val;
char *user, *rev;
for (;;)
{
/* skip leading whitespace */
while (whitespace (*cp))
cp++;
/* if we got to the end, we are done */
if (*cp == '\0')
break;
/* split it up into user and rev */
user = cp;
cp = strchr (cp, ':');
*cp++ = '\0';
rev = cp;
while (!whitespace (*cp) && *cp != '\0')
cp++;
if (*cp != '\0')
*cp++ = '\0';
/* make a new node and add it to the list */
p = getnode ();
p->key = xstrdup (rev);
p->data = xstrdup (user);
(void) addnode (list, p);
}
}
/*
* process the branches list of a revision delta
*/
static void
do_branches (list, val)
List *list;
char *val;
{
Node *p;
char *cp = val;
char *branch;
for (;;)
{
/* skip leading whitespace */
while (whitespace (*cp))
cp++;
/* if we got to the end, we are done */
if (*cp == '\0')
break;
/* find the end of this branch */
branch = cp;
while (!whitespace (*cp) && *cp != '\0')
cp++;
if (*cp != '\0')
*cp++ = '\0';
/* make a new node and add it to the list */
p = getnode ();
p->key = xstrdup (branch);
(void) addnode (list, p);
}
}
/*
* Version Number
*
* Returns the requested version number of the RCS file, satisfying tags and/or
* dates, and walking branches, if necessary.
*
* The result is returned; null-string if error.
*/
char *
RCS_getversion (rcs, tag, date, force_tag_match, simple_tag)
RCSNode *rcs;
char *tag;
char *date;
int force_tag_match;
int *simple_tag;
{
if (simple_tag != NULL)
*simple_tag = 0;
/* make sure we have something to look at... */
assert (rcs != NULL);
if (tag && date)
{
char *branch, *rev;
if (! RCS_nodeisbranch (rcs, tag))
{
/* We can't get a particular date if the tag is not a
branch. */
return NULL;
}
/* Work out the branch. */
if (! isdigit ((unsigned char) tag[0]))
branch = RCS_whatbranch (rcs, tag);
else
branch = xstrdup (tag);
/* Fetch the revision of branch as of date. */
rev = RCS_getdatebranch (rcs, date, branch);
free (branch);
return (rev);
}
else if (tag)
return (RCS_gettag (rcs, tag, force_tag_match, simple_tag));
else if (date)
return (RCS_getdate (rcs, date, force_tag_match));
else
return (RCS_head (rcs));
}
/*
* Get existing revision number corresponding to tag or revision.
* Similar to RCS_gettag but less interpretation imposed.
* For example:
* -- If tag designates a magic branch, RCS_tag2rev
* returns the magic branch number.
* -- If tag is a branch tag, returns the branch number, not
* the revision of the head of the branch.
* If tag or revision is not valid or does not exist in file,
* return NULL.
*/
char *
RCS_tag2rev (rcs, tag)
RCSNode *rcs;
char *tag;
{
char *rev, *pa, *pb;
int i;
assert (rcs != NULL);
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
/* If a valid revision, try to look it up */
if ( RCS_valid_rev (tag) )
{
/* Make a copy so we can scribble on it */
rev = xstrdup (tag);
/* If revision exists, return the copy */
if (RCS_exist_rev (rcs, tag))
return rev;
/* Nope, none such. If tag is not a branch we're done. */
i = numdots (rev);
if ((i & 1) == 1 )
{
pa = strrchr (rev, '.');
if (i == 1 || *(pa-1) != RCS_MAGIC_BRANCH || *(pa-2) != '.')
{
free (rev);
error (1, 0, "revision `%s' does not exist", tag);
}
}
/* Try for a real (that is, exists in the RCS deltas) branch
(RCS_exist_rev just checks for real revisions and revisions
which have tags pointing to them). */
pa = RCS_getbranch (rcs, rev, 1);
if (pa != NULL)
{
free (pa);
return rev;
}
/* Tag is branch, but does not exist, try corresponding
* magic branch tag.
*
* FIXME: assumes all magic branches are of
* form "n.n.n ... .0.n". I'll fix if somebody can
* send me a method to get a magic branch tag with
* the 0 in some other position -- <dan@gasboy.com>
*/
pa = strrchr (rev, '.');
pb = xmalloc (strlen (rev) + 3);
*pa++ = 0;
(void) sprintf (pb, "%s.%d.%s", rev, RCS_MAGIC_BRANCH, pa);
free (rev);
rev = pb;
if (RCS_exist_rev (rcs, rev))
return rev;
error (1, 0, "revision `%s' does not exist", tag);
}
RCS_check_tag (tag); /* exit if not a valid tag */
/* If tag is "HEAD", special case to get head RCS revision */
if (tag && STREQ (tag, TAG_HEAD))
return (RCS_head (rcs));
/* If valid tag let translate_symtag say yea or nay. */
rev = translate_symtag (rcs, tag);
if (rev)
return rev;
/* Trust the caller to print warnings. */
return NULL;
}
/*
* Find the revision for a specific tag.
* If force_tag_match is set, return NULL if an exact match is not
* possible otherwise return RCS_head (). We are careful to look for
* and handle "magic" revisions specially.
*
* If the matched tag is a branch tag, find the head of the branch.
*
* Returns pointer to newly malloc'd string, or NULL.
*/
char *
RCS_gettag (rcs, symtag, force_tag_match, simple_tag)
RCSNode *rcs;
char *symtag;
int force_tag_match;
int *simple_tag;
{
char *tag = symtag;
int tag_allocated = 0;
if (simple_tag != NULL)
*simple_tag = 0;
/* make sure we have something to look at... */
assert (rcs != NULL);
/* XXX this is probably not necessary, --jtc */
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
/* If tag is "HEAD", special case to get head RCS revision */
if (tag && STREQ (tag, TAG_HEAD))
#if 0 /* This #if 0 is only in the Cygnus code. Why? Death support? */
if (force_tag_match && (rcs->flags & VALID) && (rcs->flags & INATTIC))
return ((char *) NULL); /* head request for removed file */
else
#endif
return (RCS_head (rcs));
if (!isdigit ((unsigned char) tag[0]))
{
char *version;
/* If we got a symbolic tag, resolve it to a numeric */
version = translate_symtag (rcs, tag);
if (version != NULL)
{
int dots;
char *magic, *branch, *cp;
tag = version;
tag_allocated = 1;
/*
* If this is a magic revision, we turn it into either its
* physical branch equivalent (if one exists) or into
* its base revision, which we assume exists.
*/
dots = numdots (tag);
if (dots > 2 && (dots & 1) != 0)
{
branch = strrchr (tag, '.');
cp = branch++ - 1;
while (*cp != '.')
cp--;
/* see if we have .magic-branch. (".0.") */
magic = xmalloc (strlen (tag) + 1);
(void) sprintf (magic, ".%d.", RCS_MAGIC_BRANCH);
if (strncmp (magic, cp, strlen (magic)) == 0)
{
/* it's magic. See if the branch exists */
*cp = '\0'; /* turn it into a revision */
(void) sprintf (magic, "%s.%s", tag, branch);
branch = RCS_getbranch (rcs, magic, 1);
free (magic);
if (branch != NULL)
{
free (tag);
return (branch);
}
return (tag);
}
free (magic);
}
}
else
{
/* The tag wasn't there, so return the head or NULL */
if (force_tag_match)
return (NULL);
else
return (RCS_head (rcs));
}
}
/*
* numeric tag processing:
* 1) revision number - just return it
* 2) branch number - find head of branch
*/
/* strip trailing dots */
while (tag[strlen (tag) - 1] == '.')
tag[strlen (tag) - 1] = '\0';
if ((numdots (tag) & 1) == 0)
{
char *branch;
/* we have a branch tag, so we need to walk the branch */
branch = RCS_getbranch (rcs, tag, force_tag_match);
if (tag_allocated)
free (tag);
return branch;
}
else
{
Node *p;
/* we have a revision tag, so make sure it exists */
p = findnode (rcs->versions, tag);
if (p != NULL)
{
/* We have found a numeric revision for the revision tag.
To support expanding the RCS keyword Name, if
SIMPLE_TAG is not NULL, tell the the caller that this
is a simple tag which co will recognize. FIXME: Are
there other cases in which we should set this? In
particular, what if we expand RCS keywords internally
without calling co? */
if (simple_tag != NULL)
*simple_tag = 1;
if (! tag_allocated)
tag = xstrdup (tag);
return (tag);
}
else
{
/* The revision wasn't there, so return the head or NULL */
if (tag_allocated)
free (tag);
if (force_tag_match)
return (NULL);
else
return (RCS_head (rcs));
}
}
}
/*
* Return a "magic" revision as a virtual branch off of REV for the RCS file.
* A "magic" revision is one which is unique in the RCS file. By unique, I
* mean we return a revision which:
* - has a branch of 0 (see rcs.h RCS_MAGIC_BRANCH)
* - has a revision component which is not an existing branch off REV
* - has a revision component which is not an existing magic revision
* - is an even-numbered revision, to avoid conflicts with vendor branches
* The first point is what makes it "magic".
*
* As an example, if we pass in 1.37 as REV, we will look for an existing
* branch called 1.37.2. If it did not exist, we would look for an
* existing symbolic tag with a numeric part equal to 1.37.0.2. If that
* didn't exist, then we know that the 1.37.2 branch can be reserved by
* creating a symbolic tag with 1.37.0.2 as the numeric part.
*
* This allows us to fork development with very little overhead -- just a
* symbolic tag is used in the RCS file. When a commit is done, a physical
* branch is dynamically created to hold the new revision.
*
* Note: We assume that REV is an RCS revision and not a branch number.
*/
static char *check_rev;
char *
RCS_magicrev (rcs, rev)
RCSNode *rcs;
char *rev;
{
int rev_num;
char *xrev, *test_branch, *local_branch_num;
xrev = xmalloc (strlen (rev) + 14); /* enough for .0.number */
check_rev = xrev;
local_branch_num = getenv("CVS_LOCAL_BRANCH_NUM");
if (local_branch_num)
{
rev_num = atoi(local_branch_num);
if (rev_num < 2)
rev_num = 2;
else
rev_num &= ~1;
}
else
rev_num = 2;
/* only look at even numbered branches */
for ( ; ; rev_num += 2)
{
/* see if the physical branch exists */
(void) sprintf (xrev, "%s.%d", rev, rev_num);
test_branch = RCS_getbranch (rcs, xrev, 1);
if (test_branch != NULL) /* it did, so keep looking */
{
free (test_branch);
continue;
}
/* now, create a "magic" revision */
(void) sprintf (xrev, "%s.%d.%d", rev, RCS_MAGIC_BRANCH, rev_num);
/* walk the symbols list to see if a magic one already exists */
if (walklist (RCS_symbols(rcs), checkmagic_proc, NULL) != 0)
continue;
/* we found a free magic branch. Claim it as ours */
return (xrev);
}
}
/*
* walklist proc to look for a match in the symbols list.
* Returns 0 if the symbol does not match, 1 if it does.
*/
static int
checkmagic_proc (p, closure)
Node *p;
void *closure;
{
if (STREQ (check_rev, p->data))
return (1);
else
return (0);
}
/*
* Given an RCSNode, returns non-zero if the specified revision number
* or symbolic tag resolves to a "branch" within the rcs file.
*
* FIXME: this is the same as RCS_nodeisbranch except for the special
* case for handling a null rcsnode.
*/
int
RCS_isbranch (rcs, rev)
RCSNode *rcs;
const char *rev;
{
/* numeric revisions are easy -- even number of dots is a branch */
if (isdigit ((unsigned char) *rev))
return ((numdots (rev) & 1) == 0);
/* assume a revision if you can't find the RCS info */
if (rcs == NULL)
return (0);
/* now, look for a match in the symbols list */
return (RCS_nodeisbranch (rcs, rev));
}
/*
* Given an RCSNode, returns non-zero if the specified revision number
* or symbolic tag resolves to a "branch" within the rcs file. We do
* take into account any magic branches as well.
*/
int
RCS_nodeisbranch (rcs, rev)
RCSNode *rcs;
const char *rev;
{
int dots;
char *version;
assert (rcs != NULL);
/* numeric revisions are easy -- even number of dots is a branch */
if (isdigit ((unsigned char) *rev))
return ((numdots (rev) & 1) == 0);
version = translate_symtag (rcs, rev);
if (version == NULL)
return (0);
dots = numdots (version);
if ((dots & 1) == 0)
{
free (version);
return (1);
}
/* got a symbolic tag match, but it's not a branch; see if it's magic */
if (dots > 2)
{
char *magic;
char *branch = strrchr (version, '.');
char *cp = branch - 1;
while (*cp != '.')
cp--;
/* see if we have .magic-branch. (".0.") */
magic = xmalloc (strlen (version) + 1);
(void) sprintf (magic, ".%d.", RCS_MAGIC_BRANCH);
if (strncmp (magic, cp, strlen (magic)) == 0)
{
free (magic);
free (version);
return (1);
}
free (magic);
}
free (version);
return (0);
}
/*
* Returns a pointer to malloc'ed memory which contains the branch
* for the specified *symbolic* tag. Magic branches are handled correctly.
*/
char *
RCS_whatbranch (rcs, rev)
RCSNode *rcs;
const char *rev;
{
char *version;
int dots;
/* assume no branch if you can't find the RCS info */
if (rcs == NULL)
return ((char *) NULL);
/* now, look for a match in the symbols list */
version = translate_symtag (rcs, rev);
if (version == NULL)
return ((char *) NULL);
dots = numdots (version);
if ((dots & 1) == 0)
return (version);
/* got a symbolic tag match, but it's not a branch; see if it's magic */
if (dots > 2)
{
char *magic;
char *branch = strrchr (version, '.');
char *cp = branch++ - 1;
while (*cp != '.')
cp--;
/* see if we have .magic-branch. (".0.") */
magic = xmalloc (strlen (version) + 1);
(void) sprintf (magic, ".%d.", RCS_MAGIC_BRANCH);
if (strncmp (magic, cp, strlen (magic)) == 0)
{
/* yep. it's magic. now, construct the real branch */
*cp = '\0'; /* turn it into a revision */
(void) sprintf (magic, "%s.%s", version, branch);
free (version);
return (magic);
}
free (magic);
}
free (version);
return ((char *) NULL);
}
/*
* Get the head of the specified branch. If the branch does not exist,
* return NULL or RCS_head depending on force_tag_match.
* Returns NULL or a newly malloc'd string.
*/
char *
RCS_getbranch (rcs, tag, force_tag_match)
RCSNode *rcs;
char *tag;
int force_tag_match;
{
Node *p, *head;
RCSVers *vn;
char *xtag;
char *nextvers;
char *cp;
/* make sure we have something to look at... */
assert (rcs != NULL);
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
/* find out if the tag contains a dot, or is on the trunk */
cp = strrchr (tag, '.');
/* trunk processing is the special case */
if (cp == NULL)
{
xtag = xmalloc (strlen (tag) + 1 + 1); /* +1 for an extra . */
(void) strcpy (xtag, tag);
(void) strcat (xtag, ".");
for (cp = rcs->head; cp != NULL;)
{
if (strncmp (xtag, cp, strlen (xtag)) == 0)
break;
p = findnode (rcs->versions, cp);
if (p == NULL)
{
free (xtag);
if (force_tag_match)
return (NULL);
else
return (RCS_head (rcs));
}
vn = (RCSVers *) p->data;
cp = vn->next;
}
free (xtag);
if (cp == NULL)
{
if (force_tag_match)
return (NULL);
else
return (RCS_head (rcs));
}
return (xstrdup (cp));
}
/* if it had a `.', terminate the string so we have the base revision */
*cp = '\0';
/* look up the revision this branch is based on */
p = findnode (rcs->versions, tag);
/* put the . back so we have the branch again */
*cp = '.';
if (p == NULL)
{
/* if the base revision didn't exist, return head or NULL */
if (force_tag_match)
return (NULL);
else
return (RCS_head (rcs));
}
/* find the first element of the branch we are looking for */
vn = (RCSVers *) p->data;
if (vn->branches == NULL)
return (NULL);
xtag = xmalloc (strlen (tag) + 1 + 1); /* 1 for the extra '.' */
(void) strcpy (xtag, tag);
(void) strcat (xtag, ".");
head = vn->branches->list;
for (p = head->next; p != head; p = p->next)
if (strncmp (p->key, xtag, strlen (xtag)) == 0)
break;
free (xtag);
if (p == head)
{
/* we didn't find a match so return head or NULL */
if (force_tag_match)
return (NULL);
else
return (RCS_head (rcs));
}
/* now walk the next pointers of the branch */
nextvers = p->key;
do
{
p = findnode (rcs->versions, nextvers);
if (p == NULL)
{
/* a link in the chain is missing - return head or NULL */
if (force_tag_match)
return (NULL);
else
return (RCS_head (rcs));
}
vn = (RCSVers *) p->data;
nextvers = vn->next;
} while (nextvers != NULL);
/* we have the version in our hand, so go for it */
return (xstrdup (vn->version));
}
/* Returns the head of the branch which REV is on. REV can be a
branch tag or non-branch tag; symbolic or numeric.
Returns a newly malloc'd string. Returns NULL if a symbolic name
isn't found. */
char *
RCS_branch_head (rcs, rev)
RCSNode *rcs;
char *rev;
{
char *num;
char *br;
char *retval;
assert (rcs != NULL);
if (RCS_nodeisbranch (rcs, rev))
return RCS_getbranch (rcs, rev, 1);
if (isdigit ((unsigned char) *rev))
num = xstrdup (rev);
else
{
num = translate_symtag (rcs, rev);
if (num == NULL)
return NULL;
}
br = truncate_revnum (num);
retval = RCS_getbranch (rcs, br, 1);
free (br);
free (num);
return retval;
}
/* Get the branch point for a particular branch, that is the first
revision on that branch. For example, RCS_getbranchpoint (rcs,
"1.3.2") will normally return "1.3.2.1". TARGET may be either a
branch number or a revision number; if a revnum, find the
branchpoint of the branch to which TARGET belongs.
Return RCS_head if TARGET is on the trunk or if the root node could
not be found (this is sort of backwards from our behavior on a branch;
the rationale is that the return value is a revision from which you
can start walking the next fields and end up at TARGET).
Return NULL on error. */
static char *
RCS_getbranchpoint (rcs, target)
RCSNode *rcs;
char *target;
{
char *branch, *bp;
Node *vp;
RCSVers *rev;
int dots, isrevnum, brlen;
dots = numdots (target);
isrevnum = dots & 1;
if (dots == 1)
/* TARGET is a trunk revision; return rcs->head. */
return (RCS_head (rcs));
/* Get the revision number of the node at which TARGET's branch is
rooted. If TARGET is a branch number, lop off the last field;
if it's a revision number, lop off the last *two* fields. */
branch = xstrdup (target);
bp = strrchr (branch, '.');
if (bp == NULL)
error (1, 0, "%s: confused revision number %s",
rcs->path, target);
if (isrevnum)
while (*--bp != '.')
;
*bp = '\0';
vp = findnode (rcs->versions, branch);
if (vp == NULL)
{
error (0, 0, "%s: can't find branch point %s", rcs->path, target);
return NULL;
}
rev = (RCSVers *) vp->data;
*bp++ = '.';
while (*bp && *bp != '.')
++bp;
brlen = bp - branch;
vp = rev->branches->list->next;
while (vp != rev->branches->list)
{
/* BRANCH may be a genuine branch number, e.g. `1.1.3', or
maybe a full revision number, e.g. `1.1.3.6'. We have
found our branch point if the first BRANCHLEN characters
of the revision number match, *and* if the following
character is a dot. */
if (strncmp (vp->key, branch, brlen) == 0 && vp->key[brlen] == '.')
break;
vp = vp->next;
}
free (branch);
if (vp == rev->branches->list)
{
error (0, 0, "%s: can't find branch point %s", rcs->path, target);
return NULL;
}
else
return (xstrdup (vp->key));
}
/*
* Get the head of the RCS file. If branch is set, this is the head of the
* branch, otherwise the real head.
* Returns NULL or a newly malloc'd string.
*/
char *
RCS_head (rcs)
RCSNode *rcs;
{
/* make sure we have something to look at... */
assert (rcs != NULL);
/*
* NOTE: we call getbranch with force_tag_match set to avoid any
* possibility of recursion
*/
if (rcs->branch)
return (RCS_getbranch (rcs, rcs->branch, 1));
else
return (xstrdup (rcs->head));
}
/*
* Get the most recent revision, based on the supplied date, but use some
* funky stuff and follow the vendor branch maybe
*/
char *
RCS_getdate (rcs, date, force_tag_match)
RCSNode *rcs;
char *date;
int force_tag_match;
{
char *cur_rev = NULL;
char *retval = NULL;
Node *p;
RCSVers *vers = NULL;
/* make sure we have something to look at... */
assert (rcs != NULL);
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
/* if the head is on a branch, try the branch first */
if (rcs->branch != NULL)
{
retval = RCS_getdatebranch (rcs, date, rcs->branch);
if (retval != NULL)
return (retval);
}
/* otherwise if we have a trunk, try it */
if (rcs->head)
{
p = findnode (rcs->versions, rcs->head);
if (p == NULL)
{
error (0, 0, "%s: head revision %s doesn't exist", rcs->path,
rcs->head);
}
while (p != NULL)
{
/* if the date of this one is before date, take it */
vers = (RCSVers *) p->data;
if (RCS_datecmp (vers->date, date) <= 0)
{
cur_rev = vers->version;
break;
}
/* if there is a next version, find the node */
if (vers->next != NULL)
p = findnode (rcs->versions, vers->next);
else
p = (Node *) NULL;
}
}
else
error (0, 0, "%s: no head revision", rcs->path);
/*
* at this point, either we have the revision we want, or we have the
* first revision on the trunk (1.1?) in our hands, or we've come up
* completely empty
*/
/* if we found what we're looking for, and it's not 1.1 return it */
if (cur_rev != NULL)
{
if (! STREQ (cur_rev, "1.1"))
return (xstrdup (cur_rev));
/* This is 1.1; if the date of 1.1 is not the same as that for the
1.1.1.1 version, then return 1.1. This happens when the first
version of a file is created by a regular cvs add and commit,
and there is a subsequent cvs import of the same file. */
p = findnode (rcs->versions, "1.1.1.1");
if (p)
{
char *date_1_1 = vers->date;
vers = (RCSVers *) p->data;
if (RCS_datecmp (vers->date, date_1_1) != 0)
return xstrdup ("1.1");
}
}
/* look on the vendor branch */
retval = RCS_getdatebranch (rcs, date, CVSBRANCH);
/*
* if we found a match, return it; otherwise, we return the first
* revision on the trunk or NULL depending on force_tag_match and the
* date of the first rev
*/
if (retval != NULL)
return (retval);
if (!force_tag_match ||
(vers != NULL && RCS_datecmp (vers->date, date) <= 0))
return (xstrdup (vers->version));
else
return (NULL);
}
/*
* Look up the last element on a branch that was put in before the specified
* date (return the rev or NULL)
*/
static char *
RCS_getdatebranch (rcs, date, branch)
RCSNode *rcs;
char *date;
char *branch;
{
char *cur_rev = NULL;
char *cp;
char *xbranch, *xrev;
Node *p;
RCSVers *vers;
/* look up the first revision on the branch */
xrev = xstrdup (branch);
cp = strrchr (xrev, '.');
if (cp == NULL)
{
free (xrev);
return (NULL);
}
*cp = '\0'; /* turn it into a revision */
assert (rcs != NULL);
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
p = findnode (rcs->versions, xrev);
free (xrev);
if (p == NULL)
return (NULL);
vers = (RCSVers *) p->data;
/* Tentatively use this revision, if it is early enough. */
if (RCS_datecmp (vers->date, date) <= 0)
cur_rev = vers->version;
/* If no branches list, return now. This is what happens if the branch
is a (magic) branch with no revisions yet. */
if (vers->branches == NULL)
return xstrdup (cur_rev);
/* walk the branches list looking for the branch number */
xbranch = xmalloc (strlen (branch) + 1 + 1); /* +1 for the extra dot */
(void) strcpy (xbranch, branch);
(void) strcat (xbranch, ".");
for (p = vers->branches->list->next; p != vers->branches->list; p = p->next)
if (strncmp (p->key, xbranch, strlen (xbranch)) == 0)
break;
free (xbranch);
if (p == vers->branches->list)
{
/* This is what happens if the branch is a (magic) branch with
no revisions yet. Similar to the case where vers->branches ==
NULL, except here there was a another branch off the same
branchpoint. */
return xstrdup (cur_rev);
}
p = findnode (rcs->versions, p->key);
/* walk the next pointers until you find the end, or the date is too late */
while (p != NULL)
{
vers = (RCSVers *) p->data;
if (RCS_datecmp (vers->date, date) <= 0)
cur_rev = vers->version;
else
break;
/* if there is a next version, find the node */
if (vers->next != NULL)
p = findnode (rcs->versions, vers->next);
else
p = (Node *) NULL;
}
/* Return whatever we found, which may be NULL. */
return xstrdup (cur_rev);
}
/*
* Compare two dates in RCS format. Beware the change in format on January 1,
* 2000, when years go from 2-digit to full format.
*/
int
RCS_datecmp (date1, date2)
char *date1, *date2;
{
int length_diff = strlen (date1) - strlen (date2);
return (length_diff ? length_diff : strcmp (date1, date2));
}
/* Look up revision REV in RCS and return the date specified for the
revision minus FUDGE seconds (FUDGE will generally be one, so that the
logically previous revision will be found later, or zero, if we want
the exact date).
The return value is the date being returned as a time_t, or (time_t)-1
on error (previously was documented as zero on error; I haven't checked
the callers to make sure that they really check for (time_t)-1, but
the latter is what this function really returns). If DATE is non-NULL,
then it must point to MAXDATELEN characters, and we store the same
return value there in DATEFORM format. */
time_t
RCS_getrevtime (rcs, rev, date, fudge)
RCSNode *rcs;
char *rev;
char *date;
int fudge;
{
char tdate[MAXDATELEN];
struct tm xtm, *ftm;
time_t revdate = 0;
Node *p;
RCSVers *vers;
/* make sure we have something to look at... */
assert (rcs != NULL);
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
/* look up the revision */
p = findnode (rcs->versions, rev);
if (p == NULL)
return (-1);
vers = (RCSVers *) p->data;
/* split up the date */
ftm = &xtm;
(void) sscanf (vers->date, SDATEFORM, &ftm->tm_year, &ftm->tm_mon,
&ftm->tm_mday, &ftm->tm_hour, &ftm->tm_min,
&ftm->tm_sec);
/* If the year is from 1900 to 1999, RCS files contain only two
digits, and sscanf gives us a year from 0-99. If the year is
2000+, RCS files contain all four digits and we subtract 1900,
because the tm_year field should contain years since 1900. */
if (ftm->tm_year > 1900)
ftm->tm_year -= 1900;
/* put the date in a form getdate can grok */
(void) sprintf (tdate, "%d/%d/%d GMT %d:%d:%d", ftm->tm_mon,
ftm->tm_mday, ftm->tm_year + 1900, ftm->tm_hour,
ftm->tm_min, ftm->tm_sec);
/* turn it into seconds since the epoch */
revdate = get_date (tdate, (struct timeb *) NULL);
if (revdate != (time_t) -1)
{
revdate -= fudge; /* remove "fudge" seconds */
if (date)
{
/* put an appropriate string into ``date'' if we were given one */
ftm = gmtime (&revdate);
(void) sprintf (date, DATEFORM,
ftm->tm_year + (ftm->tm_year < 100 ? 0 : 1900),
ftm->tm_mon + 1, ftm->tm_mday, ftm->tm_hour,
ftm->tm_min, ftm->tm_sec);
}
}
return (revdate);
}
List *
RCS_getlocks (rcs)
RCSNode *rcs;
{
assert(rcs != NULL);
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
if (rcs->locks_data) {
rcs->locks = getlist ();
do_locks (rcs->locks, rcs->locks_data);
free(rcs->locks_data);
rcs->locks_data = NULL;
}
return rcs->locks;
}
List *
RCS_symbols(rcs)
RCSNode *rcs;
{
assert(rcs != NULL);
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
if (rcs->symbols_data) {
rcs->symbols = getlist ();
do_symbols (rcs->symbols, rcs->symbols_data);
free(rcs->symbols_data);
rcs->symbols_data = NULL;
}
return rcs->symbols;
}
/*
* Return the version associated with a particular symbolic tag.
* Returns NULL or a newly malloc'd string.
*/
static char *
translate_symtag (rcs, tag)
RCSNode *rcs;
const char *tag;
{
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
if (rcs->symbols != NULL)
{
Node *p;
/* The symbols have already been converted into a list. */
p = findnode (rcs->symbols, tag);
if (p == NULL)
return NULL;
return xstrdup (p->data);
}
if (rcs->symbols_data != NULL)
{
size_t len;
char *cp;
/* Look through the RCS symbols information. This is like
do_symbols, but we don't add the information to a list. In
most cases, we will only be called once for this file, so
generating the list is unnecessary overhead. */
len = strlen (tag);
cp = rcs->symbols_data;
while ((cp = strchr (cp, tag[0])) != NULL)
{
if ((cp == rcs->symbols_data || whitespace (cp[-1]))
&& strncmp (cp, tag, len) == 0
&& cp[len] == ':')
{
char *v, *r;
/* We found the tag. Return the version number. */
cp += len + 1;
v = cp;
while (! whitespace (*cp) && *cp != '\0')
++cp;
r = xmalloc (cp - v + 1);
strncpy (r, v, cp - v);
r[cp - v] = '\0';
return r;
}
while (! whitespace (*cp) && *cp != '\0')
++cp;
if (*cp == '\0')
break;
}
}
return NULL;
}
/*
* The argument ARG is the getopt remainder of the -k option specified on the
* command line. This function returns malloc'ed space that can be used
* directly in calls to RCS V5, with the -k flag munged correctly.
*/
char *
RCS_check_kflag (arg)
const char *arg;
{
static const char *const keyword_usage[] =
{
"%s %s: invalid RCS keyword expansion mode\n",
"Valid expansion modes include:\n",
" -kkv\tGenerate keywords using the default form.\n",
" -kkvl\tLike -kkv, except locker's name inserted.\n",
" -kk\tGenerate only keyword names in keyword strings.\n",
" -kv\tGenerate only keyword values in keyword strings.\n",
" -ko\tGenerate the old keyword string (no changes from checked in file).\n",
" -kb\tGenerate binary file unmodified (merges not allowed) (RCS 5.7).\n",
"(Specify the --help global option for a list of other help options)\n",
NULL,
};
/* Big enough to hold any of the strings from kflags. */
char karg[10];
char const *const *cpp = NULL;
if (arg)
{
for (cpp = kflags; *cpp != NULL; cpp++)
{
if (STREQ (arg, *cpp))
break;
}
}
if (arg == NULL || *cpp == NULL)
{
usage (keyword_usage);
}
(void) sprintf (karg, "-k%s", *cpp);
return (xstrdup (karg));
}
/*
* Do some consistency checks on the symbolic tag... These should equate
* pretty close to what RCS checks, though I don't know for certain.
*/
void
RCS_check_tag (tag)
const char *tag;
{
char *invalid = "$,.:;@"; /* invalid RCS tag characters */
const char *cp;
/*
* The first character must be an alphabetic letter. The remaining
* characters cannot be non-visible graphic characters, and must not be
* in the set of "invalid" RCS identifier characters.
*/
if (isalpha ((unsigned char) *tag))
{
for (cp = tag; *cp; cp++)
{
if (!isgraph ((unsigned char) *cp))
error (1, 0, "tag `%s' has non-visible graphic characters",
tag);
if (strchr (invalid, *cp))
error (1, 0, "tag `%s' must not contain the characters `%s'",
tag, invalid);
}
}
else
error (1, 0, "tag `%s' must start with a letter", tag);
}
/*
* TRUE if argument has valid syntax for an RCS revision or
* branch number. All characters must be digits or dots, first
* and last characters must be digits, and no two consecutive
* characters may be dots.
*
* Intended for classifying things, so this function doesn't
* call error.
*/
int
RCS_valid_rev (rev)
char *rev;
{
char last, c;
last = *rev++;
if (!isdigit ((unsigned char) last))
return 0;
while ((c = *rev++)) /* Extra parens placate -Wall gcc option */
{
if (c == '.')
{
if (last == '.')
return 0;
continue;
}
last = c;
if (!isdigit ((unsigned char) c))
return 0;
}
if (!isdigit ((unsigned char) last))
return 0;
return 1;
}
/*
* Return true if RCS revision with TAG is a dead revision.
*/
int
RCS_isdead (rcs, tag)
RCSNode *rcs;
const char *tag;
{
Node *p;
RCSVers *version;
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
p = findnode (rcs->versions, tag);
if (p == NULL)
return (0);
version = (RCSVers *) p->data;
return (version->dead);
}
/* Return the RCS keyword expansion mode. For example "b" for binary.
Returns a pointer into storage which is allocated and freed along with
the rest of the RCS information; the caller should not modify this
storage. Returns NULL if the RCS file does not specify a keyword
expansion mode; for all other errors, die with a fatal error. */
char *
RCS_getexpand (rcs)
RCSNode *rcs;
{
/* Since RCS_parsercsfile_i now reads expand, don't need to worry
about RCS_reparsercsfile. */
assert (rcs != NULL);
return rcs->expand;
}
/* Set keyword expansion mode to EXPAND. For example "b" for binary. */
void
RCS_setexpand (rcs, expand)
RCSNode *rcs;
char *expand;
{
/* Since RCS_parsercsfile_i now reads expand, don't need to worry
about RCS_reparsercsfile. */
assert (rcs != NULL);
if (rcs->expand != NULL)
free (rcs->expand);
rcs->expand = xstrdup (expand);
}
/* RCS keywords, and a matching enum. */
struct rcs_keyword
{
const char *string;
size_t len;
int expandit;
};
#define KEYWORD_INIT(s) (s), sizeof (s) - 1
static struct rcs_keyword keywords[] =
{
{ KEYWORD_INIT ("Author"), 1 },
{ KEYWORD_INIT ("Date"), 1 },
{ KEYWORD_INIT ("CVSHeader"), 1 },
{ KEYWORD_INIT ("Header"), 1 },
{ KEYWORD_INIT ("Id"), 1 },
{ KEYWORD_INIT ("Locker"), 1 },
{ KEYWORD_INIT ("Log"), 1 },
{ KEYWORD_INIT ("Name"), 1 },
{ KEYWORD_INIT ("RCSfile"), 1 },
{ KEYWORD_INIT ("Revision"), 1 },
{ KEYWORD_INIT ("Source"), 1 },
{ KEYWORD_INIT ("State"), 1 },
{ NULL, 0, 0 },
{ NULL, 0, 0 }
};
enum keyword
{
KEYWORD_AUTHOR = 0,
KEYWORD_DATE,
KEYWORD_CVSHEADER,
KEYWORD_HEADER,
KEYWORD_ID,
KEYWORD_LOCKER,
KEYWORD_LOG,
KEYWORD_NAME,
KEYWORD_RCSFILE,
KEYWORD_REVISION,
KEYWORD_SOURCE,
KEYWORD_STATE,
KEYWORD_LOCALID
};
enum keyword keyword_local = KEYWORD_ID;
/* Convert an RCS date string into a readable string. This is like
the RCS date2str function. */
static char *
printable_date (rcs_date)
const char *rcs_date;
{
int year, mon, mday, hour, min, sec;
char buf[100];
(void) sscanf (rcs_date, SDATEFORM, &year, &mon, &mday, &hour, &min,
&sec);
if (year < 1900)
year += 1900;
sprintf (buf, "%04d/%02d/%02d %02d:%02d:%02d", year, mon, mday,
hour, min, sec);
return xstrdup (buf);
}
/* Escape the characters in a string so that it can be included in an
RCS value. */
static char *
escape_keyword_value (value, free_value)
const char *value;
int *free_value;
{
char *ret, *t;
const char *s;
for (s = value; *s != '\0'; s++)
{
char c;
c = *s;
if (c == '\t'
|| c == '\n'
|| c == '\\'
|| c == ' '
|| c == '$')
{
break;
}
}
if (*s == '\0')
{
*free_value = 0;
return (char *) value;
}
ret = xmalloc (strlen (value) * 4 + 1);
*free_value = 1;
for (s = value, t = ret; *s != '\0'; s++, t++)
{
switch (*s)
{
default:
*t = *s;
break;
case '\t':
*t++ = '\\';
*t = 't';
break;
case '\n':
*t++ = '\\';
*t = 'n';
break;
case '\\':
*t++ = '\\';
*t = '\\';
break;
case ' ':
*t++ = '\\';
*t++ = '0';
*t++ = '4';
*t = '0';
break;
case '$':
*t++ = '\\';
*t++ = '0';
*t++ = '4';
*t = '4';
break;
}
}
*t = '\0';
return ret;
}
/* Expand RCS keywords in the memory buffer BUF of length LEN. This
applies to file RCS and version VERS. If NAME is not NULL, and is
not a numeric revision, then it is the symbolic tag used for the
checkout. EXPAND indicates how to expand the keywords. This
function sets *RETBUF and *RETLEN to the new buffer and length.
This function may modify the buffer BUF. If BUF != *RETBUF, then
RETBUF is a newly allocated buffer. */
static void
expand_keywords (rcs, ver, name, log, loglen, expand, buf, len, retbuf, retlen)
RCSNode *rcs;
RCSVers *ver;
const char *name;
const char *log;
size_t loglen;
enum kflag expand;
char *buf;
size_t len;
char **retbuf;
size_t *retlen;
{
struct expand_buffer
{
struct expand_buffer *next;
char *data;
size_t len;
int free_data;
} *ebufs = NULL;
struct expand_buffer *ebuf_last = NULL;
size_t ebuf_len = 0;
char *locker;
char *srch, *srch_next;
size_t srch_len;
if (expand == KFLAG_O || expand == KFLAG_B)
{
*retbuf = buf;
*retlen = len;
return;
}
/* If we are using -kkvl, dig out the locker information if any. */
locker = NULL;
if (expand == KFLAG_KVL)
{
Node *lock;
lock = findnode (RCS_getlocks(rcs), ver->version);
if (lock != NULL)
locker = xstrdup (lock->data);
}
/* RCS keywords look like $STRING$ or $STRING: VALUE$. */
srch = buf;
srch_len = len;
while ((srch_next = memchr (srch, '$', srch_len)) != NULL)
{
char *s, *send;
size_t slen;
const struct rcs_keyword *keyword;
enum keyword kw;
char *value;
int free_value;
char *sub;
size_t sublen;
srch_len -= (srch_next + 1) - srch;
srch = srch_next + 1;
/* Look for the first non alphabetic character after the '$'. */
send = srch + srch_len;
for (s = srch; s < send; s++)
if (! isalpha ((unsigned char) *s))
break;
/* If the first non alphabetic character is not '$' or ':',
then this is not an RCS keyword. */
if (s == send || (*s != '$' && *s != ':'))
continue;
/* See if this is one of the keywords. */
slen = s - srch;
for (keyword = keywords; keyword->string != NULL; keyword++)
{
if (keyword->expandit
&& keyword->len == slen
&& strncmp (keyword->string, srch, slen) == 0)
{
break;
}
}
if (keyword->string == NULL)
continue;
kw = (enum keyword) (keyword - keywords);
/* If the keyword ends with a ':', then the old value consists
of the characters up to the next '$'. If there is no '$'
before the end of the line, though, then this wasn't an RCS
keyword after all. */
if (*s == ':')
{
for (; s < send; s++)
if (*s == '$' || *s == '\n')
break;
if (s == send || *s != '$')
continue;
}
/* At this point we must replace the string from SRCH to S
with the expansion of the keyword KW. */
/* Get the value to use. */
free_value = 0;
if (expand == KFLAG_K)
value = NULL;
else
{
switch (kw)
{
default:
abort ();
case KEYWORD_AUTHOR:
value = ver->author;
break;
case KEYWORD_DATE:
value = printable_date (ver->date);
free_value = 1;
break;
case KEYWORD_CVSHEADER:
case KEYWORD_HEADER:
case KEYWORD_ID:
case KEYWORD_LOCALID:
{
char *path;
int free_path;
char *date;
char *old_path;
old_path = NULL;
if (kw == KEYWORD_HEADER ||
(kw == KEYWORD_LOCALID &&
keyword_local == KEYWORD_HEADER))
path = rcs->path;
else if (kw == KEYWORD_CVSHEADER ||
(kw == KEYWORD_LOCALID &&
keyword_local == KEYWORD_CVSHEADER))
path = getfullCVSname(rcs->path, &old_path);
else
path = last_component (rcs->path);
path = escape_keyword_value (path, &free_path);
date = printable_date (ver->date);
value = xmalloc (strlen (path)
+ strlen (ver->version)
+ strlen (date)
+ strlen (ver->author)
+ strlen (ver->state)
+ (locker == NULL ? 0 : strlen (locker))
+ 20);
sprintf (value, "%s %s %s %s %s%s%s",
path, ver->version, date, ver->author,
ver->state,
locker != NULL ? " " : "",
locker != NULL ? locker : "");
if (free_path)
free (path);
if (old_path)
free (old_path);
free (date);
free_value = 1;
}
break;
case KEYWORD_LOCKER:
value = locker;
break;
case KEYWORD_LOG:
case KEYWORD_RCSFILE:
value = escape_keyword_value (last_component (rcs->path),
&free_value);
break;
case KEYWORD_NAME:
if (name != NULL && ! isdigit ((unsigned char) *name))
value = (char *) name;
else
value = NULL;
break;
case KEYWORD_REVISION:
value = ver->version;
break;
case KEYWORD_SOURCE:
value = escape_keyword_value (rcs->path, &free_value);
break;
case KEYWORD_STATE:
value = ver->state;
break;
}
}
sub = xmalloc (keyword->len
+ (value == NULL ? 0 : strlen (value))
+ 10);
if (expand == KFLAG_V)
{
/* Decrement SRCH and increment S to remove the $
characters. */
--srch;
++srch_len;
++s;
sublen = 0;
}
else
{
strcpy (sub, keyword->string);
sublen = strlen (keyword->string);
if (expand != KFLAG_K)
{
sub[sublen] = ':';
sub[sublen + 1] = ' ';
sublen += 2;
}
}
if (value != NULL)
{
strcpy (sub + sublen, value);
sublen += strlen (value);
}
if (expand != KFLAG_V && expand != KFLAG_K)
{
sub[sublen] = ' ';
++sublen;
sub[sublen] = '\0';
}
if (free_value)
free (value);
/* The Log keyword requires special handling. This behaviour
is taken from RCS 5.7. The special log message is what RCS
uses for ci -k. */
if (kw == KEYWORD_LOG
&& (sizeof "checked in with -k by " <= loglen
|| log == NULL
|| strncmp (log, "checked in with -k by ",
sizeof "checked in with -k by " - 1) != 0))
{
char *start;
char *leader;
size_t leader_len, leader_sp_len;
const char *logend;
const char *snl;
int cnl;
char *date;
const char *sl;
/* We are going to insert the trailing $ ourselves, before
the log message, so we must remove it from S, if we
haven't done so already. */
if (expand != KFLAG_V)
++s;
/* CVS never has empty log messages, but old RCS files might. */
if (log == NULL)
log = "";
/* Find the start of the line. */
start = srch;
while (start > buf && start[-1] != '\n')
--start;
/* Copy the start of the line to use as a comment leader. */
leader_len = srch - start;
if (expand != KFLAG_V)
--leader_len;
leader = xmalloc (leader_len);
memcpy (leader, start, leader_len);
leader_sp_len = leader_len;
while (leader_sp_len > 0 && leader[leader_sp_len - 1] == ' ')
--leader_sp_len;
/* RCS does some checking for an old style of Log here,
but we don't bother. RCS issues a warning if it
changes anything. */
/* Count the number of newlines in the log message so that
we know how many copies of the leader we will need. */
cnl = 0;
logend = log + loglen;
for (snl = log; snl < logend; snl++)
if (*snl == '\n')
++cnl;
date = printable_date (ver->date);
sub = xrealloc (sub,
(sublen
+ sizeof "Revision"
+ strlen (ver->version)
+ strlen (date)
+ strlen (ver->author)
+ loglen
+ (cnl + 2) * leader_len
+ 20));
if (expand != KFLAG_V)
{
sub[sublen] = '$';
++sublen;
}
sub[sublen] = '\n';
++sublen;
memcpy (sub + sublen, leader, leader_len);
sublen += leader_len;
sprintf (sub + sublen, "Revision %s %s %s\n",
ver->version, date, ver->author);
sublen += strlen (sub + sublen);
free (date);
sl = log;
while (sl < logend)
{
if (*sl == '\n')
{
memcpy (sub + sublen, leader, leader_sp_len);
sublen += leader_sp_len;
sub[sublen] = '\n';
++sublen;
++sl;
}
else
{
const char *slnl;
memcpy (sub + sublen, leader, leader_len);
sublen += leader_len;
for (slnl = sl; slnl < logend && *slnl != '\n'; ++slnl)
;
if (slnl < logend)
++slnl;
memcpy (sub + sublen, sl, slnl - sl);
sublen += slnl - sl;
sl = slnl;
}
}
memcpy (sub + sublen, leader, leader_sp_len);
sublen += leader_sp_len;
free (leader);
}
/* Now SUB contains a string which is to replace the string
from SRCH to S. SUBLEN is the length of SUB. */
if (srch + sublen == s)
{
memcpy (srch, sub, sublen);
free (sub);
}
else
{
struct expand_buffer *ebuf;
/* We need to change the size of the buffer. We build a
list of expand_buffer structures. Each expand_buffer
structure represents a portion of the final output. We
concatenate them back into a single buffer when we are
done. This minimizes the number of potentially large
buffer copies we must do. */
if (ebufs == NULL)
{
ebufs = (struct expand_buffer *) xmalloc (sizeof *ebuf);
ebufs->next = NULL;
ebufs->data = buf;
ebufs->free_data = 0;
ebuf_len = srch - buf;
ebufs->len = ebuf_len;
ebuf_last = ebufs;
}
else
{
assert (srch >= ebuf_last->data);
assert (srch <= ebuf_last->data + ebuf_last->len);
ebuf_len -= ebuf_last->len - (srch - ebuf_last->data);
ebuf_last->len = srch - ebuf_last->data;
}
ebuf = (struct expand_buffer *) xmalloc (sizeof *ebuf);
ebuf->data = sub;
ebuf->len = sublen;
ebuf->free_data = 1;
ebuf->next = NULL;
ebuf_last->next = ebuf;
ebuf_last = ebuf;
ebuf_len += sublen;
ebuf = (struct expand_buffer *) xmalloc (sizeof *ebuf);
ebuf->data = s;
ebuf->len = srch_len - (s - srch);
ebuf->free_data = 0;
ebuf->next = NULL;
ebuf_last->next = ebuf;
ebuf_last = ebuf;
ebuf_len += srch_len - (s - srch);
}
srch_len -= (s - srch);
srch = s;
}
if (locker != NULL)
free (locker);
if (ebufs == NULL)
{
*retbuf = buf;
*retlen = len;
}
else
{
char *ret;
ret = xmalloc (ebuf_len);
*retbuf = ret;
*retlen = ebuf_len;
while (ebufs != NULL)
{
struct expand_buffer *next;
memcpy (ret, ebufs->data, ebufs->len);
ret += ebufs->len;
if (ebufs->free_data)
free (ebufs->data);
next = ebufs->next;
free (ebufs);
ebufs = next;
}
}
}
/* Check out a revision from an RCS file.
If PFN is not NULL, then ignore WORKFILE and SOUT. Call PFN zero
or more times with the contents of the file. CALLERDAT is passed,
uninterpreted, to PFN. (The current code will always call PFN
exactly once for a non empty file; however, the current code
assumes that it can hold the entire file contents in memory, which
is not a good assumption, and might change in the future).
Otherwise, if WORKFILE is not NULL, check out the revision to
WORKFILE. However, if WORKFILE is not NULL, and noexec is set,
then don't do anything.
Otherwise, if WORKFILE is NULL, check out the revision to SOUT. If
SOUT is RUN_TTY, then write the contents of the revision to
standard output. When using SOUT, the output is generally a
temporary file; don't bother to get the file modes correct.
REV is the numeric revision to check out. It may be NULL, which
means to check out the head of the default branch.
If NAMETAG is not NULL, and is not a numeric revision, then it is
the tag that should be used when expanding the RCS Name keyword.
OPTIONS is a string such as "-kb" or "-kv" for keyword expansion
options. It may be NULL to use the default expansion mode of the
file, typically "-kkv".
On an error which prevented checking out the file, either print a
nonfatal error and return 1, or give a fatal error. On success,
return 0. */
/* This function mimics the behavior of `rcs co' almost exactly. The
chief difference is in its support for preserving file ownership,
permissions, and special files across checkin and checkout -- see
comments in RCS_checkin for some issues about this. -twp */
int
RCS_checkout (rcs, workfile, rev, nametag, options, sout, pfn, callerdat)
RCSNode *rcs;
char *workfile;
char *rev;
char *nametag;
char *options;
char *sout;
RCSCHECKOUTPROC pfn;
void *callerdat;
{
int free_rev = 0;
enum kflag expand;
FILE *fp, *ofp;
struct stat sb;
struct rcsbuffer rcsbuf;
char *key;
char *value;
size_t len;
int free_value = 0;
char *log = NULL;
size_t loglen;
Node *vp = NULL;
#ifdef PRESERVE_PERMISSIONS_SUPPORT
uid_t rcs_owner = (uid_t) -1;
gid_t rcs_group = (gid_t) -1;
mode_t rcs_mode;
int change_rcs_owner_or_group = 0;
int change_rcs_mode = 0;
int special_file = 0;
unsigned long devnum_long;
dev_t devnum = 0;
#endif
if (trace)
{
(void) fprintf (stderr, "%s-> checkout (%s, %s, %s, %s)\n",
#ifdef SERVER_SUPPORT
server_active ? "S" : " ",
#else
"",
#endif
rcs->path,
rev != NULL ? rev : "",
options != NULL ? options : "",
(pfn != NULL ? "(function)"
: (workfile != NULL
? workfile
: (sout != RUN_TTY ? sout : "(stdout)"))));
}
assert (rev == NULL || isdigit ((unsigned char) *rev));
if (noexec && workfile != NULL)
return 0;
assert (sout == RUN_TTY || workfile == NULL);
assert (pfn == NULL || (sout == RUN_TTY && workfile == NULL));
/* Some callers, such as Checkin or remove_file, will pass us a
branch. */
if (rev != NULL && (numdots (rev) & 1) == 0)
{
rev = RCS_getbranch (rcs, rev, 1);
if (rev == NULL)
error (1, 0, "internal error: bad branch tag in checkout");
free_rev = 1;
}
if (rev == NULL || STREQ (rev, rcs->head))
{
int gothead;
/* We want the head revision. Try to read it directly. */
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, &fp, &rcsbuf);
else
rcsbuf_cache_open (rcs, rcs->delta_pos, &fp, &rcsbuf);
gothead = 0;
if (! rcsbuf_getrevnum (&rcsbuf, &key))
error (1, 0, "unexpected EOF reading %s", rcs->path);
while (rcsbuf_getkey (&rcsbuf, &key, &value))
{
if (STREQ (key, "log"))
log = rcsbuf_valcopy (&rcsbuf, value, 0, &loglen);
else if (STREQ (key, "text"))
{
gothead = 1;
break;
}
}
if (! gothead)
{
error (0, 0, "internal error: cannot find head text");
if (free_rev)
free (rev);
return 1;
}
rcsbuf_valpolish (&rcsbuf, value, 0, &len);
if (fstat (fileno (fp), &sb) < 0)
error (1, errno, "cannot fstat %s", rcs->path);
rcsbuf_cache (rcs, &rcsbuf);
}
else
{
struct rcsbuffer *rcsbufp;
/* It isn't the head revision of the trunk. We'll need to
walk through the deltas. */
fp = NULL;
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, &fp, &rcsbuf);
if (fp == NULL)
{
/* If RCS_deltas didn't close the file, we could use fstat
here too. Probably should change it thusly.... */
if (stat (rcs->path, &sb) < 0)
error (1, errno, "cannot stat %s", rcs->path);
rcsbufp = NULL;
}
else
{
if (fstat (fileno (fp), &sb) < 0)
error (1, errno, "cannot fstat %s", rcs->path);
rcsbufp = &rcsbuf;
}
RCS_deltas (rcs, fp, rcsbufp, rev, RCS_FETCH, &value, &len,
&log, &loglen);
free_value = 1;
}
/* If OPTIONS is NULL or the empty string, then the old code would
invoke the RCS co program with no -k option, which means that
co would use the string we have stored in rcs->expand. */
if ((options == NULL || options[0] == '\0') && rcs->expand == NULL)
expand = KFLAG_KV;
else
{
const char *ouroptions;
const char * const *cpp;
if (options != NULL && options[0] != '\0')
{
assert (options[0] == '-' && options[1] == 'k');
ouroptions = options + 2;
}
else
ouroptions = rcs->expand;
for (cpp = kflags; *cpp != NULL; cpp++)
if (STREQ (*cpp, ouroptions))
break;
if (*cpp != NULL)
expand = (enum kflag) (cpp - kflags);
else
{
error (0, 0,
"internal error: unsupported substitution string -k%s",
ouroptions);
expand = KFLAG_KV;
}
}
#ifdef PRESERVE_PERMISSIONS_SUPPORT
/* Handle special files and permissions, if that is desired. */
if (preserve_perms)
{
RCSVers *vers;
Node *info;
vp = findnode (rcs->versions, rev == NULL ? rcs->head : rev);
if (vp == NULL)
error (1, 0, "internal error: no revision information for %s",
rev == NULL ? rcs->head : rev);
vers = (RCSVers *) vp->data;
/* First we look for symlinks, which are simplest to handle. */
info = findnode (vers->other_delta, "symlink");
if (info != NULL)
{
char *dest;
if (pfn != NULL || (workfile == NULL && sout == RUN_TTY))
error (1, 0, "symbolic link %s:%s cannot be piped",
rcs->path, vers->version);
if (workfile == NULL)
dest = sout;
else
dest = workfile;
/* Remove `dest', just in case. It's okay to get ENOENT here,
since we just want the file not to be there. (TODO: decide
whether it should be considered an error for `dest' to exist
at this point. If so, the unlink call should be removed and
`symlink' should signal the error. -twp) */
if (CVS_UNLINK (dest) < 0 && !existence_error (errno))
error (1, errno, "cannot remove %s", dest);
if (symlink (info->data, dest) < 0)
error (1, errno, "cannot create symbolic link from %s to %s",
dest, info->data);
if (free_value)
free (value);
if (free_rev)
free (rev);
return 0;
}
/* Next, we look at this file's hardlinks field, and see whether
it is linked to any other file that has been checked out.
If so, we don't do anything else -- just link it to that file.
If we are checking out a file to a pipe or temporary storage,
none of this should matter. Hence the `workfile != NULL'
wrapper around the whole thing. -twp */
if (workfile != NULL)
{
List *links = vers->hardlinks;
if (links != NULL)
{
Node *uptodate_link;
/* For each file in the hardlinks field, check to see
if it exists, and if so, if it has been checked out
this iteration. When walklist returns, uptodate_link
should point to a hardlist node representing a file
in `links' which has recently been checked out, or
NULL if no file in `links' has yet been checked out. */
uptodate_link = NULL;
(void) walklist (links, find_checkedout_proc, &uptodate_link);
dellist (&links);
/* If we've found a file that `workfile' is supposed to be
linked to, and it has been checked out since CVS was
invoked, then simply link workfile to that file and return.
If one of these conditions is not met, then
workfile is the first one in its hardlink group to
be checked out, and we must continue with a full
checkout. */
if (uptodate_link != NULL)
{
struct hardlink_info *hlinfo =
(struct hardlink_info *) uptodate_link->data;
if (link (uptodate_link->key, workfile) < 0)
error (1, errno, "cannot link %s to %s",
workfile, uptodate_link->key);
hlinfo->checked_out = 1; /* probably unnecessary */
if (free_value)
free (value);
if (free_rev)
free (rev);
return 0;
}
}
}
info = findnode (vers->other_delta, "owner");
if (info != NULL)
{
change_rcs_owner_or_group = 1;
rcs_owner = (uid_t) strtoul (info->data, NULL, 10);
}
info = findnode (vers->other_delta, "group");
if (info != NULL)
{
change_rcs_owner_or_group = 1;
rcs_group = (gid_t) strtoul (info->data, NULL, 10);
}
info = findnode (vers->other_delta, "permissions");
if (info != NULL)
{
change_rcs_mode = 1;
rcs_mode = (mode_t) strtoul (info->data, NULL, 8);
}
info = findnode (vers->other_delta, "special");
if (info != NULL)
{
/* If the size of `devtype' changes, fix the sscanf call also */
char devtype[16];
if (sscanf (info->data, "%15s %lu",
devtype, &devnum_long) < 2)
error (1, 0, "%s:%s has bad `special' newphrase %s",
workfile, vers->version, info->data);
devnum = devnum_long;
if (STREQ (devtype, "character"))
special_file = S_IFCHR;
else if (STREQ (devtype, "block"))
special_file = S_IFBLK;
else
error (0, 0, "%s is a special file of unsupported type `%s'",
workfile, info->data);
}
}
#endif
if (expand != KFLAG_O && expand != KFLAG_B)
{
char *newvalue;
/* Don't fetch the delta node again if we already have it. */
if (vp == NULL)
{
vp = findnode (rcs->versions, rev == NULL ? rcs->head : rev);
if (vp == NULL)
error (1, 0, "internal error: no revision information for %s",
rev == NULL ? rcs->head : rev);
}
expand_keywords (rcs, (RCSVers *) vp->data, nametag, log, loglen,
expand, value, len, &newvalue, &len);
if (newvalue != value)
{
if (free_value)
free (value);
value = newvalue;
free_value = 1;
}
}
if (free_rev)
free (rev);
if (log != NULL)
{
free (log);
log = NULL;
}
if (pfn != NULL)
{
#ifdef PRESERVE_PERMISSIONS_SUPPORT
if (special_file)
error (1, 0, "special file %s cannot be piped to anything",
rcs->path);
#endif
/* The PFN interface is very simple to implement right now, as
we always have the entire file in memory. */
if (len != 0)
pfn (callerdat, value, len);
}
#ifdef PRESERVE_PERMISSIONS_SUPPORT
else if (special_file)
{
# ifdef HAVE_MKNOD
char *dest;
/* Can send either to WORKFILE or to SOUT, as long as SOUT is
not RUN_TTY. */
dest = workfile;
if (dest == NULL)
{
if (sout == RUN_TTY)
error (1, 0, "special file %s cannot be written to stdout",
rcs->path);
dest = sout;
}
/* Unlink `dest', just in case. It's okay if this provokes a
ENOENT error. */
if (CVS_UNLINK (dest) < 0 && existence_error (errno))
error (1, errno, "cannot remove %s", dest);
if (mknod (dest, special_file, devnum) < 0)
error (1, errno, "could not create special file %s",
dest);
# else
error (1, 0,
"cannot create %s: unable to create special files on this system",
workfile);
# endif
}
#endif
else
{
/* Not a special file: write to WORKFILE or SOUT. */
if (workfile == NULL)
{
if (sout == RUN_TTY)
ofp = stdout;
else
{
/* Symbolic links should be removed before replacement, so that
`fopen' doesn't follow the link and open the wrong file. */
if (islink (sout))
if (unlink_file (sout) < 0)
error (1, errno, "cannot remove %s", sout);
ofp = CVS_FOPEN (sout, expand == KFLAG_B ? "wb" : "w");
if (ofp == NULL)
error (1, errno, "cannot open %s", sout);
}
}
else
{
/* Output is supposed to go to WORKFILE, so we should open that
file. Symbolic links should be removed first (see above). */
if (islink (workfile))
if (unlink_file (workfile) < 0)
error (1, errno, "cannot remove %s", workfile);
ofp = CVS_FOPEN (workfile, expand == KFLAG_B ? "wb" : "w");
/* If the open failed because the existing workfile was not
writable, try to chmod the file and retry the open. */
if (ofp == NULL && errno == EACCES
&& isfile (workfile) && !iswritable (workfile))
{
xchmod (workfile, 1);
ofp = CVS_FOPEN (workfile, expand == KFLAG_B ? "wb" : "w");
}
if (ofp == NULL)
{
error (0, errno, "cannot open %s", workfile);
if (free_value)
free (value);
return 1;
}
}
if (workfile == NULL && sout == RUN_TTY)
{
if (expand == KFLAG_B)
cvs_output_binary (value, len);
else
{
/* cvs_output requires the caller to check for zero
length. */
if (len > 0)
cvs_output (value, len);
}
}
else
{
/* NT 4.0 is said to have trouble writing 2099999 bytes
(for example) in a single fwrite. So break it down
(there is no need to be writing that much at once
anyway; it is possible that LARGEST_FWRITE should be
somewhat larger for good performance, but for testing I
want to start with a small value until/unless a bigger
one proves useful). */
#define LARGEST_FWRITE 8192
size_t nleft = len;
size_t nstep = (len < LARGEST_FWRITE ? len : LARGEST_FWRITE);
char *p = value;
while (nleft > 0)
{
if (fwrite (p, 1, nstep, ofp) != nstep)
{
error (0, errno, "cannot write %s",
(workfile != NULL
? workfile
: (sout != RUN_TTY ? sout : "stdout")));
if (free_value)
free (value);
return 1;
}
p += nstep;
nleft -= nstep;
if (nleft < nstep)
nstep = nleft;
}
}
}
if (free_value)
free (value);
if (workfile != NULL)
{
int ret;
#ifdef PRESERVE_PERMISSIONS_SUPPORT
if (!special_file && fclose (ofp) < 0)
{
error (0, errno, "cannot close %s", workfile);
return 1;
}
if (change_rcs_owner_or_group)
{
if (chown (workfile, rcs_owner, rcs_group) < 0)
error (0, errno, "could not change owner or group of %s",
workfile);
}
ret = chmod (workfile,
change_rcs_mode
? rcs_mode
: sb.st_mode & ~(S_IWRITE | S_IWGRP | S_IWOTH));
#else
if (fclose (ofp) < 0)
{
error (0, errno, "cannot close %s", workfile);
return 1;
}
ret = chmod (workfile,
sb.st_mode & ~(S_IWRITE | S_IWGRP | S_IWOTH));
#endif
if (ret < 0)
{
error (0, errno, "cannot change mode of file %s",
workfile);
}
}
else if (sout != RUN_TTY)
{
if (
#ifdef PRESERVE_PERMISSIONS_SUPPORT
!special_file &&
#endif
fclose (ofp) < 0)
{
error (0, errno, "cannot close %s", sout);
return 1;
}
}
#ifdef PRESERVE_PERMISSIONS_SUPPORT
/* If we are in the business of preserving hardlinks, then
mark this file as having been checked out. */
if (preserve_perms && workfile != NULL)
update_hardlink_info (workfile);
#endif
return 0;
}
static RCSVers *RCS_findlock_or_tip PROTO ((RCSNode *rcs));
/* Find the delta currently locked by the user. From the `ci' man page:
"If rev is omitted, ci tries to derive the new revision
number from the caller's last lock. If the caller has
locked the tip revision of a branch, the new revision is
appended to that branch. The new revision number is
obtained by incrementing the tip revision number. If the
caller locked a non-tip revision, a new branch is started
at that revision by incrementing the highest branch number
at that revision. The default initial branch and level
numbers are 1.
If rev is omitted and the caller has no lock, but owns the
file and locking is not set to strict, then the revision
is appended to the default branch (normally the trunk; see
the -b option of rcs(1))."
RCS_findlock_or_tip finds the unique revision locked by the caller
and returns its delta node. If the caller has not locked any
revisions (and is permitted to commit to an unlocked delta, as
described above), return the tip of the default branch. */
static RCSVers *
RCS_findlock_or_tip (rcs)
RCSNode *rcs;
{
char *user = getcaller();
Node *lock, *p;
List *locklist;
/* Find unique delta locked by caller. This code is very similar
to the code in RCS_unlock -- perhaps it could be abstracted
into a RCS_findlock function. */
locklist = RCS_getlocks (rcs);
lock = NULL;
for (p = locklist->list->next; p != locklist->list; p = p->next)
{
if (STREQ (p->data, user))
{
if (lock != NULL)
{
error (0, 0, "\
%s: multiple revisions locked by %s; please specify one", rcs->path, user);
return NULL;
}
lock = p;
}
}
if (lock != NULL)
{
/* Found an old lock, but check that the revision still exists. */
p = findnode (rcs->versions, lock->key);
if (p == NULL)
{
error (0, 0, "%s: can't unlock nonexistent revision %s",
rcs->path,
lock->key);
return NULL;
}
return (RCSVers *) p->data;
}
/* No existing lock. The RCS rule is that this is an error unless
locking is nonstrict AND the file is owned by the current
user. Trying to determine the latter is a portability nightmare
in the face of NT, VMS, AFS, and other systems with non-unix-like
ideas of users and owners. In the case of CVS, we should never get
here (as long as the traditional behavior of making sure to call
RCS_lock persists). Anyway, we skip the RCS error checks
and just return the default branch or head. The reasoning is that
those error checks are to make users lock before a checkin, and we do
that in other ways if at all anyway (e.g. rcslock.pl). */
p = findnode (rcs->versions, RCS_getbranch (rcs, rcs->branch, 0));
return (RCSVers *) p->data;
}
/* Revision number string, R, must contain a `.'.
Return a newly-malloc'd copy of the prefix of R up
to but not including the final `.'. */
static char *
truncate_revnum (r)
const char *r;
{
size_t len;
char *new_r;
char *dot = strrchr (r, '.');
assert (dot);
len = dot - r;
new_r = xmalloc (len + 1);
memcpy (new_r, r, len);
*(new_r + len) = '\0';
return new_r;
}
/* Revision number string, R, must contain a `.'.
R must be writable. Replace the rightmost `.' in R with
the NUL byte and return a pointer to that NUL byte. */
static char *
truncate_revnum_in_place (r)
char *r;
{
char *dot = strrchr (r, '.');
assert (dot);
*dot = '\0';
return dot;
}
/* Revision number strings, R and S, must each contain a `.'.
R and S must be writable and must have the same number of dots.
Truncate R and S for the comparison, then restored them to their
original state.
Return the result (see compare_revnums) of comparing R and S
ignoring differences in any component after the rightmost `.'. */
static int
compare_truncated_revnums (r, s)
char *r;
char *s;
{
char *r_dot = truncate_revnum_in_place (r);
char *s_dot = truncate_revnum_in_place (s);
int cmp;
assert (numdots (r) == numdots (s));
cmp = compare_revnums (r, s);
*r_dot = '.';
*s_dot = '.';
return cmp;
}
/* Return a malloc'd copy of the string representing the highest branch
number on BRANCHNODE. If there are no branches on BRANCHNODE, return NULL.
FIXME: isn't the max rev always the last one?
If so, we don't even need a loop. */
static char *max_rev PROTO ((const RCSVers *));
static char *
max_rev (branchnode)
const RCSVers *branchnode;
{
Node *head;
Node *bp;
char *max;
if (branchnode->branches == NULL)
{
return NULL;
}
max = NULL;
head = branchnode->branches->list;
for (bp = head->next; bp != head; bp = bp->next)
{
if (max == NULL || compare_truncated_revnums (max, bp->key) < 0)
{
max = bp->key;
}
}
assert (max);
return truncate_revnum (max);
}
/* Create BRANCH in RCS's delta tree. BRANCH may be either a branch
number or a revision number. In the former case, create the branch
with the specified number; in the latter case, create a new branch
rooted at node BRANCH with a higher branch number than any others.
Return the number of the tip node on the new branch. */
static char *
RCS_addbranch (rcs, branch)
RCSNode *rcs;
const char *branch;
{
char *branchpoint, *newrevnum;
Node *nodep, *bp;
Node *marker;
RCSVers *branchnode;
/* Append to end by default. */
marker = NULL;
branchpoint = xstrdup (branch);
if ((numdots (branchpoint) & 1) == 0)
{
truncate_revnum_in_place (branchpoint);
}
/* Find the branch rooted at BRANCHPOINT. */
nodep = findnode (rcs->versions, branchpoint);
if (nodep == NULL)
{
error (0, 0, "%s: can't find branch point %s", rcs->path, branchpoint);
free (branchpoint);
return NULL;
}
free (branchpoint);
branchnode = (RCSVers *) nodep->data;
/* If BRANCH was a full branch number, make sure it is higher than MAX. */
if ((numdots (branch) & 1) == 1)
{
if (branchnode->branches == NULL)
{
/* We have to create the first branch on this node, which means
appending ".2" to the revision number. */
newrevnum = (char *) xmalloc (strlen (branch) + 3);
strcpy (newrevnum, branch);
strcat (newrevnum, ".2");
}
else
{
char *max = max_rev (branchnode);
assert (max);
newrevnum = increment_revnum (max);
free (max);
}
}
else
{
newrevnum = xstrdup (branch);
if (branchnode->branches != NULL)
{
Node *head;
Node *bp;
/* Find the position of this new branch in the sorted list
of branches. */
head = branchnode->branches->list;
for (bp = head->next; bp != head; bp = bp->next)
{
char *dot;
int found_pos;
/* The existing list must be sorted on increasing revnum. */
assert (bp->next == head
|| compare_truncated_revnums (bp->key,
bp->next->key) < 0);
dot = truncate_revnum_in_place (bp->key);
found_pos = (compare_revnums (branch, bp->key) < 0);
*dot = '.';
if (found_pos)
{
break;
}
}
marker = bp;
}
}
newrevnum = (char *) xrealloc (newrevnum, strlen (newrevnum) + 3);
strcat (newrevnum, ".1");
/* Add this new revision number to BRANCHPOINT's branches list. */
if (branchnode->branches == NULL)
branchnode->branches = getlist();
bp = getnode();
bp->key = xstrdup (newrevnum);
/* Append to the end of the list by default, that is, just before
the header node, `list'. */
if (marker == NULL)
marker = branchnode->branches->list;
{
int fail;
fail = insert_before (branchnode->branches, marker, bp);
assert (!fail);
}
return newrevnum;
}
/* Check in to RCSFILE with revision REV (which must be greater than
the largest revision) and message MESSAGE (which is checked for
legality). If FLAGS & RCS_FLAGS_DEAD, check in a dead revision.
If FLAGS & RCS_FLAGS_QUIET, tell ci to be quiet. If FLAGS &
RCS_FLAGS_MODTIME, use the working file's modification time for the
checkin time. WORKFILE is the working file to check in from, or
NULL to use the usual RCS rules for deriving it from the RCSFILE.
If FLAGS & RCS_FLAGS_KEEPFILE, don't unlink the working file;
unlinking the working file is standard RCS behavior, but is rarely
appropriate for CVS.
This function should almost exactly mimic the behavior of `rcs ci'. The
principal point of difference is the support here for preserving file
ownership and permissions in the delta nodes. This is not a clean
solution -- precisely because it diverges from RCS's behavior -- but
it doesn't seem feasible to do this anywhere else in the code. [-twp]
Return value is -1 for error (and errno is set to indicate the
error), positive for error (and an error message has been printed),
or zero for success. */
int
RCS_checkin (rcs, workfile, message, rev, flags)
RCSNode *rcs;
char *workfile;
char *message;
char *rev;
int flags;
{
RCSVers *delta, *commitpt;
Deltatext *dtext;
Node *nodep;
char *tmpfile, *changefile, *chtext;
char *diffopts;
size_t bufsize;
int buflen, chtextlen;
int status, checkin_quiet, allocated_workfile;
struct tm *ftm;
time_t modtime;
int adding_branch = 0;
#ifdef PRESERVE_PERMISSIONS_SUPPORT
struct stat sb;
#endif
commitpt = NULL;
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
/* Get basename of working file. Is there a library function to
do this? I couldn't find one. -twp */
allocated_workfile = 0;
if (workfile == NULL)
{
char *p;
int extlen = strlen (RCSEXT);
workfile = xstrdup (last_component (rcs->path));
p = workfile + (strlen (workfile) - extlen);
assert (strncmp (p, RCSEXT, extlen) == 0);
*p = '\0';
allocated_workfile = 1;
}
/* If the filename is a symbolic link, follow it and replace it
with the destination of the link. We need to do this before
calling rcs_internal_lockfile, or else we won't put the lock in
the right place. */
resolve_symlink (&(rcs->path));
checkin_quiet = flags & RCS_FLAGS_QUIET;
if (!checkin_quiet)
{
cvs_output (rcs->path, 0);
cvs_output (" <-- ", 7);
cvs_output (workfile, 0);
cvs_output ("\n", 1);
}
/* Create new delta node. */
delta = (RCSVers *) xmalloc (sizeof (RCSVers));
memset (delta, 0, sizeof (RCSVers));
delta->author = xstrdup (getcaller ());
if (flags & RCS_FLAGS_MODTIME)
{
struct stat ws;
if (stat (workfile, &ws) < 0)
{
error (1, errno, "cannot stat %s", workfile);
}
modtime = ws.st_mtime;
}
else
(void) time (&modtime);
ftm = gmtime (&modtime);
delta->date = (char *) xmalloc (MAXDATELEN);
(void) sprintf (delta->date, DATEFORM,
ftm->tm_year + (ftm->tm_year < 100 ? 0 : 1900),
ftm->tm_mon + 1, ftm->tm_mday, ftm->tm_hour,
ftm->tm_min, ftm->tm_sec);
if (flags & RCS_FLAGS_DEAD)
{
delta->state = xstrdup (RCSDEAD);
delta->dead = 1;
}
else
delta->state = xstrdup ("Exp");
#ifdef PRESERVE_PERMISSIONS_SUPPORT
/* If permissions should be preserved on this project, then
save the permission info. */
if (preserve_perms)
{
Node *np;
char buf[64]; /* static buffer should be safe: see usage. -twp */
delta->other_delta = getlist();
if (CVS_LSTAT (workfile, &sb) < 0)
error (1, errno, "cannot lstat %s", workfile);
if (S_ISLNK (sb.st_mode))
{
np = getnode();
np->type = RCSFIELD;
np->key = xstrdup ("symlink");
np->data = xreadlink (workfile);
addnode (delta->other_delta, np);
}
else
{
(void) sprintf (buf, "%u", sb.st_uid);
np = getnode();
np->type = RCSFIELD;
np->key = xstrdup ("owner");
np->data = xstrdup (buf);
addnode (delta->other_delta, np);
(void) sprintf (buf, "%u", sb.st_gid);
np = getnode();
np->type = RCSFIELD;
np->key = xstrdup ("group");
np->data = xstrdup (buf);
addnode (delta->other_delta, np);
(void) sprintf (buf, "%o", sb.st_mode & 07777);
np = getnode();
np->type = RCSFIELD;
np->key = xstrdup ("permissions");
np->data = xstrdup (buf);
addnode (delta->other_delta, np);
/* Save device number. */
switch (sb.st_mode & S_IFMT)
{
case S_IFREG: break;
case S_IFCHR:
case S_IFBLK:
# ifdef HAVE_STRUCT_STAT_ST_RDEV
np = getnode();
np->type = RCSFIELD;
np->key = xstrdup ("special");
sprintf (buf, "%s %lu",
((sb.st_mode & S_IFMT) == S_IFCHR
? "character" : "block"),
(unsigned long) sb.st_rdev);
np->data = xstrdup (buf);
addnode (delta->other_delta, np);
# else
error (0, 0,
"can't preserve %s: unable to save device files on this system",
workfile);
# endif
break;
default:
error (0, 0, "special file %s has unknown type", workfile);
}
/* Save hardlinks. */
delta->hardlinks = list_linked_files_on_disk (workfile);
}
}
#endif
/* Create a new deltatext node. */
dtext = (Deltatext *) xmalloc (sizeof (Deltatext));
memset (dtext, 0, sizeof (Deltatext));
dtext->log = make_message_rcslegal (message);
/* If the delta tree is empty, then there's nothing to link the
new delta into. So make a new delta tree, snarf the working
file contents, and just write the new RCS file. */
if (rcs->head == NULL)
{
char *newrev;
FILE *fout;
/* Figure out what the first revision number should be. */
if (rev == NULL || *rev == '\0')
newrev = xstrdup ("1.1");
else if (numdots (rev) == 0)
{
newrev = (char *) xmalloc (strlen (rev) + 3);
strcpy (newrev, rev);
strcat (newrev, ".1");
}
else
newrev = xstrdup (rev);
/* Don't need to xstrdup NEWREV because it's already dynamic, and
not used for anything else. (Don't need to free it, either.) */
rcs->head = newrev;
delta->version = xstrdup (newrev);
nodep = getnode();
nodep->type = RCSVERS;
nodep->delproc = rcsvers_delproc;
nodep->data = (char *) delta;
nodep->key = delta->version;
(void) addnode (rcs->versions, nodep);
dtext->version = xstrdup (newrev);
bufsize = 0;
#ifdef PRESERVE_PERMISSIONS_SUPPORT
if (preserve_perms && !S_ISREG (sb.st_mode))
/* Pretend file is empty. */
bufsize = 0;
else
#endif
get_file (workfile, workfile,
rcs->expand != NULL && STREQ (rcs->expand, "b") ? "rb" : "r",
&dtext->text, &bufsize, &dtext->len);
if (!checkin_quiet)
{
cvs_output ("initial revision: ", 0);
cvs_output (rcs->head, 0);
cvs_output ("\n", 1);
}
/* We are probably about to invalidate any cached file. */
rcsbuf_cache_close ();
fout = rcs_internal_lockfile (rcs->path);
RCS_putadmin (rcs, fout);
RCS_putdtree (rcs, rcs->head, fout);
RCS_putdesc (rcs, fout);
rcs->delta_pos = ftell (fout);
if (rcs->delta_pos == -1)
error (1, errno, "cannot ftell for %s", rcs->path);
putdeltatext (fout, dtext);
rcs_internal_unlockfile (fout, rcs->path);
if ((flags & RCS_FLAGS_KEEPFILE) == 0)
{
if (unlink_file (workfile) < 0)
/* FIXME-update-dir: message does not include update_dir. */
error (0, errno, "cannot remove %s", workfile);
}
if (!checkin_quiet)
cvs_output ("done\n", 5);
status = 0;
goto checkin_done;
}
/* Derive a new revision number. From the `ci' man page:
"If rev is a revision number, it must be higher than the
latest one on the branch to which rev belongs, or must
start a new branch.
If rev is a branch rather than a revision number, the new
revision is appended to that branch. The level number is
obtained by incrementing the tip revision number of that
branch. If rev indicates a non-existing branch, that
branch is created with the initial revision numbered
rev.1."
RCS_findlock_or_tip handles the case where REV is omitted.
RCS 5.7 also permits REV to be "$" or to begin with a dot, but
we do not address those cases -- every routine that calls
RCS_checkin passes it a numeric revision. */
if (rev == NULL || *rev == '\0')
{
/* Figure out where the commit point is by looking for locks.
If the commit point is at the tip of a branch (or is the
head of the delta tree), then increment its revision number
to obtain the new revnum. Otherwise, start a new
branch. */
commitpt = RCS_findlock_or_tip (rcs);
if (commitpt == NULL)
{
status = 1;
goto checkin_done;
}
else if (commitpt->next == NULL
|| STREQ (commitpt->version, rcs->head))
delta->version = increment_revnum (commitpt->version);
else
delta->version = RCS_addbranch (rcs, commitpt->version);
}
else
{
/* REV is either a revision number or a branch number. Find the
tip of the target branch. */
char *branch, *tip, *newrev, *p;
int dots, isrevnum;
assert (isdigit ((unsigned char) *rev));
newrev = xstrdup (rev);
dots = numdots (newrev);
isrevnum = dots & 1;
branch = xstrdup (rev);
if (isrevnum)
{
p = strrchr (branch, '.');
*p = '\0';
}
/* Find the tip of the target branch. If we got a one- or two-digit
revision number, this will be the head of the tree. Exception:
if rev is a single-field revision equal to the branch number of
the trunk (usually "1") then we want to treat it like an ordinary
branch revision. */
if (dots == 0)
{
tip = xstrdup (rcs->head);
if (atoi (tip) != atoi (branch))
{
newrev = (char *) xrealloc (newrev, strlen (newrev) + 3);
strcat (newrev, ".1");
dots = isrevnum = 1;
}
}
else if (dots == 1)
tip = xstrdup (rcs->head);
else
tip = RCS_getbranch (rcs, branch, 1);
/* If the branch does not exist, and we were supplied an exact
revision number, signal an error. Otherwise, if we were
given only a branch number, create it and set COMMITPT to
the branch point. */
if (tip == NULL)
{
if (isrevnum)
{
error (0, 0, "%s: can't find branch point %s",
rcs->path, branch);
free (branch);
free (newrev);
status = 1;
goto checkin_done;
}
delta->version = RCS_addbranch (rcs, branch);
if (!delta->version)
{
free (branch);
free (newrev);
status = 1;
goto checkin_done;
}
adding_branch = 1;
p = strrchr (branch, '.');
*p = '\0';
tip = xstrdup (branch);
}
else
{
if (isrevnum)
{
/* NEWREV must be higher than TIP. */
if (compare_revnums (tip, newrev) >= 0)
{
error (0, 0,
"%s: revision %s too low; must be higher than %s",
rcs->path,
newrev, tip);
free (branch);
free (newrev);
free (tip);
status = 1;
goto checkin_done;
}
delta->version = xstrdup (newrev);
}
else
/* Just increment the tip number to get the new revision. */
delta->version = increment_revnum (tip);
}
nodep = findnode (rcs->versions, tip);
commitpt = (RCSVers *) nodep->data;
free (branch);
free (newrev);
free (tip);
}
assert (delta->version != NULL);
/* If COMMITPT is locked by us, break the lock. If it's locked
by someone else, signal an error. */
nodep = findnode (RCS_getlocks (rcs), commitpt->version);
if (nodep != NULL)
{
if (! STREQ (nodep->data, delta->author))
{
/* If we are adding a branch, then leave the old lock around.
That is sensible in the sense that when adding a branch,
we don't need to use the lock to tell us where to check
in. It is fishy in the sense that if it is our own lock,
we break it. However, this is the RCS 5.7 behavior (at
the end of addbranch in ci.c in RCS 5.7, it calls
removelock only if it is our own lock, not someone
else's). */
if (!adding_branch)
{
error (0, 0, "%s: revision %s locked by %s",
rcs->path,
nodep->key, nodep->data);
status = 1;
goto checkin_done;
}
}
else
delnode (nodep);
}
dtext->version = xstrdup (delta->version);
/* Obtain the change text for the new delta. If DELTA is to be the
new head of the tree, then its change text should be the contents
of the working file, and LEAFNODE's change text should be a diff.
Else, DELTA's change text should be a diff between LEAFNODE and
the working file. */
tmpfile = cvs_temp_name();
status = RCS_checkout (rcs, NULL, commitpt->version, NULL,
((rcs->expand != NULL
&& STREQ (rcs->expand, "b"))
? "-kb"
: "-ko"),
tmpfile,
(RCSCHECKOUTPROC)0, NULL);
if (status != 0)
error (1, 0,
"could not check out revision %s of `%s'",
commitpt->version, rcs->path);
bufsize = buflen = 0;
chtext = NULL;
chtextlen = 0;
changefile = cvs_temp_name();
/* Diff options should include --binary if the RCS file has -kb set
in its `expand' field. */
diffopts = (rcs->expand != NULL && STREQ (rcs->expand, "b")
? "-a -n --binary"
: "-a -n");
if (STREQ (commitpt->version, rcs->head) &&
numdots (delta->version) == 1)
{
/* If this revision is being inserted on the trunk, the change text
for the new delta should be the contents of the working file ... */
bufsize = 0;
#ifdef PRESERVE_PERMISSIONS_SUPPORT
if (preserve_perms && !S_ISREG (sb.st_mode))
/* Pretend file is empty. */
;
else
#endif
get_file (workfile, workfile,
rcs->expand != NULL && STREQ (rcs->expand, "b") ? "rb" : "r",
&dtext->text, &bufsize, &dtext->len);
/* ... and the change text for the old delta should be a diff. */
commitpt->text = (Deltatext *) xmalloc (sizeof (Deltatext));
memset (commitpt->text, 0, sizeof (Deltatext));
bufsize = 0;
switch (diff_exec (workfile, tmpfile, NULL, NULL, diffopts, changefile))
{
case 0:
case 1:
break;
case -1:
/* FIXME-update-dir: message does not include update_dir. */
error (1, errno, "error diffing %s", workfile);
break;
default:
/* FIXME-update-dir: message does not include update_dir. */
error (1, 0, "error diffing %s", workfile);
break;
}
/* OK, the text file case here is really dumb. Logically
speaking we want diff to read the files in text mode,
convert them to the canonical form found in RCS files
(which, we hope at least, is independent of OS--always
bare linefeeds), and then work with change texts in that
format. However, diff_exec both generates change
texts and produces output for user purposes (e.g. patch.c),
and there is no way to distinguish between the two cases.
So we actually implement the text file case by writing the
change text as a text file, then reading it as a text file.
This should cause no harm, but doesn't strike me as
immensely clean. */
get_file (changefile, changefile,
rcs->expand != NULL && STREQ (rcs->expand, "b") ? "rb" : "r",
&commitpt->text->text, &bufsize, &commitpt->text->len);
/* If COMMITPT->TEXT->TEXT is NULL, it means that CHANGEFILE
was empty and that there are no differences between revisions.
In that event, we want to force RCS_rewrite to write an empty
string for COMMITPT's change text. Leaving the change text
field set NULL won't work, since that means "preserve the original
change text for this delta." */
if (commitpt->text->text == NULL)
{
commitpt->text->text = xstrdup ("");
commitpt->text->len = 0;
}
}
else
{
/* This file is not being inserted at the head, but on a side
branch somewhere. Make a diff from the previous revision
to the working file. */
switch (diff_exec (tmpfile, workfile, NULL, NULL, diffopts, changefile))
{
case 0:
case 1:
break;
case -1:
/* FIXME-update-dir: message does not include update_dir. */
error (1, errno, "error diffing %s", workfile);
break;
default:
/* FIXME-update-dir: message does not include update_dir. */
error (1, 0, "error diffing %s", workfile);
break;
}
/* See the comment above, at the other get_file invocation,
regarding binary vs. text. */
get_file (changefile, changefile,
rcs->expand != NULL && STREQ (rcs->expand, "b") ? "rb" : "r",
&dtext->text, &bufsize,
&dtext->len);
if (dtext->text == NULL)
{
dtext->text = xstrdup ("");
dtext->len = 0;
}
}
/* Update DELTA linkage. It is important not to do this before
the very end of RCS_checkin; if an error arises that forces
us to abort checking in, we must not have malformed deltas
partially linked into the tree.
If DELTA and COMMITPT are on different branches, do nothing --
DELTA is linked to the tree through COMMITPT->BRANCHES, and we
don't want to change `next' pointers.
Otherwise, if the nodes are both on the trunk, link DELTA to
COMMITPT; otherwise, link COMMITPT to DELTA. */
if (numdots (commitpt->version) == numdots (delta->version))
{
if (STREQ (commitpt->version, rcs->head))
{
delta->next = rcs->head;
rcs->head = xstrdup (delta->version);
}
else
commitpt->next = xstrdup (delta->version);
}
/* Add DELTA to RCS->VERSIONS. */
if (rcs->versions == NULL)
rcs->versions = getlist();
nodep = getnode();
nodep->type = RCSVERS;
nodep->delproc = rcsvers_delproc;
nodep->data = (char *) delta;
nodep->key = delta->version;
(void) addnode (rcs->versions, nodep);
/* Write the new RCS file, inserting the new delta at COMMITPT. */
if (!checkin_quiet)
{
cvs_output ("new revision: ", 14);
cvs_output (delta->version, 0);
cvs_output ("; previous revision: ", 21);
cvs_output (commitpt->version, 0);
cvs_output ("\n", 1);
}
RCS_rewrite (rcs, dtext, commitpt->version);
if ((flags & RCS_FLAGS_KEEPFILE) == 0)
{
if (unlink_file (workfile) < 0)
/* FIXME-update-dir: message does not include update_dir. */
error (1, errno, "cannot remove %s", workfile);
}
if (unlink_file (tmpfile) < 0)
error (0, errno, "cannot remove %s", tmpfile);
free (tmpfile);
if (unlink_file (changefile) < 0)
error (0, errno, "cannot remove %s", changefile);
free (changefile);
if (!checkin_quiet)
cvs_output ("done\n", 5);
checkin_done:
if (allocated_workfile)
free (workfile);
if (commitpt != NULL && commitpt->text != NULL)
{
freedeltatext (commitpt->text);
commitpt->text = NULL;
}
freedeltatext (dtext);
if (status != 0)
free_rcsvers_contents (delta);
return status;
}
/* This structure is passed between RCS_cmp_file and cmp_file_buffer. */
struct cmp_file_data
{
const char *filename;
FILE *fp;
int different;
};
/* Compare the contents of revision REV of RCS file RCS with the
contents of the file FILENAME. OPTIONS is a string for the keyword
expansion options. Return 0 if the contents of the revision are
the same as the contents of the file, 1 if they are different. */
int
RCS_cmp_file (rcs, rev, options, filename)
RCSNode *rcs;
char *rev;
char *options;
const char *filename;
{
int binary;
FILE *fp;
struct cmp_file_data data;
int retcode;
if (options != NULL && options[0] != '\0')
binary = STREQ (options, "-kb");
else
{
char *expand;
expand = RCS_getexpand (rcs);
if (expand != NULL && STREQ (expand, "b"))
binary = 1;
else
binary = 0;
}
#ifdef PRESERVE_PERMISSIONS_SUPPORT
/* If CVS is to deal properly with special files (when
PreservePermissions is on), the best way is to check out the
revision to a temporary file and call `xcmp' on the two disk
files. xcmp needs to handle non-regular files properly anyway,
so calling it simplifies RCS_cmp_file. We *could* just yank
the delta node out of the version tree and look for device
numbers, but writing to disk and calling xcmp is a better
abstraction (therefore probably more robust). -twp */
if (preserve_perms)
{
char *tmp;
tmp = cvs_temp_name();
retcode = RCS_checkout(rcs, NULL, rev, NULL, options, tmp, NULL, NULL);
if (retcode != 0)
return 1;
retcode = xcmp (tmp, filename);
if (CVS_UNLINK (tmp) < 0)
error (0, errno, "cannot remove %s", tmp);
free (tmp);
return retcode;
}
else
#endif
{
fp = CVS_FOPEN (filename, binary ? FOPEN_BINARY_READ : "r");
if (fp == NULL)
/* FIXME-update-dir: should include update_dir in message. */
error (1, errno, "cannot open file %s for comparing", filename);
data.filename = filename;
data.fp = fp;
data.different = 0;
retcode = RCS_checkout (rcs, (char *) NULL, rev, (char *) NULL,
options, RUN_TTY, cmp_file_buffer,
(void *) &data);
/* If we have not yet found a difference, make sure that we are at
the end of the file. */
if (! data.different)
{
if (getc (fp) != EOF)
data.different = 1;
}
fclose (fp);
if (retcode != 0)
return 1;
return data.different;
}
}
/* This is a subroutine of RCS_cmp_file. It is passed to
RCS_checkout. */
#define CMP_BUF_SIZE (8 * 1024)
static void
cmp_file_buffer (callerdat, buffer, len)
void *callerdat;
const char *buffer;
size_t len;
{
struct cmp_file_data *data = (struct cmp_file_data *) callerdat;
char *filebuf;
/* If we've already found a difference, we don't need to check
further. */
if (data->different)
return;
filebuf = xmalloc (len > CMP_BUF_SIZE ? CMP_BUF_SIZE : len);
while (len > 0)
{
size_t checklen;
checklen = len > CMP_BUF_SIZE ? CMP_BUF_SIZE : len;
if (fread (filebuf, 1, checklen, data->fp) != checklen)
{
if (ferror (data->fp))
error (1, errno, "cannot read file %s for comparing",
data->filename);
data->different = 1;
free (filebuf);
return;
}
if (memcmp (filebuf, buffer, checklen) != 0)
{
data->different = 1;
free (filebuf);
return;
}
buffer += checklen;
len -= checklen;
}
free (filebuf);
}
/* For RCS file RCS, make symbolic tag TAG point to revision REV.
This validates that TAG is OK for a user to use. Return value is
-1 for error (and errno is set to indicate the error), positive for
error (and an error message has been printed), or zero for success. */
int
RCS_settag (rcs, tag, rev)
RCSNode *rcs;
const char *tag;
const char *rev;
{
List *symbols;
Node *node;
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
/* FIXME: This check should be moved to RCS_check_tag. There is no
reason for it to be here. */
if (STREQ (tag, TAG_BASE)
|| STREQ (tag, TAG_HEAD))
{
/* Print the name of the tag might be considered redundant
with the caller, which also prints it. Perhaps this helps
clarify why the tag name is considered reserved, I don't
know. */
error (0, 0, "Attempt to add reserved tag name %s", tag);
return 1;
}
/* A revision number of NULL means use the head or default branch.
If rev is not NULL, it may be a symbolic tag or branch number;
expand it to the correct numeric revision or branch head. */
if (rev == NULL)
rev = rcs->branch ? rcs->branch : rcs->head;
/* At this point rcs->symbol_data may not have been parsed.
Calling RCS_symbols will force it to be parsed into a list
which we can easily manipulate. */
symbols = RCS_symbols (rcs);
if (symbols == NULL)
{
symbols = getlist ();
rcs->symbols = symbols;
}
node = findnode (symbols, tag);
if (node != NULL)
{
free (node->data);
node->data = xstrdup (rev);
}
else
{
node = getnode ();
node->key = xstrdup (tag);
node->data = xstrdup (rev);
(void) addnode_at_front (symbols, node);
}
return 0;
}
/* Delete the symbolic tag TAG from the RCS file RCS. Return 0 if
the tag was found (and removed), or 1 if it was not present. (In
either case, the tag will no longer be in RCS->SYMBOLS.) */
int
RCS_deltag (rcs, tag)
RCSNode *rcs;
const char *tag;
{
List *symbols;
Node *node;
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
symbols = RCS_symbols (rcs);
if (symbols == NULL)
return 1;
node = findnode (symbols, tag);
if (node == NULL)
return 1;
delnode (node);
return 0;
}
/* Set the default branch of RCS to REV. */
int
RCS_setbranch (rcs, rev)
RCSNode *rcs;
const char *rev;
{
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
if (rev && ! *rev)
rev = NULL;
if (rev == NULL && rcs->branch == NULL)
return 0;
if (rev != NULL && rcs->branch != NULL && STREQ (rev, rcs->branch))
return 0;
if (rcs->branch != NULL)
free (rcs->branch);
rcs->branch = xstrdup (rev);
return 0;
}
/* Lock revision REV. LOCK_QUIET is 1 to suppress output. FIXME:
Most of the callers only call us because RCS_checkin still tends to
like a lock (a relic of old behavior inherited from the RCS ci
program). If we clean this up, only "cvs admin -l" will still need
to call RCS_lock. */
/* FIXME-twp: if a lock owned by someone else is broken, should this
send mail to the lock owner? Prompt user? It seems like such an
obscure situation for CVS as almost not worth worrying much
about. */
int
RCS_lock (rcs, rev, lock_quiet)
RCSNode *rcs;
char *rev;
int lock_quiet;
{
List *locks;
Node *p;
char *user;
char *xrev = NULL;
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
locks = RCS_getlocks (rcs);
if (locks == NULL)
locks = rcs->locks = getlist();
user = getcaller();
/* A revision number of NULL means lock the head or default branch. */
if (rev == NULL)
xrev = RCS_head (rcs);
else
xrev = RCS_gettag (rcs, rev, 1, (int *) NULL);
/* Make sure that the desired revision exists. Technically,
we can update the locks list without even checking this,
but RCS 5.7 did this. And it can't hurt. */
if (xrev == NULL || findnode (rcs->versions, xrev) == NULL)
{
if (!lock_quiet)
error (0, 0, "%s: revision %s absent", rcs->path, rev);
free (xrev);
return 1;
}
/* Is this rev already locked? */
p = findnode (locks, xrev);
if (p != NULL)
{
if (STREQ (p->data, user))
{
/* We already own the lock on this revision, so do nothing. */
free (xrev);
return 0;
}
#if 0
/* Well, first of all, "rev" below should be "xrev" to avoid
core dumps. But more importantly, should we really be
breaking the lock unconditionally? What CVS 1.9 does (via
RCS) is to prompt "Revision 1.1 is already locked by fred.
Do you want to break the lock? [ny](n): ". Well, we don't
want to interact with the user (certainly not at the
server/protocol level, and probably not in the command-line
client), but isn't it more sensible to give an error and
let the user run "cvs admin -u" if they want to break the
lock? */
/* Break the lock. */
if (!lock_quiet)
{
cvs_output (rev, 0);
cvs_output (" unlocked\n", 0);
}
delnode (p);
#else
error (1, 0, "Revision %s is already locked by %s", xrev, p->data);
#endif
}
/* Create a new lock. */
p = getnode();
p->key = xrev; /* already xstrdupped */
p->data = xstrdup (getcaller());
(void) addnode_at_front (locks, p);
if (!lock_quiet)
{
cvs_output (xrev, 0);
cvs_output (" locked\n", 0);
}
return 0;
}
/* Unlock revision REV. UNLOCK_QUIET is 1 to suppress output. FIXME:
Like RCS_lock, this can become a no-op if we do the checkin
ourselves.
If REV is not null and is locked by someone else, break their
lock and notify them. It is an open issue whether RCS_unlock
queries the user about whether or not to break the lock. */
int
RCS_unlock (rcs, rev, unlock_quiet)
RCSNode *rcs;
char *rev;
int unlock_quiet;
{
Node *lock;
List *locks;
char *user;
char *xrev = NULL;
user = getcaller();
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
/* If rev is NULL, unlock the revision held by the caller; if more
than one, make the user specify the revision explicitly. This
differs from RCS which unlocks the latest revision (first in
rcs->locks) held by the caller. */
if (rev == NULL)
{
Node *p;
/* No-ops: attempts to unlock an empty tree or an unlocked file. */
if (rcs->head == NULL)
{
if (!unlock_quiet)
cvs_outerr ("can't unlock an empty tree\n", 0);
return 0;
}
locks = RCS_getlocks (rcs);
if (locks == NULL)
{
if (!unlock_quiet)
cvs_outerr ("No locks are set.\n", 0);
return 0;
}
lock = NULL;
for (p = locks->list->next; p != locks->list; p = p->next)
{
if (STREQ (p->data, user))
{
if (lock != NULL)
{
if (!unlock_quiet)
error (0, 0, "\
%s: multiple revisions locked by %s; please specify one", rcs->path, user);
return 1;
}
lock = p;
}
}
if (lock == NULL)
{
if (!unlock_quiet)
error (0, 0, "No locks are set for %s.\n", user);
return 0; /* no lock found, ergo nothing to do */
}
xrev = xstrdup (lock->key);
}
else
{
xrev = RCS_gettag (rcs, rev, 1, (int *) NULL);
if (xrev == NULL)
{
error (0, 0, "%s: revision %s absent", rcs->path, rev);
return 1;
}
}
lock = findnode (RCS_getlocks (rcs), xrev);
if (lock == NULL)
{
/* This revision isn't locked. */
free (xrev);
return 0;
}
if (! STREQ (lock->data, user))
{
/* If the revision is locked by someone else, notify
them. Note that this shouldn't ever happen if RCS_unlock
is called with a NULL revision, since that means "whatever
revision is currently locked by the caller." */
char *repos, *workfile;
if (!unlock_quiet)
error (0, 0, "\
%s: revision %s locked by %s; breaking lock", rcs->path, xrev, lock->data);
repos = xstrdup (rcs->path);
workfile = strrchr (repos, '/');
*workfile++ = '\0';
notify_do ('C', workfile, user, NULL, NULL, repos);
free (repos);
}
delnode (lock);
if (!unlock_quiet)
{
cvs_output (xrev, 0);
cvs_output (" unlocked\n", 0);
}
free (xrev);
return 0;
}
/* Add USER to the access list of RCS. Do nothing if already present.
FIXME-twp: check syntax of USER to make sure it's a valid id. */
void
RCS_addaccess (rcs, user)
RCSNode *rcs;
char *user;
{
char *access, *a;
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
if (rcs->access == NULL)
rcs->access = xstrdup (user);
else
{
access = xstrdup (rcs->access);
for (a = strtok (access, " "); a != NULL; a = strtok (NULL, " "))
{
if (STREQ (a, user))
{
free (access);
return;
}
}
free (access);
rcs->access = (char *) xrealloc
(rcs->access, strlen (rcs->access) + strlen (user) + 2);
strcat (rcs->access, " ");
strcat (rcs->access, user);
}
}
/* Remove USER from the access list of RCS. */
void
RCS_delaccess (rcs, user)
RCSNode *rcs;
char *user;
{
char *p, *s;
int ulen;
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
if (rcs->access == NULL)
return;
if (user == NULL)
{
free (rcs->access);
rcs->access = NULL;
return;
}
p = rcs->access;
ulen = strlen (user);
while (p != NULL)
{
if (strncmp (p, user, ulen) == 0 && (p[ulen] == '\0' || p[ulen] == ' '))
break;
p = strchr (p, ' ');
if (p != NULL)
++p;
}
if (p == NULL)
return;
s = p + ulen;
while (*s != '\0')
*p++ = *s++;
*p = '\0';
}
char *
RCS_getaccess (rcs)
RCSNode *rcs;
{
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
return rcs->access;
}
static int findtag PROTO ((Node *, void *));
/* Return a nonzero value if the revision specified by ARG is found. */
static int
findtag (node, arg)
Node *node;
void *arg;
{
char *rev = (char *)arg;
if (STREQ (node->data, rev))
return 1;
else
return 0;
}
/* Delete revisions between REV1 and REV2. The changes between the two
revisions must be collapsed, and the result stored in the revision
immediately preceding the lower one. Return 0 for successful completion,
1 otherwise.
Solution: check out the revision preceding REV1 and the revision
following REV2. Use call_diff to find aggregate diffs between
these two revisions, and replace the delta text for the latter one
with the new aggregate diff. Alternatively, we could write a
function that takes two change texts and combines them to produce a
new change text, without checking out any revs or calling diff. It
would be hairy, but so, so cool.
If INCLUSIVE is set, then TAG1 and TAG2, if non-NULL, tell us to
delete that revision as well (cvs admin -o tag1:tag2). If clear,
delete up to but not including that revision (cvs admin -o tag1::tag2).
This does not affect TAG1 or TAG2 being NULL; the meaning of the start
point in ::tag2 and :tag2 is the same and likewise for end points. */
int
RCS_delete_revs (rcs, tag1, tag2, inclusive)
RCSNode *rcs;
char *tag1;
char *tag2;
int inclusive;
{
char *next;
Node *nodep;
RCSVers *revp = NULL;
RCSVers *beforep;
int status, found;
int save_noexec;
char *branchpoint = NULL;
char *rev1 = NULL;
char *rev2 = NULL;
int rev1_inclusive = inclusive;
int rev2_inclusive = inclusive;
char *before = NULL;
char *after = NULL;
char *beforefile = NULL;
char *afterfile = NULL;
char *outfile = NULL;
if (tag1 == NULL && tag2 == NULL)
return 0;
/* Assume error status until everything is finished. */
status = 1;
/* Make sure both revisions exist. */
if (tag1 != NULL)
{
rev1 = RCS_gettag (rcs, tag1, 1, NULL);
if (rev1 == NULL || (nodep = findnode (rcs->versions, rev1)) == NULL)
{
error (0, 0, "%s: Revision %s doesn't exist.", rcs->path, tag1);
goto delrev_done;
}
}
if (tag2 != NULL)
{
rev2 = RCS_gettag (rcs, tag2, 1, NULL);
if (rev2 == NULL || (nodep = findnode (rcs->versions, rev2)) == NULL)
{
error (0, 0, "%s: Revision %s doesn't exist.", rcs->path, tag2);
goto delrev_done;
}
}
/* If rev1 is on the trunk and rev2 is NULL, rev2 should be
RCS->HEAD. (*Not* RCS_head(rcs), which may return rcs->branch
instead.) We need to check this special case early, in order
to make sure that rev1 and rev2 get ordered correctly. */
if (rev2 == NULL && numdots (rev1) == 1)
{
rev2 = xstrdup (rcs->head);
rev2_inclusive = 1;
}
if (rev2 == NULL)
rev2_inclusive = 1;
if (rev1 != NULL && rev2 != NULL)
{
/* A range consisting of a branch number means the latest revision
on that branch. */
if (RCS_isbranch (rcs, rev1) && STREQ (rev1, rev2))
rev1 = rev2 = RCS_getbranch (rcs, rev1, 0);
else
{
/* Make sure REV1 and REV2 are ordered correctly (in the
same order as the next field). For revisions on the
trunk, REV1 should be higher than REV2; for branches,
REV1 should be lower. */
/* Shouldn't we just be giving an error in the case where
the user specifies the revisions in the wrong order
(that is, always swap on the trunk, never swap on a
branch, in the non-error cases)? It is not at all
clear to me that users who specify -o 1.4:1.2 really
meant to type -o 1.2:1.4, and the out of order usage
has never been documented, either by cvs.texinfo or
rcs(1). */
char *temp;
int temp_inclusive;
if (numdots (rev1) == 1)
{
if (compare_revnums (rev1, rev2) <= 0)
{
temp = rev2;
rev2 = rev1;
rev1 = temp;
temp_inclusive = rev2_inclusive;
rev2_inclusive = rev1_inclusive;
rev1_inclusive = temp_inclusive;
}
}
else if (compare_revnums (rev1, rev2) > 0)
{
temp = rev2;
rev2 = rev1;
rev1 = temp;
temp_inclusive = rev2_inclusive;
rev2_inclusive = rev1_inclusive;
rev1_inclusive = temp_inclusive;
}
}
}
/* Basically the same thing; make sure that the ordering is what we
need. */
if (rev1 == NULL)
{
assert (rev2 != NULL);
if (numdots (rev2) == 1)
{
/* Swap rev1 and rev2. */
int temp_inclusive;
rev1 = rev2;
rev2 = NULL;
temp_inclusive = rev2_inclusive;
rev2_inclusive = rev1_inclusive;
rev1_inclusive = temp_inclusive;
}
}
/* Put the revision number preceding the first one to delete into
BEFORE (where "preceding" means according to the next field).
If the first revision to delete is the first revision on its
branch (e.g. 1.3.2.1), BEFORE should be the node on the trunk
at which the branch is rooted. If the first revision to delete
is the head revision of the trunk, set BEFORE to NULL.
Note that because BEFORE may not be on the same branch as REV1,
it is not very handy for navigating the revision tree. It's
most useful just for checking out the revision preceding REV1. */
before = NULL;
branchpoint = RCS_getbranchpoint (rcs, rev1 != NULL ? rev1 : rev2);
if (rev1 == NULL)
{
rev1 = xstrdup (branchpoint);
if (numdots (branchpoint) > 1)
{
char *bp;
bp = strrchr (branchpoint, '.');
while (*--bp != '.')
;
*bp = '\0';
/* Note that this is exclusive, always, because the inclusive
flag doesn't affect the meaning when rev1 == NULL. */
before = xstrdup (branchpoint);
*bp = '.';
}
}
else if (! STREQ (rev1, branchpoint))
{
/* Walk deltas from BRANCHPOINT on, looking for REV1. */
nodep = findnode (rcs->versions, branchpoint);
revp = (RCSVers *) nodep->data;
while (revp->next != NULL && ! STREQ (revp->next, rev1))
{
revp = (RCSVers *) nodep->data;
nodep = findnode (rcs->versions, revp->next);
}
if (revp->next == NULL)
{
error (0, 0, "%s: Revision %s doesn't exist.", rcs->path, rev1);
goto delrev_done;
}
if (rev1_inclusive)
before = xstrdup (revp->version);
else
{
before = rev1;
nodep = findnode (rcs->versions, before);
rev1 = xstrdup (((RCSVers *)nodep->data)->next);
}
}
else if (!rev1_inclusive)
{
before = rev1;
nodep = findnode (rcs->versions, before);
rev1 = xstrdup (((RCSVers *)nodep->data)->next);
}
else if (numdots (branchpoint) > 1)
{
/* Example: rev1 is "1.3.2.1", branchpoint is "1.3.2.1".
Set before to "1.3". */
char *bp;
bp = strrchr (branchpoint, '.');
while (*--bp != '.')
;
*bp = '\0';
before = xstrdup (branchpoint);
*bp = '.';
}
/* If any revision between REV1 and REV2 is locked or is a branch point,
we can't delete that revision and must abort. */
after = NULL;
next = rev1;
found = 0;
while (!found && next != NULL)
{
nodep = findnode (rcs->versions, next);
revp = (RCSVers *) nodep->data;
if (rev2 != NULL)
found = STREQ (revp->version, rev2);
next = revp->next;
if ((!found && next != NULL) || rev2_inclusive || rev2 == NULL)
{
if (findnode (RCS_getlocks (rcs), revp->version))
{
error (0, 0, "%s: can't remove locked revision %s",
rcs->path,
revp->version);
goto delrev_done;
}
if (revp->branches != NULL)
{
error (0, 0, "%s: can't remove branch point %s",
rcs->path,
revp->version);
goto delrev_done;
}
/* Doing this only for the :: syntax is for compatibility.
See cvs.texinfo for somewhat more discussion. */
if (!inclusive
&& walklist (RCS_symbols (rcs), findtag, revp->version))
{
/* We don't print which file this happens to on the theory
that the caller will print the name of the file in a
more useful fashion (fullname not rcs->path). */
error (0, 0, "cannot remove revision %s because it has tags",
revp->version);
goto delrev_done;
}
/* It's misleading to print the `deleting revision' output
here, since we may not actually delete these revisions.
But that's how RCS does it. Bleah. Someday this should be
moved to the point where the revs are actually marked for
deletion. -twp */
cvs_output ("deleting revision ", 0);
cvs_output (revp->version, 0);
cvs_output ("\n", 1);
}
}
if (rev2 == NULL)
;
else if (found)
{
if (rev2_inclusive)
after = xstrdup (next);
else
after = xstrdup (revp->version);
}
else if (!inclusive)
{
/* In the case of an empty range, for example 1.2::1.2 or
1.2::1.3, we want to just do nothing. */
status = 0;
goto delrev_done;
}
else
{
/* This looks fishy in the cases where tag1 == NULL or tag2 == NULL.
Are those cases really impossible? */
assert (tag1 != NULL);
assert (tag2 != NULL);
error (0, 0, "%s: invalid revision range %s:%s", rcs->path,
tag1, tag2);
goto delrev_done;
}
if (after == NULL && before == NULL)
{
/* The user is trying to delete all revisions. While an
RCS file without revisions makes sense to RCS (e.g. the
state after "rcs -i"), CVS has never been able to cope with
it. So at least for now we just make this an error.
We don't include rcs->path in the message since "cvs admin"
already printed "RCS file:" and the name. */
error (1, 0, "attempt to delete all revisions");
}
/* The conditionals at this point get really hairy. Here is the
general idea:
IF before != NULL and after == NULL
THEN don't check out any revisions, just delete them
IF before == NULL and after != NULL
THEN only check out after's revision, and use it for the new deltatext
ELSE
check out both revisions and diff -n them. This could use
RCS_exec_rcsdiff with some changes, like being able
to suppress diagnostic messages and to direct output. */
if (after != NULL)
{
char *diffbuf;
size_t bufsize, len;
#if defined (__CYGWIN32__) || defined (_WIN32)
/* FIXME: This is an awful kludge, but at least until I have
time to work on it a little more and test it, I'd rather
give a fatal error than corrupt the file. I think that we
need to use "-kb" and "--binary" and "rb" to get_file
(probably can do it always, not just for binary files, if
we are consistent between the RCS_checkout and the diff). */
{
char *expand = RCS_getexpand (rcs);
if (expand != NULL && STREQ (expand, "b"))
error (1, 0,
"admin -o not implemented yet for binary on this system");
}
#endif
afterfile = cvs_temp_name();
status = RCS_checkout (rcs, NULL, after, NULL, "-ko", afterfile,
(RCSCHECKOUTPROC)0, NULL);
if (status > 0)
goto delrev_done;
if (before == NULL)
{
/* We are deleting revisions from the head of the tree,
so must create a new head. */
diffbuf = NULL;
bufsize = 0;
get_file (afterfile, afterfile, "r", &diffbuf, &bufsize, &len);
save_noexec = noexec;
noexec = 0;
if (unlink_file (afterfile) < 0)
error (0, errno, "cannot remove %s", afterfile);
noexec = save_noexec;
free (afterfile);
afterfile = NULL;
free (rcs->head);
rcs->head = xstrdup (after);
}
else
{
beforefile = cvs_temp_name();
status = RCS_checkout (rcs, NULL, before, NULL, "-ko", beforefile,
(RCSCHECKOUTPROC)0, NULL);
if (status > 0)
goto delrev_done;
outfile = cvs_temp_name();
status = diff_exec (beforefile, afterfile, NULL, NULL, "-an", outfile);
if (status == 2)
{
/* Not sure we need this message; will diff_exec already
have printed an error? */
error (0, 0, "%s: could not diff", rcs->path);
status = 1;
goto delrev_done;
}
diffbuf = NULL;
bufsize = 0;
get_file (outfile, outfile, "r", &diffbuf, &bufsize, &len);
}
/* Save the new change text in after's delta node. */
nodep = findnode (rcs->versions, after);
revp = (RCSVers *) nodep->data;
assert (revp->text == NULL);
revp->text = (Deltatext *) xmalloc (sizeof (Deltatext));
memset ((Deltatext *) revp->text, 0, sizeof (Deltatext));
revp->text->version = xstrdup (revp->version);
revp->text->text = diffbuf;
revp->text->len = len;
/* If DIFFBUF is NULL, it means that OUTFILE is empty and that
there are no differences between the two revisions. In that
case, we want to force RCS_copydeltas to write an empty string
for the new change text (leaving the text field set NULL
means "preserve the original change text for this delta," so
we don't want that). */
if (revp->text->text == NULL)
revp->text->text = xstrdup ("");
}
/* Walk through the revisions (again) to mark each one as
outdated. (FIXME: would it be safe to use the `dead' field for
this? Doubtful.) */
for (next = rev1;
next != NULL && (after == NULL || ! STREQ (next, after));
next = revp->next)
{
nodep = findnode (rcs->versions, next);
revp = (RCSVers *) nodep->data;
revp->outdated = 1;
}
/* Update delta links. If BEFORE == NULL, we're changing the
head of the tree and don't need to update any `next' links. */
if (before != NULL)
{
/* If REV1 is the first node on its branch, then BEFORE is its
root node (on the trunk) and we have to update its branches
list. Otherwise, BEFORE is on the same branch as AFTER, and
we can just change BEFORE's `next' field to point to AFTER.
(This should be safe: since findnode manages its lists via
the `hashnext' and `hashprev' fields, rather than `next' and
`prev', mucking with `next' and `prev' should not corrupt the
delta tree's internal structure. Much. -twp) */
if (rev1 == NULL)
/* beforep's ->next field already should be equal to after,
which I think is always NULL in this case. */
;
else if (STREQ (rev1, branchpoint))
{
nodep = findnode (rcs->versions, before);
revp = (RCSVers *) nodep->data;
nodep = revp->branches->list->next;
while (nodep != revp->branches->list &&
! STREQ (nodep->key, rev1))
nodep = nodep->next;
assert (nodep != revp->branches->list);
if (after == NULL)
delnode (nodep);
else
{
free (nodep->key);
nodep->key = xstrdup (after);
}
}
else
{
nodep = findnode (rcs->versions, before);
beforep = (RCSVers *) nodep->data;
free (beforep->next);
beforep->next = xstrdup (after);
}
}
status = 0;
delrev_done:
if (rev1 != NULL)
free (rev1);
if (rev2 != NULL)
free (rev2);
if (branchpoint != NULL)
free (branchpoint);
if (before != NULL)
free (before);
if (after != NULL)
free (after);
save_noexec = noexec;
noexec = 0;
if (beforefile != NULL)
{
if (unlink_file (beforefile) < 0)
error (0, errno, "cannot remove %s", beforefile);
free (beforefile);
}
if (afterfile != NULL)
{
if (unlink_file (afterfile) < 0)
error (0, errno, "cannot remove %s", afterfile);
free (afterfile);
}
if (outfile != NULL)
{
if (unlink_file (outfile) < 0)
error (0, errno, "cannot remove %s", outfile);
free (outfile);
}
noexec = save_noexec;
return status;
}
/*
* TRUE if there exists a symbolic tag "tag" in file.
*/
int
RCS_exist_tag (rcs, tag)
RCSNode *rcs;
char *tag;
{
assert (rcs != NULL);
if (findnode (RCS_symbols (rcs), tag))
return 1;
return 0;
}
/*
* TRUE if RCS revision number "rev" exists.
* This includes magic branch revisions, not found in rcs->versions,
* but only in rcs->symbols, requiring a list walk to find them.
* Take advantage of list walk callback function already used by
* RCS_delete_revs, above.
*/
int
RCS_exist_rev (rcs, rev)
RCSNode *rcs;
char *rev;
{
assert (rcs != NULL);
if (rcs->flags & PARTIAL)
RCS_reparsercsfile (rcs, (FILE **) NULL, (struct rcsbuffer *) NULL);
if (findnode(rcs->versions, rev) != 0)
return 1;
if (walklist (RCS_symbols(rcs), findtag, rev) != 0)
return 1;
return 0;
}
/* RCS_deltas and friends. Processing of the deltas in RCS files. */
struct line
{
/* Text of this line. Part of the same malloc'd block as the struct
line itself (we probably should use the "struct hack" (char text[1])
and save ourselves sizeof (char *) bytes). Does not include \n;
instead has_newline indicates the presence or absence of \n. */
char *text;
/* Length of this line, not counting \n if has_newline is true. */
size_t len;
/* Version in which it was introduced. */
RCSVers *vers;
/* Nonzero if this line ends with \n. This will always be true
except possibly for the last line. */
int has_newline;
/* Number of pointers to this struct line. */
int refcount;
};
struct linevector
{
/* How many lines in use for this linevector? */
unsigned int nlines;
/* How many lines allocated for this linevector? */
unsigned int lines_alloced;
/* Pointer to array containing a pointer to each line. */
struct line **vector;
};
static void linevector_init PROTO ((struct linevector *));
/* Initialize *VEC to be a linevector with no lines. */
static void
linevector_init (vec)
struct linevector *vec;
{
vec->lines_alloced = 0;
vec->nlines = 0;
vec->vector = NULL;
}
static int linevector_add PROTO ((struct linevector *vec, const char *text,
size_t len, RCSVers *vers,
unsigned int pos));
/* Given some text TEXT, add each of its lines to VEC before line POS
(where line 0 is the first line). The last line in TEXT may or may
not be \n terminated.
Set the version for each of the new lines to VERS. This
function returns non-zero for success. It returns zero if the line
number is out of range.
Each of the lines in TEXT are copied to space which is managed with
the linevector (and freed by linevector_free). So the caller doesn't
need to keep TEXT around after the call to this function. */
static int
linevector_add (vec, text, len, vers, pos)
struct linevector *vec;
const char *text;
size_t len;
RCSVers *vers;
unsigned int pos;
{
const char *textend;
unsigned int i;
unsigned int nnew;
const char *p;
const char *nextline_text;
size_t nextline_len;
int nextline_newline;
struct line *q;
if (len == 0)
return 1;
textend = text + len;
/* Count the number of lines we will need to add. */
nnew = 1;
for (p = text; p < textend; ++p)
if (*p == '\n' && p + 1 < textend)
++nnew;
/* Expand VEC->VECTOR if needed. */
if (vec->nlines + nnew >= vec->lines_alloced)
{
if (vec->lines_alloced == 0)
vec->lines_alloced = 10;
while (vec->nlines + nnew >= vec->lines_alloced)
vec->lines_alloced *= 2;
vec->vector = xrealloc (vec->vector,
vec->lines_alloced * sizeof (*vec->vector));
}
/* Make room for the new lines in VEC->VECTOR. */
for (i = vec->nlines + nnew - 1; i >= pos + nnew; --i)
vec->vector[i] = vec->vector[i - nnew];
if (pos > vec->nlines)
return 0;
/* Actually add the lines, to VEC->VECTOR. */
i = pos;
nextline_text = text;
nextline_newline = 0;
for (p = text; p < textend; ++p)
if (*p == '\n')
{
nextline_newline = 1;
if (p + 1 == textend)
/* If there are no characters beyond the last newline, we
don't consider it another line. */
break;
nextline_len = p - nextline_text;
q = (struct line *) xmalloc (sizeof (struct line) + nextline_len);
q->vers = vers;
q->text = (char *)q + sizeof (struct line);
q->len = nextline_len;
q->has_newline = nextline_newline;
q->refcount = 1;
memcpy (q->text, nextline_text, nextline_len);
vec->vector[i++] = q;
nextline_text = (char *)p + 1;
nextline_newline = 0;
}
nextline_len = p - nextline_text;
q = (struct line *) xmalloc (sizeof (struct line) + nextline_len);
q->vers = vers;
q->text = (char *)q + sizeof (struct line);
q->len = nextline_len;
q->has_newline = nextline_newline;
q->refcount = 1;
memcpy (q->text, nextline_text, nextline_len);
vec->vector[i] = q;
vec->nlines += nnew;
return 1;
}
static void linevector_delete PROTO ((struct linevector *, unsigned int,
unsigned int));
/* Remove NLINES lines from VEC at position POS (where line 0 is the
first line). */
static void
linevector_delete (vec, pos, nlines)
struct linevector *vec;
unsigned int pos;
unsigned int nlines;
{
unsigned int i;
unsigned int last;
last = vec->nlines - nlines;
for (i = pos; i < pos + nlines; ++i)
{
if (--vec->vector[i]->refcount == 0)
free (vec->vector[i]);
}
for (i = pos; i < last; ++i)
vec->vector[i] = vec->vector[i + nlines];
vec->nlines -= nlines;
}
static void linevector_copy PROTO ((struct linevector *, struct linevector *));
/* Copy FROM to TO, copying the vectors but not the lines pointed to. */
static void
linevector_copy (to, from)
struct linevector *to;
struct linevector *from;
{
unsigned int ln;
for (ln = 0; ln < to->nlines; ++ln)
{
if (--to->vector[ln]->refcount == 0)
free (to->vector[ln]);
}
if (from->nlines > to->lines_alloced)
{
if (to->lines_alloced == 0)
to->lines_alloced = 10;
while (from->nlines > to->lines_alloced)
to->lines_alloced *= 2;
to->vector = (struct line **)
xrealloc (to->vector, to->lines_alloced * sizeof (*to->vector));
}
memcpy (to->vector, from->vector,
from->nlines * sizeof (*to->vector));
to->nlines = from->nlines;
for (ln = 0; ln < to->nlines; ++ln)
++to->vector[ln]->refcount;
}
static void linevector_free PROTO ((struct linevector *));
/* Free storage associated with linevector. */
static void
linevector_free (vec)
struct linevector *vec;
{
unsigned int ln;
if (vec->vector != NULL)
{
for (ln = 0; ln < vec->nlines; ++ln)
if (--vec->vector[ln]->refcount == 0)
free (vec->vector[ln]);
free (vec->vector);
}
}
static char *month_printname PROTO ((char *));
/* Given a textual string giving the month (1-12), terminated with any
character not recognized by atoi, return the 3 character name to
print it with. I do not think it is a good idea to change these
strings based on the locale; they are standard abbreviations (for
example in rfc822 mail messages) which should be widely understood.
Returns a pointer into static readonly storage. */
static char *
month_printname (month)
char *month;
{
static const char *const months[] =
{"Jan", "Feb", "Mar", "Apr", "May", "Jun",
"Jul", "Aug", "Sep", "Oct", "Nov", "Dec"};
int mnum;
mnum = atoi (month);
if (mnum < 1 || mnum > 12)
return "???";
return (char *)months[mnum - 1];
}
static int
apply_rcs_changes PROTO ((struct linevector *, const char *, size_t,
const char *, RCSVers *, RCSVers *));
/* Apply changes to the line vector LINES. DIFFBUF is a buffer of
length DIFFLEN holding the change text from an RCS file (the output
of diff -n). NAME is used in error messages. The VERS field of
any line added is set to ADDVERS. The VERS field of any line
deleted is set to DELVERS, unless DELVERS is NULL, in which case
the VERS field of deleted lines is unchanged. The function returns
non-zero if the change text is applied successfully. It returns
zero if the change text does not appear to apply to LINES (e.g., a
line number is invalid). If the change text is improperly
formatted (e.g., it is not the output of diff -n), the function
calls error with a status of 1, causing the program to exit. */
static int
apply_rcs_changes (lines, diffbuf, difflen, name, addvers, delvers)
struct linevector *lines;
const char *diffbuf;
size_t difflen;
const char *name;
RCSVers *addvers;
RCSVers *delvers;
{
const char *p;
const char *q;
int op;
/* The RCS format throws us for a loop in that the deltafrags (if
we define a deltafrag as an add or a delete) need to be applied
in reverse order. So we stick them into a linked list. */
struct deltafrag {
enum {FRAG_ADD, FRAG_DELETE} type;
unsigned long pos;
unsigned long nlines;
const char *new_lines;
size_t len;
struct deltafrag *next;
};
struct deltafrag *dfhead;
struct deltafrag *df;
dfhead = NULL;
for (p = diffbuf; p != NULL && p < diffbuf + difflen; )
{
op = *p++;
if (op != 'a' && op != 'd')
/* Can't just skip over the deltafrag, because the value
of op determines the syntax. */
error (1, 0, "unrecognized operation '\\x%x' in %s",
op, name);
df = (struct deltafrag *) xmalloc (sizeof (struct deltafrag));
df->next = dfhead;
dfhead = df;
df->pos = strtoul (p, (char **) &q, 10);
if (p == q)
error (1, 0, "number expected in %s", name);
p = q;
if (*p++ != ' ')
error (1, 0, "space expected in %s", name);
df->nlines = strtoul (p, (char **) &q, 10);
if (p == q)
error (1, 0, "number expected in %s", name);
p = q;
if (*p++ != '\012')
error (1, 0, "linefeed expected in %s", name);
if (op == 'a')
{
unsigned int i;
df->type = FRAG_ADD;
i = df->nlines;
/* The text we want is the number of lines specified, or
until the end of the value, whichever comes first (it
will be the former except in the case where we are
adding a line which does not end in newline). */
for (q = p; i != 0; ++q)
if (*q == '\n')
--i;
else if (q == diffbuf + difflen)
{
if (i != 1)
error (1, 0, "premature end of change in %s", name);
else
break;
}
/* Stash away a pointer to the text we are adding. */
df->new_lines = p;
df->len = q - p;
p = q;
}
else
{
/* Correct for the fact that line numbers in RCS files
start with 1. */
--df->pos;
assert (op == 'd');
df->type = FRAG_DELETE;
}
}
for (df = dfhead; df != NULL;)
{
unsigned int ln;
switch (df->type)
{
case FRAG_ADD:
if (! linevector_add (lines, df->new_lines, df->len, addvers,
df->pos))
return 0;
break;
case FRAG_DELETE:
if (df->pos > lines->nlines
|| df->pos + df->nlines > lines->nlines)
return 0;
if (delvers != NULL)
for (ln = df->pos; ln < df->pos + df->nlines; ++ln)
lines->vector[ln]->vers = delvers;
linevector_delete (lines, df->pos, df->nlines);
break;
}
df = df->next;
free (dfhead);
dfhead = df;
}
return 1;
}
/* Apply an RCS change text to a buffer. The function name starts
with rcs rather than RCS because this does not take an RCSNode
argument. NAME is used in error messages. TEXTBUF is the text
buffer to change, and TEXTLEN is the size. DIFFBUF and DIFFLEN are
the change buffer and size. The new buffer is returned in *RETBUF
and *RETLEN. The new buffer is allocated by xmalloc.
Return 1 for success. On failure, call error and return 0. */
int
rcs_change_text (name, textbuf, textlen, diffbuf, difflen, retbuf, retlen)
const char *name;
char *textbuf;
size_t textlen;
const char *diffbuf;
size_t difflen;
char **retbuf;
size_t *retlen;
{
struct linevector lines;
int ret;
*retbuf = NULL;
*retlen = 0;
linevector_init (&lines);
if (! linevector_add (&lines, textbuf, textlen, NULL, 0))
error (1, 0, "cannot initialize line vector");
if (! apply_rcs_changes (&lines, diffbuf, difflen, name, NULL, NULL))
{
error (0, 0, "invalid change text in %s", name);
ret = 0;
}
else
{
char *p;
size_t n;
unsigned int ln;
n = 0;
for (ln = 0; ln < lines.nlines; ++ln)
/* 1 for \n */
n += lines.vector[ln]->len + 1;
p = xmalloc (n);
*retbuf = p;
for (ln = 0; ln < lines.nlines; ++ln)
{
memcpy (p, lines.vector[ln]->text, lines.vector[ln]->len);
p += lines.vector[ln]->len;
if (lines.vector[ln]->has_newline)
*p++ = '\n';
}
*retlen = p - *retbuf;
assert (*retlen <= n);
ret = 1;
}
linevector_free (&lines);
return ret;
}
/* Walk the deltas in RCS to get to revision VERSION.
If OP is RCS_ANNOTATE, then write annotations using cvs_output.
If OP is RCS_FETCH, then put the contents of VERSION into a
newly-malloc'd array and put a pointer to it in *TEXT. Each line
is \n terminated; the caller is responsible for converting text
files if desired. The total length is put in *LEN.
If FP is non-NULL, it should be a file descriptor open to the file
RCS with file position pointing to the deltas. We close the file
when we are done.
If LOG is non-NULL, then *LOG is set to the log message of VERSION,
and *LOGLEN is set to the length of the log message.
On error, give a fatal error. */
void
RCS_deltas (rcs, fp, rcsbuf, version, op, text, len, log, loglen)
RCSNode *rcs;
FILE *fp;
struct rcsbuffer *rcsbuf;
char *version;
enum rcs_delta_op op;
char **text;
size_t *len;
char **log;
size_t *loglen;
{
struct rcsbuffer rcsbuf_local;
char *branchversion;
char *cpversion;
char *key;
char *value;
size_t vallen;
RCSVers *vers;
RCSVers *prev_vers;
RCSVers *trunk_vers;
char *next;
int ishead, isnext, isversion, onbranch;
Node *node;
struct linevector headlines;
struct linevector curlines;
struct linevector trunklines;
int foundhead;
if (fp == NULL)
{
rcsbuf_cache_open (rcs, rcs->delta_pos, &fp, &rcsbuf_local);
rcsbuf = &rcsbuf_local;
}
ishead = 1;
vers = NULL;
prev_vers = NULL;
trunk_vers = NULL;
next = NULL;
onbranch = 0;
foundhead = 0;
linevector_init (&curlines);
linevector_init (&headlines);
linevector_init (&trunklines);
/* We set BRANCHVERSION to the version we are currently looking
for. Initially, this is the version on the trunk from which
VERSION branches off. If VERSION is not a branch, then
BRANCHVERSION is just VERSION. */
branchversion = xstrdup (version);
cpversion = strchr (branchversion, '.');
if (cpversion != NULL)
cpversion = strchr (cpversion + 1, '.');
if (cpversion != NULL)
*cpversion = '\0';
do {
if (! rcsbuf_getrevnum (rcsbuf, &key))
error (1, 0, "unexpected EOF reading RCS file %s", rcs->path);
if (next != NULL && ! STREQ (next, key))
{
/* This is not the next version we need. It is a branch
version which we want to ignore. */
isnext = 0;
isversion = 0;
}
else
{
isnext = 1;
/* look up the revision */
node = findnode (rcs->versions, key);
if (node == NULL)
error (1, 0,
"mismatch in rcs file %s between deltas and deltatexts (%s)",
rcs->path, key);
/* Stash the previous version. */
prev_vers = vers;
vers = (RCSVers *) node->data;
next = vers->next;
/* Compare key and trunkversion now, because key points to
storage controlled by rcsbuf_getkey. */
if (STREQ (branchversion, key))
isversion = 1;
else
isversion = 0;
}
while (1)
{
if (! rcsbuf_getkey (rcsbuf, &key, &value))
error (1, 0, "%s does not appear to be a valid rcs file",
rcs->path);
if (log != NULL
&& isversion
&& STREQ (key, "log")
&& STREQ (branchversion, version))
{
*log = rcsbuf_valcopy (rcsbuf, value, 0, loglen);
}
if (STREQ (key, "text"))
{
rcsbuf_valpolish (rcsbuf, value, 0, &vallen);
if (ishead)
{
if (! linevector_add (&curlines, value, vallen, NULL, 0))
error (1, 0, "invalid rcs file %s", rcs->path);
ishead = 0;
}
else if (isnext)
{
if (! apply_rcs_changes (&curlines, value, vallen,
rcs->path,
onbranch ? vers : NULL,
onbranch ? NULL : prev_vers))
error (1, 0, "invalid change text in %s", rcs->path);
}
break;
}
}
if (isversion)
{
/* This is either the version we want, or it is the
branchpoint to the version we want. */
if (STREQ (branchversion, version))
{
/* This is the version we want. */
linevector_copy (&headlines, &curlines);
foundhead = 1;
if (onbranch)
{
/* We have found this version by tracking up a
branch. Restore back to the lines we saved
when we left the trunk, and continue tracking
down the trunk. */
onbranch = 0;
vers = trunk_vers;
next = vers->next;
linevector_copy (&curlines, &trunklines);
}
}
else
{
Node *p;
/* We need to look up the branch. */
onbranch = 1;
if (numdots (branchversion) < 2)
{
unsigned int ln;
/* We are leaving the trunk; save the current
lines so that we can restore them when we
continue tracking down the trunk. */
trunk_vers = vers;
linevector_copy (&trunklines, &curlines);
/* Reset the version information we have
accumulated so far. It only applies to the
changes from the head to this version. */
for (ln = 0; ln < curlines.nlines; ++ln)
curlines.vector[ln]->vers = NULL;
}
/* The next version we want is the entry on
VERS->branches which matches this branch. For
example, suppose VERSION is 1.21.4.3 and
BRANCHVERSION was 1.21. Then we look for an entry
starting with "1.21.4" and we'll put it (probably
1.21.4.1) in NEXT. We'll advance BRANCHVERSION by
two dots (in this example, to 1.21.4.3). */
if (vers->branches == NULL)
error (1, 0, "missing expected branches in %s",
rcs->path);
*cpversion = '.';
++cpversion;
cpversion = strchr (cpversion, '.');
if (cpversion == NULL)
error (1, 0, "version number confusion in %s",
rcs->path);
for (p = vers->branches->list->next;
p != vers->branches->list;
p = p->next)
if (strncmp (p->key, branchversion,
cpversion - branchversion) == 0)
break;
if (p == vers->branches->list)
error (1, 0, "missing expected branch in %s",
rcs->path);
next = p->key;
cpversion = strchr (cpversion + 1, '.');
if (cpversion != NULL)
*cpversion = '\0';
}
}
if (op == RCS_FETCH && foundhead)
break;
} while (next != NULL);
free (branchversion);
rcsbuf_cache (rcs, rcsbuf);
if (! foundhead)
error (1, 0, "could not find desired version %s in %s",
version, rcs->path);
/* Now print out or return the data we have just computed. */
switch (op)
{
case RCS_ANNOTATE:
{
unsigned int ln;
for (ln = 0; ln < headlines.nlines; ++ln)
{
char buf[80];
/* Period which separates year from month in date. */
char *ym;
/* Period which separates month from day in date. */
char *md;
RCSVers *prvers;
prvers = headlines.vector[ln]->vers;
if (prvers == NULL)
prvers = vers;
sprintf (buf, "%-12s (%-8.8s ",
prvers->version,
prvers->author);
cvs_output (buf, 0);
/* Now output the date. */
ym = strchr (prvers->date, '.');
if (ym == NULL)
{
/* ??- is an ANSI trigraph. The ANSI way to
avoid it is \? but some pre ANSI compilers
complain about the unrecognized escape
sequence. Of course string concatenation
("??" "-???") is also an ANSI-ism. Testing
__STDC__ seems to be a can of worms, since
compilers do all kinds of things with it. */
cvs_output ("??", 0);
cvs_output ("-???", 0);
cvs_output ("-??", 0);
}
else
{
md = strchr (ym + 1, '.');
if (md == NULL)
cvs_output ("??", 0);
else
cvs_output (md + 1, 2);
cvs_output ("-", 1);
cvs_output (month_printname (ym + 1), 0);
cvs_output ("-", 1);
/* Only output the last two digits of the year. Our output
lines are long enough as it is without printing the
century. */
cvs_output (ym - 2, 2);
}
cvs_output ("): ", 0);
if (headlines.vector[ln]->len != 0)
cvs_output (headlines.vector[ln]->text,
headlines.vector[ln]->len);
cvs_output ("\n", 1);
}
}
break;
case RCS_FETCH:
{
char *p;
size_t n;
unsigned int ln;
assert (text != NULL);
assert (len != NULL);
n = 0;
for (ln = 0; ln < headlines.nlines; ++ln)
/* 1 for \n */
n += headlines.vector[ln]->len + 1;
p = xmalloc (n);
*text = p;
for (ln = 0; ln < headlines.nlines; ++ln)
{
memcpy (p, headlines.vector[ln]->text,
headlines.vector[ln]->len);
p += headlines.vector[ln]->len;
if (headlines.vector[ln]->has_newline)
*p++ = '\n';
}
*len = p - *text;
assert (*len <= n);
}
break;
}
linevector_free (&curlines);
linevector_free (&headlines);
linevector_free (&trunklines);
return;
}
/* Read the information for a single delta from the RCS buffer RCSBUF,
whose name is RCSFILE. *KEYP and *VALP are either NULL, or the
first key/value pair to read, as set by rcsbuf_getkey. Return NULL
if there are no more deltas. Store the key/value pair which
terminated the read in *KEYP and *VALP. */
static RCSVers *
getdelta (rcsbuf, rcsfile, keyp, valp)
struct rcsbuffer *rcsbuf;
char *rcsfile;
char **keyp;
char **valp;
{
RCSVers *vnode;
char *key, *value, *cp;
Node *kv;
/* Get revision number if it wasn't passed in. This uses
rcsbuf_getkey because it doesn't croak when encountering
unexpected input. As a result, we have to play unholy games
with `key' and `value'. */
if (*keyp != NULL)
{
key = *keyp;
value = *valp;
}
else
{
if (! rcsbuf_getkey (rcsbuf, &key, &value))
error (1, 0, "%s: unexpected EOF", rcsfile);
}
/* Make sure that it is a revision number and not a cabbage
or something. */
for (cp = key;
(isdigit ((unsigned char) *cp) || *cp == '.') && *cp != '\0';
cp++)
/* do nothing */ ;
/* Note that when comparing with RCSDATE, we are not massaging
VALUE from the string found in the RCS file. This is OK since
we know exactly what to expect. */
if (*cp != '\0' || strncmp (RCSDATE, value, (sizeof RCSDATE) - 1) != 0)
{
*keyp = key;
*valp = value;
return NULL;
}
vnode = (RCSVers *) xmalloc (sizeof (RCSVers));
memset (vnode, 0, sizeof (RCSVers));
vnode->version = xstrdup (key);
/* Grab the value of the date from value. Note that we are not
massaging VALUE from the string found in the RCS file. */
cp = value + (sizeof RCSDATE) - 1; /* skip the "date" keyword */
while (whitespace (*cp)) /* take space off front of value */
cp++;
vnode->date = xstrdup (cp);
/* Get author field. */
if (! rcsbuf_getkey (rcsbuf, &key, &value))
{
error (1, 0, "unexpected end of file reading %s", rcsfile);
}
if (! STREQ (key, "author"))
error (1, 0, "\
unable to parse %s; `author' not in the expected place", rcsfile);
vnode->author = rcsbuf_valcopy (rcsbuf, value, 0, (size_t *) NULL);
/* Get state field. */
if (! rcsbuf_getkey (rcsbuf, &key, &value))
{
error (1, 0, "unexpected end of file reading %s", rcsfile);
}
if (! STREQ (key, "state"))
error (1, 0, "\
unable to parse %s; `state' not in the expected place", rcsfile);
vnode->state = rcsbuf_valcopy (rcsbuf, value, 0, (size_t *) NULL);
/* The value is optional, according to rcsfile(5). */
if (value != NULL && STREQ (value, RCSDEAD))
{
vnode->dead = 1;
}
/* Note that "branches" and "next" are in fact mandatory, according
to doc/RCSFILES. */
/* fill in the branch list (if any branches exist) */
if (! rcsbuf_getkey (rcsbuf, &key, &value))
{
error (1, 0, "unexpected end of file reading %s", rcsfile);
}
if (STREQ (key, RCSDESC))
{
*keyp = key;
*valp = value;
/* Probably could/should be a fatal error. */
error (0, 0, "warning: 'branches' keyword missing from %s", rcsfile);
return vnode;
}
if (value != (char *) NULL)
{
vnode->branches = getlist ();
/* Note that we are not massaging VALUE from the string found
in the RCS file. */
do_branches (vnode->branches, value);
}
/* fill in the next field if there is a next revision */
if (! rcsbuf_getkey (rcsbuf, &key, &value))
{
error (1, 0, "unexpected end of file reading %s", rcsfile);
}
if (STREQ (key, RCSDESC))
{
*keyp = key;
*valp = value;
/* Probably could/should be a fatal error. */
error (0, 0, "warning: 'next' keyword missing from %s", rcsfile);
return vnode;
}
if (value != (char *) NULL)
vnode->next = rcsbuf_valcopy (rcsbuf, value, 0, (size_t *) NULL);
/*
* XXX - this is where we put the symbolic link stuff???
* (into newphrases in the deltas).
*/
while (1)
{
if (! rcsbuf_getkey (rcsbuf, &key, &value))
error (1, 0, "unexpected end of file reading %s", rcsfile);
/* The `desc' keyword is the end of the deltas. */
if (strcmp (key, RCSDESC) == 0)
break;
#ifdef PRESERVE_PERMISSIONS_SUPPORT
/* The `hardlinks' value is a group of words, which must
be parsed separately and added as a list to vnode->hardlinks. */
if (strcmp (key, "hardlinks") == 0)
{
char *word;
vnode->hardlinks = getlist();
while ((word = rcsbuf_valword (rcsbuf, &value)) != NULL)
{
Node *n = getnode();
n->key = word;
addnode (vnode->hardlinks, n);
}
continue;
}
#endif
/* Enable use of repositories created by certain obsolete
versions of CVS. This code should remain indefinately;
there is no procedure for converting old repositories, and
checking for it is harmless. */
if (STREQ (key, RCSDEAD))
{
vnode->dead = 1;
if (vnode->state != NULL)
free (vnode->state);
vnode->state = xstrdup (RCSDEAD);
continue;
}
/* if we have a new revision number, we're done with this delta */
for (cp = key;
(isdigit ((unsigned char) *cp) || *cp == '.') && *cp != '\0';
cp++)
/* do nothing */ ;
/* Note that when comparing with RCSDATE, we are not massaging
VALUE from the string found in the RCS file. This is OK
since we know exactly what to expect. */
if (*cp == '\0' && strncmp (RCSDATE, value, strlen (RCSDATE)) == 0)
break;
/* At this point, key and value represent a user-defined field
in the delta node. */
if (vnode->other_delta == NULL)
vnode->other_delta = getlist ();
kv = getnode ();
kv->type = rcsbuf_valcmp (rcsbuf) ? RCSCMPFLD : RCSFIELD;
kv->key = xstrdup (key);
kv->data = rcsbuf_valcopy (rcsbuf, value, kv->type == RCSFIELD,
(size_t *) NULL);
if (addnode (vnode->other_delta, kv) != 0)
{
/* Complaining about duplicate keys in newphrases seems
questionable, in that we don't know what they mean and
doc/RCSFILES has no prohibition on several newphrases
with the same key. But we can't store more than one as
long as we store them in a List *. */
error (0, 0, "warning: duplicate key `%s' in RCS file `%s'",
key, rcsfile);
freenode (kv);
}
}
/* Return the key which caused us to fail back to the caller. */
*keyp = key;
*valp = value;
return vnode;
}
static void
freedeltatext (d)
Deltatext *d;
{
if (d->version != NULL)
free (d->version);
if (d->log != NULL)
free (d->log);
if (d->text != NULL)
free (d->text);
if (d->other != (List *) NULL)
dellist (&d->other);
free (d);
}
static Deltatext *
RCS_getdeltatext (rcs, fp, rcsbuf)
RCSNode *rcs;
FILE *fp;
struct rcsbuffer *rcsbuf;
{
char *num;
char *key, *value;
Node *p;
Deltatext *d;
/* Get the revision number. */
if (! rcsbuf_getrevnum (rcsbuf, &num))
{
/* If num == NULL, it means we reached EOF naturally. That's
fine. */
if (num == NULL)
return NULL;
else
error (1, 0, "%s: unexpected EOF", rcs->path);
}
p = findnode (rcs->versions, num);
if (p == NULL)
error (1, 0, "mismatch in rcs file %s between deltas and deltatexts (%s)",
rcs->path, num);
d = (Deltatext *) xmalloc (sizeof (Deltatext));
d->version = xstrdup (num);
/* Get the log message. */
if (! rcsbuf_getkey (rcsbuf, &key, &value))
error (1, 0, "%s, delta %s: unexpected EOF", rcs->path, num);
if (! STREQ (key, "log"))
error (1, 0, "%s, delta %s: expected `log', got `%s'",
rcs->path, num, key);
d->log = rcsbuf_valcopy (rcsbuf, value, 0, (size_t *) NULL);
/* Get random newphrases. */
d->other = getlist();
while (1)
{
if (! rcsbuf_getkey (rcsbuf, &key, &value))
error (1, 0, "%s, delta %s: unexpected EOF", rcs->path, num);
if (STREQ (key, "text"))
break;
p = getnode();
p->type = rcsbuf_valcmp (rcsbuf) ? RCSCMPFLD : RCSFIELD;
p->key = xstrdup (key);
p->data = rcsbuf_valcopy (rcsbuf, value, p->type == RCSFIELD,
(size_t *) NULL);
if (addnode (d->other, p) < 0)
{
error (0, 0, "warning: %s, delta %s: duplicate field `%s'",
rcs->path, num, key);
}
}
/* Get the change text. We already know that this key is `text'. */
d->text = rcsbuf_valcopy (rcsbuf, value, 0, &d->len);
return d;
}
/* RCS output functions, for writing RCS format files from RCSNode
structures.
For most of this work, RCS 5.7 uses an `aprintf' function which aborts
program upon error. Instead, these functions check the output status
of the stream right before closing it, and aborts if an error condition
is found. The RCS solution is probably the better one: it produces
more overhead, but will produce a clearer diagnostic in the case of
catastrophic error. In either case, however, the repository will probably
not get corrupted. */
static int
putsymbol_proc (symnode, fparg)
Node *symnode;
void *fparg;
{
FILE *fp = (FILE *) fparg;
/* A fiddly optimization: this code used to just call fprintf, but
in an old repository with hundreds of tags this can get called
hundreds of thousands of times when doing a cvs tag. Since
tagging is a relatively common operation, and using putc and
fputs is just as comprehensible, the change is worthwhile. */
putc ('\n', fp);
putc ('\t', fp);
fputs (symnode->key, fp);
putc (':', fp);
fputs (symnode->data, fp);
return 0;
}
static int putlock_proc PROTO ((Node *, void *));
/* putlock_proc is like putsymbol_proc, but key and data are reversed. */
static int
putlock_proc (symnode, fp)
Node *symnode;
void *fp;
{
return fprintf ((FILE *) fp, "\n\t%s:%s", symnode->data, symnode->key);
}
static int
putrcsfield_proc (node, vfp)
Node *node;
void *vfp;
{
FILE *fp = (FILE *) vfp;
/* Some magic keys used internally by CVS start with `;'. Skip them. */
if (node->key[0] == ';')
return 0;
fprintf (fp, "\n%s\t", node->key);
if (node->data != NULL)
{
/* If the field's value contains evil characters,
it must be stringified. */
/* FIXME: This does not quite get it right. "7jk8f" is not a legal
value for a value in a newpharse, according to doc/RCSFILES,
because digits are not valid in an "id". We might do OK by
always writing strings (enclosed in @@). Would be nice to
explicitly mention this one way or another in doc/RCSFILES.
A case where we are wrong in a much more clear-cut way is that
we let through non-graphic characters such as whitespace and
control characters. */
if (node->type == RCSCMPFLD || strpbrk (node->data, "$,.:;@") == NULL)
fputs (node->data, fp);
else
{
putc ('@', fp);
expand_at_signs (node->data, (off_t) strlen (node->data), fp);
putc ('@', fp);
}
}
/* desc, log and text fields should not be terminated with semicolon;
all other fields should be. */
if (! STREQ (node->key, "desc") &&
! STREQ (node->key, "log") &&
! STREQ (node->key, "text"))
{
putc (';', fp);
}
return 0;
}
#ifdef PRESERVE_PERMISSIONS_SUPPORT
/* Save a filename in a `hardlinks' RCS field. NODE->KEY will contain
a full pathname, but currently only basenames are stored in the RCS
node. Assume that the filename includes nasty characters and
@-escape it. */
static int
puthardlink_proc (node, vfp)
Node *node;
void *vfp;
{
FILE *fp = (FILE *) vfp;
char *basename = strrchr (node->key, '/');
if (basename == NULL)
basename = node->key;
else
++basename;
putc ('\t', fp);
putc ('@', fp);
(void) expand_at_signs (basename, strlen (basename), fp);
putc ('@', fp);
return 0;
}
#endif
/* Output the admin node for RCS into stream FP. */
static void
RCS_putadmin (rcs, fp)
RCSNode *rcs;
FILE *fp;
{
fprintf (fp, "%s\t%s;\n", RCSHEAD, rcs->head ? rcs->head : "");
if (rcs->branch)
fprintf (fp, "%s\t%s;\n", RCSBRANCH, rcs->branch);
fputs ("access", fp);
if (rcs->access)
{
char *p, *s;
s = xstrdup (rcs->access);
for (p = strtok (s, " \n\t"); p != NULL; p = strtok (NULL, " \n\t"))
fprintf (fp, "\n\t%s", p);
free (s);
}
fputs (";\n", fp);
fputs (RCSSYMBOLS, fp);
/* If we haven't had to convert the symbols to a list yet, don't
force a conversion now; just write out the string. */
if (rcs->symbols == NULL && rcs->symbols_data != NULL)
{
fputs ("\n\t", fp);
fputs (rcs->symbols_data, fp);
}
else
walklist (RCS_symbols (rcs), putsymbol_proc, (void *) fp);
fputs (";\n", fp);
fputs ("locks", fp);
if (rcs->locks_data)
fprintf (fp, "\t%s", rcs->locks_data);
else if (rcs->locks)
walklist (rcs->locks, putlock_proc, (void *) fp);
if (rcs->strict_locks)
fprintf (fp, "; strict");
fputs (";\n", fp);
if (rcs->comment)
{
fprintf (fp, "comment\t@");
expand_at_signs (rcs->comment, (off_t) strlen (rcs->comment), fp);
fputs ("@;\n", fp);
}
if (rcs->expand && ! STREQ (rcs->expand, "kv"))
fprintf (fp, "%s\t@%s@;\n", RCSEXPAND, rcs->expand);
walklist (rcs->other, putrcsfield_proc, (void *) fp);
putc ('\n', fp);
}
static void
putdelta (vers, fp)
RCSVers *vers;
FILE *fp;
{
Node *bp, *start;
/* Skip if no revision was supplied, or if it is outdated (cvs admin -o) */
if (vers == NULL || vers->outdated)
return;
fprintf (fp, "\n%s\n%s\t%s;\t%s %s;\t%s %s;\nbranches",
vers->version,
RCSDATE, vers->date,
"author", vers->author,
"state", vers->state ? vers->state : "");
if (vers->branches != NULL)
{
start = vers->branches->list;
for (bp = start->next; bp != start; bp = bp->next)
fprintf (fp, "\n\t%s", bp->key);
}
fprintf (fp, ";\nnext\t%s;", vers->next ? vers->next : "");
walklist (vers->other_delta, putrcsfield_proc, fp);
#ifdef PRESERVE_PERMISSIONS_SUPPORT
if (vers->hardlinks)
{
fprintf (fp, "\nhardlinks");
walklist (vers->hardlinks, puthardlink_proc, fp);
putc (';', fp);
}
#endif
putc ('\n', fp);
}
static void
RCS_putdtree (rcs, rev, fp)
RCSNode *rcs;
char *rev;
FILE *fp;
{
RCSVers *versp;
Node *p, *branch;
if (rev == NULL)
return;
/* Find the delta node for this revision. */
p = findnode (rcs->versions, rev);
if (p == NULL)
{
error (1, 0,
"error parsing repository file %s, file may be corrupt.",
rcs->path);
}
versp = (RCSVers *) p->data;
/* Print the delta node and recurse on its `next' node. This prints
the trunk. If there are any branches printed on this revision,
print those trunks as well. */
putdelta (versp, fp);
RCS_putdtree (rcs, versp->next, fp);
if (versp->branches != NULL)
{
branch = versp->branches->list;
for (p = branch->next; p != branch; p = p->next)
RCS_putdtree (rcs, p->key, fp);
}
}
static void
RCS_putdesc (rcs, fp)
RCSNode *rcs;
FILE *fp;
{
fprintf (fp, "\n\n%s\n@", RCSDESC);
if (rcs->desc != NULL)
{
off_t len = (off_t) strlen (rcs->desc);
if (len > 0)
{
expand_at_signs (rcs->desc, len, fp);
if (rcs->desc[len-1] != '\n')
putc ('\n', fp);
}
}
fputs ("@\n", fp);
}
static void
putdeltatext (fp, d)
FILE *fp;
Deltatext *d;
{
fprintf (fp, "\n\n%s\nlog\n@", d->version);
if (d->log != NULL)
{
int loglen = strlen (d->log);
expand_at_signs (d->log, (off_t) loglen, fp);
if (d->log[loglen-1] != '\n')
putc ('\n', fp);
}
putc ('@', fp);
walklist (d->other, putrcsfield_proc, fp);
fputs ("\ntext\n@", fp);
if (d->text != NULL)
expand_at_signs (d->text, (off_t) d->len, fp);
fputs ("@\n", fp);
}
/* TODO: the whole mechanism for updating deltas is kludgey... more
sensible would be to supply all the necessary info in a `newdeltatext'
field for RCSVers nodes. -twp */
/* Copy delta text nodes from FIN to FOUT. If NEWDTEXT is non-NULL, it
is a new delta text node, and should be added to the tree at the
node whose revision number is INSERTPT. (Note that trunk nodes are
written in decreasing order, and branch nodes are written in
increasing order.) */
static void
RCS_copydeltas (rcs, fin, rcsbufin, fout, newdtext, insertpt)
RCSNode *rcs;
FILE *fin;
struct rcsbuffer *rcsbufin;
FILE *fout;
Deltatext *newdtext;
char *insertpt;
{
int actions;
RCSVers *dadmin;
Node *np;
int insertbefore, found;
char *bufrest;
int nls;
size_t buflen;
#ifndef HAVE_MMAP
char buf[8192];
int got;
#endif
/* Count the number of versions for which we have to do some
special operation. */
actions = walklist (rcs->versions, count_delta_actions, (void *) NULL);
/* Make a note of whether NEWDTEXT should be inserted
before or after its INSERTPT. */
insertbefore = (newdtext != NULL && numdots (newdtext->version) == 1);
while (actions != 0 || newdtext != NULL)
{
Deltatext *dtext;
dtext = RCS_getdeltatext (rcs, fin, rcsbufin);
/* We shouldn't hit EOF here, because that would imply that
some action was not taken, or that we could not insert
NEWDTEXT. */
if (dtext == NULL)
error (1, 0, "internal error: EOF too early in RCS_copydeltas");
found = (insertpt != NULL && STREQ (dtext->version, insertpt));
if (found && insertbefore)
{
putdeltatext (fout, newdtext);
newdtext = NULL;
insertpt = NULL;
}
np = findnode (rcs->versions, dtext->version);
dadmin = (RCSVers *) np->data;
/* If this revision has been outdated, just skip it. */
if (dadmin->outdated)
{
freedeltatext (dtext);
--actions;
continue;
}
/* Update the change text for this delta. New change text
data may come from cvs admin -m, cvs admin -o, or cvs ci. */
if (dadmin->text != NULL)
{
if (dadmin->text->log != NULL || dadmin->text->text != NULL)
--actions;
if (dadmin->text->log != NULL)
{
free (dtext->log);
dtext->log = dadmin->text->log;
dadmin->text->log = NULL;
}
if (dadmin->text->text != NULL)
{
free (dtext->text);
dtext->text = dadmin->text->text;
dtext->len = dadmin->text->len;
dadmin->text->text = NULL;
}
}
putdeltatext (fout, dtext);
freedeltatext (dtext);
if (found && !insertbefore)
{
putdeltatext (fout, newdtext);
newdtext = NULL;
insertpt = NULL;
}
}
/* Copy the rest of the file directly, without bothering to
interpret it. The caller will handle error checking by calling
ferror.
We just wrote a newline to the file, either in putdeltatext or
in the caller. However, we may not have read the corresponding
newline from the file, because rcsbuf_getkey returns as soon as
it finds the end of the '@' string for the desc or text key.
Therefore, we may read three newlines when we should really
only write two, and we check for that case here. This is not
an semantically important issue; we only do it to make our RCS
files look traditional. */
nls = 3;
rcsbuf_get_buffered (rcsbufin, &bufrest, &buflen);
if (buflen > 0)
{
if (bufrest[0] != '\n'
|| strncmp (bufrest, "\n\n\n", buflen < 3 ? buflen : 3) != 0)
{
nls = 0;
}
else
{
if (buflen < 3)
nls -= buflen;
else
{
++bufrest;
--buflen;
nls = 0;
}
}
fwrite (bufrest, 1, buflen, fout);
}
#ifndef HAVE_MMAP
/* This bit isn't necessary when using mmap since the entire file
* will already be available via the RCS buffer. Besides, the
* mmap code doesn't always keep the file pointer up to date, so
* this adds some data twice.
*/
while ((got = fread (buf, 1, sizeof buf, fin)) != 0)
{
if (nls > 0
&& got >= nls
&& buf[0] == '\n'
&& strncmp (buf, "\n\n\n", nls) == 0)
{
fwrite (buf + 1, 1, got - 1, fout);
}
else
{
fwrite (buf, 1, got, fout);
}
nls = 0;
}
#endif /* HAVE_MMAP */
}
/* A helper procedure for RCS_copydeltas. This is called via walklist
to count the number of RCS revisions for which some special action
is required. */
static int
count_delta_actions (np, ignore)
Node *np;
void *ignore;
{
RCSVers *dadmin;
dadmin = (RCSVers *) np->data;
if (dadmin->outdated)
return 1;
if (dadmin->text != NULL
&& (dadmin->text->log != NULL || dadmin->text->text != NULL))
{
return 1;
}
return 0;
}
/*
* Clean up temporary files
*/
RETSIGTYPE
rcs_cleanup ()
{
/* Note that the checks for existence_error are because we are
called from a signal handler, so we don't know whether the
files got created. */
/* FIXME: Do not perform buffered I/O from an interrupt handler like
this (via error). However, I'm leaving the error-calling code there
in the hope that on the rare occasion the error call is actually made
(e.g., a fluky I/O error or permissions problem prevents the deletion
of a just-created file) reentrancy won't be an issue. */
if (rcs_lockfile != NULL)
{
char *tmp = rcs_lockfile;
rcs_lockfile = NULL;
if (rcs_lockfd >= 0)
{
if (close (rcs_lockfd) != 0)
error (0, errno, "error closing lock file %s", tmp);
rcs_lockfd = -1;
}
if (unlink_file (tmp) < 0
&& !existence_error (errno))
error (0, errno, "cannot remove %s", tmp);
}
}
/* RCS_internal_lockfile and RCS_internal_unlockfile perform RCS-style
locking on the specified RCSFILE: for a file called `foo,v', open
for writing a file called `,foo,'.
Note that we what do here is quite different from what RCS does.
RCS creates the ,foo, file before it reads the RCS file (if it
knows that it will be writing later), so that it actually serves as
a lock. We don't; instead we rely on CVS writelocks. This means
that if someone is running RCS on the file at the same time they
are running CVS on it, they might lose (we read the file,
then RCS writes it, then we write it, clobbering the
changes made by RCS). I believe the current sentiment about this
is "well, don't do that".
A concern has been expressed about whether adopting the RCS
strategy would slow us down. I don't think so, since we need to
write the ,foo, file anyway (unless perhaps if O_EXCL is slower or
something).
These do not perform quite the same function as the RCS -l option
for locking files: they are intended to prevent competing RCS
processes from stomping all over each other's laundry. Hence,
they are `internal' locking functions.
If there is an error, give a fatal error; if we return we always
return a non-NULL value. */
static FILE *
rcs_internal_lockfile (rcsfile)
char *rcsfile;
{
struct stat rstat;
FILE *fp;
static int first_call = 1;
if (first_call)
{
first_call = 0;
/* clean up if we get a signal */
#ifdef SIGABRT
(void) SIG_register (SIGABRT, rcs_cleanup);
#endif
#ifdef SIGHUP
(void) SIG_register (SIGHUP, rcs_cleanup);
#endif
#ifdef SIGINT
(void) SIG_register (SIGINT, rcs_cleanup);
#endif
#ifdef SIGQUIT
(void) SIG_register (SIGQUIT, rcs_cleanup);
#endif
#ifdef SIGPIPE
(void) SIG_register (SIGPIPE, rcs_cleanup);
#endif
#ifdef SIGTERM
(void) SIG_register (SIGTERM, rcs_cleanup);
#endif
}
/* Get the lock file name: `,file,' for RCS file `file,v'. */
assert (rcs_lockfile == NULL);
assert (rcs_lockfd < 0);
rcs_lockfile = rcs_lockfilename (rcsfile);
/* Use the existing RCS file mode, or read-only if this is a new
file. (Really, this is a lie -- if this is a new file,
RCS_checkin uses the permissions from the working copy. For
actually creating the file, we use 0444 as a safe default mode.) */
if (stat (rcsfile, &rstat) < 0)
{
if (existence_error (errno))
rstat.st_mode = S_IRUSR | S_IRGRP | S_IROTH;
else
error (1, errno, "cannot stat %s", rcsfile);
}
/* Try to open exclusively. POSIX.1 guarantees that O_EXCL|O_CREAT
guarantees an exclusive open. According to the RCS source, with
NFS v2 we must also throw in O_TRUNC and use an open mask that makes
the file unwriteable. For extensive justification, see the comments for
rcswriteopen() in rcsedit.c, in RCS 5.7. This is kind of pointless
in the CVS case; see comment at the start of this file concerning
general ,foo, file strategy.
There is some sentiment that with NFSv3 and such, that one can
rely on O_EXCL these days. This might be true for unix (I
don't really know), but I am still pretty skeptical in the case
of the non-unix systems. */
rcs_lockfd = open (rcs_lockfile,
OPEN_BINARY | O_WRONLY | O_CREAT | O_EXCL | O_TRUNC,
S_IRUSR | S_IRGRP | S_IROTH);
if (rcs_lockfd < 0)
{
error (1, errno, "could not open lock file `%s'", rcs_lockfile);
}
/* Force the file permissions, and return a stream object. */
/* Because we change the modes later, we don't worry about
this in the non-HAVE_FCHMOD case. */
#ifdef HAVE_FCHMOD
if (fchmod (rcs_lockfd, rstat.st_mode) < 0)
error (1, errno, "cannot change mode for %s", rcs_lockfile);
#endif
fp = fdopen (rcs_lockfd, FOPEN_BINARY_WRITE);
if (fp == NULL)
error (1, errno, "cannot fdopen %s", rcs_lockfile);
return fp;
}
static void
rcs_internal_unlockfile (fp, rcsfile)
FILE *fp;
char *rcsfile;
{
assert (rcs_lockfile != NULL);
assert (rcs_lockfd >= 0);
/* Abort if we could not write everything successfully to LOCKFILE.
This is not a great error-handling mechanism, but should prevent
corrupting the repository. */
if (ferror (fp))
/* Using errno here may well be misleanding since the most recent
call that set errno may not have anything whatsoever to do with
the error that set the flag, but it's better than nothing. The
real solution is to check each call to fprintf rather than waiting
until the end like this. */
error (1, errno, "error writing to lock file %s", rcs_lockfile);
if (fclose (fp) == EOF)
error (1, errno, "error closing lock file %s", rcs_lockfile);
rcs_lockfd = -1;
rename_file (rcs_lockfile, rcsfile);
{
/* Use a temporary to make sure there's no interval
(after rcs_lockfile has been freed but before it's set to NULL)
during which the signal handler's use of rcs_lockfile would
reference freed memory. */
char *tmp = rcs_lockfile;
rcs_lockfile = NULL;
free (tmp);
}
}
static char *
rcs_lockfilename (rcsfile)
char *rcsfile;
{
char *lockfile, *lockp;
char *rcsbase, *rcsp, *rcsend;
int rcslen;
/* Create the lockfile name. */
rcslen = strlen (rcsfile);
lockfile = (char *) xmalloc (rcslen + 10);
rcsbase = last_component (rcsfile);
rcsend = rcsfile + rcslen - sizeof(RCSEXT);
for (lockp = lockfile, rcsp = rcsfile; rcsp < rcsbase; ++rcsp)
*lockp++ = *rcsp;
*lockp++ = ',';
while (rcsp <= rcsend)
*lockp++ = *rcsp++;
*lockp++ = ',';
*lockp = '\0';
return lockfile;
}
/* Rewrite an RCS file. The basic idea here is that the caller should
first call RCS_reparsercsfile, then munge the data structures as
desired (via RCS_delete_revs, RCS_settag, &c), then call RCS_rewrite. */
void
RCS_rewrite (rcs, newdtext, insertpt)
RCSNode *rcs;
Deltatext *newdtext;
char *insertpt;
{
FILE *fin, *fout;
struct rcsbuffer rcsbufin;
if (noexec)
return;
/* Make sure we're operating on an actual file and not a symlink. */
resolve_symlink (&(rcs->path));
fout = rcs_internal_lockfile (rcs->path);
RCS_putadmin (rcs, fout);
RCS_putdtree (rcs, rcs->head, fout);
RCS_putdesc (rcs, fout);
/* Open the original RCS file and seek to the first delta text. */
rcsbuf_cache_open (rcs, rcs->delta_pos, &fin, &rcsbufin);
/* Update delta_pos to the current position in the output file.
Do NOT move these statements: they must be done after fin has
been positioned at the old delta_pos, but before any delta
texts have been written to fout.
*/
rcs->delta_pos = ftell (fout);
if (rcs->delta_pos == -1)
error (1, errno, "cannot ftell in RCS file %s", rcs->path);
RCS_copydeltas (rcs, fin, &rcsbufin, fout, newdtext, insertpt);
/* We don't want to call rcsbuf_cache here, since we're about to
delete the file. */
rcsbuf_close (&rcsbufin);
if (ferror (fin))
/* The only case in which using errno here would be meaningful
is if we happen to have left errno unmolested since the call
which produced the error (e.g. fread). That is pretty
fragile even if it happens to sometimes be true. The real
solution is to make sure that all the code which reads
from fin checks for errors itself (some does, some doesn't). */
error (0, 0, "warning: ferror set while rewriting RCS file `%s'", rcs->path);
if (fclose (fin) < 0)
error (0, errno, "warning: closing RCS file `%s'", rcs->path);
rcs_internal_unlockfile (fout, rcs->path);
}
/* Abandon changes to an RCS file. */
void
RCS_abandon (rcs)
RCSNode *rcs;
{
free_rcsnode_contents (rcs);
rcs->symbols_data = NULL;
rcs->expand = NULL;
rcs->access = NULL;
rcs->locks_data = NULL;
rcs->comment = NULL;
rcs->desc = NULL;
rcs->flags |= PARTIAL;
}
/*
* For a given file with full pathname PATH and revision number REV,
* produce a file label suitable for passing to diff. The default
* file label as used by RCS 5.7 looks like this:
*
* FILENAME <tab> YYYY/MM/DD <sp> HH:MM:SS <tab> REVNUM
*
* The date and time used are the revision's last checkin date and time.
* If REV is NULL, use the working copy's mtime instead.
*
* /dev/null is not statted but assumed to have been created on the Epoch.
* At least using the POSIX.2 definition of patch, this should cause creation
* of files on platforms such as Windoze where the null IO device isn't named
* /dev/null to be parsed by patch properly.
*/
char *
make_file_label (path, rev, rcs)
char *path;
char *rev;
RCSNode *rcs;
{
char datebuf[MAXDATELEN + 1];
char *label;
label = (char *) xmalloc (strlen (path)
+ (rev == NULL ? 0 : strlen (rev) + 1)
+ MAXDATELEN
+ 2);
if (rev)
{
char date[MAXDATELEN + 1];
/* revs cannot be attached to /dev/null ... duh. */
assert (strcmp(DEVNULL, path));
RCS_getrevtime (rcs, rev, datebuf, 0);
(void) date_to_internet (date, datebuf);
(void) sprintf (label, "-L%s\t%s\t%s", path, date, rev);
}
else
{
struct stat sb;
struct tm *wm = NULL;
if (strcmp(DEVNULL, path))
{
char *file = last_component (path);
if (CVS_STAT (file, &sb) < 0)
error (0, 1, "could not get info for `%s'", path);
else
wm = gmtime (&sb.st_mtime);
}
else
{
time_t t = 0;
wm = gmtime(&t);
}
if (wm)
{
(void) tm_to_internet (datebuf, wm);
(void) sprintf (label, "-L%s\t%s", path, datebuf);
}
}
return label;
}
void
RCS_setlocalid (arg)
const char *arg;
{
char *copy, *next, *key;
copy = xstrdup(arg);
next = copy;
key = strtok(next, "=");
keywords[KEYWORD_LOCALID].string = xstrdup(key);
keywords[KEYWORD_LOCALID].len = strlen(key);
keywords[KEYWORD_LOCALID].expandit = 1;
/* options? */
while (key = strtok(NULL, ",")) {
if (!strcmp(key, keywords[KEYWORD_ID].string))
keyword_local = KEYWORD_ID;
else if (!strcmp(key, keywords[KEYWORD_HEADER].string))
keyword_local = KEYWORD_HEADER;
else if (!strcmp(key, keywords[KEYWORD_CVSHEADER].string))
keyword_local = KEYWORD_CVSHEADER;
else
error(1, 0, "Unknown LocalId mode: %s", key);
}
free(copy);
}
void
RCS_setincexc (arg)
const char *arg;
{
char *key;
char *copy, *next;
int include = 0;
struct rcs_keyword *keyword;
copy = xstrdup(arg);
next = copy;
switch (*next++) {
case 'e':
include = 0;
break;
case 'i':
include = 1;
break;
default:
free(copy);
return;
}
if (include)
for (keyword = keywords; keyword->string != NULL; keyword++)
{
keyword->expandit = 0;
}
key = strtok(next, ",");
while (key) {
for (keyword = keywords; keyword->string != NULL; keyword++) {
if (strcmp (keyword->string, key) == 0)
keyword->expandit = include;
}
key = strtok(NULL, ",");
}
free(copy);
return;
}
#define ATTIC "/" CVSATTIC
static char *
getfullCVSname(CVSname, pathstore)
char *CVSname, **pathstore;
{
if (current_parsed_root->directory) {
int rootlen;
char *c = NULL;
int alen = sizeof(ATTIC) - 1;
*pathstore = xstrdup(CVSname);
if ((c = strrchr(*pathstore, '/')) != NULL) {
if (c - *pathstore >= alen) {
if (!strncmp(c - alen, ATTIC, alen)) {
while (*c != '\0') {
*(c - alen) = *c;
c++;
}
*(c - alen) = '\0';
}
}
}
rootlen = strlen(current_parsed_root->directory);
if (!strncmp(*pathstore, current_parsed_root->directory, rootlen) &&
(*pathstore)[rootlen] == '/')
CVSname = (*pathstore + rootlen + 1);
else
CVSname = (*pathstore);
}
return CVSname;
}
|