blob: 323cc1e6af384e897e013fec3531c54f68e8bce0 (
plain)
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
|
//
// Copyright(C) 1993-1996 Id Software, Inc.
// Copyright(C) 1993-2008 Raven Software
// Copyright(C) 2005-2014 Simon Howard
//
// 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.
//
// P_tick.c
#include "doomdef.h"
#include "i_system.h"
#include "p_local.h"
#include "v_video.h"
int leveltime;
int TimerGame;
/*
===============================================================================
THINKERS
All thinkers should be allocated by Z_Malloc so they can be operated on uniformly. The actual
structures will vary in size, but the first element must be thinker_t.
===============================================================================
*/
thinker_t thinkercap; // both the head and tail of the thinker list
/*
===============
=
= P_InitThinkers
=
===============
*/
void P_InitThinkers(void)
{
thinkercap.prev = thinkercap.next = &thinkercap;
}
/*
===============
=
= P_AddThinker
=
= Adds a new thinker at the end of the list
=
===============
*/
void P_AddThinker(thinker_t * thinker)
{
thinkercap.prev->next = thinker;
thinker->next = &thinkercap;
thinker->prev = thinkercap.prev;
thinkercap.prev = thinker;
}
/*
===============
=
= P_RemoveThinker
=
= Deallocation is lazy -- it will not actually be freed until its
= thinking turn comes up
=
===============
*/
void P_RemoveThinker(thinker_t * thinker)
{
thinker->function = (think_t) - 1;
}
/*
===============
=
= P_AllocateThinker
=
= Allocates memory and adds a new thinker at the end of the list
=
===============
*/
void P_AllocateThinker(thinker_t * thinker)
{
}
/*
===============
=
= P_RunThinkers
=
===============
*/
void P_RunThinkers(void)
{
thinker_t *currentthinker, *nextthinker;
currentthinker = thinkercap.next;
while (currentthinker != &thinkercap)
{
nextthinker = currentthinker->next;
if (currentthinker->function == (think_t) - 1)
{ // time to remove it
currentthinker->next->prev = currentthinker->prev;
currentthinker->prev->next = currentthinker->next;
Z_Free(currentthinker);
}
else
{
if (currentthinker->function)
currentthinker->function(currentthinker);
}
currentthinker = nextthinker;
}
}
//----------------------------------------------------------------------------
//
// PROC P_Ticker
//
//----------------------------------------------------------------------------
void P_Ticker(void)
{
int i;
if (paused)
{
return;
}
for (i = 0; i < MAXPLAYERS; i++)
{
if (playeringame[i])
{
P_PlayerThink(&players[i]);
}
}
if (TimerGame)
{
if (!--TimerGame)
{
G_ExitLevel();
}
}
P_RunThinkers();
P_UpdateSpecials();
P_AmbientSound();
leveltime++;
}
|
