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
|
#ifdef RCSID
static char RCSid[] =
"$Header$";
#endif
/*
* Copyright (c) 2001, 2002 Michael J. Roberts. All Rights Reserved.
*
* Please see the accompanying license file, LICENSE.TXT, for information
* on using and copying this software.
*/
/*
Name
vmlookup.cpp - LookupTable metaclass implementation
Function
Notes
Modified
02/06/01 MJRoberts - Creation
*/
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include "t3std.h"
#include "vmlookup.h"
#include "vmerr.h"
#include "vmerrnum.h"
#include "vmtype.h"
#include "vmglob.h"
#include "vmobj.h"
#include "vmundo.h"
#include "vmmcreg.h"
#include "vmfile.h"
#include "vmbif.h"
#include "vmmeta.h"
#include "vmstack.h"
#include "vmiter.h"
#include "vmrun.h"
#include "vmlst.h"
#include "vmvec.h"
/* ------------------------------------------------------------------------ */
/*
* LookupTable undo record. We attach this record to the standard undo
* record via the 'ptrval' field.
*/
struct lookuptab_undo_rec
{
/* action type */
enum lookuptab_undo_action action;
/* key value */
vm_val_t key;
};
/* ------------------------------------------------------------------------ */
/*
* Allocate a new extension structure
*/
vm_lookup_ext *vm_lookup_ext::alloc_ext(VMG_ CVmObjLookupTable *self,
uint bucket_cnt, uint value_cnt)
{
size_t siz;
vm_lookup_ext *ext;
/* calculate how much space we need */
siz = sizeof(vm_lookup_ext)
+ (bucket_cnt - 1) * sizeof(ext->buckets[0])
+ value_cnt * sizeof(vm_lookup_val);
/* allocate the memory */
ext = (vm_lookup_ext *)G_mem->get_var_heap()->alloc_mem(siz, self);
/* remember the table sizes */
ext->bucket_cnt = bucket_cnt;
ext->value_cnt = value_cnt;
/* set the default value to nil initially */
ext->default_value.set_nil();
/* return the new extension */
return ext;
}
/*
* initialize the buckets and free list
*/
void vm_lookup_ext::init_ext()
{
uint i;
vm_lookup_val **bucketp;
vm_lookup_val *valp;
/* all of the buckets are initially empty */
for (i = bucket_cnt, bucketp = buckets ; i != 0 ; --i, ++bucketp)
*bucketp = 0;
/*
* Initialize the value free list. We suballocate the value entry
* structures out of our main allocation block; the available memory
* for the structures comes immediately after the last bucket, so
* bucketp points to the first value entry.
*/
valp = (vm_lookup_val *)(void *)bucketp;
first_free = valp;
for (first_free = valp, i = value_cnt ; i != 0 ; --i, ++valp)
{
/* link it into the free list */
valp->nxt = valp + 1;
/* mark it as empty */
valp->key.set_empty();
valp->val.set_empty();
}
/* terminate the free list at the last element */
(valp - 1)->nxt = 0;
}
/*
* Reallocate an extension structure, adding more value entries.
*/
vm_lookup_ext *vm_lookup_ext::expand_ext(VMG_ CVmObjLookupTable *self,
vm_lookup_ext *old_ext,
uint new_value_cnt)
{
vm_lookup_ext *new_ext;
/* allocate a new extension structure of the requested size */
new_ext = alloc_ext(vmg_ self, old_ext->bucket_cnt, new_value_cnt);
/* copy the old extension data into the new extension */
new_ext->copy_ext_from(old_ext);
/* delete the old memory */
G_mem->get_var_heap()->free_mem(old_ext);
/* return the new extension */
return new_ext;
}
/*
* Copy extension data
*/
void vm_lookup_ext::copy_ext_from(vm_lookup_ext *old_ext)
{
vm_lookup_val **oldbp;
vm_lookup_val **newbp;
vm_lookup_val *oldval;
vm_lookup_val *newval;
char *oldbase;
char *newbase;
uint i;
/* the bucket counts must be the same in both extensions */
assert(bucket_cnt == old_ext->bucket_cnt);
/* we must have at least as many entries as the old one had */
assert(value_cnt >= old_ext->value_cnt);
/* copy the default value */
default_value = old_ext->default_value;
/* get the new and old base values for faster pointer arithmetic */
oldbase = (char *)old_ext->idx_to_val(0);
newbase = (char *)idx_to_val(0);
/* copy the hash buckets from the old extension to the new extension */
for (i = old_ext->bucket_cnt, oldbp = old_ext->buckets, newbp = buckets ;
i != 0 ; --i, ++newbp, ++oldbp)
{
/* copy the bucket pointer, adjusting to our local pointer scheme */
*newbp = (*oldbp == 0
? 0
: (vm_lookup_val *)(((char *)*oldbp - oldbase) + newbase));
}
/* copy the values from the old extension to the new extension */
for (i = old_ext->value_cnt, oldval = old_ext->idx_to_val(0),
newval = idx_to_val(0) ;
i != 0 ;
--i, ++oldval, ++newval)
{
/* copy this entry */
newval->key = oldval->key;
newval->val = oldval->val;
newval->nxt = (oldval->nxt == 0
? 0
: (vm_lookup_val *)(((char *)oldval->nxt - oldbase)
+ newbase));
}
/* link all of the remaining free values into the free list */
first_free = newval;
for (i = value_cnt - old_ext->value_cnt ; i != 0 ; --i, ++newval)
{
/* link this value into the free list */
newval->nxt = newval + 1;
/* mark this free value as empty */
newval->key.set_empty();
newval->val.set_empty();
}
/* terminate the free list */
(newval - 1)->nxt = 0;
}
/* ------------------------------------------------------------------------ */
/*
* LookupTable object statics
*/
/* metaclass registration object */
static CVmMetaclassLookupTable metaclass_reg_obj;
CVmMetaclass *CVmObjLookupTable::metaclass_reg_ = &metaclass_reg_obj;
/* function table */
int (CVmObjLookupTable::
*CVmObjLookupTable::func_table_[])(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc) =
{
&CVmObjLookupTable::getp_undef, /* 0 */
&CVmObjLookupTable::getp_key_present, /* 1 */
&CVmObjLookupTable::getp_remove_entry, /* 2 */
&CVmObjLookupTable::getp_apply_all, /* 3 */
&CVmObjLookupTable::getp_for_each, /* 4 */
&CVmObjLookupTable::getp_count_buckets, /* 5 */
&CVmObjLookupTable::getp_count_entries, /* 6 */
&CVmObjLookupTable::getp_for_each_assoc, /* 7 */
&CVmObjLookupTable::getp_keys_to_list, /* 8 */
&CVmObjLookupTable::getp_vals_to_list, /* 9 */
&CVmObjLookupTable::getp_get_def_val, /* 10 */
&CVmObjLookupTable::getp_set_def_val, /* 11 */
&CVmObjLookupTable::getp_nthKey, /* 12 */
&CVmObjLookupTable::getp_nthVal /* 13 */
};
/* ------------------------------------------------------------------------ */
/*
* Lookup Table metaclass implementation
*/
/*
* create a lookup table with a given hash table size and the given
* initial entry table size
*/
CVmObjLookupTable::CVmObjLookupTable(VMG_ size_t bucket_cnt, size_t val_cnt)
{
vm_val_t empty;
/* set up an empty value */
empty.set_empty();
/* allocate our extension structure from the variable heap */
ext_ = (char *)vm_lookup_ext::alloc_ext(vmg_ this, bucket_cnt, val_cnt);
/* initialize the extension */
get_ext()->init_ext();
}
/*
* create
*/
vm_obj_id_t CVmObjLookupTable::create(VMG_ int in_root_set,
uint bucket_count, uint init_capacity)
{
vm_obj_id_t id;
/* allocate the object ID */
id = vm_new_id(vmg_ in_root_set, TRUE, FALSE);
/* create the object */
new (vmg_ id) CVmObjLookupTable(vmg_ bucket_count, init_capacity);
/* return the new ID */
return id;
}
/*
* create dynamically using stack arguments
*/
vm_obj_id_t CVmObjLookupTable::create_from_stack(
VMG_ const uchar **pc_ptr, uint argc)
{
vm_obj_id_t id;
size_t bucket_count;
size_t init_capacity;
vm_val_t src_obj;
/* parse the arguments */
get_constructor_args(vmg_ argc, &bucket_count, &init_capacity, &src_obj);
/*
* allocate the object ID - this type of construction never creates a
* root object
*/
id = vm_new_id(vmg_ FALSE, TRUE, FALSE);
/* create the object */
new (vmg_ id) CVmObjLookupTable(vmg_ bucket_count, init_capacity);
/* populate it with the source list if desired */
((CVmObjLookupTable *)vm_objp(vmg_ id))->
populate_from_list(vmg_ &src_obj);
/* discard the source object gc protection */
G_stk->discard();
/* return the new ID */
return id;
}
/*
* get and check constructor arguments
*/
void CVmObjLookupTable::get_constructor_args(VMG_ uint argc,
size_t *bucket_count,
size_t *init_capacity,
vm_val_t *src_obj)
{
/* presume no source object */
src_obj->set_nil();
/* check arguments */
if (argc == 0)
{
/* no arguments - they want default parameters */
*bucket_count = 32;
*init_capacity = 64;
}
else if (argc == 1)
{
int cnt;
/*
* One argument - they want to create from a list. Retrieve the
* list or vector object.
*/
G_stk->pop(src_obj);
/* make sure it's a list or vector */
if (!src_obj->is_listlike(vmg0_)
|| (cnt = src_obj->ll_length(vmg0_)) < 0)
err_throw(VMERR_BAD_VAL_BIF);
/* use 1.5x the pair count as the bucket count and capacity */
*bucket_count = *init_capacity = cnt*3 / 2;
}
else if (argc == 2)
{
/*
* two arguments - they specified the bucket count and initial
* capacity; pop the parameters
*/
*bucket_count = (size_t)CVmBif::pop_long_val(vmg0_);
*init_capacity = (size_t)CVmBif::pop_long_val(vmg0_);
}
else
{
/* invalid arguments */
err_throw(VMERR_WRONG_NUM_OF_ARGS);
}
/* re-push the source object to protect it from gc */
G_stk->push(src_obj);
/* make sure both are positive */
if (*bucket_count <= 0 || *init_capacity <= 0)
err_throw(VMERR_BAD_VAL_BIF);
}
/*
* Populate the table from a source list or vector. This should only be
* used during construction, because it doesn't save undo. (It's not
* necessary to save undo during construction because the whole object
* creation and construction is atomic for undo purposes: if we undo any of
* this, we undo the whole creation of the object, so there's no need to
* worry about saving old state internal to the object.)
*/
void CVmObjLookupTable::populate_from_list(VMG_ const vm_val_t *src)
{
/* copy elements from the source object */
int cnt = src->ll_length(vmg0_);
int i;
for (i = 1 ; i + 1 <= cnt ; )
{
vm_val_t key, val;
/* get the next two elements - they're always key, value pairs */
src->ll_index(vmg_ &key, i++);
src->ll_index(vmg_ &val, i++);
/* set them in the table */
set_or_add_entry(vmg_ &key, &val);
}
/* if there's a single remaining entry, it's the default value */
if (i <= cnt)
src->ll_index(vmg_ &get_ext()->default_value, i);
}
/*
* Create a copy of this object
*/
vm_obj_id_t CVmObjLookupTable::create_copy(VMG0_)
{
vm_obj_id_t id;
CVmObjLookupTable *new_obj;
/* allocate the object ID */
id = vm_new_id(vmg_ FALSE, TRUE, FALSE);
/* allocate a new object */
new_obj = new (vmg_ id) CVmObjLookupTable();
/*
* set up the new object with our same sizes, but don't initialize it
* - we're going to blast all of our data directly into the new
* extension, so we don't need to waste time setting up an empty
* initial state
*/
new_obj->ext_ = (char *)vm_lookup_ext::alloc_ext(
vmg_ new_obj, get_bucket_count(), get_entry_count());
/* copy my data to the next object */
new_obj->get_ext()->copy_ext_from(get_ext());
/* return the new object's id */
return id;
}
/*
* notify of deletion
*/
void CVmObjLookupTable::notify_delete(VMG_ int /*in_root_set*/)
{
/* free our additional data, if we have any */
if (ext_ != 0)
G_mem->get_var_heap()->free_mem(ext_);
}
/*
* set a property
*/
void CVmObjLookupTable::set_prop(VMG_ class CVmUndo *undo,
vm_obj_id_t self, vm_prop_id_t prop,
const vm_val_t *val)
{
/* no settable properties - throw an error */
err_throw(VMERR_INVALID_SETPROP);
}
/*
* get a property
*/
int CVmObjLookupTable::get_prop(VMG_ vm_prop_id_t prop, vm_val_t *retval,
vm_obj_id_t self, vm_obj_id_t *source_obj,
uint *argc)
{
uint func_idx;
/* translate the property into a function vector index */
func_idx = G_meta_table
->prop_to_vector_idx(metaclass_reg_->get_reg_idx(), prop);
/* call the appropriate function */
if ((this->*func_table_[func_idx])(vmg_ self, retval, argc))
{
*source_obj = metaclass_reg_->get_class_obj(vmg0_);
return TRUE;
}
/* inherit default handling from our base class */
return CVmObjCollection::
get_prop(vmg_ prop, retval, self, source_obj, argc);
}
/*
* apply an undo record
*/
void CVmObjLookupTable::apply_undo(VMG_ struct CVmUndoRecord *undo_rec)
{
if (undo_rec->id.ptrval != 0)
{
lookuptab_undo_rec *rec;
/* get our private record from the standard undo record */
rec = (lookuptab_undo_rec *)undo_rec->id.ptrval;
/* check the action in the record */
switch(rec->action)
{
case LOOKUPTAB_UNDO_NULL:
/*
* null record, which means that it had a weak reference to an
* object that has been deleted - there's no way to reinstate
* such records, so ignore it
*/
break;
case LOOKUPTAB_UNDO_ADD:
/* we added the entry, so we must now delete it */
del_entry(vmg_ &rec->key);
break;
case LOOKUPTAB_UNDO_DEL:
/* we deleted the entry, so we must now add it */
add_entry(vmg_ &rec->key, &undo_rec->oldval);
break;
case LOOKUPTAB_UNDO_MOD:
/* we modified the entry, so we must change it back */
mod_entry(vmg_ &rec->key, &undo_rec->oldval);
break;
case LOOKUPTAB_UNDO_DEFVAL:
/* we modified the default value; change it back */
get_ext()->default_value = undo_rec->oldval;
break;
}
/* discard the private record */
t3free(rec);
/* clear the pointer in the main record so we know it's gone */
undo_rec->id.ptrval = 0;
}
}
/*
* discard extra undo information
*/
void CVmObjLookupTable::discard_undo(VMG_ CVmUndoRecord *rec)
{
/* delete our extra information record */
if (rec->id.ptrval != 0)
{
/* free the record */
t3free((lookuptab_undo_rec *)rec->id.ptrval);
/* clear the pointer so we know it's gone */
rec->id.ptrval = 0;
}
}
/*
* Mark undo references.
*/
void CVmObjLookupTable::
mark_undo_ref(VMG_ struct CVmUndoRecord *undo_rec)
{
lookuptab_undo_rec *rec;
/* get our private record from the standard undo record */
rec = (lookuptab_undo_rec *)undo_rec->id.ptrval;
/* if the key in the record is an object, mark it referenced */
if (rec->key.typ == VM_OBJ)
G_obj_table->mark_all_refs(rec->key.val.obj, VMOBJ_REACHABLE);
/* if the value in the record is an object, mark it as well */
if (undo_rec->oldval.typ == VM_OBJ)
G_obj_table->mark_all_refs(undo_rec->oldval.val.obj,
VMOBJ_REACHABLE);
}
/*
* Mark references. Keys (but not values) are strongly referenced.
*/
void CVmObjLookupTable::mark_refs(VMG_ uint state)
{
/* get my extension */
vm_lookup_ext *ext = get_ext();
/* mark the default value */
const vm_val_t *val = &ext->default_value;
if (val->typ == VM_OBJ)
G_obj_table->mark_all_refs(val->val.obj, state);
/* run through my buckets */
vm_lookup_val **bp = ext->buckets;
size_t i = ext->bucket_cnt;
for ( ; i != 0 ; ++bp, --i)
{
/* run through all entries attached to this bucket */
for (const vm_lookup_val *entry = *bp ; entry != 0 ;
entry = entry->nxt)
{
/* if the key is an object, mark it as referenced */
val = &entry->key;
if (val->typ == VM_OBJ)
G_obj_table->mark_all_refs(val->val.obj, state);
/* if the entry is an object, mark it as referenced */
val = &entry->val;
if (val->typ == VM_OBJ)
G_obj_table->mark_all_refs(val->val.obj, state);
}
}
}
/*
* load from an image file
*/
void CVmObjLookupTable::load_from_image(VMG_ vm_obj_id_t self,
const char *ptr, size_t siz)
{
/* load our image data */
load_image_data(vmg_ ptr, siz);
/*
* save our image data pointer in the object table, so that we can
* access it (without storing it ourselves) during a reload
*/
G_obj_table->save_image_pointer(self, ptr, siz);
}
/*
* reload from the image file
*/
void CVmObjLookupTable::reload_from_image(VMG_ vm_obj_id_t self,
const char *ptr, size_t siz)
{
/* load our image data */
load_image_data(vmg_ ptr, siz);
}
/*
* load or reload data from the image
*/
void CVmObjLookupTable::load_image_data(VMG_ const char *ptr, size_t siz)
{
uint bucket_cnt;
uint val_cnt;
uint i;
const char *ibp;
vm_lookup_val **ebp;
vm_lookup_val *eval;
vm_lookup_ext *ext;
/* free our existing extension, if we have one */
if (ext_ != 0)
G_mem->get_var_heap()->free_mem(ext_);
/* read the bucket and value counts from the header */
bucket_cnt = osrp2(ptr);
val_cnt = osrp2(ptr + 2);
/* allocate space for a copy of the image data */
ext = vm_lookup_ext::alloc_ext(vmg_ this, bucket_cnt, val_cnt);
ext_ = (char *)ext;
/* initialize the free list pointer, given as a 1-based entry index */
ext->first_free = ext->img_idx_to_val(osrp2(ptr + 4));
/* initialize the table from the load image data */
for (i = bucket_cnt, ibp = ptr + 6, ebp = ext->buckets ;
i != 0 ; --i, ibp += 2, ++ebp)
{
/* translate the image file index to a value pointer */
*ebp = ext->img_idx_to_val(osrp2(ibp));
}
/* initialize the value entries */
for (i = val_cnt, eval = ext->idx_to_val(0) ;
i != 0 ; --i, ibp += VMLOOKUP_VALUE_SIZE, ++eval)
{
/* read the key and value */
vmb_get_dh(ibp, &eval->key);
vmb_get_dh(ibp + VMB_DATAHOLDER, &eval->val);
/* remember the next pointer, which is given as a 1-based index */
eval->nxt = ext->img_idx_to_val(osrp2(ibp + VMB_DATAHOLDER*2));
}
/* if a default value is included, read it */
ext->default_value.set_nil();
if (ibp + VMB_DATAHOLDER <= ptr + siz)
{
/* read the default value and skip it in the source data */
vmb_get_dh(ibp, &ext->default_value);
ibp += VMB_DATAHOLDER;
}
}
/*
* save to a file
*/
void CVmObjLookupTable::save_to_file(VMG_ class CVmFile *fp)
{
vm_lookup_ext *ext = get_ext();
uint i;
vm_lookup_val **bp;
vm_lookup_val *val;
char buf[VMLOOKUP_VALUE_SIZE];
/* write our bucket count, value count, and first-free index */
fp->write_uint2(ext->bucket_cnt);
fp->write_uint2(ext->value_cnt);
fp->write_uint2(ext->val_to_img_idx(ext->first_free));
/*
* If the image file was compiled for version 030003 or later of the
* LookupTable object, save the default value. The default value
* wasn't added until 030003, so source code compiled against earlier
* versions of the metaclass spec can't change it from the 'nil'
* default. Furthermore, these image files could be loaded on VMs that
* have older versions of the metaclass that won't know to look for a
* default value in the loaded data, so to be compatible with those
* readers we must omit the value entirely. If the image file was
* compiled with 030003 or later, it can only be loaded by VMs with
* LookupTable implementations that know to read the value.
*/
if (image_file_version_ge(vmg_ "030003"))
{
vmb_put_dh(buf, &ext->default_value);
fp->write_bytes(buf, VMB_DATAHOLDER);
}
/* write the buckets */
for (i = ext->bucket_cnt, bp = ext->buckets ; i != 0 ; --i, ++bp)
fp->write_uint2(ext->val_to_img_idx(*bp));
/* write the values */
for (i = ext->value_cnt, val = ext->idx_to_val(0) ; i != 0 ; --i, ++val)
{
uint idx;
/* store the key, value, and index */
vmb_put_dh(buf, &val->key);
vmb_put_dh(buf + VMB_DATAHOLDER, &val->val);
idx = ext->val_to_img_idx(val->nxt);
oswp2(buf + VMB_DATAHOLDER*2, idx);
/* write the data */
fp->write_bytes(buf, VMLOOKUP_VALUE_SIZE);
}
}
/*
* restore from a file
*/
void CVmObjLookupTable::restore_from_file(VMG_ vm_obj_id_t self,
CVmFile *fp, CVmObjFixup *fixups)
{
vm_lookup_ext *ext;
char buf[64];
size_t bucket_cnt;
size_t val_cnt;
size_t i;
vm_lookup_val **bp;
vm_lookup_val *entry;
uint idx;
/* free our existing extension, if we have one */
if (ext_ != 0)
G_mem->get_var_heap()->free_mem(ext_);
/* read the fixed fields */
fp->read_bytes(buf, 6);
bucket_cnt = vmb_get_uint2(buf);
val_cnt = vmb_get_uint2(buf + 2);
/* allocate the extension structure */
ext = vm_lookup_ext::alloc_ext(vmg_ this, bucket_cnt, val_cnt);
ext_ = (char *)ext;
/* store the free pointer */
ext->first_free = ext->img_idx_to_val(vmb_get_uint2(buf + 4));
/*
* if the saver was using version 030003 or later, there's a default
* value; otherwise the default value is fixed at 'nil'
*/
ext->default_value.set_nil();
if (image_file_version_ge(vmg_ "030003"))
{
/* read the default value */
fp->read_bytes(buf, VMB_DATAHOLDER);
/* apply fixups */
fixups->fix_dh(vmg_ buf);
/* decode it into the default value in the extension */
vmb_get_dh(buf, &ext->default_value);
}
/* read the buckets */
for (i = bucket_cnt, bp = ext->buckets ; i != 0 ; ++bp, --i)
{
/* read this bucket pointer and store it */
idx = fp->read_uint2();
*bp = ext->img_idx_to_val(idx);
}
/* read the value entries */
for (i = val_cnt, entry = ext->idx_to_val(0) ; i != 0 ; --i, ++entry)
{
/* read this value entry */
fp->read_bytes(buf, VMLOOKUP_VALUE_SIZE);
/* fix up the key and value dataholders */
fixups->fix_dh_array(vmg_ buf, 2);
/* store the key and value */
vmb_get_dh(buf, &entry->key);
vmb_get_dh(buf + VMB_DATAHOLDER, &entry->val);
/* store the next pointer */
idx = osrp2(buf + VMB_DATAHOLDER*2);
entry->nxt = ext->img_idx_to_val(idx);
}
}
/*
* create an iterator
*/
void CVmObjLookupTable::new_iterator(VMG_ vm_val_t *retval,
const vm_val_t *self_val)
{
vm_val_t copy_val;
/* save a copy of myself for protection against garbage collection */
G_stk->push(self_val);
/*
* create a copy of my object, so that we can iterate over a snapshot
* of our state even if we subsequently change our state
*/
copy_val.set_obj(create_copy(vmg0_));
/* set up a new lookup table iterator object on the copy */
retval->set_obj(CVmObjIterLookupTable::create_for_coll(vmg_ ©_val));
/* done with the gc protection */
G_stk->discard();
}
/*
* create a live iterator
*/
void CVmObjLookupTable::new_live_iterator(VMG_ vm_val_t *retval,
const vm_val_t *self_val)
{
/* set up a new lookup table iterator directly on myself */
retval->set_obj(CVmObjIterLookupTable::create_for_coll(vmg_ self_val));
}
/*
* add an undo record
*/
void CVmObjLookupTable::add_undo_rec(VMG_ vm_obj_id_t self,
lookuptab_undo_action action,
const vm_val_t *key,
const vm_val_t *old_entry_val)
{
lookuptab_undo_rec *rec;
vm_val_t nil_val;
/* allocate our record extension */
rec = (lookuptab_undo_rec *)t3malloc(sizeof(lookuptab_undo_rec));
/* if either the key or old value are null pointers, use a nil value */
nil_val.set_nil();
if (key == 0)
key = &nil_val;
if (old_entry_val == 0)
old_entry_val = &nil_val;
/* set up the record */
rec->action = action;
rec->key = *key;
/* add the record to the global undo stream */
if (!G_undo->add_new_record_ptr_key(vmg_ self, rec, old_entry_val))
{
/*
* we didn't add an undo record, so our extra undo information
* isn't actually going to be stored in the undo system - hence we
* must delete our extra information
*/
t3free(rec);
}
}
/*
* Add an entry; does not generate undo.
*/
void CVmObjLookupTable::add_entry(VMG_
const vm_val_t *key, const vm_val_t *val)
{
uint hashval;
vm_lookup_val *entry;
/* push the key and value as gc protection for a moment */
G_stk->push(key);
G_stk->push(val);
/* calculate the hash value for the key */
hashval = calc_key_hash(vmg_ key);
/* allocate an entry */
entry = alloc_new_entry(vmg0_);
/* link this entry into the chain at this hash value */
entry->nxt = get_ext()->buckets[hashval];
get_ext()->buckets[hashval] = entry;
/* set the key and value for this entry */
entry->key = *key;
entry->val = *val;
/* discard the gc protection */
G_stk->discard(2);
}
/*
* Add an entry, generating undo
*/
void CVmObjLookupTable::add_entry_undo(VMG_ vm_obj_id_t self,
const vm_val_t *key,
const vm_val_t *val)
{
/*
* Add undo for the change. Since we're adding a new record, there's
* no old value for the record.
*/
add_undo_rec(vmg_ self, LOOKUPTAB_UNDO_ADD, key, 0);
/* add the entry */
add_entry(vmg_ key, val);
}
/*
* Delete an entry; does not generate undo.
*/
void CVmObjLookupTable::del_entry(VMG_ const vm_val_t *key)
{
uint hashval;
vm_lookup_val *entry;
vm_lookup_val *prv_entry;
/* find the entry for the key */
entry = find_entry(vmg_ key, &hashval, &prv_entry);
/* if we found it, unlink it */
if (entry != 0)
unlink_entry(vmg_ entry, hashval, prv_entry);
}
/*
* Unlink an entry
*/
void CVmObjLookupTable::unlink_entry(VMG_ vm_lookup_val *entry, uint hashval,
vm_lookup_val *prv_entry)
{
vm_lookup_ext *ext = get_ext();
/*
* set the previous item's next pointer, or the head of the chain, as
* appropriate
*/
if (prv_entry == 0)
ext->buckets[hashval] = entry->nxt;
else
prv_entry->nxt = entry->nxt;
/* link the entry into the free list */
entry->nxt = ext->first_free;
ext->first_free = entry;
/* set this entry's key and value to 'empty' to indicate that it's free */
entry->key.set_empty();
entry->val.set_empty();
}
/*
* Modify an entry; does not generate undo.
*/
void CVmObjLookupTable::mod_entry(VMG_ const vm_val_t *key,
const vm_val_t *val)
{
vm_lookup_val *entry;
/* find the entry for the key */
entry = find_entry(vmg_ key, 0, 0);
/* if we found it, change the value to the given value */
if (entry != 0)
entry->val = *val;
}
/*
* Set an entry's value, generating undo
*/
void CVmObjLookupTable::set_entry_val_undo(VMG_ vm_obj_id_t self,
vm_lookup_val *entry,
const vm_val_t *val)
{
/* generate undo for the change */
add_undo_rec(vmg_ self, LOOKUPTAB_UNDO_MOD, &entry->key, &entry->val);
/* update the entry */
entry->val = *val;
}
/*
* Find an entry for a given key. Returns the entry index, and fills in
* the hash value and previous-entry output variables if provided.
* Returns zero if there is no such key.
*/
vm_lookup_val *CVmObjLookupTable::find_entry(VMG_ const vm_val_t *key,
uint *hashval_p,
vm_lookup_val **prv_entry_p)
{
vm_lookup_ext *ext = get_ext();
uint hashval;
vm_lookup_val *entry;
vm_lookup_val *prv_entry;
/* compute the hash value (and return it to the caller if desired) */
hashval = calc_key_hash(vmg_ key);
if (hashval_p != 0)
*hashval_p = hashval;
/* scan the hash chain for this entry */
for (prv_entry = 0, entry = ext->buckets[hashval] ; entry != 0 ;
prv_entry = entry, entry = entry->nxt)
{
/* if it matches the key we're looking for, this is the one */
if (entry->key.equals(vmg_ key))
break;
}
/* if the caller wanted to know the previous entry, tell them */
if (prv_entry_p != 0)
*prv_entry_p = prv_entry;
/* return the entry where we found the key, if indeed we found it */
return entry;
}
/*
* Calculate a hash value for a key
*/
uint CVmObjLookupTable::calc_key_hash(VMG_ const vm_val_t *key)
{
uint hash;
/* calculate the raw hash for the value */
hash = key->calc_hash(vmg0_);
/* reduce the hash value modulo the hash table size */
hash %= get_bucket_count();
/* return the hash value */
return hash;
}
/*
* Allocate a new entry
*/
vm_lookup_val *CVmObjLookupTable::alloc_new_entry(VMG0_)
{
/* if necessary, add more entry slots to the table */
expand_if_needed(vmg0_);
/* get the first entry from the free list */
vm_lookup_val *entry = get_first_free();
/* unlink this entry from the free list */
set_first_free(entry->nxt);
entry->nxt = 0;
/* return the free entry */
return entry;
}
/*
* Check for free space, and expand the table if necessary.
*/
void CVmObjLookupTable::expand_if_needed(VMG0_)
{
/* if we have any free entries left, we need do nothing */
if (get_first_free() != 0)
return;
/* increase the entry count by 50%, or 16 slots, whichever is more */
uint new_entry_cnt = get_entry_count() + (get_entry_count() >> 1);
if (new_entry_cnt < get_entry_count() + 16)
new_entry_cnt = get_entry_count() + 16;
/* reallocate the extension at the new size */
ext_ = (char *)vm_lookup_ext::expand_ext(
vmg_ this, get_ext(), new_entry_cnt);
}
/* ------------------------------------------------------------------------ */
/*
* Get a value by index
*/
int CVmObjLookupTable::index_val_q(VMG_ vm_val_t *result,
vm_obj_id_t self,
const vm_val_t *index_val)
{
vm_lookup_val *entry;
/* find the entry */
entry = find_entry(vmg_ index_val, 0, 0);
/* if we found it, return it; otherwise, return nil */
if (entry != 0)
{
/* get the value from the entry and hand it back as the result */
*result = entry->val;
}
else
{
/* not found - return the default value */
*result = get_ext()->default_value;
}
/* handled */
return TRUE;
}
/*
* Get a value by index, with an indication of whether or not the value
* exists.
*/
int CVmObjLookupTable::index_check(VMG_ vm_val_t *result, const vm_val_t *idx)
{
/* find the entry */
vm_lookup_val *entry = find_entry(vmg_ idx, 0, 0);
/* if we found it, return it; otherwise, return nil */
if (entry != 0)
{
/* get the indexed value */
*result = entry->val;
/* indicate that the key is present is in the table */
return TRUE;
}
else
{
/*
* not found - set a nil result value and indicate that the key
* isn't in the table
*/
result->set_nil();
return FALSE;
}
}
/*
* Set or add an entry, with no undo
*/
void CVmObjLookupTable::set_or_add_entry(VMG_ const vm_val_t *key,
const vm_val_t *val)
{
vm_lookup_val *entry;
/* look for an existing entry with this key */
entry = find_entry(vmg_ key, 0, 0);
/* if we found an existing entry, modify it; otherwise, add a new one */
if (entry != 0)
{
/* set the new value for this entry */
entry->val = *val;
}
else
{
/* add a new entry with the given key */
add_entry(vmg_ key, val);
}
}
/*
* Set a value by index
*/
int CVmObjLookupTable::set_index_val_q(VMG_ vm_val_t *new_container,
vm_obj_id_t self,
const vm_val_t *index_val,
const vm_val_t *new_val)
{
vm_lookup_val *entry;
/* look for an existing entry with this key */
entry = find_entry(vmg_ index_val, 0, 0);
/* if we found an existing entry, modify it; otherwise, add a new one */
if (entry != 0)
{
/* set the new value for this entry */
set_entry_val_undo(vmg_ self, entry, new_val);
}
else
{
/* add a new entry with the given key */
add_entry_undo(vmg_ self, index_val, new_val);
}
/* we can be modified, hence the new container is the original one */
new_container->set_obj(self);
/* handled */
return TRUE;
}
/* ------------------------------------------------------------------------ */
/*
* Property evaluator - determine if the given key is in the table
*/
int CVmObjLookupTable::getp_key_present(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
vm_lookup_val *entry;
vm_val_t key;
static CVmNativeCodeDesc desc(1);
/* check arguments */
if (get_prop_check_argc(retval, argc, &desc))
return TRUE;
/* get the key */
G_stk->pop(&key);
/* find the entry for this key */
entry = find_entry(vmg_ &key, 0, 0);
/* return true if we found it, nil if not */
retval->set_logical(entry != 0);
/* handled */
return TRUE;
}
/*
* Property evaluator - remove an entry given a key
*/
int CVmObjLookupTable::getp_remove_entry(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
vm_lookup_val *entry;
vm_val_t key;
uint hashval;
vm_lookup_val *prv_entry;
static CVmNativeCodeDesc desc(1);
/* check arguments */
if (get_prop_check_argc(retval, argc, &desc))
return TRUE;
/* get the key */
G_stk->pop(&key);
/* find the entry for this key */
entry = find_entry(vmg_ &key, &hashval, &prv_entry);
/* if we found the entry, delete it */
if (entry != 0)
{
/* the return value is the value stored at this key */
*retval = entry->val;
/* generate undo for the change */
add_undo_rec(vmg_ self, LOOKUPTAB_UNDO_DEL, &key, retval);
/* unlink the entry */
unlink_entry(vmg_ entry, hashval, prv_entry);
}
else
{
/* not found - the return value is nil */
retval->set_nil();
}
/* handled */
return TRUE;
}
/*
* Property evaluator - apply a callback to each entry in the table
*/
int CVmObjLookupTable::getp_apply_all(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
vm_val_t *fn;
vm_lookup_val *entry;
static CVmNativeCodeDesc desc(1);
uint i;
vm_rcdesc rc(vmg_ "LookupTable.applyAll", self, 3, G_stk->get(0), argc);
/* check arguments */
if (get_prop_check_argc(retval, argc, &desc))
return TRUE;
/* the function to invoke is the top argument */
fn = G_stk->get(0);
/* push a self-reference for gc protection */
G_stk->push()->set_obj(self);
/* iterate over each entry */
for (i = get_entry_count(), entry = get_ext()->idx_to_val(0) ;
i != 0 ; ++entry, --i)
{
/*
* if the entry is in use (it is if the key is non-empty), invoke
* the callback on it
*/
if (entry->key.typ != VM_EMPTY)
{
/* push the arguments - (key, val) - push in reverse order */
G_stk->push(&entry->val);
G_stk->push(&entry->key);
/* invoke the callback */
G_interpreter->call_func_ptr(vmg_ fn, 2, &rc, 0);
/* replace this element with the result */
set_entry_val_undo(vmg_ self, entry, G_interpreter->get_r0());
}
}
/* discard the arguments and gc protection */
G_stk->discard(2);
/* no return value */
retval->set_nil();
/* handled */
return TRUE;
}
/*
* Property evaluator - invoke a callback for each entry in the table
*/
int CVmObjLookupTable::getp_for_each(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
/* call the general processor */
vm_rcdesc rc(vmg_ "LookupTable.forEach", self, 4, G_stk->get(0), argc);
return for_each_gen(vmg_ self, retval, argc, FALSE, &rc);
}
/*
* Property evaluator - invoke a callback for each entry in the table
*/
int CVmObjLookupTable::getp_for_each_assoc(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
/* call the general processor */
vm_rcdesc rc(vmg_ "List.forEachAssoc", self, 7, G_stk->get(0), argc);
return for_each_gen(vmg_ self, retval, argc, TRUE, &rc);
}
/*
* general processor for forEach/forEachAssoc
*/
int CVmObjLookupTable::for_each_gen(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc,
int pass_key_to_cb, vm_rcdesc *rc)
{
vm_val_t *fn;
vm_lookup_val *entry;
static CVmNativeCodeDesc desc(1);
uint i;
/* check arguments */
if (get_prop_check_argc(retval, argc, &desc))
return TRUE;
/* the function to invoke is the top argument */
fn = G_stk->get(0);
/* push a self-reference for gc protection */
G_stk->push()->set_obj(self);
/* iterate over each bucket */
for (i = get_entry_count(), entry = get_ext()->idx_to_val(0) ;
i != 0 ; --i, ++entry)
{
/*
* if it's in use (i.e., if the key is non-empty), invoke the
* callback for the entry
*/
if (entry->key.typ != VM_EMPTY)
{
/* push the current value argument */
G_stk->push(&entry->val);
/* push the key if desired */
if (pass_key_to_cb)
G_stk->push(&entry->key);
/* invoke the callback */
G_interpreter->call_func_ptr(vmg_ fn, pass_key_to_cb ? 2 : 1,
rc, 0);
}
}
/* discard the arguments and gc protection */
G_stk->discard(2);
/* no return value */
retval->set_nil();
/* handled */
return TRUE;
}
/*
* iterate over the table's contents through a callback
*/
void CVmObjLookupTable::for_each(
VMG_ void (*cb)(VMG_ const vm_val_t *key,
const vm_val_t *val, void *ctx), void *ctx)
{
vm_lookup_val *entry;
uint i;
/* iterate over each bucket */
for (i = get_entry_count(), entry = get_ext()->idx_to_val(0) ;
i != 0 ; --i, ++entry)
{
/*
* if it's in use (i.e., if the key is non-empty), invoke the
* callback for the entry
*/
if (entry->key.typ != VM_EMPTY)
(*cb)(vmg_ &entry->key, &entry->val, ctx);
}
}
/*
* Property evaluator - get the number of buckets
*/
int CVmObjLookupTable::getp_count_buckets(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
static CVmNativeCodeDesc desc(0);
/* check arguments */
if (get_prop_check_argc(retval, argc, &desc))
return TRUE;
/* return the number of buckets */
retval->set_int(get_bucket_count());
/* handled */
return TRUE;
}
/*
* Property evaluator - get the number of entries in use
*/
int CVmObjLookupTable::getp_count_entries(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
static CVmNativeCodeDesc desc(0);
uint i;
int cnt;
vm_lookup_val *entry;
/* check arguments */
if (get_prop_check_argc(retval, argc, &desc))
return TRUE;
/* run through the table and count in-use entries */
for (cnt = 0, i = get_entry_count(), entry = get_ext()->idx_to_val(0) ;
i != 0 ; --i, ++entry)
{
/* if the entry is not marked as free, count it as used */
if (entry->key.typ != VM_EMPTY)
++cnt;
}
/* return the number of in-use entries we counted */
retval->set_int(cnt);
/* handled */
return TRUE;
}
/*
* Property evaluator - make a list of all of the keys in the table
*/
int CVmObjLookupTable::getp_keys_to_list(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
/* use the general list maker, listing only the keys */
return getp_make_list(vmg_ self, retval, argc, TRUE);
}
/*
* Property evaluator - make a list of all of the values in the table
*/
int CVmObjLookupTable::getp_vals_to_list(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
/* use the general list maker, listing only the values */
return getp_make_list(vmg_ self, retval, argc, FALSE);
}
/*
* General handler for keys_to_list and vals_to_list
*/
int CVmObjLookupTable::getp_make_list(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc,
int store_keys)
{
static CVmNativeCodeDesc desc(0);
/* check arguments */
if (get_prop_check_argc(retval, argc, &desc))
return TRUE;
/* push self while we're working, for gc protection */
G_stk->push()->set_obj(self);
/* make the list */
make_list(vmg_ retval, store_keys, 0);
/* discard our gc protection */
G_stk->discard();
/* handled */
return TRUE;
}
/*
* Low-level list maker. Creates a list of all of the keys or values in
* the table.
*/
void CVmObjLookupTable::make_list(VMG_ vm_val_t *retval, int store_keys,
int (*filter)(VMG_ const vm_val_t *,
const vm_val_t *))
{
vm_lookup_val *entry;
uint i;
int cnt;
CVmObjList *lst;
/* run through the table and count in-use entries */
for (cnt = 0, i = get_entry_count(), entry = get_ext()->idx_to_val(0) ;
i != 0 ; ++entry, --i)
{
/* skip empties */
if (entry->key.typ == VM_EMPTY)
continue;
/* skip values that the filter function rejects */
if (filter != 0 && !filter(vmg_ &entry->key, &entry->val))
continue;
/* count it */
++cnt;
}
/* allocate a list to store the results */
retval->set_obj(CVmObjList::create(vmg_ FALSE, cnt));
/* get the list object */
lst = (CVmObjList *)vm_objp(vmg_ retval->val.obj);
lst->cons_clear();
/* populate the list */
for (cnt = 0, i = get_entry_count(), entry = get_ext()->idx_to_val(0) ;
i != 0 ; ++entry, --i)
{
/* if the entry is not marked as free, count it as used */
if (entry->key.typ != VM_EMPTY)
{
/* skip values that the filter function rejects */
if (filter != 0 && !filter(vmg_ &entry->key, &entry->val))
continue;
/* store the key or value, as appropriate */
if (store_keys)
{
/* store the key */
lst->cons_set_element(cnt, &entry->key);
}
else
{
/* store the value */
lst->cons_set_element(cnt, &entry->val);
}
/* update the destination index */
++cnt;
}
}
}
/*
* Property evaluator: get the default value
*/
int CVmObjLookupTable::getp_get_def_val(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
/* check arguments */
static CVmNativeCodeDesc desc(0);
if (get_prop_check_argc(retval, argc, &desc))
return TRUE;
/* return the default value */
*retval = get_ext()->default_value;
return TRUE;
}
/* get the default value - internal API version */
void CVmObjLookupTable::get_default_val(vm_val_t *val)
{
*val = get_ext()->default_value;
}
/*
* Property evaluator: set the default value
*/
int CVmObjLookupTable::getp_set_def_val(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
/* check arguments */
static CVmNativeCodeDesc desc(1);
if (get_prop_check_argc(retval, argc, &desc))
return TRUE;
/* save undo */
add_undo_rec(vmg_ self, LOOKUPTAB_UNDO_DEFVAL,
0, &get_ext()->default_value);
/* set the default value to the argument value */
G_stk->pop(&get_ext()->default_value);
/* return self */
retval->set_obj(self);
return TRUE;
}
/*
* Property evaluator: get the nth key
*/
int CVmObjLookupTable::getp_nthKey(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
/* check arguments */
static CVmNativeCodeDesc desc(1);
if (get_prop_check_argc(retval, argc, &desc))
return TRUE;
/* get the nth key value */
get_nth_ele(vmg_ retval, 0, self, CVmBif::pop_long_val(vmg0_));
/* handled */
return TRUE;
}
/*
* Property evaluator: get the nth value
*/
int CVmObjLookupTable::getp_nthVal(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
/* check arguments */
static CVmNativeCodeDesc desc(1);
if (get_prop_check_argc(retval, argc, &desc))
return TRUE;
/* get the nth value */
get_nth_ele(vmg_ 0, retval, self, CVmBif::pop_long_val(vmg0_));
/* handled */
return TRUE;
}
/*
* Get the nth element's key and/or value
*/
void CVmObjLookupTable::get_nth_ele(VMG_ vm_val_t *key, vm_val_t *val,
vm_obj_id_t self, long idx)
{
uint i;
vm_lookup_val *entry;
/*
* if the index is zero, and we're asking for the value, return the
* default value
*/
if (idx == 0)
{
if (key != 0)
key->set_nil();
if (val != 0)
*val = get_ext()->default_value;
return;
}
/* iterate over our buckets */
for (i = get_entry_count(), entry = get_ext()->idx_to_val(0) ;
i != 0 ; --i, ++entry)
{
/* if it's in use (i.e., the key isn't empty), count it */
if (entry->key.typ != VM_EMPTY)
{
/* count it */
--idx;
/* if this is the one we're looking for, return it */
if (idx == 0)
{
/* fill in the key and/or value elements */
if (key != 0)
*key = entry->key;
if (val != 0)
*val = entry->val;
/* done */
return;
}
}
}
/* we didn't find it - the index is out of range */
err_throw(VMERR_INDEX_OUT_OF_RANGE);
}
/* ------------------------------------------------------------------------ */
/*
* WeakRefLookupTable
*/
/*
* statics
*/
/* metaclass registration object */
static CVmMetaclassWeakRefLookupTable weak_metaclass_reg_obj;
CVmMetaclass *CVmObjWeakRefLookupTable::metaclass_reg_ =
&weak_metaclass_reg_obj;
/*
* create
*/
vm_obj_id_t CVmObjWeakRefLookupTable::
create(VMG_ int in_root_set, uint bucket_count, uint init_capacity)
{
vm_obj_id_t id;
/* allocate the object ID */
id = vm_new_id(vmg_ in_root_set, TRUE, TRUE);
/* create the object */
new (vmg_ id) CVmObjWeakRefLookupTable(vmg_ bucket_count, init_capacity);
/* return the new ID */
return id;
}
/*
* create dynamically using stack arguments
*/
vm_obj_id_t CVmObjWeakRefLookupTable::create_from_stack(
VMG_ const uchar **pc_ptr, uint argc)
{
vm_obj_id_t id;
size_t bucket_count;
size_t init_capacity;
vm_val_t src_obj;
/* parse the arguments */
get_constructor_args(vmg_ argc, &bucket_count, &init_capacity, &src_obj);
/*
* allocate the object ID - this type of construction never creates a
* root object
*/
id = vm_new_id(vmg_ FALSE, TRUE, TRUE);
/* create the object */
new (vmg_ id) CVmObjWeakRefLookupTable(vmg_ bucket_count, init_capacity);
/* populate it with the source list if desired */
((CVmObjLookupTable *)vm_objp(vmg_ id))->
populate_from_list(vmg_ &src_obj);
/* discard the source object gc protection */
G_stk->discard();
/* return the new ID */
return id;
}
/*
* Mark undo references. Keys are strongly referenced, so mark the key in
* the record, if present.
*/
void CVmObjWeakRefLookupTable::
mark_undo_ref(VMG_ struct CVmUndoRecord *undo_rec)
{
lookuptab_undo_rec *rec;
/* get our private record from the standard undo record */
rec = (lookuptab_undo_rec *)undo_rec->id.ptrval;
/* if the key in the record is an object, mark it referenced */
if (rec->key.typ == VM_OBJ)
G_obj_table->mark_all_refs(rec->key.val.obj, VMOBJ_REACHABLE);
}
/*
* Mark references. Keys (but not values) are strongly referenced.
*/
void CVmObjWeakRefLookupTable::mark_refs(VMG_ uint state)
{
vm_lookup_val **bp;
uint i;
/* note that the default value is weakly referenced, so don't mark it */
/* run through my buckets */
for (i = get_ext()->bucket_cnt, bp = get_ext()->buckets ;
i != 0 ; --i, ++bp)
{
const vm_lookup_val *entry;
/* run through all entries attached to this bucket */
for (entry = *bp ; entry != 0 ; entry = entry->nxt)
{
/* if the key is an object, mark it as referenced */
if (entry->key.typ == VM_OBJ)
G_obj_table->mark_all_refs(entry->key.val.obj, state);
/*
* note that we only reference our value weakly, so do not
* mark it here
*/
}
}
}
/*
* Remove stale weak references from an undo record. Value entries are
* weakly referenced.
*/
void CVmObjWeakRefLookupTable::
remove_stale_undo_weak_ref(VMG_ struct CVmUndoRecord *undo_rec)
{
int forget_record;
/* presume we won't want to forget the record */
forget_record = FALSE;
/*
* if the old value in the undo record refers to an object, forget
* about it
*/
if (G_obj_table->is_obj_deletable(&undo_rec->oldval))
{
/*
* the object is being deleted - since we only weakly reference
* our objects, we must forget about this object now; this also
* means we can forget about the record entirely, since there is
* no need to apply it in the future now that it doesn't do
* anything
*/
undo_rec->oldval.set_nil();
forget_record = TRUE;
}
/* delete our extended record if we're forgetting the record */
if (undo_rec->id.ptrval != 0 && forget_record)
{
lookuptab_undo_rec *rec;
/* get our private record from the standard undo record */
rec = (lookuptab_undo_rec *)undo_rec->id.ptrval;
/* we don't care about the key value in this record any more */
rec->key.set_nil();
/* mark the record as forgotten */
rec->action = LOOKUPTAB_UNDO_NULL;
}
}
/*
* Remove stale weak references. Our values are weak references, so
* remove any entries that have values that are about to be deleted.
*/
void CVmObjWeakRefLookupTable::remove_stale_weak_refs(VMG0_)
{
vm_lookup_val **bucket;
uint i;
uint hashval;
/* remove the default value if it's gone stale */
if (G_obj_table->is_obj_deletable(&get_ext()->default_value))
get_ext()->default_value.set_nil();
/* run through each bucket */
for (hashval = 0, bucket = get_ext()->buckets, i = get_bucket_count() ;
i != 0 ; ++bucket, --i, ++hashval)
{
vm_lookup_val *entry;
vm_lookup_val *prv;
vm_lookup_val *nxt;
/* run through all entries attached to this bucket */
for (prv = 0, entry = *bucket ; entry != 0 ; entry = nxt)
{
/* remember the next entry, in case we delete this one */
nxt = entry->nxt;
/*
* if the value has an object reference that has become stale,
* delete the entry
*/
if (G_obj_table->is_obj_deletable(&entry->val))
{
/* it's deletable, so delete the entire record */
unlink_entry(vmg_ entry, hashval, prv);
/*
* note that we do NOT advance the prv pointer - we've
* deleted this entry, so the one preceding it is now the
* previous for the one following this one
*/
}
else
{
/* we're keeping this entry - make it the new previous */
prv = entry;
}
}
}
}
/* ------------------------------------------------------------------------ */
/*
* LookupTable Iterator metaclass
*/
/*
* statics
*/
/* metaclass registration object */
static CVmMetaclassIterLookupTable iter_metaclass_reg_obj;
CVmMetaclass *CVmObjIterLookupTable::metaclass_reg_ = &iter_metaclass_reg_obj;
/* create a list with no initial contents */
vm_obj_id_t CVmObjIterLookupTable::create_for_coll(VMG_ const vm_val_t *coll)
{
vm_obj_id_t id;
/* push the collection object reference for gc protection */
G_stk->push(coll);
/* create a non-root-set object */
id = vm_new_id(vmg_ FALSE, TRUE, TRUE);
/* instantiate the iterator */
new (vmg_ id) CVmObjIterLookupTable(vmg_ coll);
/* done with the gc protection */
G_stk->discard();
/* return the new object's ID */
return id;
}
/*
* constructor
*/
CVmObjIterLookupTable::CVmObjIterLookupTable(VMG_ const vm_val_t *coll)
{
/* allocate space for our extension data */
ext_ = (char *)G_mem->get_var_heap()
->alloc_mem(VMOBJITERLOOKUPTABLE_EXT_SIZE, this);
/* save the collection value */
vmb_put_dh(ext_, coll);
/* clear the flags */
set_flags(0);
/*
* set up at index zero - we're not at a valid entry until initialized
* with getNext
*/
set_entry_index(0);
}
/*
* Find the first valid entry, starting at the given entry index. If the
* given index refers to a valid entry, we return it. If there is no
* valid next entry, we return zero.
*/
uint CVmObjIterLookupTable::find_first_valid_entry(VMG_ uint entry) const
{
CVmObjLookupTable *ltab;
vm_val_t coll;
/* get my lookup table object */
get_coll_val(&coll);
ltab = (CVmObjLookupTable *)vm_objp(vmg_ coll.val.obj);
/* if we're already past the last item, we have nothing to find */
if (entry > ltab->get_entry_count())
return 0;
/*
* scan entries until we find one with a non-empty key (an empty key
* value indicates that the entry is free)
*/
for ( ; entry <= ltab->get_entry_count() ; ++entry)
{
vm_lookup_val *entryp;
/* translate the 1-based index to an entry pointer */
entryp = ltab->get_ext()->idx_to_val(entry - 1);
/* if it's non-empty, this is the one we want */
if (entryp->key.typ != VM_EMPTY)
return entry;
}
/* we didn't find a valid entry */
return 0;
}
/*
* notify of deletion
*/
void CVmObjIterLookupTable::notify_delete(VMG_ int)
{
/* free our extension */
if (ext_ != 0)
G_mem->get_var_heap()->free_mem(ext_);
}
/*
* property evaluator - get the next item
*/
int CVmObjIterLookupTable::getp_get_next(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
uint entry;
static CVmNativeCodeDesc desc(0);
CVmObjLookupTable *ltab;
vm_val_t coll;
/* check arguments */
if (get_prop_check_argc(retval, argc, &desc))
return TRUE;
/* get my collection object */
get_coll_val(&coll);
ltab = (CVmObjLookupTable *)vm_objp(vmg_ coll.val.obj);
/* advance to the next valid index after the current one */
entry = find_first_valid_entry(vmg_ get_entry_index() + 1);
/*
* if we're past the end of the table, set the index to zero to
* indicate that we're done
*/
if (entry == 0)
err_throw(VMERR_OUT_OF_RANGE);
/* retrieve the current entry */
*retval = ltab->get_ext()->idx_to_val(entry - 1)->val;
/* update our internal state, saving undo */
set_entry_index_undo(vmg_ self, entry);
/* handled */
return TRUE;
}
/*
* property evaluator - get current value
*/
int CVmObjIterLookupTable::getp_get_cur_val(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
static CVmNativeCodeDesc desc(0);
/* check arguments */
if (get_prop_check_argc(retval, argc, &desc))
return TRUE;
/* get the entry's value */
get_cur_entry(vmg_ retval, 0);
/* handled */
return TRUE;
}
/*
* property evaluator - get current key
*/
int CVmObjIterLookupTable::getp_get_cur_key(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
static CVmNativeCodeDesc desc(0);
/* check arguments */
if (get_prop_check_argc(retval, argc, &desc))
return TRUE;
/* get the entry's key */
get_cur_entry(vmg_ 0, retval);
/* handled */
return TRUE;
}
/*
* Get the current entry index, value, and key for the current entry. Any
* of the output pointers can be null if the corresponding value is not
* needed by the caller.
*/
void CVmObjIterLookupTable::get_cur_entry(VMG_ vm_val_t *valp,
vm_val_t *keyp) const
{
uint entry;
vm_val_t coll;
CVmObjLookupTable *ltab;
vm_lookup_val *entryp;
/* get my collection object */
get_coll_val(&coll);
ltab = (CVmObjLookupTable *)vm_objp(vmg_ coll.val.obj);
/* make sure the index is in range */
entry = get_entry_index();
if (entry < 1 || entry > ltab->get_entry_count())
err_throw(VMERR_OUT_OF_RANGE);
/* translate our 1-based index to an entry pointer */
entryp = ltab->get_ext()->idx_to_val(entry - 1);
/* if the current entry has been deleted, we have no valid current item */
if (entryp->key.typ == VM_EMPTY)
err_throw(VMERR_OUT_OF_RANGE);
/* retrieve this entry's value and key for the caller, as desired */
if (valp != 0)
*valp = entryp->val;
if (keyp != 0)
*keyp = entryp->key;
}
/*
* property evaluator - is next value available?
*/
int CVmObjIterLookupTable::getp_is_next_avail(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
uint entry;
static CVmNativeCodeDesc desc(0);
/* check arguments */
if (get_prop_check_argc(retval, argc, &desc))
return TRUE;
/* find the index of the next valid entry */
entry = find_first_valid_entry(vmg_ get_entry_index() + 1);
/* return true if we have a valid index, false if not */
retval->set_logical(entry != 0);
/* handled */
return TRUE;
}
/*
* property evaluator - reset to first item
*/
int CVmObjIterLookupTable::getp_reset_iter(VMG_ vm_obj_id_t self,
vm_val_t *retval, uint *argc)
{
static CVmNativeCodeDesc desc(0);
/* check arguments */
if (get_prop_check_argc(retval, argc, &desc))
return TRUE;
/* set our entry index back to zero, saving undo */
set_entry_index_undo(vmg_ self, 0);
/* no return value */
retval->set_nil();
/* handled */
return TRUE;
}
/*
* Set the next index value, saving undo if necessary
*/
void CVmObjIterLookupTable::set_entry_index_undo(
VMG_ vm_obj_id_t self, uint entry_idx)
{
/* save undo if necessary */
if (G_undo != 0 && !(get_flags() & VMOBJITERLOOKUPTABLE_UNDO))
{
vm_val_t val;
/*
* Add the undo record. Store the entry index as the key (it's
* not really a key, but it'll do as a place to store the data).
* We don't need anything in the payload, so store a dummy nil
* value.
*/
val.set_nil();
G_undo->add_new_record_int_key(vmg_ self, get_entry_index(), &val);
/*
* set the undo bit so we don't save redundant undo for this
* savepoint
*/
set_flags(get_flags() | VMOBJITERLOOKUPTABLE_UNDO);
}
/* set the index */
set_entry_index(entry_idx);
}
/*
* apply undo
*/
void CVmObjIterLookupTable::apply_undo(VMG_ CVmUndoRecord *rec)
{
/*
* the integer key in the undo record is my saved index value (and is
* the only thing in our state that can ever change)
*/
set_entry_index((uint)rec->id.intval);
}
/*
* mark references
*/
void CVmObjIterLookupTable::mark_refs(VMG_ uint state)
{
vm_val_t coll;
/* my collection is always an object - mark it as referenced */
get_coll_val(&coll);
G_obj_table->mark_all_refs(coll.val.obj, state);
}
/*
* load from an image file
*/
void CVmObjIterLookupTable::load_from_image(VMG_ vm_obj_id_t self,
const char *ptr, size_t siz)
{
/* if we already have memory allocated, free it */
if (ext_ != 0)
{
G_mem->get_var_heap()->free_mem(ext_);
ext_ = 0;
}
/*
* Allocate a new extension. Make sure it's at least as large as the
* current standard extension size.
*/
ext_ = (char *)G_mem->get_var_heap()
->alloc_mem(siz < VMOBJITERLOOKUPTABLE_EXT_SIZE
? VMOBJITERLOOKUPTABLE_EXT_SIZE : siz, this);
/* copy the image data to our extension */
memcpy(ext_, ptr, siz);
/*
* save our image data pointer in the object table, so that we can
* access it (without storing it ourselves) during a reload
*/
G_obj_table->save_image_pointer(self, ptr, siz);
/* clear the undo flag */
set_flags(get_flags() & ~VMOBJITERLOOKUPTABLE_UNDO);
}
/*
* re-load from an image file
*/
void CVmObjIterLookupTable::reload_from_image(VMG_ vm_obj_id_t,
const char *ptr, size_t siz)
{
/* re-copy the image data */
memcpy(ext_, ptr, siz);
/* clear the undo flag */
set_flags(get_flags() & ~VMOBJITERLOOKUPTABLE_UNDO);
}
/*
* save
*/
void CVmObjIterLookupTable::save_to_file(VMG_ CVmFile *fp)
{
/* write my extension */
fp->write_bytes(ext_, VMOBJITERLOOKUPTABLE_EXT_SIZE);
}
/*
* restore
*/
void CVmObjIterLookupTable::restore_from_file(VMG_ vm_obj_id_t,
CVmFile *fp,
CVmObjFixup *fixups)
{
/* free any existing extension */
if (ext_ != 0)
{
G_mem->get_var_heap()->free_mem(ext_);
ext_ = 0;
}
/* allocate a new extension */
ext_ = (char *)G_mem->get_var_heap()
->alloc_mem(VMOBJITERLOOKUPTABLE_EXT_SIZE, this);
/* read my extension */
fp->read_bytes(ext_, VMOBJITERLOOKUPTABLE_EXT_SIZE);
/* fix up my collection object reference */
fixups->fix_dh(vmg_ ext_);
}
|