ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/arch.C
(Generate patch)

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.8 by root, Wed Aug 30 06:06:26 2006 UTC vs.
Revision 1.19 by root, Thu Sep 14 18:13:01 2006 UTC

1/*
2 * static char *rcsid_arch_c =
3 * "$Id: arch.C,v 1.8 2006/08/30 06:06:26 root Exp $";
4 */
5
6/* 1/*
7 CrossFire, A Multiplayer game for X-windows 2 CrossFire, A Multiplayer game for X-windows
8 3
9 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 4 Copyright (C) 2002 Mark Wedel & Crossfire Development Team
10 Copyright (C) 1992 Frank Tore Johansen 5 Copyright (C) 1992 Frank Tore Johansen
… …
24 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
25 20
26 The authors can be reached via e-mail at crossfire-devel@real-time.com 21 The authors can be reached via e-mail at crossfire-devel@real-time.com
27*/ 22*/
28 23
24#include <cassert>
25
26#include <tr1/unordered_map>
27
29#include <global.h> 28#include <global.h>
30#include <arch.h> 29#include <arch.h>
31#include <funcpoint.h> 30#include <funcpoint.h>
32#include <loader.h> 31#include <loader.h>
33 32
34#include <cassert>
35
36/* IF set, does a little timing on the archetype load. */ 33/* IF set, does a little timing on the archetype load. */
37#define TIME_ARCH_LOAD 0 34#define TIME_ARCH_LOAD 0
38 35
39static void add_arch(archetype *at); 36static void add_arch (archetype *at);
40 37
41static archetype *arch_table[ARCHTABLE]; 38static archetype *arch_table[ARCHTABLE];
42int arch_cmp=0; /* How many strcmp's */ 39int arch_cmp = 0; /* How many strcmp's */
43int arch_search=0; /* How many searches */ 40int arch_search = 0; /* How many searches */
44int arch_init; /* True if doing arch initialization */ 41int arch_init; /* True if doing arch initialization */
45 42
46/* The naming of these functions is really poor - they are all 43/* The naming of these functions is really poor - they are all
47 * pretty much named '.._arch_...', but they may more may not 44 * pretty much named '.._arch_...', but they may more may not
48 * return archetypes. Some make the arch_to_object call, and thus 45 * return archetypes. Some make the arch_to_object call, and thus
49 * return an object. Perhaps those should be called 'archob' functions 46 * return an object. Perhaps those should be called 'archob' functions
50 * to denote they return an object derived from the archetype. 47 * to denote they return an object derived from the archetype.
51 * MSW 2003-04-29 48 * MSW 2003-04-29
52 */ 49 */
50
51#if USE_UNORDERED_MAP
52// the hashtable
53typedef std::tr1::unordered_map
54 <
55 std::size_t,
56 archetype *,
57 std::hash<size_t>,
58 std::equal_to<size_t>,
59 slice_allocator< std::pair<const std::size_t, archetype *> >
60 true,
61 > HT;
62
63static HT ht;
64#endif
53 65
54/** 66/**
55 * GROS - This function retrieves an archetype given the name that appears 67 * GROS - This function retrieves an archetype given the name that appears
56 * during the game (for example, "writing pen" instead of "stylus"). 68 * during the game (for example, "writing pen" instead of "stylus").
57 * It does not use the hashtable system, but browse the whole archlist each time. 69 * It does not use the hashtable system, but browse the whole archlist each time.
… …
60 * Params: 72 * Params:
61 * - name: the name we're searching for (ex: "writing pen"); 73 * - name: the name we're searching for (ex: "writing pen");
62 * Return value: 74 * Return value:
63 * - the archetype found or null if nothing was found. 75 * - the archetype found or null if nothing was found.
64 */ 76 */
77archetype *
65archetype *find_archetype_by_object_name(const char *name) { 78find_archetype_by_object_name (const char *name)
79{
66 archetype *at; 80 archetype *
81 at;
67 82
68 if (name == NULL) 83 if (name == NULL)
69 return (archetype *) NULL; 84 return (archetype *) NULL;
70 85
71 for(at = first_archetype;at!=NULL;at=at->next) { 86 for (at = first_archetype; at != NULL; at = at->next)
87 {
72 if (!strcmp(at->clone.name, name)) 88 if (!strcmp (at->clone.name, name))
73 return at; 89 return at;
74 } 90 }
75 return NULL; 91 return NULL;
76} 92}
77 93
78/** 94/**
79 * This function retrieves an archetype by type and name that appears during 95 * This function retrieves an archetype by type and name that appears during
80 * the game. It is basically the same as find_archetype_by_object_name() 96 * the game. It is basically the same as find_archetype_by_object_name()
81 * except that it considers only items of the given type. 97 * except that it considers only items of the given type.
82 */ 98 */
99archetype *
83archetype *find_archetype_by_object_type_name(int type, const char *name) { 100find_archetype_by_object_type_name (int type, const char *name)
101{
84 archetype *at; 102 archetype *
103 at;
85 104
86 if (name == NULL) 105 if (name == NULL)
87 return NULL;
88
89 for (at = first_archetype; at != NULL; at = at->next) {
90 if (at->clone.type == type && strcmp(at->clone.name, name) == 0)
91 return at;
92 }
93
94 return NULL; 106 return NULL;
107
108 for (at = first_archetype; at != NULL; at = at->next)
109 {
110 if (at->clone.type == type && strcmp (at->clone.name, name) == 0)
111 return at;
112 }
113
114 return NULL;
95} 115}
96 116
97/* This is a lot like the above function. Instead, we are trying to match 117/* This is a lot like the above function. Instead, we are trying to match
98 * the arch->skill values. type is the type of object to match 118 * the arch->skill values. type is the type of object to match
99 * against (eg, to only match against skills or only skill objects for example). 119 * against (eg, to only match against skills or only skill objects for example).
100 * If type is -1, ew don't match on type. 120 * If type is -1, ew don't match on type.
101 */ 121 */
122object *
102object *get_archetype_by_skill_name(const char *skill, int type) { 123get_archetype_by_skill_name (const char *skill, int type)
124{
103 archetype *at; 125 archetype *
126 at;
104 127
105 if (skill == NULL) 128 if (skill == NULL)
106 return NULL;
107
108 for(at = first_archetype;at!=NULL;at=at->next) {
109 if ( ((type == -1) || (type == at->clone.type)) &&
110 (!strcmp(at->clone.skill, skill)))
111 return arch_to_object(at);
112 }
113 return NULL; 129 return NULL;
130
131 for (at = first_archetype; at != NULL; at = at->next)
132 {
133 if (((type == -1) || (type == at->clone.type)) && (!strcmp (at->clone.skill, skill)))
134 return arch_to_object (at);
135 }
136 return NULL;
114} 137}
115 138
116/* similiar to above - this returns the first archetype 139/* similiar to above - this returns the first archetype
117 * that matches both the type and subtype. type and subtype 140 * that matches both the type and subtype. type and subtype
118 * can be -1 to say ignore, but in this case, the match it does 141 * can be -1 to say ignore, but in this case, the match it does
119 * may not be very useful. This function is most useful when 142 * may not be very useful. This function is most useful when
120 * subtypes are known to be unique for a particular type 143 * subtypes are known to be unique for a particular type
121 * (eg, skills) 144 * (eg, skills)
122 */ 145 */
146archetype *
123archetype *get_archetype_by_type_subtype(int type, int subtype) { 147get_archetype_by_type_subtype (int type, int subtype)
148{
124 archetype *at; 149 archetype *
150 at;
125 151
126 for(at = first_archetype;at!=NULL;at=at->next) { 152 for (at = first_archetype; at != NULL; at = at->next)
127 if ( ((type == -1) || (type == at->clone.type)) && 153 {
128 (subtype == -1 || subtype == at->clone.subtype)) 154 if (((type == -1) || (type == at->clone.type)) && (subtype == -1 || subtype == at->clone.subtype))
129 return at; 155 return at;
130 } 156 }
131 return NULL; 157 return NULL;
132} 158}
133 159
134/** 160/**
135 * GROS - this returns a new object given the name that appears during the game 161 * GROS - this returns a new object given the name that appears during the game
136 * (for example, "writing pen" instead of "stylus"). 162 * (for example, "writing pen" instead of "stylus").
… …
141 * Note by MSW - it appears that it takes the full name and keeps 167 * Note by MSW - it appears that it takes the full name and keeps
142 * shortening it until it finds a match. I re-wrote this so that it 168 * shortening it until it finds a match. I re-wrote this so that it
143 * doesn't malloc it each time - not that this function is used much, 169 * doesn't malloc it each time - not that this function is used much,
144 * but it otherwise had a big memory leak. 170 * but it otherwise had a big memory leak.
145 */ 171 */
172object *
146object *get_archetype_by_object_name(const char *name) { 173get_archetype_by_object_name (const char *name)
174{
147 archetype *at; 175 archetype *at;
148 char tmpname[MAX_BUF]; 176 char tmpname[MAX_BUF];
149 int i; 177 int i;
150 178
151 strncpy(tmpname,name,MAX_BUF-1); 179 assign (tmpname, name);
152 tmpname[MAX_BUF-1] = 0; 180
153 for(i=strlen(tmpname); i>0; i--) { 181 for (i = strlen (tmpname); i > 0; i--)
182 {
154 tmpname[i] = 0; 183 tmpname[i] = 0;
155 at = find_archetype_by_object_name(tmpname); 184 at = find_archetype_by_object_name (tmpname);
185
156 if (at !=NULL) 186 if (at != NULL)
157 { 187 {
158 return arch_to_object(at); 188 return arch_to_object (at);
159 } 189 }
160 } 190 }
191
161 return create_singularity(name); 192 return create_singularity (name);
162} 193}
163 194
164 /* This is a subset of the parse_id command. Basically, name can be 195 /* This is a subset of the parse_id command. Basically, name can be
165 * a string seperated lists of things to match, with certain keywords. 196 * a string seperated lists of things to match, with certain keywords.
166 * pl is the player (only needed to set count properly) 197 * pl is the player (only needed to set count properly)
… …
176 * player object.) 207 * player object.)
177 * If count is 1, make a quick check on the name. 208 * If count is 1, make a quick check on the name.
178 * IF count is >1, we need to make plural name. Return if match. 209 * IF count is >1, we need to make plural name. Return if match.
179 * Last, make a check on the full name. 210 * Last, make a check on the full name.
180 */ 211 */
212int
181int item_matched_string(object *pl, object *op, const char *name) 213item_matched_string (object *pl, object *op, const char *name)
182{ 214{
215 char *
216 cp,
183 char *cp, local_name[MAX_BUF]; 217 local_name[MAX_BUF];
184 int count,retval=0; 218 int
219 count,
220 retval = 0;
221
185 strcpy(local_name, name); /* strtok is destructive to name */ 222 strcpy (local_name, name); /* strtok is destructive to name */
186 223
187 for (cp=strtok(local_name,","); cp; cp=strtok(NULL,",")) { 224 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
188 while (cp[0]==' ') ++cp; /* get rid of spaces */ 225 {
226 while (cp[0] == ' ')
227 ++cp; /* get rid of spaces */
189 228
190 /* LOG(llevDebug,"Trying to match %s\n", cp);*/ 229 /* LOG(llevDebug,"Trying to match %s\n", cp); */
191 /* All is a very generic match - low match value */ 230 /* All is a very generic match - low match value */
192 if (!strcmp(cp,"all")) return 1; 231 if (!strcmp (cp, "all"))
232 return 1;
193 233
194 /* unpaid is a little more specific */ 234 /* unpaid is a little more specific */
195 if (!strcmp(cp,"unpaid") && QUERY_FLAG(op,FLAG_UNPAID)) return 2; 235 if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))
196 if (!strcmp(cp,"cursed") && QUERY_FLAG(op,FLAG_KNOWN_CURSED) &&
197 (QUERY_FLAG(op,FLAG_CURSED) ||QUERY_FLAG(op,FLAG_DAMNED)))
198 return 2; 236 return 2;
237 if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED)))
238 return 2;
199 239
200 if (!strcmp(cp,"unlocked") && !QUERY_FLAG(op, FLAG_INV_LOCKED)) 240 if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
201 return 2; 241 return 2;
202 242
203 /* Allow for things like '100 arrows' */ 243 /* Allow for things like '100 arrows' */
204 if ((count=atoi(cp))!=0) { 244 if ((count = atoi (cp)) != 0)
245 {
205 cp=strchr(cp, ' '); 246 cp = strchr (cp, ' ');
206 while (cp && cp[0]==' ') ++cp; /* get rid of spaces */ 247 while (cp && cp[0] == ' ')
248 ++cp; /* get rid of spaces */
249 }
250 else
207 } 251 {
208 else {
209 if (pl->type==PLAYER) 252 if (pl->type == PLAYER)
210 count=pl->contr->count; 253 count = pl->contr->count;
211 else 254 else
212 count = 0; 255 count = 0;
213 } 256 }
214 257
215 if (!cp || cp[0]=='\0' || count<0) return 0; 258 if (!cp || cp[0] == '\0' || count < 0)
259 return 0;
216 260
217 261
218 /* The code here should go from highest retval to lowest. That 262 /* The code here should go from highest retval to lowest. That
219 * is because of the 'else' handling - we don't want to match on 263 * is because of the 'else' handling - we don't want to match on
220 * something and set a low retval, even though it may match a higher retcal 264 * something and set a low retval, even though it may match a higher retcal
221 * later. So keep it in descending order here, so we try for the best 265 * later. So keep it in descending order here, so we try for the best
222 * match first, and work downward. 266 * match first, and work downward.
223 */ 267 */
224 if (!strcasecmp(cp,query_name(op))) retval=20; 268 if (!strcasecmp (cp, query_name (op)))
269 retval = 20;
225 else if (!strcasecmp(cp,query_short_name(op))) retval=18; 270 else if (!strcasecmp (cp, query_short_name (op)))
226 else if (!strcasecmp(cp,query_base_name(op,0))) retval=16; 271 retval = 18;
227 else if (!strcasecmp(cp,query_base_name(op,1))) retval=16;
228 else if (op->custom_name && !strcasecmp(cp,op->custom_name)) retval=15;
229 else if (!strncasecmp(cp,query_base_name(op,0), 272 else if (!strcasecmp (cp, query_base_name (op, 0)))
230 strlen(cp))) retval=14; 273 retval = 16;
231 else if (!strncasecmp(cp,query_base_name(op,1), 274 else if (!strcasecmp (cp, query_base_name (op, 1)))
232 strlen(cp))) retval=14; 275 retval = 16;
276 else if (op->custom_name && !strcasecmp (cp, op->custom_name))
277 retval = 15;
278 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))
279 retval = 14;
280 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))
281 retval = 14;
233 282
234 /* Do substring checks, so things like 'Str+1' will match. 283 /* Do substring checks, so things like 'Str+1' will match.
235 * retval of these should perhaps be lower - they are lower 284 * retval of these should perhaps be lower - they are lower
236 * then the specific strcasecmp aboves, but still higher than 285 * then the specific strcasecmp aboves, but still higher than
237 * some other match criteria. 286 * some other match criteria.
238 */ 287 */
239 else if (strstr(query_base_name(op,1), cp)) retval = 12; 288 else if (strstr (query_base_name (op, 1), cp))
289 retval = 12;
240 else if (strstr(query_base_name(op,0), cp)) retval = 12; 290 else if (strstr (query_base_name (op, 0), cp))
291 retval = 12;
241 else if (strstr(query_short_name(op), cp)) retval = 12; 292 else if (strstr (query_short_name (op), cp))
293 retval = 12;
242 294
243 /* Check against plural/non plural based on count. */ 295 /* Check against plural/non plural based on count. */
244 else if (count>1 && !strcasecmp(cp,op->name_pl)) { 296 else if (count > 1 && !strcasecmp (cp, op->name_pl))
245 retval=6;
246 } 297 {
298 retval = 6;
299 }
247 else if (count==1 && !strcasecmp(op->name,cp)) { 300 else if (count == 1 && !strcasecmp (op->name, cp))
248 retval=6;
249 } 301 {
302 retval = 6;
303 }
250 /* base name matched - not bad */ 304 /* base name matched - not bad */
251 else if (strcasecmp(cp,op->name)==0 && !count) retval=4; 305 else if (strcasecmp (cp, op->name) == 0 && !count)
306 retval = 4;
252 /* Check for partial custom name, but give a real low priority */ 307 /* Check for partial custom name, but give a real low priority */
253 else if (op->custom_name && strstr(op->custom_name, cp)) retval = 3; 308 else if (op->custom_name && strstr (op->custom_name, cp))
309 retval = 3;
254 310
255 if (retval) { 311 if (retval)
312 {
256 if (pl->type == PLAYER) 313 if (pl->type == PLAYER)
257 pl->contr->count=count; 314 pl->contr->count = count;
258 return retval; 315 return retval;
259 } 316 }
260 } 317 }
261 return 0; 318 return 0;
262} 319}
263 320
264/* 321/*
265 * Initialises the internal linked list of archetypes (read from file). 322 * Initialises the internal linked list of archetypes (read from file).
266 * Then the global "empty_archetype" pointer is initialised. 323 * Then the global "empty_archetype" pointer is initialised.
267 * Then the blocksview[] array is initialised. 324 * Then the blocksview[] array is initialised.
268 */ 325 */
269 326
270void init_archetypes(void) { /* called from add_player() and edit() */ 327void
328init_archetypes (void)
329{ /* called from add_player() and edit() */
271 if(first_archetype!=NULL) /* Only do this once */ 330 if (first_archetype != NULL) /* Only do this once */
272 return; 331 return;
273 arch_init = 1; 332 arch_init = 1;
274 load_archetypes(); 333 load_archetypes ();
275 arch_init = 0; 334 arch_init = 0;
276 empty_archetype=find_archetype("empty_archetype"); 335 empty_archetype = find_archetype ("empty_archetype");
336
277/* init_blocksview();*/ 337/* init_blocksview();*/
278} 338}
279 339
280/* 340/*
281 * Stores debug-information about how efficient the hashtable 341 * Stores debug-information about how efficient the hashtable
282 * used for archetypes has been in the static errmsg array. 342 * used for archetypes has been in the static errmsg array.
283 */ 343 */
284 344
345void
285void arch_info(object *op) { 346arch_info (object *op)
347{
286 sprintf(errmsg,"%d searches and %d strcmp()'s",arch_search,arch_cmp); 348 sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp);
287 new_draw_info(NDI_BLACK, 0, op,errmsg); 349 new_draw_info (NDI_BLACK, 0, op, errmsg);
288} 350}
289 351
290/* 352/*
291 * Initialise the hashtable used by the archetypes. 353 * Initialise the hashtable used by the archetypes.
292 */ 354 */
293 355
356void
294void clear_archetable(void) { 357clear_archetable (void)
358{
295 memset((void *) arch_table,0,ARCHTABLE*sizeof(archetype *)); 359 memset ((void *) arch_table, 0, ARCHTABLE * sizeof (archetype *));
296} 360}
297 361
298/* 362/*
299 * An alternative way to init the hashtable which is slower, but _works_... 363 * An alternative way to init the hashtable which is slower, but _works_...
300 */ 364 */
301 365
366void
302void init_archetable(void) { 367init_archetable (void)
368{
303 archetype *at; 369 archetype *
370 at;
371
304 LOG(llevDebug," Setting up archetable...\n"); 372 LOG (llevDebug, " Setting up archetable...\n");
373
305 for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) 374 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
306 add_arch(at); 375 add_arch (at);
376
307 LOG(llevDebug,"done\n"); 377 LOG (llevDebug, "done\n");
308} 378}
309 379
310/* 380/*
311 * Dumps an archetype to debug-level output. 381 * Dumps an archetype to debug-level output.
312 */ 382 */
313 383
384void
314void dump_arch(archetype *at) { 385dump_arch (archetype *at)
386{
315 dump_object(&at->clone); 387 dump_object (&at->clone);
316} 388}
317 389
318/* 390/*
319 * Dumps _all_ archetypes to debug-level output. 391 * Dumps _all_ archetypes to debug-level output.
320 * If you run crossfire with debug, and enter DM-mode, you can trigger 392 * If you run crossfire with debug, and enter DM-mode, you can trigger
321 * this with the O key. 393 * this with the O key.
322 */ 394 */
323 395
396void
324void dump_all_archetypes(void) { 397dump_all_archetypes (void)
398{
325 archetype *at; 399 archetype *
400 at;
401
326 for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) { 402 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
403 {
327 dump_arch(at); 404 dump_arch (at);
328 fprintf(logfile, "%s\n", errmsg); 405 fprintf (logfile, "%s\n", errmsg);
329 } 406 }
330} 407}
331 408
409void
332void free_all_archs(void) 410free_all_archs (void)
333{ 411{
334 archetype *at, *next; 412 archetype *
335 int i=0,f=0; 413 at, *
414 next;
415 int
416 i = 0, f = 0;
336 417
337 for (at=first_archetype; at!=NULL; at=next) { 418 for (at = first_archetype; at != NULL; at = next)
338 if (at->more) next=at->more; 419 {
420 if (at->more)
421 next = at->more;
422 else
339 else next=at->next; 423 next = at->next;
340 if (at->name) free_string(at->name); 424
341 if (at->clone.name) free_string(at->clone.name); 425 delete
342 if (at->clone.name_pl) free_string(at->clone.name_pl);
343 if (at->clone.title) free_string(at->clone.title);
344 if (at->clone.race) free_string(at->clone.race);
345 if (at->clone.slaying) free_string(at->clone.slaying);
346 if (at->clone.msg) free_string(at->clone.msg);
347 free(at); 426 at;
427
348 i++; 428 i++;
349 } 429 }
350 LOG(llevDebug,"Freed %d archetypes, %d faces\n", i, f); 430 LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
351} 431}
352 432
353/* 433archetype::archetype ()
354 * Allocates, initialises and returns the pointer to an archetype structure. 434{
355 */
356
357archetype *get_archetype_struct(void) {
358 archetype *arch;
359
360 arch=(archetype *)CALLOC(1,sizeof(archetype));
361 if(arch==NULL)
362 fatal(OUT_OF_MEMORY);
363 arch->next=NULL;
364 arch->name=NULL;
365 arch->clone.other_arch=NULL;
366 arch->clone.name=NULL;
367 arch->clone.name_pl=NULL;
368 arch->clone.title=NULL;
369 arch->clone.race=NULL;
370 arch->clone.slaying=NULL;
371 arch->clone.msg=NULL;
372 clear_object(&arch->clone); /* to initial state other also */ 435 clear_object (&clone); /* to initial state other also */
373 CLEAR_FLAG((&arch->clone),FLAG_FREED); /* This shouldn't matter, since copy_object() */ 436 CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_object() */
374 SET_FLAG((&arch->clone), FLAG_REMOVED); /* doesn't copy these flags... */ 437 SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
375 arch->head=NULL; 438}
376 arch->more=NULL; 439
377 return arch; 440archetype::~archetype ()
441{
378} 442}
379 443
380/* 444/*
381 * Reads/parses the archetype-file, and copies into a linked list 445 * Reads/parses the archetype-file, and copies into a linked list
382 * of archetype-structures. 446 * of archetype-structures.
383 */ 447 */
448void
384void first_arch_pass(object_thawer &fp) { 449first_arch_pass (object_thawer & fp)
385 object *op; 450{
451 archetype *
452 at, *
386 archetype *at,*head=NULL,*last_more=NULL; 453 head = NULL, *last_more = NULL;
387 int i,first=2;
388 454
389 op=get_object(); 455 at->clone.arch = first_archetype = at = new archetype;
390 op->arch=first_archetype=at=get_archetype_struct();
391 456
392 while((i=load_object(fp,op,first,0))) { 457 while (int i = load_object (fp, &at->clone, 0))
393 first=0; 458 {
394 copy_object(op,&at->clone);
395 at->clone.speed_left= (float) (-0.1); 459 at->clone.speed_left = (float) (-0.1);
396 /* copy the body_info to the body_used - this is only really 460 /* copy the body_info to the body_used - this is only really
397 * need for monsters, but doesn't hurt to do it for everything. 461 * need for monsters, but doesn't hurt to do it for everything.
398 * by doing so, when a monster is created, it has good starting 462 * by doing so, when a monster is created, it has good starting
399 * values for the body_used info, so when items are created 463 * values for the body_used info, so when items are created
400 * for it, they can be properly equipped. 464 * for it, they can be properly equipped.
401 */ 465 */
402 memcpy(&at->clone.body_used, &op->body_info, sizeof(op->body_info)); 466 memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info));
403 467
404 switch(i) { 468 switch (i)
469 {
405 case LL_NORMAL: /* A new archetype, just link it with the previous */ 470 case LL_NORMAL: /* A new archetype, just link it with the previous */
406 if(last_more!=NULL) 471 if (last_more != NULL)
407 last_more->next=at; 472 last_more->next = at;
408 if(head!=NULL) 473 if (head != NULL)
409 head->next=at; 474 head->next = at;
410 head=last_more=at; 475 head = last_more = at;
411#if 0 476#if 0
412 if(!op->type) 477 if (!op->type)
413 LOG(llevDebug," WARNING: Archetype %s has no type info!\n", op->arch->name); 478 LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
414#endif 479#endif
415 at->tail_x = 0; 480 at->tail_x = 0;
416 at->tail_y = 0; 481 at->tail_y = 0;
417 break; 482 break;
418 483
419 case LL_MORE: /* Another part of the previous archetype, link it correctly */ 484 case LL_MORE: /* Another part of the previous archetype, link it correctly */
420 485
421 at->head=head; 486 at->head = head;
422 at->clone.head = &head->clone; 487 at->clone.head = &head->clone;
423 if(last_more!=NULL) { 488 if (last_more != NULL)
489 {
424 last_more->more=at; 490 last_more->more = at;
425 last_more->clone.more = &at->clone; 491 last_more->clone.more = &at->clone;
426 } 492 }
427 last_more=at; 493 last_more = at;
428 494
429 /* If this multipart image is still composed of individual small 495 /* If this multipart image is still composed of individual small
430 * images, don't set the tail_.. values. We can't use them anyways, 496 * images, don't set the tail_.. values. We can't use them anyways,
431 * and setting these to zero makes the map sending to the client much 497 * and setting these to zero makes the map sending to the client much
432 * easier as just looking at the head, we know what to do. 498 * easier as just looking at the head, we know what to do.
433 */ 499 */
434 if (at->clone.face != head->clone.face) { 500 if (at->clone.face != head->clone.face)
501 {
435 head->tail_x = 0; 502 head->tail_x = 0;
436 head->tail_y = 0; 503 head->tail_y = 0;
437 } else {
438 if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
439 if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
440 } 504 }
505 else
506 {
507 if (at->clone.x > head->tail_x)
508 head->tail_x = at->clone.x;
509 if (at->clone.y > head->tail_y)
510 head->tail_y = at->clone.y;
511 }
441 break; 512 break;
442 513
443 } 514 }
444 515
445 at=get_archetype_struct(); 516 at = new archetype;
446 clear_object(op); 517
447 op->arch=at; 518 at->clone.arch = at;
448 } 519 }
449 free(at); 520
450 free_object(op); 521 delete at;
451} 522}
452 523
453/* 524/*
454 * Reads the archetype file once more, and links all pointers between 525 * Reads the archetype file once more, and links all pointers between
455 * archetypes. 526 * archetypes.
456 */ 527 */
457 528
458void second_arch_pass(FILE *fp) { 529void
459 char buf[MAX_BUF],*variable=buf,*argument,*cp; 530second_arch_pass (object_thawer & thawer)
460 archetype *at=NULL,*other; 531{
532 char
533 buf[MAX_BUF], *
534 variable = buf, *argument, *cp;
535 archetype *
536 at = NULL, *other;
461 537
462 while(fgets(buf,MAX_BUF,fp)!=NULL) { 538 while (fgets (buf, MAX_BUF, thawer) != NULL)
539 {
463 if(*buf=='#') 540 if (*buf == '#')
464 continue; 541 continue;
465 if((argument=strchr(buf,' '))!=NULL) { 542 if ((argument = strchr (buf, ' ')) != NULL)
543 {
466 *argument='\0',argument++; 544 *argument = '\0', argument++;
467 cp = argument + strlen(argument)-1; 545 cp = argument + strlen (argument) - 1;
468 while (isspace(*cp)) { 546 while (isspace (*cp))
547 {
469 *cp='\0'; 548 *cp = '\0';
470 cp--; 549 cp--;
471 } 550 }
472 } 551 }
473 if(!strcmp("Object",variable)) { 552 if (!strcmp ("Object", variable))
553 {
474 if((at=find_archetype(argument))==NULL) 554 if ((at = find_archetype (argument)) == NULL)
475 LOG(llevError,"Warning: failed to find arch %s\n",argument); 555 LOG (llevError, "Warning: failed to find arch %s\n", argument);
556 }
476 } else if(!strcmp("other_arch",variable)) { 557 else if (!strcmp ("other_arch", variable))
558 {
477 if(at!=NULL&&at->clone.other_arch==NULL) { 559 if (at != NULL && at->clone.other_arch == NULL)
560 {
478 if((other=find_archetype(argument))==NULL) 561 if ((other = find_archetype (argument)) == NULL)
479 LOG(llevError,"Warning: failed to find other_arch %s\n",argument); 562 LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
480 else if(at!=NULL) 563 else if (at != NULL)
481 at->clone.other_arch=other; 564 at->clone.other_arch = other;
565 }
482 } 566 }
483 } else if(!strcmp("randomitems",variable)) { 567 else if (!strcmp ("randomitems", variable))
568 {
484 if(at!=NULL) { 569 if (at != NULL)
570 {
571 treasurelist *
485 treasurelist *tl=find_treasurelist(argument); 572 tl = find_treasurelist (argument);
573
486 if(tl==NULL) 574 if (tl == NULL)
487 LOG(llevError,"Failed to link treasure to arch (%s): %s\n",at->name, argument); 575 LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
488 else 576 else
489 at->clone.randomitems=tl; 577 at->clone.randomitems = tl;
578 }
490 } 579 }
491 }
492 } 580 }
493} 581}
494 582
495#ifdef DEBUG 583#ifdef DEBUG
584void
496void check_generators(void) { 585check_generators (void)
586{
497 archetype *at; 587 archetype *
588 at;
589
498 for(at=first_archetype;at!=NULL;at=at->next) 590 for (at = first_archetype; at != NULL; at = at->next)
499 if(QUERY_FLAG(&at->clone,FLAG_GENERATOR)&&at->clone.other_arch==NULL) 591 if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
500 LOG(llevError,"Warning: %s is generator but lacks other_arch.\n", 592 LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
501 at->name);
502} 593}
503#endif 594#endif
504 595
505/* 596/*
506 * First initialises the archtype hash-table (init_archetable()). 597 * First initialises the archtype hash-table (init_archetable()).
… …
510 */ 601 */
511 602
512void 603void
513load_archetypes (void) 604load_archetypes (void)
514{ 605{
606 char
515 char filename[MAX_BUF]; 607 filename[MAX_BUF];
516 int comp; 608
517#if TIME_ARCH_LOAD 609#if TIME_ARCH_LOAD
518 struct timeval tv1, tv2; 610 struct timeval
611 tv1,
612 tv2;
519#endif 613#endif
520 614
521 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); 615 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
522 LOG (llevDebug, "Reading archetypes from %s:\n", filename); 616 LOG (llevDebug, "Reading archetypes from %s:\n", filename);
523 617
524 { 618 {
619 object_thawer
525 object_thawer thawer (filename); 620 thawer (filename);
526 621
527 clear_archetable (); 622 clear_archetable ();
528 LOG (llevDebug, " arch-pass 1...\n"); 623 LOG (llevDebug, " arch-pass 1...\n");
529 first_arch_pass (thawer); 624 first_arch_pass (thawer);
530 LOG (llevDebug, " done\n"); 625 LOG (llevDebug, " done\n");
531
532 init_archetable ();
533 warn_archetypes = 1;
534 } 626 }
535 627
628 init_archetable ();
629 warn_archetypes = 1;
630
536 { 631 {
632 object_thawer
537 object_thawer thawer (filename); 633 thawer (filename);
538 634
539 LOG (llevDebug, " loading treasure...\n"); 635 LOG (llevDebug, " loading treasure...\n");
540 load_treasures (); 636 load_treasures ();
541 LOG (llevDebug, " done\n arch-pass 2...\n"); 637 LOG (llevDebug, " done\n arch-pass 2...\n");
542 second_arch_pass (thawer); 638 second_arch_pass (thawer);
… …
551/* 647/*
552 * Creates and returns a new object which is a copy of the given archetype. 648 * Creates and returns a new object which is a copy of the given archetype.
553 * This function returns NULL on failure. 649 * This function returns NULL on failure.
554 */ 650 */
555 651
652object *
556object *arch_to_object(archetype *at) { 653arch_to_object (archetype *at)
654{
557 object *op; 655 object *
656 op;
657
558 if(at==NULL) { 658 if (at == NULL)
659 {
559 if(warn_archetypes) 660 if (warn_archetypes)
560 LOG(llevError,"Couldn't find archetype.\n"); 661 LOG (llevError, "Couldn't find archetype.\n");
662
561 return NULL; 663 return NULL;
562 } 664 }
665
563 op=get_object(); 666 op = get_object ();
564 copy_object(&at->clone,op); 667 copy_object (&at->clone, op);
668 op->arch = at;
565 op->instantiate (); 669 op->instantiate ();
566 op->arch=at;
567 return op; 670 return op;
568} 671}
569 672
570/* 673/*
571 * Creates an object. This function is called by get_archetype() 674 * Creates an object. This function is called by get_archetype()
572 * if it fails to find the appropriate archetype. 675 * if it fails to find the appropriate archetype.
573 * Thus get_archetype() will be guaranteed to always return 676 * Thus get_archetype() will be guaranteed to always return
574 * an object, and never NULL. 677 * an object, and never NULL.
575 */ 678 */
576 679
680object *
577object *create_singularity(const char *name) { 681create_singularity (const char *name)
682{
578 object *op; 683 object *
684 op;
685 char
579 char buf[MAX_BUF]; 686 buf[MAX_BUF];
687
580 sprintf(buf,"%s (%s)",ARCH_SINGULARITY,name); 688 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
581 op = get_object(); 689 op = get_object ();
582 op->name = add_string(buf); 690 op->name = op->name_pl = buf;
583 op->name_pl = add_string(buf);
584 SET_FLAG(op,FLAG_NO_PICK); 691 SET_FLAG (op, FLAG_NO_PICK);
585 return op; 692 return op;
586} 693}
587 694
588/* 695/*
589 * Finds which archetype matches the given name, and returns a new 696 * Finds which archetype matches the given name, and returns a new
590 * object containing a copy of the archetype. 697 * object containing a copy of the archetype.
591 */ 698 */
592 699
700object *
593object *get_archetype(const char *name) { 701get_archetype (const char *name)
702{
594 archetype *at; 703 archetype *
704 at;
705
595 at = find_archetype(name); 706 at = find_archetype (name);
596 if (at == NULL) 707 if (at == NULL)
597 return create_singularity(name); 708 return create_singularity (name);
709
598 return arch_to_object(at); 710 return arch_to_object (at);
599} 711}
600 712
601/* 713/*
602 * Hash-function used by the arch-hashtable. 714 * Hash-function used by the arch-hashtable.
603 */ 715 */
604 716
605unsigned long 717unsigned long
606hasharch(const char *str, int tablesize) { 718hasharch (const char *str, int tablesize)
607 unsigned long hash = 0; 719{
720 unsigned long
721 hash = 0;
722 unsigned int
608 int i = 0; 723 i = 0;
609 const char *p; 724 const char *
725 p;
610 726
611 /* use the one-at-a-time hash function, which supposedly is 727 /* use the one-at-a-time hash function, which supposedly is
612 * better than the djb2-like one used by perl5.005, but 728 * better than the djb2-like one used by perl5.005, but
613 * certainly is better then the bug used here before. 729 * certainly is better then the bug used here before.
614 * see http://burtleburtle.net/bob/hash/doobs.html 730 * see http://burtleburtle.net/bob/hash/doobs.html
615 */ 731 */
616 for (p = str; i < MAXSTRING && *p; p++, i++) { 732 for (p = str; i < MAXSTRING && *p; p++, i++)
733 {
617 hash += *p; 734 hash += *p;
618 hash += hash << 10; 735 hash += hash << 10;
619 hash ^= hash >> 6; 736 hash ^= hash >> 6;
620 } 737 }
738
621 hash += hash << 3; 739 hash += hash << 3;
622 hash ^= hash >> 11; 740 hash ^= hash >> 11;
623 hash += hash << 15; 741 hash += hash << 15;
742
624 return hash % tablesize; 743 return hash % tablesize;
625} 744}
626 745
627/* 746/*
628 * Finds, using the hashtable, which archetype matches the given name. 747 * Finds, using the hashtable, which archetype matches the given name.
629 * returns a pointer to the found archetype, otherwise NULL. 748 * returns a pointer to the found archetype, otherwise NULL.
630 */ 749 */
631 750
751archetype *
632archetype *find_archetype(const char *name) { 752find_archetype (const char *name)
753{
754#if USE_UNORDERED_MAP
755 name = shstr::find (name);
756
757 if (!name)
758 return 0;
759
760 AUTODECL (i, ht.find ((size_t) name));
761
762 if (i == ht.end ())
763 return 0;
764 else
765 return i->second;
766#endif
767
633 archetype *at; 768 archetype *
769 at;
634 unsigned long index; 770 unsigned long
771 index;
635 772
636 if (name == NULL) 773 if (name == NULL)
637 return (archetype *) NULL; 774 return (archetype *) NULL;
638 775
639 index=hasharch(name, ARCHTABLE); 776 index = hasharch (name, ARCHTABLE);
640 arch_search++; 777 arch_search++;
641 for(;;) { 778 for (;;)
779 {
642 at = arch_table[index]; 780 at = arch_table[index];
643 if (at==NULL) { 781 if (at == NULL)
782 {
644 if(warn_archetypes) 783 if (warn_archetypes)
645 LOG(llevError,"Couldn't find archetype %s\n",name); 784 LOG (llevError, "Couldn't find archetype %s\n", name);
646 return NULL; 785 return NULL;
647 } 786 }
648 arch_cmp++; 787 arch_cmp++;
649 if (!strcmp(at->name,name)) 788 if (!strcmp ((const char *) at->name, name))
650 return at; 789 return at;
651 if(++index>=ARCHTABLE) 790 if (++index >= ARCHTABLE)
652 index=0; 791 index = 0;
653 } 792 }
654} 793}
655 794
656/* 795/*
657 * Adds an archetype to the hashtable. 796 * Adds an archetype to the hashtable.
658 */ 797 */
659 798
799static void
660static void add_arch(archetype *at) { 800add_arch (archetype *at)
801{
802#if USE_UNORDERED_MAP
803 ht.insert (std::make_pair ((size_t) (const char *) at->name, at));
804#endif
805
806 int
661 int index=hasharch(at->name, ARCHTABLE),org_index=index; 807 index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index;
808
662 for(;;) { 809 for (;;)
810 {
663 if(arch_table[index]==NULL) { 811 if (arch_table[index] == NULL)
812 {
664 arch_table[index]=at; 813 arch_table[index] = at;
665 return; 814 return;
666 } 815 }
816
667 if(++index==ARCHTABLE) 817 if (++index == ARCHTABLE)
668 index=0; 818 index = 0;
819
669 if(index==org_index) 820 if (index == org_index)
670 fatal(ARCHTABLE_TOO_SMALL); 821 fatal (ARCHTABLE_TOO_SMALL);
671 } 822 }
672} 823}
673 824
674/* 825/*
675 * Returns the first archetype using the given type. 826 * Returns the first archetype using the given type.
676 * Used in treasure-generation. 827 * Used in treasure-generation.
677 */ 828 */
678 829
830archetype *
679archetype *type_to_archetype(int type) { 831type_to_archetype (int type)
832{
680 archetype *at; 833 archetype *
834 at;
681 835
682 for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) 836 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
683 if(at->clone.type==type) 837 if (at->clone.type == type)
684 return at; 838 return at;
685 return NULL; 839 return NULL;
686} 840}
687 841
688/* 842/*
689 * Returns a new object copied from the first archetype matching 843 * Returns a new object copied from the first archetype matching
690 * the given type. 844 * the given type.
691 * Used in treasure-generation. 845 * Used in treasure-generation.
692 */ 846 */
693 847
848object *
694object *clone_arch(int type) { 849clone_arch (int type)
850{
695 archetype *at; 851 archetype *
696 object *op=get_object(); 852 at;
853 object *
854 op = get_object ();
697 855
698 if((at=type_to_archetype(type))==NULL) { 856 if ((at = type_to_archetype (type)) == NULL)
857 {
699 LOG(llevError,"Can't clone archetype %d\n",type); 858 LOG (llevError, "Can't clone archetype %d\n", type);
700 free_object(op); 859 free_object (op);
701 return NULL; 860 return NULL;
702 } 861 }
703 copy_object(&at->clone,op); 862 copy_object (&at->clone, op);
704 op->instantiate (); 863 op->instantiate ();
705 return op; 864 return op;
706} 865}
707 866
708/* 867/*
709 * member: make instance from class 868 * member: make instance from class
710 */ 869 */
711 870
871object *
712object *object_create_arch (archetype * at) 872object_create_arch (archetype *at)
713{ 873{
874 object *
875 op, *
714 object *op, *prev = NULL, *head = NULL; 876 prev = NULL, *head = NULL;
715 877
716 while (at) { 878 while (at)
879 {
717 op = arch_to_object (at); 880 op = arch_to_object (at);
718 op->x = at->clone.x; 881 op->x = at->clone.x;
719 op->y = at->clone.y; 882 op->y = at->clone.y;
720 if (head) 883 if (head)
721 op->head = head, prev->more = op; 884 op->head = head, prev->more = op;
722 if (!head) 885 if (!head)
723 head = op; 886 head = op;
724 prev = op; 887 prev = op;
725 at = at->more; 888 at = at->more;
726 } 889 }
727 return (head); 890 return (head);
728} 891}
729 892
730/*** end of arch.c ***/ 893/*** end of arch.c ***/

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines