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
|
/*
===========================================================================
Copyright (C) 1999-2005 Id Software, Inc.
Copyright (C) 2000-2009 Darklegion Development
This file is part of Tremulous.
Tremulous 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.
Tremulous 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 Tremulous; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
===========================================================================
*/
// cg_predict.c -- this file generates cg.predictedPlayerState by either
// interpolating between snapshots from the server or locally predicting
// ahead the client's movement.
// It also handles local physics interaction, like fragments bouncing off walls
#include "cg_local.h"
static pmove_t cg_pmove;
static int cg_numSolidEntities;
static centity_t *cg_solidEntities[MAX_ENTITIES_IN_SNAPSHOT];
static int cg_numTriggerEntities;
static centity_t *cg_triggerEntities[MAX_ENTITIES_IN_SNAPSHOT];
/*
====================
CG_BuildSolidList
When a new cg.snap has been set, this function builds a sublist
of the entities that are actually solid, to make for more
efficient collision detection
====================
*/
void CG_BuildSolidList( void )
{
int i;
centity_t *cent;
snapshot_t *snap;
entityState_t *ent;
cg_numSolidEntities = 0;
cg_numTriggerEntities = 0;
if( cg.nextSnap && !cg.nextFrameTeleport && !cg.thisFrameTeleport )
snap = cg.nextSnap;
else
snap = cg.snap;
for( i = 0; i < snap->numEntities; i++ )
{
cent = &cg_entities[ snap->entities[ i ].number ];
ent = ¢->currentState;
if( ent->eType == ET_ITEM || ent->eType == ET_PUSH_TRIGGER || ent->eType == ET_TELEPORT_TRIGGER )
{
cg_triggerEntities[ cg_numTriggerEntities ] = cent;
cg_numTriggerEntities++;
continue;
}
if( cent->nextState.solid && ent->eType != ET_MISSILE )
{
cg_solidEntities[ cg_numSolidEntities ] = cent;
cg_numSolidEntities++;
continue;
}
}
}
/*
====================
CG_ClipMoveToEntities
====================
*/
static void CG_ClipMoveToEntities ( const vec3_t start, const vec3_t mins,
const vec3_t maxs, const vec3_t end, int skipNumber,
int mask, trace_t *tr, traceType_t collisionType )
{
int i, j, x, zd, zu;
trace_t trace;
entityState_t *ent;
clipHandle_t cmodel;
vec3_t bmins, bmaxs;
vec3_t origin, angles;
centity_t *cent;
//SUPAR HACK
//this causes a trace to collide with the local player
if( skipNumber == MAGIC_TRACE_HACK )
j = cg_numSolidEntities + 1;
else
j = cg_numSolidEntities;
for( i = 0; i < j; i++ )
{
if( i < cg_numSolidEntities )
cent = cg_solidEntities[ i ];
else
cent = &cg.predictedPlayerEntity;
ent = ¢->currentState;
if( ent->number == skipNumber )
continue;
if( ent->solid == SOLID_BMODEL )
{
// special value for bmodel
cmodel = trap_CM_InlineModel( ent->modelindex );
VectorCopy( cent->lerpAngles, angles );
BG_EvaluateTrajectory( ¢->currentState.pos, cg.physicsTime, origin );
}
else if( ent->eType == ET_BUILDABLE && BG_IsCuboid( ent->modelindex ) )
{
BG_CuboidBBox( ent->angles, bmins, bmaxs );
cmodel = trap_CM_TempBoxModel( bmins, bmaxs );
VectorCopy( vec3_origin, angles );
VectorCopy( cent->lerpOrigin, origin );
}
else
{
// encoded bbox
x = ( ent->solid & 255 );
zd = ( ( ent->solid >> 8 ) & 255 );
zu = ( ( ent->solid >> 16 ) & 255 ) - 32;
bmins[ 0 ] = bmins[ 1 ] = -x;
bmaxs[ 0 ] = bmaxs[ 1 ] = x;
bmins[ 2 ] = -zd;
bmaxs[ 2 ] = zu;
if( i == cg_numSolidEntities )
BG_ClassBoundingBox( ( ent->misc >> 8 ) & 0xFF, bmins, bmaxs, NULL, NULL, NULL );
cmodel = trap_CM_TempBoxModel( bmins, bmaxs );
VectorCopy( vec3_origin, angles );
VectorCopy( cent->lerpOrigin, origin );
}
if( collisionType == TT_CAPSULE )
{
trap_CM_TransformedCapsuleTrace ( &trace, start, end,
mins, maxs, cmodel, mask, origin, angles );
}
else if( collisionType == TT_AABB )
{
trap_CM_TransformedBoxTrace ( &trace, start, end,
mins, maxs, cmodel, mask, origin, angles );
}
else if( collisionType == TT_BISPHERE )
{
trap_CM_TransformedBiSphereTrace( &trace, start, end,
mins[ 0 ], maxs[ 0 ], cmodel, mask, origin );
}
if( trace.allsolid || trace.fraction < tr->fraction )
{
trace.entityNum = ent->number;
if( tr->lateralFraction < trace.lateralFraction )
{
float oldLateralFraction = tr->lateralFraction;
*tr = trace;
tr->lateralFraction = oldLateralFraction;
}
else
*tr = trace;
}
else if( trace.startsolid )
{
tr->startsolid = qtrue;
tr->entityNum = ent->number;
}
if( tr->allsolid )
return;
}
}
/*
================
CG_Trace
================
*/
void CG_Trace( trace_t *result, const vec3_t start, const vec3_t mins, const vec3_t maxs, const vec3_t end,
int skipNumber, int mask )
{
trace_t t;
trap_CM_BoxTrace( &t, start, end, mins, maxs, 0, mask );
t.entityNum = t.fraction != 1.0 ? ENTITYNUM_WORLD : ENTITYNUM_NONE;
// check all other solid models
CG_ClipMoveToEntities( start, mins, maxs, end, skipNumber, mask, &t, TT_AABB );
*result = t;
}
/*
================
CG_CapTrace
================
*/
void CG_CapTrace( trace_t *result, const vec3_t start, const vec3_t mins, const vec3_t maxs, const vec3_t end,
int skipNumber, int mask )
{
trace_t t;
trap_CM_CapsuleTrace( &t, start, end, mins, maxs, 0, mask );
t.entityNum = t.fraction != 1.0 ? ENTITYNUM_WORLD : ENTITYNUM_NONE;
// check all other solid models
CG_ClipMoveToEntities( start, mins, maxs, end, skipNumber, mask, &t, TT_CAPSULE );
*result = t;
}
/*
================
CG_BiSphereTrace
================
*/
void CG_BiSphereTrace( trace_t *result, const vec3_t start, const vec3_t end,
const float startRadius, const float endRadius, int skipNumber, int mask )
{
trace_t t;
vec3_t mins, maxs;
mins[ 0 ] = startRadius;
maxs[ 0 ] = endRadius;
trap_CM_BiSphereTrace( &t, start, end, startRadius, endRadius, 0, mask );
t.entityNum = t.fraction != 1.0 ? ENTITYNUM_WORLD : ENTITYNUM_NONE;
// check all other solid models
CG_ClipMoveToEntities( start, mins, maxs, end, skipNumber, mask, &t, TT_BISPHERE );
*result = t;
}
/*
================
CG_PointContents
================
*/
int CG_PointContents( const vec3_t point, int passEntityNum )
{
int i;
entityState_t *ent;
centity_t *cent;
clipHandle_t cmodel;
int contents;
contents = trap_CM_PointContents (point, 0);
for( i = 0; i < cg_numSolidEntities; i++ )
{
cent = cg_solidEntities[ i ];
ent = ¢->currentState;
if( ent->number == passEntityNum )
continue;
if( ent->solid != SOLID_BMODEL ) // special value for bmodel
continue;
cmodel = trap_CM_InlineModel( ent->modelindex );
if( !cmodel )
continue;
contents |= trap_CM_TransformedPointContents( point, cmodel, ent->origin, ent->angles );
}
return contents;
}
/*
========================
CG_InterpolatePlayerState
Generates cg.predictedPlayerState by interpolating between
cg.snap->player_state and cg.nextFrame->player_state
========================
*/
static void CG_InterpolatePlayerState( qboolean grabAngles )
{
float f;
int i;
playerState_t *out;
snapshot_t *prev, *next;
out = &cg.predictedPlayerState;
prev = cg.snap;
next = cg.nextSnap;
*out = cg.snap->ps;
// if we are still allowing local input, short circuit the view angles
if( grabAngles )
{
usercmd_t cmd;
int cmdNum;
cmdNum = trap_GetCurrentCmdNumber( );
trap_GetUserCmd( cmdNum, &cmd );
PM_UpdateViewAngles( out, &cmd );
}
// if the next frame is a teleport, we can't lerp to it
if( cg.nextFrameTeleport )
return;
if( !next || next->serverTime <= prev->serverTime )
return;
f = (float)( cg.time - prev->serverTime ) / ( next->serverTime - prev->serverTime );
i = next->ps.bobCycle;
if( i < prev->ps.bobCycle )
i += 256; // handle wraparound
out->bobCycle = prev->ps.bobCycle + f * ( i - prev->ps.bobCycle );
for( i = 0; i < 3; i++ )
{
out->origin[ i ] = prev->ps.origin[ i ] + f * ( next->ps.origin[ i ] - prev->ps.origin[ i ] );
if( !grabAngles )
out->viewangles[ i ] = LerpAngle( prev->ps.viewangles[ i ], next->ps.viewangles[ i ], f );
out->velocity[ i ] = prev->ps.velocity[ i ] +
f * (next->ps.velocity[ i ] - prev->ps.velocity[ i ] );
}
}
/*
=========================
CG_TouchTriggerPrediction
Predict push triggers and items
=========================
*/
static void CG_TouchTriggerPrediction( void )
{
int i;
trace_t trace;
entityState_t *ent;
clipHandle_t cmodel;
centity_t *cent;
qboolean spectator;
// dead clients don't activate triggers
if( cg.predictedPlayerState.stats[ STAT_HEALTH ] <= 0 )
return;
spectator = ( cg.predictedPlayerState.pm_type == PM_SPECTATOR );
if( cg.predictedPlayerState.pm_type != PM_NORMAL && !spectator )
return;
for( i = 0; i < cg_numTriggerEntities; i++ )
{
cent = cg_triggerEntities[ i ];
ent = ¢->currentState;
if( ent->solid != SOLID_BMODEL )
continue;
cmodel = trap_CM_InlineModel( ent->modelindex );
if( !cmodel )
continue;
trap_CM_BoxTrace( &trace, cg.predictedPlayerState.origin, cg.predictedPlayerState.origin,
cg_pmove.mins, cg_pmove.maxs, cmodel, -1 );
if( !trace.startsolid )
continue;
if( ent->eType == ET_TELEPORT_TRIGGER )
cg.hyperspace = qtrue;
}
}
static int CG_IsUnacceptableError( playerState_t *ps, playerState_t *pps )
{
vec3_t delta;
int i;
if( pps->pm_type != ps->pm_type ||
pps->pm_flags != ps->pm_flags ||
pps->pm_time != ps->pm_time )
{
return 1;
}
VectorSubtract( pps->origin, ps->origin, delta );
if( VectorLengthSquared( delta ) > 0.1f * 0.1f )
{
if( cg_showmiss.integer )
{
CG_Printf( "origin delta: %.2f ", VectorLength( delta ) );
}
return 2;
}
VectorSubtract( pps->velocity, ps->velocity, delta );
if( VectorLengthSquared( delta ) > 0.1f * 0.1f )
{
if( cg_showmiss.integer )
{
CG_Printf( "velocity delta: %.2f ", VectorLength( delta ) );
}
return 3;
}
if( pps->weaponTime != ps->weaponTime ||
pps->gravity != ps->gravity ||
pps->speed != ps->speed ||
pps->delta_angles[ 0 ] != ps->delta_angles[ 0 ] ||
pps->delta_angles[ 1 ] != ps->delta_angles[ 1 ] ||
pps->delta_angles[ 2 ] != ps->delta_angles[ 2 ] ||
pps->groundEntityNum != ps->groundEntityNum )
{
return 4;
}
if( pps->legsTimer != ps->legsTimer ||
pps->legsAnim != ps->legsAnim ||
pps->torsoTimer != ps->torsoTimer ||
pps->torsoAnim != ps->torsoAnim ||
pps->movementDir != ps->movementDir )
{
return 5;
}
VectorSubtract( pps->grapplePoint, ps->grapplePoint, delta );
if( VectorLengthSquared( delta ) > 0.1f * 0.1f )
return 6;
if( pps->eFlags != ps->eFlags )
return 7;
if( pps->eventSequence != ps->eventSequence )
return 8;
for( i = 0; i < MAX_PS_EVENTS; i++ )
{
if ( pps->events[ i ] != ps->events[ i ] ||
pps->eventParms[ i ] != ps->eventParms[ i ] )
{
return 9;
}
}
if( pps->externalEvent != ps->externalEvent ||
pps->externalEventParm != ps->externalEventParm ||
pps->externalEventTime != ps->externalEventTime )
{
return 10;
}
if( pps->clientNum != ps->clientNum ||
pps->weapon != ps->weapon ||
pps->weaponstate != ps->weaponstate )
{
return 11;
}
if( fabs( AngleDelta( ps->viewangles[ 0 ], pps->viewangles[ 0 ] ) ) > 1.0f ||
fabs( AngleDelta( ps->viewangles[ 1 ], pps->viewangles[ 1 ] ) ) > 1.0f ||
fabs( AngleDelta( ps->viewangles[ 2 ], pps->viewangles[ 2 ] ) ) > 1.0f )
{
return 12;
}
if( pps->viewheight != ps->viewheight )
return 13;
if( pps->damageEvent != ps->damageEvent ||
pps->damageYaw != ps->damageYaw ||
pps->damagePitch != ps->damagePitch ||
pps->damageCount != ps->damageCount )
{
return 14;
}
for( i = 0; i < MAX_STATS; i++ )
{
if( pps->stats[ i ] != ps->stats[ i ] )
return 15;
}
for( i = 0; i < MAX_PERSISTANT; i++ )
{
if( pps->persistant[ i ] != ps->persistant[ i ] )
return 16;
}
for( i = 0; i < MAX_PERSISTANT; i++ )
{
if( pps->misc[ i ] != ps->misc[ i ] )
return 17;
}
if( pps->generic1 != ps->generic1 ||
pps->loopSound != ps->loopSound )
{
return 19;
}
return 0;
}
/*
=================
CG_PredictPlayerState
Generates cg.predictedPlayerState for the current cg.time
cg.predictedPlayerState is guaranteed to be valid after exiting.
For demo playback, this will be an interpolation between two valid
playerState_t.
For normal gameplay, it will be the result of predicted usercmd_t on
top of the most recent playerState_t received from the server.
Each new snapshot will usually have one or more new usercmd over the last,
but we simulate all unacknowledged commands each time, not just the new ones.
This means that on an internet connection, quite a few pmoves may be issued
each frame.
OPTIMIZE: don't re-simulate unless the newly arrived snapshot playerState_t
differs from the predicted one. Would require saving all intermediate
playerState_t during prediction.
We detect prediction errors and allow them to be decayed off over several frames
to ease the jerk.
=================
*/
//Refer to G_PMTraceHack documentation for information about this function
void CG_PMTraceHack(trace_t *results,const vec3_t start,const vec3_t mins,const vec3_t maxs,const vec3_t end,int passEntityNum,int contentmask )
{
int modelindex;
CG_Trace(results,start,mins,maxs,end,passEntityNum,contentmask);
if(results->entityNum!=ENTITYNUM_NONE)
{
modelindex=cg_entities[results->entityNum].currentState.modelindex;
if(modelindex>=CUBOID_FIRST&&modelindex<=CUBOID_LAST&&(cg_entities[results->entityNum].currentState.eFlags&EF_B_SPAWNED))
results->surfaceFlags|=BG_CuboidAttributes(modelindex)->surfaceFlags;
}
}
void CG_PredictPlayerState( void )
{
int cmdNum, current, i;
playerState_t oldPlayerState;
qboolean moved;
usercmd_t oldestCmd;
usercmd_t latestCmd;
int stateIndex = 0, predictCmd = 0;
cg.hyperspace = qfalse; // will be set if touching a trigger_teleport
// if this is the first frame we must guarantee
// predictedPlayerState is valid even if there is some
// other error condition
if( !cg.validPPS )
{
cg.validPPS = qtrue;
cg.predictedPlayerState = cg.snap->ps;
}
// demo playback just copies the moves
if( cg.demoPlayback || (cg.snap->ps.pm_flags & PMF_FOLLOW) )
{
CG_InterpolatePlayerState( qfalse );
return;
}
// non-predicting local movement will grab the latest angles
if( cg_nopredict.integer || cg_synchronousClients.integer )
{
CG_InterpolatePlayerState( qtrue );
return;
}
// prepare for pmove
cg_pmove.ps = &cg.predictedPlayerState;
cg_pmove.pmext = &cg.pmext;
cg_pmove.trace = CG_PMTraceHack;
cg_pmove.pointcontents = CG_PointContents;
cg_pmove.debugLevel = cg_debugMove.integer;
if( cg_pmove.ps->pm_type == PM_DEAD )
cg_pmove.tracemask = MASK_DEADSOLID;
else
cg_pmove.tracemask = MASK_PLAYERSOLID;
if( cg.snap->ps.persistant[ PERS_SPECSTATE ] != SPECTATOR_NOT )
cg_pmove.tracemask = MASK_DEADSOLID; // spectators can fly through bodies
cg_pmove.noFootsteps = 0;
// save the state before the pmove so we can detect transitions
oldPlayerState = cg.predictedPlayerState;
current = trap_GetCurrentCmdNumber( );
// if we don't have the commands right after the snapshot, we
// can't accurately predict a current position, so just freeze at
// the last good position we had
cmdNum = current - CMD_BACKUP + 1;
trap_GetUserCmd( cmdNum, &oldestCmd );
if( oldestCmd.serverTime > cg.snap->ps.commandTime &&
oldestCmd.serverTime < cg.time )
{ // special check for map_restart
if( cg_showmiss.integer )
CG_Printf( "exceeded PACKET_BACKUP on commands\n" );
return;
}
// get the latest command so we can know which commands are from previous map_restarts
trap_GetUserCmd( current, &latestCmd );
// get the most recent information we have, even if
// the server time is beyond our current cg.time,
// because predicted player positions are going to
// be ahead of everything else anyway
if( cg.nextSnap && !cg.nextFrameTeleport && !cg.thisFrameTeleport )
{
cg.predictedPlayerState = cg.nextSnap->ps;
cg.physicsTime = cg.nextSnap->serverTime;
}
else
{
cg.predictedPlayerState = cg.snap->ps;
cg.physicsTime = cg.snap->serverTime;
}
if( pmove_msec.integer < 8 )
trap_Cvar_Set( "pmove_msec", "8" );
else if( pmove_msec.integer > 33 )
trap_Cvar_Set( "pmove_msec", "33" );
cg_pmove.pmove_fixed = pmove_fixed.integer;// | cg_pmove_fixed.integer;
cg_pmove.pmove_msec = pmove_msec.integer;
// Like the comments described above, a player's state is entirely
// re-predicted from the last valid snapshot every client frame, which
// can be really, really, really slow. Every old command has to be
// run again. For every client frame that is *not* directly after a
// snapshot, this is unnecessary, since we have no new information.
// For those, we'll play back the predictions from the last frame and
// predict only the newest commands. Essentially, we'll be doing
// an incremental predict instead of a full predict.
//
// If we have a new snapshot, we can compare its player state's command
// time to the command times in the queue to find a match. If we find
// a matching state, and the predicted version has not deviated, we can
// use the predicted state as a base - and also do an incremental predict.
//
// With this method, we get incremental predicts on every client frame
// except a frame following a new snapshot in which there was a prediction
// error. This yeilds anywhere from a 15% to 40% performance increase,
// depending on how much of a bottleneck the CPU is.
if( cg_optimizePrediction.integer )
{
if( cg.nextFrameTeleport || cg.thisFrameTeleport )
{
// do a full predict
cg.lastPredictedCommand = 0;
cg.stateTail = cg.stateHead;
predictCmd = current - CMD_BACKUP + 1;
}
// cg.physicsTime is the current snapshot's serverTime if it's the same
// as the last one
else if( cg.physicsTime == cg.lastServerTime )
{
// we have no new information, so do an incremental predict
predictCmd = cg.lastPredictedCommand + 1;
}
else
{
// we have a new snapshot
int i;
int errorcode;
qboolean error = qtrue;
// loop through the saved states queue
for( i = cg.stateHead; i != cg.stateTail;
i = ( i + 1 ) % NUM_SAVED_STATES )
{
// if we find a predicted state whose commandTime matches the snapshot
// player state's commandTime
if( cg.savedPmoveStates[ i ].commandTime !=
cg.predictedPlayerState.commandTime )
{
continue;
}
// make sure the state differences are acceptable
errorcode = CG_IsUnacceptableError( &cg.predictedPlayerState,
&cg.savedPmoveStates[ i ] );
if( errorcode )
{
if( cg_showmiss.integer )
CG_Printf("errorcode %d at %d\n", errorcode, cg.time);
break;
}
// this one is almost exact, so we'll copy it in as the starting point
*cg_pmove.ps = cg.savedPmoveStates[ i ];
// advance the head
cg.stateHead = ( i + 1 ) % NUM_SAVED_STATES;
// set the next command to predict
predictCmd = cg.lastPredictedCommand + 1;
// a saved state matched, so flag it
error = qfalse;
break;
}
// if no saved states matched
if( error )
{
// do a full predict
cg.lastPredictedCommand = 0;
cg.stateTail = cg.stateHead;
predictCmd = current - CMD_BACKUP + 1;
}
}
// keep track of the server time of the last snapshot so we
// know when we're starting from a new one in future calls
cg.lastServerTime = cg.physicsTime;
stateIndex = cg.stateHead;
}
// run cmds
moved = qfalse;
for( cmdNum = current - CMD_BACKUP + 1; cmdNum <= current; cmdNum++ )
{
// get the command
trap_GetUserCmd( cmdNum, &cg_pmove.cmd );
if( cg_pmove.pmove_fixed )
PM_UpdateViewAngles( cg_pmove.ps, &cg_pmove.cmd );
// don't do anything if the time is before the snapshot player time
if( cg_pmove.cmd.serverTime <= cg.predictedPlayerState.commandTime )
continue;
// don't do anything if the command was from a previous map_restart
if( cg_pmove.cmd.serverTime > latestCmd.serverTime )
continue;
// check for a prediction error from last frame
// on a lan, this will often be the exact value
// from the snapshot, but on a wan we will have
// to predict several commands to get to the point
// we want to compare
if( cg.predictedPlayerState.commandTime == oldPlayerState.commandTime )
{
vec3_t delta;
float len;
if( cg.thisFrameTeleport )
{
// a teleport will not cause an error decay
VectorClear( cg.predictedError );
if( cg_showmiss.integer )
CG_Printf( "PredictionTeleport\n" );
cg.thisFrameTeleport = qfalse;
}
else
{
vec3_t adjusted;
CG_AdjustPositionForMover( cg.predictedPlayerState.origin,
cg.predictedPlayerState.groundEntityNum, cg.physicsTime, cg.oldTime, adjusted );
if( cg_showmiss.integer )
{
if( !VectorCompare( oldPlayerState.origin, adjusted ) )
CG_Printf("prediction error\n");
}
VectorSubtract( oldPlayerState.origin, adjusted, delta );
len = VectorLength( delta );
if( len > 0.1 )
{
if( cg_showmiss.integer )
CG_Printf( "Prediction miss: %f\n", len );
if( cg_errorDecay.integer )
{
int t;
float f;
t = cg.time - cg.predictedErrorTime;
f = ( cg_errorDecay.value - t ) / cg_errorDecay.value;
if( f < 0 )
f = 0;
if( f > 0 && cg_showmiss.integer )
CG_Printf( "Double prediction decay: %f\n", f );
VectorScale( cg.predictedError, f, cg.predictedError );
}
else
VectorClear( cg.predictedError );
VectorAdd( delta, cg.predictedError, cg.predictedError );
cg.predictedErrorTime = cg.oldTime;
}
}
}
// don't predict gauntlet firing, which is only supposed to happen
// when it actually inflicts damage
for( i = WP_NONE + 1; i < WP_NUM_WEAPONS; i++ )
cg_pmove.autoWeaponHit[ i ] = qfalse;
if( cg_pmove.pmove_fixed )
cg_pmove.cmd.serverTime = ( ( cg_pmove.cmd.serverTime + pmove_msec.integer - 1 ) /
pmove_msec.integer ) * pmove_msec.integer;
if( !cg_optimizePrediction.integer )
{
Pmove( &cg_pmove );
}
else if( cg_optimizePrediction.integer && ( cmdNum >= predictCmd ||
( stateIndex + 1 ) % NUM_SAVED_STATES == cg.stateHead ) )
{
Pmove( &cg_pmove );
// record the last predicted command
cg.lastPredictedCommand = cmdNum;
// if we haven't run out of space in the saved states queue
if( ( stateIndex + 1 ) % NUM_SAVED_STATES != cg.stateHead )
{
// save the state for the false case ( of cmdNum >= predictCmd )
// in later calls to this function
cg.savedPmoveStates[ stateIndex ] = *cg_pmove.ps;
stateIndex = ( stateIndex + 1 ) % NUM_SAVED_STATES;
cg.stateTail = stateIndex;
}
}
else
{
*cg_pmove.ps = cg.savedPmoveStates[ stateIndex ];
stateIndex = ( stateIndex + 1 ) % NUM_SAVED_STATES;
}
moved = qtrue;
// add push trigger movement effects
CG_TouchTriggerPrediction( );
// check for predictable events that changed from previous predictions
//CG_CheckChangedPredictableEvents(&cg.predictedPlayerState);
}
// adjust for the movement of the groundentity
CG_AdjustPositionForMover( cg.predictedPlayerState.origin,
cg.predictedPlayerState.groundEntityNum,
cg.physicsTime, cg.time, cg.predictedPlayerState.origin );
// fire events and other transition triggered things
CG_TransitionPlayerState( &cg.predictedPlayerState, &oldPlayerState );
}
|