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