Games/Doom/p_tick.c

   1 // Emacs style mode select   -*- C++ -*-
   2 //-----------------------------------------------------------------------------
   3 //
   4 // $Id$
   5 //
   6 // Copyright (C) 1993-1996 by id Software, Inc.
   7 //
   8 // This source is available for distribution and/or modification
   9 // only under the terms of the DOOM Source Code License as
  10 // published by id Software. All rights reserved.
  11 //
  12 // The source is distributed in the hope that it will be useful,
  13 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  14 // FITNESS FOR A PARTICULAR PURPOSE. See the DOOM Source Code License
  15 // for more details.
  16 //
  17 // $Log$
  18 // Revision 1.1  2000/02/29 18:21:05  stegerg
  19 // Doom port based on ADoomPPC. Read README.AROS!
  20 //
  21 //
  22 // DESCRIPTION:
  23 //      Archiving: SaveGame I/O.
  24 //      Thinker, Ticker.
  25 //
  26 //-----------------------------------------------------------------------------
  27
  28 static const char
  29 rcsid[] = "$Id$";
  30
  31 #include "z_zone.h"
  32 #include "p_local.h"
  33
  34 #include "doomstat.h"
  35
  36
  37 int     leveltime;
  38
  39 //
  40 // THINKERS
  41 // All thinkers should be allocated by Z_Malloc
  42 // so they can be operated on uniformly.
  43 // The actual structures will vary in size,
  44 // but the first element must be thinker_t.
  45 //
  46
  47
  48
  49 // Both the head and tail of the thinker list.
  50 thinker_t       thinkercap;
  51
  52
  53 //
  54 // P_InitThinkers
  55 //
  56 void P_InitThinkers (void)
  57 {
  58     thinkercap.prev = thinkercap.next  = &thinkercap;
  59 }
  60
  61
  62
  63
  64 //
  65 // P_AddThinker
  66 // Adds a new thinker at the end of the list.
  67 //
  68 void P_AddThinker (thinker_t* thinker)
  69 {
  70     thinkercap.prev->next = thinker;
  71     thinker->next = &thinkercap;
  72     thinker->prev = thinkercap.prev;
  73     thinkercap.prev = thinker;
  74 }
  75
  76
  77
  78 //
  79 // P_RemoveThinker
  80 // Deallocation is lazy -- it will not actually be freed
  81 // until its thinking turn comes up.
  82 //
  83 void P_RemoveThinker (thinker_t* thinker)
  84 {
  85   // FIXME: NOP.
  86   thinker->function.acv = (actionf_v)(-1);
  87 }
  88
  89
  90
  91 //
  92 // P_AllocateThinker
  93 // Allocates memory and adds a new thinker at the end of the list.
  94 //
  95 void P_AllocateThinker (thinker_t*      thinker)
  96 {
  97 }
  98
  99
 100
 101 //
 102 // P_RunThinkers
 103 //
 104 void P_RunThinkers (void)
 105 {
 106     thinker_t*  currentthinker;
 107
 108     currentthinker = thinkercap.next;
 109     while (currentthinker != &thinkercap)
 110     {
 111         if ( currentthinker->function.acv == (actionf_v)(-1) )
 112         {
 113             // time to remove it
 114             currentthinker->next->prev = currentthinker->prev;
 115             currentthinker->prev->next = currentthinker->next;
 116             Z_Free (currentthinker);
 117         }
 118         else
 119         {
 120             if (currentthinker->function.acp1)
 121                 currentthinker->function.acp1 (currentthinker);
 122         }
 123         currentthinker = currentthinker->next;
 124     }
 125 }
 126
 127
 128
 129 //
 130 // P_Ticker
 131 //
 132
 133 void P_Ticker (void)
 134 {
 135     int         i;
 136
 137     // run the tic
 138     if (paused)
 139         return;
 140     // pause if in menu and at least one tic has been run
 141     if ( !netgame
 142          && menuactive
 143          && !demoplayback
 144          && players[consoleplayer].viewz != 1)
 145     {
 146         return;
 147     }
 148
 149
 150     for (i=0 ; i<MAXPLAYERS ; i++)
 151         if (playeringame[i])
 152         {
 153             P_PlayerThink (&players[i]);
 154         }
 155
 156     P_RunThinkers ();
 157     P_UpdateSpecials ();
 158     P_RespawnSpecials ();
 159
 160     // for par times
 161     leveltime++;
 162 }