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