/
d_netsv.c
1628 lines (1365 loc) · 43.5 KB
/
d_netsv.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/** @file d_netsv.c Common code related to net games (server-side).
*
* @authors Copyright © 2003-2013 Jaakko Keränen <jaakko.keranen@iki.fi>
* @authors Copyright © 2005-2013 Daniel Swanson <danij@dengine.net>
* @authors Copyright © 2007 Jamie Jones <jamie_jones_au@yahoo.com.au>
*
* @par License
* GPL: http://www.gnu.org/licenses/gpl.html
*
* <small>This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2 of the License, or (at your
* option) any later version. This program is distributed in the hope that it
* will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty
* of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
* Public License for more details. You should have received a copy of the GNU
* General Public License along with this program; if not, write to the Free
* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
* 02110-1301 USA</small>
*/
#include <ctype.h>
#include <stdio.h>
#include <string.h>
#include <assert.h>
#include <de/mathutil.h>
#include "common.h"
#include "d_net.h"
#include "player.h"
#include "p_user.h"
#include "p_map.h"
#include "mobj.h"
#include "p_actor.h"
#include "g_common.h"
#include "p_tick.h"
#include "p_start.h"
#include "p_inventory.h"
#ifdef __JHEXEN__
# include "s_sequence.h"
#endif
#if __JHEXEN__ || __JSTRIFE__
# define SOUND_COUNTDOWN SFX_PICKUP_KEY
#elif __JDOOM__ || __JDOOM64__
# define SOUND_COUNTDOWN SFX_GETPOW
#elif __JHERETIC__
# define SOUND_COUNTDOWN SFX_KEYUP
#endif
#define SOUND_VICTORY SOUND_COUNTDOWN
typedef struct maprule_s {
dd_bool usetime, usefrags;
int time; // Minutes.
int frags; // Maximum frags for one player.
} maprule_t;
typedef enum cyclemode_s {
CYCLE_IDLE,
CYCLE_COUNTDOWN
} cyclemode_t;
void R_SetAllDoomsdayFlags();
void P_FireWeapon(player_t *player);
int NetSv_GetFrags(int pl);
void NetSv_MapCycleTicker(void);
void NetSv_SendPlayerClass(int pnum, char cls);
char cyclingMaps = false;
char *mapCycle = "";
char mapCycleNoExit = true;
int netSvAllowSendMsg = true;
int netSvAllowCheats = false;
// This is returned in *_Get(DD_GAME_CONFIG). It contains a combination
// of space-separated keywords.
char gameConfigString[128];
static int cycleIndex;
static int cycleCounter = -1, cycleMode = CYCLE_IDLE;
static int cycleRulesCounter[MAXPLAYERS];
#if __JHERETIC__ || __JHEXEN__ || __JSTRIFE__
static int oldClasses[MAXPLAYERS];
#endif
/**
* Update the game config string with keywords that describe the game.
* The string is sent out in netgames (also to the master).
* Keywords: dm, coop, jump, nomonst, respawn, skillN
*/
void NetSv_UpdateGameConfigDescription(void)
{
if(IS_CLIENT)
return;
memset(gameConfigString, 0, sizeof(gameConfigString));
sprintf(gameConfigString, "skill%i", gameRules.skill + 1);
if(gameRules.deathmatch > 1)
sprintf(gameConfigString, " dm%i", gameRules.deathmatch);
else if(gameRules.deathmatch)
strcat(gameConfigString, " dm");
else
strcat(gameConfigString, " coop");
if(gameRules.noMonsters)
strcat(gameConfigString, " nomonst");
#if !__JHEXEN__
if(gameRules.respawnMonsters)
strcat(gameConfigString, " respawn");
#endif
if(cfg.jumpEnabled)
strcat(gameConfigString, " jump");
}
/**
* Sharp ticker, i.e., called at 35 Hz.
*/
void NetSv_Ticker(void)
{
float power;
int i;
// Map rotation checker.
NetSv_MapCycleTicker();
// This is done here for servers.
R_SetAllDoomsdayFlags();
// Set the camera filters for players.
for(i = 0; i < MAXPLAYERS; ++i)
{
R_UpdateViewFilter(i);
}
#ifdef __JHEXEN__
SN_UpdateActiveSequences();
#endif
// Inform clients about jumping?
power = (cfg.jumpEnabled ? cfg.jumpPower : 0);
if(power != netJumpPower)
{
netJumpPower = power;
for(i = 0; i < MAXPLAYERS; ++i)
{
if(players[i].plr->inGame)
NetSv_SendJumpPower(i, power);
}
}
// Send the player state updates.
for(i = 0; i < MAXPLAYERS; ++i)
{
player_t* plr = &players[i];
if(!plr->plr->inGame)
continue;
if(plr->update)
{
// Owned weapons and player state will be sent in the v2 packet.
if(plr->update & (PSF_OWNED_WEAPONS | PSF_STATE))
{
int flags =
(plr->update & PSF_OWNED_WEAPONS ? PSF2_OWNED_WEAPONS : 0) |
(plr->update & PSF_STATE ? PSF2_STATE : 0);
NetSv_SendPlayerState2(i, i, flags, true);
plr->update &= ~(PSF_OWNED_WEAPONS | PSF_STATE);
// That was all?
if(!plr->update)
continue;
}
NetSv_SendPlayerState(i, i, plr->update, true);
plr->update = 0;
}
#if __JHERETIC__ || __JHEXEN__ || __JSTRIFE__
// Keep track of player class changes (fighter, cleric, mage, pig).
// Notify clients accordingly. This is mostly just FYI (it'll update
// pl->class_ on the clientside).
if(oldClasses[i] != plr->class_)
{
oldClasses[i] = plr->class_;
NetSv_SendPlayerClass(i, plr->class_);
}
#endif
}
}
void NetSv_CycleToMapNum(uint map)
{
char tmp[3], cmd[80];
int i;
sprintf(tmp, "%02u", map);
#if __JDOOM64__
sprintf(cmd, "warp %u", map);
#elif __JDOOM__
if(gameModeBits & GM_ANY_DOOM2)
sprintf(cmd, "warp %u", map);
else
sprintf(cmd, "warp %c %c", tmp[0], tmp[1]);
#elif __JHERETIC__
sprintf(cmd, "warp %c %c", tmp[0], tmp[1]);
#elif __JHEXEN__
sprintf(cmd, "warp %u", map);
#endif
DD_Execute(false, cmd);
// In a couple of seconds, send everyone the rules of this map.
for(i = 0; i < MAXPLAYERS; ++i)
{
cycleRulesCounter[i] = 3 * TICSPERSEC;
}
cycleMode = CYCLE_IDLE;
cycleCounter = 0;
}
/**
* Reads through the MapCycle cvar and finds the map with the given index.
* Rules that apply to the map are returned in 'rules'.
*/
int NetSv_ScanCycle(int index, maprule_t* rules)
{
char *ptr = mapCycle, *end;
int i, pos = -1;
uint episode, map;
#if __JHEXEN__ || __JSTRIFE__
int m;
#endif
char tmp[3], lump[10];
dd_bool clear = false, has_random = false;
maprule_t dummy;
if(!rules)
rules = &dummy;
// By default no rules apply.
rules->usetime = rules->usefrags = false;
for(; *ptr; ptr++)
{
if(isspace(*ptr))
continue;
if(*ptr == ',' || *ptr == '+' || *ptr == ';' || *ptr == '/' ||
*ptr == '\\')
{
// These symbols are allowed to combine "time" and "frags".
// E.g. "Time:10/Frags:5" or "t:30, f:10"
clear = false;
}
else if(!strnicmp("time", ptr, 1))
{
// Find the colon.
while(*ptr && *ptr != ':')
ptr++;
if(!*ptr)
return -1;
if(clear)
rules->usefrags = false;
clear = true;
rules->usetime = true;
rules->time = strtol(ptr + 1, &end, 0);
ptr = end - 1;
}
else if(!strnicmp("frags", ptr, 1))
{
// Find the colon.
while(*ptr && *ptr != ':')
ptr++;
if(!*ptr)
return -1;
if(clear)
rules->usetime = false;
clear = true;
rules->usefrags = true;
rules->frags = strtol(ptr + 1, &end, 0);
ptr = end - 1;
}
else if(*ptr == '*' || (*ptr >= '0' && *ptr <= '9'))
{
// A map identifier is here.
pos++;
// Read it.
tmp[0] = *ptr++;
tmp[1] = *ptr;
tmp[2] = 0;
if(strlen(tmp) < 2)
{
// Assume a zero is missing.
tmp[1] = tmp[0];
tmp[0] = '0';
}
if(index == pos)
{
if(tmp[0] == '*' || tmp[1] == '*')
has_random = true;
// This is the map we're looking for. Return it.
// But first randomize the asterisks.
for(i = 0; i < 100; i++) // Try many times to find a good map.
{
// The differences in map numbering make this harder
// than it should be.
#if __JDOOM64__
sprintf(lump, "MAP%u%u", episode =
tmp[0] == '*' ? RNG_RandByte() % 4 : tmp[0] - '0',
map = tmp[1] == '*' ? RNG_RandByte() % 10 : tmp[1] - '0');
#elif __JDOOM__
if(gameModeBits & GM_ANY_DOOM2)
{
sprintf(lump, "MAP%u%u", episode =
tmp[0] == '*' ? RNG_RandByte() % 4 : tmp[0] - '0',
map = tmp[1] == '*' ? RNG_RandByte() % 10 : tmp[1] - '0');
}
else
{
sprintf(lump, "E%uM%u", episode =
tmp[0] == '*' ? 1 + RNG_RandByte() % 4 : tmp[0] - '0',
map = tmp[1] == '*' ? 1 + RNG_RandByte() % 9 : tmp[1] - '0');
}
#elif __JSTRIFE__
sprintf(lump, "MAP%u%u", episode =
tmp[0] == '*' ? RNG_RandByte() % 4 : tmp[0] - '0',
map =
tmp[1] ==
'*' ? RNG_RandByte() % 10 : tmp[1] - '0');
#elif __JHERETIC__
sprintf(lump, "E%uM%u", episode =
tmp[0] == '*' ? 1 + RNG_RandByte() % 6 : tmp[0] - '0',
map =
tmp[1] == '*' ? 1 + RNG_RandByte() % 9 : tmp[1] - '0');
#elif __JHEXEN__
sprintf(lump, "%u%u", episode =
tmp[0] == '*' ? RNG_RandByte() % 4 : tmp[0] - '0',
map =
tmp[1] == '*' ? RNG_RandByte() % 10 : tmp[1] - '0');
m = P_TranslateMap(atoi(lump));
if(m < 0)
continue;
sprintf(lump, "MAP%02u", m);
#endif
if(W_CheckLumpNumForName(lump) >= 0)
{
tmp[0] = episode + '0';
tmp[1] = map + '0';
break;
}
else if(!has_random)
{
return -1;
}
}
// Convert to a number.
return atoi(tmp);
}
}
}
// Didn't find it.
return -1;
}
void NetSv_TellCycleRulesToPlayerAfterTics(int destPlr, int tics)
{
if(destPlr >= 0 && destPlr < MAXPLAYERS)
{
cycleRulesCounter[destPlr] = tics;
}
else if(destPlr == DDSP_ALL_PLAYERS)
{
int i;
for(i = 0; i < MAXPLAYERS; ++i)
cycleRulesCounter[i] = tics;
}
}
/**
* Sends a message about the map cycle rules to a specific player.
*/
void NetSv_TellCycleRulesToPlayer(int destPlr)
{
maprule_t rules;
char msg[100];
char tmp[100];
if(!cyclingMaps) return;
App_Log(DE2_DEV_NET_VERBOSE, "NetSv_TellCycleRulesToPlayer: %i", destPlr);
// Get the rules of the current map.
NetSv_ScanCycle(cycleIndex, &rules);
strcpy(msg, "MAP RULES: ");
if(!rules.usetime && !rules.usefrags)
{
strcat(msg, "NONE");
}
else
{
if(rules.usetime)
{
sprintf(tmp, "%i MINUTES", rules.time);
strcat(msg, tmp);
}
if(rules.usefrags)
{
sprintf(tmp, "%s%i FRAGS", rules.usetime ? " OR " : "", rules.frags);
strcat(msg, tmp);
}
}
NetSv_SendMessage(destPlr, msg);
}
void NetSv_MapCycleTicker(void)
{
if(!cyclingMaps) return;
// Check rules broadcasting.
{ int i;
for(i = 0; i < MAXPLAYERS; ++i)
{
if(!cycleRulesCounter[i] || !players[i].plr->inGame)
continue;
if(--cycleRulesCounter[i] == 0)
{
NetSv_TellCycleRulesToPlayer(i);
}
}}
cycleCounter--;
switch(cycleMode)
{
case CYCLE_IDLE:
// Check if the current map should end.
if(cycleCounter <= 0)
{
maprule_t rules;
// Test again in ten seconds time.
cycleCounter = 10 * TICSPERSEC;
if(NetSv_ScanCycle(cycleIndex, &rules) < 0)
{
if(NetSv_ScanCycle(cycleIndex = 0, &rules) < 0)
{
// Hmm?! Abort cycling.
App_Log(DE2_MAP_WARNING, "All of a sudden MapCycle is invalid; stopping cycle");
DD_Execute(false, "endcycle");
return;
}
}
if(rules.usetime &&
mapTime > (rules.time * 60 - 29) * TICSPERSEC)
{
// Time runs out!
cycleMode = CYCLE_COUNTDOWN;
cycleCounter = 31 * TICSPERSEC;
}
if(rules.usefrags)
{
int i, frags;
for(i = 0; i < MAXPLAYERS; i++)
{
if(!players[i].plr->inGame)
continue;
frags = NetSv_GetFrags(i);
if(frags >= rules.frags)
{
char msg[100]; sprintf(msg, "--- %s REACHES %i FRAGS ---", Net_GetPlayerName(i), frags);
NetSv_SendMessage(DDSP_ALL_PLAYERS, msg);
S_StartSound(SOUND_VICTORY, NULL);
cycleMode = CYCLE_COUNTDOWN;
cycleCounter = 15 * TICSPERSEC; // No msg for 15 secs.
break;
}
}
}
}
break;
case CYCLE_COUNTDOWN:
if(cycleCounter == 30 * TICSPERSEC ||
cycleCounter == 15 * TICSPERSEC ||
cycleCounter == 10 * TICSPERSEC ||
cycleCounter == 5 * TICSPERSEC)
{
char msg[100]; sprintf(msg, "--- WARPING IN %i SECONDS ---", cycleCounter / TICSPERSEC);
NetSv_SendMessage(DDSP_ALL_PLAYERS, msg);
// Also, a warning sound.
S_StartSound(SOUND_COUNTDOWN, NULL);
}
else if(cycleCounter <= 0)
{
// Next map, please!
int map = NetSv_ScanCycle(++cycleIndex, NULL);
if(map < 0)
{
// Must be past the end?
map = NetSv_ScanCycle(cycleIndex = 0, NULL);
if(map < 0)
{
// Hmm?! Abort cycling.
App_Log(DE2_MAP_WARNING, "All of a sudden MapCycle is invalid; stopping cycle");
DD_Execute(false, "endcycle");
return;
}
}
// Warp to the next map. Don't bother with the intermission.
NetSv_CycleToMapNum(map);
}
break;
}
}
/**
* Resets a player's frag count and other players' frag counts toward the player.
*
* @param plrNum Player to reset.
*/
void NetSv_ResetPlayerFrags(int plrNum)
{
int i;
player_t* plr = &players[plrNum];
App_Log(DE2_DEV_NET_VERBOSE, "NetSv_ResetPlayerFrags: Player %i", plrNum);
memset(plr->frags, 0, sizeof(plr->frags));
// The frag count is dependent on the others' frags.
for(i = 0; i < MAXPLAYERS; ++i)
{
players[i].frags[plrNum] = 0;
// Everybody will get their frags updated.
players[i].update |= PSF_FRAGS;
}
}
/**
* Server calls this when new players enter the game.
*/
void NetSv_NewPlayerEnters(int plrNum)
{
player_t* plr = &players[plrNum];
App_Log(DE2_DEV_MSG, "NetSv_NewPlayerEnters: player %i", plrNum);
plr->playerState = PST_REBORN; // Force an init.
// Re-deal player starts.
P_DealPlayerStarts(0);
// Reset the player's frags.
NetSv_ResetPlayerFrags(plrNum);
// Spawn the player into the world.
if(gameRules.deathmatch)
{
G_DeathMatchSpawnPlayer(plrNum);
}
else
{
playerclass_t pClass = P_ClassForPlayerWhenRespawning(plrNum, false);
playerstart_t const *start;
if((start = P_GetPlayerStart(gameMapEntrance, plrNum, false)))
{
mapspot_t const *spot = &mapSpots[start->spot];
App_Log(DE2_DEV_MAP_MSG, "NetSv_NewPlayerEnters: Spawning player with angle:%x", spot->angle);
P_SpawnPlayer(plrNum, pClass, spot->origin[VX], spot->origin[VY],
spot->origin[VZ], spot->angle, spot->flags,
false, true);
}
else
{
P_SpawnPlayer(plrNum, pClass, 0, 0, 0, 0, MSF_Z_FLOOR, true, true);
}
/// @todo Spawn a telefog in front of the player.
}
// Get rid of anybody at the starting spot.
P_Telefrag(plr->plr->mo);
NetSv_TellCycleRulesToPlayerAfterTics(plrNum, 5 * TICSPERSEC);
NetSv_SendTotalCounts(plrNum);
}
void NetSv_Intermission(int flags, int state, int time)
{
Writer* msg;
if(IS_CLIENT) return;
msg = D_NetWrite();
Writer_WriteByte(msg, flags);
#if __JDOOM__ || __JDOOM64__
if(flags & IMF_BEGIN)
{
// Only include the necessary information.
Writer_WriteUInt16(msg, wmInfo.maxKills);
Writer_WriteUInt16(msg, wmInfo.maxItems);
Writer_WriteUInt16(msg, wmInfo.maxSecret);
Writer_WriteByte(msg, wmInfo.nextMap);
Writer_WriteByte(msg, wmInfo.currentMap);
Writer_WriteByte(msg, wmInfo.didSecret);
}
#endif
#if __JHEXEN__ || __JSTRIFE__
if(flags & IMF_BEGIN)
{
Writer_WriteByte(msg, state); // LeaveMap
Writer_WriteByte(msg, time); // LeavePosition
}
#endif
if(flags & IMF_STATE)
Writer_WriteInt16(msg, state);
if(flags & IMF_TIME)
Writer_WriteInt16(msg, time);
Net_SendPacket(DDSP_ALL_PLAYERS, GPT_INTERMISSION, Writer_Data(msg), Writer_Size(msg));
}
#if 0
/**
* The actual script is sent to the clients. 'script' can be NULL.
*/
void NetSv_Finale(int flags, const char* script, const dd_bool* conds, byte numConds)
{
size_t scriptLen = 0;
Writer* writer;
if(IS_CLIENT)
return;
writer = D_NetWrite();
// How much memory do we need?
if(script)
{
flags |= FINF_SCRIPT;
scriptLen = strlen(script);
}
// First the flags.
Writer_WriteByte(writer, flags);
if(script)
{
int i;
// The conditions.
Writer_WriteByte(writer, numConds);
for(i = 0; i < numConds; ++i)
{
Writer_WriteByte(writer, conds[i]);
}
// Then the script itself.
Writer_WriteUInt32(writer, scriptLen);
Writer_Write(writer, script, scriptLen);
}
Net_SendPacket(DDSP_ALL_PLAYERS | DDSP_ORDERED, GPT_FINALE2, Writer_Data(writer), Writer_Size(writer));
}
#endif
void NetSv_SendTotalCounts(int to)
{
// Hexen does not have total counts.
#ifndef __JHEXEN__
Writer *writer = 0;
if(IS_CLIENT)
return;
writer = D_NetWrite();
Writer_WriteInt32(writer, totalKills);
Writer_WriteInt32(writer, totalItems);
Writer_WriteInt32(writer, totalSecret);
// Send the packet.
Net_SendPacket(to, GPT_TOTAL_COUNTS, Writer_Data(writer), Writer_Size(writer));
#else
DENG_UNUSED(to);
#endif
}
void NetSv_SendGameState(int flags, int to)
{
int i;
Writer *writer;
GameInfo gameInfo;
AutoStr *str;
if(!IS_NETWORK_SERVER)
return;
DD_GameInfo(&gameInfo);
// Print a short message that describes the game state.
str = Uri_Resolved(gameMapUri);
App_Log(DE2_NET_NOTE, "Sending game setup: %s %s %s",
Str_Text(gameInfo.identityKey), Str_Text(str), gameConfigString);
// Send an update to all the players in the game.
for(i = 0; i < MAXPLAYERS; ++i)
{
if(!players[i].plr->inGame || (to != DDSP_ALL_PLAYERS && to != i))
continue;
writer = D_NetWrite();
Writer_WriteByte(writer, flags);
// Game identity key.
Writer_WriteByte(writer, Str_Length(gameInfo.identityKey));
Writer_Write(writer, Str_Text(gameInfo.identityKey), Str_Length(gameInfo.identityKey));
// The current map.
Uri_Write(gameMapUri, writer);
// Also include the episode and map numbers.
Writer_WriteByte(writer, gameEpisode);
Writer_WriteByte(writer, gameMap);
Writer_WriteByte(writer, (gameRules.deathmatch & 0x3)
| (!gameRules.noMonsters? 0x4 : 0)
#if !__JHEXEN__
| (gameRules.respawnMonsters? 0x8 : 0)
#else
| 0
#endif
| (cfg.jumpEnabled? 0x10 : 0));
// Note that SM_NOTHINGS will result in a value of '7'.
Writer_WriteByte(writer, gameRules.skill & 0x7);
Writer_WriteFloat(writer, (float)P_GetGravity());
if(flags & GSF_CAMERA_INIT)
{
mobj_t *mo = players[i].plr->mo;
Writer_WriteFloat(writer, mo->origin[VX]);
Writer_WriteFloat(writer, mo->origin[VY]);
Writer_WriteFloat(writer, mo->origin[VZ]);
Writer_WriteUInt32(writer, mo->angle);
}
// Send the packet.
Net_SendPacket(i, GPT_GAME_STATE, Writer_Data(writer), Writer_Size(writer));
}
}
/**
* Informs a player of an impulse momentum that needs to be applied to the player's mobj.
*/
void NetSv_PlayerMobjImpulse(mobj_t* mobj, float mx, float my, float mz)
{
int plrNum = 0;
Writer* writer;
if(!IS_SERVER || !mobj || !mobj->player) return;
// Which player?
plrNum = mobj->player - players;
writer = D_NetWrite();
Writer_WriteUInt16(writer, mobj->thinker.id);
Writer_WriteFloat(writer, mx);
Writer_WriteFloat(writer, my);
Writer_WriteFloat(writer, mz);
Net_SendPacket(plrNum, GPT_MOBJ_IMPULSE, Writer_Data(writer), Writer_Size(writer));
}
/**
* Sends the initial player position to a client. This is the position defined
* by the map's start spots. It is sent immediately after the server determines
* where a player is to spawn.
*/
void NetSv_SendPlayerSpawnPosition(int plrNum, float x, float y, float z, int angle)
{
Writer* writer;
if(!IS_SERVER) return;
App_Log(DE2_DEV_NET_MSG,
"NetSv_SendPlayerSpawnPosition: Player #%i pos:[%g, %g, %g] angle:%x",
plrNum, x, y, z, angle);
writer = D_NetWrite();
Writer_WriteFloat(writer, x);
Writer_WriteFloat(writer, y);
Writer_WriteFloat(writer, z);
Writer_WriteUInt32(writer, angle);
Net_SendPacket(plrNum, GPT_PLAYER_SPAWN_POSITION,
Writer_Data(writer), Writer_Size(writer));
}
/**
* More player state information. Had to be separate because of backwards
* compatibility.
*/
void NetSv_SendPlayerState2(int srcPlrNum, int destPlrNum, int flags, dd_bool reliable)
{
int pType = (srcPlrNum == destPlrNum ? GPT_CONSOLEPLAYER_STATE2 : GPT_PLAYER_STATE2);
player_t *pl = &players[srcPlrNum];
int i, fl;
Writer* writer;
// Check that this is a valid call.
if(IS_CLIENT || !pl->plr->inGame ||
(destPlrNum >= 0 && destPlrNum < MAXPLAYERS &&
!players[destPlrNum].plr->inGame))
return;
writer = D_NetWrite();
// Include the player number if necessary.
if(pType == GPT_PLAYER_STATE2)
{
Writer_WriteByte(writer, srcPlrNum);
}
Writer_WriteUInt32(writer, flags);
if(flags & PSF2_OWNED_WEAPONS)
{
// This supports up to 16 weapons.
for(fl = 0, i = 0; i < NUM_WEAPON_TYPES; ++i)
if(pl->weapons[i].owned)
fl |= 1 << i;
Writer_WriteUInt16(writer, fl);
}
if(flags & PSF2_STATE)
{
Writer_WriteByte(writer, pl->playerState |
#if __JDOOM__ || __JHERETIC__ || __JDOOM64__ // Hexen doesn't have armortype.
(pl->armorType << 4));
#else
0);
#endif
Writer_WriteByte(writer, pl->cheats);
}
// Finally, send the packet.
Net_SendPacket(destPlrNum, pType,
Writer_Data(writer), Writer_Size(writer));
}
void NetSv_SendPlayerState(int srcPlrNum, int destPlrNum, int flags, dd_bool reliable)
{
int pType = (srcPlrNum == destPlrNum ? GPT_CONSOLEPLAYER_STATE : GPT_PLAYER_STATE);
player_t *pl = &players[srcPlrNum];
byte fl;
int i, k;
Writer* writer;
if(!IS_NETWORK_SERVER || !pl->plr->inGame ||
(destPlrNum >= 0 && destPlrNum < MAXPLAYERS && !players[destPlrNum].plr->inGame))
return;
App_Log(DE2_DEV_NET_MSG, "NetSv_SendPlayerState: src=%i, dest=%i, flags=%x", srcPlrNum, destPlrNum, flags);
writer = D_NetWrite();
// Include the player number if necessary.
if(pType == GPT_PLAYER_STATE)
{
Writer_WriteByte(writer, srcPlrNum);
}
// The first bytes contain the flags.
Writer_WriteUInt16(writer, flags);
if(flags & PSF_STATE)
{
Writer_WriteByte(writer, pl->playerState |
#if __JDOOM__ || __JHERETIC__ || __JDOOM64__ // Hexen doesn't have armortype.
(pl->armorType << 4));
#else
0);
#endif
}
if(flags & PSF_HEALTH)
Writer_WriteByte(writer, pl->health);
if(flags & PSF_ARMOR_POINTS)
{
#if __JHEXEN__
// Hexen has many types of armor points, send them all.
for(i = 0; i < NUMARMOR; ++i)
Writer_WriteByte(writer, pl->armorPoints[i]);
#else
Writer_WriteByte(writer, pl->armorPoints);
#endif
}
#if __JHERETIC__ || __JHEXEN__
if(flags & PSF_INVENTORY)
{
uint i, count = 0;
for(i = 0; i < NUM_INVENTORYITEM_TYPES; ++i)
count += (P_InventoryCount(srcPlrNum, IIT_FIRST + i)? 1 : 0);
Writer_WriteByte(writer, count);
if(count)
{
for(i = 0; i < NUM_INVENTORYITEM_TYPES; ++i)
{
inventoryitemtype_t type = IIT_FIRST + i;
uint num = P_InventoryCount(srcPlrNum, type);
if(num)
{
Writer_WriteUInt16(writer, (type & 0xff) | ((num & 0xff) << 8));
}
}
}
}
#endif
if(flags & PSF_POWERS)
{
byte powers = 0;
// First see which powers should be sent.
#if __JHEXEN__ || __JSTRIFE__
for(i = 1; i < NUM_POWER_TYPES; ++i)
if(pl->powers[i])
powers |= 1 << (i - 1);
#else
for(i = 0; i < NUM_POWER_TYPES; ++i)
{
# if __JDOOM__ || __JDOOM64__
if(i == PT_IRONFEET || i == PT_STRENGTH)
continue;
# endif
if(pl->powers[i])
powers |= 1 << i;
}
#endif
Writer_WriteByte(writer, powers);
// Send the non-zero powers.
#if __JHEXEN__ || __JSTRIFE__
for(i = 1; i < NUM_POWER_TYPES; ++i)
if(pl->powers[i])
Writer_WriteByte(writer, (pl->powers[i] + 34) / 35);
#else
for(i = 0; i < NUM_POWER_TYPES; ++i)
{
# if __JDOOM__ || __JDOOM64__
if(i == PT_IRONFEET || i == PT_STRENGTH)
continue;
# endif
if(pl->powers[i])
Writer_WriteByte(writer, (pl->powers[i] + 34) / 35); // Send as seconds.
}
#endif