/usr/include/kcdb.h is in libkyotocabinet-dev 1.2.76-4.1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /*************************************************************************************************
* Database interface
* Copyright (C) 2009-2012 FAL Labs
* This file is part of Kyoto Cabinet.
* 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
* 3 of the License, or 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, see <http://www.gnu.org/licenses/>.
*************************************************************************************************/
#ifndef _KCDB_H // duplication check
#define _KCDB_H
#include <kccommon.h>
#include <kcutil.h>
#include <kcthread.h>
#include <kcfile.h>
#include <kccompress.h>
#include <kccompare.h>
#include <kcmap.h>
#define KCDBSSMAGICDATA "KCSS\n" ///< The magic data of the snapshot file
namespace kyotocabinet { // common namespace
/**
* Interface of database abstraction.
* @note This class is an abstract class to prescribe the interface of record access.
*/
class DB {
public:
/**
* Interface to access a record.
*/
class Visitor {
public:
/** Special pointer for no operation. */
static const char* const NOP;
/** Special pointer to remove the record. */
static const char* const REMOVE;
/**
* Destructor.
*/
virtual ~Visitor() {
_assert_(true);
}
/**
* Visit a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param vbuf the pointer to the value region.
* @param vsiz the size of the value region.
* @param sp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @return If it is the pointer to a region, the value is replaced by the content. If it
* is Visitor::NOP, nothing is modified. If it is Visitor::REMOVE, the record is removed.
*/
virtual const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
_assert_(kbuf && ksiz <= MEMMAXSIZ && vbuf && vsiz <= MEMMAXSIZ && sp);
return NOP;
}
/**
* Visit a empty record space.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param sp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @return If it is the pointer to a region, the value is replaced by the content. If it
* is Visitor::NOP or Visitor::REMOVE, nothing is modified.
*/
virtual const char* visit_empty(const char* kbuf, size_t ksiz, size_t* sp) {
_assert_(kbuf && ksiz <= MEMMAXSIZ && sp);
return NOP;
}
/**
* Preprocess the main operations.
*/
virtual void visit_before() {
_assert_(true);
}
/**
* Postprocess the main operations.
*/
virtual void visit_after() {
_assert_(true);
}
};
/**
* Interface of cursor to indicate a record.
*/
class Cursor {
public:
/**
* Destructor.
*/
virtual ~Cursor() {
_assert_(true);
}
/**
* Accept a visitor to the current record.
* @param visitor a visitor object.
* @param writable true for writable operation, or false for read-only operation.
* @param step true to move the cursor to the next record, or false for no move.
* @return true on success, or false on failure.
* @note The operation for each record is performed atomically and other threads accessing
* the same record are blocked. To avoid deadlock, any explicit database operation must not
* be performed in this function.
*/
virtual bool accept(Visitor* visitor, bool writable = true, bool step = false) = 0;
/**
* Set the value of the current record.
* @param vbuf the pointer to the value region.
* @param vsiz the size of the value region.
* @param step true to move the cursor to the next record, or false for no move.
* @return true on success, or false on failure.
*/
virtual bool set_value(const char* vbuf, size_t vsiz, bool step = false) = 0;
/**
* Set the value of the current record.
* @note Equal to the original Cursor::set_value method except that the parameter is
* std::string.
*/
virtual bool set_value_str(const std::string& value, bool step = false) = 0;
/**
* Remove the current record.
* @return true on success, or false on failure.
* @note If no record corresponds to the key, false is returned. The cursor is moved to the
* next record implicitly.
*/
virtual bool remove() = 0;
/**
* Get the key of the current record.
* @param sp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @param step true to move the cursor to the next record, or false for no move.
* @return the pointer to the key region of the current record, or NULL on failure.
* @note If the cursor is invalidated, NULL is returned. Because an additional zero
* code is appended at the end of the region of the return value, the return value can be
* treated as a C-style string. Because the region of the return value is allocated with the
* the new[] operator, it should be released with the delete[] operator when it is no longer
* in use.
*/
virtual char* get_key(size_t* sp, bool step = false) = 0;
/**
* Get the key of the current record.
* @note Equal to the original Cursor::get_key method except that a parameter is a string to
* contain the result and the return value is bool for success.
*/
virtual bool get_key(std::string* key, bool step = false) = 0;
/**
* Get the value of the current record.
* @param sp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @param step true to move the cursor to the next record, or false for no move.
* @return the pointer to the value region of the current record, or NULL on failure.
* @note If the cursor is invalidated, NULL is returned. Because an additional zero
* code is appended at the end of the region of the return value, the return value can be
* treated as a C-style string. Because the region of the return value is allocated with the
* the new[] operator, it should be released with the delete[] operator when it is no longer
* in use.
*/
virtual char* get_value(size_t* sp, bool step = false) = 0;
/**
* Get the value of the current record.
* @note Equal to the original Cursor::get_value method except that a parameter is a string
* to contain the result and the return value is bool for success.
*/
virtual bool get_value(std::string* value, bool step = false) = 0;
/**
* Get a pair of the key and the value of the current record.
* @param ksp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @param vbp the pointer to the variable into which the pointer to the value region is
* assigned.
* @param vsp the pointer to the variable into which the size of the value region is
* assigned.
* @param step true to move the cursor to the next record, or false for no move.
* @return the pointer to the key region, or NULL on failure.
* @note If the cursor is invalidated, NULL is returned. Because an additional zero code is
* appended at the end of each region of the key and the value, each region can be treated
* as a C-style string. The return value should be deleted explicitly by the caller with
* the detele[] operator.
*/
virtual char* get(size_t* ksp, const char** vbp, size_t* vsp, bool step = false) = 0;
/**
* Get a pair of the key and the value of the current record.
* @note Equal to the original Cursor::get method except that parameters are strings
* to contain the result and the return value is bool for success.
*/
virtual bool get(std::string* key, std::string* value, bool step = false) = 0;
/**
* Jump the cursor to the first record for forward scan.
* @return true on success, or false on failure.
*/
virtual bool jump() = 0;
/**
* Jump the cursor to a record for forward scan.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @return true on success, or false on failure.
*/
virtual bool jump(const char* kbuf, size_t ksiz) = 0;
/**
* Jump the cursor to a record for forward scan.
* @note Equal to the original Cursor::jump method except that the parameter is std::string.
*/
virtual bool jump(const std::string& key) = 0;
/**
* Jump the cursor to the last record for backward scan.
* @return true on success, or false on failure.
* @note This method is dedicated to tree databases. Some database types, especially hash
* databases, will provide a dummy implementation.
*/
virtual bool jump_back() = 0;
/**
* Jump the cursor to a record for backward scan.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @return true on success, or false on failure.
* @note This method is dedicated to tree databases. Some database types, especially hash
* databases, will provide a dummy implementation.
*/
virtual bool jump_back(const char* kbuf, size_t ksiz) = 0;
/**
* Jump the cursor to a record for backward scan.
* @note Equal to the original Cursor::jump_back method except that the parameter is
* std::string.
*/
virtual bool jump_back(const std::string& key) = 0;
/**
* Step the cursor to the next record.
* @return true on success, or false on failure.
*/
virtual bool step() = 0;
/**
* Step the cursor to the previous record.
* @return true on success, or false on failure.
* @note This method is dedicated to tree databases. Some database types, especially hash
* databases, will provide a dummy implementation.
*/
virtual bool step_back() = 0;
/**
* Get the database object.
* @return the database object.
*/
virtual DB* db() = 0;
};
/**
* Destructor.
*/
virtual ~DB() {
_assert_(true);
}
/**
* Accept a visitor to a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param visitor a visitor object.
* @param writable true for writable operation, or false for read-only operation.
* @return true on success, or false on failure.
* @note The operation for each record is performed atomically and other threads accessing the
* same record are blocked. To avoid deadlock, any explicit database operation must not be
* performed in this function.
*/
virtual bool accept(const char* kbuf, size_t ksiz, Visitor* visitor, bool writable = true) = 0;
/**
* Set the value of a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param vbuf the pointer to the value region.
* @param vsiz the size of the value region.
* @return true on success, or false on failure.
* @note If no record corresponds to the key, a new record is created. If the corresponding
* record exists, the value is overwritten.
*/
virtual bool set(const char* kbuf, size_t ksiz, const char* vbuf, size_t vsiz) = 0;
/**
* Set the value of a record.
* @note Equal to the original DB::set method except that the parameters are std::string.
*/
virtual bool set(const std::string& key, const std::string& value) = 0;
/**
* Add a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param vbuf the pointer to the value region.
* @param vsiz the size of the value region.
* @return true on success, or false on failure.
* @note If no record corresponds to the key, a new record is created. If the corresponding
* record exists, the record is not modified and false is returned.
*/
virtual bool add(const char* kbuf, size_t ksiz, const char* vbuf, size_t vsiz) = 0;
/**
* Set the value of a record.
* @note Equal to the original DB::add method except that the parameters are std::string.
*/
virtual bool add(const std::string& key, const std::string& value) = 0;
/**
* Replace the value of a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param vbuf the pointer to the value region.
* @param vsiz the size of the value region.
* @return true on success, or false on failure.
* @note If no record corresponds to the key, no new record is created and false is returned.
* If the corresponding record exists, the value is modified.
*/
virtual bool replace(const char* kbuf, size_t ksiz, const char* vbuf, size_t vsiz) = 0;
/**
* Replace the value of a record.
* @note Equal to the original DB::replace method except that the parameters are std::string.
*/
virtual bool replace(const std::string& key, const std::string& value) = 0;
/**
* Append the value of a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param vbuf the pointer to the value region.
* @param vsiz the size of the value region.
* @return true on success, or false on failure.
* @note If no record corresponds to the key, a new record is created. If the corresponding
* record exists, the given value is appended at the end of the existing value.
*/
virtual bool append(const char* kbuf, size_t ksiz, const char* vbuf, size_t vsiz) = 0;
/**
* Set the value of a record.
* @note Equal to the original DB::append method except that the parameters are std::string.
*/
virtual bool append(const std::string& key, const std::string& value) = 0;
/**
* Add a number to the numeric integer value of a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param num the additional number.
* @param orig the origin number if no record corresponds to the key. If it is INT64MIN and
* no record corresponds, this function fails. If it is INT64MAX, the value is set as the
* additional number regardless of the current value.
* @return the result value, or kyotocabinet::INT64MIN on failure.
* @note The value is serialized as an 8-byte binary integer in big-endian order, not a decimal
* string. If existing value is not 8-byte, this function fails.
*/
virtual int64_t increment(const char* kbuf, size_t ksiz, int64_t num, int64_t orig = 0) = 0;
/**
* Add a number to the numeric integer value of a record.
* @note Equal to the original DB::increment method except that the parameter is std::string.
*/
virtual int64_t increment(const std::string& key, int64_t num, int64_t orig = 0) = 0;
/**
* Add a number to the numeric double value of a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param num the additional number.
* @param orig the origin number if no record corresponds to the key. If it is negative
* infinity and no record corresponds, this function fails. If it is positive infinity, the
* value is set as the additional number regardless of the current value.
* @return the result value, or Not-a-number on failure.
* @note The value is serialized as an 16-byte binary fixed-point number in big-endian order,
* not a decimal string. If existing value is not 16-byte, this function fails.
*/
virtual double increment_double(const char* kbuf, size_t ksiz, double num,
double orig = 0) = 0;
/**
* Add a number to the numeric double value of a record.
* @note Equal to the original DB::increment_double method except that the parameter is
* std::string.
*/
virtual double increment_double(const std::string& key, double num, double orig = 0) = 0;
/**
* Perform compare-and-swap.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param ovbuf the pointer to the old value region. NULL means that no record corresponds.
* @param ovsiz the size of the old value region.
* @param nvbuf the pointer to the new value region. NULL means that the record is removed.
* @param nvsiz the size of new old value region.
* @return true on success, or false on failure.
*/
virtual bool cas(const char* kbuf, size_t ksiz,
const char* ovbuf, size_t ovsiz, const char* nvbuf, size_t nvsiz) = 0;
/**
* Perform compare-and-swap.
* @note Equal to the original DB::cas method except that the parameters are std::string.
*/
virtual bool cas(const std::string& key,
const std::string& ovalue, const std::string& nvalue) = 0;
/**
* Remove a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @return true on success, or false on failure.
* @note If no record corresponds to the key, false is returned.
*/
virtual bool remove(const char* kbuf, size_t ksiz) = 0;
/**
* Remove a record.
* @note Equal to the original DB::remove method except that the parameter is std::string.
*/
virtual bool remove(const std::string& key) = 0;
/**
* Retrieve the value of a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param sp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @return the pointer to the value region of the corresponding record, or NULL on failure.
* @note If no record corresponds to the key, NULL is returned. Because an additional zero
* code is appended at the end of the region of the return value, the return value can be
* treated as a C-style string. Because the region of the return value is allocated with the
* the new[] operator, it should be released with the delete[] operator when it is no longer
* in use.
*/
virtual char* get(const char* kbuf, size_t ksiz, size_t* sp) = 0;
/**
* Retrieve the value of a record.
* @note Equal to the original DB::get method except that the first parameters is the key
* string and the second parameter is a string to contain the result and the return value is
* bool for success.
*/
virtual bool get(const std::string& key, std::string* value) = 0;
/**
* Retrieve the value of a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param vbuf the pointer to the buffer into which the value of the corresponding record is
* written.
* @param max the size of the buffer.
* @return the size of the value, or -1 on failure.
*/
virtual int32_t get(const char* kbuf, size_t ksiz, char* vbuf, size_t max) = 0;
/**
* Check the existence of a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @return the size of the value, or -1 on failure.
*/
virtual int32_t check(const char* kbuf, size_t ksiz) = 0;
/**
* Check the existence of a record.
* @note Equal to the original DB::check method except that the parameter is std::string.
*/
virtual int32_t check(const std::string& key) = 0;
/**
* Remove all records.
* @return true on success, or false on failure.
*/
virtual bool clear() = 0;
/**
* Get the number of records.
* @return the number of records, or -1 on failure.
*/
virtual int64_t count() = 0;
/**
* Create a cursor object.
* @return the return value is the created cursor object.
* @note Because the object of the return value is allocated by the constructor, it should be
* released with the delete operator when it is no longer in use.
*/
virtual Cursor* cursor() = 0;
};
/**
* Basic implementation of database.
* @note This class is an abstract class to prescribe the interface of file operations and
* provide mix-in methods. This class can be inherited but overwriting methods is forbidden.
* Before every database operation, it is necessary to call the BasicDB::open method in order to
* open a database file and connect the database object to it. To avoid data missing or
* corruption, it is important to close every database file by the BasicDB::close method when the
* database is no longer in use. It is forbidden for multible database objects in a process to
* open the same database at the same time. It is forbidden to share a database object with
* child processes.
*/
class BasicDB : public DB {
public:
class Cursor;
class Error;
class ProgressChecker;
class FileProcessor;
class Logger;
class MetaTrigger;
private:
/** The size of the IO buffer. */
static const size_t IOBUFSIZ = 8192;
public:
/**
* Database types.
*/
enum Type {
TYPEVOID = 0x00, ///< void database
TYPEPHASH = 0x10, ///< prototype hash database
TYPEPTREE = 0x11, ///< prototype tree database
TYPESTASH = 0x18, ///< stash database
TYPECACHE = 0x20, ///< cache hash database
TYPEGRASS = 0x21, ///< cache tree database
TYPEHASH = 0x30, ///< file hash database
TYPETREE = 0x31, ///< file tree database
TYPEDIR = 0x40, ///< directory hash database
TYPEFOREST = 0x41, ///< directory tree database
TYPETEXT = 0x50, ///< plain text database
TYPEMISC = 0x80 ///< miscellaneous database
};
/**
* Interface of cursor to indicate a record.
*/
class Cursor : public DB::Cursor {
public:
/**
* Destructor.
*/
virtual ~Cursor() {
_assert_(true);
}
/**
* Set the value of the current record.
* @param vbuf the pointer to the value region.
* @param vsiz the size of the value region.
* @param step true to move the cursor to the next record, or false for no move.
* @return true on success, or false on failure.
*/
bool set_value(const char* vbuf, size_t vsiz, bool step = false) {
_assert_(vbuf && vsiz <= MEMMAXSIZ);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(const char* vbuf, size_t vsiz) :
vbuf_(vbuf), vsiz_(vsiz), ok_(false) {}
bool ok() const {
return ok_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
ok_ = true;
*sp = vsiz_;
return vbuf_;
}
const char* vbuf_;
size_t vsiz_;
bool ok_;
};
VisitorImpl visitor(vbuf, vsiz);
if (!accept(&visitor, true, step)) return false;
if (!visitor.ok()) return false;
return true;
}
/**
* Set the value of the current record.
* @note Equal to the original Cursor::set_value method except that the parameter is
* std::string.
*/
bool set_value_str(const std::string& value, bool step = false) {
_assert_(true);
return set_value(value.c_str(), value.size(), step);
}
/**
* Remove the current record.
* @return true on success, or false on failure.
* @note If no record corresponds to the key, false is returned. The cursor is moved to the
* next record implicitly.
*/
bool remove() {
_assert_(true);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl() : ok_(false) {}
bool ok() const {
return ok_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
ok_ = true;
return REMOVE;
}
bool ok_;
};
VisitorImpl visitor;
if (!accept(&visitor, true, false)) return false;
if (!visitor.ok()) return false;
return true;
}
/**
* Get the key of the current record.
* @param sp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @param step true to move the cursor to the next record, or false for no move.
* @return the pointer to the key region of the current record, or NULL on failure.
* @note If the cursor is invalidated, NULL is returned. Because an additional zero
* code is appended at the end of the region of the return value, the return value can be
* treated as a C-style string. Because the region of the return value is allocated with the
* the new[] operator, it should be released with the delete[] operator when it is no longer
* in use.
*/
char* get_key(size_t* sp, bool step = false) {
_assert_(sp);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl() : kbuf_(NULL), ksiz_(0) {}
char* pop(size_t* sp) {
*sp = ksiz_;
return kbuf_;
}
void clear() {
delete[] kbuf_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
kbuf_ = new char[ksiz+1];
std::memcpy(kbuf_, kbuf, ksiz);
kbuf_[ksiz] = '\0';
ksiz_ = ksiz;
return NOP;
}
char* kbuf_;
size_t ksiz_;
};
VisitorImpl visitor;
if (!accept(&visitor, false, step)) {
visitor.clear();
*sp = 0;
return NULL;
}
size_t ksiz;
char* kbuf = visitor.pop(&ksiz);
if (!kbuf) {
*sp = 0;
return NULL;
}
*sp = ksiz;
return kbuf;
}
/**
* Get the key of the current record.
* @note Equal to the original Cursor::get_key method except that a parameter is a string to
* contain the result and the return value is bool for success.
*/
bool get_key(std::string* key, bool step = false) {
_assert_(key);
size_t ksiz;
char* kbuf = get_key(&ksiz, step);
if (!kbuf) return false;
key->clear();
key->append(kbuf, ksiz);
delete[] kbuf;
return true;
}
/**
* Get the value of the current record.
* @param sp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @param step true to move the cursor to the next record, or false for no move.
* @return the pointer to the value region of the current record, or NULL on failure.
* @note If the cursor is invalidated, NULL is returned. Because an additional zero
* code is appended at the end of the region of the return value, the return value can be
* treated as a C-style string. Because the region of the return value is allocated with the
* the new[] operator, it should be released with the delete[] operator when it is no longer
* in use.
*/
char* get_value(size_t* sp, bool step = false) {
_assert_(sp);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl() : vbuf_(NULL), vsiz_(0) {}
char* pop(size_t* sp) {
*sp = vsiz_;
return vbuf_;
}
void clear() {
delete[] vbuf_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
vbuf_ = new char[vsiz+1];
std::memcpy(vbuf_, vbuf, vsiz);
vbuf_[vsiz] = '\0';
vsiz_ = vsiz;
return NOP;
}
char* vbuf_;
size_t vsiz_;
};
VisitorImpl visitor;
if (!accept(&visitor, false, step)) {
visitor.clear();
*sp = 0;
return NULL;
}
size_t vsiz;
char* vbuf = visitor.pop(&vsiz);
if (!vbuf) {
*sp = 0;
return NULL;
}
*sp = vsiz;
return vbuf;
}
/**
* Get the value of the current record.
* @note Equal to the original Cursor::get_value method except that a parameter is a string
* to contain the result and the return value is bool for success.
*/
bool get_value(std::string* value, bool step = false) {
_assert_(value);
size_t vsiz;
char* vbuf = get_value(&vsiz, step);
if (!vbuf) return false;
value->clear();
value->append(vbuf, vsiz);
delete[] vbuf;
return true;
}
/**
* Get a pair of the key and the value of the current record.
* @param ksp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @param vbp the pointer to the variable into which the pointer to the value region is
* assigned.
* @param vsp the pointer to the variable into which the size of the value region is
* assigned.
* @param step true to move the cursor to the next record, or false for no move.
* @return the pointer to the key region, or NULL on failure.
* @note If the cursor is invalidated, NULL is returned. Because an additional zero code is
* appended at the end of each region of the key and the value, each region can be treated
* as a C-style string. The return value should be deleted explicitly by the caller with
* the detele[] operator.
*/
char* get(size_t* ksp, const char** vbp, size_t* vsp, bool step = false) {
_assert_(ksp && vbp && vsp);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl() : kbuf_(NULL), ksiz_(0), vbuf_(NULL), vsiz_(0) {}
char* pop(size_t* ksp, const char** vbp, size_t* vsp) {
*ksp = ksiz_;
*vbp = vbuf_;
*vsp = vsiz_;
return kbuf_;
}
void clear() {
delete[] kbuf_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
size_t rsiz = ksiz + 1 + vsiz + 1;
kbuf_ = new char[rsiz];
std::memcpy(kbuf_, kbuf, ksiz);
kbuf_[ksiz] = '\0';
ksiz_ = ksiz;
vbuf_ = kbuf_ + ksiz + 1;
std::memcpy(vbuf_, vbuf, vsiz);
vbuf_[vsiz] = '\0';
vsiz_ = vsiz;
return NOP;
}
char* kbuf_;
size_t ksiz_;
char* vbuf_;
size_t vsiz_;
};
VisitorImpl visitor;
if (!accept(&visitor, false, step)) {
visitor.clear();
*ksp = 0;
*vbp = NULL;
*vsp = 0;
return NULL;
}
return visitor.pop(ksp, vbp, vsp);
}
/**
* Get a pair of the key and the value of the current record.
* @note Equal to the original Cursor::get method except that parameters are strings
* to contain the result and the return value is bool for success.
*/
bool get(std::string* key, std::string* value, bool step = false) {
_assert_(key && value);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(std::string* key, std::string* value) :
key_(key), value_(value), ok_(false) {}
bool ok() {
return ok_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
key_->clear();
key_->append(kbuf, ksiz);
value_->clear();
value_->append(vbuf, vsiz);
ok_ = true;
return NOP;
}
std::string* key_;
std::string* value_;
bool ok_;
};
VisitorImpl visitor(key, value);
if (!accept(&visitor, false, step)) return false;
return visitor.ok();
}
/**
* Get a pair of the key and the value of the current record and remove it atomically.
* @param ksp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @param vbp the pointer to the variable into which the pointer to the value region is
* assigned.
* @param vsp the pointer to the variable into which the size of the value region is
* assigned.
* @return the pointer to the key region, or NULL on failure.
* @note If the cursor is invalidated, NULL is returned. Because an additional zero code is
* appended at the end of each region of the key and the value, each region can be treated
* as a C-style string. The return value should be deleted explicitly by the caller with
* the detele[] operator. The cursor is moved to the next record implicitly.
*/
char* seize(size_t* ksp, const char** vbp, size_t* vsp) {
_assert_(ksp && vbp && vsp);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl() : kbuf_(NULL), ksiz_(0), vbuf_(NULL), vsiz_(0) {}
char* pop(size_t* ksp, const char** vbp, size_t* vsp) {
*ksp = ksiz_;
*vbp = vbuf_;
*vsp = vsiz_;
return kbuf_;
}
void clear() {
delete[] kbuf_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
size_t rsiz = ksiz + 1 + vsiz + 1;
kbuf_ = new char[rsiz];
std::memcpy(kbuf_, kbuf, ksiz);
kbuf_[ksiz] = '\0';
ksiz_ = ksiz;
vbuf_ = kbuf_ + ksiz + 1;
std::memcpy(vbuf_, vbuf, vsiz);
vbuf_[vsiz] = '\0';
vsiz_ = vsiz;
return REMOVE;
}
char* kbuf_;
size_t ksiz_;
char* vbuf_;
size_t vsiz_;
};
VisitorImpl visitor;
if (!accept(&visitor, true, false)) {
visitor.clear();
*ksp = 0;
*vbp = NULL;
*vsp = 0;
return NULL;
}
return visitor.pop(ksp, vbp, vsp);
}
/**
* Get a pair of the key and the value of the current record and remove it atomically.
* @note Equal to the original Cursor::seize method except that parameters are strings
* to contain the result and the return value is bool for success.
*/
bool seize(std::string* key, std::string* value) {
_assert_(key && value);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(std::string* key, std::string* value) :
key_(key), value_(value), ok_(false) {}
bool ok() {
return ok_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
key_->clear();
key_->append(kbuf, ksiz);
value_->clear();
value_->append(vbuf, vsiz);
ok_ = true;
return REMOVE;
}
std::string* key_;
std::string* value_;
bool ok_;
};
VisitorImpl visitor(key, value);
if (!accept(&visitor, true, false)) return false;
return visitor.ok();
}
/**
* Get the database object.
* @return the database object.
*/
virtual BasicDB* db() = 0;
/**
* Get the last happened error.
* @return the last happened error.
*/
Error error() {
_assert_(true);
return db()->error();
}
};
/**
* Error data.
*/
class Error {
public:
/**
* Error codes.
*/
enum Code {
SUCCESS, ///< success
NOIMPL, ///< not implemented
INVALID, ///< invalid operation
NOREPOS, ///< no repository
NOPERM, ///< no permission
BROKEN, ///< broken file
DUPREC, ///< record duplication
NOREC, ///< no record
LOGIC, ///< logical inconsistency
SYSTEM, ///< system error
MISC = 15 ///< miscellaneous error
};
/**
* Default constructor.
*/
explicit Error() : code_(SUCCESS), message_("no error") {
_assert_(true);
}
/**
* Copy constructor.
* @param src the source object.
*/
Error(const Error& src) : code_(src.code_), message_(src.message_) {
_assert_(true);
}
/**
* Constructor.
* @param code an error code.
* @param message a supplement message.
*/
explicit Error(Code code, const char* message) : code_(code), message_(message) {
_assert_(message);
}
/**
* Destructor.
*/
~Error() {
_assert_(true);
}
/**
* Set the error information.
* @param code an error code.
* @param message a supplement message.
*/
void set(Code code, const char* message) {
_assert_(message);
code_ = code;
message_ = message;
}
/**
* Get the error code.
* @return the error code.
*/
Code code() const {
_assert_(true);
return code_;
}
/**
* Get the readable string of the code.
* @return the readable string of the code.
*/
const char* name() const {
_assert_(true);
return codename(code_);
}
/**
* Get the supplement message.
* @return the supplement message.
*/
const char* message() const {
_assert_(true);
return message_;
}
/**
* Get the readable string of an error code.
* @param code the error code.
* @return the readable string of the error code.
*/
static const char* codename(Code code) {
_assert_(true);
switch (code) {
case SUCCESS: return "success";
case NOIMPL: return "not implemented";
case INVALID: return "invalid operation";
case NOREPOS: return "no repository";
case NOPERM: return "no permission";
case BROKEN: return "broken file";
case DUPREC: return "record duplication";
case NOREC: return "no record";
case LOGIC: return "logical inconsistency";
case SYSTEM: return "system error";
default: break;
}
return "miscellaneous error";
}
/**
* Assignment operator from the self type.
* @param right the right operand.
* @return the reference to itself.
*/
Error& operator =(const Error& right) {
_assert_(true);
if (&right == this) return *this;
code_ = right.code_;
message_ = right.message_;
return *this;
}
/**
* Cast operator to integer.
* @return the error code.
*/
operator int32_t() const {
return code_;
}
private:
/** The error code. */
Code code_;
/** The supplement message. */
const char* message_;
};
/**
* Interface to check progress status of long process.
*/
class ProgressChecker {
public:
/**
* Destructor.
*/
virtual ~ProgressChecker() {
_assert_(true);
}
/**
* Check the progress status.
* @param name the name of the process.
* @param message a supplement message.
* @param curcnt the count of the current step of the progress, or -1 if not applicable.
* @param allcnt the estimation count of all steps of the progress, or -1 if not applicable.
* @return true to continue the process, or false to stop the process.
*/
virtual bool check(const char* name, const char* message,
int64_t curcnt, int64_t allcnt) = 0;
};
/**
* Interface to process the database file.
*/
class FileProcessor {
public:
/**
* Destructor.
*/
virtual ~FileProcessor() {
_assert_(true);
}
/**
* Process the database file.
* @param path the path of the database file.
* @param count the number of records. A negative value means omission.
* @param size the size of the available region. A negative value means omission.
* @return true on success, or false on failure.
*/
virtual bool process(const std::string& path, int64_t count, int64_t size) = 0;
};
/**
* Interface to log internal information and errors.
*/
class Logger {
public:
/**
* Event kinds.
*/
enum Kind {
DEBUG = 1 << 0, ///< debugging
INFO = 1 << 1, ///< normal information
WARN = 1 << 2, ///< warning
ERROR = 1 << 3 ///< error
};
/**
* Destructor.
*/
virtual ~Logger() {
_assert_(true);
}
/**
* Process a log message.
* @param file the file name of the program source code.
* @param line the line number of the program source code.
* @param func the function name of the program source code.
* @param kind the kind of the event. Logger::DEBUG for debugging, Logger::INFO for normal
* information, Logger::WARN for warning, and Logger::ERROR for fatal error.
* @param message the supplement message.
*/
virtual void log(const char* file, int32_t line, const char* func, Kind kind,
const char* message) = 0;
};
/**
* Interface to trigger meta database operations.
*/
class MetaTrigger {
public:
/**
* Event kinds.
*/
enum Kind {
OPEN, ///< opening
CLOSE, ///< closing
CLEAR, ///< clearing
ITERATE, ///< iteration
SYNCHRONIZE, ///< synchronization
OCCUPY, ///< occupation
BEGINTRAN, ///< beginning transaction
COMMITTRAN, ///< committing transaction
ABORTTRAN, ///< aborting transaction
MISC = 15 ///< miscellaneous operation
};
/**
* Destructor.
*/
virtual ~MetaTrigger() {
_assert_(true);
}
/**
* Trigger a meta database operation.
* @param kind the kind of the event. MetaTrigger::OPEN for opening, MetaTrigger::CLOSE for
* closing, MetaTrigger::CLEAR for clearing, MetaTrigger::ITERATE for iteration,
* MetaTrigger::SYNCHRONIZE for synchronization, MetaTrigger::OCCUPY for occupation,
* MetaTrigger::BEGINTRAN for beginning transaction, MetaTrigger::COMMITTRAN for committing
* transaction, MetaTrigger::ABORTTRAN for aborting transaction, and MetaTrigger::MISC for
* miscellaneous operations.
* @param message the supplement message.
*/
virtual void trigger(Kind kind, const char* message) = 0;
};
/**
* Open modes.
*/
enum OpenMode {
OREADER = 1 << 0, ///< open as a reader
OWRITER = 1 << 1, ///< open as a writer
OCREATE = 1 << 2, ///< writer creating
OTRUNCATE = 1 << 3, ///< writer truncating
OAUTOTRAN = 1 << 4, ///< auto transaction
OAUTOSYNC = 1 << 5, ///< auto synchronization
ONOLOCK = 1 << 6, ///< open without locking
OTRYLOCK = 1 << 7, ///< lock without blocking
ONOREPAIR = 1 << 8 ///< open without auto repair
};
/**
* Destructor.
* @note If the database is not closed, it is closed implicitly.
*/
virtual ~BasicDB() {
_assert_(true);
}
/**
* Get the last happened error.
* @return the last happened error.
*/
virtual Error error() const = 0;
/**
* Set the error information.
* @param file the file name of the program source code.
* @param line the line number of the program source code.
* @param func the function name of the program source code.
* @param code an error code.
* @param message a supplement message.
*/
virtual void set_error(const char* file, int32_t line, const char* func,
Error::Code code, const char* message) = 0;
/**
* Open a database file.
* @param path the path of a database file.
* @param mode the connection mode. BasicDB::OWRITER as a writer, BasicDB::OREADER as a
* reader. The following may be added to the writer mode by bitwise-or: BasicDB::OCREATE,
* which means it creates a new database if the file does not exist, BasicDB::OTRUNCATE, which
* means it creates a new database regardless if the file exists, BasicDB::OAUTOTRAN, which
* means each updating operation is performed in implicit transaction, BasicDB::OAUTOSYNC,
* which means each updating operation is followed by implicit synchronization with the file
* system. The following may be added to both of the reader mode and the writer mode by
* bitwise-or: BasicDB::ONOLOCK, which means it opens the database file without file locking,
* BasicDB::OTRYLOCK, which means locking is performed without blocking, File::ONOREPAIR, which
* means the database file is not repaired implicitly even if file destruction is detected.
* @return true on success, or false on failure.
* @note Every opened database must be closed by the BasicDB::close method when it is no longer
* in use. It is not allowed for two or more database objects in the same process to keep
* their connections to the same database file at the same time.
*/
virtual bool open(const std::string& path, uint32_t mode = OWRITER | OCREATE) = 0;
/**
* Close the database file.
* @return true on success, or false on failure.
*/
virtual bool close() = 0;
/**
* Accept a visitor to multiple records at once.
* @param keys specifies a string vector of the keys.
* @param visitor a visitor object.
* @param writable true for writable operation, or false for read-only operation.
* @return true on success, or false on failure.
* @note The operations for specified records are performed atomically and other threads
* accessing the same records are blocked. To avoid deadlock, any explicit database operation
* must not be performed in this function.
*/
virtual bool accept_bulk(const std::vector<std::string>& keys, Visitor* visitor,
bool writable = true) = 0;
/**
* Iterate to accept a visitor for each record.
* @param visitor a visitor object.
* @param writable true for writable operation, or false for read-only operation.
* @param checker a progress checker object. If it is NULL, no checking is performed.
* @return true on success, or false on failure.
* @note The whole iteration is performed atomically and other threads are blocked. To avoid
* deadlock, any explicit database operation must not be performed in this function.
*/
virtual bool iterate(Visitor *visitor, bool writable = true,
ProgressChecker* checker = NULL) = 0;
/**
* Scan each record in parallel.
* @param visitor a visitor object.
* @param thnum the number of worker threads.
* @param checker a progress checker object. If it is NULL, no checking is performed.
* @return true on success, or false on failure.
* @note This function is for reading records and not for updating ones. The return value of
* the visitor is just ignored. To avoid deadlock, any explicit database operation must not
* be performed in this function.
*/
virtual bool scan_parallel(Visitor *visitor, size_t thnum,
ProgressChecker* checker = NULL) = 0;
/**
* Synchronize updated contents with the file and the device.
* @param hard true for physical synchronization with the device, or false for logical
* synchronization with the file system.
* @param proc a postprocessor object. If it is NULL, no postprocessing is performed.
* @param checker a progress checker object. If it is NULL, no checking is performed.
* @return true on success, or false on failure.
* @note The operation of the postprocessor is performed atomically and other threads accessing
* the same record are blocked. To avoid deadlock, any explicit database operation must not
* be performed in this function.
*/
virtual bool synchronize(bool hard = false, FileProcessor* proc = NULL,
ProgressChecker* checker = NULL) = 0;
/**
* Occupy database by locking and do something meanwhile.
* @param writable true to use writer lock, or false to use reader lock.
* @param proc a processor object. If it is NULL, no processing is performed.
* @return true on success, or false on failure.
* @note The operation of the processor is performed atomically and other threads accessing
* the same record are blocked. To avoid deadlock, any explicit database operation must not
* be performed in this function.
*/
virtual bool occupy(bool writable = true, FileProcessor* proc = NULL) = 0;
/**
* Create a copy of the database file.
* @param dest the path of the destination file.
* @param checker a progress checker object. If it is NULL, no checking is performed.
* @return true on success, or false on failure.
*/
bool copy(const std::string& dest, ProgressChecker* checker = NULL) {
_assert_(true);
class FileProcessorImpl : public FileProcessor {
public:
explicit FileProcessorImpl(const std::string& dest, ProgressChecker* checker,
BasicDB* db) :
dest_(dest), checker_(checker), db_(db) {}
private:
bool process(const std::string& path, int64_t count, int64_t size) {
File::Status sbuf;
if (!File::status(path, &sbuf)) return false;
if (sbuf.isdir) {
if (!File::make_directory(dest_)) return false;
bool err = false;
DirStream dir;
if (dir.open(path)) {
if (checker_ && !checker_->check("copy", "beginning", 0, -1)) {
db_->set_error(_KCCODELINE_, Error::LOGIC, "checker failed");
err = true;
}
std::string name;
int64_t curcnt = 0;
while (!err && dir.read(&name)) {
const std::string& spath = path + File::PATHCHR + name;
const std::string& dpath = dest_ + File::PATHCHR + name;
int64_t dsiz;
char* dbuf = File::read_file(spath, &dsiz);
if (dbuf) {
if (!File::write_file(dpath, dbuf, dsiz)) err = true;
delete[] dbuf;
} else {
err = true;
}
curcnt++;
if (checker_ && !checker_->check("copy", "processing", curcnt, -1)) {
db_->set_error(_KCCODELINE_, Error::LOGIC, "checker failed");
err = true;
break;
}
}
if (checker_ && !checker_->check("copy", "ending", -1, -1)) {
db_->set_error(_KCCODELINE_, Error::LOGIC, "checker failed");
err = true;
}
if (!dir.close()) err = true;
} else {
err = true;
}
return !err;
}
std::ofstream ofs;
ofs.open(dest_.c_str(),
std::ios_base::out | std::ios_base::binary | std::ios_base::trunc);
if (!ofs) return false;
bool err = false;
std::ifstream ifs;
ifs.open(path.c_str(), std::ios_base::in | std::ios_base::binary);
if (checker_ && !checker_->check("copy", "beginning", 0, size)) {
db_->set_error(_KCCODELINE_, Error::LOGIC, "checker failed");
err = true;
}
if (ifs) {
char buf[IOBUFSIZ];
int64_t curcnt = 0;
while (!err && !ifs.eof()) {
size_t n = ifs.read(buf, sizeof(buf)).gcount();
if (n > 0) {
ofs.write(buf, n);
if (!ofs) {
err = true;
break;
}
}
curcnt += n;
if (checker_ && !checker_->check("copy", "processing", curcnt, size)) {
db_->set_error(_KCCODELINE_, Error::LOGIC, "checker failed");
err = true;
break;
}
}
ifs.close();
if (ifs.bad()) err = true;
} else {
err = true;
}
if (checker_ && !checker_->check("copy", "ending", -1, size)) {
db_->set_error(_KCCODELINE_, Error::LOGIC, "checker failed");
err = true;
}
ofs.close();
if (!ofs) err = true;
return !err;
}
const std::string& dest_;
ProgressChecker* checker_;
BasicDB* db_;
};
FileProcessorImpl proc(dest, checker, this);
return synchronize(false, &proc, checker);
}
/**
* Begin transaction.
* @param hard true for physical synchronization with the device, or false for logical
* synchronization with the file system.
* @return true on success, or false on failure.
*/
virtual bool begin_transaction(bool hard = false) = 0;
/**
* Try to begin transaction.
* @param hard true for physical synchronization with the device, or false for logical
* synchronization with the file system.
* @return true on success, or false on failure.
*/
virtual bool begin_transaction_try(bool hard = false) = 0;
/**
* End transaction.
* @param commit true to commit the transaction, or false to abort the transaction.
* @return true on success, or false on failure.
*/
virtual bool end_transaction(bool commit = true) = 0;
/**
* Get the size of the database file.
* @return the size of the database file in bytes, or -1 on failure.
*/
virtual int64_t size() = 0;
/**
* Get the path of the database file.
* @return the path of the database file, or an empty string on failure.
*/
virtual std::string path() = 0;
/**
* Get the miscellaneous status information.
* @param strmap a string map to contain the result.
* @return true on success, or false on failure.
*/
virtual bool status(std::map<std::string, std::string>* strmap) = 0;
/**
* Set the value of a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param vbuf the pointer to the value region.
* @param vsiz the size of the value region.
* @return true on success, or false on failure.
* @note If no record corresponds to the key, a new record is created. If the corresponding
* record exists, the value is overwritten.
*/
bool set(const char* kbuf, size_t ksiz, const char* vbuf, size_t vsiz) {
_assert_(kbuf && ksiz <= MEMMAXSIZ && vbuf && vsiz <= MEMMAXSIZ);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(const char* vbuf, size_t vsiz) : vbuf_(vbuf), vsiz_(vsiz) {}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
*sp = vsiz_;
return vbuf_;
}
const char* visit_empty(const char* kbuf, size_t ksiz, size_t* sp) {
*sp = vsiz_;
return vbuf_;
}
const char* vbuf_;
size_t vsiz_;
};
VisitorImpl visitor(vbuf, vsiz);
if (!accept(kbuf, ksiz, &visitor, true)) return false;
return true;
}
/**
* Set the value of a record.
* @note Equal to the original DB::set method except that the parameters are std::string.
*/
bool set(const std::string& key, const std::string& value) {
_assert_(true);
return set(key.c_str(), key.size(), value.c_str(), value.size());
}
/**
* Add a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param vbuf the pointer to the value region.
* @param vsiz the size of the value region.
* @return true on success, or false on failure.
* @note If no record corresponds to the key, a new record is created. If the corresponding
* record exists, the record is not modified and false is returned.
*/
bool add(const char* kbuf, size_t ksiz, const char* vbuf, size_t vsiz) {
_assert_(kbuf && ksiz <= MEMMAXSIZ && vbuf && vsiz <= MEMMAXSIZ);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(const char* vbuf, size_t vsiz) :
vbuf_(vbuf), vsiz_(vsiz), ok_(false) {}
bool ok() const {
return ok_;
}
private:
const char* visit_empty(const char* kbuf, size_t ksiz, size_t* sp) {
ok_ = true;
*sp = vsiz_;
return vbuf_;
}
const char* vbuf_;
size_t vsiz_;
bool ok_;
};
VisitorImpl visitor(vbuf, vsiz);
if (!accept(kbuf, ksiz, &visitor, true)) return false;
if (!visitor.ok()) {
set_error(_KCCODELINE_, Error::DUPREC, "record duplication");
return false;
}
return true;
}
/**
* Set the value of a record.
* @note Equal to the original DB::add method except that the parameters are std::string.
*/
bool add(const std::string& key, const std::string& value) {
_assert_(true);
return add(key.c_str(), key.size(), value.c_str(), value.size());
}
/**
* Replace the value of a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param vbuf the pointer to the value region.
* @param vsiz the size of the value region.
* @return true on success, or false on failure.
* @note If no record corresponds to the key, no new record is created and false is returned.
* If the corresponding record exists, the value is modified.
*/
bool replace(const char* kbuf, size_t ksiz, const char* vbuf, size_t vsiz) {
_assert_(kbuf && ksiz <= MEMMAXSIZ && vbuf && vsiz <= MEMMAXSIZ);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(const char* vbuf, size_t vsiz) :
vbuf_(vbuf), vsiz_(vsiz), ok_(false) {}
bool ok() const {
return ok_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
ok_ = true;
*sp = vsiz_;
return vbuf_;
}
const char* vbuf_;
size_t vsiz_;
bool ok_;
};
VisitorImpl visitor(vbuf, vsiz);
if (!accept(kbuf, ksiz, &visitor, true)) return false;
if (!visitor.ok()) {
set_error(_KCCODELINE_, Error::NOREC, "no record");
return false;
}
return true;
}
/**
* Replace the value of a record.
* @note Equal to the original DB::replace method except that the parameters are std::string.
*/
bool replace(const std::string& key, const std::string& value) {
_assert_(true);
return replace(key.c_str(), key.size(), value.c_str(), value.size());
}
/**
* Append the value of a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param vbuf the pointer to the value region.
* @param vsiz the size of the value region.
* @return true on success, or false on failure.
* @note If no record corresponds to the key, a new record is created. If the corresponding
* record exists, the given value is appended at the end of the existing value.
*/
bool append(const char* kbuf, size_t ksiz, const char* vbuf, size_t vsiz) {
_assert_(kbuf && ksiz <= MEMMAXSIZ && vbuf && vsiz <= MEMMAXSIZ);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(const char* vbuf, size_t vsiz) :
vbuf_(vbuf), vsiz_(vsiz), nbuf_(NULL) {}
~VisitorImpl() {
if (nbuf_) delete[] nbuf_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
size_t nsiz = vsiz + vsiz_;
nbuf_ = new char[nsiz];
std::memcpy(nbuf_, vbuf, vsiz);
std::memcpy(nbuf_ + vsiz, vbuf_, vsiz_);
*sp = nsiz;
return nbuf_;
}
const char* visit_empty(const char* kbuf, size_t ksiz, size_t* sp) {
*sp = vsiz_;
return vbuf_;
}
const char* vbuf_;
size_t vsiz_;
char* nbuf_;
};
VisitorImpl visitor(vbuf, vsiz);
if (!accept(kbuf, ksiz, &visitor, true)) return false;
return true;
}
/**
* Set the value of a record.
* @note Equal to the original DB::append method except that the parameters are std::string.
*/
bool append(const std::string& key, const std::string& value) {
_assert_(true);
return append(key.c_str(), key.size(), value.c_str(), value.size());
}
/**
* Add a number to the numeric value of a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param num the additional number.
* @param orig the origin number if no record corresponds to the key. If it is INT64MIN and
* no record corresponds, this function fails. If it is INT64MAX, the value is set as the
* additional number regardless of the current value.
* @return the result value, or kyotocabinet::INT64MIN on failure.
* @note The value is serialized as an 8-byte binary integer in big-endian order, not a decimal
* string. If existing value is not 8-byte, this function fails.
*/
int64_t increment(const char* kbuf, size_t ksiz, int64_t num, int64_t orig = 0) {
_assert_(kbuf && ksiz <= MEMMAXSIZ);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(int64_t num, int64_t orig) : num_(num), orig_(orig), big_(0) {}
int64_t num() {
return num_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
if (vsiz != sizeof(num_)) {
num_ = INT64MIN;
return NOP;
}
int64_t onum;
if (orig_ == INT64MAX) {
onum = 0;
} else {
std::memcpy(&onum, vbuf, vsiz);
onum = ntoh64(onum);
if (num_ == 0) {
num_ = onum;
return NOP;
}
}
num_ += onum;
big_ = hton64(num_);
*sp = sizeof(big_);
return (const char*)&big_;
}
const char* visit_empty(const char* kbuf, size_t ksiz, size_t* sp) {
if (orig_ == INT64MIN) {
num_ = INT64MIN;
return NOP;
}
if (orig_ != INT64MAX) num_ += orig_;
big_ = hton64(num_);
*sp = sizeof(big_);
return (const char*)&big_;
}
int64_t num_;
int64_t orig_;
uint64_t big_;
};
VisitorImpl visitor(num, orig);
if (!accept(kbuf, ksiz, &visitor, num != 0 || orig != INT64MIN)) return INT64MIN;
num = visitor.num();
if (num == INT64MIN) {
set_error(_KCCODELINE_, Error::LOGIC, "logical inconsistency");
return num;
}
return num;
}
/**
* Add a number to the numeric value of a record.
* @note Equal to the original DB::increment method except that the parameter is std::string.
*/
int64_t increment(const std::string& key, int64_t num, int64_t orig = 0) {
_assert_(true);
return increment(key.c_str(), key.size(), num, orig);
}
/**
* Add a number to the numeric double value of a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param num the additional number.
* @param orig the origin number if no record corresponds to the key. If it is negative
* infinity and no record corresponds, this function fails. If it is positive infinity, the
* value is set as the additional number regardless of the current value.
* @return the result value, or Not-a-number on failure.
* @note The value is serialized as an 16-byte binary fixed-point number in big-endian order,
* not a decimal string. If existing value is not 16-byte, this function fails.
*/
double increment_double(const char* kbuf, size_t ksiz, double num, double orig = 0) {
_assert_(kbuf && ksiz <= MEMMAXSIZ);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(double num, double orig) :
DECUNIT(1000000000000000LL), num_(num), orig_(orig), buf_() {}
double num() {
return num_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
if (vsiz != sizeof(buf_)) {
num_ = nan();
return NOP;
}
int64_t linteg, lfract;
if (chkinf(orig_) && orig_ >= 0) {
linteg = 0;
lfract = 0;
} else {
std::memcpy(&linteg, vbuf, sizeof(linteg));
linteg = ntoh64(linteg);
std::memcpy(&lfract, vbuf + sizeof(linteg), sizeof(lfract));
lfract = ntoh64(lfract);
}
if (lfract == INT64MIN && linteg == INT64MIN) {
num_ = nan();
return NOP;
} else if (linteg == INT64MAX) {
num_ = HUGE_VAL;
return NOP;
} else if (linteg == INT64MIN) {
num_ = -HUGE_VAL;
return NOP;
}
if (num_ == 0.0 && !(chkinf(orig_) && orig_ >= 0)) {
num_ = linteg + (double)lfract / DECUNIT;
return NOP;
}
long double dinteg;
long double dfract = std::modfl(num_, &dinteg);
if (chknan(dinteg)) {
linteg = INT64MIN;
lfract = INT64MIN;
num_ = nan();
} else if (chkinf(dinteg)) {
linteg = dinteg > 0 ? INT64MAX : INT64MIN;
lfract = 0;
num_ = dinteg;
} else {
linteg += (int64_t)dinteg;
lfract += (int64_t)(dfract * DECUNIT);
if (lfract >= DECUNIT) {
linteg += 1;
lfract -= DECUNIT;
}
num_ = linteg + (double)lfract / DECUNIT;
}
linteg = hton64(linteg);
std::memcpy(buf_, &linteg, sizeof(linteg));
lfract = hton64(lfract);
std::memcpy(buf_ + sizeof(linteg), &lfract, sizeof(lfract));
*sp = sizeof(buf_);
return buf_;
}
const char* visit_empty(const char* kbuf, size_t ksiz, size_t* sp) {
if (chknan(orig_) || (chkinf(orig_) && orig_ < 0)) {
num_ = nan();
return NOP;
}
if (!chkinf(orig_)) num_ += orig_;
long double dinteg;
long double dfract = std::modfl(num_, &dinteg);
int64_t linteg, lfract;
if (chknan(dinteg)) {
linteg = INT64MIN;
lfract = INT64MIN;
} else if (chkinf(dinteg)) {
linteg = dinteg > 0 ? INT64MAX : INT64MIN;
lfract = 0;
} else {
linteg = (int64_t)dinteg;
lfract = (int64_t)(dfract * DECUNIT);
}
linteg = hton64(linteg);
std::memcpy(buf_, &linteg, sizeof(linteg));
lfract = hton64(lfract);
std::memcpy(buf_ + sizeof(linteg), &lfract, sizeof(lfract));
*sp = sizeof(buf_);
return buf_;
}
const int64_t DECUNIT;
double num_;
double orig_;
char buf_[sizeof(int64_t)*2];
};
VisitorImpl visitor(num, orig);
if (!accept(kbuf, ksiz, &visitor, true)) return nan();
num = visitor.num();
if (chknan(num)) {
set_error(_KCCODELINE_, Error::LOGIC, "logical inconsistency");
return nan();
}
return num;
}
/**
* Add a number to the numeric double value of a record.
* @note Equal to the original DB::increment_double method except that the parameter is
* std::string.
*/
double increment_double(const std::string& key, double num, double orig) {
_assert_(true);
return increment_double(key.c_str(), key.size(), num, orig);
}
/**
* Perform compare-and-swap.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param ovbuf the pointer to the old value region. NULL means that no record corresponds.
* @param ovsiz the size of the old value region.
* @param nvbuf the pointer to the new value region. NULL means that the record is removed.
* @param nvsiz the size of new old value region.
* @return true on success, or false on failure.
*/
bool cas(const char* kbuf, size_t ksiz,
const char* ovbuf, size_t ovsiz, const char* nvbuf, size_t nvsiz) {
_assert_(kbuf && ksiz <= MEMMAXSIZ);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(const char* ovbuf, size_t ovsiz, const char* nvbuf, size_t nvsiz) :
ovbuf_(ovbuf), ovsiz_(ovsiz), nvbuf_(nvbuf), nvsiz_(nvsiz), ok_(false) {}
bool ok() const {
return ok_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
if (!ovbuf_ || vsiz != ovsiz_ || std::memcmp(vbuf, ovbuf_, vsiz)) return NOP;
ok_ = true;
if (!nvbuf_) return REMOVE;
*sp = nvsiz_;
return nvbuf_;
}
const char* visit_empty(const char* kbuf, size_t ksiz, size_t* sp) {
if (ovbuf_) return NOP;
ok_ = true;
if (!nvbuf_) return NOP;
*sp = nvsiz_;
return nvbuf_;
}
const char* ovbuf_;
size_t ovsiz_;
const char* nvbuf_;
size_t nvsiz_;
bool ok_;
};
VisitorImpl visitor(ovbuf, ovsiz, nvbuf, nvsiz);
if (!accept(kbuf, ksiz, &visitor, true)) return false;
if (!visitor.ok()) {
set_error(_KCCODELINE_, Error::LOGIC, "status conflict");
return false;
}
return true;
}
/**
* Perform compare-and-swap.
* @note Equal to the original DB::cas method except that the parameters are std::string.
*/
bool cas(const std::string& key,
const std::string& ovalue, const std::string& nvalue) {
_assert_(true);
return cas(key.c_str(), key.size(),
ovalue.c_str(), ovalue.size(), nvalue.c_str(), nvalue.size());
}
/**
* Remove a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @return true on success, or false on failure.
* @note If no record corresponds to the key, false is returned.
*/
bool remove(const char* kbuf, size_t ksiz) {
_assert_(kbuf && ksiz <= MEMMAXSIZ);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl() : ok_(false) {}
bool ok() const {
return ok_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
ok_ = true;
return REMOVE;
}
bool ok_;
};
VisitorImpl visitor;
if (!accept(kbuf, ksiz, &visitor, true)) return false;
if (!visitor.ok()) {
set_error(_KCCODELINE_, Error::NOREC, "no record");
return false;
}
return true;
}
/**
* Remove a record.
* @note Equal to the original DB::remove method except that the parameter is std::string.
*/
bool remove(const std::string& key) {
_assert_(true);
return remove(key.c_str(), key.size());
}
/**
* Retrieve the value of a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param sp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @return the pointer to the value region of the corresponding record, or NULL on failure.
* @note If no record corresponds to the key, NULL is returned. Because an additional zero
* code is appended at the end of the region of the return value, the return value can be
* treated as a C-style string. Because the region of the return value is allocated with the
* the new[] operator, it should be released with the delete[] operator when it is no longer
* in use.
*/
char* get(const char* kbuf, size_t ksiz, size_t* sp) {
_assert_(kbuf && ksiz <= MEMMAXSIZ && sp);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl() : vbuf_(NULL), vsiz_(0) {}
char* pop(size_t* sp) {
*sp = vsiz_;
return vbuf_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
vbuf_ = new char[vsiz+1];
std::memcpy(vbuf_, vbuf, vsiz);
vbuf_[vsiz] = '\0';
vsiz_ = vsiz;
return NOP;
}
char* vbuf_;
size_t vsiz_;
};
VisitorImpl visitor;
if (!accept(kbuf, ksiz, &visitor, false)) {
*sp = 0;
return NULL;
}
size_t vsiz;
char* vbuf = visitor.pop(&vsiz);
if (!vbuf) {
set_error(_KCCODELINE_, Error::NOREC, "no record");
*sp = 0;
return NULL;
}
*sp = vsiz;
return vbuf;
}
/**
* Retrieve the value of a record.
* @note Equal to the original DB::get method except that the first parameters is the key
* string and the second parameter is a string to contain the result and the return value is
* bool for success.
*/
bool get(const std::string& key, std::string* value) {
_assert_(value);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(std::string* value) : value_(value), ok_(false) {}
bool ok() {
return ok_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
value_->clear();
value_->append(vbuf, vsiz);
ok_ = true;
return NOP;
}
std::string* value_;
bool ok_;
};
VisitorImpl visitor(value);
if (!accept(key.data(), key.size(), &visitor, false)) return false;
if (!visitor.ok()) {
set_error(_KCCODELINE_, Error::NOREC, "no record");
return false;
}
return true;
}
/**
* Retrieve the value of a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param vbuf the pointer to the buffer into which the value of the corresponding record is
* written.
* @param max the size of the buffer.
* @return the size of the value, or -1 on failure.
*/
int32_t get(const char* kbuf, size_t ksiz, char* vbuf, size_t max) {
_assert_(kbuf && ksiz <= MEMMAXSIZ && vbuf);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(char* vbuf, size_t max) : vbuf_(vbuf), max_(max), vsiz_(-1) {}
int32_t vsiz() {
return vsiz_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
vsiz_ = vsiz;
size_t max = vsiz < max_ ? vsiz : max_;
std::memcpy(vbuf_, vbuf, max);
return NOP;
}
char* vbuf_;
size_t max_;
int32_t vsiz_;
};
VisitorImpl visitor(vbuf, max);
if (!accept(kbuf, ksiz, &visitor, false)) return -1;
int32_t vsiz = visitor.vsiz();
if (vsiz < 0) {
set_error(_KCCODELINE_, Error::NOREC, "no record");
return -1;
}
return vsiz;
}
/**
* Check the existence of a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @return the size of the value, or -1 on failure.
*/
int32_t check(const char* kbuf, size_t ksiz) {
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl() : vsiz_(-1) {}
int32_t vsiz() {
return vsiz_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
vsiz_ = vsiz;
return NOP;
}
size_t vsiz_;
};
VisitorImpl visitor;
if (!accept(kbuf, ksiz, &visitor, false)) return -1;
int32_t vsiz = visitor.vsiz();
if (vsiz < 0) {
set_error(_KCCODELINE_, Error::NOREC, "no record");
return -1;
}
return vsiz;
}
/**
* Check the existence of a record.
* @note Equal to the original DB::check method except that the parameter is std::string.
*/
int32_t check(const std::string& key) {
return check(key.data(), key.size());
}
/**
* Retrieve the value of a record and remove it atomically.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param sp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @return the pointer to the value region of the corresponding record, or NULL on failure.
* @note If no record corresponds to the key, NULL is returned. Because an additional zero
* code is appended at the end of the region of the return value, the return value can be
* treated as a C-style string. Because the region of the return value is allocated with the
* the new[] operator, it should be released with the delete[] operator when it is no longer
* in use.
*/
char* seize(const char* kbuf, size_t ksiz, size_t* sp) {
_assert_(kbuf && ksiz <= MEMMAXSIZ && sp);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl() : vbuf_(NULL), vsiz_(0) {}
char* pop(size_t* sp) {
*sp = vsiz_;
return vbuf_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
vbuf_ = new char[vsiz+1];
std::memcpy(vbuf_, vbuf, vsiz);
vbuf_[vsiz] = '\0';
vsiz_ = vsiz;
return REMOVE;
}
char* vbuf_;
size_t vsiz_;
};
VisitorImpl visitor;
if (!accept(kbuf, ksiz, &visitor, true)) {
*sp = 0;
return NULL;
}
size_t vsiz;
char* vbuf = visitor.pop(&vsiz);
if (!vbuf) {
set_error(_KCCODELINE_, Error::NOREC, "no record");
*sp = 0;
return NULL;
}
*sp = vsiz;
return vbuf;
}
/**
* Retrieve the value of a record and remove it atomically.
* @note Equal to the original DB::seize method except that the first parameters is the key
* string and the second parameter is a string to contain the result and the return value is
* bool for success.
*/
bool seize(const std::string& key, std::string* value) {
_assert_(value);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(std::string* value) : value_(value), ok_(false) {}
bool ok() {
return ok_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
value_->clear();
value_->append(vbuf, vsiz);
ok_ = true;
return REMOVE;
}
std::string* value_;
bool ok_;
};
VisitorImpl visitor(value);
if (!accept(key.data(), key.size(), &visitor, true)) return false;
if (!visitor.ok()) {
set_error(_KCCODELINE_, Error::NOREC, "no record");
return false;
}
return true;
}
/**
* Store records at once.
* @param recs the records to store.
* @param atomic true to perform all operations atomically, or false for non-atomic operations.
* @return the number of stored records, or -1 on failure.
*/
int64_t set_bulk(const std::map<std::string, std::string>& recs, bool atomic = true) {
_assert_(true);
if (atomic) {
std::vector<std::string> keys;
keys.reserve(recs.size());
std::map<std::string, std::string>::const_iterator rit = recs.begin();
std::map<std::string, std::string>::const_iterator ritend = recs.end();
while (rit != ritend) {
keys.push_back(rit->first);
++rit;
}
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(const std::map<std::string, std::string>& recs) : recs_(recs) {}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
std::map<std::string, std::string>::const_iterator rit =
recs_.find(std::string(kbuf, ksiz));
if (rit == recs_.end()) return NOP;
*sp = rit->second.size();
return rit->second.data();
}
const char* visit_empty(const char* kbuf, size_t ksiz, size_t* sp) {
std::map<std::string, std::string>::const_iterator rit =
recs_.find(std::string(kbuf, ksiz));
if (rit == recs_.end()) return NOP;
*sp = rit->second.size();
return rit->second.data();
}
const std::map<std::string, std::string>& recs_;
};
VisitorImpl visitor(recs);
if (!accept_bulk(keys, &visitor, true)) return -1;
return keys.size();
}
std::map<std::string, std::string>::const_iterator rit = recs.begin();
std::map<std::string, std::string>::const_iterator ritend = recs.end();
while (rit != ritend) {
if (!set(rit->first.data(), rit->first.size(), rit->second.data(), rit->second.size()))
return -1;
++rit;
}
return recs.size();
}
/**
* Remove records at once.
* @param keys the keys of the records to remove.
* @param atomic true to perform all operations atomically, or false for non-atomic operations.
* @return the number of removed records, or -1 on failure.
*/
int64_t remove_bulk(const std::vector<std::string>& keys, bool atomic = true) {
_assert_(true);
if (atomic) {
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl() : cnt_(0) {}
int64_t cnt() const {
return cnt_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
cnt_++;
return REMOVE;
}
int64_t cnt_;
};
VisitorImpl visitor;
if (!accept_bulk(keys, &visitor, true)) return -1;
return visitor.cnt();
}
int64_t cnt = 0;
std::vector<std::string>::const_iterator kit = keys.begin();
std::vector<std::string>::const_iterator kitend = keys.end();
while (kit != kitend) {
if (remove(kit->data(), kit->size())) {
cnt++;
} else if (error() != Error::NOREC) {
return -1;
}
++kit;
}
return cnt;
}
/**
* Retrieve records at once.
* @param keys the keys of the records to retrieve.
* @param recs a string map to contain the retrieved records.
* @param atomic true to perform all operations atomically, or false for non-atomic operations.
* @return the number of retrieved records, or -1 on failure.
*/
int64_t get_bulk(const std::vector<std::string>& keys,
std::map<std::string, std::string>* recs, bool atomic = true) {
_assert_(recs);
if (atomic) {
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(std::map<std::string, std::string>* recs) : recs_(recs) {}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
(*recs_)[std::string(kbuf, ksiz)] = std::string(vbuf, vsiz);
return NOP;
}
std::map<std::string, std::string>* recs_;
};
VisitorImpl visitor(recs);
if (!accept_bulk(keys, &visitor, false)) return -1;
return recs->size();
}
std::vector<std::string>::const_iterator kit = keys.begin();
std::vector<std::string>::const_iterator kitend = keys.end();
while (kit != kitend) {
size_t vsiz;
const char* vbuf = get(kit->data(), kit->size(), &vsiz);
if (vbuf) {
(*recs)[*kit] = std::string(vbuf, vsiz);
delete[] vbuf;
} else if (error() != Error::NOREC) {
return -1;
}
++kit;
}
return recs->size();
}
/**
* Dump records into a data stream.
* @param dest the destination stream.
* @param checker a progress checker object. If it is NULL, no checking is performed.
* @return true on success, or false on failure.
*/
bool dump_snapshot(std::ostream* dest, ProgressChecker* checker = NULL) {
_assert_(dest);
if (dest->fail()) {
set_error(_KCCODELINE_, Error::INVALID, "invalid stream");
return false;
}
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(std::ostream* dest) : dest_(dest), stack_() {}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
char* wp = stack_;
*(wp++) = 0x00;
wp += writevarnum(wp, ksiz);
wp += writevarnum(wp, vsiz);
dest_->write(stack_, wp - stack_);
dest_->write(kbuf, ksiz);
dest_->write(vbuf, vsiz);
return NOP;
}
std::ostream* dest_;
char stack_[NUMBUFSIZ*2];
};
VisitorImpl visitor(dest);
bool err = false;
dest->write(KCDBSSMAGICDATA, sizeof(KCDBSSMAGICDATA));
if (iterate(&visitor, false, checker)) {
unsigned char c = 0xff;
dest->write((char*)&c, 1);
if (dest->fail()) {
set_error(_KCCODELINE_, Error::SYSTEM, "stream output error");
err = true;
}
} else {
err = true;
}
return !err;
}
/**
* Dump records into a file.
* @param dest the path of the destination file.
* @param checker a progress checker object. If it is NULL, no checking is performed.
* @return true on success, or false on failure.
*/
bool dump_snapshot(const std::string& dest, ProgressChecker* checker = NULL) {
_assert_(true);
std::ofstream ofs;
ofs.open(dest.c_str(), std::ios_base::out | std::ios_base::binary | std::ios_base::trunc);
if (!ofs) {
set_error(_KCCODELINE_, Error::NOREPOS, "open failed");
return false;
}
bool err = false;
if (!dump_snapshot(&ofs, checker)) err = true;
ofs.close();
if (!ofs) {
set_error(_KCCODELINE_, Error::SYSTEM, "close failed");
err = true;
}
return !err;
}
/**
* Load records from a data stream.
* @param src the source stream.
* @param checker a progress checker object. If it is NULL, no checking is performed.
* @return true on success, or false on failure.
*/
bool load_snapshot(std::istream* src, ProgressChecker* checker = NULL) {
_assert_(src);
if (src->fail()) {
set_error(_KCCODELINE_, Error::INVALID, "invalid stream");
return false;
}
char buf[IOBUFSIZ];
src->read(buf, sizeof(KCDBSSMAGICDATA));
if (src->fail()) {
set_error(_KCCODELINE_, Error::SYSTEM, "stream input error");
return false;
}
if (std::memcmp(buf, KCDBSSMAGICDATA, sizeof(KCDBSSMAGICDATA))) {
set_error(_KCCODELINE_, Error::INVALID, "invalid magic data of input stream");
return false;
}
bool err = false;
if (checker && !checker->check("load_snapshot", "beginning", 0, -1)) {
set_error(_KCCODELINE_, Error::LOGIC, "checker failed");
err = true;
}
int64_t curcnt = 0;
while (!err) {
int32_t c = src->get();
if (src->fail()) {
set_error(_KCCODELINE_, Error::SYSTEM, "stream input error");
err = true;
break;
}
if (c == 0xff) break;
if (c == 0x00) {
size_t ksiz = 0;
do {
c = src->get();
ksiz = (ksiz << 7) + (c & 0x7f);
} while (c >= 0x80);
size_t vsiz = 0;
do {
c = src->get();
vsiz = (vsiz << 7) + (c & 0x7f);
} while (c >= 0x80);
size_t rsiz = ksiz + vsiz;
char* rbuf = rsiz > sizeof(buf) ? new char[rsiz] : buf;
src->read(rbuf, ksiz + vsiz);
if (src->fail()) {
set_error(_KCCODELINE_, Error::SYSTEM, "stream input error");
err = true;
if (rbuf != buf) delete[] rbuf;
break;
}
if (!set(rbuf, ksiz, rbuf + ksiz, vsiz)) {
err = true;
if (rbuf != buf) delete[] rbuf;
break;
}
if (rbuf != buf) delete[] rbuf;
} else {
set_error(_KCCODELINE_, Error::INVALID, "invalid magic data of input stream");
err = true;
break;
}
curcnt++;
if (checker && !checker->check("load_snapshot", "processing", curcnt, -1)) {
set_error(_KCCODELINE_, Error::LOGIC, "checker failed");
err = true;
break;
}
}
if (checker && !checker->check("load_snapshot", "ending", -1, -1)) {
set_error(_KCCODELINE_, Error::LOGIC, "checker failed");
err = true;
}
return !err;
}
/**
* Load records from a file.
* @param src the path of the source file.
* @param checker a progress checker object. If it is NULL, no checking is performed.
* @return true on success, or false on failure.
*/
bool load_snapshot(const std::string& src, ProgressChecker* checker = NULL) {
_assert_(true);
std::ifstream ifs;
ifs.open(src.c_str(), std::ios_base::in | std::ios_base::binary);
if (!ifs) {
set_error(_KCCODELINE_, Error::NOREPOS, "open failed");
return false;
}
bool err = false;
if (!load_snapshot(&ifs, checker)) err = true;
ifs.close();
if (ifs.bad()) {
set_error(_KCCODELINE_, Error::SYSTEM, "close failed");
return false;
}
return !err;
}
/**
* Create a cursor object.
* @return the return value is the created cursor object.
* @note Because the object of the return value is allocated by the constructor, it should be
* released with the delete operator when it is no longer in use.
*/
virtual Cursor* cursor() = 0;
/**
* Write a log message.
* @param file the file name of the program source code.
* @param line the line number of the program source code.
* @param func the function name of the program source code.
* @param kind the kind of the event. Logger::DEBUG for debugging, Logger::INFO for normal
* information, Logger::WARN for warning, and Logger::ERROR for fatal error.
* @param message the supplement message.
*/
virtual void log(const char* file, int32_t line, const char* func, Logger::Kind kind,
const char* message) = 0;
/**
* Set the internal logger.
* @param logger the logger object.
* @param kinds kinds of logged messages by bitwise-or: Logger::DEBUG for debugging,
* Logger::INFO for normal information, Logger::WARN for warning, and Logger::ERROR for fatal
* error.
* @return true on success, or false on failure.
*/
virtual bool tune_logger(Logger* logger, uint32_t kinds = Logger::WARN | Logger::ERROR) = 0;
/**
* Set the internal meta operation trigger.
* @param trigger the trigger object.
* @return true on success, or false on failure.
*/
virtual bool tune_meta_trigger(MetaTrigger* trigger) = 0;
/**
* Get the class name of a database type.
* @param type the database type.
* @return the string of the type name.
*/
static const char* typecname(uint32_t type) {
_assert_(true);
switch (type) {
case TYPEVOID: return "void";
case TYPEPHASH: return "ProtoHashDB";
case TYPEPTREE: return "ProtoTreeDB";
case TYPESTASH: return "StashDB";
case TYPECACHE: return "CacheDB";
case TYPEGRASS: return "GrassDB";
case TYPEHASH: return "HashDB";
case TYPETREE: return "TreeDB";
case TYPEDIR: return "DirDB";
case TYPEFOREST: return "ForestDB";
case TYPEMISC: return "misc";
}
return "unknown";
}
/**
* Get the description string of a database type.
* @param type the database type.
* @return the string of the type name.
*/
static const char* typestring(uint32_t type) {
_assert_(true);
switch (type) {
case TYPEVOID: return "void";
case TYPEPHASH: return "prototype hash database";
case TYPEPTREE: return "prototype tree database";
case TYPESTASH: return "stash database";
case TYPECACHE: return "cache hash database";
case TYPEGRASS: return "cache tree database";
case TYPEHASH: return "file hash database";
case TYPETREE: return "file tree database";
case TYPEDIR: return "directory hash database";
case TYPEFOREST: return "directory tree database";
case TYPEMISC: return "miscellaneous database";
}
return "unknown";
}
};
} // common namespace
#endif // duplication check
// END OF FILE
|