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>
#include <dirent.h>
#include <sys/stat.h>
#include <unistd.h>
#include "../include/autoconf.h"


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 (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; 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)
    {
      style_map->unlink ();

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