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
|
// -------------------------------------------------------------------
//
// bitcask: Eric Brewer-inspired key/value store
//
// Copyright (c) 2010 Basho Technologies, Inc. All Rights Reserved.
//
// This file is provided to you 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.
//
// -------------------------------------------------------------------
#include <errno.h>
#include <fcntl.h>
#include <unistd.h>
#include <sys/stat.h>
#include <stdint.h>
#include "erl_nif.h"
#include "erl_driver.h"
#include "erl_nif_compat.h"
#include "erl_nif_util.h"
#include "khash.h"
#include "murmurhash.h"
#include <stdio.h>
#ifdef BITCASK_DEBUG
#include <stdio.h>
#include <stdarg.h>
void DEBUG(const char *fmt, ...)
{
va_list ap;
va_start(ap, fmt);
vfprintf(stderr, fmt, ap);
va_end(ap);
}
#else
# define DEBUG(X, ...) {}
#endif
#ifdef PULSE
#include "pulse_c_send.h"
#endif
static ErlNifResourceType* bitcask_keydir_RESOURCE;
static ErlNifResourceType* bitcask_lock_RESOURCE;
static ErlNifResourceType* bitcask_file_RESOURCE;
typedef struct
{
int fd;
} bitcask_file_handle;
typedef struct
{
uint32_t file_id;
uint32_t total_sz;
uint64_t offset;
uint32_t tstamp;
uint32_t newest_put;
uint16_t key_sz;
char key[0];
} bitcask_keydir_entry;
static khint_t keydir_entry_hash(bitcask_keydir_entry* entry);
static khint_t keydir_entry_equal(bitcask_keydir_entry* lhs,
bitcask_keydir_entry* rhs);
KHASH_INIT(entries, bitcask_keydir_entry*, char, 0, keydir_entry_hash, keydir_entry_equal);
typedef struct
{
uint32_t file_id;
uint64_t live_keys; // number of 'live' keys in entries and pending
uint64_t live_bytes; // number of 'live' bytes
uint64_t total_keys; // total number of keys written to file
uint64_t total_bytes; // total number of bytes written to file
uint32_t oldest_tstamp; // oldest observed tstamp in a file
uint32_t newest_tstamp; // newest observed tstamp in a file
} bitcask_fstats_entry;
KHASH_MAP_INIT_INT(fstats, bitcask_fstats_entry*);
typedef khash_t(entries) entries_hash_t;
typedef khash_t(fstats) fstats_hash_t;
typedef struct
{
entries_hash_t* entries;
entries_hash_t* pending; // pending keydir entries during keydir folding
fstats_hash_t* fstats;
size_t key_count;
size_t key_bytes;
uint32_t biggest_file_id;
unsigned int refcount;
unsigned int keyfolders;
uint64_t iter_generation;
uint64_t pending_updated;
uint64_t pending_start; // os:timestamp() as 64-bit integer
ErlNifPid* pending_awaken; // processes to wake once pending merged into entries
unsigned int pending_awaken_count;
unsigned int pending_awaken_size;
ErlNifMutex* mutex;
char is_ready;
char name[0];
} bitcask_keydir;
typedef struct
{
bitcask_keydir* keydir;
int iterating;
khiter_t iterator;
} bitcask_keydir_handle;
typedef struct
{
int fd;
int is_write_lock;
char filename[0];
} bitcask_lock_handle;
KHASH_INIT(global_keydirs, char*, bitcask_keydir*, 1, kh_str_hash_func, kh_str_hash_equal);
typedef struct
{
khash_t(global_keydirs)* global_keydirs;
ErlNifMutex* global_keydirs_lock;
} bitcask_priv_data;
#define kh_put2(name, h, k, v) { \
int itr_status; \
khiter_t itr = kh_put(name, h, k, &itr_status); \
kh_val(h, itr) = v; } \
#define kh_put_set(name, h, k) { \
int itr_status; \
kh_put(name, h, k, &itr_status); }
// Handle lock helper functions
#define LOCK(keydir) { if (keydir->mutex) enif_mutex_lock(keydir->mutex); }
#define UNLOCK(keydir) { if (keydir->mutex) enif_mutex_unlock(keydir->mutex); }
// Pending tombstones
#define is_pending_tombstone(e) ((e)->tstamp == 0 && \
(e)->offset == 0)
#define set_pending_tombstone(e) {(e)->tstamp = 0; \
(e)->offset = 0; }
// Atoms (initialized in on_load)
static ERL_NIF_TERM ATOM_ALLOCATION_ERROR;
static ERL_NIF_TERM ATOM_ALREADY_EXISTS;
static ERL_NIF_TERM ATOM_BITCASK_ENTRY;
static ERL_NIF_TERM ATOM_ERROR;
static ERL_NIF_TERM ATOM_FALSE;
static ERL_NIF_TERM ATOM_FSTAT_ERROR;
static ERL_NIF_TERM ATOM_FTRUNCATE_ERROR;
static ERL_NIF_TERM ATOM_GETFL_ERROR;
static ERL_NIF_TERM ATOM_ILT_CREATE_ERROR; /* Iteration lock thread creation error */
static ERL_NIF_TERM ATOM_ITERATION_IN_PROCESS;
static ERL_NIF_TERM ATOM_ITERATION_NOT_PERMITTED;
static ERL_NIF_TERM ATOM_ITERATION_NOT_STARTED;
static ERL_NIF_TERM ATOM_LOCK_NOT_WRITABLE;
static ERL_NIF_TERM ATOM_NOT_FOUND;
static ERL_NIF_TERM ATOM_NOT_READY;
static ERL_NIF_TERM ATOM_OK;
static ERL_NIF_TERM ATOM_OUT_OF_DATE;
static ERL_NIF_TERM ATOM_PREAD_ERROR;
static ERL_NIF_TERM ATOM_PWRITE_ERROR;
static ERL_NIF_TERM ATOM_READY;
static ERL_NIF_TERM ATOM_SETFL_ERROR;
static ERL_NIF_TERM ATOM_TRUE;
static ERL_NIF_TERM ATOM_EOF;
static ERL_NIF_TERM ATOM_CREATE;
static ERL_NIF_TERM ATOM_READONLY;
static ERL_NIF_TERM ATOM_O_SYNC;
// Prototypes
ERL_NIF_TERM bitcask_nifs_keydir_new0(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_keydir_new1(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_keydir_mark_ready(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_keydir_get_int(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_keydir_put_int(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_keydir_remove(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_keydir_copy(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_keydir_itr(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_keydir_itr_next(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_keydir_itr_release(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_keydir_info(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_keydir_release(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_keydir_trim_fstats(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_increment_file_id(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_create_tmp_file(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_lock_acquire(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_lock_release(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_lock_readdata(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_lock_writedata(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_file_open(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_file_close(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_file_sync(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_file_pread(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_file_pwrite(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_file_read(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_file_write(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_file_position(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM bitcask_nifs_file_seekbof(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
ERL_NIF_TERM errno_atom(ErlNifEnv* env, int error);
ERL_NIF_TERM errno_error_tuple(ErlNifEnv* env, ERL_NIF_TERM key, int error);
static void merge_pending_entries(ErlNifEnv* env, bitcask_keydir* keydir);
static void lock_release(bitcask_lock_handle* handle);
static void bitcask_nifs_keydir_resource_cleanup(ErlNifEnv* env, void* arg);
static void bitcask_nifs_file_resource_cleanup(ErlNifEnv* env, void* arg);
static ErlNifFunc nif_funcs[] =
{
#ifdef PULSE
{"set_pulse_pid", 1, set_pulse_pid},
#endif
{"keydir_new", 0, bitcask_nifs_keydir_new0},
{"keydir_new", 1, bitcask_nifs_keydir_new1},
{"keydir_mark_ready", 1, bitcask_nifs_keydir_mark_ready},
{"keydir_put_int", 9, bitcask_nifs_keydir_put_int},
{"keydir_get_int", 2, bitcask_nifs_keydir_get_int},
{"keydir_remove", 2, bitcask_nifs_keydir_remove},
{"keydir_remove_int", 5, bitcask_nifs_keydir_remove},
{"keydir_copy", 1, bitcask_nifs_keydir_copy},
{"keydir_itr_int", 4, bitcask_nifs_keydir_itr},
{"keydir_itr_next_int", 1, bitcask_nifs_keydir_itr_next},
{"keydir_itr_release", 1, bitcask_nifs_keydir_itr_release},
{"keydir_info", 1, bitcask_nifs_keydir_info},
{"keydir_release", 1, bitcask_nifs_keydir_release},
{"keydir_trim_fstats", 2, bitcask_nifs_keydir_trim_fstats},
{"increment_file_id", 1, bitcask_nifs_increment_file_id},
{"lock_acquire_int", 2, bitcask_nifs_lock_acquire},
{"lock_release_int", 1, bitcask_nifs_lock_release},
{"lock_readdata_int", 1, bitcask_nifs_lock_readdata},
{"lock_writedata_int", 2, bitcask_nifs_lock_writedata},
{"file_open_int", 2, bitcask_nifs_file_open},
{"file_close_int", 1, bitcask_nifs_file_close},
{"file_sync_int", 1, bitcask_nifs_file_sync},
{"file_pread_int", 3, bitcask_nifs_file_pread},
{"file_pwrite_int", 3, bitcask_nifs_file_pwrite},
{"file_read_int", 2, bitcask_nifs_file_read},
{"file_write_int", 2, bitcask_nifs_file_write},
{"file_position_int", 2, bitcask_nifs_file_position},
{"file_seekbof_int", 1, bitcask_nifs_file_seekbof}
};
ERL_NIF_TERM bitcask_nifs_keydir_new0(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
// First, setup a resource for our handle
bitcask_keydir_handle* handle = enif_alloc_resource_compat(env,
bitcask_keydir_RESOURCE,
sizeof(bitcask_keydir_handle));
memset(handle, '\0', sizeof(bitcask_keydir_handle));
// Now allocate the actual keydir instance. Because it's unnamed/shared, we'll
// leave the name and lock portions null'd out
bitcask_keydir* keydir = enif_alloc_compat(env, sizeof(bitcask_keydir));
memset(keydir, '\0', sizeof(bitcask_keydir));
keydir->entries = kh_init(entries);
keydir->fstats = kh_init(fstats);
// Assign the keydir to our handle and hand it back
handle->keydir = keydir;
ERL_NIF_TERM result = enif_make_resource(env, handle);
enif_release_resource_compat(env, handle);
return enif_make_tuple2(env, ATOM_OK, result);
}
ERL_NIF_TERM bitcask_nifs_keydir_new1(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
char name[4096];
size_t name_sz;
if (enif_get_string(env, argv[0], name, sizeof(name), ERL_NIF_LATIN1))
{
name_sz = strlen(name);
// Get our private stash and check the global hash table for this entry
bitcask_priv_data* priv = (bitcask_priv_data*)enif_priv_data(env);
enif_mutex_lock(priv->global_keydirs_lock);
bitcask_keydir* keydir;
khiter_t itr = kh_get(global_keydirs, priv->global_keydirs, name);
if (itr != kh_end(priv->global_keydirs))
{
keydir = kh_val(priv->global_keydirs, itr);
// Existing keydir is available. Check the is_ready flag to determine if
// the original creator is ready for other processes to use it.
if (!keydir->is_ready)
{
// Notify the caller that while the requested keydir exists, it's not
// ready for public usage.
enif_mutex_unlock(priv->global_keydirs_lock);
return enif_make_tuple2(env, ATOM_ERROR, ATOM_NOT_READY);
}
else
{
keydir->refcount++;
}
}
else
{
// No such keydir, create a new one and add to the globals list. Make sure
// to allocate enough room for the name.
keydir = enif_alloc_compat(env, sizeof(bitcask_keydir) + name_sz + 1);
memset(keydir, '\0', sizeof(bitcask_keydir) + name_sz + 1);
strncpy(keydir->name, name, name_sz + 1);
// Initialize hash tables
keydir->entries = kh_init(entries);
keydir->fstats = kh_init(fstats);
// Be sure to initialize the mutex and set our refcount
keydir->mutex = enif_mutex_create(name);
keydir->refcount = 1;
// Finally, register this new keydir in the globals
kh_put2(global_keydirs, priv->global_keydirs, keydir->name, keydir);
}
enif_mutex_unlock(priv->global_keydirs_lock);
// Setup a resource for the handle
bitcask_keydir_handle* handle = enif_alloc_resource_compat(env,
bitcask_keydir_RESOURCE,
sizeof(bitcask_keydir_handle));
memset(handle, '\0', sizeof(bitcask_keydir_handle));
handle->keydir = keydir;
ERL_NIF_TERM result = enif_make_resource(env, handle);
enif_release_resource_compat(env, handle);
// Return to the caller a tuple with the reference and an atom
// indicating if the keydir is ready or not.
ERL_NIF_TERM is_ready_atom = keydir->is_ready ? ATOM_READY : ATOM_NOT_READY;
return enif_make_tuple2(env, is_ready_atom, result);
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_keydir_mark_ready(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_keydir_handle* handle;
if (enif_get_resource(env, argv[0], bitcask_keydir_RESOURCE, (void**)&handle))
{
bitcask_keydir* keydir = handle->keydir;
LOCK(keydir);
keydir->is_ready = 1;
UNLOCK(keydir);
return ATOM_OK;
}
else
{
return enif_make_badarg(env);
}
}
static void update_fstats(ErlNifEnv* env, bitcask_keydir* keydir,
uint32_t file_id, uint32_t tstamp,
int32_t live_increment, int32_t total_increment,
int32_t live_bytes_increment, int32_t total_bytes_increment)
{
bitcask_fstats_entry* entry = 0;
khiter_t itr = kh_get(fstats, keydir->fstats, file_id);
if (itr == kh_end(keydir->fstats))
{
// Need to initialize new entry and add to the table
entry = enif_alloc_compat(env, sizeof(bitcask_fstats_entry));
memset(entry, '\0', sizeof(bitcask_fstats_entry));
entry->file_id = file_id;
kh_put2(fstats, keydir->fstats, file_id, entry);
}
else
{
entry = kh_val(keydir->fstats, itr);
}
entry->live_keys += live_increment;
entry->total_keys += total_increment;
entry->live_bytes += live_bytes_increment;
entry->total_bytes += total_bytes_increment;
if ((tstamp != 0 && tstamp < entry->oldest_tstamp) ||
entry->oldest_tstamp == 0)
{
entry->oldest_tstamp = tstamp;
}
if ((tstamp != 0 && tstamp > entry->newest_tstamp) ||
entry->newest_tstamp == 0)
{
entry->newest_tstamp = tstamp;
}
}
static khint_t keydir_entry_hash(bitcask_keydir_entry* entry)
{
return MURMUR_HASH(entry->key, entry->key_sz, 42);
}
static khint_t keydir_entry_equal(bitcask_keydir_entry* lhs,
bitcask_keydir_entry* rhs)
{
if (lhs->key_sz != rhs->key_sz)
{
return 0;
}
else
{
return (memcmp(lhs->key, rhs->key, lhs->key_sz) == 0);
}
}
static khiter_t get_entries_hash(ErlNifEnv* env, entries_hash_t *hash, ErlNifBinary* key,
khiter_t* itr_ptr, bitcask_keydir_entry** entry_ptr)
{
khiter_t itr;
if (key->size < (4096 - sizeof(bitcask_keydir_entry)))
{
char buf[4096];
bitcask_keydir_entry* e = (bitcask_keydir_entry*)buf;
e->key_sz = key->size;
memcpy(e->key, key->data, key->size);
itr = kh_get(entries, hash, e);
}
else
{
bitcask_keydir_entry* e = enif_alloc_compat(env, sizeof(bitcask_keydir_entry) +
key->size);
e->key_sz = key->size;
memcpy(e->key, key->data, key->size);
itr = kh_get(entries, hash, e);
enif_free_compat(env, e);
}
if (itr != kh_end(hash))
{
if (itr_ptr != NULL)
{
*itr_ptr = itr;
}
if (entry_ptr != NULL)
{
*entry_ptr = kh_key(hash, itr);
}
return 1;
}
else
{
return 0;
}
}
// Find an entry in the pending or entries keydir and update the hash/itr/entry pointers
// if non-NULL. If iterating is true, restrict search to the frozen keydir.
static int find_keydir_entry(ErlNifEnv* env, bitcask_keydir* keydir, ErlNifBinary* key,
entries_hash_t** hash_ptr, khiter_t* itr_ptr,
bitcask_keydir_entry** entry_ptr, int iterating)
{
// Search pending if present
if (keydir->pending != NULL && !iterating)
{
if (get_entries_hash(env, keydir->pending, key, itr_ptr, entry_ptr))
{
if (hash_ptr != NULL)
{
*hash_ptr = keydir->pending;
}
return 1;
}
}
// If not in pending, check normal entries
if (get_entries_hash(env, keydir->entries, key, itr_ptr, entry_ptr))
{
if (hash_ptr != NULL)
{
*hash_ptr = keydir->entries;
}
return 1;
}
// Not in entries or pending
return 0;
}
// Allocate, populate and add entry to the keydir hash based on the key and entry structure
static bitcask_keydir_entry* add_entry(ErlNifEnv* env, bitcask_keydir* keydir,
entries_hash_t* hash,
ErlNifBinary* key, bitcask_keydir_entry* entry)
{
bitcask_keydir_entry* new_entry = enif_alloc_compat(env,
sizeof(bitcask_keydir_entry) +
key->size);
new_entry->file_id = entry->file_id;
new_entry->total_sz = entry->total_sz;
new_entry->offset = entry->offset;
new_entry->tstamp = entry->tstamp;
new_entry->key_sz = key->size;
memcpy(new_entry->key, key->data, key->size);
kh_put_set(entries, hash, new_entry);
return new_entry;
}
// Move an entry from pending into entries
static void move_pending_entry(ErlNifEnv* env, bitcask_keydir* keydir,
khiter_t pend_itr, bitcask_keydir_entry* entry)
{
kh_put_set(entries, keydir->entries, entry);
// no need to delete from pending entry, it will be freed as a whole
}
// Update the current entry with newer information
static void update_entry(ErlNifEnv* env, bitcask_keydir* keydir,
bitcask_keydir_entry* cur_entry,
bitcask_keydir_entry* upd_entry)
{
cur_entry->file_id = upd_entry->file_id;
cur_entry->total_sz = upd_entry->total_sz;
cur_entry->offset = upd_entry->offset;
cur_entry->tstamp = upd_entry->tstamp;
}
static void remove_entry(ErlNifEnv* env, bitcask_keydir* keydir, khiter_t itr,
bitcask_keydir_entry* entry)
{
kh_del(entries, keydir->entries, itr);
}
ERL_NIF_TERM bitcask_nifs_keydir_put_int(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_keydir_handle* handle;
bitcask_keydir_entry entry;
ErlNifBinary key;
uint32_t old_file_id;
uint64_t old_offset;
if (enif_get_resource(env, argv[0], bitcask_keydir_RESOURCE, (void**)&handle) &&
enif_inspect_binary(env, argv[1], &key) &&
enif_get_uint(env, argv[2], (unsigned int*)&(entry.file_id)) &&
enif_get_uint(env, argv[3], &(entry.total_sz)) &&
enif_get_uint64_bin(env, argv[4], &(entry.offset)) &&
enif_get_uint(env, argv[5], &(entry.tstamp)) &&
enif_get_uint(env, argv[6], &(entry.newest_put)) &&
enif_get_uint(env, argv[7], (unsigned int*)&(old_file_id)) &&
enif_get_uint64_bin(env, argv[8], &(old_offset)))
{
khiter_t itr;
entries_hash_t* hash;
bitcask_keydir_entry* old_entry;
bitcask_keydir* keydir = handle->keydir;
LOCK(keydir);
DEBUG("+++ Put file_id=%d offset=%d total_sz=%d\r\n",
(int) entry.file_id, (int) entry.offset,
(int)entry.total_sz);
// Check for put on a new key or updating a pending tombstone
int tombstone = 0;
int found = find_keydir_entry(env, keydir, &key, &hash, &itr, &old_entry, 0);
if (found == 1 && hash == keydir->pending && is_pending_tombstone(old_entry))
{
found = 0;
tombstone = 1;
}
if (!found && old_file_id != 0)
{
UNLOCK(keydir);
return ATOM_ALREADY_EXISTS;
}
if (!found)
{
keydir->key_count++;
keydir->key_bytes += key.size;
// Increment live and total stats.
update_fstats(env, keydir, entry.file_id, entry.tstamp,
1, 1, entry.total_sz, entry.total_sz);
if (tombstone)
{
// If a pending tombstone, update to be an active entry again
update_entry(env, keydir, old_entry, &entry);
}
else
{
// Add entry to the pending hash if iterating, otherwise
// add it to the main keydir
hash = keydir->pending == NULL ? keydir->entries : keydir->pending;
add_entry(env, keydir, hash, &key, &entry);
}
if (keydir->pending != NULL)
{
keydir->pending_updated++;
}
if (entry.file_id > keydir->biggest_file_id)
{
keydir->biggest_file_id = entry.file_id;
}
UNLOCK(keydir);
return ATOM_OK;
}
// If old_file_id is > 0, then test-and-set fails,
// then return already_exists.
if (old_file_id != 0 &&
!(old_file_id == old_entry->file_id &&
old_offset == old_entry->offset))
{
UNLOCK(keydir);
return ATOM_ALREADY_EXISTS;
}
// Now that we've marshalled everything, see if the tstamp for this key is >=
// to what's already in the hash. Otherwise, we don't bother with the update.
if ((entry.newest_put &&
(entry.file_id >= keydir->biggest_file_id)) ||
(! entry.newest_put &&
(old_entry->tstamp < entry.tstamp)) ||
(! entry.newest_put &&
((old_entry->file_id < entry.file_id) ||
(((old_entry->file_id == entry.file_id) &&
(old_entry->offset < entry.offset))))))
{
// Remove the stats for the old entry and add the new
if (old_entry->file_id != entry.file_id) // different files
{
update_fstats(env, keydir, old_entry->file_id, 0,
-1, 0,
-old_entry->total_sz, 0);
update_fstats(env, keydir, entry.file_id, entry.tstamp,
1, 1,
entry.total_sz, entry.total_sz);
}
else // file_id is same, change live/total in one entry
{
update_fstats(env, keydir, entry.file_id, entry.tstamp,
0, 1,
entry.total_sz - old_entry->total_sz,
entry.total_sz);
}
if (keydir->pending == NULL || // not folding
hash == keydir->pending) // or the old_entry already in pending
{
// Update the entry info. Note that if you do multiple updates in a
// second, the last one in wins!
// TODO: Safe?
update_entry(env, keydir, old_entry, &entry);
}
else // old_entry is in entries, add new to pending
{
add_entry(env, keydir, keydir->pending, &key, &entry);
}
if (keydir->pending != NULL)
{
keydir->pending_updated++;
}
if (entry.file_id > keydir->biggest_file_id)
{
keydir->biggest_file_id = entry.file_id;
}
UNLOCK(keydir);
return ATOM_OK;
}
else
{
// If the keydir is in the process of being loaded, it's safe to update
// fstats on a failed put. Once the keydir is live, any attempts to put
// in old data would just be ignored to avoid double-counting problems.
if (!keydir->is_ready)
{
// Increment the total # of keys and total size for the entry that
// was NOT stored in the keydir.
update_fstats(env, keydir, entry.file_id, entry.tstamp,
0, 1, 0, entry.total_sz);
}
UNLOCK(keydir);
return ATOM_ALREADY_EXISTS;
}
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_keydir_get_int(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_keydir_handle* handle;
ErlNifBinary key;
if (enif_get_resource(env, argv[0], bitcask_keydir_RESOURCE, (void**)&handle) &&
enif_inspect_binary(env, argv[1], &key))
{
bitcask_keydir_entry* entry = NULL;
bitcask_keydir* keydir = handle->keydir;
LOCK(keydir);
DEBUG("+++ Get issued\r\n");
if (find_keydir_entry(env, keydir, &key, NULL, NULL, &entry, handle->iterating) &&
!is_pending_tombstone(entry))
{
ERL_NIF_TERM result = enif_make_tuple6(env,
ATOM_BITCASK_ENTRY,
argv[1], /* Key */
enif_make_uint(env, entry->file_id),
enif_make_uint(env, entry->total_sz),
enif_make_uint64_bin(env, entry->offset),
enif_make_uint(env, entry->tstamp));
DEBUG(" ... returned value\r\n");
UNLOCK(keydir);
return result;
}
else
{
DEBUG(" ... not_found\r\n");
UNLOCK(keydir);
return ATOM_NOT_FOUND;
}
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_keydir_remove(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_keydir_handle* handle;
ErlNifBinary key;
if (enif_get_resource(env, argv[0], bitcask_keydir_RESOURCE, (void**)&handle) &&
enif_inspect_binary(env, argv[1], &key))
{
khiter_t itr;
entries_hash_t* hash;
bitcask_keydir_entry* entry;
bitcask_keydir* keydir = handle->keydir;
LOCK(keydir);
DEBUG("+++ Remove\r\n");
if (find_keydir_entry(env, keydir, &key, &hash, &itr, &entry, 0))
{
// If this call has 5 arguments, this is a conditional removal. We
// only want to actually remove the entry if the tstamp, fileid and
// offset matches the one provided. A sort of poor-man's CAS.
if (argc == 5)
{
uint32_t tstamp;
uint32_t file_id;
uint64_t offset;
if (enif_get_uint(env, argv[2], (unsigned int*)&tstamp) &&
enif_get_uint(env, argv[3], (unsigned int*)&file_id) &&
enif_get_uint64_bin(env, argv[4], (uint64_t*)&offset))
{
if (entry->tstamp != tstamp || entry->file_id != file_id ||
entry->offset != offset)
{
// Either tstamp or file_id didn't match precisely. Ignore
// this attempt to delete the record.
UNLOCK(keydir);
return ATOM_OK;
}
}
else
{
UNLOCK(keydir);
return enif_make_badarg(env);
}
}
// Remove the key from the keydir stats
keydir->key_count--;
keydir->key_bytes -= entry->key_sz;
// Remove from file stats
update_fstats(env, keydir, entry->file_id, entry->tstamp,
-1, 0, -entry->total_sz, 0);
// If found an entry in the entries hash and not folding, remove it
if (keydir->pending == NULL)
{
remove_entry(env, keydir, itr, entry);
enif_free_compat(env, entry);
}
// If found an entry in the pending hash, convert it to a tombstone
else if (keydir->pending == hash)
{
// If not already a tomstone, update stats and make it one
if (!is_pending_tombstone(entry))
{
set_pending_tombstone(entry);
}
}
// Otherwise add a tombstone to the pending hash (iteration must have
// started between put/remove call in bitcask:delete.
else
{
bitcask_keydir_entry* pending_entry =
add_entry(env, keydir, keydir->pending, &key, entry);
set_pending_tombstone(pending_entry);
}
UNLOCK(keydir);
return ATOM_OK;
}
else // entry not found, should not get here in normal operation nothing to update
{
UNLOCK(keydir);
return ATOM_OK;;
}
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_keydir_copy(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_keydir_handle* handle;
if (enif_get_resource(env, argv[0], bitcask_keydir_RESOURCE, (void**)&handle))
{
bitcask_keydir* keydir = handle->keydir;
LOCK(keydir);
bitcask_keydir_handle* new_handle = enif_alloc_resource_compat(env,
bitcask_keydir_RESOURCE,
sizeof(bitcask_keydir_handle));
memset(handle, '\0', sizeof(bitcask_keydir_handle));
// Now allocate the actual keydir instance. Because it's unnamed/shared, we'll
// leave the name and lock portions null'd out
bitcask_keydir* new_keydir = enif_alloc_compat(env, sizeof(bitcask_keydir));
new_handle->keydir = new_keydir;
memset(new_keydir, '\0', sizeof(bitcask_keydir));
new_keydir->entries = kh_init(entries);
new_keydir->fstats = kh_init(fstats);
// Deep copy each item from the existing handle
khiter_t itr;
for (itr = kh_begin(keydir->entries); itr != kh_end(keydir->entries); ++itr)
{
// Allocate our entry to be inserted into the new table and copy the record
// over.
if (kh_exist(keydir->entries, itr))
{
bitcask_keydir_entry* curr = kh_key(keydir->entries, itr);
size_t new_sz = sizeof(bitcask_keydir_entry) + curr->key_sz;
bitcask_keydir_entry* new = enif_alloc_compat(env, new_sz);
memcpy(new, curr, new_sz);
kh_put_set(entries, new_keydir->entries, new);
}
}
if (keydir->pending != NULL)
{
for (itr = kh_begin(keydir->pending); itr != kh_end(keydir->pending); ++itr)
{
// Allocate our entry to be inserted into the new table and copy the record
// over.
if (kh_exist(keydir->pending, itr))
{
bitcask_keydir_entry* curr = kh_key(keydir->pending, itr);
size_t new_sz = sizeof(bitcask_keydir_entry) + curr->key_sz;
bitcask_keydir_entry* new = enif_alloc_compat(env, new_sz);
memcpy(new, curr, new_sz);
kh_put_set(entries, new_keydir->pending, new);
}
}
}
// Deep copy fstats info
for (itr = kh_begin(keydir->fstats); itr != kh_end(keydir->fstats); ++itr)
{
if (kh_exist(keydir->fstats, itr))
{
bitcask_fstats_entry* curr_f = kh_val(keydir->fstats, itr);
bitcask_fstats_entry* new_f = enif_alloc_compat(env,
sizeof(bitcask_fstats_entry));
memcpy(new_f, curr_f, sizeof(bitcask_fstats_entry));
kh_put2(fstats, new_keydir->fstats, new_f->file_id, new_f);
}
}
if (keydir->pending != NULL)
{
merge_pending_entries(env, keydir);
}
UNLOCK(keydir);
ERL_NIF_TERM result = enif_make_resource(env, new_handle);
enif_release_resource_compat(env, new_handle);
return enif_make_tuple2(env, ATOM_OK, result);
}
else
{
return enif_make_badarg(env);
}
}
// Helper for bitcask_nifs_keydir_itr to decide if it is valid to iterate over entries.
// Check the number of updates since pending was created is less than the maximum
// and that the current view is not too old.
// Call with ts set to zero to force a wait on any pending keydir.
// Set maxage or maxputs negative to ignore them. Set both negative to force
// using the keydir - useful when a process has waited once and needs to run
// next time.
static int can_itr_keydir(bitcask_keydir* keydir, uint64_t ts, int maxage, int maxputs)
{
if (keydir->pending == NULL || // not frozen or caller wants to reuse
(maxage < 0 && maxputs < 0)) // the exiting freeze
{
return 1;
}
else if (ts == 0 || ts < keydir->pending_start)
{ // if clock skew (or forced wait), force key folding to wait
return 0; // which will fix keydir->pending_start
}
else
{
uint64_t age = ts - keydir->pending_start;
return ((maxage < 0 || age <= maxage) &&
(maxputs < 0 || keydir->pending_updated <= maxputs));
}
}
ERL_NIF_TERM bitcask_nifs_keydir_itr(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_keydir_handle* handle;
if (enif_get_resource(env, argv[0], bitcask_keydir_RESOURCE, (void**)&handle))
{
uint64_t ts;
int maxage;
int maxputs;
LOCK(handle->keydir);
DEBUG("+++ itr\r\n");
bitcask_keydir* keydir = handle->keydir;
// If a iterator thread is already active for this keydir, bail
if (handle->iterating)
{
UNLOCK(handle->keydir);
return enif_make_tuple2(env, ATOM_ERROR, ATOM_ITERATION_IN_PROCESS);
}
if (!(enif_get_uint64_bin(env, argv[1], (uint64_t*)&ts) &&
enif_get_int(env, argv[2], (int*)&maxage) &&
enif_get_int(env, argv[3], (int*)&maxputs)))
{
UNLOCK(handle->keydir);
return enif_make_badarg(env);
}
if (can_itr_keydir(keydir, ts, maxage, maxputs))
{
if (keydir->pending == NULL)
{
keydir->pending = kh_init(entries);
keydir->pending_start = ts;
}
handle->iterating = 1;
keydir->keyfolders++;
handle->iterator = kh_begin(keydir->entries);
UNLOCK(handle->keydir);
return ATOM_OK;
}
else
{
// Grow the pending_awaken array if necessary
if (keydir->pending_awaken_count == keydir->pending_awaken_size)
{ // Grow 16-at-a-time, expect a single alloc
keydir->pending_awaken_size += 16;
size_t size = keydir->pending_awaken_size * sizeof(keydir->pending_awaken[0]);
if (keydir->pending_awaken == NULL)
{
keydir->pending_awaken = enif_alloc_compat(env, size);
}
else
{
keydir->pending_awaken = enif_realloc_compat(env, keydir->pending_awaken, size);
}
}
enif_self(env, &keydir->pending_awaken[keydir->pending_awaken_count]);
keydir->pending_awaken_count++;
UNLOCK(handle->keydir);
return ATOM_OUT_OF_DATE;
}
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_keydir_itr_next(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_keydir_handle* handle;
if (enif_get_resource(env, argv[0], bitcask_keydir_RESOURCE, (void**)&handle))
{
bitcask_keydir* keydir = handle->keydir;
if (handle->iterating != 1)
{
// Iteration not started!
return enif_make_tuple2(env, ATOM_ERROR, ATOM_ITERATION_NOT_STARTED);
}
while (handle->iterator != kh_end(keydir->entries))
{
if (kh_exist(keydir->entries, handle->iterator))
{
bitcask_keydir_entry* entry = kh_key(keydir->entries, handle->iterator);
ErlNifBinary key;
// Alloc the binary and make sure it succeeded
if (!enif_alloc_binary_compat(env, entry->key_sz, &key))
{
return ATOM_ALLOCATION_ERROR;
}
// Copy the data from our key to the new allocated binary
// TODO: If we maintained a ErlNifBinary in the original entry, could we
// get away with not doing a copy here?
memcpy(key.data, entry->key, entry->key_sz);
ERL_NIF_TERM curr = enif_make_tuple6(env,
ATOM_BITCASK_ENTRY,
enif_make_binary(env, &key),
enif_make_uint(env, entry->file_id),
enif_make_uint(env, entry->total_sz),
enif_make_uint64_bin(env, entry->offset),
enif_make_uint(env, entry->tstamp));
// Update the iterator to the next entry
(handle->iterator)++;
return curr;
}
else
{
// No item in this slot; increment the iterator and keep looping
(handle->iterator)++;
}
}
// The iterator is at the end of the table
return ATOM_NOT_FOUND;
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_keydir_itr_release(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_keydir_handle* handle;
if (enif_get_resource(env, argv[0], bitcask_keydir_RESOURCE, (void**)&handle))
{
LOCK(handle->keydir);
if (handle->iterating != 1)
{
// Iteration not started!
UNLOCK(handle->keydir);
return enif_make_tuple2(env, ATOM_ERROR, ATOM_ITERATION_NOT_STARTED);
}
handle->iterating = 0;
handle->keydir->keyfolders--;
if (handle->keydir->keyfolders == 0)
{
merge_pending_entries(env, handle->keydir);
handle->keydir->iter_generation++;
}
UNLOCK(handle->keydir);
return ATOM_OK;
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_keydir_info(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_keydir_handle* handle;
if (enif_get_resource(env, argv[0], bitcask_keydir_RESOURCE, (void**)&handle))
{
bitcask_keydir* keydir = handle->keydir;
if (keydir == NULL)
{
return enif_make_badarg(env);
}
LOCK(keydir);
// Dump fstats info into a list of [{file_id, live_keys, total_keys,
// live_bytes, total_bytes,
// oldest_tstamp, newest_tstamp}]
ERL_NIF_TERM fstats_list = enif_make_list(env, 0);
khiter_t itr;
bitcask_fstats_entry* curr_f;
for (itr = kh_begin(keydir->fstats); itr != kh_end(keydir->fstats); ++itr)
{
if (kh_exist(keydir->fstats, itr))
{
curr_f = kh_val(keydir->fstats, itr);
ERL_NIF_TERM fstat =
enif_make_tuple7(env,
enif_make_uint(env, curr_f->file_id),
enif_make_ulong(env, curr_f->live_keys),
enif_make_ulong(env, curr_f->total_keys),
enif_make_ulong(env, curr_f->live_bytes),
enif_make_ulong(env, curr_f->total_bytes),
enif_make_uint(env, curr_f->oldest_tstamp),
enif_make_uint(env, curr_f->newest_tstamp));
fstats_list = enif_make_list_cell(env, fstat, fstats_list);
}
}
ERL_NIF_TERM iter_info =
enif_make_tuple3(env,
enif_make_uint64_bin(env, keydir->iter_generation),
enif_make_ulong(env, keydir->keyfolders),
keydir->pending == NULL ? ATOM_FALSE : ATOM_TRUE);
ERL_NIF_TERM result = enif_make_tuple4(env,
enif_make_ulong(env, keydir->key_count),
enif_make_ulong(env, keydir->key_bytes),
fstats_list,
iter_info);
UNLOCK(keydir);
return result;
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_keydir_release(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_keydir_handle* handle;
if (enif_get_resource(env, argv[0], bitcask_keydir_RESOURCE, (void**)&handle))
{
bitcask_nifs_keydir_resource_cleanup(env, handle);
return ATOM_OK;
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_increment_file_id(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_keydir_handle* handle;
if (enif_get_resource(env, argv[0], bitcask_keydir_RESOURCE, (void**)&handle))
{
LOCK(handle->keydir);
(handle->keydir->biggest_file_id)++;
uint32_t id = handle->keydir->biggest_file_id;
UNLOCK(handle->keydir);
return enif_make_tuple2(env, ATOM_OK, enif_make_uint(env, id));
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_keydir_trim_fstats(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_keydir_handle* handle;
ERL_NIF_TERM head, tail, list;
uint32_t non_existent_entries = 0;
if (enif_get_resource(env, argv[0], bitcask_keydir_RESOURCE, (void**)&handle)&&
enif_is_list(env, argv[1]))
{
bitcask_keydir* keydir = handle->keydir;
LOCK(keydir);
uint32_t file_id;
list = argv[1];
while (enif_get_list_cell(env, list, &head, &tail))
{
enif_get_uint(env, head, &file_id);
khiter_t itr = kh_get(fstats, keydir->fstats, file_id);
if (itr != kh_end(keydir->fstats))
{
bitcask_fstats_entry* curr_f;
curr_f = kh_val(keydir->fstats, itr);
enif_free_compat(env, curr_f);
kh_del(fstats, keydir->fstats, itr);
}
else
{
non_existent_entries++;
}
// if not found, noop, but shouldn't happen.
// think about chaning the retval to signal for warning?
list = tail;
}
UNLOCK(keydir);
return enif_make_tuple2(env, ATOM_OK,
enif_make_uint(env, non_existent_entries));
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_lock_acquire(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
char filename[4096];
int is_write_lock = 0;
if (enif_get_string(env, argv[0], filename, sizeof(filename), ERL_NIF_LATIN1) > 0 &&
enif_get_int(env, argv[1], &is_write_lock))
{
// Setup the flags for the lock file
int flags = O_RDONLY;
if (is_write_lock)
{
// Use O_SYNC (in addition to other flags) to ensure that when we write
// data to the lock file it is immediately (or nearly) available to any
// other reading processes
flags = O_CREAT | O_EXCL | O_RDWR | O_SYNC;
}
// Try to open the lock file -- allocate a resource if all goes well.
int fd = open(filename, flags, 0600);
if (fd > -1)
{
// Successfully opened the file -- setup a resource to track the FD.
unsigned int filename_sz = strlen(filename) + 1;
bitcask_lock_handle* handle = enif_alloc_resource_compat(env, bitcask_lock_RESOURCE,
sizeof(bitcask_lock_handle) +
filename_sz);
handle->fd = fd;
handle->is_write_lock = is_write_lock;
strncpy(handle->filename, filename, filename_sz);
ERL_NIF_TERM result = enif_make_resource(env, handle);
enif_release_resource_compat(env, handle);
return enif_make_tuple2(env, ATOM_OK, result);
}
else
{
return enif_make_tuple2(env, ATOM_ERROR, errno_atom(env, errno));
}
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_lock_release(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_lock_handle* handle;
if (enif_get_resource(env, argv[0], bitcask_lock_RESOURCE, (void**)&handle))
{
lock_release(handle);
return ATOM_OK;
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_lock_readdata(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_lock_handle* handle;
if (enif_get_resource(env, argv[0], bitcask_lock_RESOURCE, (void**)&handle))
{
// Stat the filehandle so we can read the entire contents into memory
struct stat sinfo;
if (fstat(handle->fd, &sinfo) != 0)
{
return errno_error_tuple(env, ATOM_FSTAT_ERROR, errno);
}
// Allocate a binary to hold the contents of the file
ErlNifBinary data;
if (!enif_alloc_binary_compat(env, sinfo.st_size, &data))
{
return enif_make_tuple2(env, ATOM_ERROR, ATOM_ALLOCATION_ERROR);
}
// Read the whole file into our binary
if (pread(handle->fd, data.data, data.size, 0) == -1)
{
return errno_error_tuple(env, ATOM_PREAD_ERROR, errno);
}
return enif_make_tuple2(env, ATOM_OK, enif_make_binary(env, &data));
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_lock_writedata(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_lock_handle* handle;
ErlNifBinary data;
if (enif_get_resource(env, argv[0], bitcask_lock_RESOURCE, (void**)&handle) &&
enif_inspect_binary(env, argv[1], &data))
{
if (handle->is_write_lock)
{
// Truncate the file first, to ensure that the lock file only contains what
// we're about to write
if (ftruncate(handle->fd, 0) == -1)
{
return errno_error_tuple(env, ATOM_FTRUNCATE_ERROR, errno);
}
// Write the new blob of data to the lock file. Note that we use O_SYNC to
// ensure that the data is available ASAP to reading processes.
if (pwrite(handle->fd, data.data, data.size, 0) == -1)
{
return errno_error_tuple(env, ATOM_PWRITE_ERROR, errno);
}
return ATOM_OK;
}
else
{
// Tried to write data to a read lock
return enif_make_tuple2(env, ATOM_ERROR, ATOM_LOCK_NOT_WRITABLE);
}
}
else
{
return enif_make_badarg(env);
}
}
int get_file_open_flags(ErlNifEnv* env, ERL_NIF_TERM list)
{
int flags = -1;
ERL_NIF_TERM head, tail;
while (enif_get_list_cell(env, list, &head, &tail))
{
if (head == ATOM_CREATE)
{
flags = O_CREAT | O_EXCL | O_RDWR | O_APPEND;
}
else if (head == ATOM_READONLY)
{
flags = O_RDONLY;
}
else if (head == ATOM_O_SYNC)
{
flags |= O_SYNC;
}
list = tail;
}
return flags;
}
ERL_NIF_TERM bitcask_nifs_file_open(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
char filename[4096];
if (enif_get_string(env, argv[0], filename, sizeof(filename), ERL_NIF_LATIN1) &&
enif_is_list(env, argv[1]))
{
int flags = get_file_open_flags(env, argv[1]);
int fd = open(filename, flags, S_IREAD | S_IWRITE);
if (fd > -1)
{
// Setup a resource for our handle
bitcask_file_handle* handle = enif_alloc_resource_compat(env,
bitcask_file_RESOURCE,
sizeof(bitcask_file_handle));
memset(handle, '\0', sizeof(bitcask_file_handle));
handle->fd = fd;
ERL_NIF_TERM result = enif_make_resource(env, handle);
enif_release_resource_compat(env, handle);
return enif_make_tuple2(env, ATOM_OK, result);
}
else
{
return enif_make_tuple2(env, ATOM_ERROR, errno_atom(env, errno));
}
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_file_close(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_file_handle* handle;
if (enif_get_resource(env, argv[0], bitcask_file_RESOURCE, (void**)&handle))
{
if (handle->fd > 0)
{
/* TODO: Check for EIO */
close(handle->fd);
handle->fd = -1;
}
return ATOM_OK;
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_file_sync(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_file_handle* handle;
if (enif_get_resource(env, argv[0], bitcask_file_RESOURCE, (void**)&handle))
{
int rc = fsync(handle->fd);
if (rc != -1)
{
return ATOM_OK;
}
else
{
return enif_make_tuple2(env, ATOM_ERROR, errno_atom(env, errno));
}
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_file_pread(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_file_handle* handle;
unsigned long offset_ul;
unsigned long count_ul;
if (enif_get_resource(env, argv[0], bitcask_file_RESOURCE, (void**)&handle) &&
enif_get_ulong(env, argv[1], &offset_ul) && /* Offset */
enif_get_ulong(env, argv[2], &count_ul)) /* Count */
{
ErlNifBinary bin;
off_t offset = offset_ul;
size_t count = count_ul;
if (!enif_alloc_binary(count, &bin))
{
return enif_make_tuple2(env, ATOM_ERROR, ATOM_ALLOCATION_ERROR);
}
ssize_t bytes_read = pread(handle->fd, bin.data, count, offset);
if (bytes_read == count)
{
/* Good read; return {ok, Bin} */
return enif_make_tuple2(env, ATOM_OK, enif_make_binary(env, &bin));
}
else if (bytes_read > 0)
{
/* Partial read; need to resize our binary (bleh) and return {ok, Bin} */
if (enif_realloc_binary(&bin, bytes_read))
{
return enif_make_tuple2(env, ATOM_OK, enif_make_binary(env, &bin));
}
else
{
/* Realloc failed; cleanup and bail */
enif_release_binary(&bin);
return enif_make_tuple2(env, ATOM_ERROR, ATOM_ALLOCATION_ERROR);
}
}
else if (bytes_read == 0)
{
/* EOF */
enif_release_binary(&bin);
return ATOM_EOF;
}
else
{
/* Read failed altogether */
enif_release_binary(&bin);
return enif_make_tuple2(env, ATOM_ERROR, errno_atom(env, errno));
}
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_file_pwrite(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_file_handle* handle;
unsigned long offset_ul;
ErlNifBinary bin;
if (enif_get_resource(env, argv[0], bitcask_file_RESOURCE, (void**)&handle) &&
enif_get_ulong(env, argv[1], &offset_ul) && /* Offset */
enif_inspect_iolist_as_binary(env, argv[2], &bin)) /* Bytes to write */
{
unsigned char* buf = bin.data;
ssize_t bytes_written = 0;
ssize_t count = bin.size;
off_t offset = offset_ul;
while (count > 0)
{
bytes_written = pwrite(handle->fd, buf, count, offset);
if (bytes_written > 0)
{
count -= bytes_written;
offset += bytes_written;
buf += bytes_written;
}
else
{
/* Write failed altogether */
return enif_make_tuple2(env, ATOM_ERROR, errno_atom(env, errno));
}
}
/* Write done */
return ATOM_OK;
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_file_read(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_file_handle* handle;
size_t count;
if (enif_get_resource(env, argv[0], bitcask_file_RESOURCE, (void**)&handle) &&
enif_get_ulong(env, argv[1], &count)) /* Count */
{
ErlNifBinary bin;
if (!enif_alloc_binary(count, &bin))
{
return enif_make_tuple2(env, ATOM_ERROR, ATOM_ALLOCATION_ERROR);
}
ssize_t bytes_read = read(handle->fd, bin.data, count);
if (bytes_read == count)
{
/* Good read; return {ok, Bin} */
return enif_make_tuple2(env, ATOM_OK, enif_make_binary(env, &bin));
}
else if (bytes_read > 0)
{
/* Partial read; need to resize our binary (bleh) and return {ok, Bin} */
if (enif_realloc_binary(&bin, bytes_read))
{
return enif_make_tuple2(env, ATOM_OK, enif_make_binary(env, &bin));
}
else
{
/* Realloc failed; cleanup and bail */
enif_release_binary(&bin);
return enif_make_tuple2(env, ATOM_ERROR, ATOM_ALLOCATION_ERROR);
}
}
else if (bytes_read == 0)
{
/* EOF */
enif_release_binary(&bin);
return ATOM_EOF;
}
else
{
/* Read failed altogether */
enif_release_binary(&bin);
return enif_make_tuple2(env, ATOM_ERROR, errno_atom(env, errno));
}
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_file_write(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_file_handle* handle;
ErlNifBinary bin;
if (enif_get_resource(env, argv[0], bitcask_file_RESOURCE, (void**)&handle) &&
enif_inspect_iolist_as_binary(env, argv[1], &bin)) /* Bytes to write */
{
unsigned char* buf = bin.data;
ssize_t bytes_written = 0;
ssize_t count = bin.size;
while (count > 0)
{
bytes_written = write(handle->fd, buf, count);
if (bytes_written > 0)
{
count -= bytes_written;
buf += bytes_written;
}
else
{
/* Write failed altogether */
return enif_make_tuple2(env, ATOM_ERROR, errno_atom(env, errno));
}
}
/* Write done */
return ATOM_OK;
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_file_position(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_file_handle* handle;
unsigned long offset_ul;
if (enif_get_resource(env, argv[0], bitcask_file_RESOURCE, (void**)&handle) &&
enif_get_ulong(env, argv[1], &offset_ul))
{
off_t offset = offset_ul;
off_t new_offset = lseek(handle->fd, offset, SEEK_SET);
if (new_offset != -1)
{
return enif_make_tuple2(env, ATOM_OK, enif_make_ulong(env, new_offset));
}
else
{
/* Write failed altogether */
return enif_make_tuple2(env, ATOM_ERROR, errno_atom(env, errno));
}
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM bitcask_nifs_file_seekbof(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
bitcask_file_handle* handle;
if (enif_get_resource(env, argv[0], bitcask_file_RESOURCE, (void**)&handle))
{
if (lseek(handle->fd, 0, SEEK_SET) != -1)
{
return ATOM_OK;
}
else
{
/* Write failed altogether */
return enif_make_tuple2(env, ATOM_ERROR, errno_atom(env, errno));
}
}
else
{
return enif_make_badarg(env);
}
}
ERL_NIF_TERM errno_atom(ErlNifEnv* env, int error)
{
return enif_make_atom(env, erl_errno_id(error));
}
ERL_NIF_TERM errno_error_tuple(ErlNifEnv* env, ERL_NIF_TERM key, int error)
{
// Construct a tuple of form: {error, {Key, ErrnoAtom}}
return enif_make_tuple2(env, ATOM_ERROR,
enif_make_tuple2(env, key, errno_atom(env, error)));
}
// Send messages to all processes that want to be awoken next time
// pending is merged.
static void msg_pending_awaken(ErlNifEnv* env, bitcask_keydir* keydir,
ERL_NIF_TERM msg)
{
ErlNifEnv* msg_env = enif_alloc_env();
int idx;
for (idx = 0; idx < keydir->pending_awaken_count; idx++)
{
enif_clear_env(msg_env);
#ifdef PULSE
/* Using PULSE_SEND here sometimes deadlocks the Bitcask PULSE test.
Reverting to using enif_send for now.
TODO: Check if PULSE_SEND is really necessary and investigate/fix
deadlock in the future
*/
/* PULSE_SEND(env, &keydir->pending_awaken[idx], msg_env, msg); */
enif_send(env, &keydir->pending_awaken[idx], msg_env, msg);
#else
enif_send(env, &keydir->pending_awaken[idx], msg_env, msg);
#endif
}
enif_free_env(msg_env);
}
// Merge pending hash into entries hash and awaken any pids that want to
// start iterating once we are merged. keydir must be locked before calling.
static void merge_pending_entries(ErlNifEnv* env, bitcask_keydir* keydir)
{
khiter_t pend_itr;
for (pend_itr = kh_begin(keydir->pending); pend_itr != kh_end(keydir->pending); ++pend_itr)
{
if (kh_exist(keydir->pending, pend_itr))
{
bitcask_keydir_entry* pending_entry = kh_key(keydir->pending, pend_itr);
khiter_t ent_itr = kh_get(entries, keydir->entries, pending_entry);
DEBUG("Pending Entry: key=%s key_sz=%d file_id=%d tstamp=%u offset=%u size=%d\r\n",
pending_entry->key, pending_entry->key_sz,
pending_entry->file_id,
(unsigned int) pending_entry->tstamp,
(unsigned int) pending_entry->offset,
pending_entry->total_sz);
if (ent_itr == kh_end(keydir->entries))
{
/* entries: empty, pending:tombstone */
if (is_pending_tombstone(pending_entry))
{
/* nop - stats were not updated when tombstone written for
** empty entry
*/
enif_free_compat(env, pending_entry);
}
/* entries: empty, pending:value */
else
{
move_pending_entry(env, keydir, pend_itr, pending_entry);
// do not free - now in entries
}
}
else
{
bitcask_keydir_entry* entries_entry = kh_key(keydir->entries, ent_itr);
DEBUG("Entries Entry: key=%s key_sz=%d file_id=%d statmp=%u offset=%u size=%d\r\n",
entries_entry->key, entries_entry->key_sz,
entries_entry->file_id,
(unsigned int) entries_entry->tstamp,
(unsigned int) entries_entry->offset,
entries_entry->total_sz);
/* entries: present, pending:tombstone */
if (is_pending_tombstone(pending_entry))
{
remove_entry(env, keydir, ent_itr, entries_entry);
enif_free_compat(env, entries_entry);
}
/* entries: present, pending:value */
else
{
update_entry(env, keydir, entries_entry, pending_entry);
}
enif_free_compat(env, pending_entry);
}
}
}
// Wake up all sleeping pids
msg_pending_awaken(env, keydir, ATOM_READY);
// Free all resources for keydir folding
kh_destroy(entries, keydir->pending);
keydir->pending = NULL;
keydir->pending_updated = 0;
keydir->pending_start = 0;
if (keydir->pending_awaken != NULL)
{
enif_free_compat(env, keydir->pending_awaken);
}
keydir->pending_awaken = NULL;
keydir->pending_awaken_count = 0;
keydir->pending_awaken_size = 0;
DEBUG("Merge pending entries completed\r\n");
}
static void lock_release(bitcask_lock_handle* handle)
{
if (handle->fd > 0)
{
// If this is a write lock, we need to delete the file as part of cleanup. But be
// sure to do this BEFORE letting go of the file handle so as to ensure consistency
// with other readers.
if (handle->is_write_lock)
{
// TODO: Come up with some way to complain/error log if this unlink failed for some
// reason!!
unlink(handle->filename);
}
close(handle->fd);
handle->fd = -1;
}
}
static void free_keydir(ErlNifEnv* env, bitcask_keydir* keydir)
{
// Delete all the entries in the hash table, which also has the effect of
// freeing up all resources associated with the table.
khiter_t itr;
bitcask_keydir_entry* current_entry;
for (itr = kh_begin(keydir->entries); itr != kh_end(keydir->entries); ++itr)
{
if (kh_exist(keydir->entries, itr))
{
current_entry = kh_key(keydir->entries, itr);
enif_free_compat(env, current_entry);
}
}
kh_destroy(entries, keydir->entries);
bitcask_fstats_entry* curr_f;
for (itr = kh_begin(keydir->fstats); itr != kh_end(keydir->fstats); ++itr)
{
if (kh_exist(keydir->fstats, itr))
{
curr_f = kh_val(keydir->fstats, itr);
enif_free_compat(env, curr_f);
}
}
kh_destroy(fstats, keydir->fstats);
}
static void bitcask_nifs_keydir_resource_cleanup(ErlNifEnv* env, void* arg)
{
bitcask_keydir_handle* handle = (bitcask_keydir_handle*)arg;
bitcask_keydir* keydir = handle->keydir;
// First, check that there is even a keydir available. If keydir_release
// was invoked manually, we might have already cleaned up the keydir
// and this round of cleanup can noop. Otherwise, clear out the handle's
// reference to the keydir so that repeat calls function as expected
if (!handle->keydir)
{
return;
}
else
{
handle->keydir = 0;
}
// If the keydir has a lock, we need to decrement the refcount and
// potentially release it
if (keydir->mutex)
{
bitcask_priv_data* priv = (bitcask_priv_data*)enif_priv_data(env);
enif_mutex_lock(priv->global_keydirs_lock);
keydir->refcount--;
if (keydir->refcount == 0)
{
// This is the last reference to the named keydir. As such,
// remove it from the hashtable so no one else tries to use it
khiter_t itr = kh_get(global_keydirs, priv->global_keydirs, keydir->name);
kh_del(global_keydirs, priv->global_keydirs, itr);
}
else
{
// At least one other reference; just throw away our keydir pointer
// so the check below doesn't release the memory.
keydir = 0;
}
// Unlock ASAP. Wanted to avoid holding this mutex while we clean up the
// keydir, since it may take a while to walk a large keydir and free each
// entry.
enif_mutex_unlock(priv->global_keydirs_lock);
}
// If keydir is still defined, it's either privately owner or has a
// refcount of 0. Either way, we want to release it.
if (keydir)
{
if (keydir->mutex)
{
enif_mutex_destroy(keydir->mutex);
}
free_keydir(env, keydir);
}
}
static void bitcask_nifs_lock_resource_cleanup(ErlNifEnv* env, void* arg)
{
bitcask_lock_handle* handle = (bitcask_lock_handle*)arg;
lock_release(handle);
}
static void bitcask_nifs_file_resource_cleanup(ErlNifEnv* env, void* arg)
{
bitcask_file_handle* handle = (bitcask_file_handle*)arg;
if (handle->fd > -1)
{
close(handle->fd);
}
}
#ifdef BITCASK_DEBUG
static void dump_fstats(bitcask_keydir* keydir)
{
bitcask_fstats_entry* curr_f;
khiter_t itr;
for (itr = kh_begin(keydir->fstats); itr != kh_end(keydir->fstats); ++itr)
{
if (kh_exist(keydir->fstats, itr))
{
curr_f = kh_val(keydir->fstats, itr);
DEBUG("fstats %d live=(%d,%d) total=(%d,%d)\r\n",
(int) curr_f->file_id,
(int) curr_f->live_keys,
(int) curr_f->live_bytes,
(int) curr_f->total_keys,
(int) curr_f->total_bytes);
}
}
}
#endif
static int on_load(ErlNifEnv* env, void** priv_data, ERL_NIF_TERM load_info)
{
bitcask_keydir_RESOURCE = enif_open_resource_type_compat(env, "bitcask_keydir_resource",
&bitcask_nifs_keydir_resource_cleanup,
ERL_NIF_RT_CREATE | ERL_NIF_RT_TAKEOVER,
0);
bitcask_lock_RESOURCE = enif_open_resource_type_compat(env, "bitcask_lock_resource",
&bitcask_nifs_lock_resource_cleanup,
ERL_NIF_RT_CREATE | ERL_NIF_RT_TAKEOVER,
0);
bitcask_file_RESOURCE = enif_open_resource_type_compat(env, "bitcask_file_resource",
&bitcask_nifs_file_resource_cleanup,
ERL_NIF_RT_CREATE | ERL_NIF_RT_TAKEOVER,
0);
// Initialize shared keydir hashtable
bitcask_priv_data* priv = enif_alloc_compat(env, sizeof(bitcask_priv_data));
priv->global_keydirs = kh_init(global_keydirs);
priv->global_keydirs_lock = enif_mutex_create("bitcask_global_handles_lock");
*priv_data = priv;
// Initialize atoms that we use throughout the NIF.
ATOM_ALLOCATION_ERROR = enif_make_atom(env, "allocation_error");
ATOM_ALREADY_EXISTS = enif_make_atom(env, "already_exists");
ATOM_BITCASK_ENTRY = enif_make_atom(env, "bitcask_entry");
ATOM_ERROR = enif_make_atom(env, "error");
ATOM_FALSE = enif_make_atom(env, "false");
ATOM_FSTAT_ERROR = enif_make_atom(env, "fstat_error");
ATOM_FTRUNCATE_ERROR = enif_make_atom(env, "ftruncate_error");
ATOM_GETFL_ERROR = enif_make_atom(env, "getfl_error");
ATOM_ILT_CREATE_ERROR = enif_make_atom(env, "ilt_create_error");
ATOM_ITERATION_IN_PROCESS = enif_make_atom(env, "iteration_in_process");
ATOM_ITERATION_NOT_PERMITTED = enif_make_atom(env, "iteration_not_permitted");
ATOM_ITERATION_NOT_STARTED = enif_make_atom(env, "iteration_not_started");
ATOM_LOCK_NOT_WRITABLE = enif_make_atom(env, "lock_not_writable");
ATOM_NOT_FOUND = enif_make_atom(env, "not_found");
ATOM_NOT_READY = enif_make_atom(env, "not_ready");
ATOM_OK = enif_make_atom(env, "ok");
ATOM_OUT_OF_DATE = enif_make_atom(env, "out_of_date");
ATOM_PREAD_ERROR = enif_make_atom(env, "pread_error");
ATOM_PWRITE_ERROR = enif_make_atom(env, "pwrite_error");
ATOM_READY = enif_make_atom(env, "ready");
ATOM_SETFL_ERROR = enif_make_atom(env, "setfl_error");
ATOM_TRUE = enif_make_atom(env, "true");
ATOM_EOF = enif_make_atom(env, "eof");
ATOM_CREATE = enif_make_atom(env, "create");
ATOM_READONLY = enif_make_atom(env, "readonly");
ATOM_O_SYNC = enif_make_atom(env, "o_sync");
#ifdef PULSE
pulse_c_send_on_load(env);
#endif
return 0;
}
ERL_NIF_INIT(bitcask_nifs, nif_funcs, &on_load, NULL, NULL, NULL);
|