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