1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
|
|
4 | * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
8 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
12 | * option) any later version. |
12 | * |
13 | * |
13 | * This program is distributed in the hope that it will be useful, |
14 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
17 | * GNU General Public License for more details. |
17 | * |
18 | * |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * You should have received a copy of the Affero GNU General Public License |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * and the GNU General Public License along with this program. If not, see |
20 | * <http://www.gnu.org/licenses/>. |
21 | * <http://www.gnu.org/licenses/>. |
21 | * |
22 | * |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
24 | */ |
24 | |
25 | |
25 | #include <cassert> |
26 | #include <cassert> |
|
|
27 | #include <functional> |
|
|
28 | |
|
|
29 | #include <flat_hash_map.hpp> |
26 | |
30 | |
27 | #include <global.h> |
31 | #include <global.h> |
28 | #include <loader.h> |
|
|
29 | |
|
|
30 | #include <tr1/functional> |
|
|
31 | #include <tr1/unordered_map> |
|
|
32 | |
32 | |
33 | archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing |
33 | archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing |
34 | arch_ptr archetype::empty; |
34 | arch_ptr archetype::empty; |
35 | |
35 | |
36 | // the hashtable |
36 | // the hashtable |
37 | typedef std::tr1::unordered_map |
37 | typedef ska::flat_hash_map |
38 | < |
38 | < |
39 | const char *, |
39 | const char *, |
40 | arch_ptr, |
40 | arch_ptr, |
41 | str_hash, |
41 | str_hash, |
42 | str_equal, |
42 | str_equal, |
… | |
… | |
54 | static std::vector<archetype *> postponed_arch; |
54 | static std::vector<archetype *> postponed_arch; |
55 | |
55 | |
56 | //+GPL |
56 | //+GPL |
57 | |
57 | |
58 | /* |
58 | /* |
59 | * Creates an object. This function is called by get_archetype() |
59 | * Creates an object. This function is called by archetype::get () |
60 | * if it fails to find the appropriate archetype. |
60 | * if it fails to find the appropriate archetype. |
61 | * Thus get_archetype() will be guaranteed to always return |
61 | * Thus archetype::get() will be guaranteed to always return |
62 | * an object, and never NULL. |
62 | * an object, and never NULL. |
63 | */ |
63 | */ |
64 | static object * |
64 | static object * |
65 | create_singularity (const char *name) |
65 | create_singularity (const char *name) |
66 | { |
66 | { |
… | |
… | |
213 | /* All is a very generic match - low match value */ |
213 | /* All is a very generic match - low match value */ |
214 | if (!strcmp (cp, "all")) |
214 | if (!strcmp (cp, "all")) |
215 | return 1; |
215 | return 1; |
216 | |
216 | |
217 | /* unpaid is a little more specific */ |
217 | /* unpaid is a little more specific */ |
218 | if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) |
218 | if (!strcmp (cp, "unpaid") && op->flag [FLAG_UNPAID]) |
219 | return 2; |
219 | return 2; |
220 | |
220 | |
221 | if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) |
221 | if (!strcmp (cp, "cursed") && op->flag [FLAG_KNOWN_CURSED] && (op->flag [FLAG_CURSED] || op->flag [FLAG_DAMNED])) |
222 | return 2; |
222 | return 2; |
223 | |
223 | |
224 | if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) |
224 | if (!strcmp (cp, "unlocked") && !op->flag [FLAG_INV_LOCKED]) |
225 | return 2; |
225 | return 2; |
226 | |
226 | |
227 | /* Allow for things like '100 arrows' */ |
227 | /* Allow for things like '100 arrows' */ |
228 | if ((count = atoi (cp)) != 0) |
228 | if ((count = atoi (cp)) != 0) |
229 | { |
229 | { |
… | |
… | |
300 | return 0; |
300 | return 0; |
301 | } |
301 | } |
302 | |
302 | |
303 | //-GPL |
303 | //-GPL |
304 | |
304 | |
|
|
305 | void |
|
|
306 | archetype::do_delete () |
|
|
307 | { |
|
|
308 | delete this; |
|
|
309 | } |
|
|
310 | |
305 | archetype::archetype (const char *name) |
311 | archetype::archetype (const char *name) |
306 | { |
312 | { |
307 | arch = this; |
313 | arch = this; |
308 | this->archname = this->name = this->name_pl = name; |
314 | this->archname = this->name = this->name_pl = name; |
309 | } |
315 | } |
… | |
… | |
349 | return 0; |
355 | return 0; |
350 | else |
356 | else |
351 | return i->second; |
357 | return i->second; |
352 | } |
358 | } |
353 | |
359 | |
|
|
360 | void |
|
|
361 | archetype::post_load_check () |
|
|
362 | { |
|
|
363 | assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL])); |
|
|
364 | |
|
|
365 | if (type == SKILL) |
|
|
366 | add_skill_archetype (this); |
|
|
367 | |
|
|
368 | object::post_load_check (); |
|
|
369 | } |
|
|
370 | |
354 | archetype * |
371 | archetype * |
355 | archetype::read (object_thawer &f) |
372 | archetype::read (object_thawer &f) |
356 | { |
373 | { |
357 | assert (f.kw == KW_object); |
374 | assert (f.kw == KW_object); |
358 | |
375 | |
… | |
… | |
367 | f.next (); |
384 | f.next (); |
368 | |
385 | |
369 | #if 0 |
386 | #if 0 |
370 | // implementing it here in the server does neither allow multiple inheritence |
387 | // 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, |
388 | // 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). |
389 | // and other resource files dynamically loaded (as opposed to being preprocessed). |
373 | // not that any of this is relevant as of yet... |
390 | // not that any of this is relevant as of yet... |
374 | if (f.kw == KW_inherit) |
391 | if (f.kw == KW_inherit) |
375 | { |
392 | { |
376 | if (archetype *at = find (f.get_str ())) |
393 | if (archetype *at = find (f.get_str ())) |
377 | *op = at->clone; |
394 | *op = at->clone; |
… | |
… | |
407 | goto fail; |
424 | goto fail; |
408 | } |
425 | } |
409 | } |
426 | } |
410 | |
427 | |
411 | { |
428 | { |
412 | auto (at, parts.begin ()); |
|
|
413 | |
|
|
414 | archetype *new_head = parts.front (); |
429 | archetype *new_head = parts.front (); |
415 | archetype *old_head = find (new_head->archname); |
430 | archetype *old_head = find (new_head->archname); |
416 | |
431 | |
417 | if (old_head && !old_head->is_head ()) |
432 | if (old_head && !old_head->is_head ()) |
418 | { |
433 | { |
… | |
… | |
420 | &new_head->archname, &old_head->archname); |
435 | &new_head->archname, &old_head->archname); |
421 | goto fail; |
436 | goto fail; |
422 | } |
437 | } |
423 | |
438 | |
424 | // check that all archetypes belong to the same old object or are new |
439 | // check that all archetypes belong to the same old object or are new |
425 | for (auto (at, parts.begin ()); at != parts.end (); ++at) |
440 | for (auto &&at : parts) |
426 | { |
441 | { |
427 | archetype *new_part = *at; |
442 | archetype *new_part = at; |
428 | archetype *old_part = find (new_part->archname); |
443 | archetype *old_part = find (new_part->archname); |
429 | |
444 | |
430 | if (old_part && old_part->head_ () != old_head) |
445 | if (old_part && old_part->head_ () != old_head) |
431 | { |
446 | { |
432 | LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n", |
447 | LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n", |
… | |
… | |
434 | goto fail; |
449 | goto fail; |
435 | } |
450 | } |
436 | } |
451 | } |
437 | |
452 | |
438 | // assemble new chain |
453 | // assemble new chain |
439 | new_head->min_x = new_head->max_x = new_head->x; |
454 | new_head->max_x = new_head->x; |
440 | new_head->min_y = new_head->max_y = new_head->y; |
|
|
441 | |
455 | |
442 | archetype *less = new_head; |
456 | archetype *less = new_head; |
443 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
457 | for (auto &&p = parts.begin () + 1; p != parts.end (); ++p) |
444 | { |
458 | { |
445 | archetype *at = *p; |
459 | archetype *at = *p; |
446 | |
460 | |
447 | // some flags get inherited from the head (probably a lot more) |
461 | // some flags get inherited from the head (probably a lot more) |
448 | // doing it here doesn't feel too cozy, but it allows code |
462 | // doing it here doesn't feel too cozy, but it allows code |
… | |
… | |
450 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
464 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
451 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
465 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
452 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
466 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
453 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
467 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
454 | |
468 | |
455 | new_head->min_x = min (new_head->min_x, at->x); |
|
|
456 | new_head->min_y = min (new_head->min_y, at->y); |
|
|
457 | new_head->max_x = max (new_head->max_x, at->x); |
469 | new_head->max_x = max (new_head->max_x, at->x); |
458 | new_head->max_y = max (new_head->max_y, at->y); |
|
|
459 | |
470 | |
460 | at->head = new_head; |
471 | at->head = new_head; |
461 | less->more = at; |
472 | less->more = at; |
462 | less = at; |
473 | less = at; |
463 | } |
474 | } |
… | |
… | |
466 | |
477 | |
467 | return new_head; |
478 | return new_head; |
468 | } |
479 | } |
469 | |
480 | |
470 | fail: |
481 | fail: |
471 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
482 | for (auto &&at : parts) |
472 | (*p)->destroy (); |
483 | at->destroy (); |
473 | |
484 | |
474 | return 0; |
485 | return 0; |
475 | } |
486 | } |
476 | |
487 | |
477 | void |
488 | void |
… | |
… | |
483 | |
494 | |
484 | void |
495 | void |
485 | archetype::commit_load () |
496 | archetype::commit_load () |
486 | { |
497 | { |
487 | // unlink old archetypes and link in new ones */ |
498 | // unlink old archetypes and link in new ones */ |
488 | for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p) |
499 | for (auto &&at : postponed_arch) |
489 | { |
500 | { |
490 | archetype *at = *p; |
|
|
491 | |
|
|
492 | if (archetype *old = find (at->archname)) |
501 | if (archetype *old = find (at->archname)) |
493 | old->unlink (); |
502 | old->unlink (); |
494 | |
503 | |
495 | allarch.push_back (at); |
504 | allarch.push_back (at); |
496 | |
505 | |
… | |
… | |
499 | } |
508 | } |
500 | |
509 | |
501 | postponed_arch.clear (); |
510 | postponed_arch.clear (); |
502 | |
511 | |
503 | // now resolve arch references |
512 | // now resolve arch references |
504 | for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p) |
513 | for (auto &&p : postponed_arch_ref) // not yet C++17 |
505 | { |
514 | { |
506 | arch_ptr *ap = p->first; |
515 | arch_ptr *ap = p.first; |
507 | archetype *at = find (p->second); |
516 | archetype *at = find (p.second); |
508 | |
517 | |
509 | if (!at) |
518 | if (!at) |
510 | LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second); |
519 | LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p.second); |
511 | |
520 | |
512 | *ap = at; |
521 | *ap = at; |
513 | } |
522 | } |
514 | |
523 | |
515 | postponed_arch_ref.clear (); |
524 | postponed_arch_ref.clear (); |
… | |
… | |
518 | } |
527 | } |
519 | |
528 | |
520 | void |
529 | void |
521 | archetype::gc () |
530 | archetype::gc () |
522 | { |
531 | { |
523 | int cnt = max (1, min (allarch.size () / 128, dirtycnt)); |
532 | int cnt = max (1, min<int> (allarch.size () / 128, dirtycnt)); |
524 | dirtycnt = max (0, dirtycnt - cnt); |
533 | dirtycnt = max (0, dirtycnt - cnt); |
525 | |
534 | |
526 | do |
535 | do |
527 | { |
536 | { |
528 | static int idx; |
537 | static int idx; |
… | |
… | |
537 | |
546 | |
538 | if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object |
547 | if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object |
539 | ++idx; |
548 | ++idx; |
540 | else |
549 | else |
541 | { |
550 | { |
542 | LOG (llevDebug, "garbage collect arch %s", &at->archname); |
551 | //LOG (llevDebug, "garbage collect arch %s", &at->archname); |
543 | assert (at->arch == at); // verify that refcnt == 1 is truly valid |
552 | assert (at->arch == at); // verify that refcnt == 1 is truly valid |
544 | allarch.erase (idx); |
553 | allarch.erase (idx); |
545 | |
554 | |
546 | // break chain |
555 | // break chain |
547 | for (object *op = at->head_ (); op; ) |
556 | for (object *op = at->head_ (); op; ) |
… | |
… | |
572 | /* |
581 | /* |
573 | * Finds which archetype matches the given name, and returns a new |
582 | * Finds which archetype matches the given name, and returns a new |
574 | * object containing a copy of the archetype. |
583 | * object containing a copy of the archetype. |
575 | */ |
584 | */ |
576 | object * |
585 | object * |
577 | get_archetype (const char *name) |
|
|
578 | { |
|
|
579 | return archetype::get (name); |
|
|
580 | } |
|
|
581 | |
|
|
582 | object * |
|
|
583 | archetype::get (const char *name) |
586 | archetype::get (const char *name) |
584 | { |
587 | { |
585 | archetype *at = find (name); |
588 | archetype *at = find (name); |
586 | |
589 | |
587 | if (!at) |
590 | if (!at) |
… | |
… | |
592 | |
595 | |
593 | /* |
596 | /* |
594 | * Returns the first archetype using the given type. |
597 | * Returns the first archetype using the given type. |
595 | * Used in treasure-generation. |
598 | * Used in treasure-generation. |
596 | */ |
599 | */ |
597 | archetype * |
600 | static archetype * |
598 | type_to_archetype (int type) |
601 | type_to_archetype (int type) |
599 | { |
602 | { |
600 | for_all_archetypes (at) |
603 | for_all_archetypes (at) |
601 | if (at->type == type && at->head_ () != at) |
604 | if (at->type == type && at->head_ () != at) |
602 | return at; |
605 | return at; |