Skip to content
This repository

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
tree: 70951bc71b
Fetching contributors…

Cannot retrieve contributors at this time

file 2284 lines (2006 sloc) 59.196 kb
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
/*
===========================================================================

Return to Castle Wolfenstein single player GPL Source Code
Copyright (C) 1999-2010 id Software LLC, a ZeniMax Media company.

This file is part of the Return to Castle Wolfenstein single player GPL Source Code (“RTCW SP Source Code”).

RTCW SP Source Code is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.

RTCW SP Source Code is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with RTCW SP Source Code. If not, see <http://www.gnu.org/licenses/>.

In addition, the RTCW SP Source Code is also subject to certain additional terms. You should have received a copy of these additional terms immediately following the terms and conditions of the GNU General Public License which accompanied the RTCW SP Source Code. If not, please request a copy in writing from id Software at the address below.

If you have questions concerning this license or the applicable additional terms, you may contact in writing id Software LLC, c/o ZeniMax Media Inc., Suite 120, Rockville, Maryland 20850 USA.

===========================================================================
*/

#include "../game/q_shared.h"
#include "qcommon.h"

static huffman_t msgHuff;
static qboolean msgInit = qfalse;

/*
==============================================================================

MESSAGE IO FUNCTIONS

Handles byte ordering and avoids alignment errors
==============================================================================
*/

int oldsize = 0;

void MSG_initHuffman();

void MSG_Init( msg_t *buf, byte *data, int length ) {
if ( !msgInit ) {
MSG_initHuffman();
}
memset( buf, 0, sizeof( *buf ) );
buf->data = data;
buf->maxsize = length;
}

void MSG_InitOOB( msg_t *buf, byte *data, int length ) {
if ( !msgInit ) {
MSG_initHuffman();
}
memset( buf, 0, sizeof( *buf ) );
buf->data = data;
buf->maxsize = length;
buf->oob = qtrue;
}

void MSG_Clear( msg_t *buf ) {
buf->cursize = 0;
buf->overflowed = qfalse;
buf->bit = 0; //<- in bits
}


void MSG_Bitstream( msg_t *buf ) {
buf->oob = qfalse;
}

void MSG_BeginReading( msg_t *msg ) {
msg->readcount = 0;
msg->bit = 0;
msg->oob = qfalse;
}

void MSG_BeginReadingOOB( msg_t *msg ) {
msg->readcount = 0;
msg->bit = 0;
msg->oob = qtrue;
}


/*
=============================================================================

bit functions

=============================================================================
*/

int overflows;

// negative bit values include signs
void MSG_WriteBits( msg_t *msg, int value, int bits ) {
int i;
// FILE* fp;

oldsize += bits;

// this isn't an exact overflow check, but close enough
if ( msg->maxsize - msg->cursize < 4 ) {
msg->overflowed = qtrue;
return;
}

if ( bits == 0 || bits < -31 || bits > 32 ) {
Com_Error( ERR_DROP, "MSG_WriteBits: bad bits %i", bits );
}

// check for overflows
if ( bits != 32 ) {
if ( bits > 0 ) {
if ( value > ( ( 1 << bits ) - 1 ) || value < 0 ) {
overflows++;
}
} else {
int r;

r = 1 << ( bits - 1 );

if ( value > r - 1 || value < -r ) {
overflows++;
}
}
}
if ( bits < 0 ) {
bits = -bits;
}
if ( msg->oob ) {
if ( bits == 8 ) {
msg->data[msg->cursize] = value;
msg->cursize += 1;
msg->bit += 8;
} else if ( bits == 16 ) {
unsigned short *sp = (unsigned short *)&msg->data[msg->cursize];
*sp = LittleShort( value );
msg->cursize += 2;
msg->bit += 16;
} else if ( bits == 32 ) {
unsigned int *ip = (unsigned int *)&msg->data[msg->cursize];
*ip = LittleLong( value );
msg->cursize += 4;
msg->bit += 8;
} else {
Com_Error( ERR_DROP, "can't read %d bits\n", bits );
}
} else {
// fp = fopen("c:\\netchan.bin", "a");
value &= ( 0xffffffff >> ( 32 - bits ) );
if ( bits & 7 ) {
int nbits;
nbits = bits & 7;
for ( i = 0; i < nbits; i++ ) {
Huff_putBit( ( value & 1 ), msg->data, &msg->bit );
value = ( value >> 1 );
}
bits = bits - nbits;
}
if ( bits ) {
for ( i = 0; i < bits; i += 8 ) {
// fwrite(bp, 1, 1, fp);
Huff_offsetTransmit( &msgHuff.compressor, ( value & 0xff ), msg->data, &msg->bit );
value = ( value >> 8 );
}
}
msg->cursize = ( msg->bit >> 3 ) + 1;
// fclose(fp);
}
}

int MSG_ReadBits( msg_t *msg, int bits ) {
int value;
int get;
qboolean sgn;
int i, nbits;
// FILE* fp;

value = 0;

if ( bits < 0 ) {
bits = -bits;
sgn = qtrue;
} else {
sgn = qfalse;
}

if ( msg->oob ) {
if ( bits == 8 ) {
value = msg->data[msg->readcount];
msg->readcount += 1;
msg->bit += 8;
} else if ( bits == 16 ) {
unsigned short *sp = (unsigned short *)&msg->data[msg->readcount];
value = LittleShort( *sp );
msg->readcount += 2;
msg->bit += 16;
} else if ( bits == 32 ) {
unsigned int *ip = (unsigned int *)&msg->data[msg->readcount];
value = LittleLong( *ip );
msg->readcount += 4;
msg->bit += 32;
} else {
Com_Error( ERR_DROP, "can't read %d bits\n", bits );
}
} else {
nbits = 0;
if ( bits & 7 ) {
nbits = bits & 7;
for ( i = 0; i < nbits; i++ ) {
value |= ( Huff_getBit( msg->data, &msg->bit ) << i );
}
bits = bits - nbits;
}
if ( bits ) {
// fp = fopen("c:\\netchan.bin", "a");
for ( i = 0; i < bits; i += 8 ) {
Huff_offsetReceive( msgHuff.decompressor.tree, &get, msg->data, &msg->bit );
// fwrite(&get, 1, 1, fp);
value |= ( get << ( i + nbits ) );
}
// fclose(fp);
}
msg->readcount = ( msg->bit >> 3 ) + 1;
}
if ( sgn ) {
if ( value & ( 1 << ( bits - 1 ) ) ) {
value |= -1 ^ ( ( 1 << bits ) - 1 );
}
}

return value;
}



//================================================================================

//
// writing functions
//

void MSG_WriteChar( msg_t *sb, int c ) {
#ifdef PARANOID
if ( c < -128 || c > 127 ) {
Com_Error( ERR_FATAL, "MSG_WriteChar: range error" );
}
#endif

MSG_WriteBits( sb, c, 8 );
}

void MSG_WriteByte( msg_t *sb, int c ) {
#ifdef PARANOID
if ( c < 0 || c > 255 ) {
Com_Error( ERR_FATAL, "MSG_WriteByte: range error" );
}
#endif

MSG_WriteBits( sb, c, 8 );
}

void MSG_WriteData( msg_t *buf, const void *data, int length ) {
int i;
for ( i = 0; i < length; i++ ) {
MSG_WriteByte( buf, ( (byte *)data )[i] );
}
}

void MSG_WriteShort( msg_t *sb, int c ) {
#ifdef PARANOID
if ( c < ( (short)0x8000 ) || c > (short)0x7fff ) {
Com_Error( ERR_FATAL, "MSG_WriteShort: range error" );
}
#endif

MSG_WriteBits( sb, c, 16 );
}

void MSG_WriteLong( msg_t *sb, int c ) {
MSG_WriteBits( sb, c, 32 );
}

void MSG_WriteFloat( msg_t *sb, float f ) {
union {
float f;
int l;
} dat;

dat.f = f;
MSG_WriteBits( sb, dat.l, 32 );
}

void MSG_WriteString( msg_t *sb, const char *s ) {
if ( !s ) {
MSG_WriteData( sb, "", 1 );
} else {
int l,i;
char string[MAX_STRING_CHARS];

l = strlen( s );
if ( l >= MAX_STRING_CHARS ) {
Com_Printf( "MSG_WriteString: MAX_STRING_CHARS" );
MSG_WriteData( sb, "", 1 );
return;
}
Q_strncpyz( string, s, sizeof( string ) );

// get rid of 0xff chars, because old clients don't like them
for ( i = 0 ; i < l ; i++ ) {
if ( ( (byte *)string )[i] > 127 ) {
string[i] = '.';
}
}

MSG_WriteData( sb, string, l + 1 );
}
}

void MSG_WriteBigString( msg_t *sb, const char *s ) {
if ( !s ) {
MSG_WriteData( sb, "", 1 );
} else {
int l, i;
char string[BIG_INFO_STRING];

l = strlen( s );
if ( l >= BIG_INFO_STRING ) {
Com_Printf( "MSG_WriteString: BIG_INFO_STRING" );
MSG_WriteData( sb, "", 1 );
return;
}
Q_strncpyz( string, s, sizeof( string ) );

// get rid of 0xff chars, because old clients don't like them
for ( i = 0 ; i < l ; i++ ) {
if ( ( (byte *)string )[i] > 127 ) {
string[i] = '.';
}
}

MSG_WriteData( sb, string, l + 1 );
}
}

void MSG_WriteAngle( msg_t *sb, float f ) {
MSG_WriteByte( sb, (int)( f * 256 / 360 ) & 255 );
}

void MSG_WriteAngle16( msg_t *sb, float f ) {
MSG_WriteShort( sb, ANGLE2SHORT( f ) );
}


//============================================================

//
// reading functions
//

// returns -1 if no more characters are available
int MSG_ReadChar( msg_t *msg ) {
int c;

c = (signed char)MSG_ReadBits( msg, 8 );
if ( msg->readcount > msg->cursize ) {
c = -1;
}

return c;
}

int MSG_ReadByte( msg_t *msg ) {
int c;

c = (unsigned char)MSG_ReadBits( msg, 8 );
if ( msg->readcount > msg->cursize ) {
c = -1;
}
return c;
}

int MSG_ReadShort( msg_t *msg ) {
int c;

c = (short)MSG_ReadBits( msg, 16 );
if ( msg->readcount > msg->cursize ) {
c = -1;
}

return c;
}

int MSG_ReadLong( msg_t *msg ) {
int c;

c = MSG_ReadBits( msg, 32 );
if ( msg->readcount > msg->cursize ) {
c = -1;
}

return c;
}

float MSG_ReadFloat( msg_t *msg ) {
union {
byte b[4];
float f;
int l;
} dat;

dat.l = MSG_ReadBits( msg, 32 );
if ( msg->readcount > msg->cursize ) {
dat.f = -1;
}

return dat.f;
}

char *MSG_ReadString( msg_t *msg ) {
static char string[MAX_STRING_CHARS];
int l,c;

l = 0;
do {
c = MSG_ReadByte( msg ); // use ReadByte so -1 is out of bounds
if ( c == -1 || c == 0 ) {
break;
}
// translate all fmt spec to avoid crash bugs
if ( c == '%' ) {
c = '.';
}
// don't allow higher ascii values
if ( c > 127 ) {
c = '.';
}

string[l] = c;
l++;
} while ( l < sizeof( string ) - 1 );

string[l] = 0;

return string;
}

char *MSG_ReadBigString( msg_t *msg ) {
static char string[BIG_INFO_STRING];
int l,c;

l = 0;
do {
c = MSG_ReadByte( msg ); // use ReadByte so -1 is out of bounds
if ( c == -1 || c == 0 ) {
break;
}
// translate all fmt spec to avoid crash bugs
if ( c == '%' ) {
c = '.';
}

string[l] = c;
l++;
} while ( l < sizeof( string ) - 1 );

string[l] = 0;

return string;
}

char *MSG_ReadStringLine( msg_t *msg ) {
static char string[MAX_STRING_CHARS];
int l,c;

l = 0;
do {
c = MSG_ReadByte( msg ); // use ReadByte so -1 is out of bounds
if ( c == -1 || c == 0 || c == '\n' ) {
break;
}
// translate all fmt spec to avoid crash bugs
if ( c == '%' ) {
c = '.';
}
string[l] = c;
l++;
} while ( l < sizeof( string ) - 1 );

string[l] = 0;

return string;
}

float MSG_ReadAngle16( msg_t *msg ) {
return SHORT2ANGLE( MSG_ReadShort( msg ) );
}

void MSG_ReadData( msg_t *msg, void *data, int len ) {
int i;

for ( i = 0 ; i < len ; i++ ) {
( (byte *)data )[i] = MSG_ReadByte( msg );
}
}


/*
=============================================================================

delta functions

=============================================================================
*/

extern cvar_t *cl_shownet;

#define LOG( x ) if ( cl_shownet && cl_shownet->integer == 4 ) { Com_Printf( "%s ", x ); };

void MSG_WriteDelta( msg_t *msg, int oldV, int newV, int bits ) {
if ( oldV == newV ) {
MSG_WriteBits( msg, 0, 1 );
return;
}
MSG_WriteBits( msg, 1, 1 );
MSG_WriteBits( msg, newV, bits );
}

int MSG_ReadDelta( msg_t *msg, int oldV, int bits ) {
if ( MSG_ReadBits( msg, 1 ) ) {
return MSG_ReadBits( msg, bits );
}
return oldV;
}

void MSG_WriteDeltaFloat( msg_t *msg, float oldV, float newV ) {
if ( oldV == newV ) {
MSG_WriteBits( msg, 0, 1 );
return;
}
MSG_WriteBits( msg, 1, 1 );
MSG_WriteBits( msg, *(int *)&newV, 32 );
}

float MSG_ReadDeltaFloat( msg_t *msg, float oldV ) {
if ( MSG_ReadBits( msg, 1 ) ) {
float newV;

*(int *)&newV = MSG_ReadBits( msg, 32 );
return newV;
}
return oldV;
}

/*
=============================================================================

delta functions with keys

=============================================================================
*/

int kbitmask[32] = {
0x00000001, 0x00000003, 0x00000007, 0x0000000F,
0x0000001F, 0x0000003F, 0x0000007F, 0x000000FF,
0x000001FF, 0x000003FF, 0x000007FF, 0x00000FFF,
0x00001FFF, 0x00003FFF, 0x00007FFF, 0x0000FFFF,
0x0001FFFF, 0x0003FFFF, 0x0007FFFF, 0x000FFFFF,
0x001FFFFf, 0x003FFFFF, 0x007FFFFF, 0x00FFFFFF,
0x01FFFFFF, 0x03FFFFFF, 0x07FFFFFF, 0x0FFFFFFF,
0x1FFFFFFF, 0x3FFFFFFF, 0x7FFFFFFF, 0xFFFFFFFF,
};

void MSG_WriteDeltaKey( msg_t *msg, int key, int oldV, int newV, int bits ) {
if ( oldV == newV ) {
MSG_WriteBits( msg, 0, 1 );
return;
}
MSG_WriteBits( msg, 1, 1 );
MSG_WriteBits( msg, newV ^ key, bits );
}

int MSG_ReadDeltaKey( msg_t *msg, int key, int oldV, int bits ) {
if ( MSG_ReadBits( msg, 1 ) ) {
return MSG_ReadBits( msg, bits ) ^ ( key & kbitmask[bits] );
}
return oldV;
}

void MSG_WriteDeltaKeyFloat( msg_t *msg, int key, float oldV, float newV ) {
if ( oldV == newV ) {
MSG_WriteBits( msg, 0, 1 );
return;
}
MSG_WriteBits( msg, 1, 1 );
MSG_WriteBits( msg, ( *(int *)&newV ) ^ key, 32 );
}

float MSG_ReadDeltaKeyFloat( msg_t *msg, int key, float oldV ) {
if ( MSG_ReadBits( msg, 1 ) ) {
float newV;

*(int *)&newV = MSG_ReadBits( msg, 32 ) ^ key;
return newV;
}
return oldV;
}


/*
============================================================================

usercmd_t communication

============================================================================
*/

// ms is allways sent, the others are optional
#define CM_ANGLE1 ( 1 << 0 )
#define CM_ANGLE2 ( 1 << 1 )
#define CM_ANGLE3 ( 1 << 2 )
#define CM_FORWARD ( 1 << 3 )
#define CM_SIDE ( 1 << 4 )
#define CM_UP ( 1 << 5 )
#define CM_BUTTONS ( 1 << 6 )
#define CM_WEAPON ( 1 << 7 )

/*
=====================
MSG_WriteDeltaUsercmd
=====================
*/
void MSG_WriteDeltaUsercmd( msg_t *msg, usercmd_t *from, usercmd_t *to ) {
if ( to->serverTime - from->serverTime < 256 ) {
MSG_WriteBits( msg, 1, 1 );
MSG_WriteBits( msg, to->serverTime - from->serverTime, 8 );
} else {
MSG_WriteBits( msg, 0, 1 );
MSG_WriteBits( msg, to->serverTime, 32 );
}
MSG_WriteDelta( msg, from->angles[0], to->angles[0], 16 );
MSG_WriteDelta( msg, from->angles[1], to->angles[1], 16 );
MSG_WriteDelta( msg, from->angles[2], to->angles[2], 16 );
MSG_WriteDelta( msg, from->forwardmove, to->forwardmove, 8 );
MSG_WriteDelta( msg, from->rightmove, to->rightmove, 8 );
MSG_WriteDelta( msg, from->upmove, to->upmove, 8 );
MSG_WriteDelta( msg, from->buttons, to->buttons, 8 );
MSG_WriteDelta( msg, from->wbuttons, to->wbuttons, 8 );
MSG_WriteDelta( msg, from->weapon, to->weapon, 8 );
MSG_WriteDelta( msg, from->holdable, to->holdable, 8 ); //----(SA) modified
MSG_WriteDelta( msg, from->wolfkick, to->wolfkick, 8 );
MSG_WriteDelta( msg, from->cld, to->cld, 16 ); // NERVE - SMF
}


/*
=====================
MSG_ReadDeltaUsercmd
=====================
*/
void MSG_ReadDeltaUsercmd( msg_t *msg, usercmd_t *from, usercmd_t *to ) {
if ( MSG_ReadBits( msg, 1 ) ) {
to->serverTime = from->serverTime + MSG_ReadBits( msg, 8 );
} else {
to->serverTime = MSG_ReadBits( msg, 32 );
}
to->angles[0] = MSG_ReadDelta( msg, from->angles[0], 16 );
to->angles[1] = MSG_ReadDelta( msg, from->angles[1], 16 );
to->angles[2] = MSG_ReadDelta( msg, from->angles[2], 16 );
to->forwardmove = MSG_ReadDelta( msg, from->forwardmove, 8 );
to->rightmove = MSG_ReadDelta( msg, from->rightmove, 8 );
to->upmove = MSG_ReadDelta( msg, from->upmove, 8 );
to->buttons = MSG_ReadDelta( msg, from->buttons, 8 );
to->wbuttons = MSG_ReadDelta( msg, from->wbuttons, 8 );
to->weapon = MSG_ReadDelta( msg, from->weapon, 8 );
to->holdable = MSG_ReadDelta( msg, from->holdable, 8 ); //----(SA) modified
to->wolfkick = MSG_ReadDelta( msg, from->wolfkick, 8 );
to->cld = MSG_ReadDelta( msg, from->cld, 16 ); // NERVE - SMF
}

/*
=====================
MSG_WriteDeltaUsercmd
=====================
*/
void MSG_WriteDeltaUsercmdKey( msg_t *msg, int key, usercmd_t *from, usercmd_t *to ) {
if ( to->serverTime - from->serverTime < 256 ) {
MSG_WriteBits( msg, 1, 1 );
MSG_WriteBits( msg, to->serverTime - from->serverTime, 8 );
} else {
MSG_WriteBits( msg, 0, 1 );
MSG_WriteBits( msg, to->serverTime, 32 );
}
if ( from->angles[0] == to->angles[0] &&
from->angles[1] == to->angles[1] &&
from->angles[2] == to->angles[2] &&
from->forwardmove == to->forwardmove &&
from->rightmove == to->rightmove &&
from->upmove == to->upmove &&
from->buttons == to->buttons &&
from->wbuttons == to->wbuttons &&
from->weapon == to->weapon &&
from->holdable == to->holdable &&
from->wolfkick == to->wolfkick &&
from->cld == to->cld ) { // NERVE - SMF
MSG_WriteBits( msg, 0, 1 ); // no change
oldsize += 7;
return;
}
key ^= to->serverTime;
MSG_WriteBits( msg, 1, 1 );
MSG_WriteDeltaKey( msg, key, from->angles[0], to->angles[0], 16 );
MSG_WriteDeltaKey( msg, key, from->angles[1], to->angles[1], 16 );
MSG_WriteDeltaKey( msg, key, from->angles[2], to->angles[2], 16 );
MSG_WriteDeltaKey( msg, key, from->forwardmove, to->forwardmove, 8 );
MSG_WriteDeltaKey( msg, key, from->rightmove, to->rightmove, 8 );
MSG_WriteDeltaKey( msg, key, from->upmove, to->upmove, 8 );
MSG_WriteDeltaKey( msg, key, from->buttons, to->buttons, 8 );
MSG_WriteDeltaKey( msg, key, from->wbuttons, to->wbuttons, 8 );
MSG_WriteDeltaKey( msg, key, from->weapon, to->weapon, 8 );
MSG_WriteDeltaKey( msg, key, from->holdable, to->holdable, 8 );
MSG_WriteDeltaKey( msg, key, from->wolfkick, to->wolfkick, 8 );

MSG_WriteDeltaKey( msg, key, from->cld, to->cld, 16 ); // NERVE - SMF - for multiplayer clientDamage
}


/*
=====================
MSG_ReadDeltaUsercmd
=====================
*/
void MSG_ReadDeltaUsercmdKey( msg_t *msg, int key, usercmd_t *from, usercmd_t *to ) {
if ( MSG_ReadBits( msg, 1 ) ) {
to->serverTime = from->serverTime + MSG_ReadBits( msg, 8 );
} else {
to->serverTime = MSG_ReadBits( msg, 32 );
}
if ( MSG_ReadBits( msg, 1 ) ) {
key ^= to->serverTime;
to->angles[0] = MSG_ReadDeltaKey( msg, key, from->angles[0], 16 );
to->angles[1] = MSG_ReadDeltaKey( msg, key, from->angles[1], 16 );
to->angles[2] = MSG_ReadDeltaKey( msg, key, from->angles[2], 16 );
to->forwardmove = MSG_ReadDeltaKey( msg, key, from->forwardmove, 8 );
to->rightmove = MSG_ReadDeltaKey( msg, key, from->rightmove, 8 );
to->upmove = MSG_ReadDeltaKey( msg, key, from->upmove, 8 );
to->buttons = MSG_ReadDeltaKey( msg, key, from->buttons, 8 );
to->wbuttons = MSG_ReadDeltaKey( msg, key, from->wbuttons, 8 );
to->weapon = MSG_ReadDeltaKey( msg, key, from->weapon, 8 );
to->holdable = MSG_ReadDeltaKey( msg, key, from->holdable, 8 );
to->wolfkick = MSG_ReadDeltaKey( msg, key, from->wolfkick, 8 );

to->cld = MSG_ReadDeltaKey( msg, key, from->cld, 16 ); // NERVE - SMF - for multiplayer clientDamage
} else {
to->angles[0] = from->angles[0];
to->angles[1] = from->angles[1];
to->angles[2] = from->angles[2];
to->forwardmove = from->forwardmove;
to->rightmove = from->rightmove;
to->upmove = from->upmove;
to->buttons = from->buttons;
to->wbuttons = from->wbuttons;
to->weapon = from->weapon;
to->holdable = from->holdable;
to->wolfkick = from->wolfkick;

to->cld = from->cld; // NERVE - SMF
}
}


/*
=============================================================================

entityState_t communication

=============================================================================
*/

#define CHANGE_VECTOR_BYTES 10

#define MAX_CHANGE_VECTOR_LOGS 1024

#define SMALL_VECTOR_BITS 5 // 32 compressed vectors

// uncomment this define to enable the collection of new network statistics
//#define FIND_NEW_CHANGE_VECTORS

typedef struct {
int count;
byte vector[CHANGE_VECTOR_BYTES];
} changeVectorLog_t;

int c_compressedVectors;
int c_uncompressedVectors;

#ifndef FIND_NEW_CHANGE_VECTORS
int numChangeVectorLogs = ( 1 << SMALL_VECTOR_BITS ) - 1;
#else
int numChangeVectorLogs = 0;
#endif
changeVectorLog_t changeVectorLog[ MAX_CHANGE_VECTOR_LOGS ] =
{
{ 0, { 0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00 } }, // 723 uses in test
{ 0, { 0x00,0x00,0x00,0x00,0x00,0x04,0x00,0x00,0x00,0x00 } }, // 285 uses in test
{ 0, { 0xe1,0x00,0xc0,0x01,0x80,0x00,0x00,0x10,0x00,0x00 } }, // 235 uses in test
{ 0, { 0xe1,0x00,0xc0,0x01,0x20,0x40,0x00,0x00,0x00,0x00 } }, // 162 uses in test
{ 0, { 0x28,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00 } }, // 161 uses in test
{ 0, { 0x00,0x00,0x00,0x00,0x00,0x11,0x00,0x00,0x00,0x00 } }, // 139 uses in test
{ 0, { 0x01,0x00,0x00,0x00,0x80,0x11,0x00,0x00,0x00,0x00 } }, // 92 uses in test
{ 0, { 0x03,0x00,0x00,0x00,0x80,0x11,0x00,0x00,0x00,0x00 } }, // 78 uses in test
{ 0, { 0xe3,0x00,0xf0,0x8f,0x03,0x00,0x00,0x10,0x00,0x00 } }, // 54 uses in test
{ 0, { 0xe1,0x00,0xf0,0x89,0x03,0x00,0x00,0x00,0x00,0x00 } }, // 49 uses in test
{ 0, { 0xe1,0x80,0xc0,0x21,0x00,0x11,0x00,0x20,0x00,0x00 } }, // 40 uses in test
{ 0, { 0x03,0x00,0x00,0x00,0x00,0x11,0x00,0x00,0x00,0x00 } }, // 37 uses in test
{ 0, { 0xe9,0x30,0xc0,0x01,0x00,0x11,0x00,0x20,0x00,0x00 } }, // 35 uses in test
{ 0, { 0xe1,0x80,0xc0,0x21,0x10,0x01,0x00,0x00,0x00,0x00 } }, // 30 uses in test
{ 0, { 0xe1,0x00,0xc0,0x01,0x10,0x01,0x00,0x00,0x00,0x00 } }, // 29 uses in test
{ 0, { 0xe3,0x00,0x00,0x00,0x00,0x08,0x00,0x00,0x00,0x00 } }, // 26 uses in test
{ 0, { 0xe1,0x00,0xc0,0x01,0x00,0x40,0x00,0x00,0x00,0x00 } }, // 20 uses in test
{ 0, { 0xe0,0x00,0xc0,0x01,0x00,0x00,0x00,0x00,0x00,0x00 } }, // 19 uses in test
{ 0, { 0xe1,0x80,0xc0,0xa1,0x03,0x01,0x00,0x00,0x00,0x00 } }, // 19 uses in test
{ 0, { 0x11,0x00,0x00,0x00,0x00,0x11,0x00,0x00,0x00,0x00 } }, // 17 uses in test
{ 0, { 0x00,0x00,0x00,0x00,0x00,0x20,0x00,0x00,0x00,0x00 } }, // 16 uses in test
{ 0, { 0xe0,0x00,0xc0,0x01,0x40,0x00,0x00,0x00,0x00,0x00 } }, // 15 uses in test
{ 0, { 0x28,0x00,0x00,0x00,0x00,0x20,0x00,0x00,0x00,0x00 } }, // 14 uses in test
{ 0, { 0xe3,0x00,0xc0,0xc1,0x03,0x04,0x00,0x10,0x00,0x00 } }, // 14 uses in test
{ 0, { 0xe1,0x80,0xc0,0x21,0x00,0x01,0x00,0x00,0x00,0x00 } }, // 12 uses in test
{ 0, { 0x19,0x10,0x00,0x00,0x00,0x11,0x00,0x20,0x00,0x00 } }, // 12 uses in test
{ 0, { 0x68,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00 } }, // 11 uses in test
{ 0, { 0xe1,0x00,0xc0,0xc1,0x03,0x04,0x00,0x10,0x00,0x00 } }, // 10 uses in test
{ 0, { 0xe1,0x80,0xc0,0x21,0x10,0x05,0x00,0x00,0x00,0x00 } }, // 9 uses in test
{ 0, { 0xe1,0x00,0xc0,0x01,0x20,0x40,0x00,0x10,0x00,0x00 } }, // 9 uses in test
{ 0, { 0xe1,0x80,0xc0,0x21,0x00,0x11,0x00,0x00,0x00,0x00 } }, // 9 uses in test
{ 0, { 0x28,0x00,0x00,0x00,0x00,0xa0,0x00,0x00,0x00,0x00 } }, // 8 uses in test
};

/*
=================
LookupChangeVector

Returns a compressedVector index, or -1 if not found
=================
*/

int LookupChangeVector( byte *vector ) {
int i;

for ( i = 0 ; i < numChangeVectorLogs ; i++ ) {
if ( ( (int *)vector )[0] == ( (int *)changeVectorLog[i].vector )[0]
&& ( (int *)vector )[1] == ( (int *)changeVectorLog[i].vector )[1]
&& ( (short *)vector )[4] == ( (short *)changeVectorLog[i].vector )[4] ) {
changeVectorLog[i].count++;
#ifdef FIND_NEW_CHANGE_VECTORS
return -1;
#else
return i;
#endif
}
}
#ifndef FIND_NEW_CHANGE_VECTORS
return -1; // not found
#else
if ( numChangeVectorLogs == MAX_CHANGE_VECTOR_LOGS ) {
return -1;
}
( (int *)changeVectorLog[i].vector )[0] = ( (int *)vector )[0];
( (int *)changeVectorLog[i].vector )[1] = ( (int *)vector )[1];
( (short *)changeVectorLog[i].vector )[4] = ( (short *)vector )[4];
changeVectorLog[i].count = 1;
numChangeVectorLogs++;

return -1;
#endif
}


/*
=================
MSG_ReportChangeVectors_f

Prints out a table from the current statistics for copying to code
=================
*/
#ifdef FIND_NEW_CHANGE_VECTORS
static int CompareCV( const void *a, const void *b ) {
changeVectorLog_t *cva, *cvb;

cva = (changeVectorLog_t *)a;
cvb = (changeVectorLog_t *)b;

if ( cva->count > cvb->count ) {
return -1;
}
if ( cva->count < cvb->count ) {
return 1;
}
return 0;
}
#endif
void MSG_ReportChangeVectors_f( void ) {
#ifndef FIND_NEW_CHANGE_VECTORS
Com_Printf( "FIND_NEW_CHANGE_VECTORS not defined.\n" );
Com_Printf( "%i%% of vectors compressed\n", 100 * c_compressedVectors / ( c_compressedVectors + c_uncompressedVectors ) );
#else
int i, j;
int total;
changeVectorLog_t *cv;

qsort( changeVectorLog, numChangeVectorLogs, sizeof( changeVectorLog_t ), CompareCV );
total = 0;
for ( i = 0 ; i < ( 1 << SMALL_VECTOR_BITS ) ; i++ ) {
Com_Printf( "{ 0, { " );
cv = &changeVectorLog[i];
total += cv->count;
for ( j = 0 ; j < CHANGE_VECTOR_BYTES ; j++ ) {
Com_Printf( "0x%x%x", cv->vector[j] >> 4, cv->vector[j] & 15 );
if ( j != CHANGE_VECTOR_BYTES - 1 ) {
Com_Printf( "," );
}
}
Com_Printf( " } }, // %i uses in test\n", cv->count );
}

Com_Printf( "%i%% of vectors compressed\n", 100 * total / c_uncompressedVectors );
#endif
}


typedef struct {
char *name;
int offset;
int bits; // 0 = float
} netField_t;

// using the stringizing operator to save typing...
#define NETF( x ) # x,(int)&( (entityState_t*)0 )->x

netField_t entityStateFields[] =
{
{ NETF( eType ), 8 },
{ NETF( eFlags ), 32 },
{ NETF( pos.trType ), 8 },
{ NETF( pos.trTime ), 32 },
{ NETF( pos.trDuration ), 32 },
{ NETF( pos.trBase[0] ), 0 },
{ NETF( pos.trBase[1] ), 0 },
{ NETF( pos.trBase[2] ), 0 },
{ NETF( pos.trDelta[0] ), 0 },
{ NETF( pos.trDelta[1] ), 0 },
{ NETF( pos.trDelta[2] ), 0 },
{ NETF( apos.trType ), 8 },
{ NETF( apos.trTime ), 32 },
{ NETF( apos.trDuration ), 32 },
{ NETF( apos.trBase[0] ), 0 },
{ NETF( apos.trBase[1] ), 0 },
{ NETF( apos.trBase[2] ), 0 },
{ NETF( apos.trDelta[0] ), 0 },
{ NETF( apos.trDelta[1] ), 0 },
{ NETF( apos.trDelta[2] ), 0 },
{ NETF( time ), 32 },
{ NETF( time2 ), 32 },
{ NETF( origin[0] ), 0 },
{ NETF( origin[1] ), 0 },
{ NETF( origin[2] ), 0 },
{ NETF( origin2[0] ), 0 },
{ NETF( origin2[1] ), 0 },
{ NETF( origin2[2] ), 0 },
{ NETF( angles[0] ), 0 },
{ NETF( angles[1] ), 0 },
{ NETF( angles[2] ), 0 },
{ NETF( angles2[0] ), 0 },
{ NETF( angles2[1] ), 0 },
{ NETF( angles2[2] ), 0 },
{ NETF( otherEntityNum ), GENTITYNUM_BITS },
{ NETF( otherEntityNum2 ), GENTITYNUM_BITS },
{ NETF( groundEntityNum ), GENTITYNUM_BITS },
{ NETF( loopSound ), 8 },
{ NETF( constantLight ), 32 },
{ NETF( dl_intensity ), 32 }, //----(SA) longer now to carry the corona colors
{ NETF( modelindex ), 9 },
{ NETF( modelindex2 ), 9 },
{ NETF( frame ), 16 },
{ NETF( clientNum ), 8 },
{ NETF( solid ), 24 },
{ NETF( event ), 10 },
{ NETF( eventParm ), 8 },
{ NETF( eventSequence ), 8 }, // warning: need to modify cg_event.c at "// check the sequencial list" if you change this
{ NETF( events[0] ), 8 },
{ NETF( events[1] ), 8 },
{ NETF( events[2] ), 8 },
{ NETF( events[3] ), 8 },
{ NETF( eventParms[0] ), 8 },
{ NETF( eventParms[1] ), 8 },
{ NETF( eventParms[2] ), 8 },
{ NETF( eventParms[3] ), 8 },
{ NETF( powerups ), 16 },
{ NETF( weapon ), 8 },
{ NETF( legsAnim ), ANIM_BITS },
{ NETF( torsoAnim ), ANIM_BITS },
{ NETF( density ), 10},
{ NETF( dmgFlags ), 32 }, //----(SA) additional info flags for damage
{ NETF( onFireStart ), 32},
{ NETF( onFireEnd ), 32},
{ NETF( aiChar ), 8},
{ NETF( teamNum ), 8},
{ NETF( effect1Time ), 32},
{ NETF( effect2Time ), 32},
{ NETF( effect3Time ), 32},
{ NETF( aiState ), 2},
{ NETF( animMovetype ), 6},
};


// if (int)f == f and (int)f + ( 1<<(FLOAT_INT_BITS-1) ) < ( 1 << FLOAT_INT_BITS )
// the float will be sent with FLOAT_INT_BITS, otherwise all 32 bits will be sent
#define FLOAT_INT_BITS 13
#define FLOAT_INT_BIAS ( 1 << ( FLOAT_INT_BITS - 1 ) )

/*
==================
MSG_WriteDeltaEntity


GENTITYNUM_BITS 1 : remove this entity
GENTITYNUM_BITS 0 1 SMALL_VECTOR_BITS <data>
GENTITYNUM_BITS 0 0 LARGE_VECTOR_BITS >data>

Writes part of a packetentities message, including the entity number.
Can delta from either a baseline or a previous packet_entity
If to is NULL, a remove entity update will be sent
If force is not set, then nothing at all will be generated if the entity is
identical, under the assumption that the in-order delta code will catch it.
==================
*/
void MSG_WriteDeltaEntity( msg_t *msg, struct entityState_s *from, struct entityState_s *to,
qboolean force ) {
int i, c;
int numFields;
netField_t *field;
int trunc;
float fullFloat;
int *fromF, *toF;
byte changeVector[CHANGE_VECTOR_BYTES];
int compressedVector;
qboolean changed;
int print, endBit, startBit;

if ( msg->bit == 0 ) {
startBit = msg->cursize * 8 - GENTITYNUM_BITS;
} else {
startBit = ( msg->cursize - 1 ) * 8 + msg->bit - GENTITYNUM_BITS;
}

numFields = sizeof( entityStateFields ) / sizeof( entityStateFields[0] );

// all fields should be 32 bits to avoid any compiler packing issues
// the "number" field is not part of the field list
// if this assert fails, someone added a field to the entityState_t
// struct without updating the message fields
assert( numFields + 1 == sizeof( *from ) / 4 );

c = msg->cursize;

// a NULL to is a delta remove message
if ( to == NULL ) {
if ( from == NULL ) {
return;
}
if ( cl_shownet && ( cl_shownet->integer >= 2 || cl_shownet->integer == -1 ) ) {
Com_Printf( "W|%3i: #%-3i remove\n", msg->cursize, from->number );
}
MSG_WriteBits( msg, from->number, GENTITYNUM_BITS );
MSG_WriteBits( msg, 1, 1 );
return;
}

if ( to->number < 0 || to->number >= MAX_GENTITIES ) {
Com_Error( ERR_FATAL, "MSG_WriteDeltaEntity: Bad entity number: %i", to->number );
}

// build the change vector
if ( numFields > 8 * CHANGE_VECTOR_BYTES ) {
Com_Error( ERR_FATAL, "numFields > 8 * CHANGE_VECTOR_BYTES" );
}

for ( i = 0 ; i < CHANGE_VECTOR_BYTES ; i++ ) {
changeVector[i] = 0;
}
changed = qfalse;
// build the change vector as bytes so it is endien independent
for ( i = 0, field = entityStateFields ; i < numFields ; i++, field++ ) {
fromF = ( int * )( (byte *)from + field->offset );
toF = ( int * )( (byte *)to + field->offset );
if ( *fromF != *toF ) {
changeVector[ i >> 3 ] |= 1 << ( i & 7 );
changed = qtrue;
}
}

if ( !changed ) {
// nothing at all changed
if ( !force ) {
return; // nothing at all
}
// write two bits for no change
MSG_WriteBits( msg, to->number, GENTITYNUM_BITS );
MSG_WriteBits( msg, 0, 1 ); // not removed
MSG_WriteBits( msg, 0, 1 ); // no delta
return;
}

// shownet 2/3 will interleave with other printed info, -1 will
// just print the delta records`
if ( cl_shownet && ( cl_shownet->integer >= 2 || cl_shownet->integer == -1 ) ) {
print = 1;
Com_Printf( "W|%3i: #%-3i ", msg->cursize, to->number );
} else {
print = 0;
}

// check for a compressed change vector
compressedVector = LookupChangeVector( changeVector );

MSG_WriteBits( msg, to->number, GENTITYNUM_BITS );
MSG_WriteBits( msg, 0, 1 ); // not removed
MSG_WriteBits( msg, 1, 1 ); // we have a delta

// MSG_WriteBits( msg, compressedVector, SMALL_VECTOR_BITS );
if ( compressedVector == -1 ) {
oldsize += 4;
MSG_WriteBits( msg, 1, 1 ); // complete change
// we didn't find a fast match so we need to write the entire delta
for ( i = 0 ; i + 8 <= numFields ; i += 8 ) {
MSG_WriteByte( msg, changeVector[i >> 3] );
}
if ( numFields & 7 ) {
MSG_WriteBits( msg, changeVector[i >> 3], numFields & 7 );
}
if ( print ) {
Com_Printf( "<uc> " );
}
} else {
MSG_WriteBits( msg, 0, 1 ); // compressed vector
MSG_WriteBits( msg, compressedVector, SMALL_VECTOR_BITS );
if ( print ) {
Com_Printf( "<%2i> ", compressedVector );
}
}

for ( i = 0, field = entityStateFields ; i < numFields ; i++, field++ ) {
fromF = ( int * )( (byte *)from + field->offset );
toF = ( int * )( (byte *)to + field->offset );

if ( *fromF == *toF ) {
continue;
}

if ( field->bits == 0 ) {
// float
fullFloat = *(float *)toF;
trunc = (int)fullFloat;

if ( fullFloat == 0.0f ) {
MSG_WriteBits( msg, 0, 1 );
oldsize += FLOAT_INT_BITS;
} else {
MSG_WriteBits( msg, 1, 1 );
if ( trunc == fullFloat && trunc + FLOAT_INT_BIAS >= 0 &&
trunc + FLOAT_INT_BIAS < ( 1 << FLOAT_INT_BITS ) ) {
// send as small integer
MSG_WriteBits( msg, 0, 1 );
MSG_WriteBits( msg, trunc + FLOAT_INT_BIAS, FLOAT_INT_BITS );
if ( print ) {
Com_Printf( "%s:%i ", field->name, trunc );
}
} else {
// send as full floating point value
MSG_WriteBits( msg, 1, 1 );
MSG_WriteBits( msg, *toF, 32 );
if ( print ) {
Com_Printf( "%s:%f ", field->name, *(float *)toF );
}
}
}
} else {
if ( *toF == 0 ) {
MSG_WriteBits( msg, 0, 1 );
} else {
MSG_WriteBits( msg, 1, 1 );
// integer
MSG_WriteBits( msg, *toF, field->bits );
if ( print ) {
Com_Printf( "%s:%i ", field->name, *toF );
}
}
}
}
c = msg->cursize - c;

if ( print ) {
if ( msg->bit == 0 ) {
endBit = msg->cursize * 8 - GENTITYNUM_BITS;
} else {
endBit = ( msg->cursize - 1 ) * 8 + msg->bit - GENTITYNUM_BITS;
}
Com_Printf( " (%i bits)\n", endBit - startBit );
}
}

/*
==================
MSG_ReadDeltaEntity

The entity number has already been read from the message, which
is how the from state is identified.

If the delta removes the entity, entityState_t->number will be set to MAX_GENTITIES-1

Can go from either a baseline or a previous packet_entity
==================
*/
extern cvar_t *cl_shownet;

void MSG_ReadDeltaEntity( msg_t *msg, entityState_t *from, entityState_t *to,
int number ) {
int i;
int numFields;
netField_t *field;
int *fromF, *toF;
int print;
int trunc;
int startBit, endBit;
int compressedVector;
byte expandedVector[CHANGE_VECTOR_BYTES];
byte *changeVector;

if ( number < 0 || number >= MAX_GENTITIES ) {
Com_Error( ERR_DROP, "Bad delta entity number: %i", number );
}

if ( msg->bit == 0 ) {
startBit = msg->readcount * 8 - GENTITYNUM_BITS;
} else {
startBit = ( msg->readcount - 1 ) * 8 + msg->bit - GENTITYNUM_BITS;
}

// check for a remove
if ( MSG_ReadBits( msg, 1 ) == 1 ) {
memset( to, 0, sizeof( *to ) );
to->number = MAX_GENTITIES - 1;
if ( cl_shownet && ( cl_shownet->integer >= 2 || cl_shownet->integer == -1 ) ) {
Com_Printf( "%3i: #%-3i remove\n", msg->readcount, number );
}
return;
}

// check for no delta
if ( MSG_ReadBits( msg, 1 ) == 0 ) {
*to = *from;
to->number = number;
return;
}

numFields = sizeof( entityStateFields ) / sizeof( entityStateFields[0] );

// shownet 2/3 will interleave with other printed info, -1 will
// just print the delta records`
if ( cl_shownet && ( cl_shownet->integer >= 2 || cl_shownet->integer == -1 ) ) {
print = 1;
Com_Printf( "%3i: #%-3i ", msg->readcount, to->number );
} else {
print = 0;
}

// get the entire change vector, either compressed or uncompressed

if ( MSG_ReadBits( msg, 1 ) ) {
// not a compressed vector, so read the entire thing
c_uncompressedVectors++;
// we didn't find a fast match so we need to write the entire delta
for ( i = 0 ; i + 8 <= numFields ; i += 8 ) {
expandedVector[i >> 3] = MSG_ReadByte( msg );
}
if ( numFields & 7 ) {
expandedVector[i >> 3] = MSG_ReadBits( msg, numFields & 7 );
}
changeVector = expandedVector;
if ( print ) {
Com_Printf( "<uc> " );
}
} else {
compressedVector = MSG_ReadBits( msg, SMALL_VECTOR_BITS );
c_compressedVectors++;
changeVector = changeVectorLog[ compressedVector ].vector;
if ( print ) {
Com_Printf( "<%2i> ", compressedVector );
}
}


to->number = number;

for ( i = 0, field = entityStateFields ; i < numFields ; i++, field++ ) {
fromF = ( int * )( (byte *)from + field->offset );
toF = ( int * )( (byte *)to + field->offset );

if ( !( changeVector[ i >> 3 ] & ( 1 << ( i & 7 ) ) ) ) { // MSG_ReadBits( msg, 1 ) == 0 ) {
// no change
*toF = *fromF;
} else {
if ( field->bits == 0 ) {
// float
if ( MSG_ReadBits( msg, 1 ) == 0 ) {
*(float *)toF = 0.0f;
} else {
if ( MSG_ReadBits( msg, 1 ) == 0 ) {
// integral float
trunc = MSG_ReadBits( msg, FLOAT_INT_BITS );
// bias to allow equal parts positive and negative
trunc -= FLOAT_INT_BIAS;
*(float *)toF = trunc;
if ( print ) {
Com_Printf( "%s:%i ", field->name, trunc );
}
} else {
// full floating point value
*toF = MSG_ReadBits( msg, 32 );
if ( print ) {
Com_Printf( "%s:%f ", field->name, *(float *)toF );
}
}
}
} else {
if ( MSG_ReadBits( msg, 1 ) == 0 ) {
*toF = 0;
} else {
// integer
*toF = MSG_ReadBits( msg, field->bits );
if ( print ) {
Com_Printf( "%s:%i ", field->name, *toF );
}
}
}
}
}

if ( print ) {
if ( msg->bit == 0 ) {
endBit = msg->readcount * 8 - GENTITYNUM_BITS;
} else {
endBit = ( msg->readcount - 1 ) * 8 + msg->bit - GENTITYNUM_BITS;
}
Com_Printf( " (%i bits)\n", endBit - startBit );
}
}


/*
============================================================================

plyer_state_t communication

============================================================================
*/

// using the stringizing operator to save typing...
#define PSF( x ) # x,(int)&( (playerState_t*)0 )->x

netField_t playerStateFields[] =
{
{ PSF( commandTime ), 32 },
{ PSF( pm_type ), 8 },
{ PSF( bobCycle ), 8 },
{ PSF( pm_flags ), 16 },
{ PSF( pm_time ), -16 },
{ PSF( origin[0] ), 0 },
{ PSF( origin[1] ), 0 },
{ PSF( origin[2] ), 0 },
{ PSF( velocity[0] ), 0 },
{ PSF( velocity[1] ), 0 },
{ PSF( velocity[2] ), 0 },
{ PSF( weaponTime ), -16 },
{ PSF( weaponDelay ), -16 },
{ PSF( grenadeTimeLeft ), -16 },
{ PSF( gravity ), 16 },
{ PSF( leanf ), 0 },
{ PSF( speed ), 16 },
{ PSF( delta_angles[0] ), 16 },
{ PSF( delta_angles[1] ), 16 },
{ PSF( delta_angles[2] ), 16 },
{ PSF( groundEntityNum ), GENTITYNUM_BITS },
{ PSF( legsTimer ), 16 },
{ PSF( torsoTimer ), 16 },
{ PSF( legsAnim ), ANIM_BITS },
{ PSF( torsoAnim ), ANIM_BITS },
{ PSF( movementDir ), 8 },
{ PSF( eFlags ), 16 },
{ PSF( eventSequence ), 8 },
{ PSF( events[0] ), 8 },
{ PSF( events[1] ), 8 },
{ PSF( events[2] ), 8 },
{ PSF( events[3] ), 8 },
{ PSF( eventParms[0] ), 8 },
{ PSF( eventParms[1] ), 8 },
{ PSF( eventParms[2] ), 8 },
{ PSF( eventParms[3] ), 8 },
{ PSF( clientNum ), 8 },
{ PSF( weapons[0] ), 32 },
{ PSF( weapons[1] ), 32 },
{ PSF( weapon ), 7 }, // (SA) yup, even more
{ PSF( weaponstate ), 4 },
{ PSF( viewangles[0] ), 0 },
{ PSF( viewangles[1] ), 0 },
{ PSF( viewangles[2] ), 0 },
{ PSF( viewheight ), -8 },
{ PSF( damageEvent ), 8 },
{ PSF( damageYaw ), 8 },
{ PSF( damagePitch ), 8 },
{ PSF( damageCount ), 8 },
{ PSF( mins[0] ), 0 },
{ PSF( mins[1] ), 0 },
{ PSF( mins[2] ), 0 },
{ PSF( maxs[0] ), 0 },
{ PSF( maxs[1] ), 0 },
{ PSF( maxs[2] ), 0 },
{ PSF( crouchMaxZ ), 0 },
{ PSF( crouchViewHeight ), 0 },
{ PSF( standViewHeight ), 0 },
{ PSF( deadViewHeight ), 0 },
{ PSF( runSpeedScale ), 0 },
{ PSF( sprintSpeedScale ), 0 },
{ PSF( crouchSpeedScale ), 0 },
{ PSF( friction ), 0 },
{ PSF( viewlocked ), 8 },
{ PSF( viewlocked_entNum ), 16 },
{ PSF( aiChar ), 8 },
{ PSF( teamNum ), 8 },
{ PSF( gunfx ), 8},
{ PSF( onFireStart ), 32},
{ PSF( curWeapHeat ), 8 },
{ PSF( sprintTime ), 16}, // FIXME: to be removed
{ PSF( aimSpreadScale ), 8},
{ PSF( aiState ), 2},
{ PSF( serverCursorHint ), 8}, //----(SA) added
{ PSF( serverCursorHintVal ), 8}, //----(SA) added
// RF not needed anymore
//{ PSF(classWeaponTime), 32}, // JPW NERVE
{ PSF( footstepCount ), 0},
};

/*
=============
MSG_WriteDeltaPlayerstate

=============
*/
void MSG_WriteDeltaPlayerstate( msg_t *msg, struct playerState_s *from, struct playerState_s *to ) {
int i, j;
playerState_t dummy;
int statsbits;
int persistantbits;
int ammobits[4]; //----(SA) modified
int clipbits; //----(SA) added
int powerupbits;
int holdablebits;
int numFields;
int c;
netField_t *field;
int *fromF, *toF;
float fullFloat;
int trunc;
int startBit, endBit;
int print;

if ( !from ) {
from = &dummy;
memset( &dummy, 0, sizeof( dummy ) );
}

if ( msg->bit == 0 ) {
startBit = msg->cursize * 8 - GENTITYNUM_BITS;
} else {
startBit = ( msg->cursize - 1 ) * 8 + msg->bit - GENTITYNUM_BITS;
}

// shownet 2/3 will interleave with other printed info, -2 will
// just print the delta records
if ( cl_shownet && ( cl_shownet->integer >= 2 || cl_shownet->integer == -2 ) ) {
print = 1;
Com_Printf( "W|%3i: playerstate ", msg->cursize );
} else {
print = 0;
}

c = msg->cursize;

numFields = sizeof( playerStateFields ) / sizeof( playerStateFields[0] );
for ( i = 0, field = playerStateFields ; i < numFields ; i++, field++ ) {
fromF = ( int * )( (byte *)from + field->offset );
toF = ( int * )( (byte *)to + field->offset );

if ( *fromF == *toF ) {
MSG_WriteBits( msg, 0, 1 ); // no change
continue;
}

MSG_WriteBits( msg, 1, 1 ); // changed

if ( field->bits == 0 ) {
// float
fullFloat = *(float *)toF;
trunc = (int)fullFloat;

if ( trunc == fullFloat && trunc + FLOAT_INT_BIAS >= 0 &&
trunc + FLOAT_INT_BIAS < ( 1 << FLOAT_INT_BITS ) ) {
// send as small integer
MSG_WriteBits( msg, 0, 1 );
MSG_WriteBits( msg, trunc + FLOAT_INT_BIAS, FLOAT_INT_BITS );
if ( print ) {
Com_Printf( "%s:%i ", field->name, trunc );
}
} else {
// send as full floating point value
MSG_WriteBits( msg, 1, 1 );
MSG_WriteBits( msg, *toF, 32 );
if ( print ) {
Com_Printf( "%s:%f ", field->name, *(float *)toF );
}
}
} else {
// integer
MSG_WriteBits( msg, *toF, field->bits );
if ( print ) {
Com_Printf( "%s:%i ", field->name, *toF );
}
}
}
c = msg->cursize - c;


//
// send the arrays
//
statsbits = 0;
for ( i = 0 ; i < 16 ; i++ ) {
if ( to->stats[i] != from->stats[i] ) {
statsbits |= 1 << i;
}
}
persistantbits = 0;
for ( i = 0 ; i < 16 ; i++ ) {
if ( to->persistant[i] != from->persistant[i] ) {
persistantbits |= 1 << i;
}
}
holdablebits = 0;
for ( i = 0 ; i < 16 ; i++ ) {
if ( to->holdable[i] != from->holdable[i] ) {
holdablebits |= 1 << i;
}
}
powerupbits = 0;
for ( i = 0 ; i < 16 ; i++ ) {
if ( to->powerups[i] != from->powerups[i] ) {
powerupbits |= 1 << i;
}
}


if ( statsbits || persistantbits || holdablebits || powerupbits ) {

MSG_WriteBits( msg, 1, 1 ); // something changed

if ( statsbits ) {
MSG_WriteBits( msg, 1, 1 ); // changed
MSG_WriteShort( msg, statsbits );
for ( i = 0 ; i < 16 ; i++ )
if ( statsbits & ( 1 << i ) ) {
// RF, changed to long to allow more flexibility
// MSG_WriteLong (msg, to->stats[i]);
MSG_WriteShort( msg, to->stats[i] ); //----(SA) back to short since weapon bits are handled elsewhere now
}
} else {
MSG_WriteBits( msg, 0, 1 ); // no change to stats
}


if ( persistantbits ) {
MSG_WriteBits( msg, 1, 1 ); // changed
MSG_WriteShort( msg, persistantbits );
for ( i = 0 ; i < 16 ; i++ )
if ( persistantbits & ( 1 << i ) ) {
MSG_WriteShort( msg, to->persistant[i] );
}
} else {
MSG_WriteBits( msg, 0, 1 ); // no change to persistant
}


if ( holdablebits ) {
MSG_WriteBits( msg, 1, 1 ); // changed
MSG_WriteShort( msg, holdablebits );
for ( i = 0 ; i < 16 ; i++ )
if ( holdablebits & ( 1 << i ) ) {
MSG_WriteShort( msg, to->holdable[i] );
}
} else {
MSG_WriteBits( msg, 0, 1 ); // no change to holdables
}


if ( powerupbits ) {
MSG_WriteBits( msg, 1, 1 ); // changed
MSG_WriteShort( msg, powerupbits );
for ( i = 0 ; i < 16 ; i++ )
if ( powerupbits & ( 1 << i ) ) {
MSG_WriteLong( msg, to->powerups[i] );
}
} else {
MSG_WriteBits( msg, 0, 1 ); // no change to powerups
}
} else {
MSG_WriteBits( msg, 0, 1 ); // no change to any
}


#if 0
// RF, optimization
// Send a single bit to signify whether or not the ammo/clip info changed.
// If it did, send individual segments specifying offset values for each item.
{
int ammo_ofs;
int clip_ofs;

ammobits = 0;

// ammo
for ( i = 0 ; i < 32 ; i++ ) {
if ( to->ammo[i] != from->ammo[i] ) {
ammobits |= 1 << i;
}
}
// ammoclip (just add these changes to the ammo changes. if either changes, we should send both, since they are likely to both change at once anyway)
for ( i = 0 ; i < 32 ; i++ ) {
if ( to->ammoclip[i] != from->ammoclip[i] ) {
ammobits |= 1 << i;
}
}

if ( ammobits ) {
MSG_WriteBits( msg, 1, 1 ); // changed

// send each changed item
for ( i = 0 ; i < 32 ; i++ ) {
if ( ammobits & ( 1 << i ) ) {
ammo_ofs = to->ammo[i] - from->ammo[i];
clip_ofs = to->ammoclip[i] - from->ammoclip[i];

while ( ammo_ofs || clip_ofs ) {
MSG_WriteBits( msg, 1, 1 ); // signify that another index is present
MSG_WriteBits( msg, i, 5 ); // index number

// ammo
if ( abs( ammo_ofs ) > 127 ) {
if ( ammo_ofs > 0 ) {
MSG_WriteChar( msg, 127 );
ammo_ofs -= 127;
} else {
MSG_WriteChar( msg, -127 );
ammo_ofs += 127;
}
} else {
MSG_WriteChar( msg, ammo_ofs );
ammo_ofs = 0;
}

// clip
if ( abs( clip_ofs ) > 127 ) {
if ( clip_ofs > 0 ) {
MSG_WriteChar( msg, 127 );
clip_ofs -= 127;
} else {
MSG_WriteChar( msg, -127 );
clip_ofs += 127;
}
} else {
MSG_WriteChar( msg, clip_ofs );
clip_ofs = 0;
}
}
}
}

// signify the end of changes
MSG_WriteBits( msg, 0, 1 );

} else {
MSG_WriteBits( msg, 0, 1 ); // no change
}
}

#else
//----(SA) I split this into two groups using shorts so it wouldn't have
// to use a long every time ammo changed for any weap.
// this seemed like a much friendlier option than making it
// read/write a long for any ammo change.

// j == 0 : weaps 0-15
// j == 1 : weaps 16-31
// j == 2 : weaps 32-47 //----(SA) now up to 64 (but still pretty net-friendly)
// j == 3 : weaps 48-63

// ammo stored
for ( j = 0; j < 4; j++ ) { //----(SA) modified for 64 weaps
ammobits[j] = 0;
for ( i = 0 ; i < 16 ; i++ ) {
if ( to->ammo[i + ( j * 16 )] != from->ammo[i + ( j * 16 )] ) {
ammobits[j] |= 1 << i;
}
}
}

//----(SA) also encapsulated ammo changes into one check. clip values will change frequently,
// but ammo will not. (only when you get ammo/reload rather than each shot)
if ( ammobits[0] || ammobits[1] || ammobits[2] || ammobits[3] ) { // if any were set...
MSG_WriteBits( msg, 1, 1 ); // changed
for ( j = 0; j < 4; j++ ) {
if ( ammobits[j] ) {
MSG_WriteBits( msg, 1, 1 ); // changed
MSG_WriteShort( msg, ammobits[j] );
for ( i = 0 ; i < 16 ; i++ )
if ( ammobits[j] & ( 1 << i ) ) {
MSG_WriteShort( msg, to->ammo[i + ( j * 16 )] );
}
} else {
MSG_WriteBits( msg, 0, 1 ); // no change
}
}
} else {
MSG_WriteBits( msg, 0, 1 ); // no change
}

// ammo in clip
for ( j = 0; j < 4; j++ ) { //----(SA) modified for 64 weaps
clipbits = 0;
for ( i = 0 ; i < 16 ; i++ ) {
if ( to->ammoclip[i + ( j * 16 )] != from->ammoclip[i + ( j * 16 )] ) {
clipbits |= 1 << i;
}
}
if ( clipbits ) {
MSG_WriteBits( msg, 1, 1 ); // changed
MSG_WriteShort( msg, clipbits );
for ( i = 0 ; i < 16 ; i++ )
if ( clipbits & ( 1 << i ) ) {
MSG_WriteShort( msg, to->ammoclip[i + ( j * 16 )] );
}
} else {
MSG_WriteBits( msg, 0, 1 ); // no change
}
}
#endif


if ( print ) {
if ( msg->bit == 0 ) {
endBit = msg->cursize * 8 - GENTITYNUM_BITS;
} else {
endBit = ( msg->cursize - 1 ) * 8 + msg->bit - GENTITYNUM_BITS;
}
Com_Printf( " (%i bits)\n", endBit - startBit );
}

}


/*
===================
MSG_ReadDeltaPlayerstate
===================
*/
void MSG_ReadDeltaPlayerstate( msg_t *msg, playerState_t *from, playerState_t *to ) {
int i, j;
int bits;
netField_t *field;
int numFields;
int startBit, endBit;
int print;
int *fromF, *toF;
int trunc;
playerState_t dummy;

if ( !from ) {
from = &dummy;
memset( &dummy, 0, sizeof( dummy ) );
}
*to = *from;

if ( msg->bit == 0 ) {
startBit = msg->readcount * 8 - GENTITYNUM_BITS;
} else {
startBit = ( msg->readcount - 1 ) * 8 + msg->bit - GENTITYNUM_BITS;
}

// shownet 2/3 will interleave with other printed info, -2 will
// just print the delta records
if ( cl_shownet && ( cl_shownet->integer >= 2 || cl_shownet->integer == -2 ) ) {
print = 1;
Com_Printf( "%3i: playerstate ", msg->readcount );
} else {
print = 0;
}

numFields = sizeof( playerStateFields ) / sizeof( playerStateFields[0] );
for ( i = 0, field = playerStateFields ; i < numFields ; i++, field++ ) {
fromF = ( int * )( (byte *)from + field->offset );
toF = ( int * )( (byte *)to + field->offset );

if ( !MSG_ReadBits( msg, 1 ) ) {
// no change
*toF = *fromF;
} else {
if ( field->bits == 0 ) {
// float
if ( MSG_ReadBits( msg, 1 ) == 0 ) {
// integral float
trunc = MSG_ReadBits( msg, FLOAT_INT_BITS );
// bias to allow equal parts positive and negative
trunc -= FLOAT_INT_BIAS;
*(float *)toF = trunc;
if ( print ) {
Com_Printf( "%s:%i ", field->name, trunc );
}
} else {
// full floating point value
*toF = MSG_ReadBits( msg, 32 );
if ( print ) {
Com_Printf( "%s:%f ", field->name, *(float *)toF );
}
}
} else {
// integer
*toF = MSG_ReadBits( msg, field->bits );
if ( print ) {
Com_Printf( "%s:%i ", field->name, *toF );
}
}
}
}

// read the arrays
if ( MSG_ReadBits( msg, 1 ) ) { // one general bit tells if any of this infrequently changing stuff has changed
// parse stats
if ( MSG_ReadBits( msg, 1 ) ) {
LOG( "PS_STATS" );
bits = MSG_ReadShort( msg );
for ( i = 0 ; i < 16 ; i++ ) {
if ( bits & ( 1 << i ) ) {
// RF, changed to long to allow more flexibility
// to->stats[i] = MSG_ReadLong(msg);
to->stats[i] = MSG_ReadShort( msg ); //----(SA) back to short since weapon bits are handled elsewhere now

}
}
}

// parse persistant stats
if ( MSG_ReadBits( msg, 1 ) ) {
LOG( "PS_PERSISTANT" );
bits = MSG_ReadShort( msg );
for ( i = 0 ; i < 16 ; i++ ) {
if ( bits & ( 1 << i ) ) {
to->persistant[i] = MSG_ReadShort( msg );
}
}
}

// parse holdable stats
if ( MSG_ReadBits( msg, 1 ) ) {
LOG( "PS_HOLDABLE" );
bits = MSG_ReadShort( msg );
for ( i = 0 ; i < 16 ; i++ ) {
if ( bits & ( 1 << i ) ) {
to->holdable[i] = MSG_ReadShort( msg );
}
}
}

// parse powerups
if ( MSG_ReadBits( msg, 1 ) ) {
LOG( "PS_POWERUPS" );
bits = MSG_ReadShort( msg );
for ( i = 0 ; i < 16 ; i++ ) {
if ( bits & ( 1 << i ) ) {
to->powerups[i] = MSG_ReadLong( msg );
}
}
}
}

#if 0
// RF, optimization
// Send a single bit to signify whether or not the ammo/clip info changed.
// If it did, send individual segments specifying offset values for each item.

if ( MSG_ReadBits( msg, 1 ) ) { // it changed
while ( MSG_ReadBits( msg, 1 ) ) {
i = MSG_ReadBits( msg, 5 ); // read the index number
// now read the offsets
to->ammo[i] += MSG_ReadChar( msg );
to->ammoclip[i] += MSG_ReadChar( msg );
}
}

#else
//----(SA) I split this into two groups using shorts so it wouldn't have
// to use a long every time ammo changed for any weap.
// this seemed like a much friendlier option than making it
// read/write a long for any ammo change.

// parse ammo

// j == 0 : weaps 0-15
// j == 1 : weaps 16-31
// j == 2 : weaps 32-47 //----(SA) now up to 64 (but still pretty net-friendly)
// j == 3 : weaps 48-63

// ammo stored
if ( MSG_ReadBits( msg, 1 ) ) { // check for any ammo change (0-63)
for ( j = 0; j < 4; j++ ) {
if ( MSG_ReadBits( msg, 1 ) ) {
LOG( "PS_AMMO" );
bits = MSG_ReadShort( msg );
for ( i = 0 ; i < 16 ; i++ ) {
if ( bits & ( 1 << i ) ) {
to->ammo[i + ( j * 16 )] = MSG_ReadShort( msg );
}
}
}
}
}

// ammo in clip
for ( j = 0; j < 4; j++ ) {
if ( MSG_ReadBits( msg, 1 ) ) {
LOG( "PS_AMMOCLIP" );
bits = MSG_ReadShort( msg );
for ( i = 0 ; i < 16 ; i++ ) {
if ( bits & ( 1 << i ) ) {
to->ammoclip[i + ( j * 16 )] = MSG_ReadShort( msg );
}
}
}
}

#endif


if ( print ) {
if ( msg->bit == 0 ) {
endBit = msg->readcount * 8 - GENTITYNUM_BITS;
} else {
endBit = ( msg->readcount - 1 ) * 8 + msg->bit - GENTITYNUM_BITS;
}
Com_Printf( " (%i bits)\n", endBit - startBit );
}
}

int msg_hData[256] = {
250315, // 0
41193, // 1
6292, // 2
7106, // 3
3730, // 4
3750, // 5
6110, // 6
23283, // 7
33317, // 8
6950, // 9
7838, // 10
9714, // 11
9257, // 12
17259, // 13
3949, // 14
1778, // 15
8288, // 16
1604, // 17
1590, // 18
1663, // 19
1100, // 20
1213, // 21
1238, // 22
1134, // 23
1749, // 24
1059, // 25
1246, // 26
1149, // 27
1273, // 28
4486, // 29
2805, // 30
3472, // 31
21819, // 32
1159, // 33
1670, // 34
1066, // 35
1043, // 36
1012, // 37
1053, // 38
1070, // 39
1726, // 40
888, // 41
1180, // 42
850, // 43
960, // 44
780, // 45
1752, // 46
3296, // 47
10630, // 48
4514, // 49
5881, // 50
2685, // 51
4650, // 52
3837, // 53
2093, // 54
1867, // 55
2584, // 56
1949, // 57
1972, // 58
940, // 59
1134, // 60
1788, // 61
1670, // 62
1206, // 63
5719, // 64
6128, // 65
7222, // 66
6654, // 67
3710, // 68
3795, // 69
1492, // 70
1524, // 71
2215, // 72
1140, // 73
1355, // 74
971, // 75
2180, // 76
1248, // 77
1328, // 78
1195, // 79
1770, // 80
1078, // 81
1264, // 82
1266, // 83
1168, // 84
965, // 85
1155, // 86
1186, // 87
1347, // 88
1228, // 89
1529, // 90
1600, // 91
2617, // 92
2048, // 93
2546, // 94
3275, // 95
2410, // 96
3585, // 97
2504, // 98
2800, // 99
2675, // 100
6146, // 101
3663, // 102
2840, // 103
14253, // 104
3164, // 105
2221, // 106
1687, // 107
3208, // 108
2739, // 109
3512, // 110
4796, // 111
4091, // 112
3515, // 113
5288, // 114
4016, // 115
7937, // 116
6031, // 117
5360, // 118
3924, // 119
4892, // 120
3743, // 121
4566, // 122
4807, // 123
5852, // 124
6400, // 125
6225, // 126
8291, // 127
23243, // 128
7838, // 129
7073, // 130
8935, // 131
5437, // 132
4483, // 133
3641, // 134
5256, // 135
5312, // 136
5328, // 137
5370, // 138
3492, // 139
2458, // 140
1694, // 141
1821, // 142
2121, // 143
1916, // 144
1149, // 145
1516, // 146
1367, // 147
1236, // 148
1029, // 149
1258, // 150
1104, // 151
1245, // 152
1006, // 153
1149, // 154
1025, // 155
1241, // 156
952, // 157
1287, // 158
997, // 159
1713, // 160
1009, // 161
1187, // 162
879, // 163
1099, // 164
929, // 165
1078, // 166
951, // 167
1656, // 168
930, // 169
1153, // 170
1030, // 171
1262, // 172
1062, // 173
1214, // 174
1060, // 175
1621, // 176
930, // 177
1106, // 178
912, // 179
1034, // 180
892, // 181
1158, // 182
990, // 183
1175, // 184
850, // 185
1121, // 186
903, // 187
1087, // 188
920, // 189
1144, // 190
1056, // 191
3462, // 192
2240, // 193
4397, // 194
12136, // 195
7758, // 196
1345, // 197
1307, // 198
3278, // 199
1950, // 200
886, // 201
1023, // 202
1112, // 203
1077, // 204
1042, // 205
1061, // 206
1071, // 207
1484, // 208
1001, // 209
1096, // 210
915, // 211
1052, // 212
995, // 213
1070, // 214
876, // 215
1111, // 216
851, // 217
1059, // 218
805, // 219
1112, // 220
923, // 221
1103, // 222
817, // 223
1899, // 224
1872, // 225
976, // 226
841, // 227
1127, // 228
956, // 229
1159, // 230
950, // 231
7791, // 232
954, // 233
1289, // 234
933, // 235
1127, // 236
3207, // 237
1020, // 238
927, // 239
1355, // 240
768, // 241
1040, // 242
745, // 243
952, // 244
805, // 245
1073, // 246
740, // 247
1013, // 248
805, // 249
1008, // 250
796, // 251
996, // 252
1057, // 253
11457, // 254
13504, // 255
};

void MSG_initHuffman() {
int i,j;

msgInit = qtrue;
Huff_Init( &msgHuff );
for ( i = 0; i < 256; i++ ) {
for ( j = 0; j < msg_hData[i]; j++ ) {
Huff_addRef( &msgHuff.compressor, (byte)i ); /* Do update */
Huff_addRef( &msgHuff.decompressor, (byte)i ); /* Do update */
}
}
}

/*
void MSG_NUinitHuffman() {
byte *data;
int size, i, ch;
int array[256];

msgInit = qtrue;

Huff_Init(&msgHuff);
// load it in
size = FS_ReadFile( "netchan/netchan.bin", (void **)&data );

for(i=0;i<256;i++) {
array[i] = 0;
}
for(i=0;i<size;i++) {
ch = data[i];
Huff_addRef(&msgHuff.compressor, ch); // Do update
Huff_addRef(&msgHuff.decompressor, ch); // Do update
array[ch]++;
}
Com_Printf("msg_hData {\n");
for(i=0;i<256;i++) {
if (array[i] == 0) {
Huff_addRef(&msgHuff.compressor, i); // Do update
Huff_addRef(&msgHuff.decompressor, i); // Do update
}
Com_Printf("%d, // %d\n", array[i], i);
}
Com_Printf("};\n");
FS_FreeFile( data );
Cbuf_AddText( "condump dump.txt\n" );
}
*/

//===========================================================================
Something went wrong with that request. Please try again.