server/random_maps/style.c

/*
 * static char *rcsid_style_c =
 *   "$Id: style.c,v 1.26 2006/02/19 17:27:32 akirschbaum Exp $";
 */

/*
    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-devel@real-time.com
*/


#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 = 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 */
mapstruct *styles=NULL;


mapstruct *load_style_map(char *style_name)
{
    mapstruct *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) {
        mapstruct *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;
}

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