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 (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * 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 |
9 | * 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 |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
11 | * 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 Affero GNU General Public License |
18 | * 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 |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * <http://www.gnu.org/licenses/>. |
20 | * <http://www.gnu.org/licenses/>. |
21 | * |
21 | * |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #include <cassert> |
25 | #include <cassert> |
26 | |
26 | |
… | |
… | |
53 | static std::vector<archetype *> postponed_arch; |
53 | static std::vector<archetype *> postponed_arch; |
54 | |
54 | |
55 | //+GPL |
55 | //+GPL |
56 | |
56 | |
57 | /* |
57 | /* |
58 | * Creates an object. This function is called by get_archetype () |
58 | * Creates an object. This function is called by archetype::get () |
59 | * if it fails to find the appropriate archetype. |
59 | * if it fails to find the appropriate archetype. |
60 | * Thus get_archetype() will be guaranteed to always return |
60 | * Thus archetype::get() will be guaranteed to always return |
61 | * an object, and never NULL. |
61 | * an object, and never NULL. |
62 | */ |
62 | */ |
63 | static object * |
63 | static object * |
64 | create_singularity (const char *name) |
64 | create_singularity (const char *name) |
65 | { |
65 | { |
… | |
… | |
530 | } |
530 | } |
531 | |
531 | |
532 | void |
532 | void |
533 | archetype::gc () |
533 | archetype::gc () |
534 | { |
534 | { |
535 | int cnt = max (1, min (allarch.size () / 128, dirtycnt)); |
535 | int cnt = max (1, min<int> (allarch.size () / 128, dirtycnt)); |
536 | dirtycnt = max (0, dirtycnt - cnt); |
536 | dirtycnt = max (0, dirtycnt - cnt); |
537 | |
537 | |
538 | do |
538 | do |
539 | { |
539 | { |
540 | static int idx; |
540 | static int idx; |
… | |
… | |
549 | |
549 | |
550 | if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object |
550 | if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object |
551 | ++idx; |
551 | ++idx; |
552 | else |
552 | else |
553 | { |
553 | { |
554 | LOG (llevDebug, "garbage collect arch %s", &at->archname); |
554 | //LOG (llevDebug, "garbage collect arch %s", &at->archname); |
555 | assert (at->arch == at); // verify that refcnt == 1 is truly valid |
555 | assert (at->arch == at); // verify that refcnt == 1 is truly valid |
556 | allarch.erase (idx); |
556 | allarch.erase (idx); |
557 | |
557 | |
558 | // break chain |
558 | // break chain |
559 | for (object *op = at->head_ (); op; ) |
559 | for (object *op = at->head_ (); op; ) |
… | |
… | |
584 | /* |
584 | /* |
585 | * Finds which archetype matches the given name, and returns a new |
585 | * Finds which archetype matches the given name, and returns a new |
586 | * object containing a copy of the archetype. |
586 | * object containing a copy of the archetype. |
587 | */ |
587 | */ |
588 | object * |
588 | object * |
589 | get_archetype (const char *name) |
|
|
590 | { |
|
|
591 | return archetype::get (name); |
|
|
592 | } |
|
|
593 | |
|
|
594 | object * |
|
|
595 | archetype::get (const char *name) |
589 | archetype::get (const char *name) |
596 | { |
590 | { |
597 | archetype *at = find (name); |
591 | archetype *at = find (name); |
598 | |
592 | |
599 | if (!at) |
593 | if (!at) |