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
|
/* Copyright (C) 2005 PrimeBase Technologies GmbH
*
* PrimeBase XT
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*
* 2005-02-08 Paul McCullagh
*
* H&G2JCtL
*/
#include "xt_config.h"
#include <string.h>
#include <stdio.h>
#ifndef XT_WIN
#include <strings.h>
#endif
#include <ctype.h>
#include <time.h>
#ifdef DRIZZLED
#include <drizzled/common.h>
#include <drizzled/dtcollation.h>
#else
#include "mysql_priv.h"
#endif
#include "table_xt.h"
#include "database_xt.h"
#include "heap_xt.h"
#include "strutil_xt.h"
#include "myxt_xt.h"
#include "cache_xt.h"
#include "trace_xt.h"
#include "index_xt.h"
#include "systab_xt.h"
#ifdef DEBUG
//#define TRACE_VARIATIONS
//#define TRACE_VARIATIONS_IN_DUP_CHECK
//#define DUMP_CHECK_TABLE
//#define CHECK_INDEX_ON_CHECK_TABLE
//#define TRACE_TABLE_IDS
//#define TRACE_FLUSH_TABLE
//#define TRACE_CREATE_TABLES
#endif
#define CHECK_TABLE_STATS
/* The problem is that this can take a long time
* if the table is very large!
*/
//#define CHECK_TABLE_READ_DATA_LOG
#ifdef TRACE_TABLE_IDS
//#define PRINTF xt_ftracef
#define PRINTF xt_trace
#endif
static void tab_init_row_file(XTThreadPtr self, XTOpenFilePtr of_row, XTTableHPtr tab, XTDictionaryPtr dic);
static void tab_init_ind_file(XTThreadPtr self, XTOpenFilePtr of_ind, XTTableHPtr tab, XTDictionaryPtr dic);
static void tab_init_data_file(XTThreadPtr self, XTOpenFilePtr of_rec, XTTableHPtr tab, XTDictionaryPtr dic, size_t def_len, XTStringBufferPtr tab_def);
static void tab_free_ext_records(XTTableHPtr tab);
/*
* -----------------------------------------------------------------------
* Internal structures
*/
#define XT_MAX_TABLE_FILE_NAME_SIZE (XT_TABLE_NAME_SIZE+6+40)
/*
* -----------------------------------------------------------------------
* Handle Error Detected in a Table
*/
struct XTTableError {
xtTableID ter_tab_id;
xtRecordID ter_rec_id;
};
static int tab_comp_tab_error(XTThreadPtr XT_UNUSED(self), register const void *XT_UNUSED(thunk), register const void *a, register const void *b)
{
XTTableError *ter_a = ((XTTableError *) a);
XTTableError *ter_b = (XTTableError *) b;
if (ter_a->ter_tab_id < ter_b->ter_tab_id)
return -1;
if (ter_a->ter_tab_id == ter_b->ter_tab_id) {
if (ter_a->ter_rec_id < ter_b->ter_rec_id)
return -1;
if (ter_a->ter_rec_id == ter_b->ter_rec_id)
return 0;
return 1;
}
return 1;
}
static xtBool tab_record_corrupt(XTOpenTablePtr ot, xtRowID row_id, xtRecordID rec_id, bool not_valid, int where)
{
XTTableHPtr tab = ot->ot_table;
XTDatabaseHPtr db = tab->tab_db;
XTTableError ter;
XTTableError *ter_ptr;
ter.ter_tab_id = tab->tab_id;
ter.ter_rec_id = rec_id;
xt_sl_lock_ns(db->db_error_list, ot->ot_thread);
if (!(ter_ptr = (XTTableError *) xt_sl_find(NULL, db->db_error_list, &ter))) {
xtBool ok;
char table_name[XT_IDENTIFIER_NAME_SIZE*3+3];
ok = xt_sl_insert(NULL, db->db_error_list, &ter, &ter);
xt_sl_unlock_ns(db->db_error_list);
if (!ok)
return FAILED;
xt_tab_set_table_repair_pending(tab);
xt_tab_make_table_name(tab->tab_name, table_name, sizeof(table_name));
xt_logf(XT_NT_ERROR, "#%d Table %s: row %llu, record %llu, is %s, REPAIR TABLE required.\n", where,
table_name,
(u_llong) row_id,
(u_llong) rec_id,
not_valid ? "not valid" : "free");
}
else
xt_sl_unlock_ns(db->db_error_list);
return OK;
}
/*
* -----------------------------------------------------------------------
* Compare paths:
*/
/* GOTCHA! The problem:
*
* The server uses names like: "./test/my_tab",
* the BLOB streaming engine uses: "test/my_tab"
* which leads to the same table being loaded twice.
*/
xtPublic int xt_tab_compare_paths(char *n1, char *n2)
{
n1 = xt_last_2_names_of_path(n1);
n2 = xt_last_2_names_of_path(n2);
if (pbxt_ignore_case)
return strcasecmp(n1, n2);
return strcmp(n1, n2);
}
/*
* This function only compares only the last 2 components of
* the path because table names must differ in this area.
*/
xtPublic int xt_tab_compare_names(const char *n1, const char *n2)
{
n1 = xt_last_2_names_of_path(n1);
n2 = xt_last_2_names_of_path(n2);
if (pbxt_ignore_case)
return strcasecmp(n1, n2);
return strcmp(n1, n2);
}
/*
* -----------------------------------------------------------------------
* Private utilities
*/
static xtBool tab_list_comp(void *key, void *data)
{
XTTableHPtr tab = (XTTableHPtr) data;
return strcmp(xt_last_2_names_of_path((char *) key), xt_last_2_names_of_path(tab->tab_name->ps_path)) == 0;
}
static xtHashValue tab_list_hash(xtBool is_key, void *key_data)
{
XTTableHPtr tab = (XTTableHPtr) key_data;
if (is_key)
return xt_ht_hash(xt_last_2_names_of_path((char *) key_data));
return xt_ht_hash(xt_last_2_names_of_path(tab->tab_name->ps_path));
}
static xtBool tab_list_comp_ci(void *key, void *data)
{
XTTableHPtr tab = (XTTableHPtr) data;
return strcasecmp(xt_last_2_names_of_path((char *) key), xt_last_2_names_of_path(tab->tab_name->ps_path)) == 0;
}
static xtHashValue tab_list_hash_ci(xtBool is_key, void *key_data)
{
XTTableHPtr tab = (XTTableHPtr) key_data;
if (is_key)
return xt_ht_casehash(xt_last_2_names_of_path((char *) key_data));
return xt_ht_casehash(xt_last_2_names_of_path(tab->tab_name->ps_path));
}
static void tab_list_free(XTThreadPtr self, void *data)
{
XTTableHPtr tab = (XTTableHPtr) data;
XTDatabaseHPtr db = tab->tab_db;
XTTableEntryPtr te_ptr;
/* Remove the reference from the ID list, whem the table is
* removed from the name list:
*/
if ((te_ptr = (XTTableEntryPtr) xt_sl_find(self, db->db_table_by_id, &tab->tab_id)))
te_ptr->te_table = NULL;
if (tab->tab_dic.dic_table)
tab->tab_dic.dic_table->removeReferences(self);
xt_heap_release(self, tab);
}
static void tab_close_files(XTThreadPtr self, XTTableHPtr tab)
{
if (tab->tab_rec_file) {
xt_fs_release_file(self, tab->tab_rec_file);
tab->tab_rec_file = NULL;
}
if (tab->tab_row_file) {
xt_fs_release_file(self, tab->tab_row_file);
tab->tab_row_file = NULL;
}
if (tab->tab_ind_file) {
xt_fs_release_file(self, tab->tab_ind_file);
tab->tab_ind_file = NULL;
}
}
static void tab_finalize(XTThreadPtr self, void *x)
{
XTTableHPtr tab = (XTTableHPtr) x;
xt_exit_row_locks(&tab->tab_locks);
xt_xres_exit_tab(self, tab);
if (tab->tab_ind_free_list) {
XTIndFreeListPtr list, flist;
list = tab->tab_ind_free_list;
while (list) {
flist = list;
list = list->fl_next_list;
xt_free(self, flist);
}
tab->tab_ind_free_list = NULL;
}
tab_close_files(self, tab);
if (tab->tab_index_head) {
xt_free(self, tab->tab_index_head);
tab->tab_index_head = NULL;
}
tab_free_ext_records(tab);
#ifdef TRACE_TABLE_IDS
PRINTF("%s: free TABLE: db=%d tab=%d %s\n", self->t_name, (int) tab->tab_db ? tab->tab_db->db_id : 0, (int) tab->tab_id,
tab->tab_name ? xt_last_2_names_of_path(tab->tab_name->ps_path) : "?");
#endif
if (tab->tab_name) {
xt_free(self, tab->tab_name);
tab->tab_name = NULL;
}
myxt_free_dictionary(self, &tab->tab_dic);
if (tab->tab_free_locks) {
tab->tab_seq.xt_op_seq_exit(self);
xt_spinlock_free(self, &tab->tab_mem_lock);
xt_spinlock_free(self, &tab->tab_ainc_lock);
xt_free_mutex(&tab->tab_rec_flush_lock);
xt_free_mutex(&tab->tab_ind_flush_lock);
xt_free_mutex(&tab->tab_ind_stat_lock);
xt_free_mutex(&tab->tab_dic_field_lock);
xt_free_mutex(&tab->tab_row_lock);
xt_free_mutex(&tab->tab_ind_lock);
xt_free_mutex(&tab->tab_rec_lock);
for (u_int i=0; i<XT_ROW_RWLOCKS; i++)
XT_TAB_ROW_FREE_LOCK(self, &tab->tab_row_rwlock[i]);
}
#ifdef XT_SORT_REC_WRITES
if (tab->tab_rec_dw_writes) {
xt_free_sortedlist(self, tab->tab_rec_dw_writes);
tab->tab_rec_dw_writes = NULL;
}
if (tab->tab_rec_dw_data)
xt_free_ns(tab->tab_rec_dw_data);
#endif
if (tab->tab_rec_flush_task)
tab->tab_rec_flush_task->tk_exit();
if (tab->tab_ind_flush_task)
tab->tab_ind_flush_task->tk_exit();
}
static void tab_onrelease(void *x)
{
XTTableHPtr tab = (XTTableHPtr) x;
/* Signal threads waiting for exclusive use of the table: */
if (tab->tab_db->db_tables)
xt_ht_signal(NULL, tab->tab_db->db_tables);
}
/*
* -----------------------------------------------------------------------
* PUBLIC METHODS
*/
/*
* This function sets the table name to "", if the file
* does not belong to XT.
*/
xtPublic char *xt_tab_file_to_name(size_t size, char *tab_name, char *file_name)
{
char *cptr;
size_t len;
file_name = xt_last_name_of_path(file_name);
cptr = file_name + strlen(file_name) - 1;
while (cptr > file_name && *cptr != '.')
cptr--;
if (cptr > file_name && *cptr == '.') {
if (strcmp(cptr, ".xtl") == 0 || strcmp(cptr, ".xtr") == 0) {
cptr--;
while (cptr > file_name && isdigit(*cptr))
cptr--;
}
else {
const char **ext = pbxt_extensions;
while (*ext) {
if (strcmp(cptr, *ext) == 0)
goto ret_name;
ext++;
}
cptr = file_name;
}
}
ret_name:
len = cptr - file_name;
if (len > size-1)
len = size-1;
memcpy(tab_name, file_name, len);
tab_name[len] = 0;
/* Return a pointer to what was removed! */
return file_name + len;
}
static void tab_get_row_file_name(char *table_name, char *name, xtTableID tab_id)
{
sprintf(table_name, "%s-%lu.xtr", name, (u_long) tab_id);
}
static void tab_get_data_file_name(char *table_name, char *name, xtTableID XT_UNUSED(tab_id))
{
sprintf(table_name, "%s.xtd", name);
}
static void tab_get_index_file_name(char *table_name, char *name, xtTableID XT_UNUSED(tab_id))
{
sprintf(table_name, "%s.xti", name);
}
static void tab_free_by_id(XTThreadPtr self, void *XT_UNUSED(thunk), void *item)
{
XTTableEntryPtr te_ptr = (XTTableEntryPtr) item;
if (te_ptr->te_tab_name) {
xt_free(self, te_ptr->te_tab_name);
te_ptr->te_tab_name = NULL;
}
te_ptr->te_tab_id = 0;
te_ptr->te_heap_tab = FALSE;
te_ptr->te_table = NULL;
}
static int tab_comp_by_id(XTThreadPtr XT_UNUSED(self), register const void *XT_UNUSED(thunk), register const void *a, register const void *b)
{
xtTableID te_id = *((xtTableID *) a);
XTTableEntryPtr te_ptr = (XTTableEntryPtr) b;
if (te_id < te_ptr->te_tab_id)
return -1;
if (te_id == te_ptr->te_tab_id)
return 0;
return 1;
}
static void tab_free_path(XTThreadPtr self, void *XT_UNUSED(thunk), void *item)
{
XTTablePathPtr tp_ptr = *((XTTablePathPtr *) item);
xt_free(self, tp_ptr);
}
static int tab_comp_path(XTThreadPtr XT_UNUSED(self), register const void *XT_UNUSED(thunk), register const void *a, register const void *b)
{
char *path = (char *) a;
XTTablePathPtr tp_ptr = *((XTTablePathPtr *) b);
return xt_tab_compare_paths(path, tp_ptr->tp_path);
}
static xtBool tab_get_name_value(XTTableDescPtr td, char **ret_name, char **ret_value)
{
char *ptr = td->x.z.td_curr_ptr;
while (*ptr && isspace(*ptr)) ptr++;
if (!*ptr) {
td->x.z.td_curr_ptr = ptr;
return FALSE;
}
*ret_name = ptr;
while (*ptr && *ptr != '=' && *ptr != '\r' && *ptr != '\n') ptr++;
if (*ptr == '=') {
*ptr = 0;
ptr++;
*ret_value = ptr;
while (*ptr && *ptr != '\r' && *ptr != '\n') ptr++;
if (*ptr) {
*ptr = 0;
ptr++;
}
}
else {
if (*ptr) {
*ptr = 0;
ptr++;
}
*ret_value = NULL;
}
td->x.z.td_curr_ptr = ptr;
return TRUE;
}
xtPublic void xt_describe_tables_init(XTThreadPtr self, XTDatabaseHPtr db, XTTableDescPtr td)
{
char pbuf[PATH_MAX];
td->td_db = db;
xt_strcpy(PATH_MAX, pbuf, db->db_main_path);
xt_add_tables_file(PATH_MAX, pbuf);
if (xt_fs_exists(pbuf))
td->td_type = XT_TD_FROM_TAB_FILE;
else
td->td_type = XT_TD_FROM_DIRECTORY;
switch (td->td_type) {
case XT_TD_FROM_DIRECTORY:
td->x.y.td_path_idx = 0;
if (td->x.y.td_path_idx < xt_sl_get_size(db->db_table_paths)) {
XTTablePathPtr *tp_ptr;
tp_ptr = (XTTablePathPtr *) xt_sl_item_at(db->db_table_paths, td->x.y.td_path_idx);
td->td_tab_path = *tp_ptr;
td->x.y.td_open_dir = xt_dir_open(self, td->td_tab_path->tp_path, "*.xtr");
}
else
td->x.y.td_open_dir = NULL;
break;
case XT_TD_FROM_TAB_FILE:
XTOpenFilePtr of;
int len;
char *buffer;
char *name;
char *value;
of = xt_open_file(self, pbuf, XT_FT_STANDARD, XT_FS_DEFAULT, 1024);
pushr_(xt_close_file, of);
len = (int) xt_seek_eof_file(self, of);
buffer = (char *) xt_malloc(self, len + 1);
pushr_(xt_free, buffer);
if (!xt_pread_file(of, 0, len, len, buffer, NULL, &self->st_statistics.st_x, self))
xt_throw(self);
buffer[len] = 0;
popr_(); // Discard xt_free(buffer)
freer_(); // xt_close_file(of)
td->x.z.td_table_info = buffer;
td->x.z.td_curr_ptr = buffer;
while (tab_get_name_value(td, &name, &value)) {
if (strcmp(name, "[table]") == 0)
break;
}
break;
}
}
xtPublic xtBool xt_describe_tables_next(XTThreadPtr self, XTTableDescPtr td)
{
char *tab_name;
xtBool r = FALSE;
enter_();
switch (td->td_type) {
case XT_TD_FROM_DIRECTORY:
retry:
if (!td->x.y.td_open_dir)
return_(FALSE);
try_(a) {
r = xt_dir_next(self, td->x.y.td_open_dir);
}
catch_(a) {
xt_describe_tables_exit(self, td);
throw_();
}
cont_(a);
if (!r) {
XTTablePathPtr *tp_ptr;
if (td->x.y.td_path_idx+1 >= xt_sl_get_size(td->td_db->db_table_paths))
return_(FALSE);
if (td->x.y.td_open_dir)
xt_dir_close(NULL, td->x.y.td_open_dir);
td->x.y.td_open_dir = NULL;
td->x.y.td_path_idx++;
tp_ptr = (XTTablePathPtr *) xt_sl_item_at(td->td_db->db_table_paths, td->x.y.td_path_idx);
td->td_tab_path = *tp_ptr;
td->x.y.td_open_dir = xt_dir_open(self, td->td_tab_path->tp_path, "*.xtr");
goto retry;
}
tab_name = xt_dir_name(self, td->x.y.td_open_dir);
td->td_tab_id = (xtTableID) xt_file_name_to_id(tab_name);
xt_tab_file_to_name(XT_TABLE_NAME_SIZE, td->td_tab_name, tab_name);
td->td_heap_tab = FALSE;
break;
case XT_TD_FROM_TAB_FILE:
char *name;
char *value;
td->td_tab_id = 0;
while (tab_get_name_value(td, &name, &value)) {
if (strcmp(name, "name") == 0)
xt_strcpy(XT_TABLE_NAME_SIZE, td->td_tab_name, value);
else if (strcmp(name, "id") == 0) {
u_long lvalue = 0;
sscanf(value, "%lu", &lvalue);
td->td_tab_id = (xtTableID) lvalue;
}
else if (strcmp(name, "storage") == 0) {
if (strcmp(value, "heap") == 0)
td->td_heap_tab = TRUE;
else /* disk */
td->td_heap_tab = FALSE;
}
else if (strcmp(name, "location") == 0) {
XTTablePathPtr *tp;
XTTablePathPtr db_path;
#ifdef XT_WIN
char *ptr = value;
/* Convert path to WIN path: */
while (*ptr) {
if (*ptr == '/')
*ptr = '\\';
ptr++;
}
#endif
if ((tp = (XTTablePathPtr *) xt_sl_find(self, td->td_db->db_table_paths, value)))
db_path = *tp;
else {
size_t len;
len = strlen(value);
db_path = (XTTablePathPtr) xt_malloc(self, offsetof(XTTablePathRec, tp_path) + len + 1);
db_path->tp_tab_count = 0;
memcpy(db_path->tp_path, value, len);
db_path->tp_path[len] = 0;
xt_sl_insert(self, td->td_db->db_table_paths, db_path->tp_path, &db_path);
}
td->td_tab_path = db_path;
}
else if (strcmp(name, "type") == 0) {
u_long lvalue = 0;
sscanf(value, "%lu", &lvalue);
td->td_tab_type = (xtWord1) lvalue;
}
else if (strcmp(name, "[table]") == 0)
break;
}
if (!td->td_tab_id)
return_(FALSE);
break;
}
return_(TRUE);
}
xtPublic void xt_describe_tables_exit(XTThreadPtr self, XTTableDescPtr td)
{
switch (td->td_type) {
case XT_TD_FROM_DIRECTORY:
if (td->x.y.td_open_dir)
xt_dir_close(NULL, td->x.y.td_open_dir);
td->x.y.td_open_dir = NULL;
break;
case XT_TD_FROM_TAB_FILE:
if (td->x.z.td_table_info) {
xt_free(self, td->x.z.td_table_info);
td->x.z.td_table_info = NULL;
}
td->x.z.td_curr_ptr = NULL;
break;
}
td->td_tab_path = NULL;
}
xtPublic void xt_tab_init_db(XTThreadPtr self, XTDatabaseHPtr db)
{
XTTableDescRec desc;
XTTableEntryRec te_tab;
XTTableEntryPtr te_ptr;
XTTablePathPtr db_path;
char pbuf[PATH_MAX];
int len;
u_int edx;
enter_();
pushr_(xt_tab_exit_db, db);
if (pbxt_ignore_case)
db->db_tables = xt_new_hashtable(self, tab_list_comp_ci, tab_list_hash_ci, tab_list_free, TRUE, TRUE);
else
db->db_tables = xt_new_hashtable(self, tab_list_comp, tab_list_hash, tab_list_free, TRUE, TRUE);
db->db_table_by_id = xt_new_sortedlist(self, sizeof(XTTableEntryRec), 20, 20, tab_comp_by_id, db, tab_free_by_id, FALSE, FALSE);
db->db_table_paths = xt_new_sortedlist(self, sizeof(XTTablePathPtr), 20, 20, tab_comp_path, db, tab_free_path, FALSE, FALSE);
db->db_error_list = xt_new_sortedlist(self, sizeof(XTTableError), 20, 20, tab_comp_tab_error, db, NULL, TRUE, FALSE);
if (db->db_multi_path) {
XTOpenFilePtr of;
char *buffer, *ptr, *path;
xt_strcpy(PATH_MAX, pbuf, db->db_main_path);
xt_add_tables_file(PATH_MAX, pbuf);
if (!xt_fs_exists(pbuf)) {
/* Load the location file, if a tables file does not
* exists:
*/
xt_strcpy(PATH_MAX, pbuf, db->db_main_path);
xt_add_location_file(PATH_MAX, pbuf);
if (xt_fs_exists(pbuf)) {
of = xt_open_file(self, pbuf, XT_FT_STANDARD, XT_FS_DEFAULT, 1024);
pushr_(xt_close_file, of);
len = (int) xt_seek_eof_file(self, of);
buffer = (char *) xt_malloc(self, len + 1);
pushr_(xt_free, buffer);
if (!xt_pread_file(of, 0, len, len, buffer, NULL, &self->st_statistics.st_x, self))
xt_throw(self);
buffer[len] = 0;
ptr = buffer;
while (*ptr) {
/* Ignore preceeding space: */
while (*ptr && isspace(*ptr))
ptr++;
path = ptr;
while (*ptr && *ptr != '\n' && *ptr != '\r') {
#ifdef XT_WIN
/* Undo the conversion below: */
if (*ptr == '/')
*ptr = '\\';
#endif
ptr++;
}
if (*path != '#' && ptr > path) {
len = (int) (ptr - path);
db_path = (XTTablePathPtr) xt_malloc(self, offsetof(XTTablePathRec, tp_path) + len + 1);
db_path->tp_tab_count = 0;
memcpy(db_path->tp_path, path, len);
db_path->tp_path[len] = 0;
xt_sl_insert(self, db->db_table_paths, db_path->tp_path, &db_path);
}
ptr++;
}
freer_(); // xt_free(buffer)
freer_(); // xt_close_file(of)
}
}
}
else {
len = (int) strlen(db->db_main_path);
db_path = (XTTablePathPtr) xt_malloc(self, offsetof(XTTablePathRec, tp_path) + len + 1);
db_path->tp_tab_count = 0;
strcpy(db_path->tp_path, db->db_main_path);
xt_sl_insert(self, db->db_table_paths, db_path->tp_path, &db_path);
}
xt_describe_tables_init(self, db, &desc);
pushr_(xt_describe_tables_exit, &desc);
while (xt_describe_tables_next(self, &desc)) {
te_tab.te_tab_id = desc.td_tab_id;
te_tab.te_heap_tab = desc.td_heap_tab;
if (te_tab.te_tab_id > db->db_curr_tab_id)
db->db_curr_tab_id = te_tab.te_tab_id;
te_tab.te_tab_name = xt_dup_string(self, desc.td_tab_name);
te_tab.te_tab_path = desc.td_tab_path;
desc.td_tab_path->tp_tab_count++;
te_tab.te_table = NULL;
te_tab.te_type = desc.td_tab_type;
xt_sl_insert(self, db->db_table_by_id, &desc.td_tab_id, &te_tab);
}
freer_(); // xt_describe_tables_exit(&desc)
/*
* When we open all tables, we ignore problems with foreign keys.
* This must be done or we will not be able to load tables that
* were created with foreign key checks off.
*/
self->st_ignore_fkeys = 1;
/*
* The purpose of this code is to ensure that all tables are opened and cached,
* which is actually only required if tables have foreign key references.
*
* In other words, a side affect of this code is that FK references between tables
* are registered, and checked.
*
* Unfortunately we don't know if a table is referenced by a FK, so we have to open
* all tables.
*
* Cannot open tables in the loop above because db->db_table_by_id which is built
* above is used by xt_use_table_no_lock()
*
* {TABLE-STATS}
* NOTE: The code also lead to the statistics failing to work because
* the tables were already open when the handler was opened.
* Previously we only caclulated statistics when a handler was opened
* and the underlying table was also opened.
*/
XTTableHPtr tab;
xt_enum_tables_init(&edx);
while ((te_ptr = xt_enum_tables_next(self, db, &edx))) {
xt_strcpy(PATH_MAX, pbuf, te_ptr->te_tab_path->tp_path);
xt_add_dir_char(PATH_MAX, pbuf);
xt_strcat(PATH_MAX, pbuf, te_ptr->te_tab_name);
if ((tab = xt_use_table_no_lock_ns(db, (XTPathStrPtr) pbuf, FALSE, FALSE, NULL)))
xt_heap_release_ns(tab);
else
xt_log_and_clear_warning(self);
}
self->st_ignore_fkeys = 0;
popr_(); // Discard xt_tab_exit_db(db)
exit_();
}
static void tab_save_tables(XTThreadPtr self, XTDatabaseHPtr db)
{
XTTableEntryPtr te_ptr;
XTStringBufferRec buffer;
XTOpenFilePtr of;
char path[PATH_MAX];
memset(&buffer, 0, sizeof(buffer));
xt_strcpy(PATH_MAX, path, db->db_main_path);
xt_add_tables_file(PATH_MAX, path);
if (xt_sl_get_size(db->db_table_by_id)) {
pushr_(xt_sb_free, &buffer);
for (u_int i=0; i<xt_sl_get_size(db->db_table_by_id); i++) {
te_ptr = (XTTableEntryPtr) xt_sl_item_at(db->db_table_by_id, i);
xt_sb_concat(self, &buffer, "[table]\n");
xt_sb_concat(self, &buffer, "id=");
xt_sb_concat_int8(self, &buffer, (xtInt8) te_ptr->te_tab_id);
xt_sb_concat(self, &buffer, "\n");
xt_sb_concat(self, &buffer, "name=");
xt_sb_concat(self, &buffer, te_ptr->te_tab_name);
xt_sb_concat(self, &buffer, "\n");
xt_sb_concat(self, &buffer, "location=");
xt_sb_concat(self, &buffer, te_ptr->te_tab_path->tp_path);
xt_sb_concat(self, &buffer, "\n");
xt_sb_concat(self, &buffer, "storage=");
if (te_ptr->te_heap_tab)
xt_sb_concat(self, &buffer, "heap\n");
else
xt_sb_concat(self, &buffer, "disk\n");
xt_sb_concat(self, &buffer, "type=");
xt_sb_concat_int8(self, &buffer, (xtInt8) te_ptr->te_type);
xt_sb_concat(self, &buffer, "\n");
}
#ifdef XT_WIN
/* To make the location file cross-platform (at least
* as long as relative paths are used) we replace all '\'
* with '/': */
char *ptr;
ptr = buffer.sb_cstring;
while (*ptr) {
if (*ptr == '\\')
*ptr = '/';
ptr++;
}
#endif
of = xt_open_file(self, path, XT_FT_STANDARD, XT_FS_CREATE | XT_FS_MAKE_PATH, 1024);
pushr_(xt_close_file, of);
if (!xt_pwrite_file(of, 0, strlen(buffer.sb_cstring), buffer.sb_cstring, &self->st_statistics.st_x, self))
xt_throw(self);
xt_set_eof_file(self, of, strlen(buffer.sb_cstring));
freer_(); // xt_close_file(of)
freer_(); // xt_sb_free(&buffer);
}
else
xt_fs_delete(NULL, path);
}
static void tab_save_table_paths(XTThreadPtr self, XTDatabaseHPtr db)
{
XTTablePathPtr *tp_ptr;
XTStringBufferRec buffer;
XTOpenFilePtr of;
char path[PATH_MAX];
memset(&buffer, 0, sizeof(buffer));
xt_strcpy(PATH_MAX, path, db->db_main_path);
xt_add_location_file(PATH_MAX, path);
if (xt_sl_get_size(db->db_table_paths)) {
pushr_(xt_sb_free, &buffer);
for (u_int i=0; i<xt_sl_get_size(db->db_table_paths); i++) {
tp_ptr = (XTTablePathPtr *) xt_sl_item_at(db->db_table_paths, i);
xt_sb_concat(self, &buffer, (*tp_ptr)->tp_path);
xt_sb_concat(self, &buffer, "\n");
}
#ifdef XT_WIN
/* To make the location file cross-platform (at least
* as long as relative paths are used) we replace all '\'
* with '/': */
char *ptr;
ptr = buffer.sb_cstring;
while (*ptr) {
if (*ptr == '\\')
*ptr = '/';
ptr++;
}
#endif
of = xt_open_file(self, path, XT_FT_STANDARD, XT_FS_CREATE | XT_FS_MAKE_PATH, 1024);
pushr_(xt_close_file, of);
if (!xt_pwrite_file(of, 0, strlen(buffer.sb_cstring), buffer.sb_cstring, &self->st_statistics.st_x, self))
xt_throw(self);
xt_set_eof_file(self, of, strlen(buffer.sb_cstring));
freer_(); // xt_close_file(of)
freer_(); // xt_sb_free(&buffer);
}
else
xt_fs_delete(NULL, path);
}
static XTTablePathPtr tab_get_table_path(XTThreadPtr self, XTDatabaseHPtr db, XTPathStrPtr tab_name, xtBool save_it)
{
XTTablePathPtr *tp, tab_path;
char path[PATH_MAX];
xt_strcpy(PATH_MAX, path, tab_name->ps_path);
xt_remove_last_name_of_path(path);
xt_remove_dir_char(path);
tp = (XTTablePathPtr *) xt_sl_find(self, db->db_table_paths, path);
if (tp)
tab_path = *tp;
else {
int len = (int) strlen(path);
tab_path = (XTTablePathPtr) xt_malloc(self, offsetof(XTTablePathRec, tp_path) + len + 1);
tab_path->tp_tab_count = 0;
memcpy(tab_path->tp_path, path, len);
tab_path->tp_path[len] = 0;
xt_sl_insert(self, db->db_table_paths, tab_path->tp_path, &tab_path);
if (save_it) {
tab_save_table_paths(self, db);
if (xt_sl_get_size(db->db_table_paths) == 1) {
XTSystemTableShare::createSystemTables(self, db);
}
}
}
tab_path->tp_tab_count++;
return tab_path;
}
static void tab_remove_table_path(XTThreadPtr self, XTDatabaseHPtr db, XTTablePathPtr tab_path)
{
if (tab_path->tp_tab_count > 0) {
tab_path->tp_tab_count--;
if (tab_path->tp_tab_count == 0) {
xt_sl_delete(self, db->db_table_paths, tab_path->tp_path);
tab_save_table_paths(self, db);
}
}
}
static void tab_free_table_path(XTThreadPtr self, XTTablePathPtr tab_path)
{
XTDatabaseHPtr db = self->st_database;
tab_remove_table_path(self, db, tab_path);
}
xtPublic void xt_tab_exit_db(XTThreadPtr self, XTDatabaseHPtr db)
{
if (db->db_tables) {
xt_free_hashtable(self, db->db_tables);
db->db_tables = NULL;
}
if (db->db_table_by_id) {
xt_free_sortedlist(self, db->db_table_by_id);
db->db_table_by_id = NULL;
}
if (db->db_table_paths) {
xt_free_sortedlist(self, db->db_table_paths);
db->db_table_paths = NULL;
}
if (db->db_error_list) {
xt_free_sortedlist(self, db->db_error_list);
db->db_error_list = NULL;
}
}
xtPublic xtBool xt_table_exists(XTDatabaseHPtr db)
{
return xt_sl_get_size(db->db_table_by_id) > 0;
}
/*
* Enumerate all tables in the current database.
*/
xtPublic void xt_enum_tables_init(u_int *edx)
{
*edx = 0;
}
xtPublic XTTableEntryPtr xt_enum_tables_next(XTThreadPtr XT_UNUSED(self), XTDatabaseHPtr db, u_int *edx)
{
XTTableEntryPtr en_ptr;
if (*edx >= xt_sl_get_size(db->db_table_by_id))
return NULL;
en_ptr = (XTTableEntryPtr) xt_sl_item_at(db->db_table_by_id, *edx);
(*edx)++;
return en_ptr;
}
xtPublic void xt_enum_files_of_tables_init(XTPathStrPtr tab_name, xtTableID tab_id, XTFilesOfTablePtr ft)
{
ft->ft_state = 0;
ft->ft_tab_name = tab_name;
ft->ft_tab_id = tab_id;
}
xtPublic xtBool xt_enum_files_of_tables_next(XTFilesOfTablePtr ft)
{
char file_name[XT_MAX_TABLE_FILE_NAME_SIZE];
retry:
switch (ft->ft_state) {
case 0:
tab_get_row_file_name(file_name, xt_last_name_of_path(ft->ft_tab_name->ps_path), ft->ft_tab_id);
break;
case 1:
tab_get_data_file_name(file_name, xt_last_name_of_path(ft->ft_tab_name->ps_path), ft->ft_tab_id);
break;
case 2:
tab_get_index_file_name(file_name, xt_last_name_of_path(ft->ft_tab_name->ps_path), ft->ft_tab_id);
break;
default:
return FAILED;
}
ft->ft_state++;
xt_strcpy(PATH_MAX, ft->ft_file_path, ft->ft_tab_name->ps_path);
xt_remove_last_name_of_path(ft->ft_file_path);
xt_strcat(PATH_MAX, ft->ft_file_path, file_name);
if (!xt_fs_exists(ft->ft_file_path))
goto retry;
return TRUE;
}
static xtBool tab_find_table(XTThreadPtr self, XTDatabaseHPtr db, XTPathStrPtr name, xtTableID *tab_id)
{
u_int edx;
XTTableEntryPtr te_ptr;
char path[PATH_MAX];
xt_enum_tables_init(&edx);
while ((te_ptr = xt_enum_tables_next(self, db, &edx))) {
xt_strcpy(PATH_MAX, path, te_ptr->te_tab_path->tp_path);
xt_add_dir_char(PATH_MAX, path);
xt_strcat(PATH_MAX, path, te_ptr->te_tab_name);
if (xt_tab_compare_names(path, name->ps_path) == 0) {
*tab_id = te_ptr->te_tab_id;
return TRUE;
}
}
return FALSE;
}
xtPublic void xt_tab_disable_index(XTTableHPtr tab, u_int ind_error)
{
tab->tab_dic.dic_disable_index = ind_error;
xt_tab_set_table_repair_pending(tab);
}
xtPublic void xt_tab_set_index_error(XTTableHPtr tab)
{
switch (tab->tab_dic.dic_disable_index) {
case XT_INDEX_OK:
break;
case XT_INDEX_TOO_OLD:
xt_register_taberr(XT_REG_CONTEXT, XT_ERR_INDEX_OLD_VERSION, tab->tab_name);
break;
case XT_INDEX_TOO_NEW:
xt_register_taberr(XT_REG_CONTEXT, XT_ERR_INDEX_NEW_VERSION, tab->tab_name);
break;
case XT_INDEX_BAD_BLOCK:
char number[40];
sprintf(number, "%d", (int) tab->tab_index_page_size);
xt_register_i2xterr(XT_REG_CONTEXT, XT_ERR_BAD_IND_BLOCK_SIZE, xt_last_name_of_path(tab->tab_name->ps_path), number);
break;
case XT_INDEX_CORRUPTED:
xt_register_taberr(XT_REG_CONTEXT, XT_ERR_INDEX_CORRUPTED, tab->tab_name);
break;
case XT_INDEX_MISSING:
xt_register_taberr(XT_REG_CONTEXT, XT_ERR_INDEX_MISSING, tab->tab_name);
break;
case XT_INDEX_NOT_RECOVERED:
xt_register_taberr(XT_REG_CONTEXT, XT_ERR_INDEX_NOT_RECOVERED, tab->tab_name);
break;
}
}
static void tab_load_index_header(XTThreadPtr self, XTTableHPtr tab, XTOpenFilePtr file, XTPathStrPtr table_name)
{
XT_NODE_TEMP;
XTIndexPtr *ind;
xtWord1 *data;
XTIndexFormatDPtr index_fmt;
/* Load the pointers: */
if (tab->tab_index_head)
xt_free_ns(tab->tab_index_head);
tab->tab_index_head = (XTIndexHeadDPtr) xt_calloc(self, XT_INDEX_HEAD_SIZE);
if (file) {
if (!xt_pread_file(file, 0, XT_INDEX_HEAD_SIZE, 0, tab->tab_index_head, NULL, &self->st_statistics.st_ind, self))
xt_throw(self);
tab->tab_index_format_offset = XT_GET_DISK_4(tab->tab_index_head->tp_format_offset_4);
index_fmt = (XTIndexFormatDPtr) (((xtWord1 *) tab->tab_index_head) + tab->tab_index_format_offset);
/* If the table version is less than or equal to an incompatible (unsupported
* version), or greater than the current version, then we cannot open this table
*/
if (XT_GET_DISK_2(index_fmt->if_tab_version_2) <= XT_TAB_INCOMPATIBLE_VERSION ||
XT_GET_DISK_2(index_fmt->if_tab_version_2) > XT_TAB_CURRENT_VERSION) {
switch (XT_GET_DISK_2(index_fmt->if_tab_version_2)) {
case 4:
xt_throw_tabcolerr(XT_CONTEXT, XT_ERR_UPGRADE_TABLE, table_name, "0.9.91 Beta");
break;
case 3:
xt_throw_tabcolerr(XT_CONTEXT, XT_ERR_UPGRADE_TABLE, table_name, "0.9.85 Beta");
break;
default:
xt_throw_taberr(XT_CONTEXT, XT_ERR_BAD_TABLE_VERSION, table_name);
break;
}
return;
}
tab->tab_dic.dic_index_ver = XT_GET_DISK_2(index_fmt->if_ind_version_2);
tab->tab_dic.dic_disable_index = XT_INDEX_OK;
if (tab->tab_dic.dic_index_ver == 1) {
tab->tab_index_header_size = 1024 * 16;
tab->tab_index_page_size = 1024 * 16;
}
else {
tab->tab_index_header_size = XT_GET_DISK_4(tab->tab_index_head->tp_header_size_4);
tab->tab_index_page_size = XT_GET_DISK_4(index_fmt->if_page_size_4);
}
#ifdef XT_USE_LAZY_DELETE
if (tab->tab_dic.dic_index_ver <= XT_IND_NO_LAZY_DELETE)
tab->tab_dic.dic_no_lazy_delete = TRUE;
else
tab->tab_dic.dic_no_lazy_delete = FALSE;
#else
tab->tab_dic.dic_no_lazy_delete = TRUE;
#endif
/* Incorrect version of index is handled by allowing a sequential scan, but no index access.
* Recovery with the wrong index type will not recover the indexes, a REPAIR TABLE
* will be required!
*/
if (tab->tab_dic.dic_index_ver != XT_IND_CURRENT_VERSION) {
switch (tab->tab_dic.dic_index_ver) {
case XT_IND_NO_LAZY_DELETE:
case XT_IND_LAZY_DELETE_OK:
/* I can handle this type of index. */
break;
default:
if (tab->tab_dic.dic_index_ver < XT_IND_CURRENT_VERSION)
xt_tab_disable_index(tab, XT_INDEX_TOO_OLD);
else
xt_tab_disable_index(tab, XT_INDEX_TOO_NEW);
break;
}
}
else if (tab->tab_index_page_size != XT_INDEX_PAGE_SIZE)
xt_tab_disable_index(tab, XT_INDEX_BAD_BLOCK);
}
else {
memset(tab->tab_index_head, 0, XT_INDEX_HEAD_SIZE);
xt_tab_disable_index(tab, XT_INDEX_MISSING);
tab->tab_index_header_size = XT_INDEX_HEAD_SIZE;
tab->tab_index_page_size = XT_INDEX_PAGE_SIZE;
tab->tab_dic.dic_index_ver = 0;
tab->tab_index_format_offset = 0;
}
if (tab->tab_dic.dic_disable_index) {
xt_tab_set_index_error(tab);
xt_log_and_clear_exception_ns();
}
if (tab->tab_dic.dic_disable_index) {
/* Reset, as if we have empty indexes.
* Flush will wipe things out, of course.
* REPAIR TABLE will be required...
*/
XT_NODE_ID(tab->tab_ind_eof) = 1;
XT_NODE_ID(tab->tab_ind_free) = 0;
ind = tab->tab_dic.dic_keys;
for (u_int i=0; i<tab->tab_dic.dic_key_count; i++, ind++)
XT_NODE_ID((*ind)->mi_root) = 0;
}
else {
XT_NODE_ID(tab->tab_ind_eof) = (xtIndexNodeID) XT_GET_DISK_6(tab->tab_index_head->tp_ind_eof_6);
XT_NODE_ID(tab->tab_ind_free) = (xtIndexNodeID) XT_GET_DISK_6(tab->tab_index_head->tp_ind_free_6);
data = tab->tab_index_head->tp_data;
ind = tab->tab_dic.dic_keys;
for (u_int i=0; i<tab->tab_dic.dic_key_count; i++, ind++) {
(*ind)->mi_root = XT_GET_NODE_REF(tab, data);
data += XT_NODE_REF_SIZE;
}
}
}
static void tab_load_table_format(XTThreadPtr self, XTOpenFilePtr file, XTPathStrPtr table_name, size_t *ret_format_offset, size_t *ret_head_size, XTDictionaryPtr dic)
{
XTDiskValue4 size_buf;
size_t head_size;
XTTableFormatDRec tab_fmt;
size_t fmt_size;
if (!xt_pread_file(file, 0, 4, 4, &size_buf, NULL, &self->st_statistics.st_rec, self))
xt_throw(self);
head_size = XT_GET_DISK_4(size_buf);
*ret_format_offset = head_size;
/* Load the table format information: */
if (!xt_pread_file(file, head_size, offsetof(XTTableFormatDRec, tf_definition), offsetof(XTTableFormatDRec, tf_tab_version_2) + 2, &tab_fmt, NULL, &self->st_statistics.st_rec, self))
xt_throw(self);
/* If the table version is less than or equal to an incompatible (unsupported
* version), or greater than the current version, then we cannot open this table
*/
if (XT_GET_DISK_2(tab_fmt.tf_tab_version_2) <= XT_TAB_INCOMPATIBLE_VERSION ||
XT_GET_DISK_2(tab_fmt.tf_tab_version_2) > XT_TAB_CURRENT_VERSION) {
switch (XT_GET_DISK_2(tab_fmt.tf_tab_version_2)) {
case 4:
xt_throw_tabcolerr(XT_CONTEXT, XT_ERR_UPGRADE_TABLE, table_name, "0.9.91 Beta");
break;
case 3:
xt_throw_tabcolerr(XT_CONTEXT, XT_ERR_UPGRADE_TABLE, table_name, "0.9.85 Beta");
break;
default:
xt_throw_taberr(XT_CONTEXT, XT_ERR_BAD_TABLE_VERSION, table_name);
break;
}
return;
}
fmt_size = XT_GET_DISK_4(tab_fmt.tf_format_size_4);
*ret_head_size = XT_GET_DISK_4(tab_fmt.tf_tab_head_size_4);
dic->dic_rec_size = XT_GET_DISK_4(tab_fmt.tf_rec_size_4);
dic->dic_rec_fixed = XT_GET_DISK_1(tab_fmt.tf_rec_fixed_1);
dic->dic_min_auto_inc = XT_GET_DISK_8(tab_fmt.tf_min_auto_inc_8);
if (fmt_size > offsetof(XTTableFormatDRec, tf_definition)) {
size_t def_size = fmt_size - offsetof(XTTableFormatDRec, tf_definition);
char *def_sql;
pushsr_(def_sql, xt_free, (char *) xt_malloc(self, def_size));
if (!xt_pread_file(file, head_size+offsetof(XTTableFormatDRec, tf_definition), def_size, def_size, def_sql, NULL, &self->st_statistics.st_rec, self))
xt_throw(self);
dic->dic_table = xt_ri_create_table(self, false, table_name, def_sql, myxt_create_table_from_table(self, dic->dic_my_table), NULL);
freer_(); // xt_free(def_sql)
}
else
dic->dic_table = myxt_create_table_from_table(self, dic->dic_my_table);
}
static void tab_load_table_header(XTThreadPtr self, XTTableHPtr tab, XTOpenFilePtr file)
{
XTTableHeadDRec rec_head;
if (!xt_pread_file(file, 0, sizeof(XTTableHeadDRec), sizeof(XTTableHeadDRec), (xtWord1 *) &rec_head, NULL, &self->st_statistics.st_rec, self))
xt_throw(self);
tab->tab_head_op_seq = XT_GET_DISK_4(rec_head.th_op_seq_4);
tab->tab_head_row_free_id = (xtRowID) XT_GET_DISK_6(rec_head.th_row_free_6);
tab->tab_head_row_eof_id = (xtRowID) XT_GET_DISK_6(rec_head.th_row_eof_6);
tab->tab_head_row_fnum = (xtWord4) XT_GET_DISK_6(rec_head.th_row_fnum_6);
tab->tab_head_rec_free_id = (xtRecordID) XT_GET_DISK_6(rec_head.th_rec_free_6);
tab->tab_head_rec_eof_id = (xtRecordID) XT_GET_DISK_6(rec_head.th_rec_eof_6);
tab->tab_head_rec_fnum = (xtWord4) XT_GET_DISK_6(rec_head.th_rec_fnum_6);
tab->tab_wr_op_seq = tab->tab_head_op_seq;
}
xtPublic void xt_tab_store_header(XTOpenTablePtr ot, XTTableHeadDPtr rec_head)
{
XTTableHPtr tab = ot->ot_table;
XT_SET_DISK_4(rec_head->th_op_seq_4, tab->tab_head_op_seq);
XT_SET_DISK_6(rec_head->th_row_free_6, tab->tab_head_row_free_id);
XT_SET_DISK_6(rec_head->th_row_eof_6, tab->tab_head_row_eof_id);
XT_SET_DISK_6(rec_head->th_row_fnum_6, tab->tab_head_row_fnum);
XT_SET_DISK_6(rec_head->th_rec_free_6, tab->tab_head_rec_free_id);
XT_SET_DISK_6(rec_head->th_rec_eof_6, tab->tab_head_rec_eof_id);
XT_SET_DISK_6(rec_head->th_rec_fnum_6, tab->tab_head_rec_fnum);
}
static xtBool tab_write_header(XTOpenTablePtr ot, XTTableHeadDPtr rec_head)
{
if (!xt_tab_write_rec(ot, offsetof(XTTableHeadDRec, th_op_seq_4), 40, (xtWord1 *) rec_head->th_op_seq_4))
return FAILED;
if (!XT_FLUSH_RR_FILE(ot->ot_rec_file, &ot->ot_thread->st_statistics.st_rec, ot->ot_thread))
return FAILED;
return OK;
}
xtPublic xtBool xt_tab_write_min_auto_inc(XTOpenTablePtr ot)
{
xtWord1 value[8];
off_t offset;
XT_SET_DISK_8(value, ot->ot_table->tab_dic.dic_min_auto_inc);
offset = ot->ot_table->tab_table_format_offset + offsetof(XTTableFormatDRec, tf_min_auto_inc_8);
if (!xt_tab_write_rec(ot, offset, 8, value))
return FAILED;
if (!XT_FLUSH_RR_FILE(ot->ot_rec_file, &ot->ot_thread->st_statistics.st_rec, ot->ot_thread))
return FAILED;
return OK;
}
/* a helper function to remove table from the open tables hash on exception
* used in tab_new_handle() below
*/
#ifdef NO_LONGER_REQ
static void xt_del_from_db_tables_ht(XTThreadPtr self, XTTableHPtr tab)
{
XTTableEntryPtr te_ptr;
XTDatabaseHPtr db = tab->tab_db;
xtTableID tab_id = tab->tab_id;
/* Oops! should use tab->tab_name, instead of tab! */
xt_ht_del(self, db->db_tables, tab->tab_name);
/* Remove the reference from the ID list, when a table is
* removed from the table name list:
*/
if ((te_ptr = (XTTableEntryPtr) xt_sl_find(self, db->db_table_by_id, &tab_id)))
te_ptr->te_table = NULL;
}
#endif
xtPublic XTFileType xt_rec_file_type(xtBool heap_tab)
{
if (heap_tab)
return XT_FT_HEAP;
if (XT_REC_FILE_TYPE == XT_FT_STANDARD && xt_db_rewrite_flushing)
return XT_FT_REWRITE_FLUSH;
return XT_REC_FILE_TYPE;
}
xtPublic XTFileType xt_row_file_type(xtBool heap_tab)
{
if (heap_tab)
return XT_FT_HEAP;
if (XT_REC_FILE_TYPE == XT_FT_STANDARD && xt_db_rewrite_flushing)
return XT_FT_REWRITE_FLUSH;
return XT_ROW_FILE_TYPE;
}
xtPublic XTFileType xt_ind_file_type(xtBool heap_tab)
{
if (heap_tab)
return XT_FT_HEAP;
if (XT_IND_FILE_TYPE == XT_FT_STANDARD && xt_db_rewrite_flushing)
return XT_FT_REWRITE_FLUSH;
return XT_IND_FILE_TYPE;
}
#ifdef XT_SORT_REC_WRITES
static int tab_cmp_dw_rec_id(struct XTThread *XT_UNUSED(self), register const void *XT_UNUSED(thunk), register const void *a, register const void *b)
{
xtRecordID rec_id = *((xtRecordID *) a);
XTDelayWritePtr dw_ptr = (XTDelayWritePtr) b;
if (rec_id == dw_ptr->dw_rec_id)
return 0;
if (rec_id < dw_ptr->dw_rec_id)
return -1;
return 1;
}
#endif
/*
* Create a new table handle (i.e. open a table).
* Return NULL if the table is missing, and it is OK for the table
* to be missing.
*/
static int tab_new_handle(XTThreadPtr self, XTTableHPtr *r_tab, XTDatabaseHPtr db, xtTableID tab_id, XTPathStrPtr tab_path, xtBool missing_ok, XTDictionaryPtr dic)
{
char path[PATH_MAX];
XTTableHPtr tab;
char file_name[XT_MAX_TABLE_FILE_NAME_SIZE];
XTOpenFilePtr of_rec, of_ind;
XTTableEntryPtr te_ptr;
size_t tab_format_offset;
size_t tab_head_size = 0;
enter_();
te_ptr = (XTTableEntryPtr) xt_sl_find(self, db->db_table_by_id, &tab_id);
ASSERT(te_ptr);
tab = (XTTableHPtr) xt_heap_new(self, sizeof(XTTableHRec), tab_finalize);
pushr_(xt_heap_release, tab);
tab->tab_name = (XTPathStrPtr) xt_dup_string(self, tab_path->ps_path);
tab->tab_db = db;
tab->tab_id = tab_id;
tab->tab_dic.dic_table_type = te_ptr->te_type;
#ifdef TRACE_TABLE_IDS
PRINTF("%s: allocated TABLE: db=%d tab=%d %s\n", self->t_name, (int) db->db_id, (int) tab->tab_id, xt_last_2_names_of_path(tab->tab_name->ps_path));
#endif
if (dic) {
myxt_move_dictionary(&tab->tab_dic, dic);
myxt_setup_dictionary(self, &tab->tab_dic);
}
else {
if (!myxt_load_dictionary(self, &tab->tab_dic, db, tab_path)) {
freer_(); // xt_heap_release(tab)
return_(XT_TAB_NO_DICTIONARY);
}
}
/* Do not use the XT_TF_DDL_TEMP_TABLE bit from the given dic
* This bit depends only on the
* name of the table, and must be set explicitly.
*/
if (myxt_temp_table_name(tab_path->ps_path))
tab->tab_dic.dic_tab_flags |= XT_TF_DDL_TEMP_TABLE;
else
tab->tab_dic.dic_tab_flags &= ~XT_TF_DDL_TEMP_TABLE;
tab->tab_seq.xt_op_seq_init(self);
xt_spinlock_init_with_autoname(self, &tab->tab_ainc_lock);
xt_init_mutex_with_autoname(self, &tab->tab_rec_flush_lock);
xt_init_mutex_with_autoname(self, &tab->tab_ind_flush_lock);
xt_init_mutex_with_autoname(self, &tab->tab_ind_stat_lock);
xt_init_mutex_with_autoname(self, &tab->tab_dic_field_lock);
xt_init_mutex_with_autoname(self, &tab->tab_row_lock);
xt_init_mutex_with_autoname(self, &tab->tab_ind_lock);
xt_init_mutex_with_autoname(self, &tab->tab_rec_lock);
xt_spinlock_init_with_autoname(self, &tab->tab_mem_lock);
if (!(tab->tab_rec_flush_task = new XTFlushRecRowTask()))
xt_throw_errno(XT_CONTEXT, XT_ENOMEM);
tab->tab_rec_flush_task->tk_init(self);
tab->tab_rec_flush_task->frt_table = tab;
if (!(tab->tab_ind_flush_task = new XTFlushIndexTask()))
xt_throw_errno(XT_CONTEXT, XT_ENOMEM);
tab->tab_ind_flush_task->tk_init(self);
tab->tab_ind_flush_task->fit_table = tab;
for (u_int i=0; i<XT_ROW_RWLOCKS; i++)
XT_TAB_ROW_INIT_LOCK(self, &tab->tab_row_rwlock[i]);
tab->tab_free_locks = TRUE;
xt_strcpy(PATH_MAX, path, tab_path->ps_path);
xt_remove_last_name_of_path(path);
tab_get_row_file_name(file_name, xt_last_name_of_path(tab_path->ps_path), tab_id);
xt_strcat(PATH_MAX, path, file_name);
tab->tab_row_file = xt_fs_get_file(self, path, xt_row_file_type(te_ptr->te_heap_tab));
xt_remove_last_name_of_path(path);
tab_get_data_file_name(file_name, xt_last_name_of_path(tab_path->ps_path), tab_id);
xt_strcat(PATH_MAX, path, file_name);
tab->tab_rec_file = xt_fs_get_file(self, path, xt_rec_file_type(te_ptr->te_heap_tab));
xt_remove_last_name_of_path(path);
tab_get_index_file_name(file_name, xt_last_name_of_path(tab_path->ps_path), tab_id);
xt_strcat(PATH_MAX, path, file_name);
tab->tab_ind_file = xt_fs_get_file(self, path, xt_ind_file_type(te_ptr->te_heap_tab));
if (te_ptr->te_heap_tab) {
XTOpenFilePtr of_row;
tab->tab_dic.dic_tab_flags |= XT_TF_MEMORY_TABLE;
of_row = xt_open_file(self, tab->tab_row_file->fil_path, xt_row_file_type(TRUE), XT_FS_CREATE, xt_db_row_file_grow_size);
pushr_(xt_close_file, of_row);
if (xt_seek_eof_file(self, of_row) == 0)
tab_init_row_file(self, of_row, tab, &tab->tab_dic);
freer_(); // xt_close_file(of_row)
of_ind = xt_open_file(self, tab->tab_ind_file->fil_path, xt_ind_file_type(TRUE), XT_FS_CREATE, XT_INDEX_PAGE_SIZE*256);
if (xt_seek_eof_file(self, of_ind) == 0)
tab_init_ind_file(self, of_ind, tab, &tab->tab_dic);
pushr_(xt_close_file, of_ind);
tab_load_index_header(self, tab, of_ind, tab_path);
freer_(); // xt_close_file(of_ind)
of_rec = xt_open_file(self, tab->tab_rec_file->fil_path, xt_rec_file_type(te_ptr->te_heap_tab), XT_FS_CREATE, xt_db_data_file_grow_size);
pushr_(xt_close_file, of_rec);
if (xt_seek_eof_file(self, of_rec) == 0)
tab_init_data_file(self, of_rec, tab, &tab->tab_dic, 0, NULL);
}
else {
#ifdef XT_SORT_REC_WRITES
tab->tab_rec_dw_writes = xt_new_sortedlist(self, sizeof(XTDelayWriteRec), 20, 10, tab_cmp_dw_rec_id, NULL, NULL, TRUE, FALSE);
#endif
of_ind = xt_open_file(self, tab->tab_ind_file->fil_path, xt_ind_file_type(FALSE), XT_FS_MISSING_OK, XT_INDEX_PAGE_SIZE*256);
if (of_ind) {
pushr_(xt_close_file, of_ind);
tab_load_index_header(self, tab, of_ind, tab_path);
freer_(); // xt_close_file(of_ind)
}
else
tab_load_index_header(self, tab, of_ind, tab_path);
of_rec = xt_open_file(self, tab->tab_rec_file->fil_path, xt_rec_file_type(FALSE), missing_ok ? XT_FS_MISSING_OK : XT_FS_DEFAULT, xt_db_data_file_grow_size);
if (!of_rec) {
freer_(); // xt_heap_release(tab)
return_(XT_TAB_NOT_FOUND);
}
pushr_(xt_close_file, of_rec);
}
tab_load_table_format(self, of_rec, tab_path, &tab_format_offset, &tab_head_size, &tab->tab_dic);
tab->tab_table_format_offset = tab_format_offset;
tab->tab_table_head_size = tab_head_size;
tab->tab_dic.dic_table->dt_table = tab;
tab_load_table_header(self, tab, of_rec);
freer_(); // xt_close_file(of_rec)
tab->tab_seq.xt_op_seq_set(self, tab->tab_wr_op_seq+1);
tab->tab_row_eof_id = tab->tab_head_row_eof_id;
tab->tab_row_free_id = tab->tab_head_row_free_id;
tab->tab_row_fnum = tab->tab_head_row_fnum;
tab->tab_rec_eof_id = tab->tab_head_rec_eof_id;
tab->tab_rec_free_id = tab->tab_head_rec_free_id;
tab->tab_rec_fnum = tab->tab_head_rec_fnum;
tab->tab_rows.xt_tc_setup(tab, FALSE, sizeof(XTTabRowHeadDRec), sizeof(XTTabRowRefDRec));
tab->tab_recs.xt_tc_setup(tab, TRUE, tab_head_size, tab->tab_dic.dic_rec_size);
xt_xres_init_tab(self, tab);
if (!xt_init_row_locks(&tab->tab_locks))
xt_throw(self);
xt_heap_set_release_callback(tab, tab_onrelease);
tab->tab_repair_pending = xt_tab_is_table_repair_pending(tab);
popr_(); // Discard xt_heap_release(tab)
xt_ht_put(self, db->db_tables, tab);
/* Add a reference to the ID list, when a table is
* added to the table name list:
*/
te_ptr->te_table = tab;
/* Moved from after xt_init_row_locks() above, so that calling
* xt_use_table_no_lock() with no_load == FALSE from attachReferences()
* will work if we have cyclic foreign key references.
*/
if (tab->tab_dic.dic_table) {
try_(a) {
tab->tab_dic.dic_table->attachReferences(self, db);
}
catch_(a) {
/* Errors are thrown when: set foreign_key_checks = 1 */
/* Undo everything done above: */
xt_ht_del(self, db->db_tables, tab->tab_name);
xt_throw(self);
}
cont_(a);
}
*r_tab = tab;
return_(XT_TAB_OK);
}
/*
* Get a reference to a table in the current database. The table reference is valid,
* as long as the thread is using the database!!!
*/
xtPublic XTTableHPtr xt_use_table_no_lock(XTThreadPtr self, XTDatabaseHPtr db, XTPathStrPtr name, xtBool no_load, xtBool missing_ok, XTDictionaryPtr dic)
{
XTTableHPtr tab;
if (!db)
xt_throw_xterr(XT_CONTEXT, XT_ERR_NO_DATABASE_IN_USE);
tab = (XTTableHPtr) xt_ht_get(self, db->db_tables, name);
if (!tab && !no_load) {
xtTableID tab_id = 0;
if (!tab_find_table(self, db, name, &tab_id)) {
if (missing_ok)
return NULL;
xt_throw_taberr(XT_CONTEXT, XT_ERR_TABLE_NOT_FOUND, name);
}
switch (tab_new_handle(self, &tab, db, tab_id, name, missing_ok, dic)) {
case XT_TAB_NO_DICTIONARY:
xt_throw_taberr(XT_CONTEXT, XT_ERR_NO_DICTIONARY, name);
case XT_TAB_POOL_CLOSED:
xt_throw_ulxterr(XT_CONTEXT, XT_ERR_TABLE_LOCKED, (u_long) tab_id);
case XT_TAB_NOT_FOUND:
if (missing_ok)
return NULL;
xt_throw_taberr(XT_CONTEXT, XT_ERR_TABLE_NOT_FOUND, name);
default:
break;
}
}
if (tab)
xt_heap_reference(self, tab);
return tab;
}
xtPublic XTTableHPtr xt_use_table_no_lock_ns(struct XTDatabase *db, XTPathStrPtr name, xtBool no_load, xtBool missing_ok, XTDictionaryPtr dic)
{
XTTableHPtr tab;
XTThreadPtr self = xt_get_self();
try_(a) {
tab = xt_use_table_no_lock(self, db, name, no_load, missing_ok, dic);
}
catch_(a) {
tab = NULL;
}
cont_(a);
return tab;
}
static void tab_close_table(XTOpenTablePtr ot)
{
xt_ind_free_reserved(ot);
if (ot->ot_rec_file) {
XT_CLOSE_RR_FILE_NS(ot->ot_rec_file);
ot->ot_rec_file = NULL;
}
if (ot->ot_ind_file) {
xt_close_file_ns(ot->ot_ind_file);
ot->ot_ind_file = NULL;
}
if (ot->ot_row_file) {
XT_CLOSE_RR_FILE_NS(ot->ot_row_file);
ot->ot_row_file = NULL;
}
if (ot->ot_table) {
xt_heap_release(xt_get_self(), ot->ot_table);
ot->ot_table = NULL;
}
if (ot->ot_ind_rhandle) {
xt_ind_release_handle(ot->ot_ind_rhandle, FALSE, ot->ot_thread);
ot->ot_ind_rhandle = NULL;
}
if (ot->ot_row_rbuffer) {
xt_free_ns(ot->ot_row_rbuffer);
ot->ot_row_rbuf_size = 0;
ot->ot_row_rbuffer = NULL;
}
if (ot->ot_row_wbuffer) {
xt_free_ns(ot->ot_row_wbuffer);
ot->ot_row_wbuf_size = 0;
ot->ot_row_wbuffer = NULL;
}
#ifdef XT_TRACK_RETURNED_ROWS
if (ot->ot_rows_returned) {
xt_free_ns(ot->ot_rows_returned);
ot->ot_rows_returned = NULL;
}
ot->ot_rows_ret_curr = 0;
ot->ot_rows_ret_max = 0;
#endif
xt_free(NULL, ot);
}
static void tab_delete_table_files(XTThreadPtr self, XTPathStrPtr tab_name, xtTableID tab_id)
{
XTFilesOfTableRec ft;
xt_enum_files_of_tables_init(tab_name, tab_id, &ft);
while (xt_enum_files_of_tables_next(&ft)) {
if (!xt_fs_delete(NULL, ft.ft_file_path))
xt_log_and_clear_exception(self);
}
}
static void tab_init_row_file(XTThreadPtr self, XTOpenFilePtr of_row, XTTableHPtr tab, XTDictionaryPtr XT_UNUSED(dic))
{
XTTabRowHeadDRec row_head;
tab->tab_row_eof_id = 1;
tab->tab_row_free_id = 0;
tab->tab_row_fnum = 0;
tab->tab_head_row_eof_id = 1;
tab->tab_head_row_free_id = 0;
tab->tab_head_row_fnum = 0;
XT_SET_DISK_4(row_head.rh_magic_4, XT_TAB_ROW_MAGIC);
if (!xt_pwrite_file(of_row, 0, sizeof(row_head), &row_head, &self->st_statistics.st_rec, self))
xt_throw(self);
}
static void tab_init_data_file(XTThreadPtr self, XTOpenFilePtr of_rec, XTTableHPtr tab, XTDictionaryPtr dic, size_t def_len, XTStringBufferPtr tab_def)
{
off_t eof;
XTTableHeadDRec rec_head;
XTTableFormatDRec table_fmt;
/* Calculate the offset of the first record in the data handle file. */
eof = sizeof(XTTableHeadDRec) + offsetof(XTTableFormatDRec, tf_definition) + def_len + XT_FORMAT_DEF_SPACE;
eof = (eof + 1024 - 1) / 1024 * 1024; // Round to a value divisible by 1024
tab->tab_table_format_offset = sizeof(XTTableHeadDRec);
tab->tab_table_head_size = (size_t) eof;
tab->tab_rec_eof_id = 1; // This is the first record ID!
tab->tab_rec_free_id = 0;
tab->tab_rec_fnum = 0;
tab->tab_head_rec_eof_id = 1; // The first record ID
tab->tab_head_rec_free_id = 0;
tab->tab_head_rec_fnum = 0;
tab->tab_dic.dic_rec_size = dic->dic_rec_size;
tab->tab_dic.dic_rec_fixed = dic->dic_rec_fixed;
tab->tab_dic.dic_tab_flags = dic->dic_tab_flags;
tab->tab_dic.dic_min_auto_inc = dic->dic_min_auto_inc;
tab->tab_dic.dic_def_ave_row_size = dic->dic_def_ave_row_size;
tab->tab_dic.dic_table_type = dic->dic_table_type;
XT_SET_DISK_4(rec_head.th_head_size_4, sizeof(XTTableHeadDRec));
XT_SET_DISK_4(rec_head.th_op_seq_4, tab->tab_head_op_seq);
XT_SET_DISK_6(rec_head.th_row_free_6, tab->tab_head_row_free_id);
XT_SET_DISK_6(rec_head.th_row_eof_6, tab->tab_head_row_eof_id);
XT_SET_DISK_6(rec_head.th_row_fnum_6, tab->tab_head_row_fnum);
XT_SET_DISK_6(rec_head.th_rec_free_6, tab->tab_head_rec_free_id);
XT_SET_DISK_6(rec_head.th_rec_eof_6, tab->tab_head_rec_eof_id);
XT_SET_DISK_6(rec_head.th_rec_fnum_6, tab->tab_head_rec_fnum);
if (!xt_pwrite_file(of_rec, 0, sizeof(XTTableHeadDRec), &rec_head, &self->st_statistics.st_rec, self))
xt_throw(self);
/* Store the table format: */
memset(&table_fmt, 0, offsetof(XTTableFormatDRec, tf_definition));
XT_SET_DISK_4(table_fmt.tf_format_size_4, offsetof(XTTableFormatDRec, tf_definition) + def_len);
XT_SET_DISK_4(table_fmt.tf_tab_head_size_4, eof);
XT_SET_DISK_2(table_fmt.tf_tab_version_2, XT_TAB_CURRENT_VERSION);
XT_SET_DISK_4(table_fmt.tf_rec_size_4, tab->tab_dic.dic_rec_size);
XT_SET_DISK_1(table_fmt.tf_rec_fixed_1, tab->tab_dic.dic_rec_fixed);
XT_SET_DISK_2(table_fmt.tf_tab_unused_2, 0);
XT_SET_DISK_8(table_fmt.tf_min_auto_inc_8, tab->tab_dic.dic_min_auto_inc);
if (!xt_pwrite_file(of_rec, sizeof(XTTableHeadDRec), offsetof(XTTableFormatDRec, tf_definition), &table_fmt, &self->st_statistics.st_rec, self))
xt_throw(self);
if (def_len) {
if (!xt_pwrite_file(of_rec, sizeof(XTTableHeadDRec) + offsetof(XTTableFormatDRec, tf_definition), def_len, tab_def->sb_cstring, &self->st_statistics.st_rec, self))
xt_throw(self);
}
}
static void tab_init_ind_file(XTThreadPtr self, XTOpenFilePtr of_ind, XTTableHPtr tab, XTDictionaryPtr dic)
{
XTIndexFormatDPtr index_fmt;
/* This is the size of the index header: */
tab->tab_index_format_offset = offsetof(XTIndexHeadDRec, tp_data) + dic->dic_key_count * XT_NODE_REF_SIZE;
if (!(tab->tab_index_head = (XTIndexHeadDPtr) xt_calloc_ns(XT_INDEX_HEAD_SIZE)))
xt_throw(self);
XT_NODE_ID(tab->tab_ind_eof) = 1;
XT_NODE_ID(tab->tab_ind_free) = 0;
XT_SET_DISK_4(tab->tab_index_head->tp_header_size_4, XT_INDEX_HEAD_SIZE);
XT_SET_DISK_4(tab->tab_index_head->tp_format_offset_4, tab->tab_index_format_offset);
XT_SET_DISK_6(tab->tab_index_head->tp_ind_eof_6, XT_NODE_ID(tab->tab_ind_eof));
XT_SET_DISK_6(tab->tab_index_head->tp_ind_free_6, XT_NODE_ID(tab->tab_ind_free));
/* Store the index format: */
index_fmt = (XTIndexFormatDPtr) (((xtWord1 *) tab->tab_index_head) + tab->tab_index_format_offset);
XT_SET_DISK_4(index_fmt->if_format_size_4, sizeof(XTIndexFormatDRec));
XT_SET_DISK_2(index_fmt->if_tab_version_2, XT_TAB_CURRENT_VERSION);
XT_SET_DISK_2(index_fmt->if_ind_version_2, XT_IND_CURRENT_VERSION);
XT_SET_DISK_1(index_fmt->if_node_ref_size_1, XT_NODE_REF_SIZE);
XT_SET_DISK_1(index_fmt->if_rec_ref_size_1, XT_RECORD_REF_SIZE);
XT_SET_DISK_4(index_fmt->if_page_size_4, XT_INDEX_PAGE_SIZE);
/* Save the header: */
if (!xt_pwrite_file(of_ind, 0, XT_INDEX_HEAD_SIZE, tab->tab_index_head, &self->st_statistics.st_ind, self))
xt_throw(self);
}
xtPublic void xt_create_table(XTThreadPtr self, XTPathStrPtr name, XTDictionaryPtr dic)
{
char table_name[XT_MAX_TABLE_FILE_NAME_SIZE];
char path[PATH_MAX];
XTDatabaseHPtr db = self->st_database;
XTOpenTablePoolPtr table_pool;
XTTableHPtr tab;
XTTableHPtr old_tab = NULL;
xtTableID old_tab_id = 0;
xtTableID tab_id = 0;
XTStringBufferRec tab_def = { 0, 0, 0 };
XTTableEntryRec te_tab;
XTSortedListInfoRec li_undo;
#ifdef TRACE_CREATE_TABLES
printf("CREATE %s\n", name->ps_path);
#endif
enter_();
if (strlen(xt_last_name_of_path(name->ps_path)) > XT_TABLE_NAME_SIZE-1)
xt_throw_taberr(XT_CONTEXT, XT_ERR_NAME_TOO_LONG, name);
if (!db)
xt_throw_xterr(XT_CONTEXT, XT_ERR_NO_DATABASE_IN_USE);
/* Lock to prevent table list change during creation. */
table_pool = xt_db_lock_table_pool_by_name(self, self->st_database, name, FALSE, TRUE, TRUE, &old_tab);
pushr_(xt_db_unlock_table_pool, table_pool);
xt_ht_lock(self, db->db_tables);
pushr_(xt_ht_unlock, db->db_tables);
pushr_(xt_heap_release, old_tab);
/* This must be done before we remove the old table
* from the directory, or we will not be able
* to find the table, which could is require
* for TRUNCATE!
*/
if (xt_sl_get_size(db->db_table_by_id) >= XT_MAX_TABLES)
xt_throw_ulxterr(XT_CONTEXT, XT_ERR_TOO_MANY_TABLES, (u_long) XT_MAX_TABLES);
tab_id = db->db_curr_tab_id + 1;
if (old_tab) {
old_tab_id = old_tab->tab_id;
xt_dl_delete_ext_data(self, old_tab, FALSE, TRUE);
freer_(); // xt_heap_release(self, old_tab)
/* For the Windows version this must be done before we
* start to delete the underlying files!
*/
tab_close_files(self, old_tab);
tab_delete_table_files(self, name, old_tab_id);
/* Remove the PBMS table: */
ASSERT(xt_get_self() == self);
/* Remove the table from the directory. It will get a new
* ID so the handle in the directory will no longer be valid.
*/
xt_ht_del(self, db->db_tables, name);
}
else {
freer_(); // xt_heap_release(self, old_tab)
}
/* Add the table to the directory, well remove on error! */
li_undo.li_sl = db->db_table_by_id;
li_undo.li_key = &tab_id;
te_tab.te_tab_id = tab_id;
te_tab.te_heap_tab = dic->dic_tab_flags & XT_TF_MEMORY_TABLE;
te_tab.te_tab_name = xt_dup_string(self, xt_last_name_of_path(name->ps_path));
te_tab.te_tab_path = tab_get_table_path(self, db, name, TRUE);
te_tab.te_table = NULL;
te_tab.te_type = dic->dic_table_type;
xt_sl_insert(self, db->db_table_by_id, &tab_id, &te_tab);
*path = 0;
try_(a) {
XTOpenFilePtr of_row, of_rec, of_ind;
size_t def_len = 0;
tab_save_tables(self, db);
tab = (XTTableHPtr) xt_heap_new(self, sizeof(XTTableHRec), tab_finalize);
pushr_(xt_heap_release, tab);
/* The length of the foreign key definition: */
if (dic->dic_table) {
dic->dic_table->loadString(self, &tab_def);
def_len = tab_def.sb_len + 1;
}
tab->tab_head_op_seq = 0;
tab->tab_wr_op_seq = 0;
#ifdef DEBUG
/* This tests operation number overflow. */
//tab->tab_head_op_seq = 0xFFFFFFFF - 12;
//tab->tab_wr_op_seq = 0xFFFFFFFF - 12;
#endif
/* ------- ROW FILE: */
xt_strcpy(PATH_MAX, path, name->ps_path);
xt_remove_last_name_of_path(path);
tab_get_row_file_name(table_name, xt_last_name_of_path(name->ps_path), tab_id);
xt_strcat(PATH_MAX, path, table_name);
of_row = xt_open_file(self, path, xt_row_file_type(dic->dic_tab_flags & XT_TF_MEMORY_TABLE), XT_FS_CREATE | XT_FS_EXCLUSIVE, xt_db_row_file_grow_size);
pushr_(xt_close_file, of_row);
tab_init_row_file(self, of_row, tab, dic);
freer_(); // xt_close_file(of_row)
(void) ASSERT(sizeof(XTTabRowHeadDRec) == sizeof(XTTabRowRefDRec));
(void) ASSERT(sizeof(XTTabRowRefDRec) == 1 << XT_TAB_ROW_SHIFTS);
/* ------------ DATA FILE: */
xt_remove_last_name_of_path(path);
tab_get_data_file_name(table_name, xt_last_name_of_path(name->ps_path), tab_id);
xt_strcat(PATH_MAX, path, table_name);
of_rec = xt_open_file(self, path, xt_rec_file_type(dic->dic_tab_flags & XT_TF_MEMORY_TABLE), XT_FS_CREATE | XT_FS_EXCLUSIVE, xt_db_data_file_grow_size);
pushr_(xt_close_file, of_rec);
tab_init_data_file(self, of_rec, tab, dic, def_len, &tab_def);
freer_(); // xt_close_file(of_rec)
/* ----------- INDEX FILE: */
xt_remove_last_name_of_path(path);
tab_get_index_file_name(table_name, xt_last_name_of_path(name->ps_path), tab_id);
xt_strcat(PATH_MAX, path, table_name);
of_ind = xt_open_file(self, path, xt_ind_file_type(dic->dic_tab_flags & XT_TF_MEMORY_TABLE), XT_FS_CREATE | XT_FS_EXCLUSIVE, XT_INDEX_PAGE_SIZE*256);
pushr_(xt_close_file, of_ind);
tab_init_ind_file(self, of_ind, tab, dic);
freer_(); // xt_close_file(of_ind)
/* ------------ */
/* Log the new table ID! */
db->db_curr_tab_id = tab_id;
if (!xt_xn_log_tab_id(self, tab_id)) {
db->db_curr_tab_id = tab_id - 1;
xt_throw(self);
}
freer_(); // xt_heap_release(tab)
/* {LOAD-FOR-FKS}
* 2008-12-10: Note, there is another problem, example:
* set storage_engine = pbxt;
*
* CREATE TABLE t1 (s1 INT PRIMARY KEY, s2 INT);
* CREATE TABLE t2 (s1 INT PRIMARY KEY, FOREIGN KEY (s1) REFERENCES t1 (s1) ON UPDATE CASCADE);
* CREATE TABLE t3 (s1 INT PRIMARY KEY, FOREIGN KEY (s1) REFERENCES t2 (s1) ON UPDATE CASCADE);
*
* DROP TABLE IF EXISTS t2,t1;
* CREATE TABLE t1 (s1 ENUM('a','b') PRIMARY KEY);
* CREATE TABLE t2 (s1 ENUM('A','B'), FOREIGN KEY (s1) REFERENCES t1 (s1));
*
* DROP TABLE IF EXISTS t2,t1;
*
* In the example above. The second create t2 does not fail, although t3 references it,
* and the data types do not match.
*
* The main problem is that this error comes on DROP TABLE IF EXISTS t2! Which prevents
* the table from being dropped - not good.
*
* So my idea here is to open the table, and if it fails, then the create table fails
* as well.
*/
/*
* Drizzle-specific:
* We pass table type separately and provide NULL for the dic parameter, this is because
* we want to force loading table (which is triggered by dic == NULL) but we still need table type
*/
if (!old_tab_id) {
#ifndef DRIZZLED
tab = xt_use_table_no_lock(self, db, name, FALSE, FALSE, NULL);
xt_heap_release(self, tab);
#endif
}
}
catch_(a) {
/* Creation failed, delete the table files: */
XTException e;
xt_enter_exception_handler(self, &e);
if (*path)
tab_delete_table_files(self, name, tab_id);
tab_remove_table_path(self, db, te_tab.te_tab_path);
xt_sl_delete(NULL, db->db_table_by_id, &tab_id);
tab_save_tables(self, db);
xt_sb_set_size(self, &tab_def, 0);
xt_exit_exception_handler(self, &e);
xt_throw(self);
}
cont_(a);
xt_sb_set_size(self, &tab_def, 0);
if (old_tab_id) {
try_(b) {
XTTableEntryPtr te_ptr;
if ((te_ptr = (XTTableEntryPtr) xt_sl_find(self, db->db_table_by_id, &old_tab_id))) {
tab_remove_table_path(self, db, te_ptr->te_tab_path);
xt_sl_delete(self, db->db_table_by_id, &old_tab_id);
tab_save_tables(self, db);
}
/* Same purpose as above {LOAD-FOR-FKS} (although this should work,
* beacuse this is a TRUNCATE TABLE.
*/
tab = xt_use_table_no_lock(self, db, name, FALSE, FALSE, NULL);
xt_heap_release(self, tab);
}
catch_(b) {
/* Log this error, but do not return it, because
* it just involves the cleanup of the old table,
* the new table has been successfully created.
*/
xt_log_and_clear_exception(self);
}
cont_(b);
}
freer_(); // xt_ht_unlock(db->db_tables)
freer_(); // xt_db_unlock_table_pool(table_pool)
/* I open the table here, because I cannot rely on MySQL to do
* it after a create. This is normally OK, but with foreign keys
* tables can be referenced and then they are not opened
* before use. In this example, the INSERT opens t2, but t1 is
* not opened of the create. As a result the foreign key
* reference is not resolved.
*
* drop table t1, t2;
* CREATE TABLE t1
* (
* id INT PRIMARY KEY
* ) ENGINE=pbxt;
*
* CREATE TABLE t2
* (
* v INT,
* CONSTRAINT c1 FOREIGN KEY (v) REFERENCES t1(id)
* ) ENGINE=pbxt;
*
* --error 1452
* INSERT INTO t2 VALUES(2);
*/
/* this code is not needed anymore as we open tables referred by FKs as necessary during checks
xt_ht_lock(self, db->db_tables);
pushr_(xt_ht_unlock, db->db_tables);
tab = xt_use_table_no_lock(self, db, name, FALSE, FALSE, NULL);
freer_(); // xt_ht_unlock(db->db_tables)
xt_heap_release(self, tab);
* CHANGED see {LOAD-FOR-FKS} above.
*/
exit_();
}
xtPublic void xt_drop_table(XTThreadPtr self, XTPathStrPtr tab_name, xtBool drop_db)
{
XTDatabaseHPtr db = self->st_database;
XTOpenTablePoolPtr table_pool;
XTTableHPtr tab = NULL;
xtTableID tab_id = 0;
xtBool can_drop = TRUE;
enter_();
#ifdef TRACE_CREATE_TABLES
printf("DROP %s\n", tab_name->ps_path);
#endif
table_pool = xt_db_lock_table_pool_by_name(self, self->st_database, tab_name, FALSE, FALSE, TRUE, &tab);
pushr_(xt_db_unlock_table_pool, table_pool);
xt_ht_lock(self, db->db_tables);
pushr_(xt_ht_unlock, db->db_tables);
pushr_(xt_heap_release, tab);
if (table_pool) {
tab_id = tab->tab_id; /* tab is not null if returned table_pool is not null */
/* check if other tables refer this */
if (!self->st_ignore_fkeys)
can_drop = tab->tab_dic.dic_table->checkCanDrop(drop_db);
}
#ifdef DRIZZLED
/* See the comment in ha_pbxt::delete_table regarding different implmentation of DROP TABLE
* in MySQL and Drizzle
*/
else {
xt_throw_xterr(XT_CONTEXT, XT_ERR_TABLE_NOT_FOUND);
}
#endif
if (can_drop) {
if (tab_id) {
XTTableEntryPtr te_ptr;
xt_dl_delete_ext_data(self, tab, FALSE, TRUE);
freer_(); // xt_heap_release(self, tab)
/* For the Windows version this must be done before we
* start to delete the underlying files!
*/
tab_close_files(self, tab);
tab_delete_table_files(self, tab_name, tab_id);
ASSERT(xt_get_self() == self);
if ((te_ptr = (XTTableEntryPtr) xt_sl_find(self, db->db_table_by_id, &tab_id))) {
tab_remove_table_path(self, db, te_ptr->te_tab_path);
xt_sl_delete(self, db->db_table_by_id, &tab_id);
tab_save_tables(self, db);
}
}
else {
freer_(); // xt_heap_release(self, tab)
}
xt_ht_del(self, db->db_tables, tab_name);
}
else { /* cannot drop table because of FK dependencies */
xt_throw_xterr(XT_CONTEXT, XT_ERR_ROW_IS_REFERENCED);
}
freer_(); // xt_ht_unlock(db->db_tables)
freer_(); // xt_db_unlock_table_pool(table_pool)
exit_();
}
xtPublic void xt_tab_check_free_lists(XTThreadPtr self, XTOpenTablePtr ot, bool check_recs, bool correct_count)
{
char table_name[XT_IDENTIFIER_NAME_SIZE*3+3];
register XTTableHPtr tab = ot->ot_table;
xtRowID prev_row_id;
xtRowID row_id;
xtRefID next_row_id;
u_llong free_count;
xt_tab_make_table_name(tab->tab_name, table_name, sizeof(table_name));
if (check_recs) {
xtRecordID prev_rec_id;
xtRecordID rec_id;
XTTabRecExtDRec rec_buf;
xt_lock_mutex_ns(&tab->tab_rec_lock);
/* Checking the free list: */
prev_rec_id = 0;
free_count = 0;
rec_id = tab->tab_rec_free_id;
while (rec_id) {
if (rec_id >= tab->tab_rec_eof_id) {
xt_logf(XT_NT_ERROR, "Table %s: invalid reference on free list: %llu, ", table_name, (u_llong) rec_id);
if (prev_rec_id)
xt_logf(XT_NT_ERROR, "reference by: %llu\n", (u_llong) prev_rec_id);
else
xt_logf(XT_NT_ERROR, "reference by list head pointer\n");
xt_tab_set_table_repair_pending(tab);
break;
}
if (!xt_tab_get_rec_data(ot, rec_id, XT_REC_FIX_HEADER_SIZE, (xtWord1 *) &rec_buf)) {
if (self)
xt_throw(self);
else
xt_log_and_clear_warning(ot->ot_thread);
break;
}
if ((rec_buf.tr_rec_type_1 & XT_TAB_STATUS_MASK) != XT_TAB_STATUS_FREED)
xt_logf(XT_NT_INFO, "Table %s: record, %llu, on free list is not free\n", table_name, (u_llong) rec_id);
free_count++;
prev_rec_id = rec_id;
rec_id = XT_GET_DISK_4(rec_buf.tr_prev_rec_id_4);
}
if (free_count != tab->tab_rec_fnum) {
if (correct_count) {
tab->tab_rec_fnum = free_count;
tab->tab_head_rec_fnum = free_count;
tab->tab_flush_pending = TRUE;
xt_logf(XT_NT_INFO, "Table %s: free record count (%llu) has been set to the number of records on the list: %llu\n", table_name, (u_llong) tab->tab_rec_fnum, (u_llong) free_count);
}
else
xt_logf(XT_NT_INFO, "Table %s: free record count (%llu) differs from the number of records on the list: %llu\n", table_name, (u_llong) tab->tab_rec_fnum, (u_llong) free_count);
}
xt_unlock_mutex_ns(&tab->tab_rec_lock);
}
/* Check the row free list: */
xt_lock_mutex_ns(&tab->tab_row_lock);
prev_row_id = 0;
free_count = 0;
row_id = tab->tab_row_free_id;
while (row_id) {
if (row_id >= tab->tab_row_eof_id) {
xt_logf(XT_NT_ERROR, "Table %s: invalid reference on free row: %llu, ", table_name, (u_llong) row_id);
if (prev_row_id)
xt_logf(XT_NT_ERROR, "reference by: %llu\n", (u_llong) prev_row_id);
else
xt_logf(XT_NT_ERROR, "reference by list head pointer\n");
xt_tab_set_table_repair_pending(tab);
break;
}
if (!tab->tab_rows.xt_tc_read_4(ot->ot_row_file, row_id, &next_row_id, ot->ot_thread)) {
if (self)
xt_throw(self);
else
xt_log_and_clear_warning(ot->ot_thread);
break;
}
free_count++;
prev_row_id = row_id;
row_id = next_row_id;
}
if (free_count != tab->tab_row_fnum) {
if (correct_count) {
/* tab_row_fnum is the current value, and tab_head_row_fnum is the value on
* disk. tab_head_row_fnum is set by the writer as the changes are applied
* to the database.
*
* This is the value then stored in the header of the file. This value
* is in sync with other changes to the file.
*
* So the fact that I am setting both value means this will not work at
* runtime, unless all changes have been applied by the writer.
*
* The correct way to do this at run time would be to add the change to the
* transaction log, so that it is applied by the writer.
*/
tab->tab_row_fnum = free_count;
tab->tab_head_row_fnum = free_count;
tab->tab_flush_pending = TRUE;
xt_logf(XT_NT_INFO, "Table %s: free row count (%llu) has been set to the number of rows on the list: %llu\n", table_name, (u_llong) tab->tab_row_fnum, (u_llong) free_count);
}
else
xt_logf(XT_NT_INFO, "Table %s: free row count (%llu) differs from the number of rows on the list: %llu\n", table_name, (u_llong) tab->tab_row_fnum, (u_llong) free_count);
}
xt_unlock_mutex_ns(&tab->tab_row_lock);
}
/*
* Record buffer size:
* -------------------
* The size of the record buffer used to hold the row
* in memory. This buffer size does not include the BLOB data.
* About 8 bytes (a pointer and a size) is reserved for each BLOB
* in this buffer.
*
* The buffer size includes a number of "NULL" bytes followed by
* the data area. The NULL bytes contain 1 bit for every column,
* to indicate of the columns is NULL or not.
*
* The size of the buffer is 4/8-byte aligned, so it may be padded
* at the end.
*
* Fixed length rec. len.:
* -----------------------
* If the record does not include any BLOBs then this is the size of the
* fixed length record. The size if the data in the data handle record
* need never be bigger then this length, if the record does not
* contain BLOBs. So this should be the maximum size set for
* AVG_ROW_LENGTH in this case.
*
* Handle data record size:
* ------------------------
* This is the size of the handle data record. It is the data size
* plus the "max header size".
*
* Min/max header size:
* The min and max header size of the header in the data handle file.
* The larger header is used if a record has an extended data (data log
* file) component.
*
* Min/avg/max record size:
* ------------------------
* These are variable length records sizes. That is, the size of records
* when stored in the variable length format. Variable length records
* do not have fixed fields sizes, instead the fields are packed one
* after the other, prefixed by a number of size indicator bytes.
*
* The average is an estimate of the average record size. This estimate
* is used if no AVG_ROW_LENGTH is specifically given.
*
* If the average estimate is withing 20% of the maximum size of the record,
* then the record will be handled as a fixed length record.
*
* Avg row len set for tab:
* ------------------------
* This is the value set using AVG_ROW_LENGTH when the table is declared.
*
* Rows fixed length:
* ------------------
* YES if the records of this table are handled as a fixed length records.
* In this case the table records will never have an extended record
* component.
*
* The size of the data area in the handle data record is set to the
* size of the MySQL data record ("Fixed length rec. len.").
*
* It also means that the record format used is identical to the MySQL
* record format.
*
* If the records are not fixed, then the variable length record format
* is used. Records size are then in the range specified by
* "Min/avg/max record size".
*
* Maximum fixed size:
* -------------------
* This is the maximum size of a data log record.
*
* Minimum variable size:
* ------------------------
* Records below this size are handled as a fixed length record size, unless
* the AVG_ROW_LENGTH is specifically set.
*/
xtPublic void xt_check_table(XTThreadPtr self, XTOpenTablePtr ot)
{
XTTableHPtr tab = ot->ot_table;
xtRecordID prec_id;
XTTabRecExtDPtr rec_buf = (XTTabRecExtDPtr) ot->ot_row_rbuffer;
#ifdef CHECK_TABLE_READ_DATA_LOG
XTactExtRecEntryDRec ext_rec;
size_t log_size;
xtLogID log_id;
xtLogOffset log_offset;
#endif
xtRecordID rec_id;
xtRecordID prev_rec_id;
xtXactID xn_id;
xtRowID row_id;
u_llong free_rec_count = 0, free_count2 = 0;
u_llong delete_rec_count = 0;
u_llong alloc_rec_count = 0;
u_llong alloc_rec_bytes = 0;
u_llong min_comp_rec_len = 0;
u_llong max_comp_rec_len = 0;
size_t rec_size;
size_t row_size;
u_llong ext_data_len = 0;
u_llong ext_rec_count = 0;
#if defined(DUMP_CHECK_TABLE) || defined(CHECK_TABLE_STATS)
printf("\nCHECK TABLE: %s\n", tab->tab_name->ps_path);
#endif
xt_lock_mutex(self, &tab->tab_db->db_co_ext_lock);
pushr_(xt_unlock_mutex, &tab->tab_db->db_co_ext_lock);
xt_lock_mutex(self, &tab->tab_rec_lock);
pushr_(xt_unlock_mutex, &tab->tab_rec_lock);
#ifdef CHECK_TABLE_STATS
printf("Record buffer size = %lu\n", (u_long) tab->tab_dic.dic_mysql_buf_size);
printf("Fixed length rec. len. = %lu\n", (u_long) tab->tab_dic.dic_mysql_rec_size);
printf("Handle data record size = %lu\n", (u_long) tab->tab_dic.dic_rec_size);
printf("Min/max header size = %d/%d\n", (int) offsetof(XTTabRecFix, rf_data), tab->tab_dic.dic_rec_fixed ? (int) offsetof(XTTabRecFix, rf_data) : (int) offsetof(XTTabRecExtDRec, re_data));
printf("Min/avg/max record size = %llu/%llu/%llu\n", (u_llong) tab->tab_dic.dic_min_row_size, (u_llong) tab->tab_dic.dic_ave_row_size, (u_llong) tab->tab_dic.dic_max_row_size);
if (tab->tab_dic.dic_def_ave_row_size)
printf("Avg row len set for tab = %lu\n", (u_long) tab->tab_dic.dic_def_ave_row_size);
else
printf("Avg row len set for tab = not specified\n");
printf("Rows fixed length = %s\n", tab->tab_dic.dic_rec_fixed ? "YES" : "NO");
if (tab->tab_dic.dic_tab_flags & XT_TF_MEMORY_TABLE)
printf("Table type = MEMORY\n");
else if (tab->tab_dic.dic_tab_flags & XT_TF_REAL_TEMP_TABLE)
printf("Table type = TEMPORARY\n");
else if (tab->tab_dic.dic_tab_flags & XT_TF_DDL_TEMP_TABLE)
printf("Table type = DDL-TEMPORARY\n");
if (tab->tab_dic.dic_def_ave_row_size)
printf("Maximum fixed size = %lu\n", (u_long) XT_TAB_MAX_FIX_REC_LENGTH_SPEC);
else
printf("Maximum fixed size = %lu\n", (u_long) XT_TAB_MAX_FIX_REC_LENGTH);
printf("Minimum variable size = %lu\n", (u_long) XT_TAB_MIN_VAR_REC_LENGTH);
printf("Minimum auto-increment = %llu\n", (u_llong) tab->tab_dic.dic_min_auto_inc);
printf("Number of columns = %lu\n", (u_long) tab->tab_dic.dic_no_of_cols);
printf("Number of fixed columns = %lu\n", (u_long) tab->tab_dic.dic_fix_col_count);
printf("Columns req. for index = %lu\n", (u_long) tab->tab_dic.dic_ind_cols_req);
if (tab->tab_dic.dic_ind_rec_len)
printf("Rec len req. for index = %llu\n", (u_llong) tab->tab_dic.dic_ind_rec_len);
printf("Columns req. for blobs = %lu\n", (u_long) tab->tab_dic.dic_blob_cols_req);
printf("Number of blob columns = %lu\n", (u_long) tab->tab_dic.dic_blob_count);
printf("Number of indices = %lu\n", (u_long) tab->tab_dic.dic_key_count);
#endif
#ifdef DUMP_CHECK_TABLE
printf("Records:-\n");
printf("Free list: %llu (%llu)\n", (u_llong) tab->tab_rec_free_id, (u_llong) tab->tab_rec_fnum);
printf("EOF: %llu\n", (u_llong) tab->tab_rec_eof_id);
#endif
rec_size = XT_REC_EXT_HEADER_SIZE;
if (rec_size > tab->tab_recs.tci_rec_size)
rec_size = tab->tab_recs.tci_rec_size;
rec_id = 1;
while (rec_id < tab->tab_rec_eof_id) {
if (!xt_tab_get_rec_data(ot, rec_id, tab->tab_dic.dic_rec_size, ot->ot_row_rbuffer))
xt_throw(self);
#ifdef DUMP_CHECK_TABLE
printf("%-4llu ", (u_llong) rec_id);
#endif
switch (rec_buf->tr_rec_type_1 & XT_TAB_STATUS_MASK) {
case XT_TAB_STATUS_FREED:
#ifdef DUMP_CHECK_TABLE
printf("======== ");
#endif
free_rec_count++;
break;
case XT_TAB_STATUS_DELETE:
#ifdef DUMP_CHECK_TABLE
printf("delete ");
#endif
delete_rec_count++;
break;
case XT_TAB_STATUS_FIXED:
#ifdef DUMP_CHECK_TABLE
printf("record-F ");
#endif
alloc_rec_count++;
row_size = myxt_store_row_length(ot, (char *) ot->ot_row_rbuffer + XT_REC_FIX_HEADER_SIZE);
alloc_rec_bytes += row_size;
if (!min_comp_rec_len || row_size < min_comp_rec_len)
min_comp_rec_len = row_size;
if (row_size > max_comp_rec_len)
max_comp_rec_len = row_size;
break;
case XT_TAB_STATUS_VARIABLE:
#ifdef DUMP_CHECK_TABLE
printf("record-V ");
#endif
alloc_rec_count++;
row_size = myxt_load_row_length(ot, tab->tab_dic.dic_rec_size, ot->ot_row_rbuffer + XT_REC_FIX_HEADER_SIZE, NULL);
alloc_rec_bytes += row_size;
if (!min_comp_rec_len || row_size < min_comp_rec_len)
min_comp_rec_len = row_size;
if (row_size > max_comp_rec_len)
max_comp_rec_len = row_size;
break;
case XT_TAB_STATUS_EXT_DLOG:
#ifdef DUMP_CHECK_TABLE
printf("record-X ");
#endif
alloc_rec_count++;
ext_rec_count++;
ext_data_len += XT_GET_DISK_4(rec_buf->re_log_dat_siz_4);
row_size = XT_GET_DISK_4(rec_buf->re_log_dat_siz_4) + ot->ot_rec_size - XT_REC_EXT_HEADER_SIZE;
alloc_rec_bytes += row_size;
if (!min_comp_rec_len || row_size < min_comp_rec_len)
min_comp_rec_len = row_size;
if (row_size > max_comp_rec_len)
max_comp_rec_len = row_size;
break;
}
#ifdef DUMP_CHECK_TABLE
if (rec_buf->tr_rec_type_1 & XT_TAB_STATUS_CLEANED_BIT)
printf("C");
else
printf(" ");
#endif
prev_rec_id = XT_GET_DISK_4(rec_buf->tr_prev_rec_id_4);
xn_id = XT_GET_DISK_4(rec_buf->tr_xact_id_4);
row_id = XT_GET_DISK_4(rec_buf->tr_row_id_4);
switch (rec_buf->tr_rec_type_1 & XT_TAB_STATUS_MASK) {
case XT_TAB_STATUS_FREED:
#ifdef DUMP_CHECK_TABLE
printf(" prev=%-3llu (xact=%-3llu row=%lu)\n", (u_llong) prev_rec_id, (u_llong) xn_id, (u_long) row_id);
#endif
break;
case XT_TAB_STATUS_EXT_DLOG:
#ifdef DUMP_CHECK_TABLE
printf(" prev=%-3llu xact=%-3llu row=%lu Xlog=%lu Xoff=%llu Xsiz=%lu\n", (u_llong) prev_rec_id, (u_llong) xn_id, (u_long) row_id, (u_long) XT_GET_DISK_2(rec_buf->re_log_id_2), (u_llong) XT_GET_DISK_6(rec_buf->re_log_offs_6), (u_long) XT_GET_DISK_4(rec_buf->re_log_dat_siz_4));
#endif
#ifdef CHECK_TABLE_READ_DATA_LOG
xtBool ok;
log_size = XT_GET_DISK_4(rec_buf->re_log_dat_siz_4);
XT_GET_LOG_REF(log_id, log_offset, rec_buf);
if (ot->ot_table->tab_dic.dic_tab_flags & XT_TF_MEMORY_TABLE) {
xt_tab_read_ext_record(tab, log_id, log_offset, offsetof(XTactExtRecEntryDRec, er_data), (xtWord1 *) &ext_rec);
ok = TRUE;
}
else {
if (!(ok = self->st_dlog_buf.dlb_read_log(log_id, log_offset, offsetof(XTactExtRecEntryDRec, er_data), (xtWord1 *) &ext_rec, self)))
xt_log_and_clear_exception(self);
}
if (ok) {
size_t log_size2;
xtTableID curr_tab_id;
xtRecordID curr_rec_id;
log_size2 = XT_GET_DISK_4(ext_rec.er_data_size_4);
curr_tab_id = XT_GET_DISK_4(ext_rec.er_tab_id_4);
curr_rec_id = XT_GET_DISK_4(ext_rec.er_rec_id_4);
if (log_size2 != log_size || curr_tab_id != tab->tab_id || curr_rec_id != rec_id) {
xt_logf(XT_INFO, "Table %s: record %llu, extended record %lu:%llu not valid\n", tab->tab_name, (u_llong) rec_id, (u_long) log_id, (u_llong) log_offset);
}
}
#endif
break;
default:
#ifdef DUMP_CHECK_TABLE
printf(" prev=%-3llu xact=%-3llu row=%lu\n", (u_llong) prev_rec_id, (u_llong) xn_id, (u_long) row_id);
#endif
break;
}
rec_id++;
}
#ifdef CHECK_TABLE_STATS
u_long rec, row, ind;
char value[50];
rec = xt_seek_eof_file(self, ot->ot_rec_file);
row = xt_seek_eof_file(self, ot->ot_row_file);
ind = xt_seek_eof_file(self, ot->ot_ind_file);
if (tab->tab_dic.dic_tab_flags & XT_TF_MEMORY_TABLE) {
if (!tab->tab_dic.dic_rec_fixed) {
xt_int8_to_byte_size((xtInt8) tab->tab_mem_total, value);
printf("Ext. record memory used = %s\n", value);
printf("Extended record count = %llu\n", ext_rec_count);
}
xt_int8_to_byte_size((xtInt8) ind, value);
printf("Index data memory used = %s\n", value);
xt_int8_to_byte_size((xtInt8) rec + row, value);
printf("Table data memory used = %s\n", value);
xt_int8_to_byte_size((xtInt8) tab->tab_mem_total + rec + row + ind, value);
printf("Total memory used = %s\n", value);
}
else {
if (!tab->tab_dic.dic_rec_fixed) {
xt_int8_to_byte_size((xtInt8) ext_data_len, value);
printf("Ext. record disk used = %s\n", value);
printf("Extended record count = %llu\n", ext_rec_count);
}
xt_int8_to_byte_size((xtInt8) ind, value);
printf("Index disk space used = %s\n", value);
xt_int8_to_byte_size((xtInt8) rec + row, value);
printf("Table disk space used = %s\n", value);
xt_int8_to_byte_size((xtInt8) ext_data_len + rec + row + ind, value);
printf("Total disk space used = %s\n", value);
}
if (alloc_rec_count) {
printf("Minumum comp. rec. len. = %llu\n", (u_llong) min_comp_rec_len);
printf("Average comp. rec. len. = %llu\n", (u_llong) ((double) alloc_rec_bytes / (double) alloc_rec_count + (double) 0.5));
printf("Maximum comp. rec. len. = %llu\n", (u_llong) max_comp_rec_len);
}
printf("Free record count = %llu\n", (u_llong) free_rec_count);
printf("Deleted record count = %llu\n", (u_llong) delete_rec_count);
printf("Allocated record count = %llu\n", (u_llong) alloc_rec_count);
#endif
if (tab->tab_rec_fnum != free_rec_count)
xt_logf(XT_INFO, "Table %s: incorrect number of free blocks, %llu, should be: %llu\n", tab->tab_name, (u_llong) free_rec_count, (u_llong) tab->tab_rec_fnum);
/* Checking the free list: */
prec_id = 0;
rec_id = tab->tab_rec_free_id;
while (rec_id) {
if (rec_id >= tab->tab_rec_eof_id) {
xt_logf(XT_INFO, "Table %s: invalid reference on free list: %llu, ", tab->tab_name, (u_llong) rec_id);
if (prec_id)
xt_logf(XT_INFO, "reference by: %llu\n", (u_llong) prec_id);
else
xt_logf(XT_INFO, "reference by list head pointer\n");
break;
}
if (!xt_tab_get_rec_data(ot, rec_id, XT_REC_FIX_HEADER_SIZE, (xtWord1 *) rec_buf)) {
xt_log_and_clear_exception(self);
break;
}
if ((rec_buf->tr_rec_type_1 & XT_TAB_STATUS_MASK) != XT_TAB_STATUS_FREED)
xt_logf(XT_INFO, "Table %s: record, %llu, on free list is not free\n", tab->tab_name, (u_llong) rec_id);
free_count2++;
prec_id = rec_id;
rec_id = XT_GET_DISK_4(rec_buf->tr_prev_rec_id_4);
}
if (free_count2 != free_rec_count)
xt_logf(XT_INFO, "Table %s: not all free blocks (%llu) on free list: %llu\n", tab->tab_name, (u_llong) free_rec_count, (u_llong) free_count2);
freer_(); // xt_unlock_mutex_ns(&tab->tab_rec_lock);
xtRefID ref_id;
xt_lock_mutex(self, &tab->tab_row_lock);
pushr_(xt_unlock_mutex, &tab->tab_row_lock);
#ifdef DUMP_CHECK_TABLE
printf("Rows:-\n");
printf("Free list: %llu (%llu)\n", (u_llong) tab->tab_row_free_id, (u_llong) tab->tab_row_fnum);
printf("EOF: %llu\n", (u_llong) tab->tab_row_eof_id);
#endif
rec_id = 1;
while (rec_id < tab->tab_row_eof_id) {
if (!tab->tab_rows.xt_tc_read_4(ot->ot_row_file, rec_id, &ref_id, self))
xt_throw(self);
#ifdef DUMP_CHECK_TABLE
printf("%-3llu ", (u_llong) rec_id);
#endif
#ifdef DUMP_CHECK_TABLE
if (ref_id == 0)
printf("====== 0\n");
else
printf("in use %llu\n", (u_llong) ref_id);
#endif
rec_id++;
}
prec_id = 0;
free_count2 = 0;
row_id = tab->tab_row_free_id;
while (row_id) {
if (row_id >= tab->tab_row_eof_id) {
xt_logf(XT_INFO, "Table %s: invalid reference on free row: %llu, ", tab->tab_name, (u_llong) row_id);
if (prec_id)
xt_logf(XT_INFO, "reference by: %llu\n", (u_llong) prec_id);
else
xt_logf(XT_INFO, "reference by list head pointer\n");
break;
}
if (!tab->tab_rows.xt_tc_read_4(ot->ot_row_file, row_id, &ref_id, self)) {
xt_log_and_clear_exception(self);
break;
}
free_count2++;
prec_id = row_id;
row_id = ref_id;
}
if (free_count2 != tab->tab_row_fnum)
xt_logf(XT_INFO, "Table %s: free row count (%llu) differs from the number of row on the list: %llu\n", tab->tab_name, (u_llong) tab->tab_row_fnum, (u_llong) free_count2);
freer_(); // xt_unlock_mutex(&tab->tab_row_lock);
#ifdef CHECK_INDEX_ON_CHECK_TABLE
xt_check_indices(ot);
#endif
freer_(); // xt_unlock_mutex(&tab->tab_db->db_co_ext_lock);
}
xtPublic void xt_rename_table(XTThreadPtr self, XTPathStrPtr old_name, XTPathStrPtr new_name)
{
XTDatabaseHPtr db = self->st_database;
XTOpenTablePoolPtr table_pool;
XTTableHPtr tab = NULL;
char table_name[XT_MAX_TABLE_FILE_NAME_SIZE];
char *postfix;
XTFilesOfTableRec ft;
XTDictionaryRec dic;
xtTableID tab_id;
XTTableEntryPtr te_ptr;
char *te_new_name;
XTTablePathPtr te_new_path;
XTTablePathPtr te_old_path;
char to_path[PATH_MAX];
memset(&dic, 0, sizeof(dic));
#ifdef TRACE_CREATE_TABLES
printf("RENAME %s --> %s\n", old_name->ps_path, new_name->ps_path);
#endif
if (strlen(xt_last_name_of_path(new_name->ps_path)) > XT_TABLE_NAME_SIZE-1)
xt_throw_taberr(XT_CONTEXT, XT_ERR_NAME_TOO_LONG, new_name);
/* MySQL renames the table while it is in use. Here is
* the sequence:
*
* OPEN tab1
* CREATE tmp_tab
* OPEN tmp_tab
* COPY tab1 -> tmp_tab
* CLOSE tmp_tab
* RENAME tab1 -> tmp2_tab
* RENAME tmp_tab -> tab1
* CLOSE tab1 (tmp2_tab)
* DELETE tmp2_tab
* OPEN tab1
*
* Since the table is open when it is renamed, I cannot
* get exclusive use of the table for this operation.
*
* So instead we just make sure that the sweeper is not
* using the table.
*/
table_pool = xt_db_lock_table_pool_by_name(self, self->st_database, old_name, FALSE, TRUE, FALSE, &tab);
pushr_(xt_db_unlock_table_pool, table_pool);
xt_ht_lock(self, db->db_tables);
pushr_(xt_ht_unlock, db->db_tables);
tab_id = tab->tab_id;
myxt_move_dictionary(&dic, &tab->tab_dic);
pushr_(myxt_free_dictionary, &dic);
pushr_(xt_heap_release, tab);
/* Unmap the memory mapped table files:
* For windows this must be done before we
* can rename the files.
*/
tab_close_files(self, tab);
freer_(); // xt_heap_release(self, old_tab)
/* Create the new name and path: */
te_new_name = xt_dup_string(self, xt_last_name_of_path(new_name->ps_path));
pushr_(xt_free, te_new_name);
te_new_path = tab_get_table_path(self, db, new_name, FALSE);
pushr_(tab_free_table_path, te_new_path);
te_ptr = (XTTableEntryPtr) xt_sl_find(self, db->db_table_by_id, &tab_id);
/* Remove the table from the Database directory: */
xt_ht_del(self, db->db_tables, old_name);
xt_enum_files_of_tables_init(old_name, tab_id, &ft);
while (xt_enum_files_of_tables_next(&ft)) {
postfix = xt_tab_file_to_name(XT_MAX_TABLE_FILE_NAME_SIZE, table_name, ft.ft_file_path);
xt_strcpy(PATH_MAX, to_path, new_name->ps_path);
xt_strcat(PATH_MAX, to_path, postfix);
if (!xt_fs_rename(NULL, ft.ft_file_path, to_path))
xt_log_and_clear_exception(self);
}
/* Switch the table name and path: */
xt_free(self, te_ptr->te_tab_name);
te_ptr->te_tab_name = te_new_name;
te_old_path = te_ptr->te_tab_path;
te_ptr->te_tab_path = te_new_path;
tab_remove_table_path(self, db, te_old_path);
tab_save_tables(self, db);
popr_(); // Discard tab_free_table_path(te_new_path);
popr_(); // Discard xt_free(te_new_name);
tab = xt_use_table_no_lock(self, db, new_name, FALSE, FALSE, &dic);
/* All renamed tables are considered repaired! */
xt_tab_table_repaired(tab);
xt_heap_release(self, tab);
freer_(); // myxt_free_dictionary(&dic)
freer_(); // xt_ht_unlock(db->db_tables)
freer_(); // xt_db_unlock_table_pool(table_pool)
}
xtPublic XTTableHPtr xt_use_table(XTThreadPtr self, XTPathStrPtr name, xtBool no_load, xtBool missing_ok)
{
XTTableHPtr tab;
XTDatabaseHPtr db = self->st_database;
xt_ht_lock(self, db->db_tables);
pushr_(xt_ht_unlock, db->db_tables);
tab = xt_use_table_no_lock(self, db, name, no_load, missing_ok, NULL);
freer_();
return tab;
}
xtPublic void xt_sync_flush_table(XTThreadPtr self, XTOpenTablePtr ot, int timeout)
{
XTTableHPtr tab = ot->ot_table;
XTDatabaseHPtr db = tab->tab_db;
/* Wakeup the sweeper:
* We want the sweeper to check if there is anything to do,
* so we must wake it up.
* Once it has done all it can, it will go back to sleep.
* This should be good enough.
*
* NOTE: I all cases, we do not wait if the sweeper is in
* error state.
*/
if (db->db_sw_idle) {
u_int check_count = db->db_sw_check_count;
for (;;) {
xt_wakeup_sweeper(db);
if (!db->db_sw_thread || db->db_sw_idle != XT_THREAD_IDLE || check_count != db->db_sw_check_count)
break;
xt_sleep_milli_second(10);
}
}
/* Wait for the sweeper to become idle: */
xt_lock_mutex(self, &db->db_sw_lock);
pushr_(xt_unlock_mutex, &db->db_sw_lock);
while (db->db_sw_thread && !db->db_sw_idle) {
xt_timed_wait_cond(self, &db->db_sw_cond, &db->db_sw_lock, 10);
}
freer_(); // xt_unlock_mutex(&db->db_sw_lock)
/* Wait for the writer to write out all operations on the table:
* We also do not wait for the writer if it is in
* error state.
*/
time_t start_time = time(NULL);
while (db->db_wr_thread &&
db->db_wr_idle != XT_THREAD_INERR &&
XTTableSeq::xt_op_is_before(tab->tab_head_op_seq+1, tab->tab_seq.ts_next_seq)) {
if (timeout && time(NULL) > start_time + timeout) {
char name_buf[XT_TABLE_NAME_BUF_SIZE];
xt_tab_make_table_name(tab->tab_name, name_buf, XT_TABLE_NAME_BUF_SIZE);
xt_logf(XT_WARNING, "Timeout waiting for writer while flushing %s\n", name_buf);
break;
}
/* Flush the log, in case this is holding up the
* writer!
*/
if (!db->db_xlog.xlog_flush(self))
xt_throw(self);
xt_lock_mutex(self, &db->db_wr_lock);
pushr_(xt_unlock_mutex, &db->db_wr_lock);
db->db_wr_thread_waiting++;
/*
* Wake the writer if it is sleeping. In order to
* flush a table we must wait for the writer to complete
* committing all the changes in the table to the database.
*/
if (db->db_wr_idle) {
if (!xt_broadcast_cond_ns(&db->db_wr_cond))
xt_log_and_clear_exception_ns();
}
freer_(); // xt_unlock_mutex(&db->db_wr_lock)
xt_sleep_milli_second(10);
xt_lock_mutex(self, &db->db_wr_lock);
pushr_(xt_unlock_mutex, &db->db_wr_lock);
db->db_wr_thread_waiting--;
freer_(); // xt_unlock_mutex(&db->db_wr_lock)
}
xt_flush_table(self, ot);
}
xtBool XTFlushRecRowTask::tk_task(XTThreadPtr thread)
{
XTOpenTablePtr ot;
/* {TASK-TABLE-GONE}
* If this task was scheduled before the table was deleted
* or renamed, then we may be caught holding an invalid
* table (frt_table) object.
*
* As a result we just use the ID, to get the open table
* pointer.
*
* If the tables are not identical, then there is no point
* in proceeding...
*/
if (!(xt_db_open_pool_table_ns(&ot, frt_table->tab_db, frt_table->tab_id)))
return FAILED;
if (!ot) {
/* Can happen if the table has been dropped: */
if (thread->t_exception.e_xt_err)
xt_log_and_clear_exception(thread);
xt_logf(XT_NT_WARNING, "Checkpoint skipping table (ID) %lu: table was not found\n", (u_long) frt_table->tab_id);
xt_checkpoint_set_flush_state(frt_table->tab_db, frt_table->tab_id, XT_CPT_STATE_DONE_ALL);
return OK;
}
if (ot->ot_table != frt_table) {
/* Can happen if the table has been renamed: */
if (thread->t_exception.e_xt_err)
xt_log_and_clear_exception(thread);
xt_logf(XT_NT_WARNING, "Checkpoint skipping table (ID) %lu: table has been renamed\n", (u_long) frt_table->tab_id);
xt_checkpoint_set_flush_state(frt_table->tab_db, frt_table->tab_id, XT_CPT_STATE_DONE_ALL);
goto table_gone;
}
if (!xt_flush_record_row(ot, NULL, FALSE)) {
xt_db_return_table_to_pool_ns(ot);
return FAILED;
}
table_gone:
xt_db_return_table_to_pool_ns(ot);
return OK;
}
void XTFlushRecRowTask::tk_reference()
{
xt_heap_reference_ns(frt_table);
}
void XTFlushRecRowTask::tk_release()
{
xt_heap_release_ns(frt_table);
}
/*
* Start a flush of this file in background.
*/
xtPublic xtBool xt_async_flush_record_row(XTTableHPtr tab, xtBool notify_complete, XTThreadPtr thread)
{
if (tab->tab_rec_flush_task->tk_is_running())
return OK;
/* Run the task: */
return xt_run_async_task(tab->tab_rec_flush_task, notify_complete, FALSE, thread, tab->tab_db);
}
xtPublic xtBool xt_flush_record_row(XTOpenTablePtr ot, off_t *bytes_flushed, xtBool have_table_lock)
{
XTTableHeadDRec rec_head;
XTTableHPtr tab = ot->ot_table;
off_t to_flush;
#ifdef TRACE_FLUSH_TABLE
time_t tnow = 0;
#endif
if (!xt_begin_checkpoint(tab->tab_db, have_table_lock, ot->ot_thread))
return FAILED;
xt_lock_mutex_ns(&tab->tab_rec_flush_lock);
#ifdef XT_SORT_REC_WRITES
if (!xt_xres_delay_flush(ot, TRUE))
goto failed;
#endif
xt_checkpoint_set_flush_state(tab->tab_db, tab->tab_id, XT_CPT_STATE_START_REC_ROW);
ASSERT_NS(ot->ot_thread == xt_get_self());
/* Make sure that the table recovery point, in
* particular the operation ID is recorded
* before all other flush activity!
*
* This is because only operations after the
* recovery point in the header are applied
* to the table on recovery.
*
* So the operation ID is recorded before the
* flush activity, and written after all is done.
*/
xt_tab_store_header(ot, &rec_head);
/* Write the table header: */
if (tab->tab_flush_pending) {
tab->tab_flush_pending = FALSE;
#ifdef TRACE_FLUSH_TABLE
tnow = time(NULL);
printf("FLUSH TABLE bytes=%lu %s\n", (u_long) tab->tab_bytes_to_flush, tab->tab_name->ps_path);
fflush(stdout);
#endif
// Want to see how much was to be flushed in the debugger:
to_flush = tab->tab_bytes_to_flush;
tab->tab_bytes_to_flush = 0;
if (bytes_flushed)
*bytes_flushed += to_flush;
#ifdef XT_REC_FLUSH_THRESHOLD
XTThreadPtr writer;
/* Reset the writer's byte level: */
if ((writer = ot->ot_table->tab_db->db_wr_thread))
tab->tab_rec_wr_last_flush = writer->st_statistics.st_rec.ts_write;
#endif
/* Flush the table data: */
if (!XT_IS_TEMP_TABLE(tab->tab_dic.dic_tab_flags)) {
if (!XT_FLUSH_RR_FILE(ot->ot_rec_file, &ot->ot_thread->st_statistics.st_rec, ot->ot_thread) ||
!XT_FLUSH_RR_FILE(ot->ot_row_file, &ot->ot_thread->st_statistics.st_rec, ot->ot_thread)) {
tab->tab_flush_pending = TRUE;
goto failed;
}
}
/* The header includes the operation number which
* must be written AFTER all other data,
* because operations will not be applied again.
*/
if (!tab_write_header(ot, &rec_head)) {
tab->tab_flush_pending = TRUE;
goto failed;
}
}
/* Flush the auto-increment: */
if (xt_db_auto_increment_mode == 1) {
if (tab->tab_auto_inc != tab->tab_dic.dic_min_auto_inc) {
tab->tab_dic.dic_min_auto_inc = tab->tab_auto_inc;
if (!xt_tab_write_min_auto_inc(ot))
goto failed;
}
}
/* Mark this table as record/row flushed: */
xt_checkpoint_set_flush_state(tab->tab_db, tab->tab_id, XT_CPT_STATE_DONE_REC_ROW);
#ifdef TRACE_FLUSH_TABLE
if (tnow) {
printf("flush table (%d) %s DONE\n", (int) (time(NULL) - tnow), tab->tab_name->ps_path);
fflush(stdout);
}
#endif
xt_unlock_mutex_ns(&tab->tab_rec_flush_lock);
if (!xt_end_checkpoint(tab->tab_db, ot->ot_thread, NULL))
return FAILED;
return OK;
failed:
xt_checkpoint_set_flush_state(tab->tab_db, tab->tab_id, XT_CPT_STATE_STOP_REC_ROW);
#ifdef TRACE_FLUSH_TABLE
if (tnow) {
printf("flush table (%d) %s FAILED\n", (int) (time(NULL) - tnow), tab->tab_name->ps_path);
fflush(stdout);
}
#endif
xt_unlock_mutex_ns(&tab->tab_rec_flush_lock);
return FAILED;
}
xtPublic void xt_flush_table(XTThreadPtr self, XTOpenTablePtr ot)
{
/* GOTCHA {FLUSH-BUG}: This bug was difficult to find.
* It occured on Windows in the multi_update
* test, sometimes.
*
* What happens is the checkpointer starts to
* flush the table, and gets to the
* XT_FLUSH_RR_FILE part.
*
* Then a rename occurs, and the user thread
* flushes the table, and goes through and
* writes the table header, with the most
* recent table operation (the last operation
* that occurred).
*
* The checkpointer the completes and
* also writes the header, but with old
* values (as read in xt_tab_store_header()).
*
* The then user thread continues, and
* reopens the table after rename.
* On reopen, it reads the old value from the header,
* and sets the current operation number.
*
* Now there is a problem in the table cache,
* because some cache pages have operation numbers
* that are greater than current operation
* number!
*
* This later lead to the free-er hanging while
* it waited for an operation to be
* written to the disk that never would be.
* This is because a page can only be freed when
* the head operation number has passed the
* page operation number.
*
* Which indicates that the page has been written
* to disk.
*
* THE BUG FIX:
* As a result I now use mutex so that only one
* thread can flush at a time.
*/
if (!xt_flush_record_row(ot, NULL, FALSE))
xt_throw(self);
/* This was before the table data flush,
* (after xt_tab_store_header() above,
* but I don't think it makes any difference.
* Because in the checkpointer it was at this
* position.
*/
if (!xt_flush_indices(ot, NULL, FALSE, NULL))
xt_throw(self);
}
static XTOpenTablePtr tab_open_table(XTTableHPtr tab)
{
volatile XTOpenTablePtr ot;
XTThreadPtr self;
if (!(ot = (XTOpenTablePtr) xt_malloc_ns(sizeof(XTOpenTableRec))))
return NULL;
memset(ot, 0, offsetof(XTOpenTableRec, ot_ind_wbuf));
ot->ot_seq_page = NULL;
ot->ot_seq_data = NULL;
self = xt_get_self();
try_(a) {
xt_heap_reference(self, tab);
ot->ot_table = tab;
ot->ot_row_file = xt_open_file(self, ot->ot_table->tab_row_file->fil_path, xt_row_file_type(tab->tab_dic.dic_tab_flags & XT_TF_MEMORY_TABLE), XT_FS_DEFAULT, xt_db_row_file_grow_size);
ot->ot_rec_file = xt_open_file(self, ot->ot_table->tab_rec_file->fil_path, xt_rec_file_type(tab->tab_dic.dic_tab_flags & XT_TF_MEMORY_TABLE), XT_FS_DEFAULT, xt_db_data_file_grow_size);
#ifdef XT_USE_DIRECT_IO_ON_INDEX
ot->ot_ind_file = xt_open_file(self, ot->ot_table->tab_ind_file->fil_path, xt_ind_file_type(tab->tab_dic.dic_tab_flags & XT_TF_MEMORY_TABLE), XT_FS_MISSING_OK | XT_FS_DIRECT_IO, XT_INDEX_PAGE_SIZE*256);
#else
ot->ot_ind_file = xt_open_file(self, ot->ot_table->tab_ind_file->fil_path, xt_ind_file_type(tab->tab_dic.dic_tab_flags & XT_TF_MEMORY_TABLE), XT_FS_MISSING_OK, XT_INDEX_PAGE_SIZE*256);
#endif
}
catch_(a) {
;
}
cont_(a);
if (!ot->ot_table || !ot->ot_row_file || !ot->ot_rec_file)
goto failed;
if (!(ot->ot_row_rbuffer = (xtWord1 *) xt_malloc_ns(ot->ot_table->tab_dic.dic_rec_size)))
goto failed;
ot->ot_row_rbuf_size = ot->ot_table->tab_dic.dic_rec_size;
if (!(ot->ot_row_wbuffer = (xtWord1 *) xt_malloc_ns(ot->ot_table->tab_dic.dic_rec_size)))
goto failed;
ot->ot_row_wbuf_size = ot->ot_table->tab_dic.dic_rec_size;
/* Cache this stuff to speed access a bit: */
ot->ot_rec_fixed = ot->ot_table->tab_dic.dic_rec_fixed;
ot->ot_rec_size = ot->ot_table->tab_dic.dic_rec_size;
return ot;
failed:
tab_close_table(ot);
return NULL;
}
xtPublic XTOpenTablePtr xt_open_table(XTTableHPtr tab)
{
return tab_open_table(tab);
}
xtPublic void xt_close_table(XTOpenTablePtr ot, xtBool flush, xtBool have_table_lock)
{
if (flush) {
if (!xt_flush_record_row(ot, NULL, have_table_lock))
xt_log_and_clear_exception_ns();
if (!xt_flush_indices(ot, NULL, have_table_lock, NULL))
xt_log_and_clear_exception_ns();
}
tab_close_table(ot);
}
static int tab_use_table_by_id(XTThreadPtr self, XTTableHPtr *r_tab, XTDatabaseHPtr db, xtTableID tab_id)
{
XTTableEntryPtr te_ptr;
XTTableHPtr tab = NULL;
int r = XT_TAB_OK;
char path[PATH_MAX];
if (!db)
xt_throw_xterr(XT_CONTEXT, XT_ERR_NO_DATABASE_IN_USE);
xt_ht_lock(self, db->db_tables);
pushr_(xt_ht_unlock, db->db_tables);
te_ptr = (XTTableEntryPtr) xt_sl_find(self, db->db_table_by_id, &tab_id);
if (te_ptr) {
if (!(tab = te_ptr->te_table)) {
/* Open the table: */
xt_strcpy(PATH_MAX, path, te_ptr->te_tab_path->tp_path);
xt_add_dir_char(PATH_MAX, path);
xt_strcat(PATH_MAX, path, te_ptr->te_tab_name);
r = tab_new_handle(self, &tab, db, tab_id, (XTPathStrPtr) path, TRUE, NULL);
}
}
else
r = XT_TAB_NOT_FOUND;
if (tab)
xt_heap_reference(self, tab);
*r_tab = tab;
freer_(); // xt_ht_unlock(db->db_tables)
return r;
}
xtPublic XTTableHPtr xt_use_table_by_id(XTThreadPtr self, XTDatabaseHPtr db, xtTableID tab_id, int *result)
{
XTTableHPtr tab;
int r;
r = tab_use_table_by_id(self, &tab, db, tab_id);
if (result) {
if (r != XT_TAB_OK) {
*result = r;
return NULL;
}
}
else {
switch (r) {
case XT_TAB_NOT_FOUND:
return NULL;
case XT_TAB_NO_DICTIONARY:
xt_throw_ulxterr(XT_CONTEXT, XT_ERR_NO_DICTIONARY, (u_long) tab_id);
case XT_TAB_POOL_CLOSED:
xt_throw_ulxterr(XT_CONTEXT, XT_ERR_TABLE_LOCKED, (u_long) tab_id);
default:
break;
}
}
return tab;
}
xtPublic XTTableHPtr xt_use_table_by_id_ns(XTDatabaseHPtr db, xtTableID tab_id)
{
XTTableHPtr tab;
XTThreadPtr self = xt_get_self();
try_(a) {
tab = xt_use_table_by_id(self, db, tab_id, NULL);
}
catch_(a) {
tab = NULL;
}
cont_(a);
return tab;
}
/* The fixed part of the record is already in the row buffer.
* This function loads the extended part, expanding the row
* buffer if necessary.
*/
xtPublic xtBool xt_tab_load_ext_data(XTOpenTablePtr ot, xtRecordID load_rec_id, xtWord1 *buffer, u_int cols_req)
{
size_t log_size;
xtLogID log_id;
xtLogOffset log_offset;
xtWord1 save_buffer[offsetof(XTactExtRecEntryDRec, er_data)];
xtBool retried = FALSE;
XTactExtRecEntryDPtr ext_data_ptr;
size_t log_size2;
xtTableID curr_tab_id;
xtRecordID curr_rec_id;
log_size = XT_GET_DISK_4(((XTTabRecExtDPtr) ot->ot_row_rbuffer)->re_log_dat_siz_4);
XT_GET_LOG_REF(log_id, log_offset, (XTTabRecExtDPtr) ot->ot_row_rbuffer);
if (ot->ot_rec_size + log_size > ot->ot_row_rbuf_size) {
if (!xt_realloc_ns((void **) &ot->ot_row_rbuffer, ot->ot_rec_size + log_size))
return FAILED;
ot->ot_row_rbuf_size = ot->ot_rec_size + log_size;
}
/* Read the extended part first: */
ext_data_ptr = (XTactExtRecEntryDPtr) (ot->ot_row_rbuffer + ot->ot_rec_size - offsetof(XTactExtRecEntryDRec, er_data));
/* Save the data which the header will overwrite: */
memcpy(save_buffer, ext_data_ptr, offsetof(XTactExtRecEntryDRec, er_data));
reread:
if (ot->ot_table->tab_dic.dic_tab_flags & XT_TF_MEMORY_TABLE)
xt_tab_read_ext_record(ot->ot_table, log_id, log_offset, offsetof(XTactExtRecEntryDRec, er_data) + log_size, (xtWord1 *) ext_data_ptr);
else {
if (!ot->ot_thread->st_dlog_buf.dlb_read_log(log_id, log_offset, offsetof(XTactExtRecEntryDRec, er_data) + log_size, (xtWord1 *) ext_data_ptr, ot->ot_thread))
goto retry_read;
}
log_size2 = XT_GET_DISK_4(ext_data_ptr->er_data_size_4);
curr_tab_id = XT_GET_DISK_4(ext_data_ptr->er_tab_id_4);
curr_rec_id = XT_GET_DISK_4(ext_data_ptr->er_rec_id_4);
if (log_size2 != log_size || curr_tab_id != ot->ot_table->tab_id || curr_rec_id != load_rec_id) {
/* [(3)] This can happen in the following circumstances:
* - A new record is created, but the data log is not
* flushed.
* - The server quits.
* - On restart the transaction is rolled back, but the data record
* was not written, so later a new record could be written at this
* location.
* - Later the sweeper tries to cleanup this record, and finds
* that a different record has been written at this position.
*
* NOTE: Index entries can only be written to disk for records
* that have been committed to the disk, because uncommitted
* records may not exist in order to remove the index entry
* on cleanup.
*/
xt_register_xterr(XT_REG_CONTEXT, XT_ERR_BAD_EXT_RECORD);
goto retry_read;
}
/* Restore the saved area: */
memcpy(ext_data_ptr, save_buffer, offsetof(XTactExtRecEntryDRec, er_data));
if (retried)
xt_unlock_mutex_ns(&ot->ot_table->tab_db->db_co_ext_lock);
return myxt_load_row(ot, ot->ot_row_rbuffer + XT_REC_EXT_HEADER_SIZE, buffer, cols_req);
retry_read:
if (!retried) {
/* (1) It may be that reading the log fails because the garbage collector
* has moved the record since we determined the location.
* We handle this here, by re-reading the data the garbage collector
* would have updated.
*
* (2) It may also happen that a new record is just being updated or
* inserted. It is possible that the handle part of the record
* has been written, but not yet the overflow.
* This means that repeating the read attempt could work.
*
* (3) The extended data has been written by another handler and not yet
* flushed. This should not happen because on committed extended
* records are read, and all data should be flushed before
* commit!
*
* NOTE: (2) above is not a problem when versioning is working
* correctly. In this case, we should never try to read the extended
* part of an uncommitted record (belonging to some other thread/
* transaction).
*/
XTTabRecExtDRec rec_buf;
xt_lock_mutex_ns(&ot->ot_table->tab_db->db_co_ext_lock);
retried = TRUE;
if (!xt_tab_get_rec_data(ot, load_rec_id, XT_REC_EXT_HEADER_SIZE, (xtWord1 *) &rec_buf))
goto failed;
XT_GET_LOG_REF(log_id, log_offset, &rec_buf);
goto reread;
}
failed:
if (retried)
xt_unlock_mutex_ns(&ot->ot_table->tab_db->db_co_ext_lock);
return FAILED;
}
xtPublic xtBool xt_tab_put_rec_data(XTOpenTablePtr ot, xtRecordID rec_id, size_t size, xtWord1 *buffer, xtOpSeqNo *op_seq)
{
register XTTableHPtr tab = ot->ot_table;
ASSERT_NS(rec_id);
return tab->tab_recs.xt_tc_write(ot->ot_rec_file, rec_id, 0, size, buffer, op_seq, TRUE, ot->ot_thread);
}
xtPublic xtBool xt_tab_put_log_op_rec_data(XTOpenTablePtr ot, u_int status, xtRecordID free_rec_id, xtRecordID rec_id, size_t size, xtWord1 *buffer)
{
register XTTableHPtr tab = ot->ot_table;
xtOpSeqNo op_seq;
ASSERT_NS(rec_id);
if (status == XT_LOG_ENT_REC_MOVED) {
if (!tab->tab_recs.xt_tc_write(ot->ot_rec_file, rec_id, offsetof(XTTabRecExtDRec, re_log_id_2), size, buffer, &op_seq, TRUE, ot->ot_thread))
return FAILED;
}
#ifdef DEBUG
else if (status == XT_LOG_ENT_REC_CLEANED_1) {
ASSERT_NS(0); // shouldn't be used anymore
}
#endif
else {
if (!tab->tab_recs.xt_tc_write(ot->ot_rec_file, rec_id, 0, size, buffer, &op_seq, TRUE, ot->ot_thread))
return FAILED;
}
return xt_xlog_modify_table(tab->tab_id, status, op_seq, 0, free_rec_id, rec_id, size, buffer, ot->ot_thread);
}
xtPublic xtBool xt_tab_put_log_rec_data(XTOpenTablePtr ot, u_int status, xtRecordID free_rec_id, xtRecordID rec_id, size_t size, xtWord1 *buffer, xtOpSeqNo *op_seq)
{
register XTTableHPtr tab = ot->ot_table;
ASSERT_NS(rec_id);
if (status == XT_LOG_ENT_REC_MOVED) {
if (!tab->tab_recs.xt_tc_write(ot->ot_rec_file, rec_id, offsetof(XTTabRecExtDRec, re_log_id_2), size, buffer, op_seq, TRUE, ot->ot_thread))
return FAILED;
}
else {
if (!tab->tab_recs.xt_tc_write(ot->ot_rec_file, rec_id, 0, size, buffer, op_seq, TRUE, ot->ot_thread))
return FAILED;
}
return xt_xlog_modify_table(tab->tab_id, status, *op_seq, 0, free_rec_id, rec_id, size, buffer, ot->ot_thread);
}
xtPublic xtBool xt_tab_get_rec_data(XTOpenTablePtr ot, xtRecordID rec_id, size_t size, xtWord1 *buffer)
{
register XTTableHPtr tab = ot->ot_table;
ASSERT_NS(rec_id);
return tab->tab_recs.xt_tc_read(ot->ot_rec_file, rec_id, (size_t) size, buffer, ot->ot_thread);
}
/*
* Note: this function grants locks even to transactions that
* are not specifically waiting for this transaction.
* This is required, because all threads waiting for
* a lock should be considered "equal". In other words,
* they should not have to wait for the "right" transaction
* before they get the lock, or it will turn into a
* race to wait for the correct transaction.
*
* A transaction T1 can end up waiting for the wrong transaction
* T2, because T2 has released the lock, and given it to T3.
* Of course, T1 will wake up soon and realize this, but
* it is a matter of timing.
*
* The main point is that T2 has release the lock because
* it has ended (see {RELEASING-LOCKS} for more details)
* and therefore, there is no danger of it claiming the
* lock again, which can lead to a deadlock if T1 is
* given the lock instead of T3 in the example above.
* Then, if T2 tries to regain the lock before T1
* realizes that it has the lock.
*/
//static xtBool tab_get_lock_after_wait(XTThreadPtr thread, XTLockWaitPtr lw)
//{
// register XTTableHPtr tab = lw->lw_ot->ot_table;
/* {ROW-LIST-LOCK}
* I don't believe this lock is required. If it is, please explain why!!
* XT_TAB_ROW_READ_LOCK(&tab->tab_row_rwlock[gl->lw_row_id % XT_ROW_RWLOCKS], thread);
*
* With the old row lock implementation a XT_TAB_ROW_WRITE_LOCK was required because
* the row locking did not have its own locks.
* The new list locking has its own locks. I was using XT_TAB_ROW_READ_LOCK,
* but i don't think this is required.
*/
// return tab->tab_locks.xt_set_temp_lock(lw->lw_ot, lw, &lw->lw_thread->st_lock_list);
//}
/*
* NOTE: Previously this function did not gain the row lock.
* If this change is a problem, please document why!
* The previously implementation did wait until no lock was on the
* row.
*
* I am thinking that it is simply a good idea to grab the lock,
* instead of waiting for no lock, before the retry. But it could
* result in locking more than required!
*/
static xtBool tab_wait_for_update(register XTOpenTablePtr ot, xtRowID row_id, xtXactID xn_id, XTThreadPtr thread)
{
XTLockWaitRec lw;
XTXactWaitRec xw;
xtBool ok;
xw.xw_xn_id = xn_id;
lw.lw_thread = thread;
lw.lw_ot = ot;
lw.lw_row_id = row_id;
lw.lw_row_updated = FALSE;
/* First try to get the lock: */
if (!ot->ot_table->tab_locks.xt_set_temp_lock(ot, &lw, &thread->st_lock_list))
return FAILED;
if (lw.lw_curr_lock != XT_NO_LOCK)
/* Wait for the lock, then the transaction: */
ok = xt_xn_wait_for_xact(thread, &xw, &lw);
else
/* Just wait for the transaction: */
ok = xt_xn_wait_for_xact(thread, &xw, NULL);
#ifdef DEBUG_LOCK_QUEUE
ot->ot_table->tab_locks.rl_check(&lw);
#endif
return ok;
}
/* {WAIT-FOR}
* XT_OLD - The record is old. No longer visible because there is
* newer committed record before it in the record list.
* This is a special case of FALSE (the record is not visible).
* (see {WAIT-FOR} for details).
* It is significant because if we find too many of these when
* searching for records, then we have reason to believe the
* sweeper is far behind. This can happen in a test like this:
* runTest(INCREMENT_TEST, 2, INCREMENT_TEST_UPDATE_COUNT);
* What happens is T1 detects an updated row by T2,
* but T2 has not committed yet.
* It waits for T2. T2 commits and updates again before T1
* can update.
*
* Of course if we got a lock on the row when T2 quits, then
* this would not happen!
*/
/*
* Is a record visible?
* Returns TRUE, FALSE, XT_ERR.
*
* TRUE - The record is visible.
* FALSE - The record is not visible.
* XT_ERR - An exception (error) occurred.
* XT_NEW - The most recent variation of this row has been returned
* and is to be used instead of the input!
* XT_REREAD - Re-read the record, and try again.
*
* Basically, a record is visible if it was committed on or before
* the transactions "visible time" (st_visible_time), and there
* are no other visible records before this record in the
* variation chain for the record.
*
* This holds in general, but you don't always get to see the
* visible record (as defined in this sence).
*
* On any kind of update (SELECT FOR UPDATE, UPDATE or DELETE), you
* get to see the most recent variation of the row!
*
* So on update, this function will wait if necessary for a recent
* update to be committed.
*
* So an update is a kind of "committed read" with a wait for
* uncommitted records.
*
* The result:
* - INSERTS may not seen by the update read, depending on when
* they occur.
* - Records may be returned in non-index order.
* - New records returned must be checked again by an index scan
* to make sure they conform to the condition!
*
* CREATE TABLE test_tab (ID int primary key, Value int, Name varchar(20),
* index(Value, Name)) ENGINE=pbxt;
* INSERT test_tab values(4, 2, 'D');
* INSERT test_tab values(5, 2, 'E');
* INSERT test_tab values(6, 2, 'F');
* INSERT test_tab values(7, 2, 'G');
*
* -- C1
* begin;
* select * from test_tab where id = 6 for update;
* -- C2
* begin;
* select * from test_tab where value = 2 order by value, name for update;
* -- C1
* update test_tab set Name = 'A' where id = 7;
* commit;
* -- C2
* Result order D, E, F, A.
*
* But Jim does it like this, so it should be OK.
*/
static int tab_visible(register XTOpenTablePtr ot, XTTabRecHeadDPtr rec_head, xtRecordID *new_rec_id)
{
XTThreadPtr thread = ot->ot_thread;
xtXactID xn_id;
XTTabRecHeadDRec var_head;
xtRowID row_id;
xtRecordID var_rec_id;
register XTTableHPtr tab;
xtBool wait = FALSE;
xtXactID wait_xn_id = 0;
#ifdef TRACE_VARIATIONS
char t_buf[500];
int len;
#endif
int result = TRUE;
xtBool rec_clean;
xtRecordID invalid_rec;
retry:
/* It can be that between the time that I read the index,
* and the time that I try to access the
* record, that the record is removed by
* the sweeper!
*/
if (XT_REC_NOT_VALID(rec_head->tr_rec_type_1))
return FALSE;
row_id = XT_GET_DISK_4(rec_head->tr_row_id_4);
/* This can happen if the row has been removed, and
* reused:
*/
if (ot->ot_curr_row_id && row_id != ot->ot_curr_row_id)
return FALSE;
#ifdef TRACE_VARIATIONS
len = sprintf(t_buf, "row=%d rec=%d ", (int) row_id, (int) ot->ot_curr_rec_id);
#endif
if (!(rec_clean = XT_REC_IS_CLEAN(rec_head->tr_rec_type_1))) {
/* The record is not clean, which means it has not been swept.
* So we have to check if it is visible.
*/
xn_id = XT_GET_DISK_4(rec_head->tr_xact_id_4);
switch (xt_xn_status(ot, xn_id, ot->ot_curr_rec_id)) {
case XT_XN_VISIBLE:
break;
case XT_XN_NOT_VISIBLE:
if (ot->ot_for_update) {
/* It is visible, only if it is an insert,
* which means if has no previous variation.
* Note, if an insert is updated, the record
* should be overwritten (TODO - check this).
*/
var_rec_id = XT_GET_DISK_4(rec_head->tr_prev_rec_id_4);
if (!var_rec_id)
break;
#ifdef TRACE_VARIATIONS
if (len <= 450)
len += sprintf(t_buf+len, "OTHER COMMIT (OVERWRITTEN) T%d\n", (int) xn_id);
xt_ttracef(thread, "%s", t_buf);
#endif
}
#ifdef TRACE_VARIATIONS
else {
if (len <= 450)
len += sprintf(t_buf+len, "OTHER COMMIT T%d\n", (int) xn_id);
xt_ttracef(thread, "%s", t_buf);
}
#endif
/* {WAKE-SW}
* The record is not visible, although it has been committed.
* Clean the transaction ASAP.
*/
ot->ot_table->tab_db->db_sw_faster |= XT_SW_DIRTY_RECORD_FOUND;
return FALSE;
case XT_XN_ABORTED:
/* {WAKE-SW}
* Reading an aborted record, this transaction
* must be cleaned up ASAP!
*/
ot->ot_table->tab_db->db_sw_faster |= XT_SW_DIRTY_RECORD_FOUND;
#ifdef TRACE_VARIATIONS
if (len <= 450)
len += sprintf(t_buf+len, "ABORTED T%d\n", (int) xn_id);
xt_ttracef(thread, "%s", t_buf);
#endif
return FALSE;
case XT_XN_MY_UPDATE:
/* This is a record written by this transaction. */
if (thread->st_is_update) {
/* Check that it was not written by the current update statement: */
if (XT_STAT_ID_MASK(ot->ot_update_id) == rec_head->tr_stat_id_1) {
#ifdef TRACE_VARIATIONS
if (len <= 450)
len += sprintf(t_buf+len, "MY UPDATE IN THIS STATEMENT T%d\n", (int) xn_id);
xt_ttracef(thread, "%s", t_buf);
#endif
return FALSE;
}
}
ot->ot_curr_row_id = row_id;
ot->ot_curr_updated = TRUE;
if (!(xt_tab_get_row(ot, row_id, &var_rec_id)))
return XT_ERR;
/* It is visible if it is at the front of the list.
* An update can end up not being at the front of the list
* if it is deleted afterwards!
*/
#ifdef TRACE_VARIATIONS
if (len <= 450) {
if (var_rec_id == ot->ot_curr_rec_id)
len += sprintf(t_buf+len, "MY UPDATE T%d\n", (int) xn_id);
else
len += sprintf(t_buf+len, "MY UPDATE (OVERWRITTEN) T%d\n", (int) xn_id);
}
xt_ttracef(thread, "%s", t_buf);
#endif
return var_rec_id == ot->ot_curr_rec_id;
case XT_XN_OTHER_UPDATE:
if (ot->ot_for_update) {
/* If this is an insert, we are interested!
* Updated values are handled below. This is because
* the changed (new) records returned below are always
* followed (in the version chain) by the record
* we would have returned (if nothing had changed).
*
* As a result, we only return records here which have
* no "history".
*/
var_rec_id = XT_GET_DISK_4(rec_head->tr_prev_rec_id_4);
if (!var_rec_id) {
#ifdef TRACE_VARIATIONS
if (len <= 450)
len += sprintf(t_buf+len, "OTHER INSERT (WAIT FOR) T%d\n", (int) xn_id);
xt_ttracef(thread, "%s", t_buf);
#endif
if (!tab_wait_for_update(ot, row_id, xn_id, thread))
return XT_ERR;
if (!xt_tab_get_rec_data(ot, ot->ot_curr_rec_id, sizeof(XTTabRecHeadDRec), (xtWord1 *) &var_head))
return XT_ERR;
rec_head = &var_head;
goto retry;
}
}
#ifdef TRACE_VARIATIONS
if (len <= 450)
len += sprintf(t_buf+len, "OTHER UPDATE T%d\n", (int) xn_id);
xt_ttracef(thread, "%s", t_buf);
#endif
return FALSE;
case XT_XN_REREAD:
#ifdef TRACE_VARIATIONS
if (len <= 450)
len += sprintf(t_buf+len, "REREAD?! T%d\n", (int) xn_id);
xt_ttracef(thread, "%s", t_buf);
#endif
return XT_REREAD;
}
}
/* Follow the variation chain until we come to this record.
* If it is not the first visible variation then
* it is not visible at all. If it in not found on the
* variation chain, it is also not visible.
*/
tab = ot->ot_table;
retry_2:
#ifdef XT_USE_LIST_BASED_ROW_LOCKS
/* The list based row locks used there own locks, so
* it is not necessary to get a write lock here.
*/
XT_TAB_ROW_READ_LOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], thread);
#else
if (ot->ot_for_update)
XT_TAB_ROW_WRITE_LOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], thread);
else
XT_TAB_ROW_READ_LOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], thread);
#endif
invalid_rec = 0;
retry_3:
if (!(xt_tab_get_row(ot, row_id, &var_rec_id)))
goto failed;
#ifdef TRACE_VARIATIONS
len += sprintf(t_buf+len, "ROW=%d", (int) row_id);
#endif
while (var_rec_id != ot->ot_curr_rec_id) {
if (!var_rec_id) {
#ifdef TRACE_VARIATIONS
xt_ttracef(thread, "row=%d rec=%d NOT VISI not found in list\n", (int) row_id, (int) ot->ot_curr_rec_id);
#endif
goto not_found;
}
if (!xt_tab_get_rec_data(ot, var_rec_id, sizeof(XTTabRecHeadDRec), (xtWord1 *) &var_head))
goto failed;
#ifdef TRACE_VARIATIONS
if (len <= 450)
len += sprintf(t_buf+len, " -> %d(%d)", (int) var_rec_id, (int) var_head.tr_rec_type_1);
#endif
/* All clean records are visible, by all transactions: */
if (XT_REC_IS_CLEAN(var_head.tr_rec_type_1)) {
#ifdef TRACE_VARIATIONS
xt_ttracef(thread, "row=%d rec=%d NOT VISI clean rec found\n", (int) row_id, (int) ot->ot_curr_rec_id);
#endif
goto not_found;
}
if (XT_REC_IS_FREE(var_head.tr_rec_type_1)) {
#ifdef TRACE_VARIATIONS
xt_ttracef(thread, "row=%d rec=%d NOT VISI free rec found?!\n", (int) row_id, (int) ot->ot_curr_rec_id);
#endif
/*
* After an analysis we came to conclusion that this situation is
* possible and valid. It can happen if index scan and row deletion
* go in parallel:
*
* Client Thread Sweeper
* ------------- -------
* 1. start index scan, lock the index file.
* 2. start row deletion, wait for index lock
* 3. unlock the index file, start search for
* the valid version of the record
* 4. delete the row, mark record as freed,
* but not yet cleaned by sweeper
* 5. observe the record being freed
*
* after these steps we can get here, if the record was marked as free after
* the tab_visible was entered by the scanning thread.
*
*/
if (invalid_rec != var_rec_id) {
/* This was "var_rec_id = invalid_rec", caused an infinite loop (bug #310184!) */
invalid_rec = var_rec_id;
goto retry_3;
}
/* Assume end of list. */
goto not_found;
}
/* This can happen if the row has been removed, and
* reused:
*/
if (row_id != XT_GET_DISK_4(var_head.tr_row_id_4))
goto not_found;
xn_id = XT_GET_DISK_4(var_head.tr_xact_id_4);
/* This variation is visibleif committed before this
* transaction started, or updated by this transaction.
*
* We now know that this is the valid variation for
* this record (for this table) for this transaction!
* This will not change, unless the transaction
* updates the record (again).
*
* So we can store this information as a hint, if
* we see other variations belonging to this record,
* then we can ignore them immediately!
*/
switch (xt_xn_status(ot, xn_id, var_rec_id)) {
case XT_XN_VISIBLE:
/* {WAKE-SW}
* We have encountered a record that has been overwritten, if the
* record has not been cleaned, then the sweeper is too far
* behind!
*/
if (!rec_clean)
ot->ot_table->tab_db->db_sw_faster |= XT_SW_DIRTY_RECORD_FOUND;
#ifdef TRACE_VARIATIONS
xt_ttracef(thread, "row=%d rec=%d NOT VISI committed rec found\n", (int) row_id, (int) ot->ot_curr_rec_id);
#endif
goto not_found;
case XT_XN_NOT_VISIBLE:
if (ot->ot_for_update) {
/* Substitute this record for the one we
* are reading!!
*/
if (result == TRUE) {
if (XT_REC_IS_DELETE(var_head.tr_rec_type_1))
result = FALSE;
else {
*new_rec_id = var_rec_id;
result = XT_NEW;
}
}
}
break;
case XT_XN_ABORTED:
/* Ignore the record, it will be removed. */
break;
case XT_XN_MY_UPDATE:
#ifdef TRACE_VARIATIONS
xt_ttracef(thread, "row=%d rec=%d NOT VISI my update found\n", (int) row_id, (int) ot->ot_curr_rec_id);
#endif
goto not_found;
case XT_XN_OTHER_UPDATE:
/* Wait for this update to commit or abort: */
if (!wait) {
wait = TRUE;
wait_xn_id = xn_id;
}
#ifdef TRACE_VARIATIONS
if (len <= 450)
len += sprintf(t_buf+len, "-T%d", (int) wait_xn_id);
#endif
break;
case XT_XN_REREAD:
/* {RETRY-READ}
* TODO: This is not as "correct" as it could be.
* Such records should be considered to be aborted,
* and removed from the list.
*/
if (invalid_rec != var_rec_id) {
invalid_rec = var_rec_id;
goto retry_3;
}
if (!tab_record_corrupt(ot, row_id, var_rec_id, true, 1))
goto failed;
/* Assume end of list. */
#ifdef XT_CRASH_DEBUG
/* Should not happen! */
xt_crash_me();
#endif
goto not_found;
}
var_rec_id = XT_GET_DISK_4(var_head.tr_prev_rec_id_4);
}
#ifdef TRACE_VARIATIONS
if (len <= 450)
sprintf(t_buf+len, " -> %d(%d)\n", (int) var_rec_id, (int) rec_head->tr_rec_type_1);
else
sprintf(t_buf+len, " ...\n");
//xt_ttracef(thread, "%s", t_buf);
#endif
if (ot->ot_for_update) {
xtBool ok;
XTLockWaitRec lw;
if (wait) {
XT_TAB_ROW_UNLOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], thread);
#ifdef TRACE_VARIATIONS
xt_ttracef(thread, "T%d WAIT FOR T%d (will retry)\n", (int) thread->st_xact_data->xd_start_xn_id, (int) wait_xn_id);
#endif
if (!tab_wait_for_update(ot, row_id, wait_xn_id, thread))
return XT_ERR;
wait = FALSE;
wait_xn_id = 0;
/*
* Retry in order to try to avoid missing
* any records that we should see in FOR UPDATE
* mode.
*
* We also want to take another look at the record
* we just tried to read.
*
* If it has been updated, then a new record has
* been created. This will be detected when we
* try to read it again, and XT_NEW will be returned.
*/
thread->st_statistics.st_retry_index_scan++;
return XT_RETRY;
}
/* {ROW-LIST-LOCK} */
lw.lw_thread = thread;
lw.lw_ot = ot;
lw.lw_row_id = row_id;
lw.lw_row_updated = FALSE;
ok = tab->tab_locks.xt_set_temp_lock(ot, &lw, &thread->st_lock_list);
XT_TAB_ROW_UNLOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], thread);
if (!ok) {
#ifdef DEBUG_LOCK_QUEUE
ot->ot_table->tab_locks.rl_check(&lw);
#endif
return XT_ERR;
}
if (lw.lw_curr_lock != XT_NO_LOCK) {
#ifdef TRACE_VARIATIONS
xt_ttracef(thread, "T%d WAIT FOR LOCK(%s) T%d\n", (int) thread->st_xact_data->xd_start_xn_id, (int) lw.lw_curr_lock == XT_TEMP_LOCK ? "temp" : "perm", (int) xn_id);
#endif
if (!xt_xn_wait_for_xact(thread, NULL, &lw)) {
#ifdef DEBUG_LOCK_QUEUE
ot->ot_table->tab_locks.rl_check(&lw);
#endif
return XT_ERR;
}
#ifdef DEBUG_LOCK_QUEUE
ot->ot_table->tab_locks.rl_check(&lw);
#endif
#ifdef TRACE_VARIATIONS
len = sprintf(t_buf, "(retry): row=%d rec=%d ", (int) row_id, (int) ot->ot_curr_rec_id);
#endif
/* GOTCHA!
* Reset the result before we go down the list again, to make sure we
* get the latest record!!
*/
result = TRUE;
thread->st_statistics.st_reread_record_list++;
goto retry_2;
}
#ifdef DEBUG_LOCK_QUEUE
ot->ot_table->tab_locks.rl_check(&lw);
#endif
}
else {
XT_TAB_ROW_UNLOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], thread);
}
#ifdef TRACE_VARIATIONS
if (result == XT_NEW)
xt_ttracef(thread, "row=%d rec=%d RETURN NEW %d\n", (int) row_id, (int) ot->ot_curr_rec_id, (int) *new_rec_id);
else if (result)
xt_ttracef(thread, "row=%d rec=%d VISIBLE\n", (int) row_id, (int) ot->ot_curr_rec_id);
else
xt_ttracef(thread, "row=%d rec=%d RETURN NOT VISIBLE (NEW)\n", (int) row_id, (int) ot->ot_curr_rec_id);
#endif
ot->ot_curr_row_id = row_id;
ot->ot_curr_updated = FALSE;
return result;
not_found:
XT_TAB_ROW_UNLOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], thread);
return FALSE;
failed:
XT_TAB_ROW_UNLOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], thread);
return XT_ERR;
}
/*
* Return TRUE if the record has been read, and is visible.
* Return FALSE if the record is not visible.
* Return XT_ERR if an error occurs.
*/
xtPublic int xt_tab_visible(XTOpenTablePtr ot)
{
xtRowID row_id;
XTTabRecHeadDRec rec_head;
xtRecordID new_rec_id;
xtBool read_again = FALSE;
int r;
if ((row_id = ot->ot_curr_row_id)) {
/* Fast track, do a quick check.
* Row ID is only set if this record has been committed,
* (and swept).
* Check if it is the first on the list!
*/
xtRecordID var_rec_id;
retry:
if (!(xt_tab_get_row(ot, row_id, &var_rec_id)))
return XT_ERR;
if (ot->ot_curr_rec_id == var_rec_id) {
/* Looks good.. */
if (ot->ot_for_update) {
XTThreadPtr thread = ot->ot_thread;
XTTableHPtr tab = ot->ot_table;
XTLockWaitRec lw;
/* {ROW-LIST-LOCK} */
lw.lw_thread = thread;
lw.lw_ot = ot;
lw.lw_row_id = row_id;
lw.lw_row_updated = FALSE;
if (!tab->tab_locks.xt_set_temp_lock(ot, &lw, &thread->st_lock_list)) {
#ifdef DEBUG_LOCK_QUEUE
ot->ot_table->tab_locks.rl_check(&lw);
#endif
return XT_ERR;
}
if (lw.lw_curr_lock != XT_NO_LOCK) {
if (!xt_xn_wait_for_xact(thread, NULL, &lw)) {
#ifdef DEBUG_LOCK_QUEUE
ot->ot_table->tab_locks.rl_check(&lw);
#endif
return XT_ERR;
}
#ifdef DEBUG_LOCK_QUEUE
ot->ot_table->tab_locks.rl_check(&lw);
#endif
goto retry;
}
#ifdef DEBUG_LOCK_QUEUE
ot->ot_table->tab_locks.rl_check(&lw);
#endif
}
return TRUE;
}
}
reread:
if (!xt_tab_get_rec_data(ot, ot->ot_curr_rec_id, sizeof(XTTabRecHeadDRec), (xtWord1 *) &rec_head))
return XT_ERR;
switch ((r = tab_visible(ot, &rec_head, &new_rec_id))) {
case XT_NEW:
ot->ot_curr_rec_id = new_rec_id;
break;
case XT_REREAD:
/* Avoid infinite loop: */
if (read_again) {
/* Should not happen! */
if (!tab_record_corrupt(ot, row_id, ot->ot_curr_rec_id, true, 2))
return XT_ERR;
#ifdef XT_CRASH_DEBUG
/* Generate a core dump! */
xt_crash_me();
#endif
return FALSE;
}
read_again = TRUE;
goto reread;
default:
break;
}
return r;
}
/*
* Read a record, and return one of the following:
* TRUE - the record has been read, and is visible.
* FALSE - the record is not visible.
* XT_ERR - an error occurs.
* XT_NEW - Means the expected record has been changed.
* When doing an index scan, the conditions must be checked again!
*/
xtPublic int xt_tab_read_record(register XTOpenTablePtr ot, xtWord1 *buffer)
{
register XTTableHPtr tab = ot->ot_table;
size_t rec_size = tab->tab_dic.dic_rec_size;
xtRecordID new_rec_id;
int result;
xtBool read_again = FALSE;
if (!(ot->ot_thread->st_xact_data)) {
xt_register_xterr(XT_REG_CONTEXT, XT_ERR_NO_TRANSACTION);
return XT_ERR;
}
reread:
if (!xt_tab_get_rec_data(ot, ot->ot_curr_rec_id, rec_size, ot->ot_row_rbuffer))
return XT_ERR;
switch (tab_visible(ot, (XTTabRecHeadDPtr) ot->ot_row_rbuffer, &new_rec_id)) {
case FALSE:
return FALSE;
case XT_ERR:
return XT_ERR;
case XT_NEW:
if (!xt_tab_get_rec_data(ot, new_rec_id, rec_size, ot->ot_row_rbuffer))
return XT_ERR;
ot->ot_curr_rec_id = new_rec_id;
result = XT_NEW;
break;
case XT_RETRY:
return XT_RETRY;
case XT_REREAD:
/* Avoid infinite loop: */
if (read_again) {
/* Should not happen! */
if (!tab_record_corrupt(ot, XT_GET_DISK_4(((XTTabRecHeadDPtr) ot->ot_row_rbuffer)->tr_row_id_4), ot->ot_curr_rec_id, true, 3))
return XT_ERR;
#ifdef XT_CRASH_DEBUG
/* Generate a core dump! */
xt_crash_me();
#endif
return FALSE;
}
read_again = TRUE;
goto reread;
default:
result = OK;
break;
}
if (ot->ot_rec_fixed)
memcpy(buffer, ot->ot_row_rbuffer + XT_REC_FIX_HEADER_SIZE, rec_size - XT_REC_FIX_HEADER_SIZE);
else if (ot->ot_row_rbuffer[0] == XT_TAB_STATUS_VARIABLE || ot->ot_row_rbuffer[0] == XT_TAB_STATUS_VAR_CLEAN) {
if (!myxt_load_row(ot, ot->ot_row_rbuffer + XT_REC_FIX_HEADER_SIZE, buffer, ot->ot_cols_req))
return XT_ERR;
}
else {
u_int cols_req = ot->ot_cols_req;
ASSERT_NS(cols_req);
if (cols_req && cols_req <= tab->tab_dic.dic_fix_col_count) {
if (!myxt_load_row(ot, ot->ot_row_rbuffer + XT_REC_EXT_HEADER_SIZE, buffer, cols_req))
return XT_ERR;
}
else {
if (!xt_tab_load_ext_data(ot, ot->ot_curr_rec_id, buffer, cols_req))
return XT_ERR;
}
}
return result;
}
/*
* Returns:
*
* TRUE/OK - record was read.
* FALSE/FAILED - An error occurred.
*/
xtPublic int xt_tab_dirty_read_record(register XTOpenTablePtr ot, xtWord1 *buffer)
{
register XTTableHPtr tab = ot->ot_table;
size_t rec_size = tab->tab_dic.dic_rec_size;
if (!xt_tab_get_rec_data(ot, ot->ot_curr_rec_id, rec_size, ot->ot_row_rbuffer))
return FAILED;
if (XT_REC_NOT_VALID(ot->ot_row_rbuffer[0])) {
/* Should not happen! */
xt_register_xterr(XT_REG_CONTEXT, XT_ERR_RECORD_DELETED);
return FAILED;
}
ot->ot_curr_row_id = XT_GET_DISK_4(((XTTabRecHeadDPtr) ot->ot_row_rbuffer)->tr_row_id_4);
ot->ot_curr_updated =
(XT_GET_DISK_4(((XTTabRecHeadDPtr) ot->ot_row_rbuffer)->tr_xact_id_4) == ot->ot_thread->st_xact_data->xd_start_xn_id);
if (ot->ot_rec_fixed)
memcpy(buffer, ot->ot_row_rbuffer + XT_REC_FIX_HEADER_SIZE, rec_size - XT_REC_FIX_HEADER_SIZE);
else if (ot->ot_row_rbuffer[0] == XT_TAB_STATUS_VARIABLE || ot->ot_row_rbuffer[0] == XT_TAB_STATUS_VAR_CLEAN) {
if (!myxt_load_row(ot, ot->ot_row_rbuffer + XT_REC_FIX_HEADER_SIZE, buffer, ot->ot_cols_req))
return FAILED;
}
else {
u_int cols_req = ot->ot_cols_req;
ASSERT_NS(cols_req);
if (cols_req && cols_req <= tab->tab_dic.dic_fix_col_count) {
if (!myxt_load_row(ot, ot->ot_row_rbuffer + XT_REC_EXT_HEADER_SIZE, buffer, cols_req))
return FAILED;
}
else {
if (!xt_tab_load_ext_data(ot, ot->ot_curr_rec_id, buffer, cols_req))
return FAILED;
}
}
return OK;
}
#ifdef XT_USE_ROW_REC_MMAP_FILES
/* Loading into cache is not required,
* Instead we copy the memory map to load the
* data.
*/
#define TAB_ROW_LOAD_CACHE FALSE
#else
#define TAB_ROW_LOAD_CACHE TRUE
#endif
/*
* Pull the entire row pointer file into memory.
*/
xtPublic void xt_tab_load_row_pointers(XTThreadPtr self, XTOpenTablePtr ot)
{
XTTableHPtr tab = ot->ot_table;
xtRecordID eof_rec_id = tab->tab_row_eof_id;
xtInt8 usage;
xtWord1 *buffer = NULL;
/* Check if there is enough cache: */
usage = xt_tc_get_usage();
if (xt_tc_get_high() > usage)
usage = xt_tc_get_high();
if (usage + ((xtInt8) eof_rec_id * (xtInt8) tab->tab_rows.tci_rec_size) < xt_tc_get_size()) {
xtRecordID rec_id;
size_t poffset, tfer;
off_t offset, end_offset;
XTTabCachePagePtr page;
end_offset = xt_row_id_to_row_offset(tab, eof_rec_id);
rec_id = 1;
while (rec_id < eof_rec_id) {
if (!tab->tab_rows.xt_tc_get_page(ot->ot_row_file, rec_id, TAB_ROW_LOAD_CACHE, &page, &poffset, self))
xt_throw(self);
if (page)
tab->tab_rows.xt_tc_release_page(ot->ot_row_file, page, self);
else {
xtWord1 *buff_ptr;
if (!buffer)
buffer = (xtWord1 *) xt_malloc(self, tab->tab_rows.tci_page_size);
offset = xt_row_id_to_row_offset(tab, rec_id);
tfer = tab->tab_rows.tci_page_size;
if (offset + (off_t) tfer > end_offset)
tfer = (size_t) (end_offset - offset);
XT_LOCK_MEMORY_PTR(buff_ptr, ot->ot_row_file, offset, tfer, &self->st_statistics.st_rec, self);
if (buff_ptr) {
memcpy(buffer, buff_ptr, tfer);
XT_UNLOCK_MEMORY_PTR(ot->ot_row_file, buff_ptr, self);
}
}
rec_id += tab->tab_rows.tci_rows_per_page;
}
if (buffer)
xt_free(self, buffer);
}
}
xtPublic void xt_tab_load_table(XTThreadPtr self, XTOpenTablePtr ot)
{
xt_load_pages(self, ot);
xt_load_indices(self, ot);
}
xtPublic xtBool xt_tab_load_record(register XTOpenTablePtr ot, xtRecordID rec_id, XTInfoBufferPtr rec_buf)
{
register XTTableHPtr tab = ot->ot_table;
size_t rec_size = tab->tab_dic.dic_rec_size;
if (!xt_tab_get_rec_data(ot, rec_id, rec_size, ot->ot_row_rbuffer))
return FAILED;
if (XT_REC_NOT_VALID(ot->ot_row_rbuffer[0])) {
/* Should not happen! */
XTThreadPtr self = ot->ot_thread;
xt_log(XT_WARNING, "Recently updated record invalid\n");
return OK;
}
ot->ot_curr_row_id = XT_GET_DISK_4(((XTTabRecHeadDPtr) ot->ot_row_rbuffer)->tr_row_id_4);
ot->ot_curr_updated =
(XT_GET_DISK_4(((XTTabRecHeadDPtr) ot->ot_row_rbuffer)->tr_xact_id_4) == ot->ot_thread->st_xact_data->xd_start_xn_id);
if (ot->ot_rec_fixed) {
size_t size = rec_size - XT_REC_FIX_HEADER_SIZE;
if (!xt_ib_alloc(NULL, rec_buf, size))
return FAILED;
memcpy(rec_buf->ib_db.db_data, ot->ot_row_rbuffer + XT_REC_FIX_HEADER_SIZE, size);
}
else {
if (!xt_ib_alloc(NULL, rec_buf, tab->tab_dic.dic_mysql_buf_size))
return FAILED;
if (ot->ot_row_rbuffer[0] == XT_TAB_STATUS_VARIABLE || ot->ot_row_rbuffer[0] == XT_TAB_STATUS_VAR_CLEAN) {
if (!myxt_load_row(ot, ot->ot_row_rbuffer + XT_REC_FIX_HEADER_SIZE, rec_buf->ib_db.db_data, ot->ot_cols_req))
return FAILED;
}
else {
u_int cols_req = ot->ot_cols_req;
ASSERT_NS(cols_req);
if (cols_req && cols_req <= tab->tab_dic.dic_fix_col_count) {
if (!myxt_load_row(ot, ot->ot_row_rbuffer + XT_REC_EXT_HEADER_SIZE, rec_buf->ib_db.db_data, cols_req))
return FAILED;
}
else {
if (!xt_tab_load_ext_data(ot, ot->ot_curr_rec_id, rec_buf->ib_db.db_data, cols_req))
return FAILED;
}
}
}
return OK;
}
xtPublic xtBool xt_tab_free_row(XTOpenTablePtr ot, XTTableHPtr tab, xtRowID row_id)
{
XTTabRowRefDRec free_row;
xtRowID prev_row;
xtOpSeqNo op_seq;
ASSERT_NS(row_id); // Cannot free the header!
xt_lock_mutex_ns(&tab->tab_row_lock);
prev_row = tab->tab_row_free_id;
XT_SET_DISK_4(free_row.rr_ref_id_4, prev_row);
if (!tab->tab_rows.xt_tc_write(ot->ot_row_file, row_id, 0, sizeof(XTTabRowRefDRec), (xtWord1 *) &free_row, &op_seq, TRUE, ot->ot_thread)) {
xt_unlock_mutex_ns(&tab->tab_row_lock);
return FAILED;
}
tab->tab_row_free_id = row_id;
tab->tab_row_fnum++;
ASSERT_NS(tab->tab_row_fnum < tab->tab_row_eof_id);
xt_unlock_mutex_ns(&tab->tab_row_lock);
if (!xt_xlog_modify_table(tab->tab_id, XT_LOG_ENT_ROW_FREED, op_seq, 0, 0, row_id, sizeof(XTTabRowRefDRec), (xtWord1 *) &free_row, ot->ot_thread))
return FAILED;
return OK;
}
static void tab_free_ext_record_on_fail(XTOpenTablePtr ot, xtRecordID rec_id, XTTabRecExtDPtr ext_rec, xtBool log_err)
{
xtWord4 log_over_size = XT_GET_DISK_4(ext_rec->re_log_dat_siz_4);
xtLogID log_id;
xtLogOffset log_offset;
XT_GET_LOG_REF(log_id, log_offset, ext_rec);
if (ot->ot_table->tab_dic.dic_tab_flags & XT_TF_MEMORY_TABLE)
xt_tab_free_ext_slot(ot->ot_table, log_id, log_offset, log_over_size);
else {
if (!ot->ot_thread->st_dlog_buf.dlb_delete_log(log_id, log_offset, log_over_size, ot->ot_table->tab_id, rec_id, ot->ot_thread)) {
if (log_err)
xt_log_and_clear_exception_ns();
}
}
}
static void tab_save_exception(XTExceptionPtr e)
{
XTThreadPtr self = xt_get_self();
*e = self->t_exception;
}
static void tab_restore_exception(XTExceptionPtr e)
{
XTThreadPtr self = xt_get_self();
self->t_exception = *e;
}
/*
* This function assumes that a record may be partially written.
* It removes all associated data and references to the record.
*
* This function return XT_ERR if an error occurs.
* TRUE if the record has been removed, and may be freed.
* FALSE if the record has already been freed.
*
*/
xtPublic int xt_tab_remove_record(XTOpenTablePtr ot, xtRecordID rec_id, xtWord1 *rec_data, xtRecordID *prev_var_id, xtBool clean_delete, xtRowID row_id, xtXactID XT_UNUSED(xn_id))
{
register XTTableHPtr tab = ot->ot_table;
size_t rec_size;
xtWord1 old_rec_type;
u_int cols_req;
u_int cols_in_buffer;
*prev_var_id = 0;
if (!rec_id)
return FALSE;
/*
* NOTE: This function uses the read buffer. This should be OK because
* the function is only called by the sweeper. The read buffer
* is REQUIRED because of the call to xt_tab_load_ext_data()!!!
*/
rec_size = tab->tab_dic.dic_rec_size;
if (!xt_tab_get_rec_data(ot, rec_id, rec_size, ot->ot_row_rbuffer))
return XT_ERR;
old_rec_type = ot->ot_row_rbuffer[0];
/* Check of the record has not already been freed: */
if (XT_REC_IS_FREE(old_rec_type))
return FALSE;
/* This record must belong to the given row: */
if (XT_GET_DISK_4(((XTTabRecExtDPtr) ot->ot_row_rbuffer)->tr_row_id_4) != row_id)
return FALSE;
/* The transaction ID of the record must be BEFORE or equal to the given
* transaction ID.
*
* No, this does not always hold. Because we wait for updates now,
* a "younger" transaction can update before an older
* transaction.
* Commit order determined the actual order in which the transactions
* should be replicated. This is determined by the log number of
* the commit record!
if (db->db_xn_curr_id(xn_id, XT_GET_DISK_4(((XTTabRecExtDPtr) ot->ot_row_rbuffer)->tr_xact_id_4)))
return FALSE;
*/
*prev_var_id = XT_GET_DISK_4(((XTTabRecExtDPtr) ot->ot_row_rbuffer)->tr_prev_rec_id_4);
if (tab->tab_dic.dic_key_count) {
XTIndexPtr *ind;
switch (old_rec_type) {
case XT_TAB_STATUS_DELETE:
case XT_TAB_STATUS_DEL_CLEAN:
rec_size = sizeof(XTTabRecHeadDRec);
goto set_removed;
case XT_TAB_STATUS_FIXED:
case XT_TAB_STATUS_FIX_CLEAN:
/* We know that for a fixed length record,
* dic_ind_rec_len <= dic_rec_size! */
rec_size = (size_t) tab->tab_dic.dic_ind_rec_len + XT_REC_FIX_HEADER_SIZE;
rec_data = ot->ot_row_rbuffer + XT_REC_FIX_HEADER_SIZE;
break;
case XT_TAB_STATUS_VARIABLE:
case XT_TAB_STATUS_VAR_CLEAN:
cols_req = tab->tab_dic.dic_ind_cols_req;
cols_in_buffer = cols_req;
rec_size = myxt_load_row_length(ot, rec_size - XT_REC_FIX_HEADER_SIZE, ot->ot_row_rbuffer + XT_REC_FIX_HEADER_SIZE, &cols_in_buffer);
if (cols_in_buffer < cols_req)
rec_size = tab->tab_dic.dic_rec_size;
else
rec_size += XT_REC_FIX_HEADER_SIZE;
if (!myxt_load_row(ot, ot->ot_row_rbuffer + XT_REC_FIX_HEADER_SIZE, rec_data, cols_req)) {
xt_log_and_clear_exception_ns();
goto set_removed;
}
break;
case XT_TAB_STATUS_EXT_DLOG:
case XT_TAB_STATUS_EXT_CLEAN:
cols_req = tab->tab_dic.dic_ind_cols_req;
ASSERT_NS(cols_req);
cols_in_buffer = cols_req;
rec_size = myxt_load_row_length(ot, rec_size - XT_REC_EXT_HEADER_SIZE, ot->ot_row_rbuffer + XT_REC_EXT_HEADER_SIZE, &cols_in_buffer);
if (cols_in_buffer < cols_req) {
rec_size = tab->tab_dic.dic_rec_size;
if (!xt_tab_load_ext_data(ot, rec_id, rec_data, cols_req)) {
/* This is actually quite possible after recovery, see [(3)] */
if (ot->ot_thread->t_exception.e_xt_err != XT_ERR_BAD_EXT_RECORD &&
ot->ot_thread->t_exception.e_xt_err != XT_ERR_DATA_LOG_NOT_FOUND)
xt_log_and_clear_exception_ns();
goto set_removed;
}
}
else {
/* All the records we require are in the buffer... */
rec_size += XT_REC_EXT_HEADER_SIZE;
if (!myxt_load_row(ot, ot->ot_row_rbuffer + XT_REC_EXT_HEADER_SIZE, rec_data, cols_req)) {
xt_log_and_clear_exception_ns();
goto set_removed;
}
}
break;
default:
break;
}
/* Could this be the case?: This change may only be flushed after the
* operation below has been flushed to the log.
*
* No, remove records are never "undone". The sweeper will delete
* the record again if it does not land in the log.
*
* The fact that the index entries have already been removed is not
* a problem.
*/
if (!tab->tab_dic.dic_disable_index) {
ind = tab->tab_dic.dic_keys;
for (u_int i=0; i<tab->tab_dic.dic_key_count; i++, ind++) {
if (!xt_idx_delete(ot, *ind, rec_id, rec_data))
xt_log_and_clear_exception_ns();
}
}
}
else {
/* No indices: */
switch (old_rec_type) {
case XT_TAB_STATUS_DELETE:
case XT_TAB_STATUS_DEL_CLEAN:
rec_size = XT_REC_FIX_HEADER_SIZE;
break;
case XT_TAB_STATUS_FIXED:
case XT_TAB_STATUS_FIX_CLEAN:
case XT_TAB_STATUS_VARIABLE:
case XT_TAB_STATUS_VAR_CLEAN:
rec_size = XT_REC_FIX_HEADER_SIZE;
break;
case XT_TAB_STATUS_EXT_DLOG:
case XT_TAB_STATUS_EXT_CLEAN:
rec_size = XT_REC_EXT_HEADER_SIZE;
break;
}
}
set_removed:
if (XT_REC_IS_EXT_DLOG(old_rec_type)) {
/* {LOCK-EXT-REC} Lock, and read again to make sure that the
* compactor does not change this record, while
* we are removing it! */
xt_lock_mutex_ns(&tab->tab_db->db_co_ext_lock);
if (!xt_tab_get_rec_data(ot, rec_id, XT_REC_EXT_HEADER_SIZE, ot->ot_row_rbuffer)) {
xt_unlock_mutex_ns(&tab->tab_db->db_co_ext_lock);
return XT_ERR;
}
xt_unlock_mutex_ns(&tab->tab_db->db_co_ext_lock);
}
/* A record is "clean" deleted if the record was
* XT_TAB_STATUS_DELETE which was comitted.
* This makes sure that the record will still invalidate
* following records in a row.
*
* Example:
*
* 1. INSERT A ROW, then DELETE it, assume the sweeper is delayed.
*
* We now have the sequence row X --> del rec A --> valid rec B.
*
* 2. A SELECT can still find B. Assume it now goes to check
* if the record is valid, it reads row X, and gets A.
*
* 3. Now the sweeper gets control and removes X, A and B.
* It frees A with the clean bit.
*
* 4. Now the SELECT gets control and reads A. Normally a freed record
* would be ignored, and it would go onto B, which would then
* be considered valid (note, even after the free, the next
* pointer is not affected).
*
* However, because the clean bit has been set, it will stop at A
* and consider B invalid (which is the desired result).
*
* NOTE: We assume it is not possible for A to be allocated and refer
* to B, because B is freed before A. This means that B may refer to
* A after the next allocation.
*/
xtOpSeqNo op_seq;
XTTabRecFreeDPtr free_rec = (XTTabRecFreeDPtr) ot->ot_row_rbuffer;
xtRecordID prev_rec_id;
xtWord1 new_rec_type = XT_TAB_STATUS_FREED | (clean_delete ? XT_TAB_STATUS_CLEANED_BIT : 0);
u_int status = XT_LOG_ENT_REC_REMOVED_BI;
xt_lock_mutex_ns(&tab->tab_rec_lock);
free_rec->rf_rec_type_1 = new_rec_type;
#ifdef XT_CLUSTER_FREE_RECORDS
XTTabCachePagePtr page;
size_t offset;
if (!tab->tab_recs.xt_tc_lock_page(ot->ot_rec_file, &page, rec_id, &offset, ot->ot_thread)) {
xt_unlock_mutex_ns(&tab->tab_rec_lock);
return FAILED;
}
if (page->tcp_free_rec == 0xFFFF) {
/* There is no free record on this page. */
prev_rec_id = tab->tab_rec_free_id;
XT_SET_DISK_4(free_rec->rf_next_rec_id_4, prev_rec_id);
memcpy(page->tcp_data + offset, ot->ot_row_rbuffer, sizeof(XTTabRecFreeDRec));
tab->tab_rec_free_id = rec_id;
}
else {
XTTabRecFreeDPtr prev_free_rec = (XTTabRecFreeDPtr) (page->tcp_data + page->tcp_free_rec);
status = XT_LOG_ENT_REC_REMOVED_BI_L;
XT_COPY_DISK_4(free_rec->rf_next_rec_id_4, prev_free_rec->rf_next_rec_id_4);
memcpy(page->tcp_data + offset, ot->ot_row_rbuffer, sizeof(XTTabRecFreeDRec));
/* The previous now references the next: */
XT_SET_DISK_4(prev_free_rec->rf_next_rec_id_4, rec_id);
/* This is the record ID of the previous record: */
ASSERT_NS((page->tcp_free_rec % tab->tab_recs.tci_rec_size) == 0);
prev_rec_id = (page->tcp_page_idx * tab->tab_recs.tci_rows_per_page) + (page->tcp_free_rec / tab->tab_recs.tci_rec_size) + 1;
ASSERT_NS(prev_rec_id != rec_id);
}
/* Link after this page in future! */
ASSERT_NS((offset % tab->tab_recs.tci_rec_size) == 0);
page->tcp_free_rec = offset;
tab->tab_recs.xt_tc_unlock_page(ot->ot_rec_file, page, &op_seq, ot->ot_thread);
#else
prev_rec_id = tab->tab_rec_free_id;
XT_SET_DISK_4(free_rec->rf_next_rec_id_4, prev_rec_id);
if (!xt_tab_put_rec_data(ot, rec_id, sizeof(XTTabRecFreeDRec), ot->ot_row_rbuffer, &op_seq)) {
xt_unlock_mutex_ns(&tab->tab_rec_lock);
return XT_ERR;
}
tab->tab_rec_free_id = rec_id;
ASSERT_NS(tab->tab_rec_free_id < tab->tab_rec_eof_id);
#endif
tab->tab_rec_fnum++;
xt_unlock_mutex_ns(&tab->tab_rec_lock);
free_rec->rf_rec_type_1 = old_rec_type;
if (!xt_xlog_modify_table(tab->tab_id, status, op_seq, new_rec_type, prev_rec_id, rec_id, rec_size, ot->ot_row_rbuffer, ot->ot_thread))
return XT_ERR;
return OK;
}
static xtRowID tab_new_row(XTOpenTablePtr ot, XTTableHPtr tab)
{
xtRowID row_id;
xtOpSeqNo op_seq;
xtRowID next_row_id = 0;
u_int status;
xt_lock_mutex_ns(&tab->tab_row_lock);
if ((row_id = tab->tab_row_free_id)) {
status = XT_LOG_ENT_ROW_NEW_FL;
if (!tab->tab_rows.xt_tc_read_4(ot->ot_row_file, row_id, &next_row_id, ot->ot_thread)) {
xt_unlock_mutex_ns(&tab->tab_row_lock);
return 0;
}
tab->tab_row_free_id = next_row_id;
ASSERT_NS(tab->tab_row_fnum > 0);
tab->tab_row_fnum--;
}
else {
status = XT_LOG_ENT_ROW_NEW;
row_id = tab->tab_row_eof_id;
if (row_id == 0xFFFFFFFF) {
xt_unlock_mutex_ns(&tab->tab_row_lock);
xt_register_xterr(XT_REG_CONTEXT, XT_ERR_MAX_ROW_COUNT);
return 0;
}
if (((row_id - 1) % tab->tab_rows.tci_rows_per_page) == 0) {
/* By fetching the page now, we avoid reading it later... */
XTTabCachePagePtr page;
XTTabCacheSegPtr seg;
size_t poffset;
if (!tab->tab_rows.tc_fetch(ot->ot_row_file, row_id, &seg, &page, &poffset, FALSE, ot->ot_thread)) {
xt_unlock_mutex_ns(&tab->tab_row_lock);
return 0;
}
TAB_CAC_UNLOCK(&seg->tcs_lock, ot->ot_thread->t_id);
}
tab->tab_row_eof_id++;
}
op_seq = tab->tab_seq.ts_get_op_seq();
xt_unlock_mutex_ns(&tab->tab_row_lock);
if (!xt_xlog_modify_table(tab->tab_id, status, op_seq, 0, next_row_id, row_id, 0, NULL, ot->ot_thread))
return 0;
XT_DISABLED_TRACE(("new row tx=%d row=%d\n", (int) ot->ot_thread->st_xact_data->xd_start_xn_id, (int) row_id));
ASSERT_NS(row_id);
return row_id;
}
xtPublic xtBool xt_tab_get_row(register XTOpenTablePtr ot, xtRowID row_id, xtRecordID *var_rec_id)
{
register XTTableHPtr tab = ot->ot_table;
(void) ASSERT_NS(sizeof(XTTabRowRefDRec) == 4);
if (!tab->tab_rows.xt_tc_read_4(ot->ot_row_file, row_id, var_rec_id, ot->ot_thread))
return FAILED;
return OK;
}
xtPublic xtBool xt_tab_set_row(XTOpenTablePtr ot, u_int status, xtRowID row_id, xtRecordID var_rec_id)
{
register XTTableHPtr tab = ot->ot_table;
XTTabRowRefDRec row_buf;
xtOpSeqNo op_seq;
ASSERT_NS(var_rec_id < tab->tab_rec_eof_id);
XT_SET_DISK_4(row_buf.rr_ref_id_4, var_rec_id);
if (!tab->tab_rows.xt_tc_write(ot->ot_row_file, row_id, 0, sizeof(XTTabRowRefDRec), (xtWord1 *) &row_buf, &op_seq, TRUE, ot->ot_thread))
return FAILED;
return xt_xlog_modify_table(tab->tab_id, status, op_seq, 0, 0, row_id, sizeof(XTTabRowRefDRec), (xtWord1 *) &row_buf, ot->ot_thread);
}
static void tab_free_row_on_fail(XTOpenTablePtr ot, XTTableHPtr tab, xtRowID row_id)
{
XTExceptionRec e;
tab_save_exception(&e);
xt_tab_free_row(ot, tab, row_id);
tab_restore_exception(&e);
}
#ifdef CHECK_CLUSTER_EFFICIENCY
u_int next_on_page = 0;
u_int next_off_page = 0;
#endif
static xtBool tab_write_ext_record(XTOpenTablePtr XT_UNUSED(ot), XTTableHPtr tab, XTTabRecInfoPtr rec_info, xtRecordID rec_id, xtLogID log_id, xtLogOffset log_offset, XTThreadPtr thread)
{
xtWord1 tmp_buffer[offsetof(XTactExtRecEntryDRec, er_data)];
xtBool ok;
memcpy(tmp_buffer, rec_info->ri_log_buf, sizeof(tmp_buffer));
rec_info->ri_log_buf->er_status_1 = XT_LOG_ENT_EXT_REC_OK;
XT_SET_DISK_4(rec_info->ri_log_buf->er_data_size_4, rec_info->ri_log_data_size);
XT_SET_DISK_4(rec_info->ri_log_buf->er_tab_id_4, tab->tab_id);
XT_SET_DISK_4(rec_info->ri_log_buf->er_rec_id_4, rec_id);
if (tab->tab_dic.dic_tab_flags & XT_TF_MEMORY_TABLE)
ok = xt_tab_save_ext_record(tab, log_id, log_offset, offsetof(XTactExtRecEntryDRec, er_data) + rec_info->ri_log_data_size, (xtWord1 *) rec_info->ri_log_buf);
else
ok = thread->st_dlog_buf.dlb_append_log(log_id, log_offset, offsetof(XTactExtRecEntryDRec, er_data) + rec_info->ri_log_data_size, (xtWord1 *) rec_info->ri_log_buf, thread);
memcpy(rec_info->ri_log_buf, tmp_buffer, sizeof(tmp_buffer));
return ok;
}
static xtBool tab_add_record(XTOpenTablePtr ot, XTTabRecInfoPtr rec_info, u_int status)
{
register XTTableHPtr tab = ot->ot_table;
XTThreadPtr thread = ot->ot_thread;
xtRecordID rec_id;
xtLogID log_id;
xtLogOffset log_offset;
xtOpSeqNo op_seq;
xtRecordID next_rec_id = 0;
if (rec_info->ri_ext_rec) {
/* Determine where the overflow will go... */
if (tab->tab_dic.dic_tab_flags & XT_TF_MEMORY_TABLE) {
if (!xt_tab_get_ext_slot(tab, &log_id, &log_offset, rec_info->ri_log_data_size + offsetof(XTactExtRecEntryDRec, er_data)))
return FAILED;
}
else {
if (!thread->st_dlog_buf.dlb_get_log_offset(&log_id, &log_offset, rec_info->ri_log_data_size + offsetof(XTactExtRecEntryDRec, er_data), ot->ot_thread))
return FAILED;
}
XT_SET_LOG_REF(rec_info->ri_ext_rec, log_id, log_offset);
}
/* Write the record to disk: */
xt_lock_mutex_ns(&tab->tab_rec_lock);
if ((rec_id = tab->tab_rec_free_id)) {
ASSERT_NS(rec_id < tab->tab_rec_eof_id);
#ifdef XT_CLUSTER_FREE_RECORDS
XTTabCachePagePtr page;
size_t offset;
XTTabRecFreeDPtr free_block;
if (!tab->tab_recs.xt_tc_lock_page(ot->ot_rec_file, &page, rec_id, &offset, ot->ot_thread)) {
xt_unlock_mutex_ns(&tab->tab_rec_lock);
return FAILED;
}
/* Read the data from the old record: */
free_block = (XTTabRecFreeDPtr) (page->tcp_data + offset);
next_rec_id = XT_GET_DISK_4(free_block->rf_next_rec_id_4);
#ifdef CHECK_CLUSTER_EFFICIENCY
xtRecordID dbg_rec_id;
dbg_rec_id = next_rec_id-1;
if (page->tcp_page_idx == dbg_rec_id / tab->tab_recs.tci_rows_per_page)
next_on_page++;
else
next_off_page++;
if ((next_on_page % 1000) == 0)
printf("Next on: %d off: %d\n", next_on_page, next_off_page);
#endif
if (page->tcp_free_rec == offset) {
/* Adjust the free record: */
xtRecordID tmp_rec_id;
/* Check if the next record is on the same page: */
tmp_rec_id = next_rec_id-1;
if (page->tcp_page_idx == tmp_rec_id / tab->tab_recs.tci_rows_per_page)
/* This is the next free record on this page: */
page->tcp_free_rec = (xtWord2) ((tmp_rec_id % tab->tab_recs.tci_rows_per_page) * tab->tab_recs.tci_rec_size);
else
/* Not on the same page, so there are no more free records on this page: */
page->tcp_free_rec = 0xFFFF;
}
/* Write the new record: */
memcpy(free_block, rec_info->ri_fix_rec_buf, rec_info->ri_rec_buf_size);
tab->tab_recs.xt_tc_unlock_page(ot->ot_rec_file, page, &op_seq, ot->ot_thread);
#else
XTTabRecFreeDRec free_block;
if (!xt_tab_get_rec_data(ot, rec_id, sizeof(XTTabRecFreeDRec), (xtWord1 *) &free_block)) {
xt_unlock_mutex_ns(&tab->tab_rec_lock);
return FAILED;
}
next_rec_id = XT_GET_DISK_4(free_block.rf_next_rec_id_4);
if (!xt_tab_put_rec_data(ot, rec_id, rec_info->ri_rec_buf_size, (xtWord1 *) rec_info->ri_fix_rec_buf, &op_seq)) {
xt_unlock_mutex_ns(&tab->tab_rec_lock);
return FAILED;
}
#endif
tab->tab_rec_free_id = next_rec_id;
tab->tab_rec_fnum--;
/* XT_LOG_ENT_UPDATE --> XT_LOG_ENT_UPDATE_FL */
/* XT_LOG_ENT_INSERT --> XT_LOG_ENT_INSERT_FL */
/* XT_LOG_ENT_DELETE --> XT_LOG_ENT_DELETE_FL */
status += 2;
}
else {
xtBool read;
rec_id = tab->tab_rec_eof_id;
tab->tab_rec_eof_id++;
/* If we are writing to a new page (at the EOF)
* then we do not need to read the page from the
* file because it is new.
*
* Note that this only works because we are holding
* a lock on the record file.
*/
read = ((rec_id - 1) % tab->tab_recs.tci_rows_per_page) != 0;
if (!tab->tab_recs.xt_tc_write(ot->ot_rec_file, rec_id, 0, rec_info->ri_rec_buf_size, (xtWord1 *) rec_info->ri_fix_rec_buf, &op_seq, read, thread)) {
xt_unlock_mutex_ns(&tab->tab_rec_lock);
return FAILED;
}
}
xt_unlock_mutex_ns(&tab->tab_rec_lock);
if (!xt_xlog_modify_table(tab->tab_id, status, op_seq, 0, next_rec_id, rec_id, rec_info->ri_rec_buf_size, (xtWord1 *) rec_info->ri_fix_rec_buf, thread))
return FAILED;
if (rec_info->ri_ext_rec) {
/* Write the log buffer overflow: */
if (!tab_write_ext_record(ot, tab, rec_info, rec_id, log_id, log_offset, thread))
return FAILED;
}
XT_DISABLED_TRACE(("new rec tx=%d val=%d\n", (int) thread->st_xact_data->xd_start_xn_id, (int) rec_id));
rec_info->ri_rec_id = rec_id;
return OK;
}
static void tab_delete_record_on_fail(XTOpenTablePtr ot, xtRowID row_id, xtRecordID rec_id, XTTabRecHeadDPtr XT_UNUSED(row_ptr), xtWord1 *rec_data, u_int key_count)
{
XTExceptionRec e;
xtBool log_err = TRUE;
XTTabRecInfoRec rec_info;
tab_save_exception(&e);
if (e.e_xt_err == XT_ERR_DUPLICATE_KEY ||
e.e_xt_err == XT_ERR_DUPLICATE_FKEY) {
/* If the error does not cause rollback, then we will ignore the
* error if an error occurs in the UNDO!
*/
log_err = FALSE;
tab_restore_exception(&e);
}
if (key_count) {
XTIndexPtr *ind;
ind = ot->ot_table->tab_dic.dic_keys;
for (u_int i=0; i<key_count; i++, ind++) {
if (!xt_idx_delete(ot, *ind, rec_id, rec_data)) {
if (log_err)
xt_log_and_clear_exception_ns();
}
}
}
/* This is not required because the extended record will be free
* later when the record is freed!
if (row_ptr->tr_rec_type_1 == XT_TAB_STATUS_EXT_DLOG || row_ptr->tr_rec_type_1 == XT_TAB_STATUS_EXT_CLEAN)
tab_free_ext_record_on_fail(ot, rec_id, (XTTabRecExtDPtr) row_ptr, log_err);
*/
rec_info.ri_fix_rec_buf = (XTTabRecFixDPtr) ot->ot_row_wbuffer;
rec_info.ri_rec_buf_size = offsetof(XTTabRecFixDRec, rf_data);
rec_info.ri_ext_rec = NULL;
rec_info.ri_fix_rec_buf->tr_rec_type_1 = XT_TAB_STATUS_DELETE;
rec_info.ri_fix_rec_buf->tr_stat_id_1 = 0;
XT_SET_DISK_4(rec_info.ri_fix_rec_buf->tr_row_id_4, row_id);
XT_SET_DISK_4(rec_info.ri_fix_rec_buf->tr_prev_rec_id_4, rec_id);
XT_SET_DISK_4(rec_info.ri_fix_rec_buf->tr_xact_id_4, ot->ot_thread->st_xact_data->xd_start_xn_id);
if (!tab_add_record(ot, &rec_info, XT_LOG_ENT_DELETE))
goto failed;
if (!xt_tab_set_row(ot, XT_LOG_ENT_ROW_ADD_REC, row_id, rec_info.ri_rec_id))
goto failed;
if (log_err)
tab_restore_exception(&e);
return;
failed:
if (log_err)
xt_log_and_clear_exception_ns();
else
tab_restore_exception(&e);
}
/*
* Wait until all the variations between the start of the chain, and
* the given record have been rolled-back.
* If any is committed, register a locked error, and return FAILED.
*/
static xtBool tab_wait_for_rollback(XTOpenTablePtr ot, xtRowID row_id, xtRecordID commit_rec_id)
{
register XTTableHPtr tab = ot->ot_table;
xtRecordID var_rec_id;
XTTabRecHeadDRec var_head;
xtXactID xn_id;
xtRecordID invalid_rec = 0;
XTXactWaitRec xw;
retry:
if (!xt_tab_get_row(ot, row_id, &var_rec_id))
return FAILED;
while (var_rec_id != commit_rec_id) {
if (!var_rec_id)
goto locked;
if (!xt_tab_get_rec_data(ot, var_rec_id, sizeof(XTTabRecHeadDRec), (xtWord1 *) &var_head))
return FAILED;
if (XT_REC_IS_CLEAN(var_head.tr_rec_type_1))
goto locked;
if (XT_REC_IS_FREE(var_head.tr_rec_type_1)) {
/* Should not happen: */
if (!tab_record_corrupt(ot, row_id, var_rec_id, false, 4))
return FAILED;
goto record_invalid;
}
xn_id = XT_GET_DISK_4(var_head.tr_xact_id_4);
switch (xt_xn_status(ot, xn_id, var_rec_id)) {
case XT_XN_VISIBLE:
case XT_XN_NOT_VISIBLE:
goto locked;
case XT_XN_ABORTED:
/* Ingore the record, it will be removed. */
break;
case XT_XN_MY_UPDATE:
/* Should not happen: */
goto locked;
case XT_XN_OTHER_UPDATE:
/* Wait for the transaction to commit or rollback: */
XT_TAB_ROW_UNLOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], ot->ot_thread);
xw.xw_xn_id = xn_id;
if (!xt_xn_wait_for_xact(ot->ot_thread, &xw, NULL)) {
XT_TAB_ROW_WRITE_LOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], ot->ot_thread);
return FAILED;
}
XT_TAB_ROW_WRITE_LOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], ot->ot_thread);
goto retry;
case XT_XN_REREAD:
if (!tab_record_corrupt(ot, row_id, var_rec_id, true, 5))
return FAILED;
goto record_invalid;
}
var_rec_id = XT_GET_DISK_4(var_head.tr_prev_rec_id_4);
}
return OK;
locked:
xt_register_xterr(XT_REG_CONTEXT, XT_ERR_RECORD_CHANGED);
return FAILED;
record_invalid:
/* {RETRY-READ} */
/* Prevent an infinite loop due to a bad record: */
if (invalid_rec != var_rec_id) {
invalid_rec = var_rec_id;
goto retry;
}
/* The record is invalid, it will be "overwritten"... */
#ifdef XT_CRASH_DEBUG
/* Should not happen! */
xt_crash_me();
#endif
return OK;
}
/* Check if a record may be visible:
* Return TRUE of the record may be visible now.
* Return XT_MAYBE if the record may be visible in the future (set out_xn_id).
* Return FALSE of the record is not valid (freed or is a delete record).
* Return XT_ERR if an error occurred.
*/
xtPublic int xt_tab_maybe_committed(XTOpenTablePtr ot, xtRecordID rec_id, xtXactID *out_xn_id, xtRowID *out_rowid, xtBool *out_updated)
{
XTTabRecHeadDRec rec_head;
xtXactID rec_xn_id = 0;
xtBool wait = FALSE;
xtXactID wait_xn_id = 0;
xtRowID row_id = 0; // Initialized unnecessarily to satisfy (Drizzle) compile [-Wuninitialized]
xtRecordID var_rec_id;
xtXactID xn_id;
register XTTableHPtr tab = NULL; // Initialized unnecessarily to satisfy (Drizzle) compile [-Wuninitialized]
#ifdef TRACE_VARIATIONS_IN_DUP_CHECK
char t_buf[500];
int len;
char *t_type = "C";
#endif
xtRecordID invalid_rec = 0;
reread:
if (!xt_tab_get_rec_data(ot, rec_id, sizeof(XTTabRecHeadDRec), (xtWord1 *) &rec_head))
return XT_ERR;
if (XT_REC_NOT_VALID(rec_head.tr_rec_type_1))
return FALSE;
if (!XT_REC_IS_CLEAN(rec_head.tr_rec_type_1)) {
rec_xn_id = XT_GET_DISK_4(rec_head.tr_xact_id_4);
switch (xt_xn_status(ot, rec_xn_id, rec_id)) {
case XT_XN_VISIBLE:
#ifdef TRACE_VARIATIONS_IN_DUP_CHECK
t_type="V";
#endif
break;
case XT_XN_NOT_VISIBLE:
#ifdef TRACE_VARIATIONS_IN_DUP_CHECK
t_type="NV";
#endif
break;
case XT_XN_ABORTED:
return FALSE;
case XT_XN_MY_UPDATE:
#ifdef TRACE_VARIATIONS_IN_DUP_CHECK
t_type="My-Upd";
#endif
break;
case XT_XN_OTHER_UPDATE:
#ifdef TRACE_VARIATIONS_IN_DUP_CHECK
t_type="Wait";
#endif
wait = TRUE;
wait_xn_id = rec_xn_id;
break;
case XT_XN_REREAD:
#ifdef TRACE_VARIATIONS_IN_DUP_CHECK
t_type="Re-read";
#endif
/* {RETRY-READ} */
/* Avoid infinite loop: */
if (invalid_rec == rec_id) {
/* Should not happen! */
if (!tab_record_corrupt(ot, XT_GET_DISK_4(rec_head.tr_row_id_4), rec_id, true, 6))
goto failed;
#ifdef XT_CRASH_DEBUG
/* Generate a core dump! */
xt_crash_me();
#endif
return FALSE;
}
invalid_rec = rec_id;
goto reread;
}
}
/* Follow the variation chain until we come to this record.
* If it is not the first visible variation then
* it is not visible at all. If it in not found on the
* variation chain, it is also not visible.
*/
row_id = XT_GET_DISK_4(rec_head.tr_row_id_4);
tab = ot->ot_table;
XT_TAB_ROW_READ_LOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], ot->ot_thread);
invalid_rec = 0;
retry:
if (!(xt_tab_get_row(ot, row_id, &var_rec_id)))
goto failed;
#ifdef TRACE_VARIATIONS_IN_DUP_CHECK
len = sprintf(t_buf, "dup row=%d", (int) row_id);
#endif
while (var_rec_id != rec_id) {
if (!var_rec_id)
goto not_found;
#ifdef TRACE_VARIATIONS_IN_DUP_CHECK
if (len <= 450)
len += sprintf(t_buf+len, " -> %d", (int) var_rec_id);
#endif
if (!xt_tab_get_rec_data(ot, var_rec_id, sizeof(XTTabRecHeadDRec), (xtWord1 *) &rec_head))
goto failed;
/* All clean records are visible, by all transactions: */
if (XT_REC_IS_CLEAN(rec_head.tr_rec_type_1))
goto not_found;
if (XT_REC_IS_FREE(rec_head.tr_rec_type_1)) {
/* Should not happen: */
if (invalid_rec != var_rec_id) {
invalid_rec = var_rec_id;
goto retry;
}
/* Assume end of list. */
#ifdef XT_CRASH_DEBUG
/* Should not happen! */
xt_crash_me();
#endif
goto not_found;
}
xn_id = XT_GET_DISK_4(rec_head.tr_xact_id_4);
switch (xt_xn_status(ot, xn_id, var_rec_id)) {
case XT_XN_VISIBLE:
case XT_XN_NOT_VISIBLE:
goto not_found;
case XT_XN_ABORTED:
/* Ingore the record, it will be removed. */
#ifdef TRACE_VARIATIONS_IN_DUP_CHECK
if (len <= 450)
len += sprintf(t_buf+len, "(T%d-A)", (int) xn_id);
#endif
break;
case XT_XN_MY_UPDATE:
goto not_found;
case XT_XN_OTHER_UPDATE:
#ifdef TRACE_VARIATIONS_IN_DUP_CHECK
if (len <= 450)
len += sprintf(t_buf+len, "(T%d-wait)", (int) xn_id);
#endif
/* Wait for this update to commit or abort: */
if (!wait) {
wait = TRUE;
wait_xn_id = xn_id;
}
break;
case XT_XN_REREAD:
/* {RETRY-READ} */
if (invalid_rec != var_rec_id) {
invalid_rec = var_rec_id;
goto retry;
}
/* Assume end of list. */
if (!tab_record_corrupt(ot, row_id, invalid_rec, true, 7))
goto failed;
#ifdef XT_CRASH_DEBUG
/* Should not happen! */
xt_crash_me();
#endif
goto not_found;
}
var_rec_id = XT_GET_DISK_4(rec_head.tr_prev_rec_id_4);
}
#ifdef TRACE_VARIATIONS_IN_DUP_CHECK
if (len <= 450)
sprintf(t_buf+len, " -> %d(T%d-%s)\n", (int) var_rec_id, (int) rec_xn_id, t_type);
else
sprintf(t_buf+len, " ...(T%d-%s)\n", (int) rec_xn_id, t_type);
#endif
XT_TAB_ROW_UNLOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], ot->ot_thread);
if (wait) {
*out_xn_id = wait_xn_id;
return XT_MAYBE;
}
#ifdef TRACE_VARIATIONS_IN_DUP_CHECK
xt_ttracef(thread, "%s", t_buf);
#endif
if (out_rowid) {
*out_rowid = row_id;
*out_updated = (rec_xn_id == ot->ot_thread->st_xact_data->xd_start_xn_id);
}
return TRUE;
not_found:
XT_TAB_ROW_UNLOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], ot->ot_thread);
return FALSE;
failed:
XT_TAB_ROW_UNLOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], ot->ot_thread);
return XT_ERR;
}
xtPublic xtBool xt_tab_new_record(XTOpenTablePtr ot, xtWord1 *rec_buf)
{
register XTTableHPtr tab = ot->ot_table;
register XTThreadPtr self = ot->ot_thread;
XTTabRecInfoRec rec_info;
xtRowID row_id;
u_int idx_cnt = 0;
XTIndexPtr *ind;
/* A non-temporary table has been updated: */
if (!XT_IS_TEMP_TABLE(tab->tab_dic.dic_tab_flags))
self->st_non_temp_updated = TRUE;
if (!myxt_store_row(ot, &rec_info, (char *) rec_buf))
goto failed_0;
/* Get a new row ID: */
if (!(row_id = tab_new_row(ot, tab)))
goto failed_0;
rec_info.ri_fix_rec_buf->tr_stat_id_1 = ot->ot_update_id;
XT_SET_DISK_4(rec_info.ri_fix_rec_buf->tr_row_id_4, row_id);
XT_SET_DISK_4(rec_info.ri_fix_rec_buf->tr_prev_rec_id_4, 0);
XT_SET_DISK_4(rec_info.ri_fix_rec_buf->tr_xact_id_4, self->st_xact_data->xd_start_xn_id);
/* Note, it is important that this record is written BEFORE the row
* due to the problem distributed here [(5)]
*/
if (!tab_add_record(ot, &rec_info, XT_LOG_ENT_INSERT))
goto failed_1;
#ifdef TRACE_VARIATIONS
xt_ttracef(self, "insert: row=%d rec=%d T%d\n", (int) row_id, (int) rec_info.ri_rec_id, (int) self->st_xact_data->xd_start_xn_id);
#endif
if (!xt_tab_set_row(ot, XT_LOG_ENT_ROW_ADD_REC, row_id, rec_info.ri_rec_id))
goto failed_1;
XT_DISABLED_TRACE(("set new tx=%d row=%d rec=%d\n", (int) self->st_xact_data->xd_start_xn_id, (int) row_id, (int) rec_info.ri_rec_id));
/* Add the index references: */
for (idx_cnt=0, ind=tab->tab_dic.dic_keys; idx_cnt<tab->tab_dic.dic_key_count; idx_cnt++, ind++) {
if (!xt_idx_insert(ot, *ind, 0, rec_info.ri_rec_id, rec_buf, NULL, FALSE)) {
ot->ot_err_index_no = (*ind)->mi_index_no;
goto failed_2;
}
}
/* Do the foreign key stuff: */
if (ot->ot_table->tab_dic.dic_table->dt_fkeys.size() > 0) {
if (!ot->ot_table->tab_dic.dic_table->insertRow(ot, rec_buf))
goto failed_2;
}
self->st_statistics.st_row_insert++;
return OK;
failed_2:
/* Once the row has been inserted, it is to late to remove it!
* Now all we can do is delete it!
*/
tab_delete_record_on_fail(ot, row_id, rec_info.ri_rec_id, (XTTabRecHeadDPtr) rec_info.ri_fix_rec_buf, rec_buf, idx_cnt);
goto failed_0;
failed_1:
tab_free_row_on_fail(ot, tab, row_id);
failed_0:
return FAILED;
}
/* We cannot remove a change we have made to a row while a transaction
* is running, so we have to undo what we have done by
* overwriting the record we just created with
* the before image!
*/
static xtBool tab_overwrite_record_on_fail(XTOpenTablePtr ot, XTTabRecInfoPtr rec_info, xtWord1 *before_buf, xtWord1 *after_buf, u_int idx_cnt)
{
register XTTableHPtr tab = ot->ot_table;
XTTabRecHeadDRec prev_rec_head;
u_int i;
XTIndexPtr *ind;
XTThreadPtr thread = ot->ot_thread;
xtLogID log_id;
xtLogOffset log_offset;
xtRecordID rec_id = rec_info->ri_rec_id;
/* Remove the new extended record: */
if (rec_info->ri_ext_rec)
tab_free_ext_record_on_fail(ot, rec_id, (XTTabRecExtDPtr) rec_info->ri_fix_rec_buf, TRUE);
/* Undo index entries of the new record: */
if (after_buf) {
for (i=0, ind=tab->tab_dic.dic_keys; i<idx_cnt; i++, ind++) {
if (!xt_idx_delete(ot, *ind, rec_id, after_buf))
return FAILED;
}
}
memcpy(&prev_rec_head, rec_info->ri_fix_rec_buf, sizeof(XTTabRecHeadDRec));
if (!before_buf) {
/* Can happen if the delete was called from some cascaded action.
* And this is better than a crash...
*
* TODO: to make sure the change will not be applied in case the
* transaction will be commited, we'd need to add a log entry to
* restore the record like it's done for top-level operation. In
* order to do this we'd need to read the before-image of the
* record before modifying it.
*/
if (!thread->t_exception.e_xt_err)
xt_register_xterr(XT_REG_CONTEXT, XT_ERR_NO_BEFORE_IMAGE);
return FAILED;
}
/* Restore the previous record! */
if (!myxt_store_row(ot, rec_info, (char *) before_buf))
return FAILED;
memcpy(rec_info->ri_fix_rec_buf, &prev_rec_head, sizeof(XTTabRecHeadDRec));
if (rec_info->ri_ext_rec) {
/* Determine where the overflow will go... */
if (tab->tab_dic.dic_tab_flags & XT_TF_MEMORY_TABLE) {
if (!xt_tab_get_ext_slot(tab, &log_id, &log_offset, rec_info->ri_log_data_size + offsetof(XTactExtRecEntryDRec, er_data)))
return FAILED;
}
else {
if (!thread->st_dlog_buf.dlb_get_log_offset(&log_id, &log_offset, rec_info->ri_log_data_size + offsetof(XTactExtRecEntryDRec, er_data), thread))
return FAILED;
}
XT_SET_LOG_REF(rec_info->ri_ext_rec, log_id, log_offset);
}
if (!xt_tab_put_log_op_rec_data(ot, XT_LOG_ENT_REC_MODIFIED, 0, rec_id, rec_info->ri_rec_buf_size, (xtWord1 *) rec_info->ri_fix_rec_buf))
return FAILED;
if (rec_info->ri_ext_rec) {
/* Write the log buffer overflow: */
if (!tab_write_ext_record(ot, tab, rec_info, rec_id, log_id, log_offset, thread))
return FAILED;
}
/* Put the index entries back: */
for (idx_cnt=0, ind=tab->tab_dic.dic_keys; idx_cnt<tab->tab_dic.dic_key_count; idx_cnt++, ind++) {
if (!xt_idx_insert(ot, *ind, 0, rec_id, before_buf, after_buf, TRUE))
/* Incomplete restore, there will be a rollback... */
return FAILED;
}
return OK;
}
/*
* GOTCHA:
* If a transaction updates the same record over again, we should update
* in place. This prevents producing unnecessary variations!
*/
static xtBool tab_overwrite_record(XTOpenTablePtr ot, xtWord1 *before_buf, xtWord1 *after_buf)
{
register XTTableHPtr tab = ot->ot_table;
xtRowID row_id = ot->ot_curr_row_id;
register XTThreadPtr self = ot->ot_thread;
xtRecordID rec_id = ot->ot_curr_rec_id;
XTTabRecExtDRec prev_rec_head;
XTTabRecInfoRec rec_info;
u_int idx_cnt = 0, i;
XTIndexPtr *ind;
xtLogID log_id;
xtLogOffset log_offset;
xtBool prev_ext_rec;
/* A non-temporary table has been updated: */
if (!XT_IS_TEMP_TABLE(tab->tab_dic.dic_tab_flags))
self->st_non_temp_updated = TRUE;
if (!myxt_store_row(ot, &rec_info, (char *) after_buf))
goto failed_0;
/* Read before we overwrite! */
if (!xt_tab_get_rec_data(ot, rec_id, XT_REC_EXT_HEADER_SIZE, (xtWord1 *) &prev_rec_head))
goto failed_0;
prev_ext_rec = prev_rec_head.tr_rec_type_1 & XT_TAB_STATUS_EXT_DLOG;
if (rec_info.ri_ext_rec) {
/* Determine where the overflow will go... */
if (tab->tab_dic.dic_tab_flags & XT_TF_MEMORY_TABLE) {
if (!xt_tab_get_ext_slot(tab, &log_id, &log_offset, offsetof(XTactExtRecEntryDRec, er_data) + rec_info.ri_log_data_size))
goto failed_0;
}
else {
if (!self->st_dlog_buf.dlb_get_log_offset(&log_id, &log_offset, offsetof(XTactExtRecEntryDRec, er_data) + rec_info.ri_log_data_size, self))
goto failed_0;
}
XT_SET_LOG_REF(rec_info.ri_ext_rec, log_id, log_offset);
}
rec_info.ri_fix_rec_buf->tr_stat_id_1 = ot->ot_update_id;
XT_SET_DISK_4(rec_info.ri_fix_rec_buf->tr_row_id_4, row_id);
XT_COPY_DISK_4(rec_info.ri_fix_rec_buf->tr_prev_rec_id_4, prev_rec_head.tr_prev_rec_id_4);
XT_SET_DISK_4(rec_info.ri_fix_rec_buf->tr_xact_id_4, self->st_xact_data->xd_start_xn_id);
/* Remove the index references, that have changed: */
for (idx_cnt=0, ind=tab->tab_dic.dic_keys; idx_cnt<tab->tab_dic.dic_key_count; idx_cnt++, ind++) {
if (!xt_idx_delete(ot, *ind, rec_id, before_buf)) {
goto failed_0;
}
}
#ifdef TRACE_VARIATIONS
xt_ttracef(self, "overwrite: row=%d rec=%d T%d\n", (int) row_id, (int) rec_id, (int) self->st_xact_data->xd_start_xn_id);
#endif
/* Overwrite the record: */
if (!xt_tab_put_log_op_rec_data(ot, XT_LOG_ENT_REC_MODIFIED, 0, rec_id, rec_info.ri_rec_buf_size, (xtWord1 *) rec_info.ri_fix_rec_buf))
goto failed_0;
if (rec_info.ri_ext_rec) {
/* Write the log buffer overflow: */
if (!tab_write_ext_record(ot, tab, &rec_info, rec_id, log_id, log_offset, self))
goto failed_1;
}
/* Add the index references that have changed: */
for (idx_cnt=0, ind=tab->tab_dic.dic_keys; idx_cnt<tab->tab_dic.dic_key_count; idx_cnt++, ind++) {
if (!xt_idx_insert(ot, *ind, 0, rec_id, after_buf, before_buf, FALSE)) {
ot->ot_err_index_no = (*ind)->mi_index_no;
goto failed_2;
}
}
/* Do the foreign key stuff: */
if (ot->ot_table->tab_dic.dic_table->dt_trefs || ot->ot_table->tab_dic.dic_table->dt_fkeys.size() > 0) {
if (!ot->ot_table->tab_dic.dic_table->updateRow(ot, before_buf, after_buf))
goto failed_2;
}
/* Delete the previous overflow area: */
if (prev_ext_rec)
tab_free_ext_record_on_fail(ot, rec_id, &prev_rec_head, TRUE);
return OK;
failed_2:
/* Remove the new extended record: */
if (rec_info.ri_ext_rec)
tab_free_ext_record_on_fail(ot, rec_id, (XTTabRecExtDPtr) rec_info.ri_fix_rec_buf, TRUE);
/* Restore the previous record! */
/* Undo index entries: */
for (i=0, ind=tab->tab_dic.dic_keys; i<idx_cnt; i++, ind++) {
if (!xt_idx_delete(ot, *ind, rec_id, after_buf))
goto failed_1;
}
/* Restore the record: */
if (!myxt_store_row(ot, &rec_info, (char *) before_buf))
goto failed_1;
if (rec_info.ri_ext_rec)
memcpy(rec_info.ri_fix_rec_buf, &prev_rec_head, XT_REC_EXT_HEADER_SIZE);
else
memcpy(rec_info.ri_fix_rec_buf, &prev_rec_head, sizeof(XTTabRecHeadDRec));
if (!xt_tab_put_log_op_rec_data(ot, XT_LOG_ENT_REC_MODIFIED, 0, rec_id, rec_info.ri_rec_buf_size, (xtWord1 *) rec_info.ri_fix_rec_buf))
goto failed_1;
/* Put the index entries back: */
for (idx_cnt=0, ind=tab->tab_dic.dic_keys; idx_cnt<tab->tab_dic.dic_key_count; idx_cnt++, ind++) {
if (!xt_idx_insert(ot, *ind, 0, rec_id, before_buf, after_buf, TRUE))
/* Incomplete restore, there will be a rollback... */
goto failed_0;
}
/* The previous record has now been restored. */
goto failed_0;
failed_1:
/* The old record is overwritten, I must free the previous extended record: */
if (prev_ext_rec)
tab_free_ext_record_on_fail(ot, rec_id, &prev_rec_head, TRUE);
failed_0:
return FAILED;
}
xtPublic xtBool xt_tab_update_record(XTOpenTablePtr ot, xtWord1 *before_buf, xtWord1 *after_buf)
{
register XTTableHPtr tab;
xtRowID row_id;
register XTThreadPtr self;
xtRecordID curr_var_rec_id;
XTTabRecInfoRec rec_info;
u_int idx_cnt = 0;
XTIndexPtr *ind;
/*
* Originally only the flag ot->ot_curr_updated was checked, and if it was on, then
* tab_overwrite_record() was called, but this caused crashes in some cases like:
*
* set @@autocommit = 0;
* create table t1 (s1 int primary key);
* create table t2 (s1 int primary key, foreign key (s1) references t1 (s1) on update cascade);
* insert into t1 values (1);
* insert into t2 values (1);
* update t1 set s1 = 1;
*
* the last update lead to a crash on t2 cascade update because before_buf argument is NULL
* in the call below. It is NULL only during cascade update of child table. In that case we
* cannot pass before_buf value from XTDDTableRef::modifyRow as the before_buf is the original
* row for the parent (t1) table and it would be used to update any existing indexes
* in the child table which would be wrong of course.
*
* Alternative solution would be to copy the after_info in the XTDDTableRef::modifyRow():
*
* ...
* if (!xt_tab_load_record(ot, ot->ot_curr_rec_id, &after_info))
* goto failed_2;
* ...
*
* here the xt_tab_load_record() loads the original row, so we can copy it from there, but in
* that case we'd need to allocate a new (possibly up to 65536 bytes long) buffer, which makes
* the optimization questionable
*
*/
if (ot->ot_curr_updated && before_buf)
/* This record has already been updated by this transaction.
* Do the update in place!
*/
return tab_overwrite_record(ot, before_buf, after_buf);
tab = ot->ot_table;
row_id = ot->ot_curr_row_id;
self = ot->ot_thread;
/* A non-temporary table has been updated: */
if (!XT_IS_TEMP_TABLE(tab->tab_dic.dic_tab_flags))
self->st_non_temp_updated = TRUE;
if (!myxt_store_row(ot, &rec_info, (char *) after_buf))
goto failed_0;
rec_info.ri_fix_rec_buf->tr_stat_id_1 = ot->ot_update_id;
XT_SET_DISK_4(rec_info.ri_fix_rec_buf->tr_row_id_4, row_id);
XT_SET_DISK_4(rec_info.ri_fix_rec_buf->tr_prev_rec_id_4, ot->ot_curr_rec_id);
XT_SET_DISK_4(rec_info.ri_fix_rec_buf->tr_xact_id_4, self->st_xact_data->xd_start_xn_id);
/* Create the new record: */
if (!tab_add_record(ot, &rec_info, XT_LOG_ENT_UPDATE))
goto failed_0;
/* Link the new variation into the list: */
XT_TAB_ROW_WRITE_LOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], self);
if (!xt_tab_get_row(ot, row_id, &curr_var_rec_id))
goto failed_1;
if (curr_var_rec_id != ot->ot_curr_rec_id) {
/* If the transaction does not rollback, I will get an
* exception here:
*/
if (!tab_wait_for_rollback(ot, row_id, ot->ot_curr_rec_id))
goto failed_1;
/* [(4)] This is the situation when we overwrite the
* reference to curr_var_rec_id!
* When curr_var_rec_id is cleaned up by the sweeper, the
* sweeper will notice that the record is no longer in
* the row list.
*/
}
#ifdef TRACE_VARIATIONS
xt_ttracef(self, "update: row=%d rec=%d T%d\n", (int) row_id, (int) rec_info.ri_rec_id, (int) self->st_xact_data->xd_start_xn_id);
#endif
if (!xt_tab_set_row(ot, XT_LOG_ENT_ROW_ADD_REC, row_id, rec_info.ri_rec_id))
goto failed_1;
XT_DISABLED_TRACE(("set upd tx=%d row=%d rec=%d\n", (int) self->st_xact_data->xd_start_xn_id, (int) row_id, (int) rec_info.ri_rec_id));
XT_TAB_ROW_UNLOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], self);
/* Add the index references: */
for (idx_cnt=0, ind=tab->tab_dic.dic_keys; idx_cnt<tab->tab_dic.dic_key_count; idx_cnt++, ind++) {
if (!xt_idx_insert(ot, *ind, 0, rec_info.ri_rec_id, after_buf, before_buf, FALSE)) {
ot->ot_err_index_no = (*ind)->mi_index_no;
goto failed_2;
}
}
if (ot->ot_table->tab_dic.dic_table->dt_trefs || ot->ot_table->tab_dic.dic_table->dt_fkeys.size() > 0) {
if (!ot->ot_table->tab_dic.dic_table->updateRow(ot, before_buf, after_buf))
goto failed_2;
}
self->st_statistics.st_row_update++;
return OK;
failed_2:
tab_overwrite_record_on_fail(ot, &rec_info, before_buf, after_buf, idx_cnt);
goto failed_0;
failed_1:
XT_TAB_ROW_UNLOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], self);
failed_0:
return FAILED;
}
xtPublic xtBool xt_tab_delete_record(XTOpenTablePtr ot, xtWord1 *rec_buf)
{
register XTTableHPtr tab = ot->ot_table;
register XTThreadPtr thread = ot->ot_thread;
xtRowID row_id = ot->ot_curr_row_id;
xtRecordID curr_var_rec_id;
XTTabRecInfoRec rec_info;
/* A non-temporary table has been updated: */
if (!XT_IS_TEMP_TABLE(tab->tab_dic.dic_tab_flags))
thread->st_non_temp_updated = TRUE;
/* Setup a delete record: */
rec_info.ri_fix_rec_buf = (XTTabRecFixDPtr) ot->ot_row_wbuffer;
rec_info.ri_rec_buf_size = offsetof(XTTabRecFixDRec, rf_data);
rec_info.ri_ext_rec = NULL;
rec_info.ri_fix_rec_buf->tr_rec_type_1 = XT_TAB_STATUS_DELETE;
rec_info.ri_fix_rec_buf->tr_stat_id_1 = 0;
XT_SET_DISK_4(rec_info.ri_fix_rec_buf->tr_row_id_4, row_id);
XT_SET_DISK_4(rec_info.ri_fix_rec_buf->tr_prev_rec_id_4, ot->ot_curr_rec_id);
XT_SET_DISK_4(rec_info.ri_fix_rec_buf->tr_xact_id_4, thread->st_xact_data->xd_start_xn_id);
if (!tab_add_record(ot, &rec_info, XT_LOG_ENT_DELETE))
return FAILED;
XT_TAB_ROW_WRITE_LOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], thread);
if (!xt_tab_get_row(ot, row_id, &curr_var_rec_id))
goto failed_1;
if (curr_var_rec_id != ot->ot_curr_rec_id) {
if (!tab_wait_for_rollback(ot, row_id, ot->ot_curr_rec_id))
goto failed_1;
}
#ifdef TRACE_VARIATIONS
xt_ttracef(thread, "update: row=%d rec=%d T%d\n", (int) row_id, (int) rec_info.ri_rec_id, (int) thread->st_xact_data->xd_start_xn_id);
#endif
if (!xt_tab_set_row(ot, XT_LOG_ENT_ROW_ADD_REC, row_id, rec_info.ri_rec_id))
goto failed_1;
XT_DISABLED_TRACE(("del row tx=%d row=%d rec=%d\n", (int) thread->st_xact_data->xd_start_xn_id, (int) row_id, (int) rec_info.ri_rec_id));
XT_TAB_ROW_UNLOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], thread);
if (ot->ot_table->tab_dic.dic_table->dt_trefs) {
if (!ot->ot_table->tab_dic.dic_table->deleteRow(ot, rec_buf))
goto failed_2;
}
thread->st_statistics.st_row_delete++;
return OK;
failed_2:
tab_overwrite_record_on_fail(ot, &rec_info, rec_buf, NULL, 0);
return FAILED;
failed_1:
XT_TAB_ROW_UNLOCK(&tab->tab_row_rwlock[row_id % XT_ROW_RWLOCKS], thread);
return FAILED;
}
xtPublic xtBool xt_tab_restrict_rows(XTBasicListPtr list, XTThreadPtr thread)
{
u_int i;
XTRestrictItemPtr item;
XTOpenTablePtr pot = NULL;
XTDatabaseHPtr db = thread->st_database;
xtBool ok = TRUE;
for (i=0; i<list->bl_count; i++) {
item = (XTRestrictItemPtr) xt_bl_item_at(list, i);
if (item)
if (pot) {
if (pot->ot_table->tab_id == item->ri_tab_id)
goto check_action;
xt_db_return_table_to_pool_ns(pot);
pot = NULL;
}
if (!xt_db_open_pool_table_ns(&pot, db, item->ri_tab_id)) {
/* Should not happen, but just in case, we just don't
* remove the lock. We will probably end up with a deadlock
* somewhere.
*/
xt_log_and_clear_exception_ns();
goto skip_check_action;
}
if (!pot)
/* Can happen of the table has been dropped: */
goto skip_check_action;
check_action:
if (!pot->ot_table->tab_dic.dic_table->checkNoAction(pot, item->ri_rec_id)) {
ok = FALSE;
break;
}
skip_check_action:;
}
if (pot)
xt_db_return_table_to_pool_ns(pot);
xt_bl_free(NULL, list);
return ok;
}
xtPublic xtBool xt_tab_seq_init(XTOpenTablePtr ot)
{
register XTTableHPtr tab = ot->ot_table;
ASSERT_NS(!ot->ot_seq_page);
ot->ot_seq_page = NULL;
ot->ot_seq_data = NULL;
ot->ot_on_page = FALSE;
ot->ot_seq_offset = 0;
ot->ot_curr_rec_id = 0; // 0 is an invalid position!
ot->ot_curr_row_id = 0; // 0 is an invalid row ID!
ot->ot_curr_updated = FALSE;
/* We note the current EOF before we start a sequential scan.
* It is basically possible to update the same record more than
* once because an updated record creates a new record which
* has a new position which may be in the area that is
* still to be scanned.
*
* By noting the EOF before we start a sequential scan we
* reduce the possibility of this.
*
* However, the possibility still remains, but it should
* not be a problem because a record is not modified
* if there is nothing to change, which is the case
* if the record has already been changed!
*
* NOTE (2008-01-29) There is no longer a problem with updating a
* record twice because records are marked by an update.
*
* [(10)] I have changed this (see below). I now check the
* current EOF of the table.
*
* The reason is that committed read must be able to see the
* changes that occur during table table scan. *
*/
ot->ot_seq_eof_id = tab->tab_rec_eof_id;
if (!ot->ot_thread->st_xact_data) {
/* MySQL ignores this error, so we
* setup the sequential scan so that it will
* deliver nothing!
*/
ot->ot_seq_rec_id = ot->ot_seq_eof_id;
xt_register_xterr(XT_REG_CONTEXT, XT_ERR_NO_TRANSACTION);
return FAILED;
}
ot->ot_seq_rec_id = 1;
ot->ot_thread->st_statistics.st_scan_table++;
return OK;
}
xtPublic void xt_tab_seq_reset(XTOpenTablePtr ot)
{
ot->ot_seq_rec_id = 0;
ot->ot_seq_eof_id = 0;
ASSERT_NS(!ot->ot_seq_page);
ot->ot_seq_page = NULL;
ot->ot_seq_data = NULL;
ot->ot_on_page = FALSE;
ot->ot_seq_offset = 0;
}
xtPublic void xt_tab_seq_exit(XTOpenTablePtr ot)
{
register XTTableHPtr tab = ot->ot_table;
if (ot->ot_seq_page) {
tab->tab_recs.xt_tc_release_page(ot->ot_rec_file, ot->ot_seq_page, ot->ot_thread);
ot->ot_seq_page = NULL;
}
if (ot->ot_seq_data) {
XT_UNLOCK_MEMORY_PTR(ot->ot_rec_file, ot->ot_seq_data, ot->ot_thread);
ot->ot_seq_data = NULL;
}
ot->ot_on_page = FALSE;
}
#ifdef XT_USE_ROW_REC_MMAP_FILES
#define TAB_SEQ_LOAD_CACHE FALSE
#else
#ifdef XT_SEQ_SCAN_LOADS_CACHE
#define TAB_SEQ_LOAD_CACHE TRUE
#else
#define TAB_SEQ_LOAD_CACHE FALSE
#endif
#endif
xtPublic void xt_tab_seq_repeat(XTOpenTablePtr ot)
{
ot->ot_seq_rec_id--;
ot->ot_seq_offset -= ot->ot_table->tab_dic.dic_rec_size;
}
xtPublic xtBool xt_tab_seq_next(XTOpenTablePtr ot, xtWord1 *buffer, xtBool *eof)
{
register XTTableHPtr tab = ot->ot_table;
register size_t rec_size = tab->tab_dic.dic_rec_size;
xtWord1 *buff_ptr;
xtRecordID new_rec_id;
xtRecordID invalid_rec = 0;
next_page:
if (!ot->ot_on_page) {
ASSERT_NS(!ot->ot_seq_page);
if (!(ot->ot_on_page = tab->tab_recs.xt_tc_get_page(ot->ot_rec_file, ot->ot_seq_rec_id, TAB_SEQ_LOAD_CACHE, &ot->ot_seq_page, &ot->ot_seq_offset, ot->ot_thread)))
return FAILED;
if (!ot->ot_seq_page) {
XT_LOCK_MEMORY_PTR(ot->ot_seq_data, ot->ot_rec_file, xt_rec_id_to_rec_offset(tab, ot->ot_seq_rec_id), tab->tab_rows.tci_page_size, &ot->ot_thread->st_statistics.st_rec, ot->ot_thread);
if (!ot->ot_seq_data)
return FAILED;
ot->ot_on_page = TRUE;
ot->ot_seq_offset = 0;
}
}
next_record:
/* [(10)] The current EOF is used: */
if (ot->ot_seq_rec_id >= ot->ot_seq_eof_id) {
*eof = TRUE;
return OK;
}
if (ot->ot_seq_offset >= tab->tab_recs.tci_page_size) {
if (ot->ot_seq_page) {
tab->tab_recs.xt_tc_release_page(ot->ot_rec_file, ot->ot_seq_page, ot->ot_thread);
ot->ot_seq_page = NULL;
}
if (ot->ot_seq_data) {
/* NULL here means that in the case of non-memory mapped
* files we "keep" the lock.
*/
XT_UNLOCK_MEMORY_PTR(ot->ot_rec_file, ot->ot_seq_data, ot->ot_thread);
ot->ot_seq_data = NULL;
}
ot->ot_on_page = FALSE;
goto next_page;
}
if (ot->ot_seq_page)
buff_ptr = ot->ot_seq_page->tcp_data + ot->ot_seq_offset;
else
buff_ptr = ot->ot_seq_data + ot->ot_seq_offset;
/* This is the current record: */
ot->ot_curr_rec_id = ot->ot_seq_rec_id;
ot->ot_curr_row_id = 0;
/* Move to the next record: */
ot->ot_seq_rec_id++;
ot->ot_seq_offset += rec_size;
retry:
switch (tab_visible(ot, (XTTabRecHeadDPtr) buff_ptr, &new_rec_id)) {
case FALSE:
goto next_record;
case XT_ERR:
goto failed;
case XT_NEW:
buff_ptr = ot->ot_row_rbuffer;
if (!xt_tab_get_rec_data(ot, new_rec_id, rec_size, ot->ot_row_rbuffer))
return XT_ERR;
ot->ot_curr_rec_id = new_rec_id;
break;
case XT_RETRY:
goto retry;
case XT_REREAD:
if (invalid_rec != ot->ot_curr_rec_id) {
/* Don't re-read for the same record twice: */
invalid_rec = ot->ot_curr_rec_id;
/* Undo move to next: */
ot->ot_seq_rec_id--;
ot->ot_seq_offset -= rec_size;
/* Prepare to reread the page: */
if (ot->ot_seq_page) {
tab->tab_recs.xt_tc_release_page(ot->ot_rec_file, ot->ot_seq_page, ot->ot_thread);
ot->ot_seq_page = NULL;
}
ot->ot_on_page = FALSE;
goto next_page;
}
if (!tab_record_corrupt(ot, XT_GET_DISK_4(((XTTabRecHeadDPtr) buff_ptr)->tr_row_id_4), invalid_rec, true, 8))
return XT_ERR;
#ifdef XT_CRASH_DEBUG
/* Should not happen! */
xt_crash_me();
#endif
/* Continue, and skip the record... */
invalid_rec = 0;
goto next_record;
default:
break;
}
switch (*buff_ptr) {
case XT_TAB_STATUS_FIXED:
case XT_TAB_STATUS_FIX_CLEAN:
memcpy(buffer, buff_ptr + XT_REC_FIX_HEADER_SIZE, rec_size - XT_REC_FIX_HEADER_SIZE);
break;
case XT_TAB_STATUS_VARIABLE:
case XT_TAB_STATUS_VAR_CLEAN:
if (!myxt_load_row(ot, buff_ptr + XT_REC_FIX_HEADER_SIZE, buffer, ot->ot_cols_req))
goto failed_1;
break;
case XT_TAB_STATUS_EXT_DLOG:
case XT_TAB_STATUS_EXT_CLEAN: {
u_int cols_req = ot->ot_cols_req;
ASSERT_NS(cols_req);
if (cols_req && cols_req <= tab->tab_dic.dic_fix_col_count) {
if (!myxt_load_row(ot, buff_ptr + XT_REC_EXT_HEADER_SIZE, buffer, cols_req))
goto failed_1;
}
else {
if (buff_ptr != ot->ot_row_rbuffer)
memcpy(ot->ot_row_rbuffer, buff_ptr, rec_size);
if (!xt_tab_load_ext_data(ot, ot->ot_curr_rec_id, buffer, cols_req))
goto failed_1;
}
break;
}
}
*eof = FALSE;
return OK;
failed_1:
failed:
return FAILED;
}
/*
* -----------------------------------------------------------------------
* REPAIR TABLE
*/
#define REP_FIND 0
#define REP_ADD 1
#define REP_DEL 2
static xtBool tab_exec_repair_pending(XTDatabaseHPtr db, int what, char *table_name)
{
XTThreadPtr thread = xt_get_self();
char file_path[PATH_MAX];
XTOpenFilePtr of = NULL;
int len;
char *buffer = NULL, *ptr, *name;
char ch;
xtBool found = FALSE;
xt_strcpy(PATH_MAX, file_path, db->db_main_path);
xt_add_pbxt_file(PATH_MAX, file_path, "repair-pending");
if (what == REP_ADD) {
if (!xt_open_file_ns(&of, file_path, XT_FT_STANDARD, XT_FS_CREATE | XT_FS_MAKE_PATH, 0))
return FALSE;
}
else {
if (!xt_open_file_ns(&of, file_path, XT_FT_STANDARD, XT_FS_DEFAULT | XT_FS_MISSING_OK, 0))
return FALSE;
}
if (!of)
return FALSE;
len = (int) xt_seek_eof_file(NULL, of);
if (!(buffer = (char *) xt_malloc_ns(len + 1)))
goto failed;
if (!xt_pread_file(of, 0, len, len, buffer, NULL, &thread->st_statistics.st_x, thread))
goto failed;
buffer[len] = 0;
ptr = buffer;
for(;;) {
name = ptr;
while (*ptr && *ptr != '\n' && *ptr != '\r')
ptr++;
if (ptr > name) {
ch = *ptr;
*ptr = 0;
if (xt_tab_compare_names(name, table_name) == 0) {
*ptr = ch;
found = TRUE;
break;
}
*ptr = ch;
}
if (!*ptr)
break;
ptr++;
}
switch (what) {
case REP_ADD:
if (!found) {
/* Remove any trailing empty lines: */
while (len > 0) {
if (buffer[len-1] != '\n' && buffer[len-1] != '\r')
break;
len--;
}
if (len > 0) {
if (!xt_pwrite_file(of, len, 1, (void *) "\n", &thread->st_statistics.st_x, thread))
goto failed;
len++;
}
if (!xt_pwrite_file(of, len, strlen(table_name), table_name, &thread->st_statistics.st_x, thread))
goto failed;
len += strlen(table_name);
if (!xt_set_eof_file(NULL, of, len))
goto failed;
}
break;
case REP_DEL:
if (found) {
if (*ptr != '\0')
ptr++;
memmove(name, ptr, len - (ptr - buffer));
len = len - (ptr - name);
/* Remove trailing empty lines: */
while (len > 0) {
if (buffer[len-1] != '\n' && buffer[len-1] != '\r')
break;
len--;
}
if (len > 0) {
if (!xt_pwrite_file(of, 0, len, buffer, &thread->st_statistics.st_x, thread))
goto failed;
if (!xt_set_eof_file(NULL, of, len))
goto failed;
}
}
break;
}
xt_close_file_ns(of);
xt_free_ns(buffer);
if (len == 0)
xt_fs_delete(NULL, file_path);
return found;
failed:
if (of)
xt_close_file_ns(of);
if (buffer)
xt_free_ns(buffer);
xt_log_and_clear_exception(thread);
return FALSE;
}
xtPublic void xt_tab_make_table_name(XTPathStrPtr tab_path, char *table_name, size_t size)
{
char *nptr;
nptr = xt_last_name_of_path(tab_path->ps_path);
if (xt_starts_with(nptr, "#sql")) {
/* {INVALID-OLD-TABLE-FIX}
* Temporary files can have strange paths, for example
* ..../var/tmp/mysqld.1/#sqldaec_1_6
* This occurs, for example, occurs when the temp_table.test is
* run using the PBXT suite in MariaDB:
* ./mtr --suite=pbxt --do-test=temp_table
*
* Calling myxt_static_convert_file_name, with a '.', in the name
* causes the error:
* [ERROR] Invalid (old?) table or database name 'mysqld.1'
* To prevent this, we do not convert the temporary
* table names using the mysql functions.
*
* Note, this bug was found by Monty, and fixed by modifying
* xt_2nd_last_name_of_path(), see {INVALID-OLD-TABLE-FIX}.
*
*/
xt_2nd_last_name_of_path(size, table_name, tab_path->ps_path);
xt_strcat(size, table_name, ".");
xt_strcat(size, table_name, nptr);
}
else {
char name_buf[XT_TABLE_NAME_SIZE*3+3];
char *part_ptr;
size_t len;
xt_2nd_last_name_of_path(sizeof(name_buf), name_buf, tab_path->ps_path);
myxt_static_convert_file_name(name_buf, table_name, size);
xt_strcat(size, table_name, ".");
/* Handle partition extensions to table names: */
if ((part_ptr = strstr(nptr, "#P#")))
xt_strncpy(sizeof(name_buf), name_buf, nptr, part_ptr - nptr);
else
xt_strcpy(sizeof(name_buf), name_buf, nptr);
len = strlen(table_name);
myxt_static_convert_file_name(name_buf, table_name + len, size - len);
if (part_ptr) {
/* Add the partition extension (which is relevant to the engine). */
char *sub_part_ptr;
part_ptr += 3;
if ((sub_part_ptr = strstr(part_ptr, "#SP#")))
xt_strncpy(sizeof(name_buf), name_buf, part_ptr, sub_part_ptr - part_ptr);
else
xt_strcpy(sizeof(name_buf), name_buf, part_ptr);
xt_strcat(size, table_name, " (");
len = strlen(table_name);
myxt_static_convert_file_name(name_buf, table_name + len, size - len);
if (sub_part_ptr) {
sub_part_ptr += 4;
xt_strcat(size, table_name, " - ");
len = strlen(table_name);
myxt_static_convert_file_name(sub_part_ptr, table_name + len, size - len);
}
xt_strcat(size, table_name, ")");
}
}
}
xtPublic xtBool xt_tab_is_table_repair_pending(XTTableHPtr tab)
{
char table_name[XT_TABLE_NAME_BUF_SIZE];
xt_tab_make_table_name(tab->tab_name, table_name, sizeof(table_name));
return tab_exec_repair_pending(tab->tab_db, REP_FIND, table_name);
}
xtPublic void xt_tab_table_repaired(XTTableHPtr tab)
{
if (tab->tab_repair_pending) {
char table_name[XT_TABLE_NAME_BUF_SIZE];
tab->tab_repair_pending = FALSE;
xt_tab_make_table_name(tab->tab_name, table_name, sizeof(table_name));
tab_exec_repair_pending(tab->tab_db, REP_DEL, table_name);
}
}
xtPublic void xt_tab_set_table_repair_pending(XTTableHPtr tab)
{
if (!tab->tab_repair_pending) {
char table_name[XT_TABLE_NAME_BUF_SIZE];
tab->tab_repair_pending = TRUE;
xt_tab_make_table_name(tab->tab_name, table_name, sizeof(table_name));
tab_exec_repair_pending(tab->tab_db, REP_ADD, table_name);
}
}
/*
* -----------------------------------------------------------------------
* EXTENDED DATA FOR RAM TABLES
*/
xtPublic xtBool xt_tab_get_ext_slot(XTTableHPtr tab, xtLogID *log_id, xtLogOffset *log_offset, size_t XT_UNUSED(req_size))
{
size_t new_slot;
xt_spinlock_lock(&tab->tab_mem_lock);
if (tab->tab_mem_ind_free) {
new_slot = tab->tab_mem_ind_free - 1;
tab->tab_mem_ind_free = (size_t) tab->tab_mem_index[new_slot];
}
else {
if (tab->tab_mem_ind_usage == tab->tab_mem_ind_size) {
/* Grow the index: */
if (!xt_realloc_ns((void **) &tab->tab_mem_index, (tab->tab_mem_ind_size + 100) * sizeof(xtWord1 *)))
return FAILED;
tab->tab_mem_ind_size += 100;
}
new_slot = tab->tab_mem_ind_usage;
tab->tab_mem_ind_usage++;
}
xt_spinlock_unlock(&tab->tab_mem_lock);
tab->tab_mem_index[new_slot] = NULL;
*log_id = 1;
*log_offset = new_slot + 1;
return OK;
}
xtPublic xtBool xt_tab_save_ext_record(XTTableHPtr tab, xtLogID XT_UNUSED(log_id), xtLogOffset log_offset, size_t size, xtWord1 *data)
{
size_t slot = ((size_t) log_offset) - 1;
xtWord1 *rec_data;
if (!(rec_data = (xtWord1 *) xt_malloc_ns(size)))
return FAILED;
memcpy(rec_data, data, size);
xt_spinlock_lock(&tab->tab_mem_lock);
tab->tab_mem_total += size;
tab->tab_mem_index[slot] = rec_data;
xt_spinlock_unlock(&tab->tab_mem_lock);
return OK;
}
xtPublic void xt_tab_read_ext_record(XTTableHPtr tab, xtLogID XT_UNUSED(log_id), xtLogOffset log_offset, size_t size, xtWord1 *data)
{
size_t slot = ((size_t) log_offset) - 1;
if (slot < tab->tab_mem_ind_usage && tab->tab_mem_index[slot])
memcpy(data, tab->tab_mem_index[slot], size);
else
memset(data, 0, size);
}
xtPublic void xt_tab_free_ext_slot(XTTableHPtr tab, xtLogID XT_UNUSED(log_id), xtLogOffset log_offset, size_t size)
{
size_t slot = ((size_t) log_offset) - 1;
xt_spinlock_lock(&tab->tab_mem_lock);
if (tab->tab_mem_index[slot]) {
xt_free_ns(tab->tab_mem_index[slot]);
tab->tab_mem_total -= size;
}
tab->tab_mem_index[slot] = (xtWord1 *) tab->tab_mem_ind_free;
tab->tab_mem_ind_free = slot + 1;
xt_spinlock_unlock(&tab->tab_mem_lock);
}
static void tab_free_ext_records(XTTableHPtr tab)
{
size_t i, next;
if (!tab->tab_mem_index)
return;
i = tab->tab_mem_ind_free;
while (i) {
next = (size_t) tab->tab_mem_index[i-1];
tab->tab_mem_index[i-1] = NULL;
i = next;
}
for (i=0; i<tab->tab_mem_ind_usage; i++) {
if (tab->tab_mem_index[i])
xt_free_ns(tab->tab_mem_index[i]);
}
xt_free_ns(tab->tab_mem_index);
}
|