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