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
|
/*
Copyright (c) 2005 Health Market Science, Inc.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
package com.healthmarketscience.jackcess.impl;
import java.io.IOException;
import java.nio.ByteBuffer;
import java.nio.ByteOrder;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Map;
import com.healthmarketscience.jackcess.ConstraintViolationException;
import com.healthmarketscience.jackcess.Index;
import com.healthmarketscience.jackcess.IndexBuilder;
import com.healthmarketscience.jackcess.RuntimeIOException;
import static com.healthmarketscience.jackcess.impl.ByteUtil.ByteStream;
import static com.healthmarketscience.jackcess.impl.IndexCodes.*;
import org.apache.commons.lang.builder.ToStringBuilder;
import org.apache.commons.logging.Log;
import org.apache.commons.logging.LogFactory;
/**
* Access table index data. This is the actual data which backs a logical
* Index, where one or more logical indexes can be backed by the same index
* data.
*
* @author Tim McCune
*/
public class IndexData {
protected static final Log LOG = LogFactory.getLog(Index.class);
/** special entry which is less than any other entry */
public static final Entry FIRST_ENTRY =
createSpecialEntry(RowIdImpl.FIRST_ROW_ID);
/** special entry which is greater than any other entry */
public static final Entry LAST_ENTRY =
createSpecialEntry(RowIdImpl.LAST_ROW_ID);
/** special object which will always be greater than any other value, when
searching for an index entry range in a multi-value index */
public static final Object MAX_VALUE = new Object();
/** special object which will always be greater than any other value, when
searching for an index entry range in a multi-value index */
public static final Object MIN_VALUE = new Object();
private static final DataPage NEW_ROOT_DATA_PAGE = new RootDataPage();
protected static final int INVALID_INDEX_PAGE_NUMBER = 0;
/** Max number of columns in an index */
public static final int MAX_COLUMNS = 10;
protected static final byte[] EMPTY_PREFIX = new byte[0];
static final short COLUMN_UNUSED = -1;
public static final byte ASCENDING_COLUMN_FLAG = (byte)0x01;
public static final byte UNIQUE_INDEX_FLAG = (byte)0x01;
public static final byte IGNORE_NULLS_INDEX_FLAG = (byte)0x02;
public static final byte REQUIRED_INDEX_FLAG = (byte)0x08;
public static final byte UNKNOWN_INDEX_FLAG = (byte)0x80; // always seems to be set on indexes in access 2000+
private static final int MAGIC_INDEX_NUMBER = 1923;
private static final ByteOrder ENTRY_BYTE_ORDER = ByteOrder.BIG_ENDIAN;
/** type attributes for Entries which simplify comparisons */
public enum EntryType {
/** comparable type indicating this Entry should always compare less than
valid RowIds */
ALWAYS_FIRST,
/** comparable type indicating this Entry should always compare less than
other valid entries with equal entryBytes */
FIRST_VALID,
/** comparable type indicating this RowId should always compare
normally */
NORMAL,
/** comparable type indicating this Entry should always compare greater
than other valid entries with equal entryBytes */
LAST_VALID,
/** comparable type indicating this Entry should always compare greater
than valid RowIds */
ALWAYS_LAST;
}
public static final Comparator<byte[]> BYTE_CODE_COMPARATOR =
new Comparator<byte[]>() {
public int compare(byte[] left, byte[] right) {
if(left == right) {
return 0;
}
if(left == null) {
return -1;
}
if(right == null) {
return 1;
}
int len = Math.min(left.length, right.length);
int pos = 0;
while((pos < len) && (left[pos] == right[pos])) {
++pos;
}
if(pos < len) {
return ((ByteUtil.asUnsignedByte(left[pos]) <
ByteUtil.asUnsignedByte(right[pos])) ? -1 : 1);
}
return ((left.length < right.length) ? -1 :
((left.length > right.length) ? 1 : 0));
}
};
/** name, generated on demand */
private String _name;
/** owning table */
private final TableImpl _table;
/** 0-based index data number */
private final int _number;
/** Page number of the root index data */
private int _rootPageNumber;
/** offset within the tableDefinition buffer of the uniqueEntryCount for
this index */
private final int _uniqueEntryCountOffset;
/** The number of unique entries which have been added to this index. note,
however, that it is never decremented, only incremented (as observed in
Access). */
private int _uniqueEntryCount;
/** List of columns and flags */
private final List<ColumnDescriptor> _columns =
new ArrayList<ColumnDescriptor>();
/** the logical indexes which this index data backs */
private final List<Index> _indexes = new ArrayList<Index>();
/** flags for this index */
private byte _indexFlags;
/** Usage map of pages that this index owns */
private UsageMap _ownedPages;
/** <code>true</code> if the index entries have been initialized,
<code>false</code> otherwise */
private boolean _initialized;
/** modification count for the table, keeps cursors up-to-date */
private int _modCount;
/** temp buffer used to read/write the index pages */
private final TempBufferHolder _indexBufferH =
TempBufferHolder.newHolder(TempBufferHolder.Type.SOFT, true);
/** temp buffer used to create index entries */
private ByteStream _entryBuffer;
/** max size for all the entries written to a given index data page */
private final int _maxPageEntrySize;
/** whether or not this index data is backing a primary key logical index */
private boolean _primaryKey;
/** if non-null, the reason why we cannot create entries for this index */
private String _unsupportedReason;
/** Cache which manages the index pages */
private final IndexPageCache _pageCache;
protected IndexData(TableImpl table, int number, int uniqueEntryCount,
int uniqueEntryCountOffset)
{
_table = table;
_number = number;
_uniqueEntryCount = uniqueEntryCount;
_uniqueEntryCountOffset = uniqueEntryCountOffset;
_maxPageEntrySize = calcMaxPageEntrySize(_table.getFormat());
_pageCache = new IndexPageCache(this);
}
/**
* Creates an IndexData appropriate for the given table, using information
* from the given table definition buffer.
*/
public static IndexData create(TableImpl table, ByteBuffer tableBuffer,
int number, JetFormat format)
throws IOException
{
int uniqueEntryCountOffset =
(format.OFFSET_INDEX_DEF_BLOCK +
(number * format.SIZE_INDEX_DEFINITION) + 4);
int uniqueEntryCount = tableBuffer.getInt(uniqueEntryCountOffset);
return new IndexData(table, number, uniqueEntryCount, uniqueEntryCountOffset);
}
public String getName() {
if(_name == null) {
if(_indexes.size() == 1) {
_name = _indexes.get(0).getName();
} else if(!_indexes.isEmpty()) {
List<String> names = new ArrayList<String>(_indexes.size());
for(Index idx : _indexes) {
names.add(idx.getName());
}
_name = names.toString();
} else {
_name = String.valueOf(_number);
}
}
return _name;
}
public TableImpl getTable() {
return _table;
}
public JetFormat getFormat() {
return getTable().getFormat();
}
public PageChannel getPageChannel() {
return getTable().getPageChannel();
}
/**
* @return the "main" logical index which is backed by this data.
*/
public Index getPrimaryIndex() {
return _indexes.get(0);
}
/**
* @return All of the Indexes backed by this data (unmodifiable List)
*/
public List<Index> getIndexes() {
return Collections.unmodifiableList(_indexes);
}
/**
* Adds a logical index which this data is backing.
*/
void addIndex(Index index) {
// we keep foreign key indexes at the back of the list. this way the
// primary index will be a non-foreign key index (if any)
if(index.isForeignKey()) {
_indexes.add(index);
} else {
int pos = _indexes.size();
while(pos > 0) {
if(!_indexes.get(pos - 1).isForeignKey()) {
break;
}
--pos;
}
_indexes.add(pos, index);
// also, keep track of whether or not this is a primary key index
_primaryKey |= index.isPrimaryKey();
}
// force name to be regenerated
_name = null;
}
public byte getIndexFlags() {
return _indexFlags;
}
public int getIndexDataNumber() {
return _number;
}
public int getUniqueEntryCount() {
return _uniqueEntryCount;
}
public int getUniqueEntryCountOffset() {
return _uniqueEntryCountOffset;
}
protected boolean isBackingPrimaryKey() {
return _primaryKey;
}
/**
* Whether or not {@code null} values are actually recorded in the index.
*/
public boolean shouldIgnoreNulls() {
return((_indexFlags & IGNORE_NULLS_INDEX_FLAG) != 0);
}
/**
* Whether or not index entries must be unique.
* <p>
* Some notes about uniqueness:
* <ul>
* <li>Access does not seem to consider multiple {@code null} entries
* invalid for a unique index</li>
* <li>text indexes collapse case, and Access seems to compare <b>only</b>
* the index entry bytes, therefore two strings which differ only in
* case <i>will violate</i> the unique constraint</li>
* </ul>
*/
public boolean isUnique() {
return(isBackingPrimaryKey() || ((_indexFlags & UNIQUE_INDEX_FLAG) != 0));
}
/**
* Whether or not values are required in the columns.
*/
public boolean isRequired() {
return((_indexFlags & REQUIRED_INDEX_FLAG) != 0);
}
/**
* Returns the Columns for this index (unmodifiable)
*/
public List<ColumnDescriptor> getColumns() {
return Collections.unmodifiableList(_columns);
}
/**
* Whether or not the complete index state has been read.
*/
public boolean isInitialized() {
return _initialized;
}
protected int getRootPageNumber() {
return _rootPageNumber;
}
private void setUnsupportedReason(String reason, ColumnImpl col) {
_unsupportedReason = withErrorContext(reason);
if(!col.getTable().isSystem()) {
LOG.warn(_unsupportedReason + ", making read-only");
} else {
if(LOG.isDebugEnabled()) {
LOG.debug(_unsupportedReason + ", making read-only");
}
}
}
String getUnsupportedReason() {
return _unsupportedReason;
}
protected int getMaxPageEntrySize() {
return _maxPageEntrySize;
}
/**
* Returns the number of database pages owned by this index data.
* @usage _intermediate_method_
*/
public int getOwnedPageCount() {
return _ownedPages.getPageCount();
}
void addOwnedPage(int pageNumber) throws IOException {
_ownedPages.addPageNumber(pageNumber);
}
void collectUsageMapPages(Collection<Integer> pages) {
pages.add(_ownedPages.getTablePageNumber());
}
/**
* Used by unit tests to validate the internal status of the index.
* @usage _advanced_method_
*/
public void validate() throws IOException {
_pageCache.validate();
}
/**
* Returns the number of index entries in the index. Only called by unit
* tests.
* <p>
* Forces index initialization.
* @usage _advanced_method_
*/
public int getEntryCount()
throws IOException
{
initialize();
EntryCursor cursor = cursor();
Entry endEntry = cursor.getLastEntry();
int count = 0;
while(!endEntry.equals(cursor.getNextEntry())) {
++count;
}
return count;
}
/**
* Forces initialization of this index (actual parsing of index pages).
* normally, the index will not be initialized until the entries are
* actually needed.
*/
public void initialize() throws IOException {
if(!_initialized) {
_pageCache.setRootPageNumber(getRootPageNumber());
_initialized = true;
}
}
/**
* Writes the current index state to the database.
* <p>
* Forces index initialization.
*/
public void update() throws IOException
{
// make sure we've parsed the entries
initialize();
if(_unsupportedReason != null) {
throw new UnsupportedOperationException(
"Cannot write indexes of this type due to " + _unsupportedReason);
}
_pageCache.write();
}
/**
* Read the rest of the index info from a tableBuffer
* @param tableBuffer table definition buffer to read from initial info
* @param availableColumns Columns that this index may use
*/
public void read(ByteBuffer tableBuffer, List<ColumnImpl> availableColumns)
throws IOException
{
ByteUtil.forward(tableBuffer, getFormat().SKIP_BEFORE_INDEX); //Forward past Unknown
for (int i = 0; i < MAX_COLUMNS; i++) {
short columnNumber = tableBuffer.getShort();
byte colFlags = tableBuffer.get();
if (columnNumber != COLUMN_UNUSED) {
// find the desired column by column number (which is not necessarily
// the same as the column index)
ColumnImpl idxCol = null;
for(ColumnImpl col : availableColumns) {
if(col.getColumnNumber() == columnNumber) {
idxCol = col;
break;
}
}
if(idxCol == null) {
throw new IOException(withErrorContext(
"Could not find column with number "
+ columnNumber + " for index"));
}
_columns.add(newColumnDescriptor(idxCol, colFlags));
}
}
_ownedPages = UsageMap.read(getTable().getDatabase(), tableBuffer, false);
_rootPageNumber = tableBuffer.getInt();
ByteUtil.forward(tableBuffer, getFormat().SKIP_BEFORE_INDEX_FLAGS); //Forward past Unknown
_indexFlags = tableBuffer.get();
ByteUtil.forward(tableBuffer, getFormat().SKIP_AFTER_INDEX_FLAGS); //Forward past other stuff
}
/**
* Writes the index row count definitions into a table definition buffer.
* @param creator description of the indexes to write
* @param buffer Buffer to write to
*/
protected static void writeRowCountDefinitions(
TableCreator creator, ByteBuffer buffer)
{
writeRowCountDefinitions(creator, buffer, creator.getIndexCount());
}
/**
* Writes the index row count definitions into a table definition buffer.
* @param creator description of the indexes to write
* @param buffer Buffer to write to
* @param idxCount num indexes to write
*/
protected static void writeRowCountDefinitions(
DBMutator creator, ByteBuffer buffer, int idxCount)
{
// index row counts (empty data)
ByteUtil.forward(buffer, (idxCount *
creator.getFormat().SIZE_INDEX_DEFINITION));
}
/**
* Writes the index definitions into a table definition buffer.
* @param creator description of the indexes to write
* @param buffer Buffer to write to
*/
protected static void writeDefinitions(
TableCreator creator, ByteBuffer buffer)
throws IOException
{
ByteBuffer rootPageBuffer = createRootPageBuffer(creator);
for(DBMutator.IndexDataState idxDataState : creator.getIndexDataStates()) {
writeDefinition(creator, buffer, idxDataState, rootPageBuffer);
}
}
/**
* Writes the index definitions into a table definition buffer.
* @param creator description of the indexes to write
* @param buffer Buffer to write to
*/
protected static void writeDefinition(
DBMutator creator, ByteBuffer buffer,
DBMutator.IndexDataState idxDataState, ByteBuffer rootPageBuffer)
throws IOException
{
if(rootPageBuffer == null) {
rootPageBuffer = createRootPageBuffer(creator);
}
buffer.putInt(MAGIC_INDEX_NUMBER); // seemingly constant magic value
// write column information (always MAX_COLUMNS entries)
IndexBuilder idx = idxDataState.getFirstIndex();
List<IndexBuilder.Column> idxColumns = idx.getColumns();
for(int i = 0; i < MAX_COLUMNS; ++i) {
short columnNumber = COLUMN_UNUSED;
byte flags = 0;
if(i < idxColumns.size()) {
// determine column info
IndexBuilder.Column idxCol = idxColumns.get(i);
flags = idxCol.getFlags();
// find actual table column number
columnNumber = creator.getColumnNumber(idxCol.getName());
if(columnNumber == COLUMN_UNUSED) {
// should never happen as this is validated before
// FIXME
// throw new IllegalArgumentException(
// withErrorContext(
// "Column with name " + idxCol.getName() + " not found",
// creator.getDatabase(), creator.getName(), idx.getName()));
}
}
buffer.putShort(columnNumber); // table column number
buffer.put(flags); // column flags (e.g. ordering)
}
buffer.put(idxDataState.getUmapRowNumber()); // umap row
ByteUtil.put3ByteInt(buffer, idxDataState.getUmapPageNumber()); // umap page
// write empty root index page
creator.getPageChannel().writePage(rootPageBuffer,
idxDataState.getRootPageNumber());
buffer.putInt(idxDataState.getRootPageNumber());
buffer.putInt(0); // unknown
buffer.put(idx.getFlags()); // index flags (unique, etc.)
ByteUtil.forward(buffer, 5); // unknown
}
private static ByteBuffer createRootPageBuffer(DBMutator creator)
throws IOException
{
ByteBuffer rootPageBuffer = creator.getPageChannel().createPageBuffer();
writeDataPage(rootPageBuffer, NEW_ROOT_DATA_PAGE,
creator.getTdefPageNumber(), creator.getFormat());
return rootPageBuffer;
}
/**
* Prepares to add a row to this index. All constraints are checked before
* this method returns.
* <p>
* Forces index initialization.
*
* @param row Row to add
* @param rowId rowId of the row to be added
*
* @return a PendingChange which can complete the addition or roll it back
*/
public PendingChange prepareAddRow(Object[] row, RowIdImpl rowId,
PendingChange nextChange)
throws IOException
{
return prepareAddRow(row, rowId, new AddRowPendingChange(nextChange));
}
private PendingChange prepareAddRow(Object[] row, RowIdImpl rowId,
AddRowPendingChange change)
throws IOException
{
int nullCount = countNullValues(row);
boolean isNullEntry = (nullCount == _columns.size());
if(shouldIgnoreNulls() && isNullEntry) {
// nothing to do
return change;
}
if((nullCount > 0) && (isBackingPrimaryKey() || isRequired())) {
throw new ConstraintViolationException(withErrorContext(
"Null value found in row " + Arrays.asList(row) +
" for primary key or required index"));
}
// make sure we've parsed the entries
initialize();
return prepareAddEntry(new Entry(createEntryBytes(row), rowId), isNullEntry,
row, change);
}
/**
* Adds an entry to the correct index dataPage, maintaining the order.
*/
private PendingChange prepareAddEntry(Entry newEntry, boolean isNullEntry,
Object[] row, AddRowPendingChange change)
throws IOException
{
DataPage dataPage = findDataPage(newEntry);
int idx = dataPage.findEntry(newEntry);
if(idx < 0) {
// this is a new entry
idx = missingIndexToInsertionPoint(idx);
Position newPos = new Position(dataPage, idx, newEntry, true);
Position nextPos = getNextPosition(newPos);
Position prevPos = getPreviousPosition(newPos);
// determine if the addition of this entry would break the uniqueness
// constraint. See isUnique() for some notes about uniqueness as
// defined by Access.
boolean isDupeEntry =
(((nextPos != null) &&
newEntry.equalsEntryBytes(nextPos.getEntry())) ||
((prevPos != null) &&
newEntry.equalsEntryBytes(prevPos.getEntry())));
if(isUnique() && !isNullEntry && isDupeEntry) {
throw new ConstraintViolationException(withErrorContext(
"New row " + Arrays.asList(row) +
" violates uniqueness constraint for index"));
}
change.setAddRow(newEntry, dataPage, idx, isDupeEntry);
} else {
change.setOldRow(newEntry);
}
return change;
}
/**
* Completes a prepared row addition.
*/
private void commitAddRow(Entry newEntry, DataPage dataPage, int idx,
boolean isDupeEntry, Entry oldEntry)
throws IOException
{
if(newEntry != null) {
dataPage.addEntry(idx, newEntry);
if(!isDupeEntry) {
++_uniqueEntryCount;
}
++_modCount;
} else {
LOG.warn(withErrorContext("Added duplicate index entry " + oldEntry));
}
}
/**
* Prepares to update a row in this index. All constraints are checked
* before this method returns.
* <p>
* Forces index initialization.
*
* @param oldRow Row to be removed
* @param newRow Row to be added
* @param rowId rowId of the row to be updated
*
* @return a PendingChange which can complete the update or roll it back
*/
public PendingChange prepareUpdateRow(Object[] oldRow, RowIdImpl rowId,
Object[] newRow,
PendingChange nextChange)
throws IOException
{
UpdateRowPendingChange change = new UpdateRowPendingChange(nextChange);
change.setOldRow(deleteRowImpl(oldRow, rowId));
try {
prepareAddRow(newRow, rowId, change);
return change;
} catch(ConstraintViolationException e) {
// need to undo the deletion before bailing
change.rollback();
throw e;
}
}
/**
* Removes a row from this index
* <p>
* Forces index initialization.
*
* @param row Row to remove
* @param rowId rowId of the row to be removed
*/
public void deleteRow(Object[] row, RowIdImpl rowId)
throws IOException
{
deleteRowImpl(row, rowId);
}
private Entry deleteRowImpl(Object[] row, RowIdImpl rowId)
throws IOException
{
int nullCount = countNullValues(row);
if(shouldIgnoreNulls() && (nullCount == _columns.size())) {
// nothing to do
return null;
}
// make sure we've parsed the entries
initialize();
Entry oldEntry = new Entry(createEntryBytes(row), rowId);
Entry removedEntry = removeEntry(oldEntry);
if(removedEntry != null) {
++_modCount;
} else {
LOG.warn(withErrorContext(
"Failed removing index entry " + oldEntry + " for row: " +
Arrays.asList(row)));
}
return removedEntry;
}
/**
* Undoes a previous row deletion.
*/
private void rollbackDeletedRow(Entry removedEntry)
throws IOException
{
if(removedEntry == null) {
// no change was made
return;
}
// unfortunately, stuff might have shuffled around when we first removed
// the row, so in order to re-insert it, we need to re-find and insert it.
DataPage dataPage = findDataPage(removedEntry);
int idx = dataPage.findEntry(removedEntry);
if(idx < 0) {
dataPage.addEntry(missingIndexToInsertionPoint(idx), removedEntry);
}
}
/**
* Removes an entry from the relevant index dataPage, maintaining the order.
* Will search by RowId if entry is not found (in case a partial entry was
* provided).
*/
private Entry removeEntry(Entry oldEntry)
throws IOException
{
DataPage dataPage = findDataPage(oldEntry);
int idx = dataPage.findEntry(oldEntry);
boolean doRemove = false;
if(idx < 0) {
// the caller may have only read some of the row data, if this is the
// case, just search for the page/row numbers
// FIXME, we could force caller to get relevant values?
EntryCursor cursor = cursor();
Position tmpPos = null;
Position endPos = cursor._lastPos;
while(!endPos.equals(
tmpPos = cursor.getAnotherPosition(CursorImpl.MOVE_FORWARD))) {
if(tmpPos.getEntry().getRowId().equals(oldEntry.getRowId())) {
dataPage = tmpPos.getDataPage();
idx = tmpPos.getIndex();
doRemove = true;
break;
}
}
} else {
doRemove = true;
}
Entry removedEntry = null;
if(doRemove) {
// found it!
removedEntry = dataPage.removeEntry(idx);
}
return removedEntry;
}
public static void commitAll(PendingChange change) throws IOException {
while(change != null) {
change.commit();
change = change.getNext();
}
}
public static void rollbackAll(PendingChange change) throws IOException {
while(change != null) {
change.rollback();
change = change.getNext();
}
}
/**
* Gets a new cursor for this index.
* <p>
* Forces index initialization.
*/
public EntryCursor cursor()
throws IOException
{
return cursor(null, true, null, true);
}
/**
* Gets a new cursor for this index, narrowed to the range defined by the
* given startRow and endRow.
* <p>
* Forces index initialization.
*
* @param startRow the first row of data for the cursor, or {@code null} for
* the first entry
* @param startInclusive whether or not startRow is inclusive or exclusive
* @param endRow the last row of data for the cursor, or {@code null} for
* the last entry
* @param endInclusive whether or not endRow is inclusive or exclusive
*/
public EntryCursor cursor(Object[] startRow,
boolean startInclusive,
Object[] endRow,
boolean endInclusive)
throws IOException
{
initialize();
Entry startEntry = FIRST_ENTRY;
byte[] startEntryBytes = null;
if(startRow != null) {
startEntryBytes = createEntryBytes(startRow);
startEntry = new Entry(startEntryBytes,
(startInclusive ?
RowIdImpl.FIRST_ROW_ID : RowIdImpl.LAST_ROW_ID));
}
Entry endEntry = LAST_ENTRY;
if(endRow != null) {
// reuse startEntryBytes if startRow and endRow are same array. this is
// common for "lookup" code
byte[] endEntryBytes = ((startRow == endRow) ?
startEntryBytes :
createEntryBytes(endRow));
endEntry = new Entry(endEntryBytes,
(endInclusive ?
RowIdImpl.LAST_ROW_ID : RowIdImpl.FIRST_ROW_ID));
}
return new EntryCursor(findEntryPosition(startEntry),
findEntryPosition(endEntry));
}
private Position findEntryPosition(Entry entry)
throws IOException
{
DataPage dataPage = findDataPage(entry);
int idx = dataPage.findEntry(entry);
boolean between = false;
if(idx < 0) {
// given entry was not found exactly. our current position is now
// really between two indexes, but we cannot support that as an integer
// value, so we set a flag instead
idx = missingIndexToInsertionPoint(idx);
between = true;
}
return new Position(dataPage, idx, entry, between);
}
private Position getNextPosition(Position curPos)
throws IOException
{
// get the next index (between-ness is handled internally)
int nextIdx = curPos.getNextIndex();
Position nextPos = null;
if(nextIdx < curPos.getDataPage().getEntries().size()) {
nextPos = new Position(curPos.getDataPage(), nextIdx);
} else {
int nextPageNumber = curPos.getDataPage().getNextPageNumber();
DataPage nextDataPage = null;
while(nextPageNumber != INVALID_INDEX_PAGE_NUMBER) {
DataPage dp = getDataPage(nextPageNumber);
if(!dp.isEmpty()) {
nextDataPage = dp;
break;
}
nextPageNumber = dp.getNextPageNumber();
}
if(nextDataPage != null) {
nextPos = new Position(nextDataPage, 0);
}
}
return nextPos;
}
/**
* Returns the Position before the given one, or {@code null} if none.
*/
private Position getPreviousPosition(Position curPos)
throws IOException
{
// get the previous index (between-ness is handled internally)
int prevIdx = curPos.getPrevIndex();
Position prevPos = null;
if(prevIdx >= 0) {
prevPos = new Position(curPos.getDataPage(), prevIdx);
} else {
int prevPageNumber = curPos.getDataPage().getPrevPageNumber();
DataPage prevDataPage = null;
while(prevPageNumber != INVALID_INDEX_PAGE_NUMBER) {
DataPage dp = getDataPage(prevPageNumber);
if(!dp.isEmpty()) {
prevDataPage = dp;
break;
}
prevPageNumber = dp.getPrevPageNumber();
}
if(prevDataPage != null) {
prevPos = new Position(prevDataPage,
(prevDataPage.getEntries().size() - 1));
}
}
return prevPos;
}
/**
* Returns the valid insertion point for an index indicating a missing
* entry.
*/
protected static int missingIndexToInsertionPoint(int idx) {
return -(idx + 1);
}
/**
* Constructs an array of values appropriate for this index from the given
* column values, expected to match the columns for this index.
* @return the appropriate sparse array of data
* @throws IllegalArgumentException if the wrong number of values are
* provided
*/
public Object[] constructIndexRowFromEntry(Object... values)
{
if(values.length != _columns.size()) {
throw new IllegalArgumentException(withErrorContext(
"Wrong number of column values given " + values.length +
", expected " + _columns.size()));
}
int valIdx = 0;
Object[] idxRow = new Object[getTable().getColumnCount()];
for(ColumnDescriptor col : _columns) {
idxRow[col.getColumnIndex()] = values[valIdx++];
}
return idxRow;
}
/**
* Constructs an array of values appropriate for this index from the given
* column value.
* @return the appropriate sparse array of data or {@code null} if not all
* columns for this index were provided
*/
public Object[] constructIndexRow(String colName, Object value)
{
return constructIndexRow(Collections.singletonMap(colName, value));
}
/**
* Constructs an array of values appropriate for this index from the given
* column values.
* @return the appropriate sparse array of data or {@code null} if not all
* columns for this index were provided
*/
public Object[] constructIndexRow(Map<String,?> row)
{
for(ColumnDescriptor col : _columns) {
if(!row.containsKey(col.getName())) {
return null;
}
}
Object[] idxRow = new Object[getTable().getColumnCount()];
for(ColumnDescriptor col : _columns) {
idxRow[col.getColumnIndex()] = row.get(col.getName());
}
return idxRow;
}
@Override
public String toString() {
ToStringBuilder sb = CustomToStringStyle.builder(this)
.append("dataNumber", _number)
.append("pageNumber", _rootPageNumber)
.append("isBackingPrimaryKey", isBackingPrimaryKey())
.append("isUnique", isUnique())
.append("ignoreNulls", shouldIgnoreNulls())
.append("isRequired", isRequired())
.append("columns", _columns)
.append("initialized", _initialized);
if(_initialized) {
try {
sb.append("entryCount", getEntryCount());
} catch(IOException e) {
throw new RuntimeIOException(e);
}
}
sb.append("pageCache", _pageCache);
return sb.toString();
}
/**
* Write the given index page out to a buffer
*/
protected void writeDataPage(DataPage dataPage)
throws IOException
{
if(dataPage.getCompressedEntrySize() > _maxPageEntrySize) {
throw new IllegalStateException(withErrorContext("data page is too large"));
}
ByteBuffer buffer = _indexBufferH.getPageBuffer(getPageChannel());
writeDataPage(buffer, dataPage, getTable().getTableDefPageNumber(),
getFormat());
getPageChannel().writePage(buffer, dataPage.getPageNumber());
}
/**
* Writes the data page info to the given buffer.
*/
protected static void writeDataPage(ByteBuffer buffer, DataPage dataPage,
int tdefPageNumber, JetFormat format)
throws IOException
{
buffer.put(dataPage.isLeaf() ?
PageTypes.INDEX_LEAF :
PageTypes.INDEX_NODE ); //Page type
buffer.put((byte) 0x01); //Unknown
buffer.putShort((short) 0); //Free space
buffer.putInt(tdefPageNumber);
buffer.putInt(0); //Unknown
buffer.putInt(dataPage.getPrevPageNumber()); //Prev page
buffer.putInt(dataPage.getNextPageNumber()); //Next page
buffer.putInt(dataPage.getChildTailPageNumber()); //ChildTail page
byte[] entryPrefix = dataPage.getEntryPrefix();
buffer.putShort((short) entryPrefix.length); // entry prefix byte count
buffer.put((byte) 0); //Unknown
byte[] entryMask = new byte[format.SIZE_INDEX_ENTRY_MASK];
// first entry includes the prefix
int totalSize = entryPrefix.length;
for(Entry entry : dataPage.getEntries()) {
totalSize += (entry.size() - entryPrefix.length);
int idx = totalSize / 8;
entryMask[idx] |= (1 << (totalSize % 8));
}
buffer.put(entryMask);
// first entry includes the prefix
buffer.put(entryPrefix);
for(Entry entry : dataPage.getEntries()) {
entry.write(buffer, entryPrefix);
}
// update free space
buffer.putShort(2, (short) (format.PAGE_SIZE - buffer.position()));
}
/**
* Reads an index page, populating the correct collection based on the page
* type (node or leaf).
*/
protected void readDataPage(DataPage dataPage)
throws IOException
{
ByteBuffer buffer = _indexBufferH.getPageBuffer(getPageChannel());
getPageChannel().readPage(buffer, dataPage.getPageNumber());
boolean isLeaf = isLeafPage(buffer);
dataPage.setLeaf(isLeaf);
// note, "header" data is in LITTLE_ENDIAN format, entry data is in
// BIG_ENDIAN format
int entryPrefixLength = ByteUtil.getUnsignedShort(
buffer, getFormat().OFFSET_INDEX_COMPRESSED_BYTE_COUNT);
int entryMaskLength = getFormat().SIZE_INDEX_ENTRY_MASK;
int entryMaskPos = getFormat().OFFSET_INDEX_ENTRY_MASK;
int entryPos = entryMaskPos + entryMaskLength;
int lastStart = 0;
int totalEntrySize = 0;
byte[] entryPrefix = null;
List<Entry> entries = new ArrayList<Entry>();
TempBufferHolder tmpEntryBufferH =
TempBufferHolder.newHolder(TempBufferHolder.Type.HARD, true,
ENTRY_BYTE_ORDER);
Entry prevEntry = FIRST_ENTRY;
for (int i = 0; i < entryMaskLength; i++) {
byte entryMask = buffer.get(entryMaskPos + i);
for (int j = 0; j < 8; j++) {
if ((entryMask & (1 << j)) != 0) {
int length = (i * 8) + j - lastStart;
buffer.position(entryPos + lastStart);
// determine if we can read straight from the index page (if no
// entryPrefix). otherwise, create temp buf with complete entry.
ByteBuffer curEntryBuffer = buffer;
int curEntryLen = length;
if(entryPrefix != null) {
curEntryBuffer = getTempEntryBuffer(
buffer, length, entryPrefix, tmpEntryBufferH);
curEntryLen += entryPrefix.length;
}
totalEntrySize += curEntryLen;
Entry entry = newEntry(curEntryBuffer, curEntryLen, isLeaf);
if(prevEntry.compareTo(entry) >= 0) {
throw new IOException(withErrorContext(
"Unexpected order in index entries, " +
prevEntry + " >= " + entry));
}
entries.add(entry);
if((entries.size() == 1) && (entryPrefixLength > 0)) {
// read any shared entry prefix
entryPrefix = new byte[entryPrefixLength];
buffer.position(entryPos + lastStart);
buffer.get(entryPrefix);
}
lastStart += length;
prevEntry = entry;
}
}
}
dataPage.setEntryPrefix(entryPrefix != null ? entryPrefix : EMPTY_PREFIX);
dataPage.setEntries(entries);
dataPage.setTotalEntrySize(totalEntrySize);
int prevPageNumber = buffer.getInt(getFormat().OFFSET_PREV_INDEX_PAGE);
int nextPageNumber = buffer.getInt(getFormat().OFFSET_NEXT_INDEX_PAGE);
int childTailPageNumber =
buffer.getInt(getFormat().OFFSET_CHILD_TAIL_INDEX_PAGE);
dataPage.setPrevPageNumber(prevPageNumber);
dataPage.setNextPageNumber(nextPageNumber);
dataPage.setChildTailPageNumber(childTailPageNumber);
}
/**
* Returns a new Entry of the correct type for the given data and page type.
*/
private static Entry newEntry(ByteBuffer buffer, int entryLength,
boolean isLeaf)
throws IOException
{
if(isLeaf) {
return new Entry(buffer, entryLength);
}
return new NodeEntry(buffer, entryLength);
}
/**
* Returns an entry buffer containing the relevant data for an entry given
* the valuePrefix.
*/
private ByteBuffer getTempEntryBuffer(
ByteBuffer indexPage, int entryLen, byte[] valuePrefix,
TempBufferHolder tmpEntryBufferH)
{
ByteBuffer tmpEntryBuffer = tmpEntryBufferH.getBuffer(
getPageChannel(), valuePrefix.length + entryLen);
// combine valuePrefix and rest of entry from indexPage, then prep for
// reading
tmpEntryBuffer.put(valuePrefix);
tmpEntryBuffer.put(indexPage.array(), indexPage.position(), entryLen);
tmpEntryBuffer.flip();
return tmpEntryBuffer;
}
/**
* Determines if the given index page is a leaf or node page.
*/
private boolean isLeafPage(ByteBuffer buffer)
throws IOException
{
byte pageType = buffer.get(0);
if(pageType == PageTypes.INDEX_LEAF) {
return true;
} else if(pageType == PageTypes.INDEX_NODE) {
return false;
}
throw new IOException(withErrorContext("Unexpected page type " + pageType));
}
/**
* Determines the number of {@code null} values for this index from the
* given row.
*/
private int countNullValues(Object[] values)
{
if(values == null) {
return _columns.size();
}
// annoyingly, the values array could come from different sources, one
// of which will make it a different size than the other. we need to
// handle both situations.
int nullCount = 0;
for(ColumnDescriptor col : _columns) {
Object value = values[col.getColumnIndex()];
if(col.isNullValue(value)) {
++nullCount;
}
}
return nullCount;
}
/**
* Creates the entry bytes for a row of values.
*/
private byte[] createEntryBytes(Object[] values) throws IOException
{
if(values == null) {
return null;
}
if(_entryBuffer == null) {
_entryBuffer = new ByteStream();
}
_entryBuffer.reset();
for(ColumnDescriptor col : _columns) {
Object value = values[col.getColumnIndex()];
if(ColumnImpl.isRawData(value)) {
// ignore it, we could not parse it
continue;
}
if(value == MIN_VALUE) {
// null is the "least" value
_entryBuffer.write(getNullEntryFlag(col.isAscending()));
continue;
}
if(value == MAX_VALUE) {
// the opposite null is the "greatest" value
_entryBuffer.write(getNullEntryFlag(!col.isAscending()));
continue;
}
col.writeValue(value, _entryBuffer);
}
return _entryBuffer.toByteArray();
}
/**
* Finds the data page for the given entry.
*/
protected DataPage findDataPage(Entry entry)
throws IOException
{
return _pageCache.findCacheDataPage(entry);
}
/**
* Gets the data page for the pageNumber.
*/
protected DataPage getDataPage(int pageNumber)
throws IOException
{
return _pageCache.getCacheDataPage(pageNumber);
}
/**
* Flips the first bit in the byte at the given index.
*/
private static byte[] flipFirstBitInByte(byte[] value, int index)
{
value[index] = (byte)(value[index] ^ 0x80);
return value;
}
/**
* Flips all the bits in the byte array.
*/
private static byte[] flipBytes(byte[] value) {
return flipBytes(value, 0, value.length);
}
/**
* Flips the bits in the specified bytes in the byte array.
*/
static byte[] flipBytes(byte[] value, int offset, int length) {
for(int i = offset; i < (offset + length); ++i) {
value[i] = (byte)(~value[i]);
}
return value;
}
/**
* Writes the value of the given column type to a byte array and returns it.
*/
private static byte[] encodeNumberColumnValue(Object value, ColumnImpl column)
throws IOException
{
// always write in big endian order
return column.write(value, 0, ENTRY_BYTE_ORDER).array();
}
/**
* Writes a binary value using the general binary entry encoding rules.
*/
private static void writeGeneralBinaryEntry(byte[] valueBytes, boolean isAsc,
ByteStream bout)
{
int dataLen = valueBytes.length;
int extraLen = (dataLen + 7) / 8;
int entryLen = ((dataLen + extraLen + 8) / 9) * 9;
// reserve space for the full entry
bout.ensureNewCapacity(entryLen);
// binary data is written in 8 byte segments with a trailing length byte.
// The length byte is the amount of valid bytes in the segment (where 9
// indicates that there is more data _after_ this segment).
byte[] partialEntryBytes = new byte[9];
// bit twiddling rules:
// - isAsc => nothing
// - !isAsc => flipBytes, _but keep intermediate 09 unflipped_!
// first, write any intermediate segements
int segmentLen = dataLen;
int pos = 0;
while(segmentLen > 8) {
System.arraycopy(valueBytes, pos, partialEntryBytes, 0, 8);
if(!isAsc) {
// note, we do _not_ flip the length byte for intermediate segments
flipBytes(partialEntryBytes, 0, 8);
}
// we are writing intermediate segments (there is more data after this
// segment), so the length is always 9.
partialEntryBytes[8] = (byte)9;
pos += 8;
segmentLen -= 8;
bout.write(partialEntryBytes);
}
// write the last segment (with slightly different rules)
if(segmentLen > 0) {
System.arraycopy(valueBytes, pos, partialEntryBytes, 0, segmentLen);
// clear out an intermediate bytes between the real data and the final
// length byte
for(int i = segmentLen; i < 8; ++i) {
partialEntryBytes[i] = 0;
}
partialEntryBytes[8] = (byte)segmentLen;
if(!isAsc) {
// note, we _do_ flip the last length byte
flipBytes(partialEntryBytes, 0, 9);
}
bout.write(partialEntryBytes);
}
}
/**
* Creates one of the special index entries.
*/
private static Entry createSpecialEntry(RowIdImpl rowId) {
return new Entry((byte[])null, rowId);
}
/**
* Constructs a ColumnDescriptor of the relevant type for the given Column.
*/
private ColumnDescriptor newColumnDescriptor(ColumnImpl col, byte flags)
throws IOException
{
switch(col.getType()) {
case TEXT:
case MEMO:
ColumnImpl.SortOrder sortOrder = col.getTextSortOrder();
if(ColumnImpl.GENERAL_LEGACY_SORT_ORDER.equals(sortOrder)) {
return new GenLegTextColumnDescriptor(col, flags);
}
if(ColumnImpl.GENERAL_SORT_ORDER.equals(sortOrder)) {
return new GenTextColumnDescriptor(col, flags);
}
// unsupported sort order
setUnsupportedReason("unsupported collating sort order " + sortOrder +
" for text index", col);
return new ReadOnlyColumnDescriptor(col, flags);
case INT:
case LONG:
case MONEY:
case COMPLEX_TYPE:
return new IntegerColumnDescriptor(col, flags);
case FLOAT:
case DOUBLE:
case SHORT_DATE_TIME:
return new FloatingPointColumnDescriptor(col, flags);
case NUMERIC:
return (col.getFormat().LEGACY_NUMERIC_INDEXES ?
new LegacyFixedPointColumnDescriptor(col, flags) :
new FixedPointColumnDescriptor(col, flags));
case BYTE:
return new ByteColumnDescriptor(col, flags);
case BOOLEAN:
return new BooleanColumnDescriptor(col, flags);
case GUID:
return new GuidColumnDescriptor(col, flags);
case BINARY:
return new BinaryColumnDescriptor(col, flags);
default:
// we can't modify this index at this point in time
setUnsupportedReason("unsupported data type " + col.getType() +
" for index", col);
return new ReadOnlyColumnDescriptor(col, flags);
}
}
/**
* Returns the EntryType based on the given entry info.
*/
private static EntryType determineEntryType(byte[] entryBytes, RowIdImpl rowId)
{
if(entryBytes != null) {
return ((rowId.getType() == RowIdImpl.Type.NORMAL) ?
EntryType.NORMAL :
((rowId.getType() == RowIdImpl.Type.ALWAYS_FIRST) ?
EntryType.FIRST_VALID : EntryType.LAST_VALID));
} else if(!rowId.isValid()) {
// this is a "special" entry (first/last)
return ((rowId.getType() == RowIdImpl.Type.ALWAYS_FIRST) ?
EntryType.ALWAYS_FIRST : EntryType.ALWAYS_LAST);
}
throw new IllegalArgumentException("Values was null for valid entry");
}
/**
* Returns the maximum amount of entry data which can be encoded on any
* index page.
*/
private static int calcMaxPageEntrySize(JetFormat format)
{
// the max data we can fit on a page is the min of the space on the page
// vs the number of bytes which can be encoded in the entry mask
int pageDataSize = (format.PAGE_SIZE -
(format.OFFSET_INDEX_ENTRY_MASK +
format.SIZE_INDEX_ENTRY_MASK));
int entryMaskSize = (format.SIZE_INDEX_ENTRY_MASK * 8);
return Math.min(pageDataSize, entryMaskSize);
}
String withErrorContext(String msg) {
return withErrorContext(msg, getTable().getDatabase(), getTable().getName(),
getName());
}
private static String withErrorContext(String msg, DatabaseImpl db,
String tableName, String idxName) {
return msg + " (Db=" + db.getName() + ";Table=" + tableName +
";Index=" + idxName + ")";
}
/**
* Information about the columns in an index. Also encodes new index
* values.
*/
public static abstract class ColumnDescriptor implements Index.Column
{
private final ColumnImpl _column;
private final byte _flags;
private ColumnDescriptor(ColumnImpl column, byte flags)
throws IOException
{
_column = column;
_flags = flags;
}
public ColumnImpl getColumn() {
return _column;
}
public byte getFlags() {
return _flags;
}
public boolean isAscending() {
return((getFlags() & ASCENDING_COLUMN_FLAG) != 0);
}
public int getColumnIndex() {
return getColumn().getColumnIndex();
}
public String getName() {
return getColumn().getName();
}
protected boolean isNullValue(Object value) {
return (value == null);
}
protected final void writeValue(Object value, ByteStream bout)
throws IOException
{
if(isNullValue(value)) {
// write null value
bout.write(getNullEntryFlag(isAscending()));
return;
}
// write the start flag
bout.write(getStartEntryFlag(isAscending()));
// write the rest of the value
writeNonNullValue(value, bout);
}
protected abstract void writeNonNullValue(Object value, ByteStream bout)
throws IOException;
@Override
public String toString() {
return CustomToStringStyle.builder(this)
.append("column", getColumn())
.append("flags", getFlags() + " " + (isAscending() ? "(ASC)" : "(DSC)"))
.toString();
}
}
/**
* ColumnDescriptor for integer based columns.
*/
private static final class IntegerColumnDescriptor extends ColumnDescriptor
{
private IntegerColumnDescriptor(ColumnImpl column, byte flags)
throws IOException
{
super(column, flags);
}
@Override
protected void writeNonNullValue(Object value, ByteStream bout)
throws IOException
{
byte[] valueBytes = encodeNumberColumnValue(value, getColumn());
// bit twiddling rules:
// - isAsc => flipFirstBit
// - !isAsc => flipFirstBit, flipBytes
flipFirstBitInByte(valueBytes, 0);
if(!isAscending()) {
flipBytes(valueBytes);
}
bout.write(valueBytes);
}
}
/**
* ColumnDescriptor for floating point based columns.
*/
private static final class FloatingPointColumnDescriptor
extends ColumnDescriptor
{
private FloatingPointColumnDescriptor(ColumnImpl column, byte flags)
throws IOException
{
super(column, flags);
}
@Override
protected void writeNonNullValue(Object value, ByteStream bout)
throws IOException
{
byte[] valueBytes = encodeNumberColumnValue(value, getColumn());
// determine if the number is negative by testing if the first bit is
// set
boolean isNegative = ((valueBytes[0] & 0x80) != 0);
// bit twiddling rules:
// isAsc && !isNeg => flipFirstBit
// isAsc && isNeg => flipBytes
// !isAsc && !isNeg => flipFirstBit, flipBytes
// !isAsc && isNeg => nothing
if(!isNegative) {
flipFirstBitInByte(valueBytes, 0);
}
if(isNegative == isAscending()) {
flipBytes(valueBytes);
}
bout.write(valueBytes);
}
}
/**
* ColumnDescriptor for fixed point based columns (legacy sort order).
*/
private static class LegacyFixedPointColumnDescriptor
extends ColumnDescriptor
{
private LegacyFixedPointColumnDescriptor(ColumnImpl column, byte flags)
throws IOException
{
super(column, flags);
}
protected void handleNegationAndOrder(boolean isNegative,
byte[] valueBytes)
{
if(isNegative == isAscending()) {
flipBytes(valueBytes);
}
// reverse the sign byte (after any previous byte flipping)
valueBytes[0] = (isNegative ? (byte)0x00 : (byte)0xFF);
}
@Override
protected void writeNonNullValue(Object value, ByteStream bout)
throws IOException
{
byte[] valueBytes = encodeNumberColumnValue(value, getColumn());
// determine if the number is negative by testing if the first bit is
// set
boolean isNegative = ((valueBytes[0] & 0x80) != 0);
// bit twiddling rules:
// isAsc && !isNeg => setReverseSignByte => FF 00 00 ...
// isAsc && isNeg => flipBytes, setReverseSignByte => 00 FF FF ...
// !isAsc && !isNeg => flipBytes, setReverseSignByte => FF FF FF ...
// !isAsc && isNeg => setReverseSignByte => 00 00 00 ...
// v2007 bit twiddling rules (old ordering was a bug, MS kb 837148):
// isAsc && !isNeg => setSignByte 0xFF => FF 00 00 ...
// isAsc && isNeg => setSignByte 0xFF, flipBytes => 00 FF FF ...
// !isAsc && !isNeg => setSignByte 0xFF => FF 00 00 ...
// !isAsc && isNeg => setSignByte 0xFF, flipBytes => 00 FF FF ...
handleNegationAndOrder(isNegative, valueBytes);
bout.write(valueBytes);
}
}
/**
* ColumnDescriptor for new-style fixed point based columns.
*/
private static final class FixedPointColumnDescriptor
extends LegacyFixedPointColumnDescriptor
{
private FixedPointColumnDescriptor(ColumnImpl column, byte flags)
throws IOException
{
super(column, flags);
}
@Override
protected void handleNegationAndOrder(boolean isNegative,
byte[] valueBytes)
{
// see notes above in FixedPointColumnDescriptor for bit twiddling rules
// reverse the sign byte (before any byte flipping)
valueBytes[0] = (byte)0xFF;
if(isNegative == isAscending()) {
flipBytes(valueBytes);
}
}
}
/**
* ColumnDescriptor for byte based columns.
*/
private static final class ByteColumnDescriptor extends ColumnDescriptor
{
private ByteColumnDescriptor(ColumnImpl column, byte flags)
throws IOException
{
super(column, flags);
}
@Override
protected void writeNonNullValue(Object value, ByteStream bout)
throws IOException
{
byte[] valueBytes = encodeNumberColumnValue(value, getColumn());
// bit twiddling rules:
// - isAsc => nothing
// - !isAsc => flipBytes
if(!isAscending()) {
flipBytes(valueBytes);
}
bout.write(valueBytes);
}
}
/**
* ColumnDescriptor for boolean columns.
*/
private static final class BooleanColumnDescriptor extends ColumnDescriptor
{
private BooleanColumnDescriptor(ColumnImpl column, byte flags)
throws IOException
{
super(column, flags);
}
@Override
protected boolean isNullValue(Object value) {
// null values are handled as booleans
return false;
}
@Override
protected void writeNonNullValue(Object value, ByteStream bout)
throws IOException
{
bout.write(
ColumnImpl.toBooleanValue(value) ?
(isAscending() ? ASC_BOOLEAN_TRUE : DESC_BOOLEAN_TRUE) :
(isAscending() ? ASC_BOOLEAN_FALSE : DESC_BOOLEAN_FALSE));
}
}
/**
* ColumnDescriptor for "general legacy" sort order text based columns.
*/
private static final class GenLegTextColumnDescriptor
extends ColumnDescriptor
{
private GenLegTextColumnDescriptor(ColumnImpl column, byte flags)
throws IOException
{
super(column, flags);
}
@Override
protected void writeNonNullValue(Object value, ByteStream bout)
throws IOException
{
GeneralLegacyIndexCodes.GEN_LEG_INSTANCE.writeNonNullIndexTextValue(
value, bout, isAscending());
}
}
/**
* ColumnDescriptor for "general" sort order (2010+) text based columns.
*/
private static final class GenTextColumnDescriptor extends ColumnDescriptor
{
private GenTextColumnDescriptor(ColumnImpl column, byte flags)
throws IOException
{
super(column, flags);
}
@Override
protected void writeNonNullValue(Object value, ByteStream bout)
throws IOException
{
GeneralIndexCodes.GEN_INSTANCE.writeNonNullIndexTextValue(
value, bout, isAscending());
}
}
/**
* ColumnDescriptor for guid columns.
*/
private static final class GuidColumnDescriptor extends ColumnDescriptor
{
private GuidColumnDescriptor(ColumnImpl column, byte flags)
throws IOException
{
super(column, flags);
}
@Override
protected void writeNonNullValue(Object value, ByteStream bout)
throws IOException
{
writeGeneralBinaryEntry(
encodeNumberColumnValue(value, getColumn()), isAscending(),
bout);
}
}
/**
* ColumnDescriptor for BINARY columns.
*/
private static final class BinaryColumnDescriptor extends ColumnDescriptor
{
private BinaryColumnDescriptor(ColumnImpl column, byte flags)
throws IOException
{
super(column, flags);
}
@Override
protected void writeNonNullValue(Object value, ByteStream bout)
throws IOException
{
writeGeneralBinaryEntry(
ColumnImpl.toByteArray(value), isAscending(), bout);
}
}
/**
* ColumnDescriptor for columns which we cannot currently write.
*/
private final class ReadOnlyColumnDescriptor extends ColumnDescriptor
{
private ReadOnlyColumnDescriptor(ColumnImpl column, byte flags)
throws IOException
{
super(column, flags);
}
@Override
protected void writeNonNullValue(Object value, ByteStream bout)
throws IOException
{
throw new UnsupportedOperationException(
"Cannot write indexes of this type due to " + _unsupportedReason);
}
}
/**
* A single leaf entry in an index (points to a single row)
*/
public static class Entry implements Comparable<Entry>
{
/** page/row on which this row is stored */
private final RowIdImpl _rowId;
/** the entry value */
private final byte[] _entryBytes;
/** comparable type for the entry */
private final EntryType _type;
/**
* Create a new entry
* @param entryBytes encoded bytes for this index entry
* @param rowId rowId in which the row is stored
* @param type the type of the entry
*/
private Entry(byte[] entryBytes, RowIdImpl rowId, EntryType type) {
_rowId = rowId;
_entryBytes = entryBytes;
_type = type;
}
/**
* Create a new entry
* @param entryBytes encoded bytes for this index entry
* @param rowId rowId in which the row is stored
*/
private Entry(byte[] entryBytes, RowIdImpl rowId)
{
this(entryBytes, rowId, determineEntryType(entryBytes, rowId));
}
/**
* Read an existing entry in from a buffer
*/
private Entry(ByteBuffer buffer, int entryLen)
throws IOException
{
this(buffer, entryLen, 0);
}
/**
* Read an existing entry in from a buffer
*/
private Entry(ByteBuffer buffer, int entryLen, int extraTrailingLen)
throws IOException
{
// we need 4 trailing bytes for the rowId, plus whatever the caller
// wants
int colEntryLen = entryLen - (4 + extraTrailingLen);
// read the entry bytes
_entryBytes = ByteUtil.getBytes(buffer, colEntryLen);
// read the rowId
int page = ByteUtil.get3ByteInt(buffer, ENTRY_BYTE_ORDER);
int row = ByteUtil.getUnsignedByte(buffer);
_rowId = new RowIdImpl(page, row);
_type = EntryType.NORMAL;
}
public RowIdImpl getRowId() {
return _rowId;
}
public EntryType getType() {
return _type;
}
public Integer getSubPageNumber() {
throw new UnsupportedOperationException();
}
public boolean isLeafEntry() {
return true;
}
public boolean isValid() {
return(_entryBytes != null);
}
protected final byte[] getEntryBytes() {
return _entryBytes;
}
/**
* Size of this entry in the db.
*/
protected int size() {
// need 4 trailing bytes for the rowId
return _entryBytes.length + 4;
}
/**
* Write this entry into a buffer
*/
protected void write(ByteBuffer buffer,
byte[] prefix)
throws IOException
{
if(prefix.length <= _entryBytes.length) {
// write entry bytes, not including prefix
buffer.put(_entryBytes, prefix.length,
(_entryBytes.length - prefix.length));
ByteUtil.put3ByteInt(buffer, getRowId().getPageNumber(),
ENTRY_BYTE_ORDER);
} else if(prefix.length <= (_entryBytes.length + 3)) {
// the prefix includes part of the page number, write to temp buffer
// and copy last bytes to output buffer
ByteBuffer tmp = ByteBuffer.allocate(3);
ByteUtil.put3ByteInt(tmp, getRowId().getPageNumber(),
ENTRY_BYTE_ORDER);
tmp.flip();
tmp.position(prefix.length - _entryBytes.length);
buffer.put(tmp);
} else {
// since the row number would never be the same if the page number is
// the same, nothing past the page number should ever be included in
// the prefix.
// FIXME, this could happen if page has only one row...
throw new IllegalStateException("prefix should never be this long");
}
buffer.put((byte)getRowId().getRowNumber());
}
protected final ToStringBuilder entryBytesToStringBuilder(
ToStringBuilder sb) {
if(isValid()) {
sb.append("bytes", _entryBytes);
}
return sb;
}
@Override
public String toString() {
return entryBytesToStringBuilder(
CustomToStringStyle.valueBuilder(this)
.append("rowId", _rowId))
.toString();
}
@Override
public int hashCode() {
return _rowId.hashCode();
}
@Override
public boolean equals(Object o) {
return((this == o) ||
((o != null) && (getClass() == o.getClass()) &&
(compareTo((Entry)o) == 0)));
}
/**
* @return {@code true} iff the entryBytes are equal between this
* Entry and the given Entry
*/
public boolean equalsEntryBytes(Entry o) {
return(BYTE_CODE_COMPARATOR.compare(_entryBytes, o._entryBytes) == 0);
}
public int compareTo(Entry other) {
if (this == other) {
return 0;
}
if(isValid() && other.isValid()) {
// comparing two valid entries. first, compare by actual byte values
int entryCmp = BYTE_CODE_COMPARATOR.compare(
_entryBytes, other._entryBytes);
if(entryCmp != 0) {
return entryCmp;
}
} else {
// if the entries are of mixed validity (or both invalid), we defer
// next to the EntryType
int typeCmp = _type.compareTo(other._type);
if(typeCmp != 0) {
return typeCmp;
}
}
// at this point we let the RowId decide the final result
return _rowId.compareTo(other.getRowId());
}
/**
* Returns a copy of this entry as a node Entry with the given
* subPageNumber.
*/
protected Entry asNodeEntry(Integer subPageNumber) {
return new NodeEntry(_entryBytes, _rowId, _type, subPageNumber);
}
}
/**
* A single node entry in an index (points to a sub-page in the index)
*/
private static final class NodeEntry extends Entry {
/** index page number of the page to which this node entry refers */
private final Integer _subPageNumber;
/**
* Create a new node entry
* @param entryBytes encoded bytes for this index entry
* @param rowId rowId in which the row is stored
* @param type the type of the entry
* @param subPageNumber the sub-page to which this node entry refers
*/
private NodeEntry(byte[] entryBytes, RowIdImpl rowId, EntryType type,
Integer subPageNumber) {
super(entryBytes, rowId, type);
_subPageNumber = subPageNumber;
}
/**
* Read an existing node entry in from a buffer
*/
private NodeEntry(ByteBuffer buffer, int entryLen)
throws IOException
{
// we need 4 trailing bytes for the sub-page number
super(buffer, entryLen, 4);
_subPageNumber = ByteUtil.getInt(buffer, ENTRY_BYTE_ORDER);
}
@Override
public Integer getSubPageNumber() {
return _subPageNumber;
}
@Override
public boolean isLeafEntry() {
return false;
}
@Override
protected int size() {
// need 4 trailing bytes for the sub-page number
return super.size() + 4;
}
@Override
protected void write(ByteBuffer buffer, byte[] prefix) throws IOException {
super.write(buffer, prefix);
ByteUtil.putInt(buffer, _subPageNumber, ENTRY_BYTE_ORDER);
}
@Override
public boolean equals(Object o) {
return((this == o) ||
((o != null) && (getClass() == o.getClass()) &&
(compareTo((Entry)o) == 0) &&
(getSubPageNumber().equals(((Entry)o).getSubPageNumber()))));
}
@Override
public String toString() {
return entryBytesToStringBuilder(
CustomToStringStyle.valueBuilder(this)
.append("rowId", getRowId())
.append("subPage", _subPageNumber))
.toString();
}
}
/**
* Utility class to traverse the entries in the Index. Remains valid in the
* face of index entry modifications.
*/
public final class EntryCursor
{
/** handler for moving the page cursor forward */
private final DirHandler _forwardDirHandler = new ForwardDirHandler();
/** handler for moving the page cursor backward */
private final DirHandler _reverseDirHandler = new ReverseDirHandler();
/** the first (exclusive) row id for this cursor */
private Position _firstPos;
/** the last (exclusive) row id for this cursor */
private Position _lastPos;
/** the current entry */
private Position _curPos;
/** the previous entry */
private Position _prevPos;
/** the last read modification count on the Index. we track this so that
the cursor can detect updates to the index while traversing and act
accordingly */
private int _lastModCount;
private EntryCursor(Position firstPos, Position lastPos)
{
_firstPos = firstPos;
_lastPos = lastPos;
_lastModCount = getIndexModCount();
reset();
}
/**
* Returns the DirHandler for the given direction
*/
private DirHandler getDirHandler(boolean moveForward) {
return (moveForward ? _forwardDirHandler : _reverseDirHandler);
}
public IndexData getIndexData() {
return IndexData.this;
}
private int getIndexModCount() {
return IndexData.this._modCount;
}
/**
* Returns the first entry (exclusive) as defined by this cursor.
*/
public Entry getFirstEntry() {
return _firstPos.getEntry();
}
/**
* Returns the last entry (exclusive) as defined by this cursor.
*/
public Entry getLastEntry() {
return _lastPos.getEntry();
}
/**
* Returns {@code true} if this cursor is up-to-date with respect to its
* index.
*/
public boolean isUpToDate() {
return(getIndexModCount() == _lastModCount);
}
public void reset() {
beforeFirst();
}
public void beforeFirst() {
reset(CursorImpl.MOVE_FORWARD);
}
public void afterLast() {
reset(CursorImpl.MOVE_REVERSE);
}
protected void reset(boolean moveForward)
{
_curPos = getDirHandler(moveForward).getBeginningPosition();
_prevPos = _curPos;
}
/**
* Repositions the cursor so that the next row will be the first entry
* >= the given row.
*/
public void beforeEntry(Object[] row)
throws IOException
{
restorePosition(new Entry(IndexData.this.createEntryBytes(row),
RowIdImpl.FIRST_ROW_ID));
}
/**
* Repositions the cursor so that the previous row will be the first
* entry <= the given row.
*/
public void afterEntry(Object[] row)
throws IOException
{
restorePosition(new Entry(IndexData.this.createEntryBytes(row),
RowIdImpl.LAST_ROW_ID));
}
/**
* @return valid entry if there was a next entry,
* {@code #getLastEntry} otherwise
*/
public Entry getNextEntry() throws IOException {
return getAnotherPosition(CursorImpl.MOVE_FORWARD).getEntry();
}
/**
* @return valid entry if there was a next entry,
* {@code #getFirstEntry} otherwise
*/
public Entry getPreviousEntry() throws IOException {
return getAnotherPosition(CursorImpl.MOVE_REVERSE).getEntry();
}
/**
* Restores a current position for the cursor (current position becomes
* previous position).
*/
protected void restorePosition(Entry curEntry)
throws IOException
{
restorePosition(curEntry, _curPos.getEntry());
}
/**
* Restores a current and previous position for the cursor.
*/
protected void restorePosition(Entry curEntry, Entry prevEntry)
throws IOException
{
if(!_curPos.equalsEntry(curEntry) ||
!_prevPos.equalsEntry(prevEntry))
{
if(!isUpToDate()) {
updateBounds();
_lastModCount = getIndexModCount();
}
_prevPos = updatePosition(prevEntry);
_curPos = updatePosition(curEntry);
} else {
checkForModification();
}
}
/**
* Gets another entry in the given direction, returning the new entry.
*/
private Position getAnotherPosition(boolean moveForward)
throws IOException
{
DirHandler handler = getDirHandler(moveForward);
if(_curPos.equals(handler.getEndPosition())) {
if(!isUpToDate()) {
restorePosition(_prevPos.getEntry());
// drop through and retry moving to another entry
} else {
// at end, no more
return _curPos;
}
}
checkForModification();
_prevPos = _curPos;
_curPos = handler.getAnotherPosition(_curPos);
return _curPos;
}
/**
* Checks the index for modifications and updates state accordingly.
*/
private void checkForModification()
throws IOException
{
if(!isUpToDate()) {
updateBounds();
_prevPos = updatePosition(_prevPos.getEntry());
_curPos = updatePosition(_curPos.getEntry());
_lastModCount = getIndexModCount();
}
}
/**
* Updates the given position, taking boundaries into account.
*/
private Position updatePosition(Entry entry)
throws IOException
{
if(!entry.isValid()) {
// no use searching if "updating" the first/last pos
if(_firstPos.equalsEntry(entry)) {
return _firstPos;
} else if(_lastPos.equalsEntry(entry)) {
return _lastPos;
} else {
throw new IllegalArgumentException(
withErrorContext("Invalid entry given " + entry));
}
}
Position pos = findEntryPosition(entry);
if(pos.compareTo(_lastPos) >= 0) {
return _lastPos;
} else if(pos.compareTo(_firstPos) <= 0) {
return _firstPos;
}
return pos;
}
/**
* Updates any the boundary info (_firstPos/_lastPos).
*/
private void updateBounds()
throws IOException
{
_firstPos = findEntryPosition(_firstPos.getEntry());
_lastPos = findEntryPosition(_lastPos.getEntry());
}
@Override
public String toString() {
return CustomToStringStyle.valueBuilder(this)
.append("curPosition", _curPos)
.append("prevPosition", _prevPos)
.toString();
}
/**
* Handles moving the cursor in a given direction. Separates cursor
* logic from value storage.
*/
private abstract class DirHandler {
public abstract Position getAnotherPosition(Position curPos)
throws IOException;
public abstract Position getBeginningPosition();
public abstract Position getEndPosition();
}
/**
* Handles moving the cursor forward.
*/
private final class ForwardDirHandler extends DirHandler {
@Override
public Position getAnotherPosition(Position curPos)
throws IOException
{
Position newPos = getNextPosition(curPos);
if((newPos == null) || (newPos.compareTo(_lastPos) >= 0)) {
newPos = _lastPos;
}
return newPos;
}
@Override
public Position getBeginningPosition() {
return _firstPos;
}
@Override
public Position getEndPosition() {
return _lastPos;
}
}
/**
* Handles moving the cursor backward.
*/
private final class ReverseDirHandler extends DirHandler {
@Override
public Position getAnotherPosition(Position curPos)
throws IOException
{
Position newPos = getPreviousPosition(curPos);
if((newPos == null) || (newPos.compareTo(_firstPos) <= 0)) {
newPos = _firstPos;
}
return newPos;
}
@Override
public Position getBeginningPosition() {
return _lastPos;
}
@Override
public Position getEndPosition() {
return _firstPos;
}
}
}
/**
* Simple value object for maintaining some cursor state.
*/
private static final class Position implements Comparable<Position> {
/** the last known page of the given entry */
private final DataPage _dataPage;
/** the last known index of the given entry */
private final int _idx;
/** the entry at the given index */
private final Entry _entry;
/** {@code true} if this entry does not currently exist in the entry list,
{@code false} otherwise (this is equivalent to adding -0.5 to the
_idx) */
private final boolean _between;
private Position(DataPage dataPage, int idx)
{
this(dataPage, idx, dataPage.getEntries().get(idx), false);
}
private Position(DataPage dataPage, int idx, Entry entry, boolean between)
{
_dataPage = dataPage;
_idx = idx;
_entry = entry;
_between = between;
}
public DataPage getDataPage() {
return _dataPage;
}
public int getIndex() {
return _idx;
}
public int getNextIndex() {
// note, _idx does not need to be advanced if it was pointing at a
// between position
return(_between ? _idx : (_idx + 1));
}
public int getPrevIndex() {
// note, we ignore the between flag here because the index will be
// pointing at the correct next index in either the between or
// non-between case
return(_idx - 1);
}
public Entry getEntry() {
return _entry;
}
public boolean isBetween() {
return _between;
}
public boolean equalsEntry(Entry entry) {
return _entry.equals(entry);
}
public int compareTo(Position other)
{
if(this == other) {
return 0;
}
if(_dataPage.equals(other._dataPage)) {
// "simple" index comparison (handle between-ness)
int idxCmp = ((_idx < other._idx) ? -1 :
((_idx > other._idx) ? 1 :
((_between == other._between) ? 0 :
(_between ? -1 : 1))));
if(idxCmp != 0) {
return idxCmp;
}
}
// compare the entries.
return _entry.compareTo(other._entry);
}
@Override
public int hashCode() {
return _entry.hashCode();
}
@Override
public boolean equals(Object o) {
return((this == o) ||
((o != null) && (getClass() == o.getClass()) &&
(compareTo((Position)o) == 0)));
}
@Override
public String toString() {
return CustomToStringStyle.valueBuilder(this)
.append("page", _dataPage.getPageNumber())
.append("idx", _idx)
.append("entry", _entry)
.append("between", _between)
.toString();
}
}
/**
* Object used to maintain state about an Index page.
*/
protected static abstract class DataPage {
public abstract int getPageNumber();
public abstract boolean isLeaf();
public abstract void setLeaf(boolean isLeaf);
public abstract int getPrevPageNumber();
public abstract void setPrevPageNumber(int pageNumber);
public abstract int getNextPageNumber();
public abstract void setNextPageNumber(int pageNumber);
public abstract int getChildTailPageNumber();
public abstract void setChildTailPageNumber(int pageNumber);
public abstract int getTotalEntrySize();
public abstract void setTotalEntrySize(int totalSize);
public abstract byte[] getEntryPrefix();
public abstract void setEntryPrefix(byte[] entryPrefix);
public abstract List<Entry> getEntries();
public abstract void setEntries(List<Entry> entries);
public abstract void addEntry(int idx, Entry entry)
throws IOException;
public abstract Entry removeEntry(int idx)
throws IOException;
public final boolean isEmpty() {
return getEntries().isEmpty();
}
public final int getCompressedEntrySize() {
// when written to the index page, the entryPrefix bytes will only be
// written for the first entry, so we subtract the entry prefix size
// from all the other entries to determine the compressed size
return getTotalEntrySize() -
(getEntryPrefix().length * (getEntries().size() - 1));
}
public final int findEntry(Entry entry) {
return Collections.binarySearch(getEntries(), entry);
}
@Override
public final int hashCode() {
return getPageNumber();
}
@Override
public final boolean equals(Object o) {
return((this == o) ||
((o != null) && (getClass() == o.getClass()) &&
(getPageNumber() == ((DataPage)o).getPageNumber())));
}
@Override
public final String toString() {
List<Entry> entries = getEntries();
String objName =
(isLeaf() ? "Leaf" : "Node") + "DataPage[" + getPageNumber() +
"] " + getPrevPageNumber() + ", " + getNextPageNumber() + ", (" +
getChildTailPageNumber() + ")";
ToStringBuilder sb = CustomToStringStyle.valueBuilder(objName);
if((isLeaf() && !entries.isEmpty())) {
sb.append("entryRange", "[" + entries.get(0) + ", " +
entries.get(entries.size() - 1) + "]");
} else {
sb.append("entries", entries);
}
return sb.toString();
}
}
/**
* Simple implementation of a DataPage
*/
private static final class RootDataPage extends DataPage {
@Override
public int getPageNumber() { return 0; }
@Override
public boolean isLeaf() { return true; }
@Override
public void setLeaf(boolean isLeaf) { }
@Override
public int getPrevPageNumber() { return 0; }
@Override
public void setPrevPageNumber(int pageNumber) { }
@Override
public int getNextPageNumber() { return 0; }
@Override
public void setNextPageNumber(int pageNumber) { }
@Override
public int getChildTailPageNumber() { return 0; }
@Override
public void setChildTailPageNumber(int pageNumber) { }
@Override
public int getTotalEntrySize() { return 0; }
@Override
public void setTotalEntrySize(int totalSize) { }
@Override
public byte[] getEntryPrefix() { return EMPTY_PREFIX; }
@Override
public void setEntryPrefix(byte[] entryPrefix) { }
@Override
public List<Entry> getEntries() { return Collections.emptyList(); }
@Override
public void setEntries(List<Entry> entries) { }
@Override
public void addEntry(int idx, Entry entry) { }
@Override
public Entry removeEntry(int idx) { return null; }
}
/**
* Utility class which maintains information about a pending index update.
* An instance of this class can be used to complete the change (by calling
* {@link #commit}) or undo the change (by calling {@link #rollback}).
*/
public static abstract class PendingChange
{
private final PendingChange _next;
private PendingChange(PendingChange next) {
_next = next;
}
/**
* Returns the next pending change, if any
*/
public PendingChange getNext() {
return _next;
}
/**
* Completes the pending change.
*/
public abstract void commit() throws IOException;
/**
* Undoes the pending change.
*/
public abstract void rollback() throws IOException;
}
/**
* PendingChange for a row addition.
*/
private class AddRowPendingChange extends PendingChange
{
protected Entry _addEntry;
protected DataPage _addDataPage;
protected int _addIdx;
protected boolean _isDupe;
protected Entry _oldEntry;
private AddRowPendingChange(PendingChange next) {
super(next);
}
public void setAddRow(Entry addEntry, DataPage dataPage, int idx,
boolean isDupe) {
_addEntry = addEntry;
_addDataPage = dataPage;
_addIdx = idx;
_isDupe = isDupe;
}
public void setOldRow(Entry oldEntry) {
_oldEntry = oldEntry;
}
@Override
public void commit() throws IOException {
commitAddRow(_addEntry, _addDataPage, _addIdx, _isDupe, _oldEntry);
}
@Override
public void rollback() throws IOException {
_addEntry = null;
_addDataPage = null;
_addIdx = -1;
}
}
/**
* PendingChange for a row update (which is essentially a deletion followed
* by an addition).
*/
private class UpdateRowPendingChange extends AddRowPendingChange
{
private UpdateRowPendingChange(PendingChange next) {
super(next);
}
@Override
public void rollback() throws IOException {
super.rollback();
rollbackDeletedRow(_oldEntry);
}
}
}
|