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
|
#include <new>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <stdio.h> // sprintf
#include <string>
#include <algorithm> // std::sort
#include "scriptarray.h"
using namespace std;
BEGIN_AS_NAMESPACE
// This macro is used to avoid warnings about unused variables.
// Usually where the variables are only used in debug mode.
#define UNUSED_VAR(x) (void)(x)
// Set the default memory routines
// Use the angelscript engine's memory routines by default
static asALLOCFUNC_t userAlloc = asAllocMem;
static asFREEFUNC_t userFree = asFreeMem;
// Allows the application to set which memory routines should be used by the array object
void CScriptArray::SetMemoryFunctions(asALLOCFUNC_t allocFunc, asFREEFUNC_t freeFunc)
{
userAlloc = allocFunc;
userFree = freeFunc;
}
static void RegisterScriptArray_Native(asIScriptEngine *engine);
static void RegisterScriptArray_Generic(asIScriptEngine *engine);
struct SArrayBuffer
{
asDWORD maxElements;
asDWORD numElements;
asBYTE data[1];
};
struct SArrayCache
{
asIScriptFunction *cmpFunc;
asIScriptFunction *eqFunc;
int cmpFuncReturnCode; // To allow better error message in case of multiple matches
int eqFuncReturnCode;
};
// We just define a number here that we assume nobody else is using for
// object type user data. The add-ons have reserved the numbers 1000
// through 1999 for this purpose, so we should be fine.
const asPWORD ARRAY_CACHE = 1000;
static void CleanupTypeInfoArrayCache(asITypeInfo *type)
{
SArrayCache *cache = reinterpret_cast<SArrayCache*>(type->GetUserData(ARRAY_CACHE));
if( cache )
{
cache->~SArrayCache();
userFree(cache);
}
}
CScriptArray* CScriptArray::Create(asITypeInfo *ti, asUINT length)
{
// Allocate the memory
void *mem = userAlloc(sizeof(CScriptArray));
if( mem == 0 )
{
asIScriptContext *ctx = asGetActiveContext();
if( ctx )
ctx->SetException("Out of memory");
return 0;
}
// Initialize the object
CScriptArray *a = new(mem) CScriptArray(length, ti);
return a;
}
CScriptArray* CScriptArray::Create(asITypeInfo *ti, void *initList)
{
// Allocate the memory
void *mem = userAlloc(sizeof(CScriptArray));
if( mem == 0 )
{
asIScriptContext *ctx = asGetActiveContext();
if( ctx )
ctx->SetException("Out of memory");
return 0;
}
// Initialize the object
CScriptArray *a = new(mem) CScriptArray(ti, initList);
return a;
}
CScriptArray* CScriptArray::Create(asITypeInfo *ti, asUINT length, void *defVal)
{
// Allocate the memory
void *mem = userAlloc(sizeof(CScriptArray));
if( mem == 0 )
{
asIScriptContext *ctx = asGetActiveContext();
if( ctx )
ctx->SetException("Out of memory");
return 0;
}
// Initialize the object
CScriptArray *a = new(mem) CScriptArray(length, defVal, ti);
return a;
}
CScriptArray* CScriptArray::Create(asITypeInfo *ti)
{
return CScriptArray::Create(ti, asUINT(0));
}
// This optional callback is called when the template type is first used by the compiler.
// It allows the application to validate if the template can be instantiated for the requested
// subtype at compile time, instead of at runtime. The output argument dontGarbageCollect
// allow the callback to tell the engine if the template instance type shouldn't be garbage collected,
// i.e. no asOBJ_GC flag.
static bool ScriptArrayTemplateCallback(asITypeInfo *ti, bool &dontGarbageCollect)
{
// Make sure the subtype can be instantiated with a default factory/constructor,
// otherwise we won't be able to instantiate the elements.
int typeId = ti->GetSubTypeId();
if( typeId == asTYPEID_VOID )
return false;
if( (typeId & asTYPEID_MASK_OBJECT) && !(typeId & asTYPEID_OBJHANDLE) )
{
asITypeInfo *subtype = ti->GetEngine()->GetTypeInfoById(typeId);
asDWORD flags = subtype->GetFlags();
if( (flags & asOBJ_VALUE) && !(flags & asOBJ_POD) )
{
// Verify that there is a default constructor
bool found = false;
for( asUINT n = 0; n < subtype->GetBehaviourCount(); n++ )
{
asEBehaviours beh;
asIScriptFunction *func = subtype->GetBehaviourByIndex(n, &beh);
if( beh != asBEHAVE_CONSTRUCT ) continue;
if( func->GetParamCount() == 0 )
{
// Found the default constructor
found = true;
break;
}
}
if( !found )
{
// There is no default constructor
// TODO: Should format the message to give the name of the subtype for better understanding
ti->GetEngine()->WriteMessage("array", 0, 0, asMSGTYPE_ERROR, "The subtype has no default constructor");
return false;
}
}
else if( (flags & asOBJ_REF) )
{
bool found = false;
// If value assignment for ref type has been disabled then the array
// can be created if the type has a default factory function
if( !ti->GetEngine()->GetEngineProperty(asEP_DISALLOW_VALUE_ASSIGN_FOR_REF_TYPE) )
{
// Verify that there is a default factory
for( asUINT n = 0; n < subtype->GetFactoryCount(); n++ )
{
asIScriptFunction *func = subtype->GetFactoryByIndex(n);
if( func->GetParamCount() == 0 )
{
// Found the default factory
found = true;
break;
}
}
}
if( !found )
{
// No default factory
// TODO: Should format the message to give the name of the subtype for better understanding
ti->GetEngine()->WriteMessage("array", 0, 0, asMSGTYPE_ERROR, "The subtype has no default factory");
return false;
}
}
// If the object type is not garbage collected then the array also doesn't need to be
if( !(flags & asOBJ_GC) )
dontGarbageCollect = true;
}
else if( !(typeId & asTYPEID_OBJHANDLE) )
{
// Arrays with primitives cannot form circular references,
// thus there is no need to garbage collect them
dontGarbageCollect = true;
}
else
{
assert( typeId & asTYPEID_OBJHANDLE );
// It is not necessary to set the array as garbage collected for all handle types.
// If it is possible to determine that the handle cannot refer to an object type
// that can potentially form a circular reference with the array then it is not
// necessary to make the array garbage collected.
asITypeInfo *subtype = ti->GetEngine()->GetTypeInfoById(typeId);
asDWORD flags = subtype->GetFlags();
if( !(flags & asOBJ_GC) )
{
if( (flags & asOBJ_SCRIPT_OBJECT) )
{
// Even if a script class is by itself not garbage collected, it is possible
// that classes that derive from it may be, so it is not possible to know
// that no circular reference can occur.
if( (flags & asOBJ_NOINHERIT) )
{
// A script class declared as final cannot be inherited from, thus
// we can be certain that the object cannot be garbage collected.
dontGarbageCollect = true;
}
}
else
{
// For application registered classes we assume the application knows
// what it is doing and don't mark the array as garbage collected unless
// the type is also garbage collected.
dontGarbageCollect = true;
}
}
}
// The type is ok
return true;
}
// Registers the template array type
void RegisterScriptArray(asIScriptEngine *engine, bool defaultArray)
{
if( strstr(asGetLibraryOptions(), "AS_MAX_PORTABILITY") == 0 )
RegisterScriptArray_Native(engine);
else
RegisterScriptArray_Generic(engine);
if( defaultArray )
{
int r = engine->RegisterDefaultArrayType("array<T>"); assert( r >= 0 );
UNUSED_VAR(r);
}
}
static void RegisterScriptArray_Native(asIScriptEngine *engine)
{
int r = 0;
UNUSED_VAR(r);
// Register the object type user data clean up
engine->SetTypeInfoUserDataCleanupCallback(CleanupTypeInfoArrayCache, ARRAY_CACHE);
// Register the array type as a template
r = engine->RegisterObjectType("array<class T>", 0, asOBJ_REF | asOBJ_GC | asOBJ_TEMPLATE); assert( r >= 0 );
// Register a callback for validating the subtype before it is used
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_TEMPLATE_CALLBACK, "bool f(int&in, bool&out)", asFUNCTION(ScriptArrayTemplateCallback), asCALL_CDECL); assert( r >= 0 );
// Templates receive the object type as the first parameter. To the script writer this is hidden
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_FACTORY, "array<T>@ f(int&in)", asFUNCTIONPR(CScriptArray::Create, (asITypeInfo*), CScriptArray*), asCALL_CDECL); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_FACTORY, "array<T>@ f(int&in, uint length) explicit", asFUNCTIONPR(CScriptArray::Create, (asITypeInfo*, asUINT), CScriptArray*), asCALL_CDECL); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_FACTORY, "array<T>@ f(int&in, uint length, const T &in value)", asFUNCTIONPR(CScriptArray::Create, (asITypeInfo*, asUINT, void *), CScriptArray*), asCALL_CDECL); assert( r >= 0 );
// Register the factory that will be used for initialization lists
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_LIST_FACTORY, "array<T>@ f(int&in type, int&in list) {repeat T}", asFUNCTIONPR(CScriptArray::Create, (asITypeInfo*, void*), CScriptArray*), asCALL_CDECL); assert( r >= 0 );
// The memory management methods
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_ADDREF, "void f()", asMETHOD(CScriptArray,AddRef), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_RELEASE, "void f()", asMETHOD(CScriptArray,Release), asCALL_THISCALL); assert( r >= 0 );
// The index operator returns the template subtype
r = engine->RegisterObjectMethod("array<T>", "T &opIndex(uint index)", asMETHODPR(CScriptArray, At, (asUINT), void*), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "const T &opIndex(uint index) const", asMETHODPR(CScriptArray, At, (asUINT) const, const void*), asCALL_THISCALL); assert( r >= 0 );
// The assignment operator
r = engine->RegisterObjectMethod("array<T>", "array<T> &opAssign(const array<T>&in)", asMETHOD(CScriptArray, operator=), asCALL_THISCALL); assert( r >= 0 );
// Other methods
r = engine->RegisterObjectMethod("array<T>", "void insertAt(uint index, const T&in value)", asMETHODPR(CScriptArray, InsertAt, (asUINT, void *), void), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void insertAt(uint index, const array<T>& arr)", asMETHODPR(CScriptArray, InsertAt, (asUINT, const CScriptArray &), void), asCALL_THISCALL); assert(r >= 0);
r = engine->RegisterObjectMethod("array<T>", "void insertLast(const T&in value)", asMETHOD(CScriptArray, InsertLast), asCALL_THISCALL); assert(r >= 0);
r = engine->RegisterObjectMethod("array<T>", "void removeAt(uint index)", asMETHOD(CScriptArray, RemoveAt), asCALL_THISCALL); assert(r >= 0);
r = engine->RegisterObjectMethod("array<T>", "void removeLast()", asMETHOD(CScriptArray, RemoveLast), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void removeRange(uint start, uint count)", asMETHOD(CScriptArray, RemoveRange), asCALL_THISCALL); assert(r >= 0);
// TODO: Should length() and resize() be deprecated as the property accessors do the same thing?
// TODO: Register as size() for consistency with other types
#if AS_USE_ACCESSORS != 1
r = engine->RegisterObjectMethod("array<T>", "uint length() const", asMETHOD(CScriptArray, GetSize), asCALL_THISCALL); assert( r >= 0 );
#endif
r = engine->RegisterObjectMethod("array<T>", "void reserve(uint length)", asMETHOD(CScriptArray, Reserve), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void resize(uint length)", asMETHODPR(CScriptArray, Resize, (asUINT), void), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void sortAsc()", asMETHODPR(CScriptArray, SortAsc, (), void), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void sortAsc(uint startAt, uint count)", asMETHODPR(CScriptArray, SortAsc, (asUINT, asUINT), void), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void sortDesc()", asMETHODPR(CScriptArray, SortDesc, (), void), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void sortDesc(uint startAt, uint count)", asMETHODPR(CScriptArray, SortDesc, (asUINT, asUINT), void), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void reverse()", asMETHOD(CScriptArray, Reverse), asCALL_THISCALL); assert( r >= 0 );
// The token 'if_handle_then_const' tells the engine that if the type T is a handle, then it should refer to a read-only object
r = engine->RegisterObjectMethod("array<T>", "int find(const T&in if_handle_then_const value) const", asMETHODPR(CScriptArray, Find, (void*) const, int), asCALL_THISCALL); assert( r >= 0 );
// TODO: It should be "int find(const T&in value, uint startAt = 0) const"
r = engine->RegisterObjectMethod("array<T>", "int find(uint startAt, const T&in if_handle_then_const value) const", asMETHODPR(CScriptArray, Find, (asUINT, void*) const, int), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "int findByRef(const T&in if_handle_then_const value) const", asMETHODPR(CScriptArray, FindByRef, (void*) const, int), asCALL_THISCALL); assert( r >= 0 );
// TODO: It should be "int findByRef(const T&in value, uint startAt = 0) const"
r = engine->RegisterObjectMethod("array<T>", "int findByRef(uint startAt, const T&in if_handle_then_const value) const", asMETHODPR(CScriptArray, FindByRef, (asUINT, void*) const, int), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "bool opEquals(const array<T>&in) const", asMETHOD(CScriptArray, operator==), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "bool isEmpty() const", asMETHOD(CScriptArray, IsEmpty), asCALL_THISCALL); assert( r >= 0 );
// Sort with callback for comparison
r = engine->RegisterFuncdef("bool array<T>::less(const T&in if_handle_then_const a, const T&in if_handle_then_const b)");
r = engine->RegisterObjectMethod("array<T>", "void sort(const less &in, uint startAt = 0, uint count = uint(-1))", asMETHODPR(CScriptArray, Sort, (asIScriptFunction*, asUINT, asUINT), void), asCALL_THISCALL); assert(r >= 0);
#if AS_USE_STLNAMES != 1 && AS_USE_ACCESSORS == 1
// Register virtual properties
r = engine->RegisterObjectMethod("array<T>", "uint get_length() const property", asMETHOD(CScriptArray, GetSize), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void set_length(uint) property", asMETHODPR(CScriptArray, Resize, (asUINT), void), asCALL_THISCALL); assert( r >= 0 );
#endif
// Register GC behaviours in case the array needs to be garbage collected
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_GETREFCOUNT, "int f()", asMETHOD(CScriptArray, GetRefCount), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_SETGCFLAG, "void f()", asMETHOD(CScriptArray, SetFlag), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_GETGCFLAG, "bool f()", asMETHOD(CScriptArray, GetFlag), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_ENUMREFS, "void f(int&in)", asMETHOD(CScriptArray, EnumReferences), asCALL_THISCALL); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_RELEASEREFS, "void f(int&in)", asMETHOD(CScriptArray, ReleaseAllHandles), asCALL_THISCALL); assert( r >= 0 );
#if AS_USE_STLNAMES == 1
// Same as length
r = engine->RegisterObjectMethod("array<T>", "uint size() const", asMETHOD(CScriptArray, GetSize), asCALL_THISCALL); assert( r >= 0 );
// Same as isEmpty
r = engine->RegisterObjectMethod("array<T>", "bool empty() const", asMETHOD(CScriptArray, IsEmpty), asCALL_THISCALL); assert( r >= 0 );
// Same as insertLast
r = engine->RegisterObjectMethod("array<T>", "void push_back(const T&in)", asMETHOD(CScriptArray, InsertLast), asCALL_THISCALL); assert( r >= 0 );
// Same as removeLast
r = engine->RegisterObjectMethod("array<T>", "void pop_back()", asMETHOD(CScriptArray, RemoveLast), asCALL_THISCALL); assert( r >= 0 );
// Same as insertAt
r = engine->RegisterObjectMethod("array<T>", "void insert(uint index, const T&in value)", asMETHODPR(CScriptArray, InsertAt, (asUINT, void *), void), asCALL_THISCALL); assert(r >= 0);
r = engine->RegisterObjectMethod("array<T>", "void insert(uint index, const array<T>& arr)", asMETHODPR(CScriptArray, InsertAt, (asUINT, const CScriptArray &), void), asCALL_THISCALL); assert(r >= 0);
// Same as removeAt
r = engine->RegisterObjectMethod("array<T>", "void erase(uint)", asMETHOD(CScriptArray, RemoveAt), asCALL_THISCALL); assert( r >= 0 );
#endif
}
CScriptArray &CScriptArray::operator=(const CScriptArray &other)
{
// Only perform the copy if the array types are the same
if( &other != this &&
other.GetArrayObjectType() == GetArrayObjectType() )
{
// Make sure the arrays are of the same size
Resize(other.buffer->numElements);
// Copy the value of each element
CopyBuffer(buffer, other.buffer);
}
return *this;
}
CScriptArray::CScriptArray(asITypeInfo *ti, void *buf)
{
// The object type should be the template instance of the array
assert( ti && string(ti->GetName()) == "array" );
refCount = 1;
gcFlag = false;
objType = ti;
objType->AddRef();
buffer = 0;
Precache();
asIScriptEngine *engine = ti->GetEngine();
// Determine element size
if( subTypeId & asTYPEID_MASK_OBJECT )
elementSize = sizeof(asPWORD);
else
elementSize = engine->GetSizeOfPrimitiveType(subTypeId);
// Determine the initial size from the buffer
asUINT length = *(asUINT*)buf;
// Make sure the array size isn't too large for us to handle
if( !CheckMaxSize(length) )
{
// Don't continue with the initialization
return;
}
// Copy the values of the array elements from the buffer
if( (ti->GetSubTypeId() & asTYPEID_MASK_OBJECT) == 0 )
{
CreateBuffer(&buffer, length);
// Copy the values of the primitive type into the internal buffer
if( length > 0 )
memcpy(At(0), (((asUINT*)buf)+1), length * elementSize);
}
else if( ti->GetSubTypeId() & asTYPEID_OBJHANDLE )
{
CreateBuffer(&buffer, length);
// Copy the handles into the internal buffer
if( length > 0 )
memcpy(At(0), (((asUINT*)buf)+1), length * elementSize);
// With object handles it is safe to clear the memory in the received buffer
// instead of increasing the ref count. It will save time both by avoiding the
// call the increase ref, and also relieve the engine from having to release
// its references too
memset((((asUINT*)buf)+1), 0, length * elementSize);
}
else if( ti->GetSubType()->GetFlags() & asOBJ_REF )
{
// Only allocate the buffer, but not the objects
subTypeId |= asTYPEID_OBJHANDLE;
CreateBuffer(&buffer, length);
subTypeId &= ~asTYPEID_OBJHANDLE;
// Copy the handles into the internal buffer
if( length > 0 )
memcpy(buffer->data, (((asUINT*)buf)+1), length * elementSize);
// For ref types we can do the same as for handles, as they are
// implicitly stored as handles.
memset((((asUINT*)buf)+1), 0, length * elementSize);
}
else
{
// TODO: Optimize by calling the copy constructor of the object instead of
// constructing with the default constructor and then assigning the value
// TODO: With C++11 ideally we should be calling the move constructor, instead
// of the copy constructor as the engine will just discard the objects in the
// buffer afterwards.
CreateBuffer(&buffer, length);
// For value types we need to call the opAssign for each individual object
for( asUINT n = 0; n < length; n++ )
{
void *obj = At(n);
asBYTE *srcObj = (asBYTE*)buf;
srcObj += 4 + n*ti->GetSubType()->GetSize();
engine->AssignScriptObject(obj, srcObj, ti->GetSubType());
}
}
// Notify the GC of the successful creation
if( objType->GetFlags() & asOBJ_GC )
objType->GetEngine()->NotifyGarbageCollectorOfNewObject(this, objType);
}
CScriptArray::CScriptArray(asUINT length, asITypeInfo *ti)
{
// The object type should be the template instance of the array
assert( ti && string(ti->GetName()) == "array" );
refCount = 1;
gcFlag = false;
objType = ti;
objType->AddRef();
buffer = 0;
Precache();
// Determine element size
if( subTypeId & asTYPEID_MASK_OBJECT )
elementSize = sizeof(asPWORD);
else
elementSize = objType->GetEngine()->GetSizeOfPrimitiveType(subTypeId);
// Make sure the array size isn't too large for us to handle
if( !CheckMaxSize(length) )
{
// Don't continue with the initialization
return;
}
CreateBuffer(&buffer, length);
// Notify the GC of the successful creation
if( objType->GetFlags() & asOBJ_GC )
objType->GetEngine()->NotifyGarbageCollectorOfNewObject(this, objType);
}
CScriptArray::CScriptArray(const CScriptArray &other)
{
refCount = 1;
gcFlag = false;
objType = other.objType;
objType->AddRef();
buffer = 0;
Precache();
elementSize = other.elementSize;
if( objType->GetFlags() & asOBJ_GC )
objType->GetEngine()->NotifyGarbageCollectorOfNewObject(this, objType);
CreateBuffer(&buffer, 0);
// Copy the content
*this = other;
}
CScriptArray::CScriptArray(asUINT length, void *defVal, asITypeInfo *ti)
{
// The object type should be the template instance of the array
assert( ti && string(ti->GetName()) == "array" );
refCount = 1;
gcFlag = false;
objType = ti;
objType->AddRef();
buffer = 0;
Precache();
// Determine element size
if( subTypeId & asTYPEID_MASK_OBJECT )
elementSize = sizeof(asPWORD);
else
elementSize = objType->GetEngine()->GetSizeOfPrimitiveType(subTypeId);
// Make sure the array size isn't too large for us to handle
if( !CheckMaxSize(length) )
{
// Don't continue with the initialization
return;
}
CreateBuffer(&buffer, length);
// Notify the GC of the successful creation
if( objType->GetFlags() & asOBJ_GC )
objType->GetEngine()->NotifyGarbageCollectorOfNewObject(this, objType);
// Initialize the elements with the default value
for( asUINT n = 0; n < GetSize(); n++ )
SetValue(n, defVal);
}
void CScriptArray::SetValue(asUINT index, void *value)
{
// At() will take care of the out-of-bounds checking, though
// if called from the application then nothing will be done
void *ptr = At(index);
if( ptr == 0 ) return;
if( (subTypeId & ~asTYPEID_MASK_SEQNBR) && !(subTypeId & asTYPEID_OBJHANDLE) )
objType->GetEngine()->AssignScriptObject(ptr, value, objType->GetSubType());
else if( subTypeId & asTYPEID_OBJHANDLE )
{
void *tmp = *(void**)ptr;
*(void**)ptr = *(void**)value;
objType->GetEngine()->AddRefScriptObject(*(void**)value, objType->GetSubType());
if( tmp )
objType->GetEngine()->ReleaseScriptObject(tmp, objType->GetSubType());
}
else if( subTypeId == asTYPEID_BOOL ||
subTypeId == asTYPEID_INT8 ||
subTypeId == asTYPEID_UINT8 )
*(char*)ptr = *(char*)value;
else if( subTypeId == asTYPEID_INT16 ||
subTypeId == asTYPEID_UINT16 )
*(short*)ptr = *(short*)value;
else if( subTypeId == asTYPEID_INT32 ||
subTypeId == asTYPEID_UINT32 ||
subTypeId == asTYPEID_FLOAT ||
subTypeId > asTYPEID_DOUBLE ) // enums have a type id larger than doubles
*(int*)ptr = *(int*)value;
else if( subTypeId == asTYPEID_INT64 ||
subTypeId == asTYPEID_UINT64 ||
subTypeId == asTYPEID_DOUBLE )
*(double*)ptr = *(double*)value;
}
CScriptArray::~CScriptArray()
{
if( buffer )
{
DeleteBuffer(buffer);
buffer = 0;
}
if( objType ) objType->Release();
}
asUINT CScriptArray::GetSize() const
{
return buffer->numElements;
}
bool CScriptArray::IsEmpty() const
{
return buffer->numElements == 0;
}
void CScriptArray::Reserve(asUINT maxElements)
{
if( maxElements <= buffer->maxElements )
return;
if( !CheckMaxSize(maxElements) )
return;
// Allocate memory for the buffer
SArrayBuffer *newBuffer = reinterpret_cast<SArrayBuffer*>(userAlloc(sizeof(SArrayBuffer)-1 + elementSize*maxElements));
if( newBuffer )
{
newBuffer->numElements = buffer->numElements;
newBuffer->maxElements = maxElements;
}
else
{
// Out of memory
asIScriptContext *ctx = asGetActiveContext();
if( ctx )
ctx->SetException("Out of memory");
return;
}
// As objects in arrays of objects are not stored inline, it is safe to use memcpy here
// since we're just copying the pointers to objects and not the actual objects.
memcpy(newBuffer->data, buffer->data, buffer->numElements*elementSize);
// Release the old buffer
userFree(buffer);
buffer = newBuffer;
}
void CScriptArray::Resize(asUINT numElements)
{
if( !CheckMaxSize(numElements) )
return;
Resize((int)numElements - (int)buffer->numElements, (asUINT)-1);
}
void CScriptArray::RemoveRange(asUINT start, asUINT count)
{
if (count == 0)
return;
if( buffer == 0 || start > buffer->numElements )
{
// If this is called from a script we raise a script exception
asIScriptContext *ctx = asGetActiveContext();
if (ctx)
ctx->SetException("Index out of bounds");
return;
}
// Cap count to the end of the array
if (start + count > buffer->numElements)
count = buffer->numElements - start;
// Destroy the elements that are being removed
Destruct(buffer, start, start + count);
// Compact the elements
// As objects in arrays of objects are not stored inline, it is safe to use memmove here
// since we're just copying the pointers to objects and not the actual objects.
memmove(buffer->data + start*elementSize, buffer->data + (start + count)*elementSize, (buffer->numElements - start - count)*elementSize);
buffer->numElements -= count;
}
// Internal
void CScriptArray::Resize(int delta, asUINT at)
{
if( delta < 0 )
{
if( -delta > (int)buffer->numElements )
delta = -(int)buffer->numElements;
if( at > buffer->numElements + delta )
at = buffer->numElements + delta;
}
else if( delta > 0 )
{
// Make sure the array size isn't too large for us to handle
if( delta > 0 && !CheckMaxSize(buffer->numElements + delta) )
return;
if( at > buffer->numElements )
at = buffer->numElements;
}
if( delta == 0 ) return;
if( buffer->maxElements < buffer->numElements + delta )
{
// Allocate memory for the buffer
SArrayBuffer *newBuffer = reinterpret_cast<SArrayBuffer*>(userAlloc(sizeof(SArrayBuffer)-1 + elementSize*(buffer->numElements + delta)));
if( newBuffer )
{
newBuffer->numElements = buffer->numElements + delta;
newBuffer->maxElements = newBuffer->numElements;
}
else
{
// Out of memory
asIScriptContext *ctx = asGetActiveContext();
if( ctx )
ctx->SetException("Out of memory");
return;
}
// As objects in arrays of objects are not stored inline, it is safe to use memcpy here
// since we're just copying the pointers to objects and not the actual objects.
memcpy(newBuffer->data, buffer->data, at*elementSize);
if( at < buffer->numElements )
memcpy(newBuffer->data + (at+delta)*elementSize, buffer->data + at*elementSize, (buffer->numElements-at)*elementSize);
// Initialize the new elements with default values
Construct(newBuffer, at, at+delta);
// Release the old buffer
userFree(buffer);
buffer = newBuffer;
}
else if( delta < 0 )
{
Destruct(buffer, at, at-delta);
// As objects in arrays of objects are not stored inline, it is safe to use memmove here
// since we're just copying the pointers to objects and not the actual objects.
memmove(buffer->data + at*elementSize, buffer->data + (at-delta)*elementSize, (buffer->numElements - (at-delta))*elementSize);
buffer->numElements += delta;
}
else
{
// As objects in arrays of objects are not stored inline, it is safe to use memmove here
// since we're just copying the pointers to objects and not the actual objects.
memmove(buffer->data + (at+delta)*elementSize, buffer->data + at*elementSize, (buffer->numElements - at)*elementSize);
Construct(buffer, at, at+delta);
buffer->numElements += delta;
}
}
// internal
bool CScriptArray::CheckMaxSize(asUINT numElements)
{
// This code makes sure the size of the buffer that is allocated
// for the array doesn't overflow and becomes smaller than requested
asUINT maxSize = 0xFFFFFFFFul - sizeof(SArrayBuffer) + 1;
if( elementSize > 0 )
maxSize /= elementSize;
if( numElements > maxSize )
{
asIScriptContext *ctx = asGetActiveContext();
if( ctx )
ctx->SetException("Too large array size");
return false;
}
// OK
return true;
}
asITypeInfo *CScriptArray::GetArrayObjectType() const
{
return objType;
}
int CScriptArray::GetArrayTypeId() const
{
return objType->GetTypeId();
}
int CScriptArray::GetElementTypeId() const
{
return subTypeId;
}
void CScriptArray::InsertAt(asUINT index, void *value)
{
if( index > buffer->numElements )
{
// If this is called from a script we raise a script exception
asIScriptContext *ctx = asGetActiveContext();
if( ctx )
ctx->SetException("Index out of bounds");
return;
}
// Make room for the new element
Resize(1, index);
// Set the value of the new element
SetValue(index, value);
}
void CScriptArray::InsertAt(asUINT index, const CScriptArray &arr)
{
if (index > buffer->numElements)
{
asIScriptContext *ctx = asGetActiveContext();
if (ctx)
ctx->SetException("Index out of bounds");
return;
}
if (objType != arr.objType)
{
// This shouldn't really be possible to happen when
// called from a script, but let's check for it anyway
asIScriptContext *ctx = asGetActiveContext();
if (ctx)
ctx->SetException("Mismatching array types");
return;
}
asUINT elements = arr.GetSize();
Resize(elements, index);
if (&arr != this)
{
for (asUINT n = 0; n < arr.GetSize(); n++)
{
// This const cast is allowed, since we know the
// value will only be used to make a copy of it
void *value = const_cast<void*>(arr.At(n));
SetValue(index + n, value);
}
}
else
{
// The array that is being inserted is the same as this one.
// So we should iterate over the elements before the index,
// and then the elements after
for (asUINT n = 0; n < index; n++)
{
// This const cast is allowed, since we know the
// value will only be used to make a copy of it
void *value = const_cast<void*>(arr.At(n));
SetValue(index + n, value);
}
for (asUINT n = index + elements, m = 0; n < arr.GetSize(); n++, m++)
{
// This const cast is allowed, since we know the
// value will only be used to make a copy of it
void *value = const_cast<void*>(arr.At(n));
SetValue(index + index + m, value);
}
}
}
void CScriptArray::InsertLast(void *value)
{
InsertAt(buffer->numElements, value);
}
void CScriptArray::RemoveAt(asUINT index)
{
if( index >= buffer->numElements )
{
// If this is called from a script we raise a script exception
asIScriptContext *ctx = asGetActiveContext();
if( ctx )
ctx->SetException("Index out of bounds");
return;
}
// Remove the element
Resize(-1, index);
}
void CScriptArray::RemoveLast()
{
RemoveAt(buffer->numElements-1);
}
// Return a pointer to the array element. Returns 0 if the index is out of bounds
const void *CScriptArray::At(asUINT index) const
{
if( buffer == 0 || index >= buffer->numElements )
{
// If this is called from a script we raise a script exception
asIScriptContext *ctx = asGetActiveContext();
if( ctx )
ctx->SetException("Index out of bounds");
return 0;
}
if( (subTypeId & asTYPEID_MASK_OBJECT) && !(subTypeId & asTYPEID_OBJHANDLE) )
return *(void**)(buffer->data + elementSize*index);
else
return buffer->data + elementSize*index;
}
void *CScriptArray::At(asUINT index)
{
return const_cast<void*>(const_cast<const CScriptArray *>(this)->At(index));
}
void *CScriptArray::GetBuffer()
{
return buffer->data;
}
// internal
void CScriptArray::CreateBuffer(SArrayBuffer **buf, asUINT numElements)
{
*buf = reinterpret_cast<SArrayBuffer*>(userAlloc(sizeof(SArrayBuffer)-1+elementSize*numElements));
if( *buf )
{
(*buf)->numElements = numElements;
(*buf)->maxElements = numElements;
Construct(*buf, 0, numElements);
}
else
{
// Oops, out of memory
asIScriptContext *ctx = asGetActiveContext();
if( ctx )
ctx->SetException("Out of memory");
}
}
// internal
void CScriptArray::DeleteBuffer(SArrayBuffer *buf)
{
Destruct(buf, 0, buf->numElements);
// Free the buffer
userFree(buf);
}
// internal
void CScriptArray::Construct(SArrayBuffer *buf, asUINT start, asUINT end)
{
if( (subTypeId & asTYPEID_MASK_OBJECT) && !(subTypeId & asTYPEID_OBJHANDLE) )
{
// Create an object using the default constructor/factory for each element
void **max = (void**)(buf->data + end * sizeof(void*));
void **d = (void**)(buf->data + start * sizeof(void*));
asIScriptEngine *engine = objType->GetEngine();
asITypeInfo *subType = objType->GetSubType();
for( ; d < max; d++ )
{
*d = (void*)engine->CreateScriptObject(subType);
if( *d == 0 )
{
// Set the remaining entries to null so the destructor
// won't attempt to destroy invalid objects later
memset(d, 0, sizeof(void*)*(max-d));
// There is no need to set an exception on the context,
// as CreateScriptObject has already done that
return;
}
}
}
else
{
// Set all elements to zero whether they are handles or primitives
void *d = (void*)(buf->data + start * elementSize);
memset(d, 0, (end-start)*elementSize);
}
}
// internal
void CScriptArray::Destruct(SArrayBuffer *buf, asUINT start, asUINT end)
{
if( subTypeId & asTYPEID_MASK_OBJECT )
{
asIScriptEngine *engine = objType->GetEngine();
void **max = (void**)(buf->data + end * sizeof(void*));
void **d = (void**)(buf->data + start * sizeof(void*));
for( ; d < max; d++ )
{
if( *d )
engine->ReleaseScriptObject(*d, objType->GetSubType());
}
}
}
// internal
bool CScriptArray::Less(const void *a, const void *b, bool asc)
{
if( !asc )
{
// Swap items
const void *TEMP = a;
a = b;
b = TEMP;
}
if( !(subTypeId & ~asTYPEID_MASK_SEQNBR) )
{
// Simple compare of values
switch( subTypeId )
{
#define COMPARE(T) *((T*)a) < *((T*)b)
case asTYPEID_BOOL: return COMPARE(bool);
case asTYPEID_INT8: return COMPARE(signed char);
case asTYPEID_UINT8: return COMPARE(unsigned char);
case asTYPEID_INT16: return COMPARE(signed short);
case asTYPEID_UINT16: return COMPARE(unsigned short);
case asTYPEID_INT32: return COMPARE(signed int);
case asTYPEID_UINT32: return COMPARE(unsigned int);
case asTYPEID_FLOAT: return COMPARE(float);
case asTYPEID_DOUBLE: return COMPARE(double);
default: return COMPARE(signed int); // All enums fall in this case
#undef COMPARE
}
}
return false;
}
void CScriptArray::Reverse()
{
asUINT size = GetSize();
if( size >= 2 )
{
asBYTE TEMP[16];
for( asUINT i = 0; i < size / 2; i++ )
{
Copy(TEMP, GetArrayItemPointer(i));
Copy(GetArrayItemPointer(i), GetArrayItemPointer(size - i - 1));
Copy(GetArrayItemPointer(size - i - 1), TEMP);
}
}
}
bool CScriptArray::operator==(const CScriptArray &other) const
{
if( objType != other.objType )
return false;
if( GetSize() != other.GetSize() )
return false;
asIScriptContext *cmpContext = 0;
bool isNested = false;
if( subTypeId & ~asTYPEID_MASK_SEQNBR )
{
// Try to reuse the active context
cmpContext = asGetActiveContext();
if( cmpContext )
{
if( cmpContext->GetEngine() == objType->GetEngine() && cmpContext->PushState() >= 0 )
isNested = true;
else
cmpContext = 0;
}
if( cmpContext == 0 )
{
// TODO: Ideally this context would be retrieved from a pool, so we don't have to
// create a new one everytime. We could keep a context with the array object
// but that would consume a lot of resources as each context is quite heavy.
cmpContext = objType->GetEngine()->CreateContext();
}
}
// Check if all elements are equal
bool isEqual = true;
SArrayCache *cache = reinterpret_cast<SArrayCache*>(objType->GetUserData(ARRAY_CACHE));
for( asUINT n = 0; n < GetSize(); n++ )
if( !Equals(At(n), other.At(n), cmpContext, cache) )
{
isEqual = false;
break;
}
if( cmpContext )
{
if( isNested )
{
asEContextState state = cmpContext->GetState();
cmpContext->PopState();
if( state == asEXECUTION_ABORTED )
cmpContext->Abort();
}
else
cmpContext->Release();
}
return isEqual;
}
// internal
bool CScriptArray::Equals(const void *a, const void *b, asIScriptContext *ctx, SArrayCache *cache) const
{
if( !(subTypeId & ~asTYPEID_MASK_SEQNBR) )
{
// Simple compare of values
switch( subTypeId )
{
#define COMPARE(T) *((T*)a) == *((T*)b)
case asTYPEID_BOOL: return COMPARE(bool);
case asTYPEID_INT8: return COMPARE(signed char);
case asTYPEID_UINT8: return COMPARE(unsigned char);
case asTYPEID_INT16: return COMPARE(signed short);
case asTYPEID_UINT16: return COMPARE(unsigned short);
case asTYPEID_INT32: return COMPARE(signed int);
case asTYPEID_UINT32: return COMPARE(unsigned int);
case asTYPEID_FLOAT: return COMPARE(float);
case asTYPEID_DOUBLE: return COMPARE(double);
default: return COMPARE(signed int); // All enums fall here
#undef COMPARE
}
}
else
{
int r = 0;
if( subTypeId & asTYPEID_OBJHANDLE )
{
// Allow the find to work even if the array contains null handles
if( *(void**)a == *(void**)b ) return true;
}
// Execute object opEquals if available
if( cache && cache->eqFunc )
{
// TODO: Add proper error handling
r = ctx->Prepare(cache->eqFunc); assert(r >= 0);
if( subTypeId & asTYPEID_OBJHANDLE )
{
r = ctx->SetObject(*((void**)a)); assert(r >= 0);
r = ctx->SetArgObject(0, *((void**)b)); assert(r >= 0);
}
else
{
r = ctx->SetObject((void*)a); assert(r >= 0);
r = ctx->SetArgObject(0, (void*)b); assert(r >= 0);
}
r = ctx->Execute();
if( r == asEXECUTION_FINISHED )
return ctx->GetReturnByte() != 0;
return false;
}
// Execute object opCmp if available
if( cache && cache->cmpFunc )
{
// TODO: Add proper error handling
r = ctx->Prepare(cache->cmpFunc); assert(r >= 0);
if( subTypeId & asTYPEID_OBJHANDLE )
{
r = ctx->SetObject(*((void**)a)); assert(r >= 0);
r = ctx->SetArgObject(0, *((void**)b)); assert(r >= 0);
}
else
{
r = ctx->SetObject((void*)a); assert(r >= 0);
r = ctx->SetArgObject(0, (void*)b); assert(r >= 0);
}
r = ctx->Execute();
if( r == asEXECUTION_FINISHED )
return (int)ctx->GetReturnDWord() == 0;
return false;
}
}
return false;
}
int CScriptArray::FindByRef(void *ref) const
{
return FindByRef(0, ref);
}
int CScriptArray::FindByRef(asUINT startAt, void *ref) const
{
// Find the matching element by its reference
asUINT size = GetSize();
if( subTypeId & asTYPEID_OBJHANDLE )
{
// Dereference the pointer
ref = *(void**)ref;
for( asUINT i = startAt; i < size; i++ )
{
if( *(void**)At(i) == ref )
return i;
}
}
else
{
// Compare the reference directly
for( asUINT i = startAt; i < size; i++ )
{
if( At(i) == ref )
return i;
}
}
return -1;
}
int CScriptArray::Find(void *value) const
{
return Find(0, value);
}
int CScriptArray::Find(asUINT startAt, void *value) const
{
// Check if the subtype really supports find()
// TODO: Can't this be done at compile time too by the template callback
SArrayCache *cache = 0;
if( subTypeId & ~asTYPEID_MASK_SEQNBR )
{
cache = reinterpret_cast<SArrayCache*>(objType->GetUserData(ARRAY_CACHE));
if( !cache || (cache->cmpFunc == 0 && cache->eqFunc == 0) )
{
asIScriptContext *ctx = asGetActiveContext();
asITypeInfo* subType = objType->GetEngine()->GetTypeInfoById(subTypeId);
// Throw an exception
if( ctx )
{
char tmp[512];
if( cache && cache->eqFuncReturnCode == asMULTIPLE_FUNCTIONS )
#if defined(_MSC_VER) && _MSC_VER >= 1500 && !defined(__S3E__)
sprintf_s(tmp, 512, "Type '%s' has multiple matching opEquals or opCmp methods", subType->GetName());
#else
sprintf(tmp, "Type '%s' has multiple matching opEquals or opCmp methods", subType->GetName());
#endif
else
#if defined(_MSC_VER) && _MSC_VER >= 1500 && !defined(__S3E__)
sprintf_s(tmp, 512, "Type '%s' does not have a matching opEquals or opCmp method", subType->GetName());
#else
sprintf(tmp, "Type '%s' does not have a matching opEquals or opCmp method", subType->GetName());
#endif
ctx->SetException(tmp);
}
return -1;
}
}
asIScriptContext *cmpContext = 0;
bool isNested = false;
if( subTypeId & ~asTYPEID_MASK_SEQNBR )
{
// Try to reuse the active context
cmpContext = asGetActiveContext();
if( cmpContext )
{
if( cmpContext->GetEngine() == objType->GetEngine() && cmpContext->PushState() >= 0 )
isNested = true;
else
cmpContext = 0;
}
if( cmpContext == 0 )
{
// TODO: Ideally this context would be retrieved from a pool, so we don't have to
// create a new one everytime. We could keep a context with the array object
// but that would consume a lot of resources as each context is quite heavy.
cmpContext = objType->GetEngine()->CreateContext();
}
}
// Find the matching element
int ret = -1;
asUINT size = GetSize();
for( asUINT i = startAt; i < size; i++ )
{
// value passed by reference
if( Equals(At(i), value, cmpContext, cache) )
{
ret = (int)i;
break;
}
}
if( cmpContext )
{
if( isNested )
{
asEContextState state = cmpContext->GetState();
cmpContext->PopState();
if( state == asEXECUTION_ABORTED )
cmpContext->Abort();
}
else
cmpContext->Release();
}
return ret;
}
// internal
// Copy object handle or primitive value
// Even in arrays of objects the objects are allocated on
// the heap and the array stores the pointers to the objects
void CScriptArray::Copy(void *dst, void *src)
{
memcpy(dst, src, elementSize);
}
// internal
// Swap two elements
// Even in arrays of objects the objects are allocated on
// the heap and the array stores the pointers to the objects.
void CScriptArray::Swap(void* a, void* b)
{
asBYTE tmp[16];
Copy(tmp, a);
Copy(a, b);
Copy(b, tmp);
}
// internal
// Return pointer to array item (object handle or primitive value)
void *CScriptArray::GetArrayItemPointer(int index)
{
return buffer->data + index * elementSize;
}
// internal
// Return pointer to data in buffer (object or primitive)
void *CScriptArray::GetDataPointer(void *buf)
{
if ((subTypeId & asTYPEID_MASK_OBJECT) && !(subTypeId & asTYPEID_OBJHANDLE) )
{
// Real address of object
return reinterpret_cast<void*>(*(size_t*)buf);
}
else
{
// Primitive is just a raw data
return buf;
}
}
// Sort ascending
void CScriptArray::SortAsc()
{
Sort(0, GetSize(), true);
}
// Sort ascending
void CScriptArray::SortAsc(asUINT startAt, asUINT count)
{
Sort(startAt, count, true);
}
// Sort descending
void CScriptArray::SortDesc()
{
Sort(0, GetSize(), false);
}
// Sort descending
void CScriptArray::SortDesc(asUINT startAt, asUINT count)
{
Sort(startAt, count, false);
}
// internal
void CScriptArray::Sort(asUINT startAt, asUINT count, bool asc)
{
// Subtype isn't primitive and doesn't have opCmp
SArrayCache *cache = reinterpret_cast<SArrayCache*>(objType->GetUserData(ARRAY_CACHE));
if( subTypeId & ~asTYPEID_MASK_SEQNBR )
{
if( !cache || cache->cmpFunc == 0 )
{
asIScriptContext *ctx = asGetActiveContext();
asITypeInfo* subType = objType->GetEngine()->GetTypeInfoById(subTypeId);
// Throw an exception
if( ctx )
{
char tmp[512];
if( cache && cache->cmpFuncReturnCode == asMULTIPLE_FUNCTIONS )
#if defined(_MSC_VER) && _MSC_VER >= 1500 && !defined(__S3E__)
sprintf_s(tmp, 512, "Type '%s' has multiple matching opCmp methods", subType->GetName());
#else
sprintf(tmp, "Type '%s' has multiple matching opCmp methods", subType->GetName());
#endif
else
#if defined(_MSC_VER) && _MSC_VER >= 1500 && !defined(__S3E__)
sprintf_s(tmp, 512, "Type '%s' does not have a matching opCmp method", subType->GetName());
#else
sprintf(tmp, "Type '%s' does not have a matching opCmp method", subType->GetName());
#endif
ctx->SetException(tmp);
}
return;
}
}
// No need to sort
if( count < 2 )
{
return;
}
int start = startAt;
int end = startAt + count;
// Check if we could access invalid item while sorting
if( start >= (int)buffer->numElements || end > (int)buffer->numElements )
{
asIScriptContext *ctx = asGetActiveContext();
// Throw an exception
if( ctx )
{
ctx->SetException("Index out of bounds");
}
return;
}
if( subTypeId & ~asTYPEID_MASK_SEQNBR )
{
asIScriptContext *cmpContext = 0;
bool isNested = false;
// Try to reuse the active context
cmpContext = asGetActiveContext();
if( cmpContext )
{
if( cmpContext->GetEngine() == objType->GetEngine() && cmpContext->PushState() >= 0 )
isNested = true;
else
cmpContext = 0;
}
if( cmpContext == 0 )
cmpContext = objType->GetEngine()->RequestContext();
// Do the sorting
struct {
bool asc;
asIScriptContext *cmpContext;
asIScriptFunction *cmpFunc;
bool operator()(void *a, void *b) const
{
if( !asc )
{
// Swap items
void *TEMP = a;
a = b;
b = TEMP;
}
int r = 0;
// Allow sort to work even if the array contains null handles
if( a == 0 ) return true;
if( b == 0 ) return false;
// Execute object opCmp
if( cmpFunc )
{
// TODO: Add proper error handling
r = cmpContext->Prepare(cmpFunc); assert(r >= 0);
r = cmpContext->SetObject(a); assert(r >= 0);
r = cmpContext->SetArgObject(0, b); assert(r >= 0);
r = cmpContext->Execute();
if( r == asEXECUTION_FINISHED )
{
return (int)cmpContext->GetReturnDWord() < 0;
}
}
return false;
}
} customLess = {asc, cmpContext, cache ? cache->cmpFunc : 0};
std::sort((void**)GetArrayItemPointer(start), (void**)GetArrayItemPointer(end), customLess);
// Clean up
if( cmpContext )
{
if( isNested )
{
asEContextState state = cmpContext->GetState();
cmpContext->PopState();
if( state == asEXECUTION_ABORTED )
cmpContext->Abort();
}
else
objType->GetEngine()->ReturnContext(cmpContext);
}
}
else
{
// TODO: Use std::sort for primitive types too
// Insertion sort
asBYTE tmp[16];
for( int i = start + 1; i < end; i++ )
{
Copy(tmp, GetArrayItemPointer(i));
int j = i - 1;
while( j >= start && Less(GetDataPointer(tmp), At(j), asc) )
{
Copy(GetArrayItemPointer(j + 1), GetArrayItemPointer(j));
j--;
}
Copy(GetArrayItemPointer(j + 1), tmp);
}
}
}
// Sort with script callback for comparing elements
void CScriptArray::Sort(asIScriptFunction *func, asUINT startAt, asUINT count)
{
// No need to sort
if (count < 2)
return;
// Check if we could access invalid item while sorting
asUINT start = startAt;
asUINT end = asQWORD(startAt) + asQWORD(count) >= (asQWORD(1)<<32) ? 0xFFFFFFFF : startAt + count;
if (end > buffer->numElements)
end = buffer->numElements;
if (start >= buffer->numElements)
{
asIScriptContext *ctx = asGetActiveContext();
// Throw an exception
if (ctx)
ctx->SetException("Index out of bounds");
return;
}
asIScriptContext *cmpContext = 0;
bool isNested = false;
// Try to reuse the active context
cmpContext = asGetActiveContext();
if (cmpContext)
{
if (cmpContext->GetEngine() == objType->GetEngine() && cmpContext->PushState() >= 0)
isNested = true;
else
cmpContext = 0;
}
if (cmpContext == 0)
cmpContext = objType->GetEngine()->RequestContext();
// TODO: Security issue: If the array is accessed from the callback while the sort is going on the result may be unpredictable
// For example, the callback resizes the array in the middle of the sort
// Possible solution: set a lock flag on the array, and prohibit modifications while the lock flag is set
// Bubble sort
// TODO: optimize: Use an efficient sort algorithm
for (asUINT i = start; i+1 < end; i++)
{
asUINT best = i;
for (asUINT j = i + 1; j < end; j++)
{
cmpContext->Prepare(func);
cmpContext->SetArgAddress(0, At(j));
cmpContext->SetArgAddress(1, At(best));
int r = cmpContext->Execute();
if (r != asEXECUTION_FINISHED)
break;
if (*(bool*)(cmpContext->GetAddressOfReturnValue()))
best = j;
}
// With Swap we guarantee that the array always sees all references
// if the GC calls the EnumReferences in the middle of the sorting
if( best != i )
Swap(GetArrayItemPointer(i), GetArrayItemPointer(best));
}
if (cmpContext)
{
if (isNested)
{
asEContextState state = cmpContext->GetState();
cmpContext->PopState();
if (state == asEXECUTION_ABORTED)
cmpContext->Abort();
}
else
objType->GetEngine()->ReturnContext(cmpContext);
}
}
// internal
void CScriptArray::CopyBuffer(SArrayBuffer *dst, SArrayBuffer *src)
{
asIScriptEngine *engine = objType->GetEngine();
if( subTypeId & asTYPEID_OBJHANDLE )
{
// Copy the references and increase the reference counters
if( dst->numElements > 0 && src->numElements > 0 )
{
int count = dst->numElements > src->numElements ? src->numElements : dst->numElements;
void **max = (void**)(dst->data + count * sizeof(void*));
void **d = (void**)dst->data;
void **s = (void**)src->data;
for( ; d < max; d++, s++ )
{
void *tmp = *d;
*d = *s;
if( *d )
engine->AddRefScriptObject(*d, objType->GetSubType());
// Release the old ref after incrementing the new to avoid problem incase it is the same ref
if( tmp )
engine->ReleaseScriptObject(tmp, objType->GetSubType());
}
}
}
else
{
if( dst->numElements > 0 && src->numElements > 0 )
{
int count = dst->numElements > src->numElements ? src->numElements : dst->numElements;
if( subTypeId & asTYPEID_MASK_OBJECT )
{
// Call the assignment operator on all of the objects
void **max = (void**)(dst->data + count * sizeof(void*));
void **d = (void**)dst->data;
void **s = (void**)src->data;
asITypeInfo *subType = objType->GetSubType();
for( ; d < max; d++, s++ )
engine->AssignScriptObject(*d, *s, subType);
}
else
{
// Primitives are copied byte for byte
memcpy(dst->data, src->data, count*elementSize);
}
}
}
}
// internal
// Precache some info
void CScriptArray::Precache()
{
subTypeId = objType->GetSubTypeId();
// Check if it is an array of objects. Only for these do we need to cache anything
// Type ids for primitives and enums only has the sequence number part
if( !(subTypeId & ~asTYPEID_MASK_SEQNBR) )
return;
// The opCmp and opEquals methods are cached because the searching for the
// methods is quite time consuming if a lot of array objects are created.
// First check if a cache already exists for this array type
SArrayCache *cache = reinterpret_cast<SArrayCache*>(objType->GetUserData(ARRAY_CACHE));
if( cache ) return;
// We need to make sure the cache is created only once, even
// if multiple threads reach the same point at the same time
asAcquireExclusiveLock();
// Now that we got the lock, we need to check again to make sure the
// cache wasn't created while we were waiting for the lock
cache = reinterpret_cast<SArrayCache*>(objType->GetUserData(ARRAY_CACHE));
if( cache )
{
asReleaseExclusiveLock();
return;
}
// Create the cache
cache = reinterpret_cast<SArrayCache*>(userAlloc(sizeof(SArrayCache)));
if( !cache )
{
asIScriptContext *ctx = asGetActiveContext();
if( ctx )
ctx->SetException("Out of memory");
asReleaseExclusiveLock();
return;
}
memset(cache, 0, sizeof(SArrayCache));
// If the sub type is a handle to const, then the methods must be const too
bool mustBeConst = (subTypeId & asTYPEID_HANDLETOCONST) ? true : false;
asITypeInfo *subType = objType->GetEngine()->GetTypeInfoById(subTypeId);
if( subType )
{
for( asUINT i = 0; i < subType->GetMethodCount(); i++ )
{
asIScriptFunction *func = subType->GetMethodByIndex(i);
if( func->GetParamCount() == 1 && (!mustBeConst || func->IsReadOnly()) )
{
asDWORD flags = 0;
int returnTypeId = func->GetReturnTypeId(&flags);
// The method must not return a reference
if( flags != asTM_NONE )
continue;
// opCmp returns an int and opEquals returns a bool
bool isCmp = false, isEq = false;
if( returnTypeId == asTYPEID_INT32 && strcmp(func->GetName(), "opCmp") == 0 )
isCmp = true;
if( returnTypeId == asTYPEID_BOOL && strcmp(func->GetName(), "opEquals") == 0 )
isEq = true;
if( !isCmp && !isEq )
continue;
// The parameter must either be a reference to the subtype or a handle to the subtype
int paramTypeId;
func->GetParam(0, ¶mTypeId, &flags);
if( (paramTypeId & ~(asTYPEID_OBJHANDLE|asTYPEID_HANDLETOCONST)) != (subTypeId & ~(asTYPEID_OBJHANDLE|asTYPEID_HANDLETOCONST)) )
continue;
if( (flags & asTM_INREF) )
{
if( (paramTypeId & asTYPEID_OBJHANDLE) || (mustBeConst && !(flags & asTM_CONST)) )
continue;
}
else if( paramTypeId & asTYPEID_OBJHANDLE )
{
if( mustBeConst && !(paramTypeId & asTYPEID_HANDLETOCONST) )
continue;
}
else
continue;
if( isCmp )
{
if( cache->cmpFunc || cache->cmpFuncReturnCode )
{
cache->cmpFunc = 0;
cache->cmpFuncReturnCode = asMULTIPLE_FUNCTIONS;
}
else
cache->cmpFunc = func;
}
else if( isEq )
{
if( cache->eqFunc || cache->eqFuncReturnCode )
{
cache->eqFunc = 0;
cache->eqFuncReturnCode = asMULTIPLE_FUNCTIONS;
}
else
cache->eqFunc = func;
}
}
}
}
if( cache->eqFunc == 0 && cache->eqFuncReturnCode == 0 )
cache->eqFuncReturnCode = asNO_FUNCTION;
if( cache->cmpFunc == 0 && cache->cmpFuncReturnCode == 0 )
cache->cmpFuncReturnCode = asNO_FUNCTION;
// Set the user data only at the end so others that retrieve it will know it is complete
objType->SetUserData(cache, ARRAY_CACHE);
asReleaseExclusiveLock();
}
// GC behaviour
void CScriptArray::EnumReferences(asIScriptEngine *engine)
{
// TODO: If garbage collection can be done from a separate thread, then this method must be
// protected so that it doesn't get lost during the iteration if the array is modified
// If the array is holding handles, then we need to notify the GC of them
if( subTypeId & asTYPEID_MASK_OBJECT )
{
void **d = (void**)buffer->data;
asITypeInfo *subType = engine->GetTypeInfoById(subTypeId);
if ((subType->GetFlags() & asOBJ_REF))
{
// For reference types we need to notify the GC of each instance
for (asUINT n = 0; n < buffer->numElements; n++)
{
if (d[n])
engine->GCEnumCallback(d[n]);
}
}
else if ((subType->GetFlags() & asOBJ_VALUE) && (subType->GetFlags() & asOBJ_GC))
{
// For value types we need to forward the enum callback
// to the object so it can decide what to do
for (asUINT n = 0; n < buffer->numElements; n++)
{
if (d[n])
engine->ForwardGCEnumReferences(d[n], subType);
}
}
}
}
// GC behaviour
void CScriptArray::ReleaseAllHandles(asIScriptEngine *)
{
// Resizing to zero will release everything
Resize(0);
}
void CScriptArray::AddRef() const
{
// Clear the GC flag then increase the counter
gcFlag = false;
asAtomicInc(refCount);
}
void CScriptArray::Release() const
{
// Clearing the GC flag then descrease the counter
gcFlag = false;
if( asAtomicDec(refCount) == 0 )
{
// When reaching 0 no more references to this instance
// exists and the object should be destroyed
this->~CScriptArray();
userFree(const_cast<CScriptArray*>(this));
}
}
// GC behaviour
int CScriptArray::GetRefCount()
{
return refCount;
}
// GC behaviour
void CScriptArray::SetFlag()
{
gcFlag = true;
}
// GC behaviour
bool CScriptArray::GetFlag()
{
return gcFlag;
}
//--------------------------------------------
// Generic calling conventions
static void ScriptArrayFactory_Generic(asIScriptGeneric *gen)
{
asITypeInfo *ti = *(asITypeInfo**)gen->GetAddressOfArg(0);
*reinterpret_cast<CScriptArray**>(gen->GetAddressOfReturnLocation()) = CScriptArray::Create(ti);
}
static void ScriptArrayFactory2_Generic(asIScriptGeneric *gen)
{
asITypeInfo *ti = *(asITypeInfo**)gen->GetAddressOfArg(0);
asUINT length = gen->GetArgDWord(1);
*reinterpret_cast<CScriptArray**>(gen->GetAddressOfReturnLocation()) = CScriptArray::Create(ti, length);
}
static void ScriptArrayListFactory_Generic(asIScriptGeneric *gen)
{
asITypeInfo *ti = *(asITypeInfo**)gen->GetAddressOfArg(0);
void *buf = gen->GetArgAddress(1);
*reinterpret_cast<CScriptArray**>(gen->GetAddressOfReturnLocation()) = CScriptArray::Create(ti, buf);
}
static void ScriptArrayFactoryDefVal_Generic(asIScriptGeneric *gen)
{
asITypeInfo *ti = *(asITypeInfo**)gen->GetAddressOfArg(0);
asUINT length = gen->GetArgDWord(1);
void *defVal = gen->GetArgAddress(2);
*reinterpret_cast<CScriptArray**>(gen->GetAddressOfReturnLocation()) = CScriptArray::Create(ti, length, defVal);
}
static void ScriptArrayTemplateCallback_Generic(asIScriptGeneric *gen)
{
asITypeInfo *ti = *(asITypeInfo**)gen->GetAddressOfArg(0);
bool *dontGarbageCollect = *(bool**)gen->GetAddressOfArg(1);
*reinterpret_cast<bool*>(gen->GetAddressOfReturnLocation()) = ScriptArrayTemplateCallback(ti, *dontGarbageCollect);
}
static void ScriptArrayAssignment_Generic(asIScriptGeneric *gen)
{
CScriptArray *other = (CScriptArray*)gen->GetArgObject(0);
CScriptArray *self = (CScriptArray*)gen->GetObject();
*self = *other;
gen->SetReturnObject(self);
}
static void ScriptArrayEquals_Generic(asIScriptGeneric *gen)
{
CScriptArray *other = (CScriptArray*)gen->GetArgObject(0);
CScriptArray *self = (CScriptArray*)gen->GetObject();
gen->SetReturnByte(self->operator==(*other));
}
static void ScriptArrayFind_Generic(asIScriptGeneric *gen)
{
void *value = gen->GetArgAddress(0);
CScriptArray *self = (CScriptArray*)gen->GetObject();
gen->SetReturnDWord(self->Find(value));
}
static void ScriptArrayFind2_Generic(asIScriptGeneric *gen)
{
asUINT index = gen->GetArgDWord(0);
void *value = gen->GetArgAddress(1);
CScriptArray *self = (CScriptArray*)gen->GetObject();
gen->SetReturnDWord(self->Find(index, value));
}
static void ScriptArrayFindByRef_Generic(asIScriptGeneric *gen)
{
void *value = gen->GetArgAddress(0);
CScriptArray *self = (CScriptArray*)gen->GetObject();
gen->SetReturnDWord(self->FindByRef(value));
}
static void ScriptArrayFindByRef2_Generic(asIScriptGeneric *gen)
{
asUINT index = gen->GetArgDWord(0);
void *value = gen->GetArgAddress(1);
CScriptArray *self = (CScriptArray*)gen->GetObject();
gen->SetReturnDWord(self->FindByRef(index, value));
}
static void ScriptArrayAt_Generic(asIScriptGeneric *gen)
{
asUINT index = gen->GetArgDWord(0);
CScriptArray *self = (CScriptArray*)gen->GetObject();
gen->SetReturnAddress(self->At(index));
}
static void ScriptArrayInsertAt_Generic(asIScriptGeneric *gen)
{
asUINT index = gen->GetArgDWord(0);
void *value = gen->GetArgAddress(1);
CScriptArray *self = (CScriptArray*)gen->GetObject();
self->InsertAt(index, value);
}
static void ScriptArrayInsertAtArray_Generic(asIScriptGeneric *gen)
{
asUINT index = gen->GetArgDWord(0);
CScriptArray *array = (CScriptArray*)gen->GetArgAddress(1);
CScriptArray *self = (CScriptArray*)gen->GetObject();
self->InsertAt(index, *array);
}
static void ScriptArrayRemoveAt_Generic(asIScriptGeneric *gen)
{
asUINT index = gen->GetArgDWord(0);
CScriptArray *self = (CScriptArray*)gen->GetObject();
self->RemoveAt(index);
}
static void ScriptArrayRemoveRange_Generic(asIScriptGeneric *gen)
{
asUINT start = gen->GetArgDWord(0);
asUINT count = gen->GetArgDWord(1);
CScriptArray *self = (CScriptArray*)gen->GetObject();
self->RemoveRange(start, count);
}
static void ScriptArrayInsertLast_Generic(asIScriptGeneric *gen)
{
void *value = gen->GetArgAddress(0);
CScriptArray *self = (CScriptArray*)gen->GetObject();
self->InsertLast(value);
}
static void ScriptArrayRemoveLast_Generic(asIScriptGeneric *gen)
{
CScriptArray *self = (CScriptArray*)gen->GetObject();
self->RemoveLast();
}
static void ScriptArrayLength_Generic(asIScriptGeneric *gen)
{
CScriptArray *self = (CScriptArray*)gen->GetObject();
gen->SetReturnDWord(self->GetSize());
}
static void ScriptArrayResize_Generic(asIScriptGeneric *gen)
{
asUINT size = gen->GetArgDWord(0);
CScriptArray *self = (CScriptArray*)gen->GetObject();
self->Resize(size);
}
static void ScriptArrayReserve_Generic(asIScriptGeneric *gen)
{
asUINT size = gen->GetArgDWord(0);
CScriptArray *self = (CScriptArray*)gen->GetObject();
self->Reserve(size);
}
static void ScriptArraySortAsc_Generic(asIScriptGeneric *gen)
{
CScriptArray *self = (CScriptArray*)gen->GetObject();
self->SortAsc();
}
static void ScriptArrayReverse_Generic(asIScriptGeneric *gen)
{
CScriptArray *self = (CScriptArray*)gen->GetObject();
self->Reverse();
}
static void ScriptArrayIsEmpty_Generic(asIScriptGeneric *gen)
{
CScriptArray *self = (CScriptArray*)gen->GetObject();
*reinterpret_cast<bool*>(gen->GetAddressOfReturnLocation()) = self->IsEmpty();
}
static void ScriptArraySortAsc2_Generic(asIScriptGeneric *gen)
{
asUINT index = gen->GetArgDWord(0);
asUINT count = gen->GetArgDWord(1);
CScriptArray *self = (CScriptArray*)gen->GetObject();
self->SortAsc(index, count);
}
static void ScriptArraySortDesc_Generic(asIScriptGeneric *gen)
{
CScriptArray *self = (CScriptArray*)gen->GetObject();
self->SortDesc();
}
static void ScriptArraySortDesc2_Generic(asIScriptGeneric *gen)
{
asUINT index = gen->GetArgDWord(0);
asUINT count = gen->GetArgDWord(1);
CScriptArray *self = (CScriptArray*)gen->GetObject();
self->SortDesc(index, count);
}
static void ScriptArraySortCallback_Generic(asIScriptGeneric *gen)
{
asIScriptFunction *callback = (asIScriptFunction*)gen->GetArgAddress(0);
asUINT startAt = gen->GetArgDWord(1);
asUINT count = gen->GetArgDWord(2);
CScriptArray *self = (CScriptArray*)gen->GetObject();
self->Sort(callback, startAt, count);
}
static void ScriptArrayAddRef_Generic(asIScriptGeneric *gen)
{
CScriptArray *self = (CScriptArray*)gen->GetObject();
self->AddRef();
}
static void ScriptArrayRelease_Generic(asIScriptGeneric *gen)
{
CScriptArray *self = (CScriptArray*)gen->GetObject();
self->Release();
}
static void ScriptArrayGetRefCount_Generic(asIScriptGeneric *gen)
{
CScriptArray *self = (CScriptArray*)gen->GetObject();
*reinterpret_cast<int*>(gen->GetAddressOfReturnLocation()) = self->GetRefCount();
}
static void ScriptArraySetFlag_Generic(asIScriptGeneric *gen)
{
CScriptArray *self = (CScriptArray*)gen->GetObject();
self->SetFlag();
}
static void ScriptArrayGetFlag_Generic(asIScriptGeneric *gen)
{
CScriptArray *self = (CScriptArray*)gen->GetObject();
*reinterpret_cast<bool*>(gen->GetAddressOfReturnLocation()) = self->GetFlag();
}
static void ScriptArrayEnumReferences_Generic(asIScriptGeneric *gen)
{
CScriptArray *self = (CScriptArray*)gen->GetObject();
asIScriptEngine *engine = *(asIScriptEngine**)gen->GetAddressOfArg(0);
self->EnumReferences(engine);
}
static void ScriptArrayReleaseAllHandles_Generic(asIScriptGeneric *gen)
{
CScriptArray *self = (CScriptArray*)gen->GetObject();
asIScriptEngine *engine = *(asIScriptEngine**)gen->GetAddressOfArg(0);
self->ReleaseAllHandles(engine);
}
static void RegisterScriptArray_Generic(asIScriptEngine *engine)
{
int r = 0;
UNUSED_VAR(r);
engine->SetTypeInfoUserDataCleanupCallback(CleanupTypeInfoArrayCache, ARRAY_CACHE);
r = engine->RegisterObjectType("array<class T>", 0, asOBJ_REF | asOBJ_GC | asOBJ_TEMPLATE); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_TEMPLATE_CALLBACK, "bool f(int&in, bool&out)", asFUNCTION(ScriptArrayTemplateCallback_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_FACTORY, "array<T>@ f(int&in)", asFUNCTION(ScriptArrayFactory_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_FACTORY, "array<T>@ f(int&in, uint length) explicit", asFUNCTION(ScriptArrayFactory2_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_FACTORY, "array<T>@ f(int&in, uint length, const T &in value)", asFUNCTION(ScriptArrayFactoryDefVal_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_LIST_FACTORY, "array<T>@ f(int&in, int&in) {repeat T}", asFUNCTION(ScriptArrayListFactory_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_ADDREF, "void f()", asFUNCTION(ScriptArrayAddRef_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_RELEASE, "void f()", asFUNCTION(ScriptArrayRelease_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "T &opIndex(uint index)", asFUNCTION(ScriptArrayAt_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "const T &opIndex(uint index) const", asFUNCTION(ScriptArrayAt_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "array<T> &opAssign(const array<T>&in)", asFUNCTION(ScriptArrayAssignment_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void insertAt(uint index, const T&in value)", asFUNCTION(ScriptArrayInsertAt_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void insertAt(uint index, const array<T>& arr)", asFUNCTION(ScriptArrayInsertAtArray_Generic), asCALL_GENERIC); assert(r >= 0);
r = engine->RegisterObjectMethod("array<T>", "void insertLast(const T&in value)", asFUNCTION(ScriptArrayInsertLast_Generic), asCALL_GENERIC); assert(r >= 0);
r = engine->RegisterObjectMethod("array<T>", "void removeAt(uint index)", asFUNCTION(ScriptArrayRemoveAt_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void removeLast()", asFUNCTION(ScriptArrayRemoveLast_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void removeRange(uint start, uint count)", asFUNCTION(ScriptArrayRemoveRange_Generic), asCALL_GENERIC); assert(r >= 0);
#if AS_USE_ACCESSORS != 1
r = engine->RegisterObjectMethod("array<T>", "uint length() const", asFUNCTION(ScriptArrayLength_Generic), asCALL_GENERIC); assert( r >= 0 );
#endif
r = engine->RegisterObjectMethod("array<T>", "void reserve(uint length)", asFUNCTION(ScriptArrayReserve_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void resize(uint length)", asFUNCTION(ScriptArrayResize_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void sortAsc()", asFUNCTION(ScriptArraySortAsc_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void sortAsc(uint startAt, uint count)", asFUNCTION(ScriptArraySortAsc2_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void sortDesc()", asFUNCTION(ScriptArraySortDesc_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void sortDesc(uint startAt, uint count)", asFUNCTION(ScriptArraySortDesc2_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void reverse()", asFUNCTION(ScriptArrayReverse_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "int find(const T&in if_handle_then_const value) const", asFUNCTION(ScriptArrayFind_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "int find(uint startAt, const T&in if_handle_then_const value) const", asFUNCTION(ScriptArrayFind2_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "int findByRef(const T&in if_handle_then_const value) const", asFUNCTION(ScriptArrayFindByRef_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "int findByRef(uint startAt, const T&in if_handle_then_const value) const", asFUNCTION(ScriptArrayFindByRef2_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "bool opEquals(const array<T>&in) const", asFUNCTION(ScriptArrayEquals_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "bool isEmpty() const", asFUNCTION(ScriptArrayIsEmpty_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterFuncdef("bool array<T>::less(const T&in if_handle_then_const a, const T&in if_handle_then_const b)");
r = engine->RegisterObjectMethod("array<T>", "void sort(const less &in, uint startAt = 0, uint count = uint(-1))", asFUNCTION(ScriptArraySortCallback_Generic), asCALL_GENERIC); assert(r >= 0);
#if AS_USE_STLNAMES != 1 && AS_USE_ACCESSORS == 1
r = engine->RegisterObjectMethod("array<T>", "uint get_length() const property", asFUNCTION(ScriptArrayLength_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectMethod("array<T>", "void set_length(uint) property", asFUNCTION(ScriptArrayResize_Generic), asCALL_GENERIC); assert( r >= 0 );
#endif
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_GETREFCOUNT, "int f()", asFUNCTION(ScriptArrayGetRefCount_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_SETGCFLAG, "void f()", asFUNCTION(ScriptArraySetFlag_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_GETGCFLAG, "bool f()", asFUNCTION(ScriptArrayGetFlag_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_ENUMREFS, "void f(int&in)", asFUNCTION(ScriptArrayEnumReferences_Generic), asCALL_GENERIC); assert( r >= 0 );
r = engine->RegisterObjectBehaviour("array<T>", asBEHAVE_RELEASEREFS, "void f(int&in)", asFUNCTION(ScriptArrayReleaseAllHandles_Generic), asCALL_GENERIC); assert( r >= 0 );
}
END_AS_NAMESPACE
|