1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
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 it |
9 | * it under the terms of the GNU General Public License as published by |
9 | * under the terms of the GNU General Public License as published by the Free |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
11 | * (at your option) any later version. |
11 | * 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, but |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
16 | * GNU General Public License for more details. |
16 | * 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 along |
19 | * along with this program; if not, write to the Free Software |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
21 | * |
21 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #include <cassert> |
25 | #include <cassert> |
26 | |
26 | |
27 | #include <global.h> |
27 | #include <global.h> |
… | |
… | |
50 | str_equal, |
50 | str_equal, |
51 | slice_allocator< std::pair<const char *const, arch_ptr> > |
51 | slice_allocator< std::pair<const char *const, arch_ptr> > |
52 | > HT; |
52 | > HT; |
53 | |
53 | |
54 | static HT ht (5000); |
54 | static HT ht (5000); |
55 | static std::vector<archetype *> archetypes; |
55 | archvec archetypes; |
56 | |
56 | |
57 | /** |
57 | /** |
58 | * GROS - This function retrieves an archetype given the name that appears |
58 | * GROS - This function retrieves an archetype given the name that appears |
59 | * during the game (for example, "writing pen" instead of "stylus"). |
59 | * during the game (for example, "writing pen" instead of "stylus"). |
60 | * It does not use the hashtable system, but browse the whole archlist each time. |
60 | * It does not use the hashtable system, but browse the whole archlist each time. |
… | |
… | |
68 | archetype * |
68 | archetype * |
69 | find_archetype_by_object_name (const char *name) |
69 | find_archetype_by_object_name (const char *name) |
70 | { |
70 | { |
71 | shstr_cmp name_cmp (name); |
71 | shstr_cmp name_cmp (name); |
72 | |
72 | |
73 | for (archetype *at = first_archetype; at; at = at->next) |
73 | for_all_archetypes (at) |
74 | if (at->clone.name == name_cmp) |
74 | if (at->name == name_cmp) |
75 | return at; |
75 | return at; |
76 | |
76 | |
77 | return 0; |
77 | return 0; |
78 | } |
78 | } |
79 | |
79 | |
… | |
… | |
85 | archetype * |
85 | archetype * |
86 | find_archetype_by_object_type_name (int type, const char *name) |
86 | find_archetype_by_object_type_name (int type, const char *name) |
87 | { |
87 | { |
88 | shstr_cmp name_cmp (name); |
88 | shstr_cmp name_cmp (name); |
89 | |
89 | |
90 | for (archetype *at = first_archetype; at; at = at->next) |
90 | for_all_archetypes (at) |
91 | if (at->clone.name == name_cmp && at->clone.type == type) |
91 | if (at->name == name_cmp && at->type == type) |
92 | return at; |
92 | return at; |
93 | |
93 | |
94 | return 0; |
94 | return 0; |
95 | } |
95 | } |
96 | |
96 | |
… | |
… | |
102 | object * |
102 | object * |
103 | get_archetype_by_skill_name (const char *skill, int type) |
103 | get_archetype_by_skill_name (const char *skill, int type) |
104 | { |
104 | { |
105 | shstr_cmp skill_cmp (skill); |
105 | shstr_cmp skill_cmp (skill); |
106 | |
106 | |
107 | for (archetype *at = first_archetype; at; at = at->next) |
107 | for_all_archetypes (at) |
108 | if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.type)) |
108 | if (at->skill == skill_cmp && (type == -1 || type == at->type)) |
109 | return arch_to_object (at); |
109 | return arch_to_object (at); |
110 | |
110 | |
111 | return 0; |
111 | return 0; |
112 | } |
112 | } |
113 | |
113 | |
… | |
… | |
119 | * (eg, skills) |
119 | * (eg, skills) |
120 | */ |
120 | */ |
121 | archetype * |
121 | archetype * |
122 | get_archetype_by_type_subtype (int type, int subtype) |
122 | get_archetype_by_type_subtype (int type, int subtype) |
123 | { |
123 | { |
124 | for (archetype *at = first_archetype; at; at = at->next) |
124 | for_all_archetypes (at) |
125 | if ((type == -1 || type == at->clone.type) && (subtype == -1 || subtype == at->clone.subtype)) |
125 | if ((type == -1 || type == at->type) && (subtype == -1 || subtype == at->subtype)) |
126 | return at; |
126 | return at; |
127 | |
127 | |
128 | return 0; |
128 | return 0; |
129 | } |
129 | } |
130 | |
130 | |
… | |
… | |
157 | } |
157 | } |
158 | |
158 | |
159 | return create_singularity (name); |
159 | return create_singularity (name); |
160 | } |
160 | } |
161 | |
161 | |
162 | /* This is a subset of the parse_id command. Basically, name can be |
162 | /* This is a subset of the parse_id command. Basically, name can be |
163 | * a string seperated lists of things to match, with certain keywords. |
163 | * a string seperated lists of things to match, with certain keywords. |
164 | * pl is the player (only needed to set count properly) |
164 | * pl is the player (only needed to set count properly) |
165 | * op is the item we are trying to match. Calling function takes care |
165 | * op is the item we are trying to match. Calling function takes care |
166 | * of what action might need to be done and if it is valid |
166 | * of what action might need to be done and if it is valid |
167 | * (pickup, drop, etc.) Return NONZERO if we have a match. A higher |
167 | * (pickup, drop, etc.) Return NONZERO if we have a match. A higher |
168 | * value means a better match. 0 means no match. |
168 | * value means a better match. 0 means no match. |
169 | * |
169 | * |
170 | * Brief outline of the procedure: |
170 | * Brief outline of the procedure: |
171 | * We take apart the name variable into the individual components. |
171 | * We take apart the name variable into the individual components. |
172 | * cases for 'all' and unpaid are pretty obvious. |
172 | * cases for 'all' and unpaid are pretty obvious. |
173 | * Next, we check for a count (either specified in name, or in the |
173 | * Next, we check for a count (either specified in name, or in the |
174 | * player object.) |
174 | * player object.) |
175 | * If count is 1, make a quick check on the name. |
175 | * If count is 1, make a quick check on the name. |
176 | * IF count is >1, we need to make plural name. Return if match. |
176 | * IF count is >1, we need to make plural name. Return if match. |
177 | * Last, make a check on the full name. |
177 | * Last, make a check on the full name. |
178 | */ |
178 | */ |
179 | int |
179 | int |
180 | item_matched_string (object *pl, object *op, const char *name) |
180 | item_matched_string (object *pl, object *op, const char *name) |
181 | { |
181 | { |
182 | char *cp, local_name[MAX_BUF]; |
182 | char *cp, local_name[MAX_BUF]; |
183 | int count, retval = 0; |
183 | int count, retval = 0; |
… | |
… | |
275 | } |
275 | } |
276 | |
276 | |
277 | return 0; |
277 | return 0; |
278 | } |
278 | } |
279 | |
279 | |
280 | archetype::archetype () |
280 | archetype::archetype (const char *name) |
281 | { |
281 | { |
|
|
282 | stub = true; |
282 | clone.arch = this; |
283 | arch = this; |
283 | |
284 | this->archname = this->name = this->name_pl = name; |
284 | CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */ |
|
|
285 | SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ |
|
|
286 | } |
285 | } |
287 | |
286 | |
288 | archetype::~archetype () |
287 | archetype::~archetype () |
289 | { |
288 | { |
290 | //TODO: nuke ->more's |
289 | unlink (); |
291 | } |
290 | } |
292 | |
291 | |
293 | static void |
|
|
294 | unlink (archetype *at) |
|
|
295 | { |
|
|
296 | if (at->head) |
|
|
297 | at = at->head; |
|
|
298 | |
|
|
299 | // destroy this archetype's link, making singletons out of its parts |
|
|
300 | while (at) |
|
|
301 | { |
|
|
302 | archetype *more = at->more; |
|
|
303 | at->clone.destroy_inv (); |
|
|
304 | at->head = at->more = 0; |
|
|
305 | at = more; |
|
|
306 | } |
|
|
307 | } |
|
|
308 | |
|
|
309 | // dire hack, need to rationalise |
|
|
310 | void |
292 | void |
311 | overwrite (archetype *at, object *op) |
293 | archetype::link () |
312 | { |
294 | { |
313 | at->clone = *op; |
295 | ht.insert (std::make_pair (archname, this)); |
314 | |
296 | |
315 | at->clone.arch = at; |
297 | if (!archetypes.contains (this)) |
316 | //TODO: inv et al. |
298 | archetypes.insert (this); |
|
|
299 | } |
|
|
300 | |
|
|
301 | void |
|
|
302 | archetype::unlink () |
|
|
303 | { |
|
|
304 | ht.erase (archname); |
|
|
305 | if (!strcmp (&archname, "Gaea")) fprintf (stderr, "oI\n");//D |
|
|
306 | if (archetypes.contains (this)) |
|
|
307 | archetypes.erase (this); |
|
|
308 | } |
|
|
309 | |
|
|
310 | /* |
|
|
311 | * Finds, using the hashtable, which archetype matches the given name. |
|
|
312 | * returns a pointer to the found archetype, otherwise NULL. |
|
|
313 | */ |
|
|
314 | archetype * |
|
|
315 | archetype::find (const char *name) |
|
|
316 | { |
|
|
317 | if (!name) |
|
|
318 | return 0; |
|
|
319 | |
|
|
320 | auto (i, ht.find (name)); |
|
|
321 | |
|
|
322 | if (i == ht.end ()) |
|
|
323 | return 0; |
|
|
324 | else |
|
|
325 | return i->second; |
|
|
326 | } |
|
|
327 | |
|
|
328 | archetype * |
|
|
329 | archetype::get (const char *name) |
|
|
330 | { |
|
|
331 | if (!name) |
|
|
332 | { |
|
|
333 | LOG (llevError, "null archetype requested\n"); |
|
|
334 | name = "(null)"; |
|
|
335 | } |
|
|
336 | |
|
|
337 | archetype *at = find (name); |
|
|
338 | |
|
|
339 | if (!at) |
|
|
340 | { |
|
|
341 | at = new archetype (name); |
|
|
342 | at->link (); |
|
|
343 | } |
|
|
344 | |
|
|
345 | return at; |
317 | } |
346 | } |
318 | |
347 | |
319 | archetype * |
348 | archetype * |
320 | archetype::read (object_thawer &f) |
349 | archetype::read (object_thawer &f) |
321 | { |
350 | { |
322 | assert (f.kw == KW_object); |
351 | assert (f.kw == KW_object); |
323 | |
352 | |
324 | archetype *head = get (f.get_str ()); |
353 | loading_arch = true; // hack to tell parse_kv et al. to behave |
325 | unlink (head); |
|
|
326 | object *op = object::create (); |
|
|
327 | |
354 | |
328 | if (!op->parse_kv (f)) |
355 | std::vector<archetype *> parts; |
329 | { |
356 | |
330 | op->destroy (true); |
357 | coroapi::cede_to_tick_every (10); |
331 | // leak head |
358 | |
332 | return 0; |
359 | for (;;) |
333 | } |
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 ()); |
334 | |
364 | |
335 | overwrite (head, op); |
365 | if (!at || !at->stub) |
336 | op->destroy (); |
366 | at = new archetype (f.get_str ()); |
337 | |
367 | |
338 | for (archetype *prev = head; f.kw == KW_more; ) |
|
|
339 | { |
|
|
340 | f.next (); |
368 | f.next (); |
341 | assert (f.kw == KW_object); |
|
|
342 | |
369 | |
343 | archetype *more = get (f.get_str ()); |
370 | #if 0 |
344 | unlink (more); |
371 | // implementing it here in the server does neither allow multiple inheritence |
345 | object *op = object::create (); |
372 | // nor does it cleanly "just override". it would allow use in map files, though, |
346 | |
373 | // and other resource files dynamically laoded (as opposed to being preprocessed). |
347 | if (!op->parse_kv (f)) |
374 | // not that any of this is relevant as of yet... |
|
|
375 | if (f.kw == KW_inherit) |
348 | { |
376 | { |
349 | op->destroy (true); |
377 | if (archetype *at = find (f.get_str ())) |
350 | // leak head more* |
378 | *op = at->clone; |
351 | return 0; |
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 (); |
352 | } |
384 | } |
|
|
385 | #endif |
353 | |
386 | |
354 | overwrite (more, op); |
387 | if (!at->parse_kv (f)) |
355 | op->destroy (); |
388 | goto fail; |
356 | |
389 | |
357 | if (more->clone.x > head->tail_x) head->tail_x = more->clone.x; |
390 | at->post_load_check (); |
358 | if (more->clone.y > head->tail_y) head->tail_y = more->clone.y; |
|
|
359 | |
391 | |
360 | more->head = head; |
392 | parts.push_back (at); |
361 | more->clone.head = &head->clone; |
|
|
362 | prev->more = more; |
|
|
363 | prev->clone.more = &more->clone; |
|
|
364 | |
393 | |
365 | prev = more; |
394 | if (f.kw != KW_more) |
366 | } |
395 | break; |
367 | |
396 | |
368 | if (!head->next) |
397 | f.next (); |
369 | { |
|
|
370 | head->next = first_archetype; |
|
|
371 | first_archetype = head; |
|
|
372 | } |
|
|
373 | |
398 | |
374 | return head; |
399 | if (f.kw != KW_object) |
375 | } |
|
|
376 | |
|
|
377 | /* |
|
|
378 | * Reads/parses the archetype-file, and copies into a linked list |
|
|
379 | * of archetype-structures. |
|
|
380 | */ |
|
|
381 | static bool |
|
|
382 | load_archetypes (object_thawer &f) |
|
|
383 | { |
|
|
384 | for (;;) |
|
|
385 | { |
|
|
386 | switch (f.kw) |
|
|
387 | { |
400 | { |
388 | case KW_object: |
401 | f.parse_error ("more object"); |
389 | loading_arch = true; |
402 | goto fail; |
390 | if (!archetype::read (f)) |
|
|
391 | { |
|
|
392 | loading_arch = false; |
|
|
393 | return false; |
|
|
394 | } |
|
|
395 | |
|
|
396 | loading_arch = false; |
|
|
397 | continue; |
|
|
398 | |
|
|
399 | case KW_EOF: |
|
|
400 | return true; |
|
|
401 | |
|
|
402 | default: |
|
|
403 | if (!f.parse_error ("archetypes file")) |
|
|
404 | return false; |
|
|
405 | } |
403 | } |
|
|
404 | } |
406 | |
405 | |
407 | f.next (); |
406 | loading_arch = false; |
|
|
407 | |
|
|
408 | { |
|
|
409 | auto (at, parts.begin ()); |
|
|
410 | |
|
|
411 | archetype *new_head = parts.front (); |
|
|
412 | archetype *old_head = find (new_head->archname); |
|
|
413 | |
|
|
414 | if (old_head && !old_head->is_head ()) |
|
|
415 | { |
|
|
416 | LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n", |
|
|
417 | &new_head->archname, &old_head->archname); |
|
|
418 | goto fail; |
408 | } |
419 | } |
409 | } |
|
|
410 | |
420 | |
411 | /* |
421 | // check that all archetypes belong to the same old object or are new |
412 | * First initialises the archtype hash-table (init_archetable()). |
422 | for (auto (at, parts.begin ()); at != parts.end (); ++at) |
413 | * Reads and parses the archetype file (with the first and second-pass |
423 | { |
414 | * functions). |
424 | archetype *new_part = *at; |
415 | */ |
425 | archetype *old_part = find (new_part->archname); |
416 | bool |
|
|
417 | load_archetype_file (const char *filename) |
|
|
418 | { |
|
|
419 | object_thawer f (filename); |
|
|
420 | |
426 | |
421 | f.next (); |
427 | if (old_part && old_part->head_ () != old_head) |
|
|
428 | { |
|
|
429 | LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n", |
|
|
430 | &new_part->archname, &((archetype *)old_part->head_ ())->archname); |
|
|
431 | goto fail; |
|
|
432 | } |
|
|
433 | } |
422 | |
434 | |
423 | // make sure the next - long - step is only done after a tick |
435 | // deactivate existing archetype |
424 | coroapi::wait_for_tick_begin (); |
436 | for (archetype *at = old_head; at; at = (archetype *)at->more) |
|
|
437 | at->unlink (); |
425 | |
438 | |
426 | if (!load_archetypes (f)) |
439 | // assemble new chain |
427 | return false; |
440 | new_head->min_x = new_head->max_x = new_head->x; |
|
|
441 | new_head->min_y = new_head->max_y = new_head->y; |
428 | |
442 | |
429 | warn_archetypes = 1; |
443 | archetype *less = new_head; |
|
|
444 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
|
|
445 | { |
|
|
446 | archetype *at = *p; |
430 | |
447 | |
|
|
448 | // some flags get inherited formt he head (probably a lot more) |
|
|
449 | // doing it here doesn't feel too cozy, but it allows code |
|
|
450 | // to ignore head checks for these flags, which saves time |
|
|
451 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
|
|
452 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
|
|
453 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
|
|
454 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
|
|
455 | |
|
|
456 | if (at->x < new_head->min_x) new_head->min_x = at->x; |
|
|
457 | if (at->y < new_head->min_y) new_head->min_y = at->y; |
|
|
458 | if (at->x > new_head->max_x) new_head->max_x = at->x; |
|
|
459 | if (at->y > new_head->max_y) new_head->max_y = at->y; |
|
|
460 | |
|
|
461 | at->head = new_head; |
|
|
462 | less->more = at; |
|
|
463 | less = at; |
|
|
464 | } |
|
|
465 | |
|
|
466 | // now activate it |
|
|
467 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
|
|
468 | { |
|
|
469 | archetype *at = *p; |
|
|
470 | at->stub = false; |
|
|
471 | at->link (); |
|
|
472 | } |
|
|
473 | |
|
|
474 | return new_head; |
|
|
475 | } |
|
|
476 | |
|
|
477 | fail: |
|
|
478 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
|
|
479 | (*p)->destroy (true); |
|
|
480 | |
|
|
481 | loading_arch = false; |
|
|
482 | return 0; |
|
|
483 | } |
|
|
484 | |
|
|
485 | /* |
|
|
486 | * Initialize global archtype pointers: |
|
|
487 | */ |
|
|
488 | void |
|
|
489 | init_archetype_pointers () |
|
|
490 | { |
|
|
491 | ring_arch = archetype::find ("ring"); |
|
|
492 | amulet_arch = archetype::find ("amulet"); |
|
|
493 | staff_arch = archetype::find ("staff"); |
|
|
494 | crown_arch = archetype::find ("crown"); |
431 | empty_archetype = archetype::find ("empty_archetype"); |
495 | empty_archetype = archetype::find ("empty_archetype"); |
432 | if (!empty_archetype) |
|
|
433 | return false; |
|
|
434 | |
|
|
435 | coroapi::cede (); |
|
|
436 | |
|
|
437 | return true; |
|
|
438 | } |
496 | } |
439 | |
497 | |
440 | /* |
498 | /* |
441 | * Creates and returns a new object which is a copy of the given archetype. |
499 | * Creates and returns a new object which is a copy of the given archetype. |
442 | * This function returns NULL on failure. |
500 | * This function returns NULL on failure. |
… | |
… | |
444 | object * |
502 | object * |
445 | arch_to_object (archetype *at) |
503 | arch_to_object (archetype *at) |
446 | { |
504 | { |
447 | if (!at) |
505 | if (!at) |
448 | { |
506 | { |
449 | if (warn_archetypes) |
|
|
450 | LOG (llevError, "Couldn't find archetype.\n"); |
507 | LOG (llevError, "Couldn't find archetype.\n"); |
451 | |
|
|
452 | return NULL; |
508 | return 0; |
453 | } |
509 | } |
454 | |
510 | |
455 | object *op = at->clone.clone (); |
511 | object *op = at->clone (); |
456 | op->arch = at; |
512 | op->arch = at; |
457 | op->instantiate (); |
513 | op->instantiate (); |
|
|
514 | |
458 | return op; |
515 | return op; |
459 | } |
516 | } |
460 | |
517 | |
461 | /* |
518 | /* |
462 | * Creates an object. This function is called by get_archetype() |
519 | * Creates an object. This function is called by get_archetype() |
… | |
… | |
465 | * an object, and never NULL. |
522 | * an object, and never NULL. |
466 | */ |
523 | */ |
467 | object * |
524 | object * |
468 | create_singularity (const char *name) |
525 | create_singularity (const char *name) |
469 | { |
526 | { |
470 | object *op; |
527 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
|
|
528 | |
|
|
529 | if (!strcmp (name, "bug")) |
|
|
530 | abort (); |
|
|
531 | |
471 | char buf[MAX_BUF]; |
532 | char buf[MAX_BUF]; |
|
|
533 | sprintf (buf, "bug, please report (%s)", name); |
472 | |
534 | |
473 | sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); |
535 | object *op = get_archetype ("bug"); |
474 | op = object::create (); |
|
|
475 | op->name = op->name_pl = buf; |
536 | op->name = op->name_pl = buf; |
476 | SET_FLAG (op, FLAG_NO_PICK); |
537 | |
477 | return op; |
538 | return op; |
478 | } |
539 | } |
479 | |
540 | |
480 | /* |
541 | /* |
481 | * Finds which archetype matches the given name, and returns a new |
542 | * Finds which archetype matches the given name, and returns a new |
… | |
… | |
491 | |
552 | |
492 | return arch_to_object (at); |
553 | return arch_to_object (at); |
493 | } |
554 | } |
494 | |
555 | |
495 | /* |
556 | /* |
496 | * Hash-function used by the arch-hashtable. |
|
|
497 | */ |
|
|
498 | |
|
|
499 | unsigned long |
|
|
500 | hasharch (const char *str, int tablesize) |
|
|
501 | { |
|
|
502 | unsigned long hash = 0; |
|
|
503 | unsigned int i = 0; |
|
|
504 | const char *p; |
|
|
505 | |
|
|
506 | /* use the one-at-a-time hash function, which supposedly is |
|
|
507 | * better than the djb2-like one used by perl5.005, but |
|
|
508 | * certainly is better then the bug used here before. |
|
|
509 | * see http://burtleburtle.net/bob/hash/doobs.html |
|
|
510 | */ |
|
|
511 | for (p = str; i < MAXSTRING && *p; p++, i++) |
|
|
512 | { |
|
|
513 | hash += *p; |
|
|
514 | hash += hash << 10; |
|
|
515 | hash ^= hash >> 6; |
|
|
516 | } |
|
|
517 | |
|
|
518 | hash += hash << 3; |
|
|
519 | hash ^= hash >> 11; |
|
|
520 | hash += hash << 15; |
|
|
521 | |
|
|
522 | return hash % tablesize; |
|
|
523 | } |
|
|
524 | |
|
|
525 | /* |
|
|
526 | * Finds, using the hashtable, which archetype matches the given name. |
|
|
527 | * returns a pointer to the found archetype, otherwise NULL. |
|
|
528 | */ |
|
|
529 | archetype * |
|
|
530 | archetype::find (const char *name) |
|
|
531 | { |
|
|
532 | if (!name) |
|
|
533 | return 0; |
|
|
534 | |
|
|
535 | AUTODECL (i, ht.find (name)); |
|
|
536 | |
|
|
537 | if (i == ht.end ()) |
|
|
538 | return 0; |
|
|
539 | else |
|
|
540 | return i->second; |
|
|
541 | } |
|
|
542 | |
|
|
543 | archetype * |
|
|
544 | archetype::get (const char *name) |
|
|
545 | { |
|
|
546 | archetype *at = find (name); |
|
|
547 | |
|
|
548 | if (!at) |
|
|
549 | { |
|
|
550 | archetypes.push_back (at = new archetype); |
|
|
551 | at->name = name; |
|
|
552 | at->hash_add (); |
|
|
553 | } |
|
|
554 | |
|
|
555 | return at; |
|
|
556 | } |
|
|
557 | |
|
|
558 | /* |
|
|
559 | * Adds an archetype to the hashtable. |
|
|
560 | */ |
|
|
561 | void |
|
|
562 | archetype::hash_add () |
|
|
563 | { |
|
|
564 | ht.insert (std::make_pair (name, this)); |
|
|
565 | } |
|
|
566 | |
|
|
567 | void |
|
|
568 | archetype::hash_del () |
|
|
569 | { |
|
|
570 | ht.erase (name); |
|
|
571 | } |
|
|
572 | |
|
|
573 | /* |
|
|
574 | * Returns the first archetype using the given type. |
557 | * Returns the first archetype using the given type. |
575 | * Used in treasure-generation. |
558 | * Used in treasure-generation. |
576 | */ |
559 | */ |
577 | archetype * |
560 | archetype * |
578 | type_to_archetype (int type) |
561 | type_to_archetype (int type) |
579 | { |
562 | { |
580 | for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more) |
563 | for_all_archetypes (at) |
581 | if (at->clone.type == type) |
564 | if (at->type == type && at->head_ () != at) |
582 | return at; |
565 | return at; |
583 | |
566 | |
584 | return 0; |
567 | return 0; |
585 | } |
568 | } |
586 | |
569 | |
… | |
… | |
598 | { |
581 | { |
599 | LOG (llevError, "Can't clone archetype %d\n", type); |
582 | LOG (llevError, "Can't clone archetype %d\n", type); |
600 | return 0; |
583 | return 0; |
601 | } |
584 | } |
602 | |
585 | |
603 | object *op = at->clone.clone (); |
586 | object *op = at->clone (); |
604 | op->instantiate (); |
587 | op->instantiate (); |
605 | return op; |
588 | return op; |
606 | } |
589 | } |
607 | |
590 | |
608 | /* |
591 | /* |
609 | * member: make instance from class |
592 | * member: make instance from class |
610 | */ |
593 | */ |
611 | |
|
|
612 | object * |
594 | object * |
613 | object_create_arch (archetype *at) |
595 | object_create_arch (archetype *at) |
614 | { |
596 | { |
615 | object *op, *prev = 0, *head = 0; |
597 | object *op, *prev = 0, *head = 0; |
616 | |
598 | |
617 | while (at) |
599 | while (at) |
618 | { |
600 | { |
619 | op = arch_to_object (at); |
601 | op = arch_to_object (at); |
|
|
602 | |
620 | op->x = at->clone.x; |
603 | op->x = at->x; |
621 | op->y = at->clone.y; |
604 | op->y = at->y; |
622 | |
605 | |
623 | if (head) |
606 | if (head) |
624 | op->head = head, prev->more = op; |
607 | op->head = head, prev->more = op; |
625 | |
608 | |
626 | if (!head) |
609 | if (!head) |
627 | head = op; |
610 | head = op; |
628 | |
611 | |
629 | prev = op; |
612 | prev = op; |
630 | at = at->more; |
613 | at = (archetype *)at->more; |
631 | } |
614 | } |
632 | |
615 | |
633 | return (head); |
616 | return head; |
634 | } |
617 | } |
635 | |
618 | |