PageRenderTime 64ms CodeModel.GetById 26ms RepoModel.GetById 1ms app.codeStats 0ms

/tags/v1.9-final/main/netmisc-old.c

https://github.com/simX/d2x-xl
C | 865 lines | 650 code | 81 blank | 134 comment | 65 complexity | ec51cb250e7ddfb4ec332da10b8e445d MD5 | raw file
Possible License(s): GPL-2.0 
    

  1. /* $Id: netmisc.c,v 1.9 2003/10/04 19:13:32 btb Exp $ */
    2. 

  2. /*
    3. 

  3. THE COMPUTER CODE CONTAINED HEREIN IS THE SOLE PROPERTY OF PARALLAX
    4. 

  4. SOFTWARE CORPORATION ("PARALLAX").  PARALLAX, IN DISTRIBUTING THE CODE TO
    5. 

  5. END-USERS, AND SUBJECT TO ALL OF THE TERMS AND CONDITIONS HEREIN, GRANTS A
    6. 

  6. ROYALTY-FREE, PERPETUAL LICENSE TO SUCH END-USERS FOR USE BY SUCH END-USERS
    7. 

  7. IN USING, DISPLAYING,  AND CREATING DERIVATIVE WORKS THEREOF, SO LONG AS
    8. 

  8. SUCH USE, DISPLAY OR CREATION IS FOR NON-COMMERCIAL, ROYALTY OR REVENUE
    9. 

  9. FREE PURPOSES.  IN NO EVENT SHALL THE END-USER USE THE COMPUTER CODE
    10. 

  10. CONTAINED HEREIN FOR REVENUE-BEARING PURPOSES.  THE END-USER UNDERSTANDS
    11. 

  11. AND AGREES TO THE TERMS HEREIN AND ACCEPTS THE SAME BY USE OF THIS FILE.
    12. 

  12. COPYRIGHT 1993-1999 PARALLAX SOFTWARE CORPORATION.  ALL RIGHTS RESERVED.
    13. 

  13. */
    14. 

  14. 

  15. #ifdef HAVE_CONFIG_H
    16. 

  16. #include <conf.h>
    17. 

  17. #endif
    18. 

  18. 

  19. #ifdef RCS
    20. 

  20. static char rcsid[] = "$Id: netmisc.c,v 1.9 2003/10/04 19:13:32 btb Exp $";
    21. 

  21. #endif
    22. 

  22. 

  23. #include <stdio.h>
    24. 

  24. #include <string.h>
    25. 

  25. 

  26. #include "inferno.h"
    27. 

  27. #include "pstypes.h"
    28. 

  28. #include "mono.h"
    29. 

  29. 

  30. //#define WORDS_BIGENDIAN
    31. 

  31. 

  32. #if defined(WORDS_BIGENDIAN) || defined(__BIG_ENDIAN__)
    33. 

  33. 

  34. #include "byteswap.h"
    35. 

  35. #include "segment.h"
    36. 

  36. #include "gameseg.h"
    37. 

  37. #include "network.h"
    38. 

  38. #include "wall.h"
    39. 

  39. 

  40. // routine to calculate the checksum of the segments.  We add these specialized routines
    41. 

  41. // since the current way is byte order dependent.
    42. 

  42. 

  43. void BEDoCheckSumCalc(ubyte *b, int len, unsigned int *s1, unsigned int *s2)
    44. 

  44. {
    45. 

  45. 

  46. 	while(len--) {
    47. 

  47. 		*s1 += *b++;
    48. 

  48. 		if (*s1 >= 255) *s1 -= 255;
    49. 

  49. 		*s2 += *s1;
    50. 

  50. 	}
    51. 

  51. }
    52. 

  52. 

  53. ushort BECalcSegmentCheckSum()
    54. 

  54. {
    55. 

  55. 	int				i, j, k, t;
    56. 

  56. 	unsigned int	sum1,sum2;
    57. 

  57. 	short				s;
    58. 

  58. 	tSegment			*segP;
    59. 

  59. 	tSide				*sideP;
    60. 

  60. 	tUVL				*uvlP;
    61. 

  61. 	vmsVector		*normP;
    62. 

  62. 

  63. sum1 = sum2 = 0;
    64. 

  64. for (i = 0, segP = gameData.segs.segments; i < gameData.segs.nSegments; i++, segP++) {
    65. 

  65. 	for (j = 0, sideP = segP->sides; j < MAX_SIDES_PER_SEGMENT; j++, sideP++) {
    66. 

  66. 		BEDoCheckSumCalc (&(sideP->nType), 1, &sum1, &sum2);
    67. 

  67. 		BEDoCheckSumCalc (&(sideP->nFrame), 1, &sum1, &sum2);
    68. 

  68. 		s = INTEL_SHORT (WallNumI (i, j));
    69. 

  69. 		BEDoCheckSumCalc ((ubyte *) &s, 2, &sum1, &sum2);
    70. 

  70. 		s = INTEL_SHORT (sideP->nBaseTex);
    71. 

  71. 		BEDoCheckSumCalc ((ubyte *) &s, 2, &sum1, &sum2);
    72. 

  72. 		s = INTEL_SHORT (sideP->nOvlOrient + (((short) sideP->nOvlTex) << 2));
    73. 

  73. 		BEDoCheckSumCalc ((ubyte *) &s, 2, &sum1, &sum2);
    74. 

  74. 		for (k = 0, uvlP = sideP->uvls; k < 4; k++, uvlP++) {
    75. 

  75. 			t = INTEL_INT (((int) uvlP->u));
    76. 

  76. 			BEDoCheckSumCalc ((ubyte *) &t, 4, &sum1, &sum2);
    77. 

  77. 			t = INTEL_INT (((int) uvlP->v));
    78. 

  78. 			BEDoCheckSumCalc ((ubyte *) &t, 4, &sum1, &sum2);
    79. 

  79. 			t = INTEL_INT (((int) uvlP->l));
    80. 

  80. 			BEDoCheckSumCalc ((ubyte *) &t, 4, &sum1, &sum2);
    81. 

  81. 			}
    82. 

  82. 		for (k = 0, normP = sideP->normals; k < 2; k++, normP++) {
    83. 

  83. 			t = INTEL_INT (((int) normP->p.x));
    84. 

  84. 			BEDoCheckSumCalc ((ubyte *) &t, 4, &sum1, &sum2);
    85. 

  85. 			t = INTEL_INT (((int) normP->p.y));
    86. 

  86. 			BEDoCheckSumCalc ((ubyte *) &t, 4, &sum1, &sum2);
    87. 

  87. 			t = INTEL_INT (((int) normP->p.z));
    88. 

  88. 			BEDoCheckSumCalc ((ubyte *) &t, 4, &sum1, &sum2);
    89. 

  89. 			}
    90. 

  90. 		}
    91. 

  91. 	for (j = 0; j < MAX_SIDES_PER_SEGMENT; j++) {
    92. 

  92. 		s = INTEL_SHORT (segP->children [j]);
    93. 

  93. 		BEDoCheckSumCalc ((ubyte *) &s, 2, &sum1, &sum2);
    94. 

  94. 	}
    95. 

  95. 	for (j = 0; j < MAX_VERTICES_PER_SEGMENT; j++) {
    96. 

  96. 		s = INTEL_SHORT (segP->verts [j]);
    97. 

  97. 		BEDoCheckSumCalc ((ubyte *) &s, 2, &sum1, &sum2);
    98. 

  98. 	}
    99. 

  99. 	t = INTEL_INT (segP->objects);
    100. 

  100. 	BEDoCheckSumCalc((ubyte *) &t, 4, &sum1, &sum2);
    101. 

  101. }
    102. 

  102. sum2 %= 255;
    103. 

  103. return ((sum1<<8)+ sum2);
    104. 

  104. }
    105. 

  105. 

  106. // this routine totally and completely relies on the fact that the network
    107. 

  107. //  checksum must be calculated on the segments!!!!!
    108. 

  108. 

  109. ushort NetMiscCalcCheckSum(void * vptr, int len)
    110. 

  110. {
    111. 

  111. 	vptr = vptr;
    112. 

  112. 	len = len;
    113. 

  113. 	return BECalcSegmentCheckSum();
    114. 

  114. }
    115. 

  115. 

  116. // following are routine for macintosh only that will swap the elements of
    117. 

  117. // structures send through the networking code.  The structures and
    118. 

  118. // this code must be kept in total sync
    119. 

  119. 

  120. #include "ipx.h"
    121. 

  121. #include "multi.h"
    122. 

  122. #include "network.h"
    123. 

  123. #include "object.h"
    124. 

  124. #include "powerup.h"
    125. 

  125. #include "error.h"
    126. 

  126. 

  127. sbyte out_buffer[IPX_MAX_DATA_SIZE];    // used for tmp netgame packets as well as sending tObject data
    128. 

  128. 

  129. extern struct ipx_recv_data ipx_udpSrc;
    130. 

  130. 

  131. void BEReceiveNetPlayerInfo(ubyte *data, tNetPlayerInfo *info)
    132. 

  132. {
    133. 

  133. 	int loc = 0;
    134. 

  134. 

  135. 	memcpy(info->callsign, data + loc, CALLSIGN_LEN+1);       
    136. 

  136. 	loc += CALLSIGN_LEN+1;
    137. 

  137.   memcpy(&(info->network.ipx.server), data + loc, 4);       
    138. 

  138.   loc += 4;
    139. 

  139.   memcpy(&(info->network.ipx.node), data + loc, 6);         
    140. 

  140.   loc += 6;
    141. 

  141. 	info->version_major = data[loc];                            
    142. 

  142. 	loc++;
    143. 

  143. 	info->version_minor = data[loc];                            
    144. 

  144. 	loc++;
    145. 

  145. 	memcpy(&(info->computerType), data + loc, 1);            
    146. 

  146. 	loc++;      // memcpy to avoid compile time warning about enum
    147. 

  147. 	info->connected = data[loc];                                
    148. 

  148. 	loc++;
    149. 

  149. 	memcpy(&(info->socket), data + loc, 2);                   
    150. 

  150. 	loc += 2;
    151. 

  151. 	memcpy (&(info->rank),data + loc,1);                      
    152. 

  152. 	loc++;
    153. 

  153. 	// MWA don't think we need to swap this because we need it in high
    154. 

  154. 	// order  info->socket = INTEL_SHORT(info->socket);
    155. 

  155. }
    156. 

  156. 

  157. void BESendNetPlayersPacket(ubyte *server, ubyte *node)
    158. 

  158. {
    159. 

  159. 	int i, tmpi;
    160. 

  160. 	int loc = 0;
    161. 

  161. 	short tmps;
    162. 

  162. 

  163. 	memset(out_buffer, 0, sizeof(out_buffer));
    164. 

  164. 	out_buffer[0] = netPlayers.nType;                            loc++;
    165. 

  165. 	tmpi = INTEL_INT (netPlayers.nSecurity);
    166. 

  166. 	memcpy(out_buffer + loc, &tmpi, 4);                       loc += 4;
    167. 

  167. 	for (i = 0; i < MAX_PLAYERS+4; i++) {
    168. 

  168. 		memcpy(out_buffer + loc, netPlayers.players[i].callsign, CALLSIGN_LEN+1); 
    169. 

  169. 		loc += CALLSIGN_LEN+1;
    170. 

  170. 		memcpy(out_buffer + loc, netPlayers.players[i].network.ipx.server, 4);    
    171. 

  171. 		loc += 4;
    172. 

  172. 		memcpy(out_buffer + loc, netPlayers.players[i].network.ipx.node, 6);      
    173. 

  173. 		loc += 6;
    174. 

  174. 		memcpy(out_buffer + loc, &(netPlayers.players[i].version_major), 1);      
    175. 

  175. 		loc++;
    176. 

  176. 		memcpy(out_buffer + loc, &(netPlayers.players[i].version_minor), 1);      
    177. 

  177. 		loc++;
    178. 

  178. 		memcpy(out_buffer + loc, &(netPlayers.players[i].computerType), 1);      
    179. 

  179. 		loc++;
    180. 

  180. 		memcpy(out_buffer + loc, &(netPlayers.players[i].connected), 1);          
    181. 

  181. 		loc++;
    182. 

  182. 		tmps = INTEL_SHORT(netPlayers.players[i].socket);
    183. 

  183. 		memcpy(out_buffer + loc, &tmps, 2);                                       
    184. 

  184. 		loc += 2;
    185. 

  185. 		memcpy(out_buffer + loc, &(netPlayers.players[i].rank), 1);               
    186. 

  186. 		loc++;
    187. 

  187. 	}
    188. 

  188. 

  189. 	if ((server == NULL) && (node == NULL))
    190. 

  190. 		IPXSendBroadcastData(out_buffer, loc);
    191. 

  191. 	else
    192. 

  192. 		IPXSendInternetPacketData(out_buffer, loc, server, node);
    193. 

  193. 

  194. }
    195. 

  195. 

  196. void BEReceiveNetPlayersPacket(ubyte *data, tAllNetPlayersInfo *pinfo)
    197. 

  197. {
    198. 

  198. 	int i, loc = 0;
    199. 

  199. 

  200. 	pinfo->nType = data[loc];                            
    201. 

  201. 	loc++;
    202. 

  202. 	memcpy(&(pinfo->nSecurity), data + loc, 4);        
    203. 

  203. 	loc += 4;
    204. 

  204. 	pinfo->nSecurity = INTEL_INT (pinfo->nSecurity);
    205. 

  205. 	for (i = 0; i < MAX_PLAYERS+4; i++) {
    206. 

  206. 		BEReceiveNetPlayerInfo(data + loc, &(pinfo->players[i]));
    207. 

  207. 		loc += 26;          // sizeof(tNetPlayerInfo) on the PC
    208. 

  208. 	}
    209. 

  209. }
    210. 

  210. 

  211. void BESendSequencePacket(tSequencePacket seq, ubyte *server, ubyte *node, ubyte *netAddress)
    212. 

  212. {
    213. 

  213. 	short tmps;
    214. 

  214. 	int loc, tmpi;
    215. 

  215. 

  216. 	loc = 0;
    217. 

  217. 	memset(out_buffer, 0, sizeof(out_buffer));
    218. 

  218. 	out_buffer[0] = seq.nType;                                       
    219. 

  219. 	loc++;
    220. 

  220. 	tmpi = INTEL_INT (seq.nSecurity);
    221. 

  221. 	memcpy(out_buffer + loc, &tmpi, 4);                           
    222. 

  222. 	loc += 4;       
    223. 

  223. 	loc += 3;
    224. 

  224. 	memcpy(out_buffer + loc, seq.player.callsign, CALLSIGN_LEN+1);
    225. 

  225. 	loc += CALLSIGN_LEN+1;
    226. 

  226. 	memcpy(out_buffer + loc, seq.player.network.ipx.server, 4);   
    227. 

  227. 	loc += 4;
    228. 

  228. 	memcpy(out_buffer + loc, seq.player.network.ipx.node, 6);     
    229. 

  229. 	loc += 6;
    230. 

  230. 	out_buffer[loc] = seq.player.version_major;                     
    231. 

  231. 	loc++;
    232. 

  232. 	out_buffer[loc] = seq.player.version_minor;                     
    233. 

  233. 	loc++;
    234. 

  234. 	out_buffer[loc] = seq.player.computerType;                     
    235. 

  235. 	loc++;
    236. 

  236. 	out_buffer[loc] = seq.player.connected;                         
    237. 

  237. 	loc++;
    238. 

  238. 	tmps = INTEL_SHORT(seq.player.socket);
    239. 

  239. 	memcpy(out_buffer + loc, &tmps, 2);                           
    240. 

  240. 	loc += 2;
    241. 

  241. 	out_buffer[loc]=seq.player.rank;                                
    242. 

  242. 	loc++;      // for pad byte
    243. 

  243. 	if (netAddress != NULL)
    244. 

  244. 		IPXSendPacketData(out_buffer, loc, server, node, netAddress);
    245. 

  245. 	else if (!server && !node)
    246. 

  246. 		IPXSendBroadcastData(out_buffer, loc);
    247. 

  247. 	else
    248. 

  248. 		IPXSendInternetPacketData(out_buffer, loc, server, node);
    249. 

  249. }
    250. 

  250. 

  251. void BEReceiveSequencePacket(ubyte *data, tSequencePacket *seq)
    252. 

  252. {
    253. 

  253. 	int loc = 0;
    254. 

  254. 

  255. 	seq->nType = data[0];                        
    256. 

  256. 	loc++;
    257. 

  257. 	memcpy(&(seq->nSecurity), data + loc, 4);  loc += 4;   loc += 3;   // +3 for pad byte
    258. 

  258. 	seq->nSecurity = INTEL_INT (seq->nSecurity);
    259. 

  259. 	BEReceiveNetPlayerInfo(data + loc, &(seq->player));
    260. 

  260. }
    261. 

  261. 

  262. void BESendNetGamePacket(ubyte *server, ubyte *node, ubyte *netAddress, int liteFlag)     // lite says shorter netgame packets
    263. 

  263. {
    264. 

  264. 	uint tmpi;
    265. 

  265. 	ushort tmps; // p;
    266. 

  266. 	int i, j;
    267. 

  267. 	int loc = 0;
    268. 

  268. 

  269. 	memset(out_buffer, 0, IPX_MAX_DATA_SIZE);
    270. 

  270. 	memcpy(out_buffer + loc, &(netGame.nType), 1);                 
    271. 

  271. 	loc++;
    272. 

  272. 	tmpi = INTEL_INT (netGame.nSecurity);
    273. 

  273. 	memcpy(out_buffer + loc, &tmpi, 4);                           
    274. 

  274. 	loc += 4;
    275. 

  275. 	memcpy(out_buffer + loc, netGame.szGameName, NETGAME_NAME_LEN+1);  
    276. 

  276. 	loc += (NETGAME_NAME_LEN+1);
    277. 

  277. 	memcpy(out_buffer + loc, netGame.szMissionTitle, MISSION_NAME_LEN+1);  
    278. 

  278. 	loc += (MISSION_NAME_LEN+1);
    279. 

  279. 	memcpy(out_buffer + loc, netGame.szMissionName, 9);            
    280. 

  280. 	loc += 9;
    281. 

  281. 	tmpi = INTEL_INT (netGame.nLevel);
    282. 

  282. 	memcpy(out_buffer + loc, &tmpi, 4);                           
    283. 

  283. 	loc += 4;
    284. 

  284. 	memcpy(out_buffer + loc, &(netGame.gameMode), 1);             
    285. 

  285. 	loc++;
    286. 

  286. 	memcpy(out_buffer + loc, &(netGame.bRefusePlayers), 1);        
    287. 

  287. 	loc++;
    288. 

  288. 	memcpy(out_buffer + loc, &(netGame.difficulty), 1);           
    289. 

  289. 	loc++;
    290. 

  290. 	memcpy(out_buffer + loc, &(netGame.gameStatus), 1);          
    291. 

  291. 	loc++;
    292. 

  292. 	memcpy(out_buffer + loc, &(netGame.nNumPlayers), 1);           
    293. 

  293. 	loc++;
    294. 

  294. 	memcpy(out_buffer + loc, &(netGame.nMaxPlayers), 1);       
    295. 

  295. 	loc++;
    296. 

  296. 	memcpy(out_buffer + loc, &(netGame.nConnected), 1);         
    297. 

  297. 	loc++;
    298. 

  298. 	memcpy(out_buffer + loc, &(netGame.gameFlags), 1);           
    299. 

  299. 	loc++;
    300. 

  300. 	memcpy(out_buffer + loc, &(netGame.protocol_version), 1);     
    301. 

  301. 	loc++;
    302. 

  302. 	memcpy(out_buffer + loc, &(netGame.version_major), 1);        
    303. 

  303. 	loc++;
    304. 

  304. 	memcpy(out_buffer + loc, &(netGame.version_minor), 1);        
    305. 

  305. 	loc++;
    306. 

  306. 	memcpy(out_buffer + loc, &(netGame.teamVector), 1);          
    307. 

  307. 	loc++;
    308. 

  308. 

  309. 	if (liteFlag)
    310. 

  310. 		goto do_send;
    311. 

  311. 

  312. // will this work -- damn bitfields -- totally bogus when trying to do
    313. 

  313. // this nType of stuff
    314. 

  314. // Watcom makes bitfields from left to right.  CW7 on the mac goes
    315. 

  315. // from right to left.  then they are endian swapped
    316. 

  316. 

  317. 	tmps = *(ushort *)((ubyte *)(&netGame.teamVector) + 1);    // get the values for the first short bitfield
    318. 

  318. 	tmps = INTEL_SHORT(tmps);
    319. 

  319. 	memcpy(out_buffer + loc, &tmps, 2);                           
    320. 

  320. 	loc += 2;
    321. 

  321. 

  322. 	tmps = *(ushort *)((ubyte *)(&netGame.teamVector) + 3);    // get the values for the second short bitfield
    323. 

  323. 	tmps = INTEL_SHORT(tmps);
    324. 

  324. 	memcpy(out_buffer + loc, &tmps, 2);                           
    325. 

  325. 	loc += 2;
    326. 

  326. 

  327. #if 0       // removed since I reordered bitfields on mac
    328. 

  328. 	p = *(ushort *)((ubyte *)(&netGame.teamVector) + 1);       // get the values for the first short bitfield
    329. 

  329. 	tmps = 0;
    330. 

  330. 	for (i = 15; i >= 0; i--) {
    331. 

  331. 		if (p & (1 << i))
    332. 

  332. 			tmps |= (1 << (15 - i);
    333. 

  333. 	}
    334. 

  334. 	tmps = INTEL_SHORT(tmps);
    335. 

  335. 	memcpy(out_buffer + loc, &tmps, 2);                           
    336. 

  336. 	loc += 2;
    337. 

  337. 	p = *(ushort *)((ubyte *)(&netGame.teamVector) + 3);       // get the values for the second short bitfield
    338. 

  338. 	tmps = 0;
    339. 

  339. 	for (i = 15; i >= 0; i--) {
    340. 

  340. 		if (p & (1 << i))
    341. 

  341. 			tmps |= (1 << (15 - i);
    342. 

  342. 	}
    343. 

  343. 	tmps = INTEL_SHORT(tmps);
    344. 

  344. 	memcpy(out_buffer + loc, &tmps, 2);                           
    345. 

  345. 	loc += 2;
    346. 

  346. #endif
    347. 

  347. 

  348. 	memcpy(out_buffer + loc, netGame.team_name, 2*(CALLSIGN_LEN+1)); loc += 2*(CALLSIGN_LEN+1);
    349. 

  349. 	for (i = 0; i < MAX_PLAYERS; i++) {
    350. 

  350. 		tmpi = INTEL_INT (netGame.locations[i]);
    351. 

  351. 		memcpy(out_buffer + loc, &tmpi, 4);       
    352. 

  352. 		loc += 4;   // SWAP HERE!!!
    353. 

  353. 	}
    354. 

  354. 

  355. 	for (i = 0; i < MAX_PLAYERS; i++) {
    356. 

  356. 		for (j = 0; j < MAX_PLAYERS; j++) {
    357. 

  357. 			tmps = INTEL_SHORT(netGame.kills[i][j]);
    358. 

  358. 			memcpy(out_buffer + loc, &tmps, 2);   
    359. 

  359. 			loc += 2;   // SWAP HERE!!!
    360. 

  360. 		}
    361. 

  361. 	}
    362. 

  362. 

  363. 	tmps = INTEL_SHORT(netGame.segments_checksum);
    364. 

  364. 	memcpy(out_buffer + loc, &tmps, 2);           
    365. 

  365. 	loc += 2;   // SWAP_HERE
    366. 

  366. 	tmps = INTEL_SHORT(netGame.teamKills[0]);
    367. 

  367. 	memcpy(out_buffer + loc, &tmps, 2);           
    368. 

  368. 	loc += 2;   // SWAP_HERE
    369. 

  369. 	tmps = INTEL_SHORT(netGame.teamKills[1]);
    370. 

  370. 	memcpy(out_buffer + loc, &tmps, 2);           
    371. 

  371. 	loc += 2;   // SWAP_HERE
    372. 

  372. 	for (i = 0; i < MAX_PLAYERS; i++) {
    373. 

  373. 		tmps = INTEL_SHORT(netGame.killed[i]);
    374. 

  374. 		memcpy(out_buffer + loc, &tmps, 2);       
    375. 

  375. 		loc += 2;   // SWAP HERE!!!
    376. 

  376. 	}
    377. 

  377. 	for (i = 0; i < MAX_PLAYERS; i++) {
    378. 

  378. 		tmps = INTEL_SHORT(netGame.playerKills[i]);
    379. 

  379. 		memcpy(out_buffer + loc, &tmps, 2);       
    380. 

  380. 		loc += 2;   // SWAP HERE!!!
    381. 

  381. 	}
    382. 

  382. 

  383. 	tmpi = INTEL_INT (netGame.KillGoal);
    384. 

  384. 	memcpy(out_buffer + loc, &tmpi, 4);           
    385. 

  385. 	loc += 4;   // SWAP_HERE
    386. 

  386. 	tmpi = INTEL_INT (netGame.xPlayTimeAllowed);
    387. 

  387. 	memcpy(out_buffer + loc, &tmpi, 4);           
    388. 

  388. 	loc += 4;   // SWAP_HERE
    389. 

  389. 	tmpi = INTEL_INT (netGame.xLevelTime);
    390. 

  390. 	memcpy(out_buffer + loc, &tmpi, 4);           
    391. 

  391. 	loc += 4;   // SWAP_HERE
    392. 

  392. 	tmpi = INTEL_INT (netGame.control_invulTime);
    393. 

  393. 	memcpy(out_buffer + loc, &tmpi, 4);           
    394. 

  394. 	loc += 4;   // SWAP_HERE
    395. 

  395. 	tmpi = INTEL_INT (netGame.monitor_vector);
    396. 

  396. 	memcpy(out_buffer + loc, &tmpi, 4);           
    397. 

  397. 	loc += 4;   // SWAP_HERE
    398. 

  398. 	for (i = 0; i < MAX_PLAYERS; i++) {
    399. 

  399. 		tmpi = INTEL_INT (netGame.player_score[i]);
    400. 

  400. 		memcpy(out_buffer + loc, &tmpi, 4);       
    401. 

  401. 		loc += 4;   // SWAP_HERE
    402. 

  402. 	}
    403. 

  403. 	for (i = 0; i < MAX_PLAYERS; i++) {
    404. 

  404. 		memcpy(out_buffer + loc, &(netGame.playerFlags[i]), 1); loc++;
    405. 

  405. 	}
    406. 

  406. 	tmps = INTEL_SHORT(netGame.nPacketsPerSec);
    407. 

  407. 	memcpy(out_buffer + loc, &tmps, 2);                   
    408. 

  408. 	loc += 2;
    409. 

  409. 	memcpy(out_buffer + loc, &(netGame.bShortPackets), 1); 
    410. 

  410. 	loc++;
    411. 

  411. 

  412. do_send:
    413. 

  413. 	if (netAddress != NULL)
    414. 

  414. 		IPXSendPacketData(out_buffer, loc, server, node, netAddress);
    415. 

  415. 	else if ((server == NULL) && (node == NULL))
    416. 

  416. 		IPXSendBroadcastData(out_buffer, loc);
    417. 

  417. 	else
    418. 

  418. 		IPXSendInternetPacketData(out_buffer, loc, server, node);
    419. 

  419. }
    420. 

  420. 

  421. void BEReceiveNetGamePacket(ubyte *data, tNetgameInfo *netgame, int liteFlag)
    422. 

  422. {
    423. 

  423. 	int i, j;
    424. 

  424. 	int loc = 0;
    425. 

  425. 	short bitfield; // new_field;
    426. 

  426. 

  427. 	memcpy(&(netgame->nType), data + loc, 1);                      
    428. 

  428. 	loc++;
    429. 

  429. 	memcpy(&(netgame->nSecurity), data + loc, 4);                  
    430. 

  430. 	loc += 4;
    431. 

  431. 	netgame->nSecurity = INTEL_INT (netgame->nSecurity);
    432. 

  432. 	memcpy(netgame->szGameName, data + loc, NETGAME_NAME_LEN+1);   
    433. 

  433. 	loc += (NETGAME_NAME_LEN+1);
    434. 

  434. 	memcpy(netgame->szMissionTitle, data + loc, MISSION_NAME_LEN+1); 
    435. 

  435. 	loc += (MISSION_NAME_LEN+1);
    436. 

  436. 	memcpy(netgame->szMissionName, data + loc, 9);                 
    437. 

  437. 	loc += 9;
    438. 

  438. 	memcpy(&(netgame->nLevel), data + loc, 4);                  
    439. 

  439. 	loc += 4;
    440. 

  440. 	netgame->nLevel = INTEL_INT (netgame->nLevel);
    441. 

  441. 	memcpy(&(netgame->gameMode), data + loc, 1);                  
    442. 

  442. 	loc++;
    443. 

  443. 	memcpy(&(netgame->bRefusePlayers), data + loc, 1);             
    444. 

  444. 	loc++;
    445. 

  445. 	memcpy(&(netgame->difficulty), data + loc, 1);                
    446. 

  446. 	loc++;
    447. 

  447. 	memcpy(&(netgame->gameStatus), data + loc, 1);               
    448. 

  448. 	loc++;
    449. 

  449. 	memcpy(&(netgame->nNumPlayers), data + loc, 1);                
    450. 

  450. 	loc++;
    451. 

  451. 	memcpy(&(netgame->nMaxPlayers), data + loc, 1);            
    452. 

  452. 	loc++;
    453. 

  453. 	memcpy(&(netgame->nConnected), data + loc, 1);              
    454. 

  454. 	loc++;
    455. 

  455. 	memcpy(&(netgame->gameFlags), data + loc, 1);                
    456. 

  456. 	loc++;
    457. 

  457. 	memcpy(&(netgame->protocol_version), data + loc, 1);          
    458. 

  458. 	loc++;
    459. 

  459. 	memcpy(&(netgame->version_major), data + loc, 1);             
    460. 

  460. 	loc++;
    461. 

  461. 	memcpy(&(netgame->version_minor), data + loc, 1);             
    462. 

  462. 	loc++;
    463. 

  463. 	memcpy(&(netgame->teamVector), data + loc, 1);               
    464. 

  464. 	loc++;
    465. 

  465. 

  466. 	if (liteFlag)
    467. 

  467. 		return;
    468. 

  468. 

  469. 	memcpy(&bitfield, data + loc, 2);                             
    470. 

  470. 	loc += 2;
    471. 

  471. 	bitfield = INTEL_SHORT(bitfield);
    472. 

  472. 	memcpy(((ubyte *)(&netgame->teamVector) + 1), &bitfield, 2);
    473. 

  473. 

  474. 	memcpy(&bitfield, data + loc, 2);                             
    475. 

  475. 	loc += 2;
    476. 

  476. 	bitfield = INTEL_SHORT(bitfield);
    477. 

  477. 	memcpy(((ubyte *)(&netgame->teamVector) + 3), &bitfield, 2);
    478. 

  478. 

  479. #if 0       // not used since reordering mac bitfields
    480. 

  480. 	memcpy(&bitfield, data + loc, 2);                             
    481. 

  481. 	loc += 2;
    482. 

  482. 	new_field = 0;
    483. 

  483. 	for (i = 15; i >= 0; i--) {
    484. 

  484. 		if (bitfield & (1 << i))
    485. 

  485. 			new_field |= (1 << (15 - i);
    486. 

  486. 	}
    487. 

  487. 	new_field = INTEL_SHORT(new_field);
    488. 

  488. 	memcpy(((ubyte *)(&netgame->teamVector) + 1), &new_field, 2);
    489. 

  489. 

  490. 	memcpy(&bitfield, data + loc, 2);                             
    491. 

  491. 	loc += 2;
    492. 

  492. 	new_field = 0;
    493. 

  493. 	for (i = 15; i >= 0; i--) {
    494. 

  494. 		if (bitfield & (1 << i))
    495. 

  495. 			new_field |= (1 << (15 - i);
    496. 

  496. 	}
    497. 

  497. 	new_field = INTEL_SHORT(new_field);
    498. 

  498. 	memcpy(((ubyte *)(&netgame->teamVector) + 3), &new_field, 2);
    499. 

  499. #endif
    500. 

  500. 

  501. 	memcpy(netgame->team_name, data + loc, 2*(CALLSIGN_LEN+1));   
    502. 

  502. 	loc += 2*(CALLSIGN_LEN+1);
    503. 

  503. 	for (i = 0; i < MAX_PLAYERS; i++) {
    504. 

  504. 		memcpy(&(netgame->locations[i]), data + loc, 4);          
    505. 

  505. 		loc += 4;
    506. 

  506. 		netgame->locations[i] = INTEL_INT (netgame->locations[i]);
    507. 

  507. 	}
    508. 

  508. 

  509. 	for (i = 0; i < MAX_PLAYERS; i++) {
    510. 

  510. 		for (j = 0; j < MAX_PLAYERS; j++) {
    511. 

  511. 			memcpy(&(netgame->kills[i][j]), data + loc, 2);       
    512. 

  512. 			loc += 2;
    513. 

  513. 			netgame->kills[i][j] = INTEL_SHORT(netgame->kills[i][j]);
    514. 

  514. 		}
    515. 

  515. 	}
    516. 

  516. 

  517. 	memcpy(&(netgame->segments_checksum), data + loc, 2);         
    518. 

  518. 	loc += 2;
    519. 

  519. 	netgame->segments_checksum = INTEL_SHORT(netgame->segments_checksum);
    520. 

  520. 	memcpy(&(netgame->teamKills[0]), data + loc, 2);             
    521. 

  521. 	loc += 2;
    522. 

  522. 	netgame->teamKills[0] = INTEL_SHORT(netgame->teamKills[0]);
    523. 

  523. 	memcpy(&(netgame->teamKills[1]), data + loc, 2);             
    524. 

  524. 	loc += 2;
    525. 

  525. 	netgame->teamKills[1] = INTEL_SHORT(netgame->teamKills[1]);
    526. 

  526. 	for (i = 0; i < MAX_PLAYERS; i++) {
    527. 

  527. 		memcpy(&(netgame->killed[i]), data + loc, 2);             
    528. 

  528. 		loc += 2;
    529. 

  529. 		netgame->killed[i] = INTEL_SHORT(netgame->killed[i]);
    530. 

  530. 	}
    531. 

  531. 	for (i = 0; i < MAX_PLAYERS; i++) {
    532. 

  532. 		memcpy(&(netgame->playerKills[i]), data + loc, 2);       
    533. 

  533. 		loc += 2;
    534. 

  534. 		netgame->playerKills[i] = INTEL_SHORT(netgame->playerKills[i]);
    535. 

  535. 	}
    536. 

  536. 	memcpy(&(netgame->KillGoal), data + loc, 4);                  
    537. 

  537. 	loc += 4;
    538. 

  538. 	netgame->KillGoal = INTEL_INT (netgame->KillGoal);
    539. 

  539. 	memcpy(&(netgame->xPlayTimeAllowed), data + loc, 4);           
    540. 

  540. 	loc += 4;
    541. 

  541. 	netgame->xPlayTimeAllowed = INTEL_INT (netgame->xPlayTimeAllowed);
    542. 

  542. 

  543. 	memcpy(&(netgame->xLevelTime), data + loc, 4);                
    544. 

  544. 	loc += 4;
    545. 

  545. 	netgame->xLevelTime = INTEL_INT (netgame->xLevelTime);
    546. 

  546. 	memcpy(&(netgame->control_invulTime), data + loc, 4);        
    547. 

  547. 	loc += 4;
    548. 

  548. 	netgame->control_invulTime = INTEL_INT (netgame->control_invulTime);
    549. 

  549. 	memcpy(&(netgame->monitor_vector), data + loc, 4);            
    550. 

  550. 	loc += 4;
    551. 

  551. 	netgame->monitor_vector = INTEL_INT (netgame->monitor_vector);
    552. 

  552. 	for (i = 0; i < MAX_PLAYERS; i++) {
    553. 

  553. 		memcpy(&(netgame->player_score[i]), data + loc, 4);       
    554. 

  554. 		loc += 4;
    555. 

  555. 		netgame->player_score[i] = INTEL_INT (netgame->player_score[i]);
    556. 

  556. 	}
    557. 

  557. 	for (i = 0; i < MAX_PLAYERS; i++) {
    558. 

  558. 		memcpy(&(netgame->playerFlags[i]), data + loc, 1);       
    559. 

  559. 		loc++;
    560. 

  560. 	}
    561. 

  561. 	memcpy(&(netgame->nPacketsPerSec), data + loc, 2);             
    562. 

  562. 	loc += 2;
    563. 

  563. 	netgame->nPacketsPerSec = INTEL_SHORT(netgame->nPacketsPerSec);
    564. 

  564. 	memcpy(&(netgame->bShortPackets), data + loc, 1);              
    565. 

  565. 	loc ++;
    566. 

  566. 

  567. }
    568. 

  568. 

  569. #define EGI_INTEL_SHORT_2BUF(_m) \
    570. 

  570.   *((short *) (out_buffer + ((char *) &extraGameInfo [1]. _m - (char *) &extraGameInfo [1]))) = INTEL_SHORT (extraGameInfo [1]. _m);
    571. 

  571. 

  572. #define EGI_INTEL_INT_2BUF(_m) \
    573. 

  573. 	*((int *) (out_buffer + ((char *) &extraGameInfo [1]. _m - (char *) &extraGameInfo [1]))) = INTEL_INT (extraGameInfo [1]. _m);
    574. 

  574. 

  575. #define BUF2_EGI_INTEL_SHORT(_m) \
    576. 

  576. 	extraGameInfo [1]. _m = INTEL_SHORT (*((short *) (out_buffer + ((char *) &extraGameInfo [1]. _m - (char *) &extraGameInfo [1]))));
    577. 

  577. 

  578. #define BUF2_EGI_INTEL_INT(_m) \
    579. 

  579. 	extraGameInfo [1]. _m = INTEL_INT (*((int *) (out_buffer + ((char *) &extraGameInfo [1]. _m - (char *) &extraGameInfo [1]))));
    580. 

  580. 	
    581. 

  581. void BESendExtraGameInfo(ubyte *server, ubyte *node, ubyte *netAddress)
    582. 

  582. {
    583. 

  583. memcpy (out_buffer, &extraGameInfo [1], sizeof (tExtraGameInfo));
    584. 

  584. EGI_INTEL_SHORT_2BUF (entropy.nMaxVirusCapacity);
    585. 

  585. EGI_INTEL_SHORT_2BUF (entropy.nEnergyFillRate);
    586. 

  586. EGI_INTEL_SHORT_2BUF (entropy.nShieldFillRate);
    587. 

  587. EGI_INTEL_SHORT_2BUF (entropy.nShieldDamageRate);
    588. 

  588. EGI_INTEL_INT_2BUF (nSpawnDelay);
    589. 

  589. if (netAddress != NULL)
    590. 

  590. 	IPXSendPacketData(out_buffer, sizeof (tExtraGameInfo), server, node, netAddress);
    591. 

  591. else if ((server == NULL) && (node == NULL))
    592. 

  592. 	IPXSendBroadcastData(out_buffer, sizeof (tExtraGameInfo));
    593. 

  593. else
    594. 

  594. 	IPXSendInternetPacketData(out_buffer, sizeof (tExtraGameInfo), server, node);
    595. 

  595. }
    596. 

  596. 

  597. 

  598. void BEReceiveExtraGameInfo(ubyte *data, tExtraGameInfo *extraGameInfo)
    599. 

  599. {
    600. 

  600. memcpy (&extraGameInfo [1], data, sizeof (tExtraGameInfo));
    601. 

  601. BUF2_EGI_INTEL_SHORT (entropy.nMaxVirusCapacity);
    602. 

  602. BUF2_EGI_INTEL_SHORT (entropy.nEnergyFillRate);
    603. 

  603. BUF2_EGI_INTEL_SHORT (entropy.nShieldFillRate);
    604. 

  604. BUF2_EGI_INTEL_SHORT (entropy.nShieldDamageRate);
    605. 

  605. BUF2_EGI_INTEL_INT (nSpawnDelay);
    606. 

  606. }
    607. 

  607. 

  608. 

  609. void BESwapObject(tObject *objP)
    610. 

  610. {
    611. 

  611. // swap the short and int entries for this tObject
    612. 

  612. objP->nSignature     = INTEL_INT (objP->nSignature);
    613. 

  613. objP->next          = INTEL_SHORT(objP->next);
    614. 

  614. objP->prev          = INTEL_SHORT(objP->prev);
    615. 

  615. objP->nSegment       = INTEL_SHORT(objP->nSegment);
    616. 

  616. objP->position.vPos.p.x         = INTEL_INT (objP->position.vPos.p.x);
    617. 

  617. objP->position.vPos.p.y         = INTEL_INT (objP->position.vPos.p.y);
    618. 

  618. objP->position.vPos.p.z         = INTEL_INT (objP->position.vPos.p.z);
    619. 

  619. objP->position.mOrient.rVec.p.x = INTEL_INT (objP->position.mOrient.rVec.p.x);
    620. 

  620. objP->position.mOrient.rVec.p.y = INTEL_INT (objP->position.mOrient.rVec.p.y);
    621. 

  621. objP->position.mOrient.rVec.p.z = INTEL_INT (objP->position.mOrient.rVec.p.z);
    622. 

  622. objP->position.mOrient.fVec.p.x = INTEL_INT (objP->position.mOrient.fVec.p.x);
    623. 

  623. objP->position.mOrient.fVec.p.y = INTEL_INT (objP->position.mOrient.fVec.p.y);
    624. 

  624. objP->position.mOrient.fVec.p.z = INTEL_INT (objP->position.mOrient.fVec.p.z);
    625. 

  625. objP->position.mOrient.uVec.p.x = INTEL_INT (objP->position.mOrient.uVec.p.x);
    626. 

  626. objP->position.mOrient.uVec.p.y = INTEL_INT (objP->position.mOrient.uVec.p.y);
    627. 

  627. objP->position.mOrient.uVec.p.z = INTEL_INT (objP->position.mOrient.uVec.p.z);
    628. 

  628. objP->size          = INTEL_INT (objP->size);
    629. 

  629. objP->shields       = INTEL_INT (objP->shields);
    630. 

  630. objP->vLastPos.p.x    = INTEL_INT (objP->vLastPos.p.x);
    631. 

  631. objP->vLastPos.p.y    = INTEL_INT (objP->vLastPos.p.y);
    632. 

  632. objP->vLastPos.p.z    = INTEL_INT (objP->vLastPos.p.z);
    633. 

  633. objP->lifeleft      = INTEL_INT (objP->lifeleft);
    634. 

  634. switch (objP->movementType) {
    635. 

  635. 	case MT_PHYSICS:
    636. 

  636. 		objP->mType.physInfo.velocity.p.x = INTEL_INT (objP->mType.physInfo.velocity.p.x);
    637. 

  637. 		objP->mType.physInfo.velocity.p.y = INTEL_INT (objP->mType.physInfo.velocity.p.y);
    638. 

  638. 		objP->mType.physInfo.velocity.p.z = INTEL_INT (objP->mType.physInfo.velocity.p.z);
    639. 

  639. 		objP->mType.physInfo.thrust.p.x   = INTEL_INT (objP->mType.physInfo.thrust.p.x);
    640. 

  640. 		objP->mType.physInfo.thrust.p.y   = INTEL_INT (objP->mType.physInfo.thrust.p.y);
    641. 

  641. 		objP->mType.physInfo.thrust.p.z   = INTEL_INT (objP->mType.physInfo.thrust.p.z);
    642. 

  642. 		objP->mType.physInfo.mass       = INTEL_INT (objP->mType.physInfo.mass);
    643. 

  643. 		objP->mType.physInfo.drag       = INTEL_INT (objP->mType.physInfo.drag);
    644. 

  644. 		objP->mType.physInfo.brakes     = INTEL_INT (objP->mType.physInfo.brakes);
    645. 

  645. 		objP->mType.physInfo.rotVel.p.x   = INTEL_INT (objP->mType.physInfo.rotVel.p.x);
    646. 

  646. 		objP->mType.physInfo.rotVel.p.y   = INTEL_INT (objP->mType.physInfo.rotVel.p.y);
    647. 

  647. 		objP->mType.physInfo.rotVel.p.z   = INTEL_INT (objP->mType.physInfo.rotVel.p.z);
    648. 

  648. 		objP->mType.physInfo.rotThrust.p.x = INTEL_INT (objP->mType.physInfo.rotThrust.p.x);
    649. 

  649. 		objP->mType.physInfo.rotThrust.p.y = INTEL_INT (objP->mType.physInfo.rotThrust.p.y);
    650. 

  650. 		objP->mType.physInfo.rotThrust.p.z = INTEL_INT (objP->mType.physInfo.rotThrust.p.z);
    651. 

  651. 		objP->mType.physInfo.turnRoll   = INTEL_INT (objP->mType.physInfo.turnRoll);
    652. 

  652. 		objP->mType.physInfo.flags      = INTEL_SHORT(objP->mType.physInfo.flags);
    653. 

  653. 		break;
    654. 

  654. 

  655. 	case MT_SPINNING:
    656. 

  656. 		objP->mType.spinRate.p.x = INTEL_INT (objP->mType.spinRate.p.x);
    657. 

  657. 		objP->mType.spinRate.p.y = INTEL_INT (objP->mType.spinRate.p.y);
    658. 

  658. 		objP->mType.spinRate.p.z = INTEL_INT (objP->mType.spinRate.p.z);
    659. 

  659. 		break;
    660. 

  660. 	}
    661. 

  661. 

  662. switch (objP->controlType) {
    663. 

  663. 	case CT_WEAPON:
    664. 

  664. 		objP->cType.laserInfo.parentType = INTEL_SHORT(objP->cType.laserInfo.parentType);
    665. 

  665. 		objP->cType.laserInfo.nParentObj = INTEL_SHORT(objP->cType.laserInfo.nParentObj);
    666. 

  666. 		objP->cType.laserInfo.nParentSig  = INTEL_INT (objP->cType.laserInfo.nParentSig);
    667. 

  667. 		objP->cType.laserInfo.creationTime = INTEL_INT (objP->cType.laserInfo.creationTime);
    668. 

  668. 		objP->cType.laserInfo.nLastHitObj = INTEL_SHORT(objP->cType.laserInfo.nLastHitObj);
    669. 

  669. 		if (objP->cType.laserInfo.nLastHitObj < 0)
    670. 

  670. 			objP->cType.laserInfo.nLastHitObj = 0;
    671. 

  671. 		else {
    672. 

  672. 			gameData.objs.nHitObjects [OBJ_IDX (objP) * MAX_HIT_OBJECTS] = objP->cType.laserInfo.nLastHitObj;
    673. 

  673. 			objP->cType.laserInfo.nLastHitObj = 1;
    674. 

  674. 			}
    675. 

  675. 		objP->cType.laserInfo.nMslLock = INTEL_SHORT(objP->cType.laserInfo.nMslLock);
    676. 

  676. 		objP->cType.laserInfo.multiplier = INTEL_INT (objP->cType.laserInfo.multiplier);
    677. 

  677. 		break;
    678. 

  678. 

  679. 	case CT_EXPLOSION:
    680. 

  680. 		objP->cType.explInfo.nSpawnTime     = INTEL_INT (objP->cType.explInfo.nSpawnTime);
    681. 

  681. 		objP->cType.explInfo.nDeleteTime    = INTEL_INT (objP->cType.explInfo.nDeleteTime);
    682. 

  682. 		objP->cType.explInfo.nDeleteObj  = INTEL_SHORT(objP->cType.explInfo.nDeleteObj);
    683. 

  683. 		objP->cType.explInfo.nAttachParent  = INTEL_SHORT(objP->cType.explInfo.nAttachParent);
    684. 

  684. 		objP->cType.explInfo.nPrevAttach    = INTEL_SHORT(objP->cType.explInfo.nPrevAttach);
    685. 

  685. 		objP->cType.explInfo.nNextAttach    = INTEL_SHORT(objP->cType.explInfo.nNextAttach);
    686. 

  686. 		break;
    687. 

  687. 

  688. 	case CT_AI:
    689. 

  689. 		objP->cType.aiInfo.nHideSegment         = INTEL_SHORT(objP->cType.aiInfo.nHideSegment);
    690. 

  690. 		objP->cType.aiInfo.nHideIndex           = INTEL_SHORT(objP->cType.aiInfo.nHideIndex);
    691. 

  691. 		objP->cType.aiInfo.nPathLength          = INTEL_SHORT(objP->cType.aiInfo.nPathLength);
    692. 

  692. 		objP->cType.aiInfo.nDangerLaser     = INTEL_SHORT(objP->cType.aiInfo.nDangerLaser);
    693. 

  693. 		objP->cType.aiInfo.nDangerLaserSig = INTEL_INT (objP->cType.aiInfo.nDangerLaserSig);
    694. 

  694. 		objP->cType.aiInfo.xDyingStartTime     = INTEL_INT (objP->cType.aiInfo.xDyingStartTime);
    695. 

  695. 		break;
    696. 

  696. 

  697. 	case CT_LIGHT:
    698. 

  698. 		objP->cType.lightInfo.intensity = INTEL_INT (objP->cType.lightInfo.intensity);
    699. 

  699. 		break;
    700. 

  700. 

  701. 	case CT_POWERUP:
    702. 

  702. 		objP->cType.powerupInfo.count = INTEL_INT (objP->cType.powerupInfo.count);
    703. 

  703. 		objP->cType.powerupInfo.creationTime = INTEL_INT (objP->cType.powerupInfo.creationTime);
    704. 

  704. 		// Below commented out 5/2/96 by Matt.  I asked Allender why it was
    705. 

  705. 		// here, and he didn't know, and it looks like it doesn't belong.
    706. 

  706. 		// if (objP->id == POW_VULCAN)
    707. 

  707. 		// objP->cType.powerupInfo.count = VULCAN_WEAPON_AMMO_AMOUNT;
    708. 

  708. 		break;
    709. 

  709. 

  710. 	}
    711. 

  711. 

  712. switch (objP->renderType) {
    713. 

  713. 	case RT_MORPH:
    714. 

  714. 	case RT_POLYOBJ: {
    715. 

  715. 		int i;
    716. 

  716. 		objP->rType.polyObjInfo.nModel      = INTEL_INT (objP->rType.polyObjInfo.nModel);
    717. 

  717. 		for (i=0;i<MAX_SUBMODELS;i++) {
    718. 

  718. 			objP->rType.polyObjInfo.animAngles[i].p = INTEL_INT (objP->rType.polyObjInfo.animAngles[i].p);
    719. 

  719. 			objP->rType.polyObjInfo.animAngles[i].b = INTEL_INT (objP->rType.polyObjInfo.animAngles[i].b);
    720. 

  720. 			objP->rType.polyObjInfo.animAngles[i].h = INTEL_INT (objP->rType.polyObjInfo.animAngles[i].h);
    721. 

  721. 		}
    722. 

  722. 		objP->rType.polyObjInfo.nSubObjFlags   = INTEL_INT (objP->rType.polyObjInfo.nSubObjFlags);
    723. 

  723. 		objP->rType.polyObjInfo.nTexOverride  = INTEL_INT (objP->rType.polyObjInfo.nTexOverride);
    724. 

  724. 		objP->rType.polyObjInfo.nAltTextures   = INTEL_INT (objP->rType.polyObjInfo.nAltTextures);
    725. 

  725. 		break;
    726. 

  726. 	}
    727. 

  727. 

  728. 	case RT_WEAPON_VCLIP:
    729. 

  729. 	case RT_HOSTAGE:
    730. 

  730. 	case RT_POWERUP:
    731. 

  731. 	case RT_FIREBALL:
    732. 

  732. 	case RT_THRUSTER:
    733. 

  733. 		objP->rType.vClipInfo.nClipIndex = INTEL_INT (objP->rType.vClipInfo.nClipIndex);
    734. 

  734. 		objP->rType.vClipInfo.xFrameTime = INTEL_INT (objP->rType.vClipInfo.xFrameTime);
    735. 

  735. 		break;
    736. 

  736. 

  737. 	case RT_LASER:
    738. 

  738. 		break;
    739. 

  739. 	}
    740. 

  740. //  END OF SWAPPING OBJECT STRUCTURE
    741. 

  741. }
    742. 

  742. 

  743. #else /* !WORDS_BIGENDIAN */
    744. 

  744. 

  745. 

  746. // Calculates the checksum of a block of memory.
    747. 

  747. ushort NetMiscCalcCheckSum(void * vptr, int len)
    748. 

  748. {
    749. 

  749. 	ubyte *ptr = (ubyte *)vptr;
    750. 

  750. 	unsigned int sum1,sum2;
    751. 

  751. 

  752. 	sum1 = sum2 = 0;
    753. 

  753. 

  754. 	for (; len; len--) {
    755. 

  755. 		sum1 += *ptr++;
    756. 

  756. 		if (sum1 >= 255)
    757. 

  757. 			sum1 -= 255;
    758. 

  758. 		sum2 += sum1;
    759. 

  759. 	}
    760. 

  760. return (sum1 * 256 + sum2 % 255);
    761. 

  761. }
    762. 

  762. 

  763. #endif /* WORDS_BIGENDIAN */
    764. 

  764. 

  765. // needs to be recoded to actually work with big endian!
    766. 

  766. //--unused-- //Finds the difference between block1 and block2.  Fills in diff_buffer and
    767. 

  767. //--unused-- //returns the size of diff_buffer.
    768. 

  768. //--unused-- int netmisc_find_diff(void *block1, void *block2, int block_size, void *diff_buffer)
    769. 

  769. //--unused-- {
    770. 

  770. //--unused-- 	int mode;
    771. 

  771. //--unused-- 	ushort *c1, *c2, *diff_start, *c3;
    772. 

  772. //--unused-- 	int i, j, size, diff, n , same;
    773. 

  773. //--unused--
    774. 

  774. //--unused-- 	size=(block_size+1)/sizeof(ushort);
    775. 

  775. //--unused-- 	c1 = (ushort *)block1;
    776. 

  776. //--unused-- 	c2 = (ushort *)block2;
    777. 

  777. //--unused-- 	c3 = (ushort *)diff_buffer;
    778. 

  778. //--unused--
    779. 

  779. //--unused-- 	mode = same = diff = n = 0;
    780. 

  780. //--unused--
    781. 

  781. //--unused-- 	for (i=0; i<size; i++, c1++, c2++) {
    782. 

  782. //--unused-- 		if (*c1 != *c2) {
    783. 

  783. //--unused-- 			if (mode==0) {
    784. 

  784. //--unused-- 				mode = 1;
    785. 

  785. //--unused-- 				c3[n++] = same;
    786. 

  786. //--unused-- 				same=0; diff=0;
    787. 

  787. //--unused-- 				diff_start = c2;
    788. 

  788. //--unused-- 			}
    789. 

  789. //--unused-- 			*c1 = *c2;
    790. 

  790. //--unused-- 			diff++;
    791. 

  791. //--unused-- 			if (diff==65535) {
    792. 

  792. //--unused-- 				mode = 0;
    793. 

  793. //--unused-- 				// send how many diff ones.
    794. 

  794. //--unused-- 				c3[n++]=diff;
    795. 

  795. //--unused-- 				// send all the diff ones.
    796. 

  796. //--unused-- 				for (j=0; j<diff; j++)
    797. 

  797. //--unused-- 					c3[n++] = diff_start[j];
    798. 

  798. //--unused-- 				same=0; diff=0;
    799. 

  799. //--unused-- 				diff_start = c2;
    800. 

  800. //--unused-- 			}
    801. 

  801. //--unused-- 		} else {
    802. 

  802. //--unused-- 			if (mode==1) {
    803. 

  803. //--unused-- 				mode=0;
    804. 

  804. //--unused-- 				// send how many diff ones.
    805. 

  805. //--unused-- 				c3[n++]=diff;
    806. 

  806. //--unused-- 				// send all the diff ones.
    807. 

  807. //--unused-- 				for (j=0; j<diff; j++)
    808. 

  808. //--unused-- 					c3[n++] = diff_start[j];
    809. 

  809. //--unused-- 				same=0; diff=0;
    810. 

  810. //--unused-- 				diff_start = c2;
    811. 

  811. //--unused-- 			}
    812. 

  812. //--unused-- 			same++;
    813. 

  813. //--unused-- 			if (same==65535) {
    814. 

  814. //--unused-- 				mode=1;
    815. 

  815. //--unused-- 				// send how many the same
    816. 

  816. //--unused-- 				c3[n++] = same;
    817. 

  817. //--unused-- 				same=0; diff=0;
    818. 

  818. //--unused-- 				diff_start = c2;
    819. 

  819. //--unused-- 			}
    820. 

  820. //--unused-- 		}
    821. 

  821. //--unused--
    822. 

  822. //--unused-- 	}
    823. 

  823. //--unused-- 	if (mode==0) {
    824. 

  824. //--unused-- 		// send how many the same
    825. 

  825. //--unused-- 		c3[n++] = same;
    826. 

  826. //--unused-- 	} else {
    827. 

  827. //--unused-- 		// send how many diff ones.
    828. 

  828. //--unused-- 		c3[n++]=diff;
    829. 

  829. //--unused-- 		// send all the diff ones.
    830. 

  830. //--unused-- 		for (j=0; j<diff; j++)
    831. 

  831. //--unused-- 			c3[n++] = diff_start[j];
    832. 

  832. //--unused-- 	}
    833. 

  833. //--unused--
    834. 

  834. //--unused-- 	return n*2;
    835. 

  835. //--unused-- }
    836. 

  836. 

  837. //--unused-- //Applies diff_buffer to block1 to create a new block1.  Returns the final
    838. 

  838. //--unused-- //size of block1.
    839. 

  839. //--unused-- int netmisc_apply_diff(void *block1, void *diff_buffer, int diff_size)
    840. 

  840. //--unused-- {
    841. 

  841. //--unused-- 	unsigned int i, j, n, size;
    842. 

  842. //--unused-- 	ushort *c1, *c2;
    843. 

  843. //--unused--
    844. 

  844. //--unused-- 	c1 = (ushort *)diff_buffer;
    845. 

  845. //--unused-- 	c2 = (ushort *)block1;
    846. 

  846. //--unused--
    847. 

  847. //--unused-- 	size = diff_size/2;
    848. 

  848. //--unused--
    849. 

  849. //--unused-- 	i=j=0;
    850. 

  850. //--unused-- 	while (1) {
    851. 

  851. //--unused-- 		j += c1[i];         // Same
    852. 

  852. //--unused-- 		i++;
    853. 

  853. //--unused-- 		if (i>=size) break;
    854. 

  854. //--unused-- 		n = c1[i];          // ndiff
    855. 

  855. //--unused-- 		i++;
    856. 

  856. //--unused-- 		if (n>0) {
    857. 

  857. //--unused-- 			//Assert(n* < 256);
    858. 

  858. //--unused-- 			memcpy(&c2[j], &c1[i], n*2);
    859. 

  859. //--unused-- 			i += n;
    860. 

  860. //--unused-- 			j += n;
    861. 

  861. //--unused-- 		}
    862. 

  862. //--unused-- 		if (i>=size) break;
    863. 

  863. //--unused-- 	}
    864. 

  864. //--unused-- 	return j*2;
    865. 

  865. //--unused-- }
    866. 

  866.