server/server/main.C

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 * 
 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
 * Copyright (©) 1992,2007 Frank Tore Johansen
 * 
 * Deliantra is free software: you can redistribute it and/or modify it under
 * the terms of the Affero GNU General Public License as published by the
 * Free Software Foundation, either version 3 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.
 * 
 * You should have received a copy of the Affero GNU General Public License
 * and the GNU General Public License along with this program. If not, see
 * <http://www.gnu.org/licenses/>.
 * 
 * The authors can be reached via e-mail to <support@deliantra.net>
 */

#include <global.h>
#include <object.h>
#include <tod.h>

#include <sproto.h>
#include <time.h>

#include <glib.h>

#include <../random_maps/random_map.h>
#include <../random_maps/rproto.h>
#include "path.h"

void
version (object *op)
{
  new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra v%s", VERSION);
}

/* This is a basic little function to put the player back to his
 * savebed.  We do some error checking - its possible that the
 * savebed map may no longer exist, so we make sure the player
 * goes someplace.
 */
void
enter_player_savebed (object *op)
{
  op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y);
}

/*
 * enter_map():  Moves the player and pets from current map (if any) to
 * new map.  map, x, y must be set.  map is the map we are moving the
 * player to - it could be the map he just came from if the load failed for
 * whatever reason.  If default map coordinates are to be used, then
 * the function that calls this should figure them out.
 */
void
object::enter_map (maptile *newmap, int x, int y)
{
  if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE)
    return;

  if (out_of_map (newmap, x, y))
    {
      LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y);
      x = newmap->enter_x;
      y = newmap->enter_y;
      if (out_of_map (newmap, x, y))
        {
          LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n",
               &newmap->path, x, y, newmap->width, newmap->height);
          new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed");
          return;
        }
    }

  if (contr && map != newmap && map)
    if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
      return;

  // remove, so stupid ob_locked does not trigger a failure
  remove ();

  /* try to find a spot for the player */
  if (blocked (newmap, x, y))
    {                           /* First choice blocked */
      /* We try to find a spot for the player, starting closest in.
       * We could use find_first_free_spot, but that doesn't randomize it at all,
       * So for example, if the north space is free, you would always end up there even
       * if other spaces around are available.
       * Note that for the second and third calls, we could start at a position other
       * than one, but then we could end up on the other side of walls and so forth.
       */
      int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1);

      if (i == -1)
        {
          i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1);
          if (i == -1)
            i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE);
        }

      if (i != -1)
        {
          x += freearr_x[i];
          y += freearr_y[i];
        }
      else
        /* not much we can do in this case. */
        LOG (llevInfo, "enter_map: Could not find free spot for player - will dump on top of object (%s: %d, %d)\n", &newmap->path, x, y);
    }

  if (contr && map != newmap)
    {
      if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y)))
        return;

      if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y)))
        return;
    }

  this->x = x;
  this->y = y;
  map = newmap;

  insert_ob_in_map (this, map, 0, INS_NO_WALK_ON);

  enemy = 0;

  if (contr)
    {
      contr->maplevel = newmap->path;
      contr->count = 0;
    }

  /* Update any golems */
  if (type == PLAYER)
    if (object *golem = contr->golem)
      {
        int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);

        if (i < 0)
          golem->drop_and_destroy ();
        else
          {
            newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]);
            golem->direction = find_dir_2 (x - golem->x, y - golem->y);
          }
      }

  /* since the players map is already loaded, we don't need to worry
   * about pending objects.
   */
  remove_all_pets (newmap);
}

/* process_players1 and process_players2 do all the player related stuff.
 * I moved it out of process events and process_map.  This was to some
 * extent for debugging as well as to get a better idea of the time used
 * by the various functions.  process_players1() does the processing before
 * objects have been updated, process_players2() does the processing that
 * is needed after the players have been updated.
 */
static void
process_players1 ()
{
  /* Basically, we keep looping until all the players have done their actions. */
  for (int flag = 1; flag != 0;)
    {
      flag = 0;
      for_all_players (pl)
        {
          pl->refcnt_chk ();

          if (expect_false (!pl->ob || !pl->ns || !pl->ob->active))
            continue;

          if (handle_newcs_player (pl->ob))
            flag = 1;
        }
    }

  for_all_players (pl)
    {
      object *ob = pl->ob;

      // process_objects destroys the speed_left value
      pl->speed_left_save = ob->speed_left;

      if (expect_false (!ob || !pl->ns || !ob->active))
        continue;

      do_some_living (ob);
    }
}

static void
process_players2 ()
{
  /* Then check if any players should use weapon-speed instead of speed */
  for_all_players (pl)
    {
      // restore speed_left value saved by process_players1
      pl->ob->speed_left = pl->speed_left_save;

      pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp);
      pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
    }
}

static void
process_events ()
{
  process_players1 ();

  for_all_actives (op)
    {
      // try to prefetch some stuff we expect to need
      // obviously, it should be grouped into the same cacheline.
      // preliminary results indicate that this gives halves the speed
      // used for the inner loop
      if (_i < actives.size ()) // HACK, rely on _i :/
        {
          object *next = actives [_i + 1];

          prefetch (&next->flag      , 0, 1);
          prefetch (&next->speed     , 0, 1);
          prefetch (&next->anim_speed, 0, 1);
          prefetch (&next->contr     , 0, 1);
        }

      /* Now process op */
      if (expect_false (QUERY_FLAG (op, FLAG_FREED)))
        {
          LOG (llevError, "BUG: process_events(): Free object on list\n");
          op->set_speed (0);
          continue;
        }

      if (expect_false (!op->has_active_speed ()))
        {
          LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), "
                          "but is on active list\n", op->debug_desc (), op->speed);
          op->set_speed (0);
          continue;
        }

      if (expect_false (op->flag [FLAG_REMOVED]))
        {
          LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n",
               op->debug_desc ());
          op->set_speed (0);
          continue;
        }

      /* Animate the object. Bug or feature that anim_speed
       * is based on ticks, and not the creatures speed?
       */
      if (op->anim_speed && op->last_anim >= op->anim_speed)
        {
          animate_object (op, op->contr ? op->facing : op->direction);
          op->last_anim = 1;
        }
      else
        ++op->last_anim;

      if (expect_false (op->speed_left > 0.f))
        {
          --op->speed_left;
          process_object (op);
        }

      // this will destroy the speed_left value for players, but
      // process_players1 and ..2 save/restore the real value,
      // so we can avoid a costly test here.
      op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed));
    }

  process_players2 ();
}

/* clean up everything before exiting */
void
emergency_save ()
{
  LOG (llevDebug, "emergency save begin.\n");

  cfperl_emergency_save ();

  LOG (llevDebug, "saving book archive.\n");
  write_book_archive ();

  LOG (llevDebug, "emergency save done.\n");
}

// send all clients some informational text
static void
cleanup_inform (const char *cause, bool make_core)
{
  int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN);

  new_draw_info_format (flags, 0, 0, "The server will now shutdown.");
  new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause);

  if (make_core)
    new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.");
  else
    new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now.");

  new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE);

  client::flush_sockets ();
}

/* clean up everything before exiting */
void
cleanup (const char *cause, bool make_core)
{
  if (make_core)
    fork_abort (cause);

  LOG (llevError, "cleanup cause: %s\n", cause);

  if (!make_core)
    cleanup_inform (cause, make_core);

  LOG (llevDebug, "cleanup begin.\n");

  if (init_done && !in_cleanup)
    {
      in_cleanup = true;
      emergency_save ();
    }
  else
    in_cleanup = true;

  LOG (llevDebug, "running cleanup handlers.\n");
  INVOKE_GLOBAL (CLEANUP);

  LOG (llevDebug, "cleanup done.\n");

  log_cleanup ();

  if (make_core)
    cleanup_inform (cause, make_core);
  else
    {
      new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.");
      new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE);
      client::flush_sockets ();
    }

  cfperl_cleanup (make_core);
  _exit (make_core);
}

/*
 * do_specials() is a collection of functions to call from time to time.
 * Modified 2000-1-14 MSW to use the global pticks count to determine how
 * often to do things.  This will allow us to spred them out more often.
 * I use prime numbers for the factor count - in that way, it is less likely
 * these actions will fall on the same tick (compared to say using 500/2500/15000
 * which would mean on that 15,000 tick count a whole bunch of stuff gets
 * done).  Of course, there can still be times where multiple specials are
 * done on the same tick, but that will happen very infrequently
 *
 * I also think this code makes it easier to see how often we really are
 * doing the various things.
 */
static void
do_specials (void)
{
  shstr::gc ();
  archetype::gc ();

  if (expect_false (!(pticks % TICKS_PER_HOUR)))
    maptile::adjust_daylight ();

  if (expect_false (!(pticks % 2503)))
    fix_weight ();              /* Hack to fix weightproblems caused by bugs */

  if (expect_false (!(pticks % 5003)))
    write_book_archive ();

  if (expect_false (!(pticks % 5009)))
    clean_friendly_list ();

  if (expect_false (!(pticks % 5011)))
    obsolete_parties ();

  if (expect_false (!(pticks % 12503)))
    fix_luck ();
}

void
server_tick ()
{
  // first do the user visible stuff
  INVOKE_GLOBAL (CLOCK);
  process_events (); // "do" something with objects with speed
  client::clock ();  // draw client maps etc.

  // then do some bookkeeping, should not really be here
  do_specials ();               /* Routines called from time to time. */
  attachable::check_mortals ();

  ++pticks;
}

// normal main
int
main (int argc, char **argv)
{
  settings.argc = argc;
  settings.argv = argv;
  
  rndm.seed (time (0));
  g_thread_init (0); // for the slice allocator only

  init (argc, argv);

  for (;;)
    cfperl_main ();
}

Revision:	1.144
Committed:	Thu Nov 19 04:30:46 2009 UTC (14 years, 6 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.143:	+24 -2 lines
Log Message:	* empty log message *
#	Content
1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*
4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*
8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* the terms of the Affero GNU General Public License as published by the
10	* Free Software Foundation, either version 3 of the License, or (at your
11	* option) any later version.
12	*
13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.
17	*
18	* You should have received a copy of the Affero GNU General Public License
19	* and the GNU General Public License along with this program. If not, see
20	* <http://www.gnu.org/licenses/>.
21	*
22	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/
24
25	#include <global.h>
26	#include <object.h>
27	#include <tod.h>
28
29	#include <sproto.h>
30	#include <time.h>
31
32	#include <glib.h>
33
34	#include <../random_maps/random_map.h>
35	#include <../random_maps/rproto.h>
36	#include "path.h"
37
38	void
39	version (object *op)
40	{
41	new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra v%s", VERSION);
42	}
43
44	/* This is a basic little function to put the player back to his
45	* savebed. We do some error checking - its possible that the
46	* savebed map may no longer exist, so we make sure the player
47	* goes someplace.
48	*/
49	void
50	enter_player_savebed (object *op)
51	{
52	op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y);
53	}
54
55	/*
56	* enter_map(): Moves the player and pets from current map (if any) to
57	* new map. map, x, y must be set. map is the map we are moving the
58	* player to - it could be the map he just came from if the load failed for
59	* whatever reason. If default map coordinates are to be used, then
60	* the function that calls this should figure them out.
61	*/
62	void
63	object::enter_map (maptile *newmap, int x, int y)
64	{
65	if (destroyed () \|\| !newmap \|\| newmap->in_memory != MAP_ACTIVE)
66	return;
67
68	if (out_of_map (newmap, x, y))
69	{
70	LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y);
71	x = newmap->enter_x;
72	y = newmap->enter_y;
73	if (out_of_map (newmap, x, y))
74	{
75	LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n",
76	&newmap->path, x, y, newmap->width, newmap->height);
77	new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed");
78	return;
79	}
80	}
81
82	if (contr && map != newmap && map)
83	if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
84	return;
85
86	// remove, so stupid ob_locked does not trigger a failure
87	remove ();
88
89	/* try to find a spot for the player */
90	if (blocked (newmap, x, y))
91	{ /* First choice blocked */
92	/* We try to find a spot for the player, starting closest in.
93	* We could use find_first_free_spot, but that doesn't randomize it at all,
94	* So for example, if the north space is free, you would always end up there even
95	* if other spaces around are available.
96	* Note that for the second and third calls, we could start at a position other
97	* than one, but then we could end up on the other side of walls and so forth.
98	*/
99	int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1);
100
101	if (i == -1)
102	{
103	i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1);
104	if (i == -1)
105	i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE);
106	}
107
108	if (i != -1)
109	{
110	x += freearr_x[i];
111	y += freearr_y[i];
112	}
113	else
114	/* not much we can do in this case. */
115	LOG (llevInfo, "enter_map: Could not find free spot for player - will dump on top of object (%s: %d, %d)\n", &newmap->path, x, y);
116	}
117
118	if (contr && map != newmap)
119	{
120	if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y)))
121	return;
122
123	if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y)))
124	return;
125	}
126
127	this->x = x;
128	this->y = y;
129	map = newmap;
130
131	insert_ob_in_map (this, map, 0, INS_NO_WALK_ON);
132
133	enemy = 0;
134
135	if (contr)
136	{
137	contr->maplevel = newmap->path;
138	contr->count = 0;
139	}
140
141	/* Update any golems */
142	if (type == PLAYER)
143	if (object *golem = contr->golem)
144	{
145	int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);
146
147	if (i < 0)
148	golem->drop_and_destroy ();
149	else
150	{
151	newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]);
152	golem->direction = find_dir_2 (x - golem->x, y - golem->y);
153	}
154	}
155
156	/* since the players map is already loaded, we don't need to worry
157	* about pending objects.
158	*/
159	remove_all_pets (newmap);
160	}
161
162	/* process_players1 and process_players2 do all the player related stuff.
163	* I moved it out of process events and process_map. This was to some
164	* extent for debugging as well as to get a better idea of the time used
165	* by the various functions. process_players1() does the processing before
166	* objects have been updated, process_players2() does the processing that
167	* is needed after the players have been updated.
168	*/
169	static void
170	process_players1 ()
171	{
172	/* Basically, we keep looping until all the players have done their actions. */
173	for (int flag = 1; flag != 0;)
174	{
175	flag = 0;
176	for_all_players (pl)
177	{
178	pl->refcnt_chk ();
179
180	if (expect_false (!pl->ob \|\| !pl->ns \|\| !pl->ob->active))
181	continue;
182
183	if (handle_newcs_player (pl->ob))
184	flag = 1;
185	}
186	}
187
188	for_all_players (pl)
189	{
190	object *ob = pl->ob;
191
192	// process_objects destroys the speed_left value
193	pl->speed_left_save = ob->speed_left;
194
195	if (expect_false (!ob \|\| !pl->ns \|\| !ob->active))
196	continue;
197
198	do_some_living (ob);
199	}
200	}
201
202	static void
203	process_players2 ()
204	{
205	/* Then check if any players should use weapon-speed instead of speed */
206	for_all_players (pl)
207	{
208	// restore speed_left value saved by process_players1
209	pl->ob->speed_left = pl->speed_left_save;
210
211	pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp);
212	pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
213	}
214	}
215
216	static void
217	process_events ()
218	{
219	process_players1 ();
220
221	for_all_actives (op)
222	{
223	// try to prefetch some stuff we expect to need
224	// obviously, it should be grouped into the same cacheline.
225	// preliminary results indicate that this gives halves the speed
226	// used for the inner loop
227	if (_i < actives.size ()) // HACK, rely on _i :/
228	{
229	object *next = actives [_i + 1];
230
231	prefetch (&next->flag , 0, 1);
232	prefetch (&next->speed , 0, 1);
233	prefetch (&next->anim_speed, 0, 1);
234	prefetch (&next->contr , 0, 1);
235	}
236
237	/* Now process op */
238	if (expect_false (QUERY_FLAG (op, FLAG_FREED)))
239	{
240	LOG (llevError, "BUG: process_events(): Free object on list\n");
241	op->set_speed (0);
242	continue;
243	}
244
245	if (expect_false (!op->has_active_speed ()))
246	{
247	LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), "
248	"but is on active list\n", op->debug_desc (), op->speed);
249	op->set_speed (0);
250	continue;
251	}
252
253	if (expect_false (op->flag [FLAG_REMOVED]))
254	{
255	LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n",
256	op->debug_desc ());
257	op->set_speed (0);
258	continue;
259	}
260
261	/* Animate the object. Bug or feature that anim_speed
262	* is based on ticks, and not the creatures speed?
263	*/
264	if (op->anim_speed && op->last_anim >= op->anim_speed)
265	{
266	animate_object (op, op->contr ? op->facing : op->direction);
267	op->last_anim = 1;
268	}
269	else
270	++op->last_anim;
271
272	if (expect_false (op->speed_left > 0.f))
273	{
274	--op->speed_left;
275	process_object (op);
276	}
277
278	// this will destroy the speed_left value for players, but
279	// process_players1 and ..2 save/restore the real value,
280	// so we can avoid a costly test here.
281	op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed));
282	}
283
284	process_players2 ();
285	}
286
287	/* clean up everything before exiting */
288	void
289	emergency_save ()
290	{
291	LOG (llevDebug, "emergency save begin.\n");
292
293	cfperl_emergency_save ();
294
295	LOG (llevDebug, "saving book archive.\n");
296	write_book_archive ();
297
298	LOG (llevDebug, "emergency save done.\n");
299	}
300
301	// send all clients some informational text
302	static void
303	cleanup_inform (const char *cause, bool make_core)
304	{
305	int flags = NDI_REPLY \| NDI_UNIQUE \| NDI_ALL \| (make_core ? NDI_RED : NDI_GREEN);
306
307	new_draw_info_format (flags, 0, 0, "The server will now shutdown.");
308	new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause);
309
310	if (make_core)
311	new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.");
312	else
313	new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now.");
314
315	new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE);
316
317	client::flush_sockets ();
318	}
319
320	/* clean up everything before exiting */
321	void
322	cleanup (const char *cause, bool make_core)
323	{
324	if (make_core)
325	fork_abort (cause);
326
327	LOG (llevError, "cleanup cause: %s\n", cause);
328
329	if (!make_core)
330	cleanup_inform (cause, make_core);
331
332	LOG (llevDebug, "cleanup begin.\n");
333
334	if (init_done && !in_cleanup)
335	{
336	in_cleanup = true;
337	emergency_save ();
338	}
339	else
340	in_cleanup = true;
341
342	LOG (llevDebug, "running cleanup handlers.\n");
343	INVOKE_GLOBAL (CLEANUP);
344
345	LOG (llevDebug, "cleanup done.\n");
346
347	log_cleanup ();
348
349	if (make_core)
350	cleanup_inform (cause, make_core);
351	else
352	{
353	new_draw_info_format (NDI_REPLY \| NDI_UNIQUE \| NDI_ALL \| NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.");
354	new_draw_info_format (NDI_REPLY \| NDI_UNIQUE \| NDI_ALL \| NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE);
355	client::flush_sockets ();
356	}
357
358	cfperl_cleanup (make_core);
359	_exit (make_core);
360	}
361
362	/*
363	* do_specials() is a collection of functions to call from time to time.
364	* Modified 2000-1-14 MSW to use the global pticks count to determine how
365	* often to do things. This will allow us to spred them out more often.
366	* I use prime numbers for the factor count - in that way, it is less likely
367	* these actions will fall on the same tick (compared to say using 500/2500/15000
368	* which would mean on that 15,000 tick count a whole bunch of stuff gets
369	* done). Of course, there can still be times where multiple specials are
370	* done on the same tick, but that will happen very infrequently
371	*
372	* I also think this code makes it easier to see how often we really are
373	* doing the various things.
374	*/
375	static void
376	do_specials (void)
377	{
378	shstr::gc ();
379	archetype::gc ();
380
381	if (expect_false (!(pticks % TICKS_PER_HOUR)))
382	maptile::adjust_daylight ();
383
384	if (expect_false (!(pticks % 2503)))
385	fix_weight (); /* Hack to fix weightproblems caused by bugs */
386
387	if (expect_false (!(pticks % 5003)))
388	write_book_archive ();
389
390	if (expect_false (!(pticks % 5009)))
391	clean_friendly_list ();
392
393	if (expect_false (!(pticks % 5011)))
394	obsolete_parties ();
395
396	if (expect_false (!(pticks % 12503)))
397	fix_luck ();
398	}
399
400	void
401	server_tick ()
402	{
403	// first do the user visible stuff
404	INVOKE_GLOBAL (CLOCK);
405	process_events (); // "do" something with objects with speed
406	client::clock (); // draw client maps etc.
407
408	// then do some bookkeeping, should not really be here
409	do_specials (); /* Routines called from time to time. */
410	attachable::check_mortals ();
411
412	++pticks;
413	}
414
415	// normal main
416	int
417	main (int argc, char **argv)
418	{
419	settings.argc = argc;
420	settings.argv = argv;
421
422	rndm.seed (time (0));
423	g_thread_init (0); // for the slice allocator only
424
425	init (argc, argv);
426
427	for (;;)
428	cfperl_main ();
429	}
430