server/server/swap.C

/*
    CrossFire, A Multiplayer game for X-windows

    Copyright (C) 2002 Mark Wedel & Crossfire Development Team
    Copyright (C) 1992 Frank Tore Johansen

    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.

    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.

    The author can be reached via e-mail to <crossfire@schmorp.de>
*/

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

/* This writes out information on all the temporary maps.  It is called by
 * swap_map below.
 */
static void
write_map_log (void)
{
  FILE *fp;
  maptile *map;
  char buf[MAX_BUF];
  long current_time = time (NULL);

  sprintf (buf, "%s/temp.maps", settings.localdir);
  if (!(fp = fopen (buf, "w")))
    {
      LOG (llevError, "Could not open %s for writing\n", buf);
      return;
    }

  for (map = first_map; map != NULL; map = map->next)
    {
      /* If tmpname is null, it is probably a unique player map,
       * so don't save information on it.
       */
      if (map->in_memory != MAP_IN_MEMORY && map->tmpname)
        {
          /* the 0 written out is a leftover from the lock number for
           * unique items and second one is from encounter maps.
           * Keep using it so that old temp files continue
           * to work.
           */
          fprintf (fp, "%s:%s:%ld:0:0:%d:0:%d\n", map->path, map->tmpname,
                   (map->reset_time == (uint32) - 1 ? (long unsigned) -1 : map->reset_time - current_time), map->difficulty, map->darkness);
        }
    }

  fclose (fp);
}

void
read_map_log (void)
{
  FILE *fp;
  maptile *map;
  char buf[MAX_BUF], *cp, *cp1;
  int do_los, darkness, lock;
  long sec = time (0);

  sprintf (buf, "%s/temp.maps", settings.localdir);
  if (!(fp = fopen (buf, "r")))
    {
      LOG (llevDebug, "Could not open %s for reading\n", buf);
      return;
    }

  while (fgets (buf, MAX_BUF, fp))
    {
      map = get_linked_map ();
      /* scanf doesn't work all that great on strings, so we break
       * out that manually.  strdup is used for tmpname, since other
       * routines will try to free that pointer.
       */
      cp = strchr (buf, ':');
      *cp++ = '\0';
      strcpy (map->path, buf);
      cp1 = strchr (cp, ':');
      *cp1++ = '\0';
      map->tmpname = strdup (cp);

      /* Lock is left over from the lock items - we just toss it now.
       * We use it twice - second one is from encounter, but as we
       * don't care about the value, this works fine
       */
      sscanf (cp1, "%d:%d:%d:%hd:%d:%d\n", &map->reset_time, &lock, &lock, &map->difficulty, &do_los, &darkness);

      map->in_memory = MAP_SWAPPED;
      map->darkness = darkness;

      /* When the reset time is saved out, it is adjusted so that
       * the current time is subtracted (thus, it is saved as number
       * of seconds from current time that it should reset).  We need
       * to add in the current seconds for this to work right.
       * On metalforge, strange behavior was observed with really high
       * reset times - I don't know how they got to that state, 
       * but easy enough to do some sanity checking here.
       */
      map->reset_time += sec;
      if (map->reset_time > (uint32) (sec + MAP_MAXRESET))
        map->reset_time = 0;
    }

  fclose (fp);
}

void
swap_map (maptile *map)
{
  player *pl;

  if (map->in_memory != MAP_IN_MEMORY)
    {
      LOG (llevError, "Tried to swap out map which was not in memory.\n");
      return;
    }

  for (pl = first_player; pl; pl = pl->next)
    if (!pl->ob || (!(QUERY_FLAG (pl->ob, FLAG_REMOVED)) && pl->ob->map == map))
      break;

  if (pl)
    {
      LOG (llevDebug, "Wanted to swap out map with player.\n");
      return;
    }

  remove_all_pets (map);        /* Give them a chance to follow */

  /* Update the reset time.  Only do this is STAND_STILL is not set */
  if (!map->fixed_resettime)
    set_map_reset_time (map);

  /* If it is immediate reset time, don't bother saving it - just get
   * rid of it right away.
   */
  if (map->reset_time <= (uint32) time (0))
    {
      LOG (llevDebug, "Resetting map %s.\n", map->path);
      INVOKE_MAP (RESET, map);
      delete_map (map);
      return;
    }

  if (new_save_map (map, 0) == -1)
    {
      LOG (llevError, "Failed to swap map %s.\n", map->path);
      /* need to reset the in_memory flag so that delete map will also
       * free the objects with it.
       */
      map->in_memory = MAP_IN_MEMORY;
      delete_map (map);
    }
  else
    {
      INVOKE_MAP (SWAPOUT, map);
      free_map (map, 1);
    }

  write_map_log ();
}

void
check_active_maps (void)
{
  maptile *map, *next;

  for (map = first_map; map != NULL; map = next)
    {
      next = map->next;
      if (map->in_memory != MAP_IN_MEMORY)
        continue;
      if (!map->timeout)
        continue;
      if (--(map->timeout) > 0)
        continue;
      /* If LWM is set, we only swap maps out when we run out of objects */
#ifndef MAX_OBJECTS_LWM
      swap_map (map);
#endif
    }
}

/*
 * map_least_timeout() returns the map with the lowest timeout variable (not 0)
 */

maptile *
map_least_timeout (char *except_level)
{
  maptile *map, *chosen = NULL;
  int timeout = MAP_MAXTIMEOUT + 1;

  for (map = first_map; map != NULL; map = map->next)
    if (map->in_memory == MAP_IN_MEMORY && strcmp (map->path, except_level) && map->timeout && map->timeout < timeout)
      chosen = map, timeout = map->timeout;
  return chosen;
}

/*
 * players_on_map(): will be replaced by map->players when I'm satisfied
 * that the variable is always correct.
 * If show_all is true, we show everyone.  If not, we don't show hidden
 * players (dms)
 */

int
players_on_map (maptile *m, int show_all)
{
  player *pl;
  int nr = 0;

  for (pl = first_player; pl != NULL; pl = pl->next)
    if (pl->ob != NULL && !QUERY_FLAG (pl->ob, FLAG_REMOVED) && pl->ob->map == m && (show_all || !pl->hidden))
      nr++;
  return nr;
}

/*
 * flush_old_maps():
 * Removes tmp-files of maps which are going to be reset next time
 * they are visited.
 * This is very useful if the tmp-disk is very full.
 */
void
flush_old_maps (void)
{

  maptile *m, *oldmap;
  uint32 sec = time (0);

  m = first_map;
  while (m)
    {
      /* There can be cases (ie death) where a player leaves a map and the timeout
       * is not set so it isn't swapped out.
       */
      if ((m->in_memory == MAP_IN_MEMORY) && (m->timeout == 0) && !players_on_map (m, TRUE))
        set_map_timeout (m);

      /* per player unique maps are never really reset.  However, we do want
       * to perdiocially remove the entries in the list of active maps - this
       * generates a cleaner listing if a player issues the map commands, and
       * keeping all those swapped out per player unique maps also has some
       * memory and cpu consumption.
       * We do the cleanup here because there are lots of places that call
       * swap map, and doing it within swap map may cause problems as
       * the functions calling it may not expect the map list to change
       * underneath them.
       */
      if ((m->unique || m->templatemap) && m->in_memory == MAP_SWAPPED)
        {
          LOG (llevDebug, "Resetting map %s.\n", m->path);
          oldmap = m;
          m = m->next;
          delete_map (oldmap);
        }
      else if (m->in_memory != MAP_SWAPPED || m->tmpname == NULL || sec < m->reset_time)
        {
          m = m->next;
        }
      else
        {
          LOG (llevDebug, "Resetting map %s.\n", m->path);
          INVOKE_MAP (RESET, m);
          clean_tmp_map (m);
          oldmap = m;
          m = m->next;
          delete_map (oldmap);
        }
    }
}
Revision:	1.13
Committed:	Mon Dec 18 04:07:31 2006 UTC (17 years, 5 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.12:	+2 -3 lines
Log Message:	- check for in-memory map headers on login, so players end up on their random map (which has no file) again. (this is more efficient in the general case anyways - in case the temp map does not exist, the emergency position is used. (an alternative that avoids this is to make the file some real map (like per-player maps))
#	Content
1	/*
2	CrossFire, A Multiplayer game for X-windows
3
4	Copyright (C) 2002 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen
6
7	This program is free software; you can redistribute it and/or modify
8	it under the terms of the GNU General Public License as published by
9	the Free Software Foundation; either version 2 of the License, or
10	(at your option) any later version.
11
12	This program is distributed in the hope that it will be useful,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.
16
17	You should have received a copy of the GNU General Public License
18	along with this program; if not, write to the Free Software
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20
21	The author can be reached via e-mail to <crossfire@schmorp.de>
22	*/
23
24	#include <global.h>
25	#include <sproto.h>
26	#include <object.h>
27
28	/* This writes out information on all the temporary maps. It is called by
29	* swap_map below.
30	*/
31	static void
32	write_map_log (void)
33	{
34	FILE *fp;
35	maptile *map;
36	char buf[MAX_BUF];
37	long current_time = time (NULL);
38
39	sprintf (buf, "%s/temp.maps", settings.localdir);
40	if (!(fp = fopen (buf, "w")))
41	{
42	LOG (llevError, "Could not open %s for writing\n", buf);
43	return;
44	}
45
46	for (map = first_map; map != NULL; map = map->next)
47	{
48	/* If tmpname is null, it is probably a unique player map,
49	* so don't save information on it.
50	*/
51	if (map->in_memory != MAP_IN_MEMORY && map->tmpname)
52	{
53	/* the 0 written out is a leftover from the lock number for
54	* unique items and second one is from encounter maps.
55	* Keep using it so that old temp files continue
56	* to work.
57	*/
58	fprintf (fp, "%s:%s:%ld:0:0:%d:0:%d\n", map->path, map->tmpname,
59	(map->reset_time == (uint32) - 1 ? (long unsigned) -1 : map->reset_time - current_time), map->difficulty, map->darkness);
60	}
61	}
62
63	fclose (fp);
64	}
65
66	void
67	read_map_log (void)
68	{
69	FILE *fp;
70	maptile *map;
71	char buf[MAX_BUF], cp, cp1;
72	int do_los, darkness, lock;
73	long sec = time (0);
74
75	sprintf (buf, "%s/temp.maps", settings.localdir);
76	if (!(fp = fopen (buf, "r")))
77	{
78	LOG (llevDebug, "Could not open %s for reading\n", buf);
79	return;
80	}
81
82	while (fgets (buf, MAX_BUF, fp))
83	{
84	map = get_linked_map ();
85	/* scanf doesn't work all that great on strings, so we break
86	* out that manually. strdup is used for tmpname, since other
87	* routines will try to free that pointer.
88	*/
89	cp = strchr (buf, ':');
90	*cp++ = '\0';
91	strcpy (map->path, buf);
92	cp1 = strchr (cp, ':');
93	*cp1++ = '\0';
94	map->tmpname = strdup (cp);
95
96	/* Lock is left over from the lock items - we just toss it now.
97	* We use it twice - second one is from encounter, but as we
98	* don't care about the value, this works fine
99	*/
100	sscanf (cp1, "%d:%d:%d:%hd:%d:%d\n", &map->reset_time, &lock, &lock, &map->difficulty, &do_los, &darkness);
101
102	map->in_memory = MAP_SWAPPED;
103	map->darkness = darkness;
104
105	/* When the reset time is saved out, it is adjusted so that
106	* the current time is subtracted (thus, it is saved as number
107	* of seconds from current time that it should reset). We need
108	* to add in the current seconds for this to work right.
109	* On metalforge, strange behavior was observed with really high
110	* reset times - I don't know how they got to that state,
111	* but easy enough to do some sanity checking here.
112	*/
113	map->reset_time += sec;
114	if (map->reset_time > (uint32) (sec + MAP_MAXRESET))
115	map->reset_time = 0;
116	}
117
118	fclose (fp);
119	}
120
121	void
122	swap_map (maptile *map)
123	{
124	player *pl;
125
126	if (map->in_memory != MAP_IN_MEMORY)
127	{
128	LOG (llevError, "Tried to swap out map which was not in memory.\n");
129	return;
130	}
131
132	for (pl = first_player; pl; pl = pl->next)
133	if (!pl->ob \|\| (!(QUERY_FLAG (pl->ob, FLAG_REMOVED)) && pl->ob->map == map))
134	break;
135
136	if (pl)
137	{
138	LOG (llevDebug, "Wanted to swap out map with player.\n");
139	return;
140	}
141
142	remove_all_pets (map); /* Give them a chance to follow */
143
144	/* Update the reset time. Only do this is STAND_STILL is not set */
145	if (!map->fixed_resettime)
146	set_map_reset_time (map);
147
148	/* If it is immediate reset time, don't bother saving it - just get
149	* rid of it right away.
150	*/
151	if (map->reset_time <= (uint32) time (0))
152	{
153	LOG (llevDebug, "Resetting map %s.\n", map->path);
154	INVOKE_MAP (RESET, map);
155	delete_map (map);
156	return;
157	}
158
159	if (new_save_map (map, 0) == -1)
160	{
161	LOG (llevError, "Failed to swap map %s.\n", map->path);
162	/* need to reset the in_memory flag so that delete map will also
163	* free the objects with it.
164	*/
165	map->in_memory = MAP_IN_MEMORY;
166	delete_map (map);
167	}
168	else
169	{
170	INVOKE_MAP (SWAPOUT, map);
171	free_map (map, 1);
172	}
173
174	write_map_log ();
175	}
176
177	void
178	check_active_maps (void)
179	{
180	maptile map, next;
181
182	for (map = first_map; map != NULL; map = next)
183	{
184	next = map->next;
185	if (map->in_memory != MAP_IN_MEMORY)
186	continue;
187	if (!map->timeout)
188	continue;
189	if (--(map->timeout) > 0)
190	continue;
191	/* If LWM is set, we only swap maps out when we run out of objects */
192	#ifndef MAX_OBJECTS_LWM
193	swap_map (map);
194	#endif
195	}
196	}
197
198	/*
199	* map_least_timeout() returns the map with the lowest timeout variable (not 0)
200	*/
201
202	maptile *
203	map_least_timeout (char *except_level)
204	{
205	maptile map, chosen = NULL;
206	int timeout = MAP_MAXTIMEOUT + 1;
207
208	for (map = first_map; map != NULL; map = map->next)
209	if (map->in_memory == MAP_IN_MEMORY && strcmp (map->path, except_level) && map->timeout && map->timeout < timeout)
210	chosen = map, timeout = map->timeout;
211	return chosen;
212	}
213
214	/*
215	* players_on_map(): will be replaced by map->players when I'm satisfied
216	* that the variable is always correct.
217	* If show_all is true, we show everyone. If not, we don't show hidden
218	* players (dms)
219	*/
220
221	int
222	players_on_map (maptile *m, int show_all)
223	{
224	player *pl;
225	int nr = 0;
226
227	for (pl = first_player; pl != NULL; pl = pl->next)
228	if (pl->ob != NULL && !QUERY_FLAG (pl->ob, FLAG_REMOVED) && pl->ob->map == m && (show_all \|\| !pl->hidden))
229	nr++;
230	return nr;
231	}
232
233	/*
234	* flush_old_maps():
235	* Removes tmp-files of maps which are going to be reset next time
236	* they are visited.
237	* This is very useful if the tmp-disk is very full.
238	*/
239	void
240	flush_old_maps (void)
241	{
242
243	maptile m, oldmap;
244	uint32 sec = time (0);
245
246	m = first_map;
247	while (m)
248	{
249	/* There can be cases (ie death) where a player leaves a map and the timeout
250	* is not set so it isn't swapped out.
251	*/
252	if ((m->in_memory == MAP_IN_MEMORY) && (m->timeout == 0) && !players_on_map (m, TRUE))
253	set_map_timeout (m);
254
255	/* per player unique maps are never really reset. However, we do want
256	* to perdiocially remove the entries in the list of active maps - this
257	* generates a cleaner listing if a player issues the map commands, and
258	* keeping all those swapped out per player unique maps also has some
259	* memory and cpu consumption.
260	* We do the cleanup here because there are lots of places that call
261	* swap map, and doing it within swap map may cause problems as
262	* the functions calling it may not expect the map list to change
263	* underneath them.
264	*/
265	if ((m->unique \|\| m->templatemap) && m->in_memory == MAP_SWAPPED)
266	{
267	LOG (llevDebug, "Resetting map %s.\n", m->path);
268	oldmap = m;
269	m = m->next;
270	delete_map (oldmap);
271	}
272	else if (m->in_memory != MAP_SWAPPED \|\| m->tmpname == NULL \|\| sec < m->reset_time)
273	{
274	m = m->next;
275	}
276	else
277	{
278	LOG (llevDebug, "Resetting map %s.\n", m->path);
279	INVOKE_MAP (RESET, m);
280	clean_tmp_map (m);
281	oldmap = m;
282	m = m->next;
283	delete_map (oldmap);
284	}
285	}
286	}