PageRenderTime 51ms CodeModel.GetById 15ms RepoModel.GetById 0ms app.codeStats 0ms

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

https://github.com/simX/d2x-xl
C | 891 lines | 633 code | 102 blank | 156 comment | 63 complexity | b800c6e743cd323ed1a7dfd70fddc19f 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. /*
    16. 

  16.  *
    17. 

  17.  * Misc routines for network.
    18. 

  18.  *
    19. 

  19.  * Old Log:
    20. 

  20.  * Revision 1.1  1995/05/16  15:28:41  allender
    21. 

  21.  * Initial revision
    22. 

  22.  *
    23. 

  23.  * Revision 2.0  1995/02/27  11:27:24  john
    24. 

  24.  * New version 2.0, which has no anonymous unions, builds with
    25. 

  25.  * Watcom 10.0, and doesn't require parsing BITMAPS.TBL.
    26. 

  26.  *
    27. 

  27.  * Revision 1.3  1994/11/19  15:19:34  mike
    28. 

  28.  * rip out unused code and data.
    29. 

  29.  *
    30. 

  30.  * Revision 1.2  1994/08/09  19:31:53  john
    31. 

  31.  * Networking changes.
    32. 

  32.  *
    33. 

  33.  * Revision 1.1  1994/08/08  11:06:07  john
    34. 

  34.  * Initial revision
    35. 

  35.  *
    36. 

  36.  *
    37. 

  37.  */
    38. 

  38. 

  39. #ifdef HAVE_CONFIG_H
    40. 

  40. #include <conf.h>
    41. 

  41. #endif
    42. 

  42. 

  43. #ifdef RCS
    44. 

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

  45. #endif
    46. 

  46. 

  47. #include <stdio.h>
    48. 

  48. #include <string.h>
    49. 

  49. 

  50. #include "inferno.h"
    51. 

  51. #include "pstypes.h"
    52. 

  52. #include "mono.h"
    53. 

  53. 

  54. #if defined(WORDS_BIGENDIAN) || defined(__BIG_ENDIAN__)
    55. 

  55. 

  56. #include "byteswap.h"
    57. 

  57. #include "segment.h"
    58. 

  58. #include "gameseg.h"
    59. 

  59. #include "network.h"
    60. 

  60. #include "wall.h"
    61. 

  61. 

  62. // routine to calculate the checksum of the segments.  We add these specialized routines
    63. 

  63. // since the current way is byte order dependent.
    64. 

  64. 

  65. void BEDoCheckSumCalc(ubyte *b, int len, unsigned int *s1, unsigned int *s2)
    66. 

  66. {
    67. 

  67. 

  68. 	while(len--) {
    69. 

  69. 		*s1 += *b++;
    70. 

  70. 		if (*s1 >= 255) *s1 -= 255;
    71. 

  71. 		*s2 += *s1;
    72. 

  72. 	}
    73. 

  73. }
    74. 

  74. 

  75. ushort BECalcSegmentCheckSum()
    76. 

  76. {
    77. 

  77. 	int i, j, k;
    78. 

  78. 	unsigned int sum1,sum2;
    79. 

  79. 	short s;
    80. 

  80. 	int t;
    81. 

  81. 

  82. 	sum1 = sum2 = 0;
    83. 

  83. 	for (i = 0; i < gameData.segs.nLastSegment + 1; i++) {
    84. 

  84. 		for (j = 0; j < MAX_SIDES_PER_SEGMENT; j++) {
    85. 

  85. 			BEDoCheckSumCalc(&(gameData.segs.segments[i].sides[j].nType), 1, &sum1, &sum2);
    86. 

  86. 			BEDoCheckSumCalc(&(gameData.segs.segments[i].sides[j].nFrame), 1, &sum1, &sum2);
    87. 

  87. 			s = INTEL_SHORT(WallNumI (i, j));
    88. 

  88. 			BEDoCheckSumCalc((ubyte *)&s, 2, &sum1, &sum2);
    89. 

  89. 			s = INTEL_SHORT(gameData.segs.segments[i].sides[j].nBaseTex);
    90. 

  90. 			BEDoCheckSumCalc((ubyte *)&s, 2, &sum1, &sum2);
    91. 

  91. 			s = INTEL_SHORT(gameData.segs.segments[i].sides[j].nOvlTex);
    92. 

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

  93. 			for (k = 0; k < 4; k++) {
    94. 

  94. 				t = INTEL_INT(((int)gameData.segs.segments[i].sides[j].uvls[k].u));
    95. 

  95. 				BEDoCheckSumCalc((ubyte *)&t, 4, &sum1, &sum2);
    96. 

  96. 				t = INTEL_INT(((int)gameData.segs.segments[i].sides[j].uvls[k].v));
    97. 

  97. 				BEDoCheckSumCalc((ubyte *)&t, 4, &sum1, &sum2);
    98. 

  98. 				t = INTEL_INT(((int)gameData.segs.segments[i].sides[j].uvls[k].l));
    99. 

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

  100. 			}
    101. 

  101. 			for (k = 0; k < 2; k++) {
    102. 

  102. 				t = INTEL_INT(((int)gameData.segs.segments[i].sides[j].normals[k].x));
    103. 

  103. 				BEDoCheckSumCalc((ubyte *)&t, 4, &sum1, &sum2);
    104. 

  104. 				t = INTEL_INT(((int)gameData.segs.segments[i].sides[j].normals[k].y));
    105. 

  105. 				BEDoCheckSumCalc((ubyte *)&t, 4, &sum1, &sum2);
    106. 

  106. 				t = INTEL_INT(((int)gameData.segs.segments[i].sides[j].normals[k].z));
    107. 

  107. 				BEDoCheckSumCalc((ubyte *)&t, 4, &sum1, &sum2);
    108. 

  108. 			}
    109. 

  109. 		}
    110. 

  110. 		for (j = 0; j < MAX_SIDES_PER_SEGMENT; j++) {
    111. 

  111. 			s = INTEL_SHORT(gameData.segs.segments[i].children[j]);
    112. 

  112. 			BEDoCheckSumCalc((ubyte *)&s, 2, &sum1, &sum2);
    113. 

  113. 		}
    114. 

  114. 		for (j = 0; j < MAX_VERTICES_PER_SEGMENT; j++) {
    115. 

  115. 			s = INTEL_SHORT(gameData.segs.segments[i].verts[j]);
    116. 

  116. 			BEDoCheckSumCalc((ubyte *)&s, 2, &sum1, &sum2);
    117. 

  117. 		}
    118. 

  118. 		t = INTEL_INT(gameData.segs.segments[i].objects);
    119. 

  119. 		BEDoCheckSumCalc((ubyte *)&t, 4, &sum1, &sum2);
    120. 

  120. 	}
    121. 

  121. 	sum2 %= 255;
    122. 

  122. 	return ((sum1<<8)+ sum2);
    123. 

  123. }
    124. 

  124. 

  125. // this routine totally and completely relies on the fact that the network
    126. 

  126. //  checksum must be calculated on the segments!!!!!
    127. 

  127. 

  128. ushort NetMiscCalcCheckSum(void * vptr, int len)
    129. 

  129. {
    130. 

  130. 	vptr = vptr;
    131. 

  131. 	len = len;
    132. 

  132. 	return BECalcSegmentCheckSum();
    133. 

  133. }
    134. 

  134. 

  135. // following are routine for macintosh only that will swap the elements of
    136. 

  136. // structures send through the networking code.  The structures and
    137. 

  137. // this code must be kept in total sync
    138. 

  138. 

  139. #include "ipx.h"
    140. 

  140. #include "multi.h"
    141. 

  141. #ifdef NETWORK
    142. 

  142. #include "network.h"
    143. 

  143. #endif
    144. 

  144. #include "object.h"
    145. 

  145. #include "powerup.h"
    146. 

  146. #include "error.h"
    147. 

  147. 

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

  149. 

  150. extern struct ipx_recv_data ipx_udpSrc;
    151. 

  151. 

  152. void BEReceiveNetPlayerInfo(ubyte *data, netplayer_info *info)
    153. 

  153. {
    154. 

  154. 	int loc = 0;
    155. 

  155. 

  156. 	memcpy(info->callsign, data + loc, CALLSIGN_LEN+1);       
    157. 

  157. 	loc += CALLSIGN_LEN+1;
    158. 

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

  159.   loc += 4;
    160. 

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

  161.   loc += 6;
    162. 

  162. 	info->version_major = data[loc];                            
    163. 

  163. 	loc++;
    164. 

  164. 	info->version_minor = data[loc];                            
    165. 

  165. 	loc++;
    166. 

  166. 	memcpy(&(info->computerType), data + loc, 1);            
    167. 

  167. 	loc++;      // memcpy to avoid compile time warning about enum
    168. 

  168. 	info->connected = data[loc];                                
    169. 

  169. 	loc++;
    170. 

  170. 	memcpy(&(info->socket), data + loc, 2);                   
    171. 

  171. 	loc += 2;
    172. 

  172. 	memcpy (&(info->rank),data + loc,1);                      
    173. 

  173. 	loc++;
    174. 

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

  175. 	// order  info->socket = INTEL_SHORT(info->socket);
    176. 

  176. }
    177. 

  177. 

  178. void BESendNetPlayersPacket(ubyte *server, ubyte *node)
    179. 

  179. {
    180. 

  180. 	int i, tmpi;
    181. 

  181. 	int loc = 0;
    182. 

  182. 	short tmps;
    183. 

  183. 

  184. 	memset(out_buffer, 0, sizeof(out_buffer));
    185. 

  185. 	out_buffer[0] = netPlayers.nType;                            loc++;
    186. 

  186. 	tmpi = INTEL_INT(netPlayers.Security);
    187. 

  187. 	memcpy(out_buffer + loc, &tmpi, 4);                       loc += 4;
    188. 

  188. 	for (i = 0; i < MAX_PLAYERS+4; i++) {
    189. 

  189. 		memcpy(out_buffer + loc, netPlayers.players[i].callsign, CALLSIGN_LEN+1); loc += CALLSIGN_LEN+1;
    190. 

  190. 		memcpy(out_buffer + loc, netPlayers.players[i].network.ipx.server, 4);    loc += 4;
    191. 

  191. 		memcpy(out_buffer + loc, netPlayers.players[i].network.ipx.node, 6);      loc += 6;
    192. 

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

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

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

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

  196. 		tmps = INTEL_SHORT(netPlayers.players[i].socket);
    197. 

  197. 		memcpy(out_buffer + loc, &tmps, 2);                                       loc += 2;
    198. 

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

  199. 	}
    200. 

  200. 

  201. 	if ((server == NULL) && (node == NULL))
    202. 

  202. 		IPXSendBroadcastData(out_buffer, loc);
    203. 

  203. 	else
    204. 

  204. 		IPXSendInternetPacketData(out_buffer, loc, server, node);
    205. 

  205. 

  206. }
    207. 

  207. 

  208. void BEReceiveNetPlayersPacket(ubyte *data, allNetPlayers_info *pinfo)
    209. 

  209. {
    210. 

  210. 	int i, loc = 0;
    211. 

  211. 

  212. 	pinfo->nType = data[loc];                            
    213. 

  213. 	loc++;
    214. 

  214. 	memcpy(&(pinfo->Security), data + loc, 4);        
    215. 

  215. 	loc += 4;
    216. 

  216. 	pinfo->Security = INTEL_INT(pinfo->Security);
    217. 

  217. 	for (i = 0; i < MAX_PLAYERS+4; i++) {
    218. 

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

  219. 		loc += 26;          // sizeof(netplayer_info) on the PC
    220. 

  220. 	}
    221. 

  221. }
    222. 

  222. 

  223. void BESendSequencePacket(sequence_packet seq, ubyte *server, ubyte *node, ubyte *netAddress)
    224. 

  224. {
    225. 

  225. 	short tmps;
    226. 

  226. 	int loc, tmpi;
    227. 

  227. 

  228. 	loc = 0;
    229. 

  229. 	memset(out_buffer, 0, sizeof(out_buffer));
    230. 

  230. 	out_buffer[0] = seq.nType;                                       
    231. 

  231. 	loc++;
    232. 

  232. 	tmpi = INTEL_INT(seq.Security);
    233. 

  233. 	memcpy(out_buffer + loc, &tmpi, 4);                           
    234. 

  234. 	loc += 4;       
    235. 

  235. 	loc += 3;
    236. 

  236. 	memcpy(out_buffer + loc, seq.player.callsign, CALLSIGN_LEN+1);
    237. 

  237. 	loc += CALLSIGN_LEN+1;
    238. 

  238. 	memcpy(out_buffer + loc, seq.player.network.ipx.server, 4);   
    239. 

  239. 	loc += 4;
    240. 

  240. 	memcpy(out_buffer + loc, seq.player.network.ipx.node, 6);     
    241. 

  241. 	loc += 6;
    242. 

  242. 	out_buffer[loc] = seq.player.version_major;                     
    243. 

  243. 	loc++;
    244. 

  244. 	out_buffer[loc] = seq.player.version_minor;                     
    245. 

  245. 	loc++;
    246. 

  246. 	out_buffer[loc] = seq.player.computerType;                     
    247. 

  247. 	loc++;
    248. 

  248. 	out_buffer[loc] = seq.player.connected;                         
    249. 

  249. 	loc++;
    250. 

  250. 	tmps = INTEL_SHORT(seq.player.socket);
    251. 

  251. 	memcpy(out_buffer + loc, &tmps, 2);                           
    252. 

  252. 	loc += 2;
    253. 

  253. 	out_buffer[loc]=seq.player.rank;                                
    254. 

  254. 	loc++;      // for pad byte
    255. 

  255. 	if (netAddress != NULL)
    256. 

  256. 		IPXSendPacketData(out_buffer, loc, server, node, netAddress);
    257. 

  257. 	else if (!server && !node)
    258. 

  258. 		IPXSendBroadcastData(out_buffer, loc);
    259. 

  259. 	else
    260. 

  260. 		IPXSendInternetPacketData(out_buffer, loc, server, node);
    261. 

  261. }
    262. 

  262. 

  263. void BEReceiveSequencePacket(ubyte *data, sequence_packet *seq)
    264. 

  264. {
    265. 

  265. 	int loc = 0;
    266. 

  266. 

  267. 	seq->nType = data[0];                        loc++;
    268. 

  268. 	memcpy(&(seq->Security), data + loc, 4);  loc += 4;   loc += 3;   // +3 for pad byte
    269. 

  269. 	seq->Security = INTEL_INT(seq->Security);
    270. 

  270. 	BEReceiveNetPlayerInfo(data + loc, &(seq->player));
    271. 

  271. }
    272. 

  272. 

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

  274. {
    275. 

  275. 	uint tmpi;
    276. 

  276. 	ushort tmps; // p;
    277. 

  277. 	int i, j;
    278. 

  278. 	int loc = 0;
    279. 

  279. 

  280. 	memset(out_buffer, 0, IPX_MAX_DATA_SIZE);
    281. 

  281. 	memcpy(out_buffer + loc, &(netGame.nType), 1);                 
    282. 

  282. 	loc++;
    283. 

  283. 	tmpi = INTEL_INT(netGame.Security);
    284. 

  284. 	memcpy(out_buffer + loc, &tmpi, 4);                           
    285. 

  285. 	loc += 4;
    286. 

  286. 	memcpy(out_buffer + loc, netGame.game_name, NETGAME_NAME_LEN+1);  
    287. 

  287. 	loc += (NETGAME_NAME_LEN+1);
    288. 

  288. 	memcpy(out_buffer + loc, netGame.mission_title, MISSION_NAME_LEN+1);  
    289. 

  289. 	loc += (MISSION_NAME_LEN+1);
    290. 

  290. 	memcpy(out_buffer + loc, netGame.mission_name, 9);            
    291. 

  291. 	loc += 9;
    292. 

  292. 	tmpi = INTEL_INT(netGame.levelnum);
    293. 

  293. 	memcpy(out_buffer + loc, &tmpi, 4);                           
    294. 

  294. 	loc += 4;
    295. 

  295. 	memcpy(out_buffer + loc, &(netGame.gamemode), 1);             
    296. 

  296. 	loc++;
    297. 

  297. 	memcpy(out_buffer + loc, &(netGame.RefusePlayers), 1);        
    298. 

  298. 	loc++;
    299. 

  299. 	memcpy(out_buffer + loc, &(netGame.difficulty), 1);           
    300. 

  300. 	loc++;
    301. 

  301. 	memcpy(out_buffer + loc, &(netGame.game_status), 1);          
    302. 

  302. 	loc++;
    303. 

  303. 	memcpy(out_buffer + loc, &(netGame.numplayers), 1);           
    304. 

  304. 	loc++;
    305. 

  305. 	memcpy(out_buffer + loc, &(netGame.max_numplayers), 1);       
    306. 

  306. 	loc++;
    307. 

  307. 	memcpy(out_buffer + loc, &(netGame.numconnected), 1);         
    308. 

  308. 	loc++;
    309. 

  309. 	memcpy(out_buffer + loc, &(netGame.gameFlags), 1);           
    310. 

  310. 	loc++;
    311. 

  311. 	memcpy(out_buffer + loc, &(netGame.protocol_version), 1);     
    312. 

  312. 	loc++;
    313. 

  313. 	memcpy(out_buffer + loc, &(netGame.version_major), 1);        
    314. 

  314. 	loc++;
    315. 

  315. 	memcpy(out_buffer + loc, &(netGame.version_minor), 1);        
    316. 

  316. 	loc++;
    317. 

  317. 	memcpy(out_buffer + loc, &(netGame.team_vector), 1);          
    318. 

  318. 	loc++;
    319. 

  319. 

  320. 	if (liteFlag)
    321. 

  321. 		goto do_send;
    322. 

  322. 

  323. // will this work -- damn bitfields -- totally bogus when trying to do
    324. 

  324. // this nType of stuff
    325. 

  325. // Watcom makes bitfields from left to right.  CW7 on the mac goes
    326. 

  326. // from right to left.  then they are endian swapped
    327. 

  327. 

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

  329. 	tmps = INTEL_SHORT(tmps);
    330. 

  330. 	memcpy(out_buffer + loc, &tmps, 2);                           
    331. 

  331. 	loc += 2;
    332. 

  332. 

  333. 	tmps = *(ushort *)((ubyte *)(&netGame.team_vector) + 3);    // get the values for the second short bitfield
    334. 

  334. 	tmps = INTEL_SHORT(tmps);
    335. 

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

  336. 	loc += 2;
    337. 

  337. 

  338. #if 0       // removed since I reordered bitfields on mac
    339. 

  339. 	p = *(ushort *)((ubyte *)(&netGame.team_vector) + 1);       // get the values for the first short bitfield
    340. 

  340. 	tmps = 0;
    341. 

  341. 	for (i = 15; i >= 0; i--) {
    342. 

  342. 		if (p & (1 << i))
    343. 

  343. 			tmps |= (1 << (15 - i);
    344. 

  344. 	}
    345. 

  345. 	tmps = INTEL_SHORT(tmps);
    346. 

  346. 	memcpy(out_buffer + loc, &tmps, 2);                           
    347. 

  347. 	loc += 2;
    348. 

  348. 	p = *(ushort *)((ubyte *)(&netGame.team_vector) + 3);       // get the values for the second short bitfield
    349. 

  349. 	tmps = 0;
    350. 

  350. 	for (i = 15; i >= 0; i--) {
    351. 

  351. 		if (p & (1 << i))
    352. 

  352. 			tmps |= (1 << (15 - i);
    353. 

  353. 	}
    354. 

  354. 	tmps = INTEL_SHORT(tmps);
    355. 

  355. 	memcpy(out_buffer + loc, &tmps, 2);                           
    356. 

  356. 	loc += 2;
    357. 

  357. #endif
    358. 

  358. 

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

  360. 	for (i = 0; i < MAX_PLAYERS; i++) {
    361. 

  361. 		tmpi = INTEL_INT(netGame.locations[i]);
    362. 

  362. 		memcpy(out_buffer + loc, &tmpi, 4);       
    363. 

  363. 		loc += 4;   // SWAP HERE!!!
    364. 

  364. 	}
    365. 

  365. 

  366. 	for (i = 0; i < MAX_PLAYERS; i++) {
    367. 

  367. 		for (j = 0; j < MAX_PLAYERS; j++) {
    368. 

  368. 			tmps = INTEL_SHORT(netGame.kills[i][j]);
    369. 

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

  370. 			loc += 2;   // SWAP HERE!!!
    371. 

  371. 		}
    372. 

  372. 	}
    373. 

  373. 

  374. 	tmps = INTEL_SHORT(netGame.segments_checksum);
    375. 

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

  376. 	loc += 2;   // SWAP_HERE
    377. 

  377. 	tmps = INTEL_SHORT(netGame.teamKills[0]);
    378. 

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

  379. 	loc += 2;   // SWAP_HERE
    380. 

  380. 	tmps = INTEL_SHORT(netGame.teamKills[1]);
    381. 

  381. 	memcpy(out_buffer + loc, &tmps, 2);           
    382. 

  382. 	loc += 2;   // SWAP_HERE
    383. 

  383. 	for (i = 0; i < MAX_PLAYERS; i++) {
    384. 

  384. 		tmps = INTEL_SHORT(netGame.killed[i]);
    385. 

  385. 		memcpy(out_buffer + loc, &tmps, 2);       
    386. 

  386. 		loc += 2;   // SWAP HERE!!!
    387. 

  387. 	}
    388. 

  388. 	for (i = 0; i < MAX_PLAYERS; i++) {
    389. 

  389. 		tmps = INTEL_SHORT(netGame.playerKills[i]);
    390. 

  390. 		memcpy(out_buffer + loc, &tmps, 2);       
    391. 

  391. 		loc += 2;   // SWAP HERE!!!
    392. 

  392. 	}
    393. 

  393. 

  394. 	tmpi = INTEL_INT(netGame.KillGoal);
    395. 

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

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

  397. 	tmpi = INTEL_INT(netGame.PlayTimeAllowed);
    398. 

  398. 	memcpy(out_buffer + loc, &tmpi, 4);           
    399. 

  399. 	loc += 4;   // SWAP_HERE
    400. 

  400. 	tmpi = INTEL_INT(netGame.levelTime);
    401. 

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

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

  403. 	tmpi = INTEL_INT(netGame.control_invulTime);
    404. 

  404. 	memcpy(out_buffer + loc, &tmpi, 4);           
    405. 

  405. 	loc += 4;   // SWAP_HERE
    406. 

  406. 	tmpi = INTEL_INT(netGame.monitor_vector);
    407. 

  407. 	memcpy(out_buffer + loc, &tmpi, 4);           
    408. 

  408. 	loc += 4;   // SWAP_HERE
    409. 

  409. 	for (i = 0; i < MAX_PLAYERS; i++) {
    410. 

  410. 		tmpi = INTEL_INT(netGame.player_score[i]);
    411. 

  411. 		memcpy(out_buffer + loc, &tmpi, 4);       
    412. 

  412. 		loc += 4;   // SWAP_HERE
    413. 

  413. 	}
    414. 

  414. 	for (i = 0; i < MAX_PLAYERS; i++) {
    415. 

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

  416. 	}
    417. 

  417. 	tmps = INTEL_SHORT(netGame.nPacketsPerSec);
    418. 

  418. 	memcpy(out_buffer + loc, &tmps, 2);                   
    419. 

  419. 	loc += 2;
    420. 

  420. 	memcpy(out_buffer + loc, &(netGame.bShortPackets), 1); 
    421. 

  421. 	loc++;
    422. 

  422. 

  423. do_send:
    424. 

  424. 	if (netAddress != NULL)
    425. 

  425. 		IPXSendPacketData(out_buffer, loc, server, node, netAddress);
    426. 

  426. 	else if ((server == NULL) && (node == NULL))
    427. 

  427. 		IPXSendBroadcastData(out_buffer, loc);
    428. 

  428. 	else
    429. 

  429. 		IPXSendInternetPacketData(out_buffer, loc, server, node);
    430. 

  430. }
    431. 

  431. 

  432. void BEReceiveNetGamePacket(ubyte *data, netgame_info *netgame, int liteFlag)
    433. 

  433. {
    434. 

  434. 	int i, j;
    435. 

  435. 	int loc = 0;
    436. 

  436. 	short bitfield; // new_field;
    437. 

  437. 

  438. 	memcpy(&(netgame->nType), data + loc, 1);                      
    439. 

  439. 	loc++;
    440. 

  440. 	memcpy(&(netgame->Security), data + loc, 4);                  
    441. 

  441. 	loc += 4;
    442. 

  442. 	netgame->Security = INTEL_INT(netgame->Security);
    443. 

  443. 	memcpy(netgame->game_name, data + loc, NETGAME_NAME_LEN+1);   
    444. 

  444. 	loc += (NETGAME_NAME_LEN+1);
    445. 

  445. 	memcpy(netgame->mission_title, data + loc, MISSION_NAME_LEN+1); 
    446. 

  446. 	loc += (MISSION_NAME_LEN+1);
    447. 

  447. 	memcpy(netgame->mission_name, data + loc, 9);                 
    448. 

  448. 	loc += 9;
    449. 

  449. 	memcpy(&(netgame->levelnum), data + loc, 4);                  
    450. 

  450. 	loc += 4;
    451. 

  451. 	netgame->levelnum = INTEL_INT(netgame->levelnum);
    452. 

  452. 	memcpy(&(netgame->gamemode), data + loc, 1);                  
    453. 

  453. 	loc++;
    454. 

  454. 	memcpy(&(netgame->RefusePlayers), data + loc, 1);             
    455. 

  455. 	loc++;
    456. 

  456. 	memcpy(&(netgame->difficulty), data + loc, 1);                
    457. 

  457. 	loc++;
    458. 

  458. 	memcpy(&(netgame->game_status), data + loc, 1);               
    459. 

  459. 	loc++;
    460. 

  460. 	memcpy(&(netgame->numplayers), data + loc, 1);                
    461. 

  461. 	loc++;
    462. 

  462. 	memcpy(&(netgame->max_numplayers), data + loc, 1);            
    463. 

  463. 	loc++;
    464. 

  464. 	memcpy(&(netgame->numconnected), data + loc, 1);              
    465. 

  465. 	loc++;
    466. 

  466. 	memcpy(&(netgame->gameFlags), data + loc, 1);                
    467. 

  467. 	loc++;
    468. 

  468. 	memcpy(&(netgame->protocol_version), data + loc, 1);          
    469. 

  469. 	loc++;
    470. 

  470. 	memcpy(&(netgame->version_major), data + loc, 1);             
    471. 

  471. 	loc++;
    472. 

  472. 	memcpy(&(netgame->version_minor), data + loc, 1);             
    473. 

  473. 	loc++;
    474. 

  474. 	memcpy(&(netgame->team_vector), data + loc, 1);               
    475. 

  475. 	loc++;
    476. 

  476. 

  477. 	if (liteFlag)
    478. 

  478. 		return;
    479. 

  479. 

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

  481. 	loc += 2;
    482. 

  482. 	bitfield = INTEL_SHORT(bitfield);
    483. 

  483. 	memcpy(((ubyte *)(&netgame->team_vector) + 1), &bitfield, 2);
    484. 

  484. 

  485. 	memcpy(&bitfield, data + loc, 2);                             
    486. 

  486. 	loc += 2;
    487. 

  487. 	bitfield = INTEL_SHORT(bitfield);
    488. 

  488. 	memcpy(((ubyte *)(&netgame->team_vector) + 3), &bitfield, 2);
    489. 

  489. 

  490. #if 0       // not used since reordering mac bitfields
    491. 

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

  492. 	loc += 2;
    493. 

  493. 	new_field = 0;
    494. 

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

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

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

  497. 	}
    498. 

  498. 	new_field = INTEL_SHORT(new_field);
    499. 

  499. 	memcpy(((ubyte *)(&netgame->team_vector) + 1), &new_field, 2);
    500. 

  500. 

  501. 	memcpy(&bitfield, data + loc, 2);                             
    502. 

  502. 	loc += 2;
    503. 

  503. 	new_field = 0;
    504. 

  504. 	for (i = 15; i >= 0; i--) {
    505. 

  505. 		if (bitfield & (1 << i))
    506. 

  506. 			new_field |= (1 << (15 - i);
    507. 

  507. 	}
    508. 

  508. 	new_field = INTEL_SHORT(new_field);
    509. 

  509. 	memcpy(((ubyte *)(&netgame->team_vector) + 3), &new_field, 2);
    510. 

  510. #endif
    511. 

  511. 

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

  513. 	loc += 2*(CALLSIGN_LEN+1);
    514. 

  514. 	for (i = 0; i < MAX_PLAYERS; i++) {
    515. 

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

  516. 		loc += 4;
    517. 

  517. 		netgame->locations[i] = INTEL_INT(netgame->locations[i]);
    518. 

  518. 	}
    519. 

  519. 

  520. 	for (i = 0; i < MAX_PLAYERS; i++) {
    521. 

  521. 		for (j = 0; j < MAX_PLAYERS; j++) {
    522. 

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

  523. 			loc += 2;
    524. 

  524. 			netgame->kills[i][j] = INTEL_SHORT(netgame->kills[i][j]);
    525. 

  525. 		}
    526. 

  526. 	}
    527. 

  527. 

  528. 	memcpy(&(netgame->segments_checksum), data + loc, 2);         
    529. 

  529. 	loc += 2;
    530. 

  530. 	netgame->segments_checksum = INTEL_SHORT(netgame->segments_checksum);
    531. 

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

  532. 	loc += 2;
    533. 

  533. 	netgame->teamKills[0] = INTEL_SHORT(netgame->teamKills[0]);
    534. 

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

  535. 	loc += 2;
    536. 

  536. 	netgame->teamKills[1] = INTEL_SHORT(netgame->teamKills[1]);
    537. 

  537. 	for (i = 0; i < MAX_PLAYERS; i++) {
    538. 

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

  539. 		loc += 2;
    540. 

  540. 		netgame->killed[i] = INTEL_SHORT(netgame->killed[i]);
    541. 

  541. 	}
    542. 

  542. 	for (i = 0; i < MAX_PLAYERS; i++) {
    543. 

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

  544. 		loc += 2;
    545. 

  545. 		netgame->playerKills[i] = INTEL_SHORT(netgame->playerKills[i]);
    546. 

  546. 	}
    547. 

  547. 	memcpy(&(netgame->KillGoal), data + loc, 4);                  
    548. 

  548. 	loc += 4;
    549. 

  549. 	netgame->KillGoal = INTEL_INT(netgame->KillGoal);
    550. 

  550. 	memcpy(&(netgame->PlayTimeAllowed), data + loc, 4);           
    551. 

  551. 	loc += 4;
    552. 

  552. 	netgame->PlayTimeAllowed = INTEL_INT(netgame->PlayTimeAllowed);
    553. 

  553. 

  554. 	memcpy(&(netgame->levelTime), data + loc, 4);                
    555. 

  555. 	loc += 4;
    556. 

  556. 	netgame->levelTime = INTEL_INT(netgame->levelTime);
    557. 

  557. 	memcpy(&(netgame->control_invulTime), data + loc, 4);        
    558. 

  558. 	loc += 4;
    559. 

  559. 	netgame->control_invulTime = INTEL_INT(netgame->control_invulTime);
    560. 

  560. 	memcpy(&(netgame->monitor_vector), data + loc, 4);            
    561. 

  561. 	loc += 4;
    562. 

  562. 	netgame->monitor_vector = INTEL_INT(netgame->monitor_vector);
    563. 

  563. 	for (i = 0; i < MAX_PLAYERS; i++) {
    564. 

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

  565. 		loc += 4;
    566. 

  566. 		netgame->player_score[i] = INTEL_INT(netgame->player_score[i]);
    567. 

  567. 	}
    568. 

  568. 	for (i = 0; i < MAX_PLAYERS; i++) {
    569. 

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

  570. 		loc++;
    571. 

  571. 	}
    572. 

  572. 	memcpy(&(netgame->nPacketsPerSec), data + loc, 2);             
    573. 

  573. 	loc += 2;
    574. 

  574. 	netgame->nPacketsPerSec = INTEL_SHORT(netgame->nPacketsPerSec);
    575. 

  575. 	memcpy(&(netgame->bShortPackets), data + loc, 1);              
    576. 

  576. 	loc ++;
    577. 

  577. 

  578. }
    579. 

  579. 

  580. #define EGI_INTEL_SHORT_2BUF(_m) \
    581. 

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

  582. 

  583. #define EGI_INTEL_INT_2BUF(_m) \
    584. 

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

  585. 

  586. #define BUF2_EGI_INTEL_SHORT(_m) \
    587. 

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

  588. 

  589. #define BUF2_EGI_INTEL_INT(_m) \
    590. 

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

  591. 	
    592. 

  592. void BESendExtraGameInfo(ubyte *server, ubyte *node, ubyte *netAddress)
    593. 

  593. {
    594. 

  594. memcpy (out_buffer, &extraGameInfo [1], sizeof (extra_gameinfo));
    595. 

  595. EGI_INTEL_SHORT_2BUF (entropy.nMaxVirusCapacity);
    596. 

  596. EGI_INTEL_SHORT_2BUF (entropy.nEnergyFillRate);
    597. 

  597. EGI_INTEL_SHORT_2BUF (entropy.nShieldFillRate);
    598. 

  598. EGI_INTEL_SHORT_2BUF (entropy.nShieldDamageRate);
    599. 

  599. EGI_INTEL_INT_2BUF (nSpawnDelay);
    600. 

  600. if (netAddress != NULL)
    601. 

  601. 	IPXSendPacketData(out_buffer, sizeof (extra_gameinfo), server, node, netAddress);
    602. 

  602. else if ((server == NULL) && (node == NULL))
    603. 

  603. 	IPXSendBroadcastData(out_buffer, sizeof (extra_gameinfo));
    604. 

  604. else
    605. 

  605. 	IPXSendInternetPacketData(out_buffer, sizeof (extra_gameinfo), server, node);
    606. 

  606. }
    607. 

  607. 

  608. 

  609. void BEReceiveExtraGameInfo(ubyte *data, extra_gameinfo *extraGameInfo)
    610. 

  610. {
    611. 

  611. memcpy (&extraGameInfo [1], data, sizeof (extra_gameinfo));
    612. 

  612. BUF2_EGI_INTEL_SHORT (entropy.nMaxVirusCapacity);
    613. 

  613. BUF2_EGI_INTEL_SHORT (entropy.nEnergyFillRate);
    614. 

  614. BUF2_EGI_INTEL_SHORT (entropy.nShieldFillRate);
    615. 

  615. BUF2_EGI_INTEL_SHORT (entropy.nShieldDamageRate);
    616. 

  616. BUF2_EGI_INTEL_INT (nSpawnDelay);
    617. 

  617. }
    618. 

  618. 

  619. 

  620. void BESwapObject(tObject *objP)
    621. 

  621. {
    622. 

  622. 	// swap the short and int entries for this tObject
    623. 

  623. 	objP->nSignature     = INTEL_INT(objP->nSignature);
    624. 

  624. 	objP->next          = INTEL_SHORT(objP->next);
    625. 

  625. 	objP->prev          = INTEL_SHORT(objP->prev);
    626. 

  626. 	objP->nSegment        = INTEL_SHORT(objP->nSegment);
    627. 

  627. 	objP->pos.x         = INTEL_INT(objP->pos.x);
    628. 

  628. 	objP->pos.y         = INTEL_INT(objP->pos.y);
    629. 

  629. 	objP->pos.z         = INTEL_INT(objP->pos.z);
    630. 

  630. 

  631. 	objP->orient.rVec.x = INTEL_INT(objP->orient.rVec.x);
    632. 

  632. 	objP->orient.rVec.y = INTEL_INT(objP->orient.rVec.y);
    633. 

  633. 	objP->orient.rVec.z = INTEL_INT(objP->orient.rVec.z);
    634. 

  634. 	objP->orient.fVec.x = INTEL_INT(objP->orient.fVec.x);
    635. 

  635. 	objP->orient.fVec.y = INTEL_INT(objP->orient.fVec.y);
    636. 

  636. 	objP->orient.fVec.z = INTEL_INT(objP->orient.fVec.z);
    637. 

  637. 	objP->orient.uVec.x = INTEL_INT(objP->orient.uVec.x);
    638. 

  638. 	objP->orient.uVec.y = INTEL_INT(objP->orient.uVec.y);
    639. 

  639. 	objP->orient.uVec.z = INTEL_INT(objP->orient.uVec.z);
    640. 

  640. 

  641. 	objP->size          = INTEL_INT(objP->size);
    642. 

  642. 	objP->shields       = INTEL_INT(objP->shields);
    643. 

  643. 

  644. 	objP->last_pos.x    = INTEL_INT(objP->last_pos.x);
    645. 

  645. 	objP->last_pos.y    = INTEL_INT(objP->last_pos.y);
    646. 

  646. 	objP->last_pos.z    = INTEL_INT(objP->last_pos.z);
    647. 

  647. 

  648. 	objP->lifeleft      = INTEL_INT(objP->lifeleft);
    649. 

  649. 

  650. 	switch (objP->movementType) {
    651. 

  651. 

  652. 	case MT_PHYSICS:
    653. 

  653. 

  654. 		objP->mType.physInfo.velocity.x = INTEL_INT(objP->mType.physInfo.velocity.x);
    655. 

  655. 		objP->mType.physInfo.velocity.y = INTEL_INT(objP->mType.physInfo.velocity.y);
    656. 

  656. 		objP->mType.physInfo.velocity.z = INTEL_INT(objP->mType.physInfo.velocity.z);
    657. 

  657. 

  658. 		objP->mType.physInfo.thrust.x   = INTEL_INT(objP->mType.physInfo.thrust.x);
    659. 

  659. 		objP->mType.physInfo.thrust.y   = INTEL_INT(objP->mType.physInfo.thrust.y);
    660. 

  660. 		objP->mType.physInfo.thrust.z   = INTEL_INT(objP->mType.physInfo.thrust.z);
    661. 

  661. 

  662. 		objP->mType.physInfo.mass       = INTEL_INT(objP->mType.physInfo.mass);
    663. 

  663. 		objP->mType.physInfo.drag       = INTEL_INT(objP->mType.physInfo.drag);
    664. 

  664. 		objP->mType.physInfo.brakes     = INTEL_INT(objP->mType.physInfo.brakes);
    665. 

  665. 

  666. 		objP->mType.physInfo.rotVel.x   = INTEL_INT(objP->mType.physInfo.rotVel.x);
    667. 

  667. 		objP->mType.physInfo.rotVel.y   = INTEL_INT(objP->mType.physInfo.rotVel.y);
    668. 

  668. 		objP->mType.physInfo.rotVel.z   = INTEL_INT(objP->mType.physInfo.rotVel.z);
    669. 

  669. 

  670. 		objP->mType.physInfo.rotThrust.x = INTEL_INT(objP->mType.physInfo.rotThrust.x);
    671. 

  671. 		objP->mType.physInfo.rotThrust.y = INTEL_INT(objP->mType.physInfo.rotThrust.y);
    672. 

  672. 		objP->mType.physInfo.rotThrust.z = INTEL_INT(objP->mType.physInfo.rotThrust.z);
    673. 

  673. 

  674. 		objP->mType.physInfo.turnRoll   = INTEL_INT(objP->mType.physInfo.turnRoll);
    675. 

  675. 		objP->mType.physInfo.flags      = INTEL_SHORT(objP->mType.physInfo.flags);
    676. 

  676. 

  677. 		break;
    678. 

  678. 

  679. 	case MT_SPINNING:
    680. 

  680. 

  681. 		objP->mType.spinRate.x = INTEL_INT(objP->mType.spinRate.x);
    682. 

  682. 		objP->mType.spinRate.y = INTEL_INT(objP->mType.spinRate.y);
    683. 

  683. 		objP->mType.spinRate.z = INTEL_INT(objP->mType.spinRate.z);
    684. 

  684. 		break;
    685. 

  685. 	}
    686. 

  686. 

  687. 	switch (objP->controlType) {
    688. 

  688. 

  689. 	case CT_WEAPON:
    690. 

  690. 		objP->cType.laserInfo.parentType       = INTEL_SHORT(objP->cType.laserInfo.parentType);
    691. 

  691. 		objP->cType.laserInfo.nParentObj        = INTEL_SHORT(objP->cType.laserInfo.nParentObj);
    692. 

  692. 		objP->cType.laserInfo.nParentSig  = INTEL_INT(objP->cType.laserInfo.nParentSig);
    693. 

  693. 		objP->cType.laserInfo.creationTime     = INTEL_INT(objP->cType.laserInfo.creationTime);
    694. 

  694. 		objP->cType.laserInfo.nLastHitObj       = INTEL_SHORT(objP->cType.laserInfo.nLastHitObj);
    695. 

  695. 		objP->cType.laserInfo.nTrackGoal        = INTEL_SHORT(objP->cType.laserInfo.nTrackGoal);
    696. 

  696. 		objP->cType.laserInfo.multiplier        = INTEL_INT(objP->cType.laserInfo.multiplier);
    697. 

  697. 		break;
    698. 

  698. 

  699. 	case CT_EXPLOSION:
    700. 

  700. 		objP->cType.explInfo.nSpawnTime     = INTEL_INT(objP->cType.explInfo.nSpawnTime);
    701. 

  701. 		objP->cType.explInfo.nDeleteTime    = INTEL_INT(objP->cType.explInfo.nDeleteTime);
    702. 

  702. 		objP->cType.explInfo.nDeleteObj  = INTEL_SHORT(objP->cType.explInfo.nDeleteObj);
    703. 

  703. 		objP->cType.explInfo.nAttachParent  = INTEL_SHORT(objP->cType.explInfo.nAttachParent);
    704. 

  704. 		objP->cType.explInfo.nPrevAttach    = INTEL_SHORT(objP->cType.explInfo.nPrevAttach);
    705. 

  705. 		objP->cType.explInfo.nNextAttach    = INTEL_SHORT(objP->cType.explInfo.nNextAttach);
    706. 

  706. 		break;
    707. 

  707. 

  708. 	case CT_AI:
    709. 

  709. 		objP->cType.aiInfo.nHideSegment         = INTEL_SHORT(objP->cType.aiInfo.nHideSegment);
    710. 

  710. 		objP->cType.aiInfo.nHideIndex           = INTEL_SHORT(objP->cType.aiInfo.nHideIndex);
    711. 

  711. 		objP->cType.aiInfo.nPathLength          = INTEL_SHORT(objP->cType.aiInfo.nPathLength);
    712. 

  712. 		objP->cType.aiInfo.nDangerLaser     = INTEL_SHORT(objP->cType.aiInfo.nDangerLaser);
    713. 

  713. 		objP->cType.aiInfo.nDangerLaserSig = INTEL_INT(objP->cType.aiInfo.nDangerLaserSig);
    714. 

  714. 		objP->cType.aiInfo.xDyingStartTime     = INTEL_INT(objP->cType.aiInfo.xDyingStartTime);
    715. 

  715. 		break;
    716. 

  716. 

  717. 	case CT_LIGHT:
    718. 

  718. 		objP->cType.lightInfo.intensity = INTEL_INT(objP->cType.lightInfo.intensity);
    719. 

  719. 		break;
    720. 

  720. 

  721. 	case CT_POWERUP:
    722. 

  722. 		objP->cType.powerupInfo.count = INTEL_INT(objP->cType.powerupInfo.count);
    723. 

  723. 		objP->cType.powerupInfo.creationTime = INTEL_INT(objP->cType.powerupInfo.creationTime);
    724. 

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

  725. 		// here, and he didn't know, and it looks like it doesn't belong.
    726. 

  726. 		// if (objP->id == POW_VULCAN_WEAPON)
    727. 

  727. 		// objP->cType.powerupInfo.count = VULCAN_WEAPON_AMMO_AMOUNT;
    728. 

  728. 		break;
    729. 

  729. 

  730. 	}
    731. 

  731. 

  732. 	switch (objP->renderType) {
    733. 

  733. 

  734. 	case RT_MORPH:
    735. 

  735. 	case RT_POLYOBJ: {
    736. 

  736. 		int i;
    737. 

  737. 

  738. 		objP->rType.polyObjInfo.nModel      = INTEL_INT(objP->rType.polyObjInfo.nModel);
    739. 

  739. 

  740. 		for (i=0;i<MAX_SUBMODELS;i++) {
    741. 

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

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

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

  744. 		}
    745. 

  745. 

  746. 		objP->rType.polyObjInfo.nSubObjFlags   = INTEL_INT(objP->rType.polyObjInfo.nSubObjFlags);
    747. 

  747. 		objP->rType.polyObjInfo.nTexOverride  = INTEL_INT(objP->rType.polyObjInfo.nTexOverride);
    748. 

  748. 		objP->rType.polyObjInfo.nAltTextures   = INTEL_INT(objP->rType.polyObjInfo.nAltTextures);
    749. 

  749. 		break;
    750. 

  750. 	}
    751. 

  751. 

  752. 	case RT_WEAPON_VCLIP:
    753. 

  753. 	case RT_HOSTAGE:
    754. 

  754. 	case RT_POWERUP:
    755. 

  755. 	case RT_FIREBALL:
    756. 

  756. 	case RT_THRUSTER:
    757. 

  757. 		objP->rType.vClipInfo.nClipIndex = INTEL_INT(objP->rType.vClipInfo.nClipIndex);
    758. 

  758. 		objP->rType.vClipInfo.xFrameTime = INTEL_INT(objP->rType.vClipInfo.xFrameTime);
    759. 

  759. 		break;
    760. 

  760. 

  761. 	case RT_LASER:
    762. 

  762. 		break;
    763. 

  763. 

  764. 	}
    765. 

  765. //  END OF SWAPPING OBJECT STRUCTURE
    766. 

  766. 

  767. }
    768. 

  768. 

  769. #else /* !WORDS_BIGENDIAN */
    770. 

  770. 

  771. 

  772. // Calculates the checksum of a block of memory.
    773. 

  773. ushort NetMiscCalcCheckSum(void * vptr, int len)
    774. 

  774. {
    775. 

  775. 	ubyte *ptr = (ubyte *)vptr;
    776. 

  776. 	unsigned int sum1,sum2;
    777. 

  777. 

  778. 	sum1 = sum2 = 0;
    779. 

  779. 

  780. 	for (; len; len--) {
    781. 

  781. 		sum1 += *ptr++;
    782. 

  782. 		if (sum1 >= 255)
    783. 

  783. 			sum1 -= 255;
    784. 

  784. 		sum2 += sum1;
    785. 

  785. 	}
    786. 

  786. return (sum1 * 256 + sum2 % 255);
    787. 

  787. }
    788. 

  788. 

  789. #endif /* WORDS_BIGENDIAN */
    790. 

  790. 

  791. // needs to be recoded to actually work with big endian!
    792. 

  792. //--unused-- //Finds the difference between block1 and block2.  Fills in diff_buffer and
    793. 

  793. //--unused-- //returns the size of diff_buffer.
    794. 

  794. //--unused-- int netmisc_find_diff(void *block1, void *block2, int block_size, void *diff_buffer)
    795. 

  795. //--unused-- {
    796. 

  796. //--unused-- 	int mode;
    797. 

  797. //--unused-- 	ushort *c1, *c2, *diff_start, *c3;
    798. 

  798. //--unused-- 	int i, j, size, diff, n , same;
    799. 

  799. //--unused--
    800. 

  800. //--unused-- 	size=(block_size+1)/sizeof(ushort);
    801. 

  801. //--unused-- 	c1 = (ushort *)block1;
    802. 

  802. //--unused-- 	c2 = (ushort *)block2;
    803. 

  803. //--unused-- 	c3 = (ushort *)diff_buffer;
    804. 

  804. //--unused--
    805. 

  805. //--unused-- 	mode = same = diff = n = 0;
    806. 

  806. //--unused--
    807. 

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

  808. //--unused-- 		if (*c1 != *c2) {
    809. 

  809. //--unused-- 			if (mode==0) {
    810. 

  810. //--unused-- 				mode = 1;
    811. 

  811. //--unused-- 				c3[n++] = same;
    812. 

  812. //--unused-- 				same=0; diff=0;
    813. 

  813. //--unused-- 				diff_start = c2;
    814. 

  814. //--unused-- 			}
    815. 

  815. //--unused-- 			*c1 = *c2;
    816. 

  816. //--unused-- 			diff++;
    817. 

  817. //--unused-- 			if (diff==65535) {
    818. 

  818. //--unused-- 				mode = 0;
    819. 

  819. //--unused-- 				// send how many diff ones.
    820. 

  820. //--unused-- 				c3[n++]=diff;
    821. 

  821. //--unused-- 				// send all the diff ones.
    822. 

  822. //--unused-- 				for (j=0; j<diff; j++)
    823. 

  823. //--unused-- 					c3[n++] = diff_start[j];
    824. 

  824. //--unused-- 				same=0; diff=0;
    825. 

  825. //--unused-- 				diff_start = c2;
    826. 

  826. //--unused-- 			}
    827. 

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

  828. //--unused-- 			if (mode==1) {
    829. 

  829. //--unused-- 				mode=0;
    830. 

  830. //--unused-- 				// send how many diff ones.
    831. 

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

  832. //--unused-- 				// send all the diff ones.
    833. 

  833. //--unused-- 				for (j=0; j<diff; j++)
    834. 

  834. //--unused-- 					c3[n++] = diff_start[j];
    835. 

  835. //--unused-- 				same=0; diff=0;
    836. 

  836. //--unused-- 				diff_start = c2;
    837. 

  837. //--unused-- 			}
    838. 

  838. //--unused-- 			same++;
    839. 

  839. //--unused-- 			if (same==65535) {
    840. 

  840. //--unused-- 				mode=1;
    841. 

  841. //--unused-- 				// send how many the same
    842. 

  842. //--unused-- 				c3[n++] = same;
    843. 

  843. //--unused-- 				same=0; diff=0;
    844. 

  844. //--unused-- 				diff_start = c2;
    845. 

  845. //--unused-- 			}
    846. 

  846. //--unused-- 		}
    847. 

  847. //--unused--
    848. 

  848. //--unused-- 	}
    849. 

  849. //--unused-- 	if (mode==0) {
    850. 

  850. //--unused-- 		// send how many the same
    851. 

  851. //--unused-- 		c3[n++] = same;
    852. 

  852. //--unused-- 	} else {
    853. 

  853. //--unused-- 		// send how many diff ones.
    854. 

  854. //--unused-- 		c3[n++]=diff;
    855. 

  855. //--unused-- 		// send all the diff ones.
    856. 

  856. //--unused-- 		for (j=0; j<diff; j++)
    857. 

  857. //--unused-- 			c3[n++] = diff_start[j];
    858. 

  858. //--unused-- 	}
    859. 

  859. //--unused--
    860. 

  860. //--unused-- 	return n*2;
    861. 

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

  862. 

  863. //--unused-- //Applies diff_buffer to block1 to create a new block1.  Returns the final
    864. 

  864. //--unused-- //size of block1.
    865. 

  865. //--unused-- int netmisc_apply_diff(void *block1, void *diff_buffer, int diff_size)
    866. 

  866. //--unused-- {
    867. 

  867. //--unused-- 	unsigned int i, j, n, size;
    868. 

  868. //--unused-- 	ushort *c1, *c2;
    869. 

  869. //--unused--
    870. 

  870. //--unused-- 	c1 = (ushort *)diff_buffer;
    871. 

  871. //--unused-- 	c2 = (ushort *)block1;
    872. 

  872. //--unused--
    873. 

  873. //--unused-- 	size = diff_size/2;
    874. 

  874. //--unused--
    875. 

  875. //--unused-- 	i=j=0;
    876. 

  876. //--unused-- 	while (1) {
    877. 

  877. //--unused-- 		j += c1[i];         // Same
    878. 

  878. //--unused-- 		i++;
    879. 

  879. //--unused-- 		if (i>=size) break;
    880. 

  880. //--unused-- 		n = c1[i];          // ndiff
    881. 

  881. //--unused-- 		i++;
    882. 

  882. //--unused-- 		if (n>0) {
    883. 

  883. //--unused-- 			//Assert(n* < 256);
    884. 

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

  885. //--unused-- 			i += n;
    886. 

  886. //--unused-- 			j += n;
    887. 

  887. //--unused-- 		}
    888. 

  888. //--unused-- 		if (i>=size) break;
    889. 

  889. //--unused-- 	}
    890. 

  890. //--unused-- 	return j*2;
    891. 

  891. //--unused-- }
    892. 

  892.