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,2008 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> |
|
|
29 | #include <loader.h> |
27 | #include <loader.h> |
30 | |
28 | |
31 | #include <tr1/functional> |
29 | #include <tr1/functional> |
32 | #include <tr1/unordered_map> |
30 | #include <tr1/unordered_map> |
33 | |
31 | |
34 | int arch_init; /* True if doing arch initialization */ |
32 | archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing |
35 | |
33 | arch_ptr archetype::empty; |
36 | /* The naming of these functions is really poor - they are all |
|
|
37 | * pretty much named '.._arch_...', but they may more may not |
|
|
38 | * return archetypes. Some make the arch_to_object call, and thus |
|
|
39 | * return an object. Perhaps those should be called 'archob' functions |
|
|
40 | * to denote they return an object derived from the archetype. |
|
|
41 | * MSW 2003-04-29 |
|
|
42 | */ |
|
|
43 | |
34 | |
44 | // the hashtable |
35 | // the hashtable |
45 | typedef std::tr1::unordered_map |
36 | typedef std::tr1::unordered_map |
46 | < |
37 | < |
47 | const char *, |
38 | const char *, |
… | |
… | |
49 | str_hash, |
40 | str_hash, |
50 | str_equal, |
41 | str_equal, |
51 | slice_allocator< std::pair<const char *const, arch_ptr> > |
42 | slice_allocator< std::pair<const char *const, arch_ptr> > |
52 | > HT; |
43 | > HT; |
53 | |
44 | |
54 | static HT ht (5000); |
45 | static HT ht (10000); |
|
|
46 | archvec archetypes; |
|
|
47 | static unordered_vector<archetype *> allarch; |
|
|
48 | static int dirtycnt; |
|
|
49 | |
|
|
50 | // the vector of other_arch references to be resolved |
|
|
51 | static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; |
|
|
52 | // the vector of loaded but not yet committed archetypes |
|
|
53 | static std::vector<archetype *> postponed_arch; |
55 | |
54 | |
56 | /** |
55 | /** |
57 | * GROS - This function retrieves an archetype given the name that appears |
56 | * GROS - This function retrieves an archetype given the name that appears |
58 | * during the game (for example, "writing pen" instead of "stylus"). |
57 | * during the game (for example, "writing pen" instead of "stylus"). |
59 | * It does not use the hashtable system, but browse the whole archlist each time. |
58 | * It does not use the hashtable system, but browse the whole archlist each time. |
… | |
… | |
65 | * - the archetype found or null if nothing was found. |
64 | * - the archetype found or null if nothing was found. |
66 | */ |
65 | */ |
67 | archetype * |
66 | archetype * |
68 | find_archetype_by_object_name (const char *name) |
67 | find_archetype_by_object_name (const char *name) |
69 | { |
68 | { |
70 | archetype *at; |
69 | shstr_cmp name_cmp (name); |
71 | |
70 | |
72 | if (name == NULL) |
71 | for_all_archetypes (at) |
73 | return (archetype *) NULL; |
72 | if (at->name == name_cmp) |
74 | |
|
|
75 | for (at = first_archetype; at != NULL; at = at->next) |
|
|
76 | { |
|
|
77 | if (!strcmp (at->clone.name, name)) |
|
|
78 | return at; |
73 | return at; |
79 | } |
74 | |
80 | return NULL; |
75 | return 0; |
81 | } |
76 | } |
82 | |
77 | |
83 | /** |
78 | /** |
84 | * This function retrieves an archetype by type and name that appears during |
79 | * This function retrieves an archetype by type and name that appears during |
85 | * the game. It is basically the same as find_archetype_by_object_name() |
80 | * the game. It is basically the same as find_archetype_by_object_name() |
86 | * except that it considers only items of the given type. |
81 | * except that it considers only items of the given type. |
87 | */ |
82 | */ |
88 | archetype * |
83 | archetype * |
89 | find_archetype_by_object_type_name (int type, const char *name) |
84 | find_archetype_by_object_type_name (int type, const char *name) |
90 | { |
85 | { |
91 | archetype *at; |
86 | shstr_cmp name_cmp (name); |
92 | |
87 | |
93 | if (name == NULL) |
88 | for_all_archetypes (at) |
94 | return NULL; |
89 | if (at->name == name_cmp && at->type == type) |
95 | |
|
|
96 | for (at = first_archetype; at != NULL; at = at->next) |
|
|
97 | { |
|
|
98 | if (at->clone.type == type && strcmp (at->clone.name, name) == 0) |
|
|
99 | return at; |
90 | return at; |
100 | } |
|
|
101 | |
91 | |
102 | return NULL; |
92 | return 0; |
103 | } |
93 | } |
104 | |
94 | |
105 | /* This is a lot like the above function. Instead, we are trying to match |
95 | /* This is a lot like the above function. Instead, we are trying to match |
106 | * the arch->skill values. type is the type of object to match |
96 | * the arch->skill values. type is the type of object to match |
107 | * against (eg, to only match against skills or only skill objects for example). |
97 | * against (eg, to only match against skills or only skill objects for example). |
108 | * If type is -1, ew don't match on type. |
98 | * If type is -1, ew don't match on type. |
109 | */ |
99 | */ |
110 | object * |
100 | object * |
111 | get_archetype_by_skill_name (const char *skill, int type) |
101 | get_archetype_by_skill_name (const char *skill, int type) |
112 | { |
102 | { |
113 | archetype *at; |
103 | shstr_cmp skill_cmp (skill); |
114 | |
104 | |
115 | if (skill) |
105 | for_all_archetypes (at) |
116 | for (at = first_archetype; at; at = at->next) |
106 | if (at->skill == skill_cmp && (type == -1 || type == at->type)) |
117 | if (((type == -1) || (type == at->clone.type)) && (!strcmp (at->clone.skill, skill))) |
|
|
118 | return arch_to_object (at); |
107 | return arch_to_object (at); |
119 | |
108 | |
120 | return 0; |
109 | return 0; |
121 | } |
110 | } |
122 | |
111 | |
123 | /* similiar to above - this returns the first archetype |
112 | /* similiar to above - this returns the first archetype |
… | |
… | |
128 | * (eg, skills) |
117 | * (eg, skills) |
129 | */ |
118 | */ |
130 | archetype * |
119 | archetype * |
131 | get_archetype_by_type_subtype (int type, int subtype) |
120 | get_archetype_by_type_subtype (int type, int subtype) |
132 | { |
121 | { |
133 | archetype * |
122 | for_all_archetypes (at) |
134 | at; |
|
|
135 | |
|
|
136 | for (at = first_archetype; at != NULL; at = at->next) |
|
|
137 | { |
|
|
138 | if (((type == -1) || (type == at->clone.type)) && (subtype == -1 || subtype == at->clone.subtype)) |
123 | if ((type == -1 || type == at->type) && (subtype == -1 || subtype == at->subtype)) |
139 | return at; |
124 | return at; |
140 | } |
125 | |
141 | return NULL; |
126 | return 0; |
142 | } |
127 | } |
143 | |
128 | |
144 | /** |
129 | /** |
145 | * GROS - this returns a new object given the name that appears during the game |
130 | * GROS - this returns a new object given the name that appears during the game |
146 | * (for example, "writing pen" instead of "stylus"). |
131 | * (for example, "writing pen" instead of "stylus"). |
… | |
… | |
154 | * but it otherwise had a big memory leak. |
139 | * but it otherwise had a big memory leak. |
155 | */ |
140 | */ |
156 | object * |
141 | object * |
157 | get_archetype_by_object_name (const char *name) |
142 | get_archetype_by_object_name (const char *name) |
158 | { |
143 | { |
159 | archetype *at; |
|
|
160 | char tmpname[MAX_BUF]; |
144 | char tmpname[MAX_BUF]; |
161 | int i; |
145 | int i; |
162 | |
146 | |
163 | assign (tmpname, name); |
147 | assign (tmpname, name); |
164 | |
148 | |
165 | for (i = strlen (tmpname); i > 0; i--) |
149 | for (i = strlen (tmpname); i > 0; i--) |
166 | { |
150 | { |
167 | tmpname[i] = 0; |
151 | tmpname[i] = 0; |
|
|
152 | |
168 | at = find_archetype_by_object_name (tmpname); |
153 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
169 | |
|
|
170 | if (at) |
|
|
171 | return arch_to_object (at); |
154 | return arch_to_object (at); |
172 | } |
155 | } |
173 | |
156 | |
174 | return create_singularity (name); |
157 | return create_singularity (name); |
175 | } |
158 | } |
176 | |
159 | |
177 | /* This is a subset of the parse_id command. Basically, name can be |
160 | /* This is a subset of the parse_id command. Basically, name can be |
178 | * a string seperated lists of things to match, with certain keywords. |
161 | * a string seperated lists of things to match, with certain keywords. |
179 | * pl is the player (only needed to set count properly) |
162 | * pl is the player (only needed to set count properly) |
180 | * op is the item we are trying to match. Calling function takes care |
163 | * op is the item we are trying to match. Calling function takes care |
181 | * of what action might need to be done and if it is valid |
164 | * of what action might need to be done and if it is valid |
182 | * (pickup, drop, etc.) Return NONZERO if we have a match. A higher |
165 | * (pickup, drop, etc.) Return NONZERO if we have a match. A higher |
183 | * value means a better match. 0 means no match. |
166 | * value means a better match. 0 means no match. |
184 | * |
167 | * |
185 | * Brief outline of the procedure: |
168 | * Brief outline of the procedure: |
186 | * We take apart the name variable into the individual components. |
169 | * We take apart the name variable into the individual components. |
187 | * cases for 'all' and unpaid are pretty obvious. |
170 | * cases for 'all' and unpaid are pretty obvious. |
188 | * Next, we check for a count (either specified in name, or in the |
171 | * Next, we check for a count (either specified in name, or in the |
189 | * player object.) |
172 | * player object.) |
190 | * If count is 1, make a quick check on the name. |
173 | * If count is 1, make a quick check on the name. |
191 | * IF count is >1, we need to make plural name. Return if match. |
174 | * IF count is >1, we need to make plural name. Return if match. |
192 | * Last, make a check on the full name. |
175 | * Last, make a check on the full name. |
193 | */ |
176 | */ |
194 | int |
177 | int |
195 | item_matched_string (object *pl, object *op, const char *name) |
178 | item_matched_string (object *pl, object *op, const char *name) |
196 | { |
179 | { |
197 | char *cp, local_name[MAX_BUF]; |
180 | char *cp, local_name[MAX_BUF]; |
198 | int count, retval = 0; |
181 | int count, retval = 0; |
199 | |
182 | |
200 | strcpy (local_name, name); /* strtok is destructive to name */ |
183 | assign (local_name, name); /* strtok is destructive to name */ |
201 | |
184 | |
202 | for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) |
185 | for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) |
203 | { |
186 | { |
204 | while (cp[0] == ' ') |
187 | while (cp[0] == ' ') |
205 | ++cp; /* get rid of spaces */ |
188 | ++cp; /* get rid of spaces */ |
… | |
… | |
290 | } |
273 | } |
291 | |
274 | |
292 | return 0; |
275 | return 0; |
293 | } |
276 | } |
294 | |
277 | |
295 | /* |
278 | archetype::archetype (const char *name) |
296 | * Initialises the internal linked list of archetypes (read from file). |
279 | { |
297 | * Then the global "empty_archetype" pointer is initialised. |
280 | arch = this; |
298 | * Then the blocksview[] array is initialised. |
281 | this->archname = this->name = this->name_pl = name; |
299 | */ |
282 | } |
|
|
283 | |
|
|
284 | archetype::~archetype () |
|
|
285 | { |
|
|
286 | unlink (); |
|
|
287 | } |
300 | |
288 | |
301 | void |
289 | void |
302 | init_archetypes (void) |
290 | archetype::link () |
303 | { /* called from add_player() and edit() */ |
291 | { |
304 | if (first_archetype != NULL) /* Only do this once */ |
292 | if (!archetypes.contains (this)) |
305 | return; |
293 | { |
306 | |
294 | archetypes.insert (this); |
307 | arch_init = 1; |
295 | ht.insert (std::make_pair (archname, this)); |
308 | load_archetypes (); |
296 | } |
309 | arch_init = 0; |
|
|
310 | empty_archetype = archetype::find ("empty_archetype"); |
|
|
311 | |
|
|
312 | /* init_blocksview();*/ |
|
|
313 | } |
297 | } |
314 | |
298 | |
315 | /* |
|
|
316 | * An alternative way to init the hashtable which is slower, but _works_... |
|
|
317 | */ |
|
|
318 | void |
299 | void |
319 | init_archetable (void) |
300 | archetype::unlink () |
320 | { |
301 | { |
|
|
302 | if (archetypes.contains (this)) |
|
|
303 | { |
|
|
304 | archetypes.erase (this); |
|
|
305 | ht.erase (archname); |
|
|
306 | } |
|
|
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 | */ |
321 | archetype *at; |
313 | archetype * |
|
|
314 | archetype::find (const char *name) |
|
|
315 | { |
|
|
316 | if (!name) |
|
|
317 | return 0; |
322 | |
318 | |
323 | LOG (llevDebug, " Setting up archetable...\n"); |
319 | auto (i, ht.find (name)); |
324 | |
320 | |
325 | for (at = first_archetype; at; at = at->more ? at->more : at->next) |
321 | if (i == ht.end ()) |
326 | at->hash_add (); |
322 | return 0; |
|
|
323 | else |
|
|
324 | return i->second; |
|
|
325 | } |
327 | |
326 | |
328 | LOG (llevDebug, "done\n"); |
327 | archetype * |
|
|
328 | archetype::read (object_thawer &f) |
|
|
329 | { |
|
|
330 | assert (f.kw == KW_object); |
|
|
331 | |
|
|
332 | std::vector<archetype *> parts; |
|
|
333 | |
|
|
334 | coroapi::cede_to_tick (); |
|
|
335 | |
|
|
336 | for (;;) |
|
|
337 | { |
|
|
338 | archetype *at = new archetype (f.get_str ()); |
|
|
339 | |
|
|
340 | f.next (); |
|
|
341 | |
|
|
342 | #if 0 |
|
|
343 | // implementing it here in the server does neither allow multiple inheritence |
|
|
344 | // nor does it cleanly "just override". it would allow use in map files, though, |
|
|
345 | // and other resource files dynamically laoded (as opposed to being preprocessed). |
|
|
346 | // not that any of this is relevant as of yet... |
|
|
347 | if (f.kw == KW_inherit) |
|
|
348 | { |
|
|
349 | if (archetype *at = find (f.get_str ())) |
|
|
350 | *op = at->clone; |
|
|
351 | else |
|
|
352 | LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n", |
|
|
353 | &at->archname, f.get_str ()); |
|
|
354 | |
|
|
355 | f.next (); |
|
|
356 | } |
|
|
357 | #endif |
|
|
358 | |
|
|
359 | loading_arch = at; // hack to tell parse_kv et al. to behave |
|
|
360 | bool parse_ok = at->parse_kv (f); |
|
|
361 | loading_arch = 0; |
|
|
362 | |
|
|
363 | if (!parse_ok) |
|
|
364 | goto fail; |
|
|
365 | |
|
|
366 | loading_arch = at; // hack to tell parse_kv et al. to behave |
|
|
367 | at->post_load_check (); |
|
|
368 | loading_arch = 0; |
|
|
369 | |
|
|
370 | parts.push_back (at); |
|
|
371 | |
|
|
372 | if (f.kw != KW_more) |
|
|
373 | break; |
|
|
374 | |
|
|
375 | f.next (); |
|
|
376 | |
|
|
377 | if (f.kw != KW_object) |
|
|
378 | { |
|
|
379 | f.parse_error ("more object"); |
|
|
380 | goto fail; |
|
|
381 | } |
|
|
382 | } |
|
|
383 | |
|
|
384 | { |
|
|
385 | auto (at, parts.begin ()); |
|
|
386 | |
|
|
387 | archetype *new_head = parts.front (); |
|
|
388 | archetype *old_head = find (new_head->archname); |
|
|
389 | |
|
|
390 | if (old_head && !old_head->is_head ()) |
|
|
391 | { |
|
|
392 | LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n", |
|
|
393 | &new_head->archname, &old_head->archname); |
|
|
394 | goto fail; |
|
|
395 | } |
|
|
396 | |
|
|
397 | // check that all archetypes belong to the same old object or are new |
|
|
398 | for (auto (at, parts.begin ()); at != parts.end (); ++at) |
|
|
399 | { |
|
|
400 | archetype *new_part = *at; |
|
|
401 | archetype *old_part = find (new_part->archname); |
|
|
402 | |
|
|
403 | if (old_part && old_part->head_ () != old_head) |
|
|
404 | { |
|
|
405 | LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n", |
|
|
406 | &new_part->archname, &((archetype *)old_part->head_ ())->archname); |
|
|
407 | goto fail; |
|
|
408 | } |
|
|
409 | } |
|
|
410 | |
|
|
411 | // assemble new chain |
|
|
412 | new_head->min_x = new_head->max_x = new_head->x; |
|
|
413 | new_head->min_y = new_head->max_y = new_head->y; |
|
|
414 | |
|
|
415 | archetype *less = new_head; |
|
|
416 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
|
|
417 | { |
|
|
418 | archetype *at = *p; |
|
|
419 | |
|
|
420 | // some flags get inherited from the head (probably a lot more) |
|
|
421 | // doing it here doesn't feel too cozy, but it allows code |
|
|
422 | // to ignore head checks for these flags, which saves time |
|
|
423 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
|
|
424 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
|
|
425 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
|
|
426 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
|
|
427 | |
|
|
428 | new_head->min_x = min (new_head->min_x, at->x); |
|
|
429 | new_head->min_y = min (new_head->min_y, at->y); |
|
|
430 | new_head->max_x = max (new_head->max_x, at->x); |
|
|
431 | new_head->max_y = max (new_head->max_y, at->y); |
|
|
432 | |
|
|
433 | at->head = new_head; |
|
|
434 | less->more = at; |
|
|
435 | less = at; |
|
|
436 | } |
|
|
437 | |
|
|
438 | postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ()); |
|
|
439 | |
|
|
440 | return new_head; |
|
|
441 | } |
|
|
442 | |
|
|
443 | fail: |
|
|
444 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
|
|
445 | (*p)->destroy (true); |
|
|
446 | |
|
|
447 | return 0; |
329 | } |
448 | } |
330 | |
449 | |
331 | void |
450 | void |
332 | free_all_archs (void) |
451 | archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch) |
333 | { |
452 | { |
|
|
453 | ref = 0; |
|
|
454 | postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch))); |
|
|
455 | } |
|
|
456 | |
|
|
457 | void |
|
|
458 | archetype::commit_load () |
|
|
459 | { |
|
|
460 | // unlink old archetypes and link in new ones */ |
|
|
461 | for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p) |
|
|
462 | { |
334 | archetype *at, *next; |
463 | archetype *at = *p; |
335 | int i = 0, f = 0; |
|
|
336 | |
464 | |
337 | for (at = first_archetype; at; at = next) |
465 | if (archetype *old = find (at->archname)) |
|
|
466 | old->unlink (); |
|
|
467 | |
|
|
468 | allarch.push_back (at); |
|
|
469 | |
|
|
470 | at->link (); |
|
|
471 | ++dirtycnt; |
338 | { |
472 | } |
|
|
473 | |
|
|
474 | postponed_arch.clear (); |
|
|
475 | |
|
|
476 | // now resolve arch references |
|
|
477 | for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p) |
|
|
478 | { |
|
|
479 | arch_ptr *ap = p->first; |
|
|
480 | archetype *at = find (p->second); |
|
|
481 | |
339 | if (at->more) |
482 | if (!at) |
340 | next = at->more; |
483 | LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second); |
|
|
484 | |
|
|
485 | *ap = at; |
|
|
486 | } |
|
|
487 | |
|
|
488 | postponed_arch_ref.clear (); |
|
|
489 | |
|
|
490 | empty = find (shstr_empty_archetype); |
|
|
491 | } |
|
|
492 | |
|
|
493 | void |
|
|
494 | archetype::gc () |
|
|
495 | { |
|
|
496 | int cnt = max (1, min (allarch.size () / 128, dirtycnt)); |
|
|
497 | dirtycnt = max (0, dirtycnt - cnt); |
|
|
498 | |
|
|
499 | do |
|
|
500 | { |
|
|
501 | static int idx; |
|
|
502 | |
|
|
503 | if (idx >= allarch.size ()) |
|
|
504 | if (idx) |
|
|
505 | idx = 0; |
|
|
506 | else |
|
|
507 | return; |
|
|
508 | |
|
|
509 | archetype *at = allarch [idx]; |
|
|
510 | |
|
|
511 | if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object |
|
|
512 | ++idx; |
341 | else |
513 | else |
342 | next = at->next; |
|
|
343 | |
|
|
344 | delete |
|
|
345 | at; |
|
|
346 | |
|
|
347 | i++; |
|
|
348 | } |
|
|
349 | |
|
|
350 | LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f); |
|
|
351 | } |
|
|
352 | |
|
|
353 | archetype::archetype () |
|
|
354 | { |
|
|
355 | CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */ |
|
|
356 | SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ |
|
|
357 | } |
|
|
358 | |
|
|
359 | archetype::~archetype () |
|
|
360 | { |
|
|
361 | } |
|
|
362 | |
|
|
363 | /* |
|
|
364 | * Reads/parses the archetype-file, and copies into a linked list |
|
|
365 | * of archetype-structures. |
|
|
366 | */ |
|
|
367 | void |
|
|
368 | first_arch_pass (object_thawer & fp) |
|
|
369 | { |
|
|
370 | archetype *head = 0, *last_more = 0; |
|
|
371 | |
|
|
372 | archetype *at = new archetype; |
|
|
373 | at->clone.arch = first_archetype = at; |
|
|
374 | |
|
|
375 | while (int i = load_object (fp, &at->clone, 0)) |
|
|
376 | { |
|
|
377 | at->clone.speed_left = (float) (-0.1); |
|
|
378 | /* copy the body_info to the body_used - this is only really |
|
|
379 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
380 | * by doing so, when a monster is created, it has good starting |
|
|
381 | * values for the body_used info, so when items are created |
|
|
382 | * for it, they can be properly equipped. |
|
|
383 | */ |
|
|
384 | memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info)); |
|
|
385 | |
|
|
386 | switch (i) |
|
|
387 | { |
514 | { |
388 | case LL_NORMAL: /* A new archetype, just link it with the previous */ |
515 | LOG (llevDebug, "garbage collect arch %s", at->debug_desc ()); |
389 | if (last_more != NULL) |
516 | assert (at->arch == at); // verify that refcnt == 1 is truely valid |
390 | last_more->next = at; |
517 | allarch.erase (idx); |
391 | if (head != NULL) |
|
|
392 | head->next = at; |
|
|
393 | head = last_more = at; |
|
|
394 | #if 0 |
|
|
395 | if (!op->type) |
|
|
396 | LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name); |
|
|
397 | #endif |
|
|
398 | at->tail_x = 0; |
|
|
399 | at->tail_y = 0; |
|
|
400 | break; |
|
|
401 | |
518 | |
402 | case LL_MORE: /* Another part of the previous archetype, link it correctly */ |
519 | // break chain |
403 | |
520 | for (object *op = at->head_ (); op; ) |
404 | at->head = head; |
|
|
405 | at->clone.head = &head->clone; |
|
|
406 | if (last_more != NULL) |
|
|
407 | { |
521 | { |
|
|
522 | object *next = op->more; |
|
|
523 | op->head = 0; |
408 | last_more->more = at; |
524 | op->more = 0; |
409 | last_more->clone.more = &at->clone; |
525 | op = next; |
410 | } |
526 | } |
411 | last_more = at; |
|
|
412 | |
527 | |
413 | /* If this multipart image is still composed of individual small |
528 | at->destroy (); |
414 | * images, don't set the tail_.. values. We can't use them anyways, |
529 | at->arch = 0; |
415 | * and setting these to zero makes the map sending to the client much |
|
|
416 | * easier as just looking at the head, we know what to do. |
|
|
417 | */ |
|
|
418 | if (at->clone.face != head->clone.face) |
|
|
419 | { |
|
|
420 | head->tail_x = 0; |
|
|
421 | head->tail_y = 0; |
|
|
422 | } |
|
|
423 | else |
|
|
424 | { |
|
|
425 | if (at->clone.x > head->tail_x) |
|
|
426 | head->tail_x = at->clone.x; |
|
|
427 | if (at->clone.y > head->tail_y) |
|
|
428 | head->tail_y = at->clone.y; |
|
|
429 | } |
|
|
430 | break; |
|
|
431 | |
|
|
432 | } |
530 | } |
433 | |
|
|
434 | at = new archetype; |
|
|
435 | |
|
|
436 | at->clone.arch = at; |
|
|
437 | } |
|
|
438 | |
|
|
439 | delete at; |
|
|
440 | } |
|
|
441 | |
|
|
442 | /* |
|
|
443 | * Reads the archetype file once more, and links all pointers between |
|
|
444 | * archetypes. |
|
|
445 | */ |
|
|
446 | |
|
|
447 | void |
|
|
448 | second_arch_pass (object_thawer & thawer) |
|
|
449 | { |
|
|
450 | char buf[MAX_BUF], *variable = buf, *argument, *cp; |
|
|
451 | archetype *at = NULL, *other; |
|
|
452 | |
|
|
453 | while (fgets (buf, MAX_BUF, thawer) != NULL) |
|
|
454 | { |
531 | } |
455 | if (*buf == '#') |
532 | while (--cnt); |
456 | continue; |
|
|
457 | if ((argument = strchr (buf, ' ')) != NULL) |
|
|
458 | { |
|
|
459 | *argument = '\0', argument++; |
|
|
460 | cp = argument + strlen (argument) - 1; |
|
|
461 | while (isspace (*cp)) |
|
|
462 | { |
|
|
463 | *cp = '\0'; |
|
|
464 | cp--; |
|
|
465 | } |
|
|
466 | } |
|
|
467 | if (!strcmp ("Object", variable)) |
|
|
468 | { |
|
|
469 | if ((at = archetype::find (argument)) == NULL) |
|
|
470 | LOG (llevError, "Warning: failed to find arch %s\n", argument); |
|
|
471 | } |
|
|
472 | else if (!strcmp ("other_arch", variable)) |
|
|
473 | { |
|
|
474 | if (at != NULL && at->clone.other_arch == NULL) |
|
|
475 | { |
|
|
476 | if ((other = archetype::find (argument)) == NULL) |
|
|
477 | LOG (llevError, "Warning: failed to find other_arch %s\n", argument); |
|
|
478 | else if (at != NULL) |
|
|
479 | at->clone.other_arch = other; |
|
|
480 | } |
|
|
481 | } |
|
|
482 | else if (!strcmp ("randomitems", variable)) |
|
|
483 | { |
|
|
484 | if (at != NULL) |
|
|
485 | { |
|
|
486 | treasurelist *tl = find_treasurelist (argument); |
|
|
487 | |
|
|
488 | if (tl == NULL) |
|
|
489 | LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument); |
|
|
490 | else |
|
|
491 | at->clone.randomitems = tl; |
|
|
492 | } |
|
|
493 | } |
|
|
494 | } |
|
|
495 | } |
|
|
496 | |
|
|
497 | #ifdef DEBUG |
|
|
498 | void |
|
|
499 | check_generators (void) |
|
|
500 | { |
|
|
501 | archetype *at; |
|
|
502 | |
|
|
503 | for (at = first_archetype; at != NULL; at = at->next) |
|
|
504 | if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL) |
|
|
505 | LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name); |
|
|
506 | } |
|
|
507 | #endif |
|
|
508 | |
|
|
509 | /* |
|
|
510 | * First initialises the archtype hash-table (init_archetable()). |
|
|
511 | * Reads and parses the archetype file (with the first and second-pass |
|
|
512 | * functions). |
|
|
513 | * Then initialises treasures by calling load_treasures(). |
|
|
514 | */ |
|
|
515 | |
|
|
516 | void |
|
|
517 | load_archetypes (void) |
|
|
518 | { |
|
|
519 | char filename[MAX_BUF]; |
|
|
520 | |
|
|
521 | sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); |
|
|
522 | LOG (llevDebug, "Reading archetypes from %s:\n", filename); |
|
|
523 | |
|
|
524 | { |
|
|
525 | object_thawer |
|
|
526 | thawer (filename); |
|
|
527 | |
|
|
528 | LOG (llevDebug, " arch-pass 1...\n"); |
|
|
529 | first_arch_pass (thawer); |
|
|
530 | LOG (llevDebug, " done\n"); |
|
|
531 | } |
|
|
532 | |
|
|
533 | init_archetable (); |
|
|
534 | warn_archetypes = 1; |
|
|
535 | |
|
|
536 | { |
|
|
537 | object_thawer |
|
|
538 | thawer (filename); |
|
|
539 | |
|
|
540 | LOG (llevDebug, " loading treasure...\n"); |
|
|
541 | load_treasures (); |
|
|
542 | LOG (llevDebug, " done\n"); |
|
|
543 | LOG (llevDebug, " arch-pass 2...\n"); |
|
|
544 | second_arch_pass (thawer); |
|
|
545 | LOG (llevDebug, " done\n"); |
|
|
546 | #ifdef DEBUG |
|
|
547 | check_generators (); |
|
|
548 | #endif |
|
|
549 | } |
|
|
550 | LOG (llevDebug, " done\n"); |
|
|
551 | } |
533 | } |
552 | |
534 | |
553 | /* |
535 | /* |
554 | * Creates and returns a new object which is a copy of the given archetype. |
536 | * Creates and returns a new object which is a copy of the given archetype. |
555 | * This function returns NULL on failure. |
537 | * This function returns NULL on failure. |
556 | */ |
538 | */ |
557 | object * |
539 | object * |
558 | arch_to_object (archetype *at) |
540 | arch_to_object (archetype *at) |
559 | { |
541 | { |
560 | object *op; |
542 | if (!at) |
561 | |
|
|
562 | if (at == NULL) |
|
|
563 | { |
543 | { |
564 | if (warn_archetypes) |
|
|
565 | LOG (llevError, "Couldn't find archetype.\n"); |
544 | LOG (llevError, "Couldn't find archetype.\n"); |
566 | |
|
|
567 | return NULL; |
545 | return 0; |
568 | } |
546 | } |
569 | |
547 | |
570 | op = at->clone.clone (); |
548 | object *op = at->clone (); |
571 | op->arch = at; |
549 | op->arch = at; |
572 | op->instantiate (); |
550 | op->instantiate (); |
|
|
551 | |
573 | return op; |
552 | return op; |
|
|
553 | } |
|
|
554 | |
|
|
555 | object * |
|
|
556 | archetype::instance () |
|
|
557 | { |
|
|
558 | return arch_to_object (this); |
574 | } |
559 | } |
575 | |
560 | |
576 | /* |
561 | /* |
577 | * Creates an object. This function is called by get_archetype() |
562 | * Creates an object. This function is called by get_archetype() |
578 | * if it fails to find the appropriate archetype. |
563 | * if it fails to find the appropriate archetype. |
… | |
… | |
580 | * an object, and never NULL. |
565 | * an object, and never NULL. |
581 | */ |
566 | */ |
582 | object * |
567 | object * |
583 | create_singularity (const char *name) |
568 | create_singularity (const char *name) |
584 | { |
569 | { |
585 | object *op; |
570 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
|
|
571 | |
|
|
572 | if (!strcmp (name, "bug")) |
|
|
573 | abort (); |
|
|
574 | |
586 | char buf[MAX_BUF]; |
575 | char buf[MAX_BUF]; |
|
|
576 | sprintf (buf, "bug, please report (%s)", name); |
587 | |
577 | |
588 | sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); |
578 | object *op = get_archetype ("bug"); |
589 | op = object::create (); |
|
|
590 | op->name = op->name_pl = buf; |
579 | op->name = op->name_pl = buf; |
591 | SET_FLAG (op, FLAG_NO_PICK); |
580 | |
592 | return op; |
581 | return op; |
593 | } |
582 | } |
594 | |
583 | |
595 | /* |
584 | /* |
596 | * Finds which archetype matches the given name, and returns a new |
585 | * Finds which archetype matches the given name, and returns a new |
… | |
… | |
605 | return create_singularity (name); |
594 | return create_singularity (name); |
606 | |
595 | |
607 | return arch_to_object (at); |
596 | return arch_to_object (at); |
608 | } |
597 | } |
609 | |
598 | |
610 | /* |
599 | object * |
611 | * Hash-function used by the arch-hashtable. |
|
|
612 | */ |
|
|
613 | |
|
|
614 | unsigned long |
|
|
615 | hasharch (const char *str, int tablesize) |
|
|
616 | { |
|
|
617 | unsigned long hash = 0; |
|
|
618 | unsigned int i = 0; |
|
|
619 | const char *p; |
|
|
620 | |
|
|
621 | /* use the one-at-a-time hash function, which supposedly is |
|
|
622 | * better than the djb2-like one used by perl5.005, but |
|
|
623 | * certainly is better then the bug used here before. |
|
|
624 | * see http://burtleburtle.net/bob/hash/doobs.html |
|
|
625 | */ |
|
|
626 | for (p = str; i < MAXSTRING && *p; p++, i++) |
|
|
627 | { |
|
|
628 | hash += *p; |
|
|
629 | hash += hash << 10; |
|
|
630 | hash ^= hash >> 6; |
|
|
631 | } |
|
|
632 | |
|
|
633 | hash += hash << 3; |
|
|
634 | hash ^= hash >> 11; |
|
|
635 | hash += hash << 15; |
|
|
636 | |
|
|
637 | return hash % tablesize; |
|
|
638 | } |
|
|
639 | |
|
|
640 | /* |
|
|
641 | * Finds, using the hashtable, which archetype matches the given name. |
|
|
642 | * returns a pointer to the found archetype, otherwise NULL. |
|
|
643 | */ |
|
|
644 | archetype * |
|
|
645 | archetype::find (const char *name) |
600 | archetype::get (const char *name) |
646 | { |
601 | { |
647 | if (!name) |
602 | return get_archetype (name); |
648 | return 0; |
|
|
649 | |
|
|
650 | AUTODECL (i, ht.find (name)); |
|
|
651 | |
|
|
652 | if (i == ht.end ()) |
|
|
653 | return 0; |
|
|
654 | else |
|
|
655 | return i->second; |
|
|
656 | } |
|
|
657 | |
|
|
658 | /* |
|
|
659 | * Adds an archetype to the hashtable. |
|
|
660 | */ |
|
|
661 | void |
|
|
662 | archetype::hash_add () |
|
|
663 | { |
|
|
664 | ht.insert (std::make_pair (name, this)); |
|
|
665 | } |
|
|
666 | |
|
|
667 | void |
|
|
668 | archetype::hash_del () |
|
|
669 | { |
|
|
670 | ht.erase (name); |
|
|
671 | } |
603 | } |
672 | |
604 | |
673 | /* |
605 | /* |
674 | * Returns the first archetype using the given type. |
606 | * Returns the first archetype using the given type. |
675 | * Used in treasure-generation. |
607 | * Used in treasure-generation. |
676 | */ |
608 | */ |
677 | archetype * |
609 | archetype * |
678 | type_to_archetype (int type) |
610 | type_to_archetype (int type) |
679 | { |
611 | { |
680 | archetype *at; |
612 | for_all_archetypes (at) |
681 | |
613 | if (at->type == type && at->head_ () != at) |
682 | for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more) |
|
|
683 | if (at->clone.type == type) |
|
|
684 | return at; |
614 | return at; |
685 | |
615 | |
686 | return 0; |
616 | return 0; |
687 | } |
617 | } |
688 | |
618 | |
689 | /* |
619 | /* |
690 | * Returns a new object copied from the first archetype matching |
620 | * Returns a new object copied from the first archetype matching |
691 | * the given type. |
621 | * the given type. |
692 | * Used in treasure-generation. |
622 | * Used in treasure-generation. |
693 | */ |
623 | */ |
694 | |
|
|
695 | object * |
624 | object * |
696 | clone_arch (int type) |
625 | clone_arch (int type) |
697 | { |
626 | { |
698 | archetype *at; |
627 | archetype *at; |
699 | |
628 | |
… | |
… | |
701 | { |
630 | { |
702 | LOG (llevError, "Can't clone archetype %d\n", type); |
631 | LOG (llevError, "Can't clone archetype %d\n", type); |
703 | return 0; |
632 | return 0; |
704 | } |
633 | } |
705 | |
634 | |
706 | object *op = at->clone.clone (); |
635 | object *op = at->clone (); |
707 | op->instantiate (); |
636 | op->instantiate (); |
708 | return op; |
637 | return op; |
709 | } |
638 | } |
710 | |
639 | |
711 | /* |
640 | /* |
712 | * member: make instance from class |
641 | * member: make instance from class |
713 | */ |
642 | */ |
714 | |
|
|
715 | object * |
643 | object * |
716 | object_create_arch (archetype *at) |
644 | object_create_arch (archetype *at) |
717 | { |
645 | { |
718 | object *op, *prev = 0, *head = 0; |
646 | object *op, *prev = 0, *head = 0; |
719 | |
647 | |
720 | while (at) |
648 | while (at) |
721 | { |
649 | { |
722 | op = arch_to_object (at); |
650 | op = arch_to_object (at); |
|
|
651 | |
723 | op->x = at->clone.x; |
652 | op->x = at->x; |
724 | op->y = at->clone.y; |
653 | op->y = at->y; |
725 | |
654 | |
726 | if (head) |
655 | if (head) |
727 | op->head = head, prev->more = op; |
656 | op->head = head, prev->more = op; |
728 | |
657 | |
729 | if (!head) |
658 | if (!head) |
730 | head = op; |
659 | head = op; |
731 | |
660 | |
732 | prev = op; |
661 | prev = op; |
733 | at = at->more; |
662 | at = (archetype *)at->more; |
734 | } |
663 | } |
735 | |
664 | |
736 | return (head); |
665 | return head; |
737 | } |
666 | } |
738 | |
667 | |