forked from twhl-community/halflife-updated
-
Notifications
You must be signed in to change notification settings - Fork 1
/
schedule.cpp
1518 lines (1412 loc) · 32.1 KB
/
schedule.cpp
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
/***
*
* Copyright (c) 1996-2001, Valve LLC. All rights reserved.
*
* This product contains software technology licensed from Id
* Software, Inc. ("Id Technology"). Id Technology (c) 1996 Id Software, Inc.
* All Rights Reserved.
*
* This source code contains proprietary and confidential information of
* Valve LLC and its suppliers. Access to this code is restricted to
* persons who have executed a written SDK license with Valve. Any access,
* use or distribution of this code by or to any unlicensed person is illegal.
*
****/
//=========================================================
// schedule.cpp - functions and data pertaining to the
// monsters' AI scheduling system.
//=========================================================
#include "extdll.h"
#include "util.h"
#include "cbase.h"
#include "monsters.h"
#include "animation.h"
#include "scripted.h"
#include "nodes.h"
#include "defaultai.h"
#include "soundent.h"
//=========================================================
// FHaveSchedule - Returns true if monster's m_pSchedule
// is anything other than NULL.
//=========================================================
bool CBaseMonster::FHaveSchedule()
{
if (m_pSchedule == NULL)
{
return false;
}
return true;
}
//=========================================================
// ClearSchedule - blanks out the caller's schedule pointer
// and index.
//=========================================================
void CBaseMonster::ClearSchedule()
{
m_iTaskStatus = TASKSTATUS_NEW;
m_pSchedule = NULL;
m_iScheduleIndex = 0;
}
//=========================================================
// FScheduleDone - Returns true if the caller is on the
// last task in the schedule
//=========================================================
bool CBaseMonster::FScheduleDone()
{
ASSERT(m_pSchedule != NULL);
if (m_iScheduleIndex == m_pSchedule->cTasks)
{
return true;
}
return false;
}
//=========================================================
// ChangeSchedule - replaces the monster's schedule pointer
// with the passed pointer, and sets the ScheduleIndex back
// to 0
//=========================================================
void CBaseMonster::ChangeSchedule(Schedule_t* pNewSchedule)
{
ASSERT(pNewSchedule != NULL);
m_pSchedule = pNewSchedule;
m_iScheduleIndex = 0;
m_iTaskStatus = TASKSTATUS_NEW;
m_afConditions = 0; // clear all of the conditions
m_failSchedule = SCHED_NONE;
if ((m_pSchedule->iInterruptMask & bits_COND_HEAR_SOUND) != 0 && (m_pSchedule->iSoundMask) == 0)
{
ALERT(at_aiconsole, "COND_HEAR_SOUND with no sound mask!\n");
}
else if (0 != m_pSchedule->iSoundMask && (m_pSchedule->iInterruptMask & bits_COND_HEAR_SOUND) == 0)
{
ALERT(at_aiconsole, "Sound mask without COND_HEAR_SOUND!\n");
}
#if _DEBUG
if (!ScheduleFromName(pNewSchedule->pName))
{
ALERT(at_console, "Schedule %s not in table!!!\n", pNewSchedule->pName);
}
#endif
// this is very useful code if you can isolate a test case in a level with a single monster. It will notify
// you of every schedule selection the monster makes.
#if 0
if ( FClassnameIs( pev, "monster_human_grunt" ) )
{
Task_t *pTask = GetTask();
if ( pTask )
{
const char *pName = NULL;
if ( m_pSchedule )
{
pName = m_pSchedule->pName;
}
else
{
pName = "No Schedule";
}
if ( !pName )
{
pName = "Unknown";
}
ALERT( at_aiconsole, "%s: picked schedule %s\n", STRING( pev->classname ), pName );
}
}
#endif // 0
}
//=========================================================
// NextScheduledTask - increments the ScheduleIndex
//=========================================================
void CBaseMonster::NextScheduledTask()
{
ASSERT(m_pSchedule != NULL);
m_iTaskStatus = TASKSTATUS_NEW;
m_iScheduleIndex++;
if (FScheduleDone())
{
// just completed last task in schedule, so make it invalid by clearing it.
SetConditions(bits_COND_SCHEDULE_DONE);
//ClearSchedule();
}
}
//=========================================================
// IScheduleFlags - returns an integer with all Conditions
// bits that are currently set and also set in the current
// schedule's Interrupt mask.
//=========================================================
int CBaseMonster::IScheduleFlags()
{
if (!m_pSchedule)
{
return 0;
}
// strip off all bits excepts the ones capable of breaking this schedule.
return m_afConditions & m_pSchedule->iInterruptMask;
}
//=========================================================
// FScheduleValid - returns true as long as the current
// schedule is still the proper schedule to be executing,
// taking into account all conditions
//=========================================================
bool CBaseMonster::FScheduleValid()
{
if (m_pSchedule == NULL)
{
// schedule is empty, and therefore not valid.
return false;
}
if (HasConditions(m_pSchedule->iInterruptMask | bits_COND_SCHEDULE_DONE | bits_COND_TASK_FAILED))
{
#ifdef DEBUG
if (HasConditions(bits_COND_TASK_FAILED) && m_failSchedule == SCHED_NONE)
{
// fail! Send a visual indicator.
ALERT(at_aiconsole, "Schedule: %s Failed\n", m_pSchedule->pName);
Vector tmp = pev->origin;
tmp.z = pev->absmax.z + 16;
UTIL_Sparks(tmp);
}
#endif // DEBUG
// some condition has interrupted the schedule, or the schedule is done
return false;
}
return true;
}
//=========================================================
// MaintainSchedule - does all the per-think schedule maintenance.
// ensures that the monster leaves this function with a valid
// schedule!
//=========================================================
void CBaseMonster::MaintainSchedule()
{
Schedule_t* pNewSchedule;
int i;
// UNDONE: Tune/fix this 10... This is just here so infinite loops are impossible
for (i = 0; i < 10; i++)
{
if (m_pSchedule != NULL && TaskIsComplete())
{
NextScheduledTask();
}
// validate existing schedule
if (!FScheduleValid() || m_MonsterState != m_IdealMonsterState)
{
// if we come into this block of code, the schedule is going to have to be changed.
// if the previous schedule was interrupted by a condition, GetIdealState will be
// called. Else, a schedule finished normally.
// Notify the monster that his schedule is changing
ScheduleChange();
// Call GetIdealState if we're not dead and one or more of the following...
// - in COMBAT state with no enemy (it died?)
// - conditions bits (excluding SCHEDULE_DONE) indicate interruption,
// - schedule is done but schedule indicates it wants GetIdealState called
// after successful completion (by setting bits_COND_SCHEDULE_DONE in iInterruptMask)
// DEAD & SCRIPT are not suggestions, they are commands!
if (m_IdealMonsterState != MONSTERSTATE_DEAD &&
(m_IdealMonsterState != MONSTERSTATE_SCRIPT || m_IdealMonsterState == m_MonsterState))
{
if ((0 != m_afConditions && !HasConditions(bits_COND_SCHEDULE_DONE)) ||
(m_pSchedule && (m_pSchedule->iInterruptMask & bits_COND_SCHEDULE_DONE) != 0) ||
((m_MonsterState == MONSTERSTATE_COMBAT) && (m_hEnemy == NULL)))
{
GetIdealState();
}
}
if (HasConditions(bits_COND_TASK_FAILED) && m_MonsterState == m_IdealMonsterState)
{
if (m_failSchedule != SCHED_NONE)
pNewSchedule = GetScheduleOfType(m_failSchedule);
else
pNewSchedule = GetScheduleOfType(SCHED_FAIL);
// schedule was invalid because the current task failed to start or complete
ALERT(at_aiconsole, "Schedule Failed at %d!\n", m_iScheduleIndex);
ChangeSchedule(pNewSchedule);
}
else
{
SetState(m_IdealMonsterState);
if (m_MonsterState == MONSTERSTATE_SCRIPT || m_MonsterState == MONSTERSTATE_DEAD)
pNewSchedule = CBaseMonster::GetSchedule();
else
pNewSchedule = GetSchedule();
ChangeSchedule(pNewSchedule);
}
}
if (m_iTaskStatus == TASKSTATUS_NEW)
{
Task_t* pTask = GetTask();
ASSERT(pTask != NULL);
TaskBegin();
StartTask(pTask);
}
// UNDONE: Twice?!!!
if (m_Activity != m_IdealActivity)
{
SetActivity(m_IdealActivity);
}
if (!TaskIsComplete() && m_iTaskStatus != TASKSTATUS_NEW)
break;
}
if (TaskIsRunning())
{
Task_t* pTask = GetTask();
ASSERT(pTask != NULL);
RunTask(pTask);
}
// UNDONE: We have to do this so that we have an animation set to blend to if RunTask changes the animation
// RunTask() will always change animations at the end of a script!
// Don't do this twice
if (m_Activity != m_IdealActivity)
{
SetActivity(m_IdealActivity);
}
}
//=========================================================
// RunTask
//=========================================================
void CBaseMonster::RunTask(Task_t* pTask)
{
switch (pTask->iTask)
{
case TASK_TURN_RIGHT:
case TASK_TURN_LEFT:
{
ChangeYaw(pev->yaw_speed);
if (FacingIdeal())
{
TaskComplete();
}
break;
}
case TASK_PLAY_SEQUENCE_FACE_ENEMY:
case TASK_PLAY_SEQUENCE_FACE_TARGET:
{
CBaseEntity* pTarget;
if (pTask->iTask == TASK_PLAY_SEQUENCE_FACE_TARGET)
pTarget = m_hTargetEnt;
else
pTarget = m_hEnemy;
if (pTarget)
{
pev->ideal_yaw = UTIL_VecToYaw(pTarget->pev->origin - pev->origin);
ChangeYaw(pev->yaw_speed);
}
if (m_fSequenceFinished)
TaskComplete();
}
break;
case TASK_PLAY_SEQUENCE:
case TASK_PLAY_ACTIVE_IDLE:
{
if (m_fSequenceFinished)
{
TaskComplete();
}
break;
}
case TASK_FACE_ENEMY:
{
MakeIdealYaw(m_vecEnemyLKP);
ChangeYaw(pev->yaw_speed);
if (FacingIdeal())
{
TaskComplete();
}
break;
}
case TASK_FACE_HINTNODE:
case TASK_FACE_LASTPOSITION:
case TASK_FACE_TARGET:
case TASK_FACE_IDEAL:
case TASK_FACE_ROUTE:
{
ChangeYaw(pev->yaw_speed);
if (FacingIdeal())
{
TaskComplete();
}
break;
}
case TASK_WAIT_PVS:
{
if (!FNullEnt(FIND_CLIENT_IN_PVS(edict())))
{
TaskComplete();
}
break;
}
case TASK_WAIT_INDEFINITE:
{
// don't do anything.
break;
}
case TASK_WAIT:
case TASK_WAIT_RANDOM:
{
if (gpGlobals->time >= m_flWaitFinished)
{
TaskComplete();
}
break;
}
case TASK_WAIT_FACE_ENEMY:
{
MakeIdealYaw(m_vecEnemyLKP);
ChangeYaw(pev->yaw_speed);
if (gpGlobals->time >= m_flWaitFinished)
{
TaskComplete();
}
break;
}
case TASK_MOVE_TO_TARGET_RANGE:
{
float distance;
if (m_hTargetEnt == NULL)
TaskFail();
else
{
distance = (m_vecMoveGoal - pev->origin).Length2D();
// Re-evaluate when you think your finished, or the target has moved too far
if ((distance < pTask->flData) || (m_vecMoveGoal - m_hTargetEnt->pev->origin).Length() > pTask->flData * 0.5)
{
m_vecMoveGoal = m_hTargetEnt->pev->origin;
distance = (m_vecMoveGoal - pev->origin).Length2D();
FRefreshRoute();
}
// Set the appropriate activity based on an overlapping range
// overlap the range to prevent oscillation
if (distance < pTask->flData)
{
TaskComplete();
RouteClear(); // Stop moving
}
else if (distance < 190 && m_movementActivity != ACT_WALK)
m_movementActivity = ACT_WALK;
else if (distance >= 270 && m_movementActivity != ACT_RUN)
m_movementActivity = ACT_RUN;
}
break;
}
case TASK_WAIT_FOR_MOVEMENT:
{
if (MovementIsComplete())
{
TaskComplete();
RouteClear(); // Stop moving
}
break;
}
case TASK_DIE:
{
if (m_fSequenceFinished && pev->frame >= 255)
{
pev->deadflag = DEAD_DEAD;
SetThink(NULL);
StopAnimation();
if (!BBoxFlat())
{
// a bit of a hack. If a corpses' bbox is positioned such that being left solid so that it can be attacked will
// block the player on a slope or stairs, the corpse is made nonsolid.
// pev->solid = SOLID_NOT;
UTIL_SetSize(pev, Vector(-4, -4, 0), Vector(4, 4, 1));
}
else // !!!HACKHACK - put monster in a thin, wide bounding box until we fix the solid type/bounding volume problem
UTIL_SetSize(pev, Vector(pev->mins.x, pev->mins.y, pev->mins.z), Vector(pev->maxs.x, pev->maxs.y, pev->mins.z + 1));
if (ShouldFadeOnDeath())
{
// this monster was created by a monstermaker... fade the corpse out.
SUB_StartFadeOut();
}
else
{
// body is gonna be around for a while, so have it stink for a bit.
CSoundEnt::InsertSound(bits_SOUND_CARCASS, pev->origin, 384, 30);
}
}
break;
}
case TASK_RANGE_ATTACK1_NOTURN:
case TASK_MELEE_ATTACK1_NOTURN:
case TASK_MELEE_ATTACK2_NOTURN:
case TASK_RANGE_ATTACK2_NOTURN:
case TASK_RELOAD_NOTURN:
{
if (m_fSequenceFinished)
{
m_Activity = ACT_RESET;
TaskComplete();
}
break;
}
case TASK_RANGE_ATTACK1:
case TASK_MELEE_ATTACK1:
case TASK_MELEE_ATTACK2:
case TASK_RANGE_ATTACK2:
case TASK_SPECIAL_ATTACK1:
case TASK_SPECIAL_ATTACK2:
case TASK_RELOAD:
{
MakeIdealYaw(m_vecEnemyLKP);
ChangeYaw(pev->yaw_speed);
if (m_fSequenceFinished)
{
m_Activity = ACT_RESET;
TaskComplete();
}
break;
}
case TASK_SMALL_FLINCH:
{
if (m_fSequenceFinished)
{
TaskComplete();
}
}
break;
case TASK_WAIT_FOR_SCRIPT:
{
if (m_pCine->m_iDelay <= 0 && gpGlobals->time >= m_pCine->m_startTime)
{
TaskComplete();
m_pCine->StartSequence((CBaseMonster*)this, m_pCine->m_iszPlay, true);
if (m_fSequenceFinished)
ClearSchedule();
pev->framerate = 1.0;
//ALERT( at_aiconsole, "Script %s has begun for %s\n", STRING( m_pCine->m_iszPlay ), STRING(pev->classname) );
}
break;
}
case TASK_PLAY_SCRIPT:
{
if (m_fSequenceFinished)
{
m_pCine->SequenceDone(this);
}
break;
}
}
}
//=========================================================
// SetTurnActivity - measures the difference between the way
// the monster is facing and determines whether or not to
// select one of the 180 turn animations.
//=========================================================
void CBaseMonster::SetTurnActivity()
{
float flYD;
flYD = FlYawDiff();
if (flYD <= -45 && LookupActivity(ACT_TURN_RIGHT) != ACTIVITY_NOT_AVAILABLE)
{ // big right turn
m_IdealActivity = ACT_TURN_RIGHT;
}
else if (flYD > 45 && LookupActivity(ACT_TURN_LEFT) != ACTIVITY_NOT_AVAILABLE)
{ // big left turn
m_IdealActivity = ACT_TURN_LEFT;
}
}
//=========================================================
// Start task - selects the correct activity and performs
// any necessary calculations to start the next task on the
// schedule.
//=========================================================
void CBaseMonster::StartTask(Task_t* pTask)
{
switch (pTask->iTask)
{
case TASK_TURN_RIGHT:
{
float flCurrentYaw;
flCurrentYaw = UTIL_AngleMod(pev->angles.y);
pev->ideal_yaw = UTIL_AngleMod(flCurrentYaw - pTask->flData);
SetTurnActivity();
break;
}
case TASK_TURN_LEFT:
{
float flCurrentYaw;
flCurrentYaw = UTIL_AngleMod(pev->angles.y);
pev->ideal_yaw = UTIL_AngleMod(flCurrentYaw + pTask->flData);
SetTurnActivity();
break;
}
case TASK_REMEMBER:
{
Remember((int)pTask->flData);
TaskComplete();
break;
}
case TASK_FORGET:
{
Forget((int)pTask->flData);
TaskComplete();
break;
}
case TASK_FIND_HINTNODE:
{
m_iHintNode = FindHintNode();
if (m_iHintNode != NO_NODE)
{
TaskComplete();
}
else
{
TaskFail();
}
break;
}
case TASK_STORE_LASTPOSITION:
{
m_vecLastPosition = pev->origin;
TaskComplete();
break;
}
case TASK_CLEAR_LASTPOSITION:
{
m_vecLastPosition = g_vecZero;
TaskComplete();
break;
}
case TASK_CLEAR_HINTNODE:
{
m_iHintNode = NO_NODE;
TaskComplete();
break;
}
case TASK_STOP_MOVING:
{
if (m_IdealActivity == m_movementActivity)
{
m_IdealActivity = GetStoppedActivity();
}
RouteClear();
TaskComplete();
break;
}
case TASK_PLAY_SEQUENCE_FACE_ENEMY:
case TASK_PLAY_SEQUENCE_FACE_TARGET:
case TASK_PLAY_SEQUENCE:
{
m_IdealActivity = (Activity)(int)pTask->flData;
break;
}
case TASK_PLAY_ACTIVE_IDLE:
{
// monsters verify that they have a sequence for the node's activity BEFORE
// moving towards the node, so it's ok to just set the activity without checking here.
m_IdealActivity = (Activity)WorldGraph.m_pNodes[m_iHintNode].m_sHintActivity;
break;
}
case TASK_SET_SCHEDULE:
{
Schedule_t* pNewSchedule;
pNewSchedule = GetScheduleOfType((int)pTask->flData);
if (pNewSchedule)
{
ChangeSchedule(pNewSchedule);
}
else
{
TaskFail();
}
break;
}
case TASK_FIND_NEAR_NODE_COVER_FROM_ENEMY:
{
if (m_hEnemy == NULL)
{
TaskFail();
return;
}
if (FindCover(m_hEnemy->pev->origin, m_hEnemy->pev->view_ofs, 0, pTask->flData))
{
// try for cover farther than the FLData from the schedule.
TaskComplete();
}
else
{
// no coverwhatsoever.
TaskFail();
}
break;
}
case TASK_FIND_FAR_NODE_COVER_FROM_ENEMY:
{
if (m_hEnemy == NULL)
{
TaskFail();
return;
}
if (FindCover(m_hEnemy->pev->origin, m_hEnemy->pev->view_ofs, pTask->flData, CoverRadius()))
{
// try for cover farther than the FLData from the schedule.
TaskComplete();
}
else
{
// no coverwhatsoever.
TaskFail();
}
break;
}
case TASK_FIND_NODE_COVER_FROM_ENEMY:
{
if (m_hEnemy == NULL)
{
TaskFail();
return;
}
if (FindCover(m_hEnemy->pev->origin, m_hEnemy->pev->view_ofs, 0, CoverRadius()))
{
// try for cover farther than the FLData from the schedule.
TaskComplete();
}
else
{
// no coverwhatsoever.
TaskFail();
}
break;
}
case TASK_FIND_COVER_FROM_ENEMY:
{
entvars_t* pevCover;
if (m_hEnemy == NULL)
{
// Find cover from self if no enemy available
pevCover = pev;
// TaskFail();
// return;
}
else
pevCover = m_hEnemy->pev;
if (FindLateralCover(pevCover->origin, pevCover->view_ofs))
{
// try lateral first
m_flMoveWaitFinished = gpGlobals->time + pTask->flData;
TaskComplete();
}
else if (FindCover(pevCover->origin, pevCover->view_ofs, 0, CoverRadius()))
{
// then try for plain ole cover
m_flMoveWaitFinished = gpGlobals->time + pTask->flData;
TaskComplete();
}
else
{
// no coverwhatsoever.
TaskFail();
}
break;
}
case TASK_FIND_COVER_FROM_ORIGIN:
{
if (FindCover(pev->origin, pev->view_ofs, 0, CoverRadius()))
{
// then try for plain ole cover
m_flMoveWaitFinished = gpGlobals->time + pTask->flData;
TaskComplete();
}
else
{
// no cover!
TaskFail();
}
}
break;
case TASK_FIND_COVER_FROM_BEST_SOUND:
{
CSound* pBestSound;
pBestSound = PBestSound();
ASSERT(pBestSound != NULL);
/*
if ( pBestSound && FindLateralCover( pBestSound->m_vecOrigin, g_vecZero ) )
{
// try lateral first
m_flMoveWaitFinished = gpGlobals->time + pTask->flData;
TaskComplete();
}
*/
if (pBestSound)
{
if (FindCover(pBestSound->m_vecOrigin, g_vecZero, pBestSound->m_iVolume, CoverRadius()))
{
// then try for plain ole cover
m_flMoveWaitFinished = gpGlobals->time + pTask->flData;
TaskComplete();
}
else if (FindRetreat(pBestSound->m_vecOrigin, pBestSound->m_iVolume, CoverRadius()))
{
m_flMoveWaitFinished = gpGlobals->time + pTask->flData;
TaskComplete();
}
}
// no coverwhatsoever. or no sound in list
if (!TaskIsComplete()) {
TaskFail();
}
break;
}
case TASK_FACE_HINTNODE:
{
pev->ideal_yaw = WorldGraph.m_pNodes[m_iHintNode].m_flHintYaw;
SetTurnActivity();
break;
}
case TASK_FACE_LASTPOSITION:
MakeIdealYaw(m_vecLastPosition);
SetTurnActivity();
break;
case TASK_FACE_TARGET:
if (m_hTargetEnt != NULL)
{
MakeIdealYaw(m_hTargetEnt->pev->origin);
SetTurnActivity();
}
else
TaskFail();
break;
case TASK_FACE_ENEMY:
{
MakeIdealYaw(m_vecEnemyLKP);
SetTurnActivity();
break;
}
case TASK_FACE_IDEAL:
{
SetTurnActivity();
break;
}
case TASK_FACE_ROUTE:
{
if (FRouteClear())
{
ALERT(at_aiconsole, "No route to face!\n");
TaskFail();
}
else
{
MakeIdealYaw(m_Route[m_iRouteIndex].vecLocation);
SetTurnActivity();
}
break;
}
case TASK_WAIT_PVS:
case TASK_WAIT_INDEFINITE:
{
// don't do anything.
break;
}
case TASK_WAIT:
case TASK_WAIT_FACE_ENEMY:
{ // set a future time that tells us when the wait is over.
m_flWaitFinished = gpGlobals->time + pTask->flData;
break;
}
case TASK_WAIT_RANDOM:
{ // set a future time that tells us when the wait is over.
m_flWaitFinished = gpGlobals->time + RANDOM_FLOAT(0.1, pTask->flData);
break;
}
case TASK_MOVE_TO_TARGET_RANGE:
{
if ((m_hTargetEnt->pev->origin - pev->origin).Length() < 1)
TaskComplete();
else
{
m_vecMoveGoal = m_hTargetEnt->pev->origin;
if (!MoveToTarget(ACT_WALK, 2))
TaskFail();
}
break;
}
case TASK_RUN_TO_TARGET:
case TASK_WALK_TO_TARGET:
{
Activity newActivity;
if ((m_hTargetEnt->pev->origin - pev->origin).Length() < 1)
TaskComplete();
else
{
if (pTask->iTask == TASK_WALK_TO_TARGET)
newActivity = ACT_WALK;
else
newActivity = ACT_RUN;
// This monster can't do this!
if (LookupActivity(newActivity) == ACTIVITY_NOT_AVAILABLE)
TaskComplete();
else
{
if (m_hTargetEnt == NULL || !MoveToTarget(newActivity, 2))
{
TaskFail();
ALERT(at_aiconsole, "%s Failed to reach target!!!\n", STRING(pev->classname));
RouteClear();
}
}
}
TaskComplete();
break;
}
case TASK_CLEAR_MOVE_WAIT:
{
m_flMoveWaitFinished = gpGlobals->time;
TaskComplete();
break;
}
case TASK_MELEE_ATTACK1_NOTURN:
case TASK_MELEE_ATTACK1:
{
m_IdealActivity = ACT_MELEE_ATTACK1;
break;
}
case TASK_MELEE_ATTACK2_NOTURN:
case TASK_MELEE_ATTACK2:
{
m_IdealActivity = ACT_MELEE_ATTACK2;
break;
}
case TASK_RANGE_ATTACK1_NOTURN:
case TASK_RANGE_ATTACK1:
{
m_IdealActivity = ACT_RANGE_ATTACK1;
break;
}
case TASK_RANGE_ATTACK2_NOTURN:
case TASK_RANGE_ATTACK2:
{
m_IdealActivity = ACT_RANGE_ATTACK2;
break;
}
case TASK_RELOAD_NOTURN:
case TASK_RELOAD:
{
m_IdealActivity = ACT_RELOAD;
break;
}
case TASK_SPECIAL_ATTACK1:
{
m_IdealActivity = ACT_SPECIAL_ATTACK1;
break;
}
case TASK_SPECIAL_ATTACK2:
{
m_IdealActivity = ACT_SPECIAL_ATTACK2;
break;
}
case TASK_SET_ACTIVITY:
{
m_IdealActivity = (Activity)(int)pTask->flData;
TaskComplete();
break;
}
case TASK_GET_PATH_TO_ENEMY_LKP:
{
if (BuildRoute(m_vecEnemyLKP, bits_MF_TO_LOCATION, NULL))
{
TaskComplete();
}
else if (BuildNearestRoute(m_vecEnemyLKP, pev->view_ofs, 0, (m_vecEnemyLKP - pev->origin).Length()))
{
TaskComplete();
}
else
{
// no way to get there =(
ALERT(at_aiconsole, "GetPathToEnemyLKP failed!!\n");
TaskFail();
}
break;
}
case TASK_GET_PATH_TO_ENEMY:
{
CBaseEntity* pEnemy = m_hEnemy;
if (pEnemy == NULL)
{
TaskFail();