server/random_maps/style.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 authors can be reached via e-mail at <crossfire@schmorp.de>
*/


#include <global.h>
#include <random_map.h>
#ifndef WIN32                   /* ---win32 exclude headers */
# include <dirent.h>
# include <sys/stat.h>
# include <unistd.h>
# include "../include/autoconf.h"
#endif /* win32 */


static int
pointer_strcmp (const void *p1, const void *p2)
{
  const char *s1 = *(const char **) p1;
  const char *s2 = *(const char **) p2;

  return (strcmp (s1, s2));
}

/* This is our own version of scandir/select_regular_files/sort.
 * To support having subdirectories in styles, we need to know
 * if in fact the directory we read is a subdirectory.  However,
 * we can't get that through the normal dirent entry.  So
 * instead, we do our own where we do have the full directory
 * path so can do stat calls to see if in fact it is a directory.
 * dir is the name of the director to scan.
 * namelist is the array of file names returned.  IT needs to be
 * freed by the caller.
 * skip_dirs controls our behavioru - if nonzero, we don't
 * skip any subdirectories - if zero, we store those away,
 * since there are cases where we want to choose a random
 * directory. 
 */
int
load_dir (const char *dir, char ***namelist, int skip_dirs)
{
  DIR *dp;
  struct dirent *d;
  int entries = 0, entry_size = 0;
  char name[NAME_MAX + 1], **rn = NULL;
  struct stat sb;

  dp = opendir (dir);
  if (dp == NULL)
    return -1;

  while ((d = readdir (dp)) != NULL)
    {
      sprintf (name, "%s/%s", dir, d->d_name);
      if (skip_dirs)
        {
          stat (name, &sb);
          if (S_ISDIR (sb.st_mode))
            {
              continue;
            }
        }

      if (entries == entry_size)
        {
          entry_size += 10;
          rn = (char **) realloc (rn, sizeof (char *) * entry_size);
        }
      rn[entries] = strdup_local (d->d_name);
      entries++;

    }
  (void) closedir (dp);

  qsort (rn, entries, sizeof (char *), pointer_strcmp);

  *namelist = rn;
  return entries;
}


/* this function loads and returns the map requested.
 * dirname, for example, is "/styles/wallstyles", stylename, is,
 * for example, "castle", difficulty is -1 when difficulty is
 * irrelevant to the style.  If dirname is given, but stylename
 * isn't, and difficult is -1, it returns a random style map.
 * Otherwise, it tries to match the difficulty given with a style
 * file, named style_name_# where # is an integer 
 */

/* remove extern, so visible to command_style_map_info function */
maptile *styles = NULL;


maptile *
load_style_map (char *style_name)
{
  maptile *style_map;

  /* Given a file.  See if its in memory */
  for (style_map = styles; style_map != NULL; style_map = style_map->next)
    {
      if (!strcmp (style_name, style_map->path))
        return style_map;
    }
  style_map = load_original_map (style_name, MAP_STYLE);
  /* Remove it from global list, put it on our local list */
  if (style_map)
    {
      maptile *tmp;

      if (style_map == first_map)
        first_map = style_map->next;
      else
        {
          for (tmp = first_map; tmp && tmp->next != style_map; tmp = tmp->next);
          if (tmp)
            tmp->next = style_map->next;
        }
      style_map->next = styles;
      styles = style_map;
    }
  return style_map;
}

maptile *
find_style (const char *dirname, const char *stylename, int difficulty)
{
  char style_file_path[256];
  char style_file_full_path[256];
  maptile *style_map = NULL;
  struct stat file_stat;
  int i, only_subdirs = 0;

  /* if stylename exists, set style_file_path to that file. */
  if (stylename && strlen (stylename) > 0)
    sprintf (style_file_path, "%s/%s", dirname, stylename);
  else                          /* otherwise, just use the dirname.  We'll pick a random stylefile. */
    sprintf (style_file_path, "%s", dirname);

  /* is what we were given a directory, or a file? */
  sprintf (style_file_full_path, "%s/maps%s", settings.datadir, style_file_path);
  if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode))
    {
      style_map = load_style_map (style_file_path);
    }
  if (style_map == NULL)        /* maybe we were given a directory! */
    {
      char **namelist;
      int n;
      char style_dir_full_path[256];

      /* get the names of all the files in that directory */
      sprintf (style_dir_full_path, "%s/maps%s", settings.datadir, style_file_path);

      /* First, skip subdirectories.  If we don't find anything, then try again
       * without skipping subdirs.
       */
      n = load_dir (style_dir_full_path, &namelist, 1);

      if (n <= 0)
        {
          n = load_dir (style_dir_full_path, &namelist, 0);
          only_subdirs = 1;
        }

      if (n <= 0)
        return 0;               /* nothing to load.  Bye. */

      /* Picks a random map.  Note that if this is all directories,
       * we know it won't be able to load, so save a few ticks.   
       * the door handling checks for this failure and handles
       * it properly.
       */
      if (difficulty == -1)
        {                       /* pick a random style from this dir. */
          if (only_subdirs)
            style_map = NULL;
          else
            {
              strcat (style_file_path, "/");
              strcat (style_file_path, namelist[RANDOM () % n]);
              style_map = load_style_map (style_file_path);
            }
        }
      else
        {                       /* find the map closest in difficulty */
          int min_dist = 32000, min_index = -1;

          for (i = 0; i < n; i++)
            {
              int dist;
              char *mfile_name = strrchr (namelist[i], '_') + 1;

              if ((mfile_name - 1) == NULL)
                {               /* since there isn't a sequence, */
                  int q;

                  /*pick one at random to recurse */
                  style_map = find_style (style_file_path, namelist[RANDOM () % n], difficulty);
                  for (q = 0; q < n; q++)
                    free (namelist[q]);
                  free (namelist);
                  return style_map;
                }
              else
                {
                  dist = abs (difficulty - atoi (mfile_name));
                  if (dist < min_dist)
                    {
                      min_dist = dist;
                      min_index = i;
                    }
                }
            }
          /* presumably now we've found the "best" match for the
             difficulty. */
          strcat (style_file_path, "/");
          strcat (style_file_path, namelist[min_index]);
          style_map = load_style_map (style_file_path);
        }
      for (i = 0; i < n; i++)
        free (namelist[i]);
      free (namelist);
    }
  return style_map;

}


/* picks a random object from a style map.
 * Redone by MSW so it should be faster and not use static
 * variables to generate tables.
 */
object *
pick_random_object (maptile *style)
{
  int x, y, limit = 0;
  object *new_obj;

  /* while returning a null object will result in a crash, that
   * is actually preferable to an infinite loop.  That is because
   * most servers will automatically restart in case of crash.
   * Change the logic on getting the random space - shouldn't make
   * any difference, but this seems clearer to me.
   */
  do
    {
      limit++;
      x = RANDOM () % MAP_WIDTH (style);
      y = RANDOM () % MAP_HEIGHT (style);
      new_obj = get_map_ob (style, x, y);
    }
  while (new_obj == NULL && limit < 1000);
  if (new_obj->head)
    return new_obj->head;
  else
    return new_obj;
}


void
free_style_maps (void)
{
  maptile *next;
  int style_maps = 0;

  /* delete_map will try to free it from the linked list,
   * but won't find it, so we need to do it ourselves
   */
  while (styles)
    {
      next = styles->next;
      delete_map (styles);
      styles = next;
      style_maps++;
    }
  LOG (llevDebug, "free_style_maps: Freed %d maps\n", style_maps);
}
Revision:	1.5
Committed:	Sat Sep 16 22:24:13 2006 UTC (17 years, 8 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.4:	+8 -8 lines
Log Message:	mapstruct => maptile removed many ytypedefs in favor of structure tags
#	User	Rev	Content
1	elmex	1.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	root	1.4	The authors can be reached via e-mail at <crossfire@schmorp.de>
22	elmex	1.1	*/
23
24
25			#include <global.h>
26			#include <random_map.h>
27	root	1.3	#ifndef WIN32 /* ---win32 exclude headers */
28			# include <dirent.h>
29			# include <sys/stat.h>
30			# include <unistd.h>
31			# include "../include/autoconf.h"
32	elmex	1.1	#endif /* win32 */
33
34
35	root	1.3	static int
36			pointer_strcmp (const void p1, const void p2)
37	elmex	1.1	{
38	root	1.3	const char s1 = (const char **) p1;
39			const char s2 = (const char **) p2;
40	elmex	1.1
41	root	1.3	return (strcmp (s1, s2));
42	elmex	1.1	}
43
44			/* This is our own version of scandir/select_regular_files/sort.
45			* To support having subdirectories in styles, we need to know
46			* if in fact the directory we read is a subdirectory. However,
47			* we can't get that through the normal dirent entry. So
48			* instead, we do our own where we do have the full directory
49			* path so can do stat calls to see if in fact it is a directory.
50			* dir is the name of the director to scan.
51			* namelist is the array of file names returned. IT needs to be
52			* freed by the caller.
53			* skip_dirs controls our behavioru - if nonzero, we don't
54			* skip any subdirectories - if zero, we store those away,
55			* since there are cases where we want to choose a random
56			* directory.
57			*/
58	root	1.3	int
59			load_dir (const char dir, char **namelist, int skip_dirs)
60	elmex	1.1	{
61	root	1.3	DIR *dp;
62			struct dirent *d;
63			int entries = 0, entry_size = 0;
64			char name[NAME_MAX + 1], **rn = NULL;
65			struct stat sb;
66
67			dp = opendir (dir);
68			if (dp == NULL)
69			return -1;
70
71			while ((d = readdir (dp)) != NULL)
72			{
73			sprintf (name, "%s/%s", dir, d->d_name);
74			if (skip_dirs)
75			{
76			stat (name, &sb);
77			if (S_ISDIR (sb.st_mode))
78			{
79			continue;
80	root	1.2	}
81			}
82
83	root	1.3	if (entries == entry_size)
84			{
85			entry_size += 10;
86			rn = (char *) realloc (rn, sizeof (char ) * entry_size);
87	root	1.2	}
88	root	1.3	rn[entries] = strdup_local (d->d_name);
89			entries++;
90	elmex	1.1
91			}
92	root	1.3	(void) closedir (dp);
93	elmex	1.1
94	root	1.3	qsort (rn, entries, sizeof (char *), pointer_strcmp);
95	elmex	1.1
96	root	1.3	*namelist = rn;
97			return entries;
98	elmex	1.1	}
99
100
101
102
103	root	1.3
104	elmex	1.1	/* this function loads and returns the map requested.
105			* dirname, for example, is "/styles/wallstyles", stylename, is,
106			* for example, "castle", difficulty is -1 when difficulty is
107			* irrelevant to the style. If dirname is given, but stylename
108			* isn't, and difficult is -1, it returns a random style map.
109			* Otherwise, it tries to match the difficulty given with a style
110			* file, named style_name_# where # is an integer
111			*/
112
113			/* remove extern, so visible to command_style_map_info function */
114	root	1.5	maptile *styles = NULL;
115	elmex	1.1
116
117	root	1.5	maptile *
118	root	1.3	load_style_map (char *style_name)
119	elmex	1.1	{
120	root	1.5	maptile *style_map;
121	elmex	1.1
122	root	1.3	/* Given a file. See if its in memory */
123			for (style_map = styles; style_map != NULL; style_map = style_map->next)
124			{
125			if (!strcmp (style_name, style_map->path))
126			return style_map;
127	elmex	1.1	}
128	root	1.3	style_map = load_original_map (style_name, MAP_STYLE);
129			/* Remove it from global list, put it on our local list */
130			if (style_map)
131			{
132	root	1.5	maptile *tmp;
133	root	1.3
134			if (style_map == first_map)
135			first_map = style_map->next;
136			else
137			{
138			for (tmp = first_map; tmp && tmp->next != style_map; tmp = tmp->next);
139			if (tmp)
140			tmp->next = style_map->next;
141	root	1.2	}
142	root	1.3	style_map->next = styles;
143			styles = style_map;
144	elmex	1.1	}
145	root	1.3	return style_map;
146	elmex	1.1	}
147
148	root	1.5	maptile *
149	root	1.3	find_style (const char dirname, const char stylename, int difficulty)
150			{
151			char style_file_path[256];
152			char style_file_full_path[256];
153	root	1.5	maptile *style_map = NULL;
154	root	1.3	struct stat file_stat;
155			int i, only_subdirs = 0;
156
157			/* if stylename exists, set style_file_path to that file. */
158			if (stylename && strlen (stylename) > 0)
159			sprintf (style_file_path, "%s/%s", dirname, stylename);
160			else /* otherwise, just use the dirname. We'll pick a random stylefile. */
161			sprintf (style_file_path, "%s", dirname);
162
163			/* is what we were given a directory, or a file? */
164			sprintf (style_file_full_path, "%s/maps%s", settings.datadir, style_file_path);
165			if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode))
166			{
167			style_map = load_style_map (style_file_path);
168	elmex	1.1	}
169	root	1.3	if (style_map == NULL) /* maybe we were given a directory! */
170	elmex	1.1	{
171	root	1.3	char **namelist;
172			int n;
173			char style_dir_full_path[256];
174
175			/* get the names of all the files in that directory */
176			sprintf (style_dir_full_path, "%s/maps%s", settings.datadir, style_file_path);
177
178			/* First, skip subdirectories. If we don't find anything, then try again
179			* without skipping subdirs.
180			*/
181			n = load_dir (style_dir_full_path, &namelist, 1);
182
183			if (n <= 0)
184			{
185			n = load_dir (style_dir_full_path, &namelist, 0);
186			only_subdirs = 1;
187	root	1.2	}
188
189	root	1.3	if (n <= 0)
190			return 0; /* nothing to load. Bye. */
191	root	1.2
192	root	1.3	/* Picks a random map. Note that if this is all directories,
193			* we know it won't be able to load, so save a few ticks.
194			* the door handling checks for this failure and handles
195			* it properly.
196			*/
197			if (difficulty == -1)
198			{ /* pick a random style from this dir. */
199			if (only_subdirs)
200			style_map = NULL;
201			else
202			{
203			strcat (style_file_path, "/");
204			strcat (style_file_path, namelist[RANDOM () % n]);
205			style_map = load_style_map (style_file_path);
206	root	1.2	}
207			}
208	root	1.3	else
209			{ /* find the map closest in difficulty */
210			int min_dist = 32000, min_index = -1;
211
212			for (i = 0; i < n; i++)
213			{
214			int dist;
215			char *mfile_name = strrchr (namelist[i], '_') + 1;
216
217			if ((mfile_name - 1) == NULL)
218			{ /* since there isn't a sequence, */
219			int q;
220
221			/pick one at random to recurse /
222			style_map = find_style (style_file_path, namelist[RANDOM () % n], difficulty);
223			for (q = 0; q < n; q++)
224			free (namelist[q]);
225			free (namelist);
226			return style_map;
227			}
228			else
229			{
230			dist = abs (difficulty - atoi (mfile_name));
231			if (dist < min_dist)
232			{
233			min_dist = dist;
234			min_index = i;
235	root	1.2	}
236			}
237			}
238	root	1.3	/* presumably now we've found the "best" match for the
239			difficulty. */
240			strcat (style_file_path, "/");
241			strcat (style_file_path, namelist[min_index]);
242			style_map = load_style_map (style_file_path);
243	root	1.2	}
244	root	1.3	for (i = 0; i < n; i++)
245			free (namelist[i]);
246			free (namelist);
247	elmex	1.1	}
248			return style_map;
249
250			}
251
252
253			/* picks a random object from a style map.
254			* Redone by MSW so it should be faster and not use static
255			* variables to generate tables.
256			*/
257	root	1.3	object *
258	root	1.5	pick_random_object (maptile *style)
259	root	1.3	{
260			int x, y, limit = 0;
261			object *new_obj;
262
263			/* while returning a null object will result in a crash, that
264			* is actually preferable to an infinite loop. That is because
265			* most servers will automatically restart in case of crash.
266			* Change the logic on getting the random space - shouldn't make
267			* any difference, but this seems clearer to me.
268			*/
269			do
270			{
271			limit++;
272			x = RANDOM () % MAP_WIDTH (style);
273			y = RANDOM () % MAP_HEIGHT (style);
274			new_obj = get_map_ob (style, x, y);
275			}
276			while (new_obj == NULL && limit < 1000);
277			if (new_obj->head)
278			return new_obj->head;
279			else
280			return new_obj;
281	elmex	1.1	}
282
283	root	1.3
284			void
285			free_style_maps (void)
286	elmex	1.1	{
287	root	1.5	maptile *next;
288	root	1.3	int style_maps = 0;
289	elmex	1.1
290	root	1.3	/* delete_map will try to free it from the linked list,
291			* but won't find it, so we need to do it ourselves
292			*/
293			while (styles)
294			{
295			next = styles->next;
296			delete_map (styles);
297			styles = next;
298			style_maps++;
299	elmex	1.1	}
300	root	1.3	LOG (llevDebug, "free_style_maps: Freed %d maps\n", style_maps);
301	elmex	1.1	}