/
g_mover.c
4752 lines (3909 loc) · 125 KB
/
g_mover.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
/*
===========================================================================
Return to Castle Wolfenstein single player GPL Source Code
Copyright (C) 1999-2010 id Software LLC, a ZeniMax Media company.
This file is part of the Return to Castle Wolfenstein single player GPL Source Code (RTCW SP Source Code).
RTCW SP Source Code is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
RTCW SP Source Code is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with RTCW SP Source Code. If not, see <http://www.gnu.org/licenses/>.
In addition, the RTCW SP Source Code is also subject to certain additional terms. You should have received a copy of these additional terms immediately following the terms and conditions of the GNU General Public License which accompanied the RTCW SP Source Code. If not, please request a copy in writing from id Software at the address below.
If you have questions concerning this license or the applicable additional terms, you may contact in writing id Software LLC, c/o ZeniMax Media Inc., Suite 120, Rockville, Maryland 20850 USA.
===========================================================================
*/
/*
* name: g_mover.c
*
* desc:
*
*/
#include "g_local.h"
char *hintStrings[] = {
"", // HINT_NONE
"HINT_NONE", // actually HINT_FORCENONE, but since this is being specified in the ent, the designer actually means HINT_FORCENONE
"HINT_PLAYER",
"HINT_ACTIVATE",
"HINT_NOACTIVATE",
"HINT_DOOR",
"HINT_DOOR_ROTATING",
"HINT_DOOR_LOCKED",
"HINT_DOOR_ROTATING_LOCKED",
"HINT_MG42",
"HINT_BREAKABLE",
"HINT_BREAKABLE_BIG",
"HINT_CHAIR",
"HINT_ALARM",
"HINT_HEALTH",
"HINT_TREASURE",
"HINT_KNIFE",
"HINT_LADDER",
"HINT_BUTTON",
"HINT_WATER",
"HINT_CAUTION",
"HINT_DANGER",
"HINT_SECRET",
"HINT_QUESTION",
"HINT_EXCLAMATION",
"HINT_CLIPBOARD",
"HINT_WEAPON",
"HINT_AMMO",
"HINT_ARMOR",
"HINT_POWERUP",
"HINT_HOLDABLE",
"HINT_INVENTORY",
"HINT_SCENARIC",
"HINT_EXIT",
"HINT_NOEXIT",
"HINT_EXIT_FAR",
"HINT_NOEXIT_FAR",
"HINT_PLYR_FRIEND",
"HINT_PLYR_NEUTRAL",
"HINT_PLYR_ENEMY",
"HINT_PLYR_UNKNOWN",
"HINT_BUILD",
"", // HINT_BAD_USER
};
/*
===============================================================================
PUSHMOVE
===============================================================================
*/
void MatchTeam( gentity_t *teamLeader, int moverState, int time );
void Reached_Train( gentity_t *ent );
void Think_BeginMoving( gentity_t *ent );
void Use_Func_Rotate( gentity_t * ent, gentity_t * other, gentity_t * activator );
void Blocked_Door( gentity_t *ent, gentity_t *other );
void Blocked_DoorRotate( gentity_t *ent, gentity_t *other );
typedef struct {
gentity_t *ent;
vec3_t origin;
vec3_t angles;
float deltayaw;
} pushed_t;
pushed_t pushed[MAX_GENTITIES], *pushed_p;
/*
============
G_TestEntityPosition
============
*/
gentity_t *G_TestEntityPosition( gentity_t *ent ) {
trace_t tr;
int mask;
if ( ent->clipmask ) {
if ( ent->r.contents == CONTENTS_CORPSE ) {
// corpse aren't important
//G_Damage( ent, NULL, NULL, NULL, NULL, 99999, 0, MOD_CRUSH );
return NULL;
} else {
mask = ent->clipmask;
}
} else {
mask = MASK_SOLID;
}
if ( ent->client ) {
trap_TraceCapsule( &tr, ent->client->ps.origin, ent->r.mins, ent->r.maxs, ent->client->ps.origin, ent->s.number, mask );
} else if ( ent->s.eType == ET_MISSILE ) {
trap_Trace( &tr, ent->s.pos.trBase, ent->r.mins, ent->r.maxs, ent->s.pos.trBase, ent->r.ownerNum, mask );
} else {
trap_Trace( &tr, ent->s.pos.trBase, ent->r.mins, ent->r.maxs, ent->s.pos.trBase, ent->s.number, mask );
}
if ( tr.startsolid ) {
return &g_entities[ tr.entityNum ];
}
return NULL;
}
/*
============
G_TestEntityDropToFloor
============
*/
void G_TestEntityDropToFloor( gentity_t *ent, float maxdrop ) {
trace_t tr;
int mask;
vec3_t endpos;
if ( ent->clipmask ) {
mask = ent->clipmask;
} else {
mask = MASK_SOLID;
}
if ( ent->client ) {
VectorCopy( ent->client->ps.origin, endpos );
} else {
VectorCopy( ent->s.pos.trBase, endpos );
}
endpos[2] -= maxdrop;
if ( ent->client ) {
trap_TraceCapsule( &tr, ent->client->ps.origin, ent->r.mins, ent->r.maxs, endpos, ent->s.number, mask );
} else {
trap_Trace( &tr, ent->s.pos.trBase, ent->r.mins, ent->r.maxs, endpos, ent->s.number, mask );
}
VectorCopy( tr.endpos, ent->s.pos.trBase );
if ( ent->client ) {
VectorCopy( tr.endpos, ent->client->ps.origin );
}
}
/*
============
G_TestEntityMoveTowardsPos
============
*/
void G_TestEntityMoveTowardsPos( gentity_t *ent, vec3_t pos ) {
trace_t tr;
int mask;
if ( ent->clipmask ) {
mask = ent->clipmask;
} else {
mask = MASK_SOLID;
}
if ( ent->client ) {
trap_TraceCapsule( &tr, ent->client->ps.origin, ent->r.mins, ent->r.maxs, pos, ent->s.number, mask );
} else {
trap_Trace( &tr, ent->s.pos.trBase, ent->r.mins, ent->r.maxs, pos, ent->s.number, mask );
}
VectorCopy( tr.endpos, ent->s.pos.trBase );
if ( ent->client ) {
VectorCopy( tr.endpos, ent->client->ps.origin );
}
}
/*
================
G_CreateRotationMatrix
================
*/
void G_CreateRotationMatrix( const vec3_t angles, vec3_t matrix[3] ) {
AngleVectors( angles, matrix[0], matrix[1], matrix[2] );
VectorInverse( matrix[1] );
}
/*
================
G_TransposeMatrix
================
*/
// TTimo: const vec_t ** would require explicit casts for ANSI C conformance
// see unix/const-arg.c in Wolf MP source
void G_TransposeMatrix( /*const*/ vec3_t matrix[3], vec3_t transpose[3] ) {
int i, j;
for ( i = 0; i < 3; i++ ) {
for ( j = 0; j < 3; j++ ) {
transpose[i][j] = matrix[j][i];
}
}
}
/*
================
G_RotatePoint
================
*/
// TTimo: const vec_t ** would require explicit casts for ANSI C conformance
// see unix/const-arg.c in Wolf MP source
void G_RotatePoint( vec3_t point, /*const*/ vec3_t matrix[3] ) {
vec3_t tvec;
VectorCopy( point, tvec );
point[0] = DotProduct( matrix[0], tvec );
point[1] = DotProduct( matrix[1], tvec );
point[2] = DotProduct( matrix[2], tvec );
}
/*
==================
G_TryPushingEntity
Returns qfalse if the move is blocked
==================
*/
qboolean G_TryPushingEntity( gentity_t *check, gentity_t *pusher, vec3_t move, vec3_t amove ) {
vec3_t org, org2, move2;
gentity_t *block;
vec3_t matrix[3], transpose[3];
float x, fx, y, fy, z, fz;
#define JITTER_INC 4
#define JITTER_MAX ( check->r.maxs[0] / 2.0 )
// EF_MOVER_STOP will just stop when contacting another entity
// instead of pushing it, but entities can still ride on top of it
if ( ( pusher->s.eFlags & EF_MOVER_STOP ) &&
check->s.groundEntityNum != pusher->s.number ) {
//pusher->s.eFlags |= EF_MOVER_BLOCKED;
return qfalse;
}
// save off the old position
if ( pushed_p > &pushed[MAX_GENTITIES] ) {
G_Error( "pushed_p > &pushed[MAX_GENTITIES]" );
}
pushed_p->ent = check;
VectorCopy( check->s.pos.trBase, pushed_p->origin );
VectorCopy( check->s.apos.trBase, pushed_p->angles );
if ( check->client ) {
pushed_p->deltayaw = check->client->ps.delta_angles[YAW];
VectorCopy( check->client->ps.origin, pushed_p->origin );
}
pushed_p++;
// try moving the contacted entity
VectorAdd( check->s.pos.trBase, move, check->s.pos.trBase );
if ( check->client ) {
// make sure the client's view rotates when on a rotating mover
// RF, this is done client-side now
check->client->ps.delta_angles[YAW] += ANGLE2SHORT( amove[YAW] );
//
// RF, AI's need their ideal angle adjusted instead
if ( check->aiCharacter ) {
AICast_AdjustIdealYawForMover( check->s.number, ANGLE2SHORT( amove[YAW] ) );
}
}
// figure movement due to the pusher's amove
G_CreateRotationMatrix( amove, transpose );
G_TransposeMatrix( transpose, matrix );
VectorSubtract( check->s.pos.trBase, pusher->r.currentOrigin, org );
if ( check->client ) {
VectorSubtract( check->client->ps.origin, pusher->r.currentOrigin, org );
}
VectorCopy( org, org2 );
G_RotatePoint( org2, matrix );
VectorSubtract( org2, org, move2 );
VectorAdd( check->s.pos.trBase, move2, check->s.pos.trBase );
if ( check->client ) {
VectorAdd( check->client->ps.origin, move, check->client->ps.origin );
VectorAdd( check->client->ps.origin, move2, check->client->ps.origin );
}
// may have pushed them off an edge
if ( check->s.groundEntityNum != pusher->s.number ) {
check->s.groundEntityNum = -1;
}
block = G_TestEntityPosition( check );
if ( !block ) {
// pushed ok
if ( check->client ) {
VectorCopy( check->client->ps.origin, check->r.currentOrigin );
} else {
VectorCopy( check->s.pos.trBase, check->r.currentOrigin );
}
return qtrue;
}
// RF, if still not valid, move them around to see if we can find a good spot
if ( JITTER_MAX > JITTER_INC ) {
VectorCopy( check->s.pos.trBase, org );
if ( check->client ) {
VectorCopy( check->client->ps.origin, org );
}
for ( z = 0; z < JITTER_MAX; z += JITTER_INC )
for ( fz = -z; fz <= z; fz += 2 * z ) {
for ( x = JITTER_INC; x < JITTER_MAX; x += JITTER_INC )
for ( fx = -x; fx <= x; fx += 2 * x ) {
for ( y = JITTER_INC; y < JITTER_MAX; y += JITTER_INC )
for ( fy = -y; fy <= y; fy += 2 * y ) {
VectorSet( move2, fx, fy, fz );
VectorAdd( org, move2, org2 );
VectorCopy( org2, check->s.pos.trBase );
if ( check->client ) {
VectorCopy( org2, check->client->ps.origin );
}
//
// do the test
block = G_TestEntityPosition( check );
if ( !block ) {
// pushed ok
if ( check->client ) {
VectorCopy( check->client->ps.origin, check->r.currentOrigin );
} else {
VectorCopy( check->s.pos.trBase, check->r.currentOrigin );
}
return qtrue;
}
}
}
if ( !fz ) {
break;
}
}
// didnt work, so set the position back
VectorCopy( org, check->s.pos.trBase );
if ( check->client ) {
VectorCopy( org, check->client->ps.origin );
}
}
// if it is ok to leave in the old position, do it
// this is only relevent for riding entities, not pushed
// Sliding trapdoors can cause this.
VectorCopy( ( pushed_p - 1 )->origin, check->s.pos.trBase );
if ( check->client ) {
VectorCopy( ( pushed_p - 1 )->origin, check->client->ps.origin );
}
VectorCopy( ( pushed_p - 1 )->angles, check->s.apos.trBase );
block = G_TestEntityPosition( check );
if ( !block ) {
check->s.groundEntityNum = -1;
pushed_p--;
return qtrue;
}
// blocked
return qfalse;
}
/*
============
G_MoverPush
Objects need to be moved back on a failed push,
otherwise riders would continue to slide.
If qfalse is returned, *obstacle will be the blocking entity
============
*/
qboolean G_MoverPush( gentity_t *pusher, vec3_t move, vec3_t amove, gentity_t **obstacle ) {
int i, e;
gentity_t *check;
vec3_t mins, maxs;
pushed_t *p;
int entityList[MAX_GENTITIES];
int moveList[MAX_GENTITIES];
int listedEntities, moveEntities;
vec3_t totalMins, totalMaxs;
*obstacle = NULL;
// mins/maxs are the bounds at the destination
// totalMins / totalMaxs are the bounds for the entire move
if ( pusher->r.currentAngles[0] || pusher->r.currentAngles[1] || pusher->r.currentAngles[2]
|| amove[0] || amove[1] || amove[2] ) {
float radius;
radius = RadiusFromBounds( pusher->r.mins, pusher->r.maxs );
for ( i = 0; i < 3; i++ ) {
mins[i] = pusher->r.currentOrigin[i] - radius + move[i];
maxs[i] = pusher->r.currentOrigin[i] + radius + move[i];
totalMins[i] = pusher->r.currentOrigin[i] - radius;
totalMaxs[i] = pusher->r.currentOrigin[i] + radius;
}
} else {
for ( i = 0; i < 3; i++ ) {
mins[i] = pusher->r.absmin[i] + move[i];
maxs[i] = pusher->r.absmax[i] + move[i];
}
VectorCopy( pusher->r.absmin, totalMins );
VectorCopy( pusher->r.absmax, totalMaxs );
}
for ( i = 0; i < 3; i++ ) {
if ( move[i] > 0 ) {
totalMaxs[i] += move[i];
} else {
totalMins[i] += move[i];
}
}
// unlink the pusher so we don't get it in the entityList
trap_UnlinkEntity( pusher );
listedEntities = trap_EntitiesInBox( totalMins, totalMaxs, entityList, MAX_GENTITIES );
// move the pusher to it's final position
VectorAdd( pusher->r.currentOrigin, move, pusher->r.currentOrigin );
VectorAdd( pusher->r.currentAngles, amove, pusher->r.currentAngles );
trap_LinkEntity( pusher );
moveEntities = 0;
// see if any solid entities are inside the final position
for ( e = 0 ; e < listedEntities ; e++ ) {
check = &g_entities[ entityList[ e ] ];
if ( check->s.eType == ET_ALARMBOX ) {
continue;
}
if ( check->isProp && check->s.eType == ET_PROP ) {
continue;
}
// only push items and players
if ( check->s.eType != ET_MISSILE && check->s.eType != ET_ITEM && check->s.eType != ET_PLAYER && !check->physicsObject ) {
continue;
}
if ( check->s.eType == ET_ITEM && check->item->giType == IT_CLIPBOARD && ( check->spawnflags & 1 ) ) {
continue;
}
//if ( check->s.eType == ET_MISSILE && VectorLength( check->s.pos.trDelta ) ) {
// continue; // it's moving
//}
// if the entity is standing on the pusher, it will definitely be moved
if ( check->s.groundEntityNum != pusher->s.number ) {
// see if the ent needs to be tested
if ( check->r.absmin[0] >= maxs[0]
|| check->r.absmin[1] >= maxs[1]
|| check->r.absmin[2] >= maxs[2]
|| check->r.absmax[0] <= mins[0]
|| check->r.absmax[1] <= mins[1]
|| check->r.absmax[2] <= mins[2] ) {
continue;
}
// see if the ent's bbox is inside the pusher's final position
// this does allow a fast moving object to pass through a thin entity...
if ( G_TestEntityPosition( check ) != pusher ) {
continue;
}
}
moveList[moveEntities++] = entityList[e];
}
// unlink all to be moved entities so they cannot get stuck in each other
for ( e = 0; e < moveEntities; e++ ) {
check = &g_entities[ moveList[e] ];
trap_UnlinkEntity( check );
}
for ( e = 0; e < moveEntities; e++ ) {
check = &g_entities[ moveList[e] ];
// the entity needs to be pushed
if ( G_TryPushingEntity( check, pusher, move, amove ) ) {
// link it in now so nothing else tries to clip into us
trap_LinkEntity( check );
continue;
}
// the move was blocked an entity
// bobbing entities are instant-kill and never get blocked
if ( pusher->s.pos.trType == TR_SINE || pusher->s.apos.trType == TR_SINE ) {
G_Damage( check, pusher, pusher, NULL, NULL, 99999, 0, MOD_CRUSH );
continue;
}
// save off the obstacle so we can call the block function (crush, etc)
*obstacle = check;
// move back any entities we already moved
// go backwards, so if the same entity was pushed
// twice, it goes back to the original position
for ( p = pushed_p - 1 ; p >= pushed ; p-- ) {
VectorCopy( p->origin, p->ent->s.pos.trBase );
VectorCopy( p->angles, p->ent->s.apos.trBase );
if ( p->ent->client ) {
p->ent->client->ps.delta_angles[YAW] = p->deltayaw;
VectorCopy( p->origin, p->ent->client->ps.origin );
}
}
// link all entities at their original position
for ( e = 0; e < moveEntities; e++ ) {
check = &g_entities[ moveList[e] ];
trap_LinkEntity( check );
}
// movement failed
return qfalse;
}
// link all entities at their final position
for ( e = 0; e < moveEntities; e++ ) {
check = &g_entities[ moveList[e] ];
trap_LinkEntity( check );
}
// movement was successfull
return qtrue;
}
/*
=================
G_MoverTeam
=================
*/
void G_MoverTeam( gentity_t *ent ) {
vec3_t move, amove;
gentity_t *part, *obstacle;
vec3_t origin, angles;
obstacle = NULL;
// make sure all team slaves can move before commiting
// any moves or calling any think functions
// if the move is blocked, all moved objects will be backed out
pushed_p = pushed;
for ( part = ent ; part ; part = part->teamchain ) {
// get current position
BG_EvaluateTrajectory( &part->s.pos, level.time, origin );
BG_EvaluateTrajectory( &part->s.apos, level.time, angles );
VectorSubtract( origin, part->r.currentOrigin, move );
VectorSubtract( angles, part->r.currentAngles, amove );
//if (part->s.eFlags == EF_MOVER_STOP)
// part->s.eFlags &= ~EF_MOVER_BLOCKED;
if ( part->s.eType == ET_BAT && part->model && !G_MoverPush( part, move, amove, &obstacle ) ) {
break;
} else if ( !G_MoverPush( part, move, amove, &obstacle ) ) {
break; // move was blocked
}
}
if ( part ) {
// go back to the previous position
for ( part = ent ; part ; part = part->teamchain ) {
part->s.pos.trTime += level.time - level.previousTime;
part->s.apos.trTime += level.time - level.previousTime;
BG_EvaluateTrajectory( &part->s.pos, level.time, part->r.currentOrigin );
BG_EvaluateTrajectory( &part->s.apos, level.time, part->r.currentAngles );
trap_LinkEntity( part );
}
// if the pusher has a "blocked" function, call it
if ( ent->blocked ) {
ent->blocked( ent, obstacle );
}
return;
}
// the move succeeded
for ( part = ent ; part ; part = part->teamchain ) {
// call the reached function if time is at or past end point
// opening/closing sliding door (or bats)
if ( part->s.pos.trType == TR_LINEAR_STOP ) {
if ( level.time >= part->s.pos.trTime + part->s.pos.trDuration ) {
if ( part->reached ) {
part->reached( part );
}
}
}
//----(SA) removed
// opening or closing rotating door
else if ( part->s.apos.trType == TR_LINEAR_STOP ) {
if ( level.time >= part->s.apos.trTime + part->s.apos.trDuration ) {
if ( part->reached ) {
part->reached( part );
}
}
}
}
}
/*
================
G_RunMover
================
*/
void G_RunMover( gentity_t *ent ) {
// if not a team captain, don't do anything, because
// the captain will handle everything
if ( ent->flags & FL_TEAMSLAVE ) {
// FIXME
// hack to fix problem of tram car slaves being linked
// after being unlinked in G_FindTeams
if ( ent->r.linked && !Q_stricmp( ent->classname, "func_tramcar" ) ) {
trap_UnlinkEntity( ent );
}
// Sigh... need to figure out why re links in
else if ( ent->r.linked && !Q_stricmp( ent->classname, "func_rotating" ) ) {
trap_UnlinkEntity( ent );
}
return;
}
// if stationary at one of the positions, don't move anything
if ( ent->s.pos.trType != TR_STATIONARY || ent->s.apos.trType != TR_STATIONARY ) {
G_MoverTeam( ent );
}
// check think function
G_RunThink( ent );
}
/*
============================================================================
GENERAL MOVERS
Doors, plats, and buttons are all binary (two position) movers
Pos1 is "at rest", pos2 is "activated"
============================================================================
*/
/*
===============
SetMoverState
===============
*/
void SetMoverState( gentity_t *ent, moverState_t moverState, int time ) {
vec3_t delta;
float f;
qboolean kicked = qfalse, soft = qfalse;
kicked = (qboolean)( ent->flags & FL_KICKACTIVATE );
soft = (qboolean)( ent->flags & FL_SOFTACTIVATE ); //----(SA) added
if ( ent->flags & FL_DOORNOISE ) { // this door is always 'regular' open
kicked = qfalse;
soft = qfalse;
}
ent->moverState = moverState;
ent->s.pos.trTime = time;
ent->s.apos.trTime = time;
switch ( moverState ) {
case MOVER_POS1:
VectorCopy( ent->pos1, ent->s.pos.trBase );
ent->s.pos.trType = TR_STATIONARY;
ent->active = qfalse;
break;
case MOVER_POS2:
VectorCopy( ent->pos2, ent->s.pos.trBase );
ent->s.pos.trType = TR_STATIONARY;
break;
// JOSEPH 1-26-00
case MOVER_POS3:
VectorCopy( ent->pos3, ent->s.pos.trBase );
ent->s.pos.trType = TR_STATIONARY;
break;
case MOVER_2TO3:
VectorCopy( ent->pos2, ent->s.pos.trBase );
VectorSubtract( ent->pos3, ent->pos2, delta );
f = 1000.0 / ent->s.pos.trDuration;
VectorScale( delta, f, ent->s.pos.trDelta );
ent->s.pos.trType = TR_LINEAR_STOP;
break;
case MOVER_3TO2:
VectorCopy( ent->pos3, ent->s.pos.trBase );
VectorSubtract( ent->pos2, ent->pos3, delta );
f = 1000.0 / ent->s.pos.trDuration;
VectorScale( delta, f, ent->s.pos.trDelta );
ent->s.pos.trType = TR_LINEAR_STOP;
break;
// END JOSEPH
case MOVER_1TO2: // opening
VectorCopy( ent->pos1, ent->s.pos.trBase );
VectorSubtract( ent->pos2, ent->pos1, delta );
//----(SA) numerous changes start here
ent->s.pos.trDuration = ent->gDuration;
f = 1000.0 / ent->s.pos.trDuration;
VectorScale( delta, f, ent->s.pos.trDelta );
ent->s.pos.trType = TR_LINEAR_STOP;
break;
case MOVER_2TO1: // closing
VectorCopy( ent->pos2, ent->s.pos.trBase );
VectorSubtract( ent->pos1, ent->pos2, delta );
if ( ent->closespeed ) { //----(SA) handle doors with different close speeds
ent->s.pos.trDuration = ent->gDurationBack;
f = 1000.0 / ent->gDurationBack;
} else {
ent->s.pos.trDuration = ent->gDuration;
f = 1000.0 / ent->s.pos.trDuration;
}
VectorScale( delta, f, ent->s.pos.trDelta );
ent->s.pos.trType = TR_LINEAR_STOP;
break;
case MOVER_POS1ROTATE: // at close
VectorCopy( ent->r.currentAngles, ent->s.apos.trBase );
ent->s.apos.trType = TR_STATIONARY;
break;
case MOVER_POS2ROTATE: // at open
VectorCopy( ent->r.currentAngles, ent->s.apos.trBase );
ent->s.apos.trType = TR_STATIONARY;
break;
case MOVER_1TO2ROTATE: // opening
VectorClear( ent->s.apos.trBase ); // set base to start position {0,0,0}
if ( kicked ) {
f = 2000.0 / ent->gDuration; // double speed when kicked open
ent->s.apos.trDuration = ent->gDuration / 2.0;
} else if ( soft ) {
f = 500.0 / ent->gDuration; // 1/2 speed when soft opened
ent->s.apos.trDuration = ent->gDuration * 2;
} else {
f = 1000.0 / ent->gDuration;
// ent->s.apos.trDuration = ent->gDurationBack; // (SA) durationback?
ent->s.apos.trDuration = ent->gDuration;
}
VectorScale( ent->rotate, f * ent->angle, ent->s.apos.trDelta );
ent->s.apos.trType = TR_LINEAR_STOP;
break;
case MOVER_2TO1ROTATE: // closing
VectorScale( ent->rotate, ent->angle, ent->s.apos.trBase ); // set base to end position
// (kicked closes same as normally opened)
// (soft closes at 1/2 speed)
f = 1000.0 / ent->gDuration;
ent->s.apos.trDuration = ent->gDuration;
if ( soft ) {
ent->s.apos.trDuration *= 2;
f *= 0.5f;
}
VectorScale( ent->s.apos.trBase, -f, ent->s.apos.trDelta );
ent->s.apos.trType = TR_LINEAR_STOP;
ent->active = qfalse;
break;
}
BG_EvaluateTrajectory( &ent->s.pos, level.time, ent->r.currentOrigin );
if ( !( ent->r.svFlags & SVF_NOCLIENT ) || ( ent->r.contents ) ) { // RF, added this for bats, but this is safe for all movers, since if they aren't solid, and aren't visible to the client, they don't need to be linked
trap_LinkEntity( ent );
// if this entity is blocking AAS, then update it
if ( ent->AASblocking && ent->s.pos.trType == TR_STATIONARY ) {
// reset old blocking areas
G_SetAASBlockingEntity( ent, qfalse );
// set new areas
G_SetAASBlockingEntity( ent, qtrue );
}
}
}
/*
================
MatchTeam
All entities in a mover team will move from pos1 to pos2
in the same amount of time
================
*/
void MatchTeam( gentity_t *teamLeader, int moverState, int time ) {
gentity_t *slave;
for ( slave = teamLeader ; slave ; slave = slave->teamchain ) {
// pass along flags for how door was activated
if ( teamLeader->flags & FL_KICKACTIVATE ) {
slave->flags |= FL_KICKACTIVATE;
}
if ( teamLeader->flags & FL_SOFTACTIVATE ) {
slave->flags |= FL_SOFTACTIVATE;
}
SetMoverState( slave, moverState, time );
}
}
/*
MatchTeamReverseAngleOnSlaves
the activator was blocking the door so reverse its direction
*/
void MatchTeamReverseAngleOnSlaves( gentity_t *teamLeader, int moverState, int time ) {
gentity_t *slave;
for ( slave = teamLeader ; slave ; slave = slave->teamchain ) {
// reverse open dir for teamLeader and all slaves
slave->angle *= -1;
// pass along flags for how door was activated
if ( teamLeader->flags & FL_KICKACTIVATE ) {
slave->flags |= FL_KICKACTIVATE;
}
if ( teamLeader->flags & FL_SOFTACTIVATE ) {
slave->flags |= FL_SOFTACTIVATE;
}
SetMoverState( slave, moverState, time );
}
}
/*
================
ReturnToPos1
================
*/
void ReturnToPos1( gentity_t *ent ) {
MatchTeam( ent, MOVER_2TO1, level.time );
// play starting sound
G_AddEvent( ent, EV_GENERAL_SOUND, ent->sound2to1 );
ent->s.loopSound = 0;
// set looping sound
ent->s.loopSound = ent->sound3to2;
}
// JOSEPH 1-26-00
/*
================
ReturnToPos2
================
*/
void ReturnToPos2( gentity_t *ent ) {
MatchTeam( ent, MOVER_3TO2, level.time );
ent->s.loopSound = 0;
// looping sound
ent->s.loopSound = ent->soundLoop;
// starting sound
G_AddEvent( ent, EV_GENERAL_SOUND, ent->sound3to2 );
}
/*
================
GotoPos3
================
*/
void GotoPos3( gentity_t *ent ) {
MatchTeam( ent, MOVER_2TO3, level.time );
ent->s.loopSound = 0;
// looping sound
ent->s.loopSound = ent->soundLoop;
// starting sound
G_AddEvent( ent, EV_GENERAL_SOUND, ent->sound2to3 );
}
// END JOSEPH
/*
================
ReturnToPos1Rotate
closing
================
*/
void ReturnToPos1Rotate( gentity_t *ent ) {
qboolean inPVS = qfalse;
gentity_t *player;
MatchTeam( ent, MOVER_2TO1ROTATE, level.time );
player = AICast_FindEntityForName( "player" );
if ( player ) {
inPVS = trap_InPVS( player->r.currentOrigin, ent->r.currentOrigin );
}
// play starting sound
if ( inPVS ) {
// if( (ent->flags & FL_SOFTACTIVATE) &! (ent->flags & FL_DOORNOISE) )
if ( ( ent->flags & FL_SOFTACTIVATE ) && !( ent->flags & FL_DOORNOISE ) ) {
G_AddEvent( ent, EV_GENERAL_SOUND, ent->soundSoftclose );
} else {
G_AddEvent( ent, EV_GENERAL_SOUND, ent->sound2to1 );
}
}
ent->s.loopSound = ent->sound3to2;
}
/*
================
Reached_BinaryMover
================
*/
void Reached_BinaryMover( gentity_t *ent ) {
qboolean kicked = qfalse, soft = qfalse;
// stop the looping sound
ent->s.loopSound = 0;
// ent->s.loopSound = ent->soundLoop;
if ( ent->flags & FL_SOFTACTIVATE ) {
soft = qtrue;
}
if ( ent->flags & FL_KICKACTIVATE ) {
kicked = qtrue;
}
if ( ent->flags & FL_DOORNOISE ) {
kicked = soft = qfalse;
}
if ( ent->moverState == MOVER_1TO2 ) {
// reached pos2
SetMoverState( ent, MOVER_POS2, level.time );
// play sound
if ( soft ) {
G_AddEvent( ent, EV_GENERAL_SOUND, ent->soundSoftendo );
} else {
G_AddEvent( ent, EV_GENERAL_SOUND, ent->soundPos2 );
}
// fire targets
if ( !ent->activator ) {
ent->activator = ent;
}
G_UseTargets( ent, ent->activator );
if ( ent->flags & FL_TOGGLE ) {
ent->active = qfalse; // enable door activation again
ent->think = ReturnToPos1;
ent->nextthink = 0;
return;
}
// JOSEPH 1-27-00
// return to pos1 after a delay
if ( ent->wait != -1000 ) {
ent->think = ReturnToPos1;
ent->nextthink = level.time + ent->wait;
}
// END JOSEPH
} else if ( ent->moverState == MOVER_2TO1 ) {
// reached pos1
SetMoverState( ent, MOVER_POS1, level.time );
// play sound