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 |
9 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
10 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your 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 GNU General Public License |
19 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * and the GNU General Public License along with this program. If not, see |
|
|
21 | * <http://www.gnu.org/licenses/>. |
20 | * |
22 | * |
21 | * 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> |
22 | */ |
24 | */ |
23 | |
25 | |
24 | #include <cassert> |
26 | #include <cassert> |
|
|
27 | #include <functional> |
|
|
28 | |
|
|
29 | #include <flat_hash_map.hpp> |
25 | |
30 | |
26 | #include <global.h> |
31 | #include <global.h> |
27 | #include <loader.h> |
|
|
28 | |
|
|
29 | #include <tr1/functional> |
|
|
30 | #include <tr1/unordered_map> |
|
|
31 | |
32 | |
32 | 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 |
33 | arch_ptr archetype::empty; |
34 | arch_ptr archetype::empty; |
34 | |
35 | |
35 | // the hashtable |
36 | // the hashtable |
36 | typedef std::tr1::unordered_map |
37 | typedef ska::flat_hash_map |
37 | < |
38 | < |
38 | const char *, |
39 | const char *, |
39 | arch_ptr, |
40 | arch_ptr, |
40 | str_hash, |
41 | str_hash, |
41 | str_equal, |
42 | str_equal, |
… | |
… | |
49 | |
50 | |
50 | // the vector of other_arch references to be resolved |
51 | // the vector of other_arch references to be resolved |
51 | static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; |
52 | static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; |
52 | // the vector of loaded but not yet committed archetypes |
53 | // the vector of loaded but not yet committed archetypes |
53 | static std::vector<archetype *> postponed_arch; |
54 | static std::vector<archetype *> postponed_arch; |
|
|
55 | |
|
|
56 | //+GPL |
|
|
57 | |
|
|
58 | /* |
|
|
59 | * Creates an object. This function is called by archetype::get () |
|
|
60 | * if it fails to find the appropriate archetype. |
|
|
61 | * Thus archetype::get() will be guaranteed to always return |
|
|
62 | * an object, and never NULL. |
|
|
63 | */ |
|
|
64 | static object * |
|
|
65 | create_singularity (const char *name) |
|
|
66 | { |
|
|
67 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
|
|
68 | |
|
|
69 | if (!strcmp (name, "bug")) |
|
|
70 | abort (); |
|
|
71 | |
|
|
72 | object *op = archetype::get (shstr_bug); |
|
|
73 | op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name); |
|
|
74 | |
|
|
75 | return op; |
|
|
76 | } |
54 | |
77 | |
55 | /** |
78 | /** |
56 | * GROS - This function retrieves an archetype given the name that appears |
79 | * GROS - This function retrieves an archetype given the name that appears |
57 | * during the game (for example, "writing pen" instead of "stylus"). |
80 | * during the game (for example, "writing pen" instead of "stylus"). |
58 | * It does not use the hashtable system, but browse the whole archlist each time. |
81 | * It does not use the hashtable system, but browse the whole archlist each time. |
… | |
… | |
140 | */ |
163 | */ |
141 | object * |
164 | object * |
142 | get_archetype_by_object_name (const char *name) |
165 | get_archetype_by_object_name (const char *name) |
143 | { |
166 | { |
144 | char tmpname[MAX_BUF]; |
167 | char tmpname[MAX_BUF]; |
145 | int i; |
|
|
146 | |
168 | |
147 | assign (tmpname, name); |
169 | assign (tmpname, name); |
148 | |
170 | |
149 | for (i = strlen (tmpname); i > 0; i--) |
171 | for (int i = strlen (tmpname); i > 0; i--) |
150 | { |
172 | { |
151 | tmpname[i] = 0; |
173 | tmpname[i] = 0; |
152 | |
174 | |
153 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
175 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
154 | return at->instance (); |
176 | return at->instance (); |
… | |
… | |
191 | /* All is a very generic match - low match value */ |
213 | /* All is a very generic match - low match value */ |
192 | if (!strcmp (cp, "all")) |
214 | if (!strcmp (cp, "all")) |
193 | return 1; |
215 | return 1; |
194 | |
216 | |
195 | /* unpaid is a little more specific */ |
217 | /* unpaid is a little more specific */ |
196 | if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) |
218 | if (!strcmp (cp, "unpaid") && op->flag [FLAG_UNPAID]) |
197 | return 2; |
219 | return 2; |
198 | if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) |
220 | |
|
|
221 | if (!strcmp (cp, "cursed") && op->flag [FLAG_KNOWN_CURSED] && (op->flag [FLAG_CURSED] || op->flag [FLAG_DAMNED])) |
199 | return 2; |
222 | return 2; |
200 | |
223 | |
201 | if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) |
224 | if (!strcmp (cp, "unlocked") && !op->flag [FLAG_INV_LOCKED]) |
202 | return 2; |
225 | return 2; |
203 | |
226 | |
204 | /* Allow for things like '100 arrows' */ |
227 | /* Allow for things like '100 arrows' */ |
205 | if ((count = atoi (cp)) != 0) |
228 | if ((count = atoi (cp)) != 0) |
206 | { |
229 | { |
… | |
… | |
224 | * is because of the 'else' handling - we don't want to match on |
247 | * is because of the 'else' handling - we don't want to match on |
225 | * something and set a low retval, even though it may match a higher retcal |
248 | * something and set a low retval, even though it may match a higher retcal |
226 | * later. So keep it in descending order here, so we try for the best |
249 | * later. So keep it in descending order here, so we try for the best |
227 | * match first, and work downward. |
250 | * match first, and work downward. |
228 | */ |
251 | */ |
|
|
252 | const char *qbn0, *qbn1, *qsn; // query base name/short name caches |
|
|
253 | |
229 | if (!strcasecmp (cp, query_name (op))) |
254 | if (!strcasecmp (cp, query_name (op))) |
230 | retval = 20; |
255 | retval = 20; |
231 | else if (!strcasecmp (cp, query_short_name (op))) |
256 | else if (!strcasecmp (cp, qsn = query_short_name (op))) |
232 | retval = 18; |
257 | retval = 18; |
233 | else if (!strcasecmp (cp, query_base_name (op, 0))) |
258 | else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0))) |
234 | retval = 16; |
259 | retval = 16; |
235 | else if (!strcasecmp (cp, query_base_name (op, 1))) |
260 | else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1))) |
236 | retval = 16; |
261 | retval = 16; |
237 | else if (op->custom_name && !strcasecmp (cp, op->custom_name)) |
262 | else if (op->custom_name && !strcasecmp (cp, op->custom_name)) |
238 | retval = 15; |
263 | retval = 15; |
239 | else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) |
264 | else if (!strncasecmp (cp, qbn0, strlen (cp))) |
240 | retval = 14; |
265 | retval = 14; |
241 | else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) |
266 | else if (!strncasecmp (cp, qbn1, strlen (cp))) |
242 | retval = 14; |
267 | retval = 14; |
243 | /* Do substring checks, so things like 'Str+1' will match. |
268 | /* Do substring checks, so things like 'Str+1' will match. |
244 | * retval of these should perhaps be lower - they are lower |
269 | * retval of these should perhaps be lower - they are lower |
245 | * then the specific strcasecmp aboves, but still higher than |
270 | * then the specific strcasecmp aboves, but still higher than |
246 | * some other match criteria. |
271 | * some other match criteria. |
247 | */ |
272 | */ |
248 | else if (strstr (query_base_name (op, 1), cp)) |
273 | else if (strstr (qbn1, cp)) |
249 | retval = 12; |
274 | retval = 12; |
250 | else if (strstr (query_base_name (op, 0), cp)) |
275 | else if (strstr (qbn0, cp)) |
251 | retval = 12; |
276 | retval = 12; |
252 | else if (strstr (query_short_name (op), cp)) |
277 | else if (strstr (qsn, cp)) |
253 | retval = 12; |
278 | retval = 12; |
254 | /* Check against plural/non plural based on count. */ |
279 | /* Check against plural/non plural based on count. */ |
255 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
280 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
256 | retval = 6; |
281 | retval = 6; |
257 | else if (count == 1 && !strcasecmp (op->name, cp)) |
282 | else if (count == 1 && !strcasecmp (op->name, cp)) |
258 | retval = 6; |
283 | retval = 6; |
259 | /* base name matched - not bad */ |
284 | /* base name matched - not bad */ |
260 | else if (strcasecmp (cp, op->name) == 0 && !count) |
285 | else if (strcasecmp (cp, op->name) == 0 && !count) |
261 | retval = 4; |
286 | retval = 4; |
262 | /* Check for partial custom name, but give a real low priority */ |
287 | /* Check for partial custom name, but give a real low priority */ |
263 | else if (op->custom_name && strstr (op->custom_name, cp)) |
288 | else if (op->custom_name.contains (cp)) |
264 | retval = 3; |
289 | retval = 3; |
265 | |
290 | |
266 | if (retval) |
291 | if (retval) |
267 | { |
292 | { |
268 | if (pl->type == PLAYER) |
293 | if (pl->type == PLAYER) |
… | |
… | |
273 | } |
298 | } |
274 | |
299 | |
275 | return 0; |
300 | return 0; |
276 | } |
301 | } |
277 | |
302 | |
|
|
303 | //-GPL |
|
|
304 | |
|
|
305 | void |
|
|
306 | archetype::do_delete () |
|
|
307 | { |
|
|
308 | delete this; |
|
|
309 | } |
|
|
310 | |
278 | archetype::archetype (const char *name) |
311 | archetype::archetype (const char *name) |
279 | { |
312 | { |
280 | arch = this; |
313 | arch = this; |
281 | this->archname = this->name = this->name_pl = name; |
314 | this->archname = this->name = this->name_pl = name; |
282 | } |
315 | } |
… | |
… | |
322 | return 0; |
355 | return 0; |
323 | else |
356 | else |
324 | return i->second; |
357 | return i->second; |
325 | } |
358 | } |
326 | |
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 | |
327 | archetype * |
371 | archetype * |
328 | archetype::read (object_thawer &f) |
372 | archetype::read (object_thawer &f) |
329 | { |
373 | { |
330 | assert (f.kw == KW_object); |
374 | assert (f.kw == KW_object); |
331 | |
375 | |
… | |
… | |
340 | f.next (); |
384 | f.next (); |
341 | |
385 | |
342 | #if 0 |
386 | #if 0 |
343 | // implementing it here in the server does neither allow multiple inheritence |
387 | // 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, |
388 | // 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). |
389 | // and other resource files dynamically loaded (as opposed to being preprocessed). |
346 | // not that any of this is relevant as of yet... |
390 | // not that any of this is relevant as of yet... |
347 | if (f.kw == KW_inherit) |
391 | if (f.kw == KW_inherit) |
348 | { |
392 | { |
349 | if (archetype *at = find (f.get_str ())) |
393 | if (archetype *at = find (f.get_str ())) |
350 | *op = at->clone; |
394 | *op = at->clone; |
… | |
… | |
380 | goto fail; |
424 | goto fail; |
381 | } |
425 | } |
382 | } |
426 | } |
383 | |
427 | |
384 | { |
428 | { |
385 | auto (at, parts.begin ()); |
|
|
386 | |
|
|
387 | archetype *new_head = parts.front (); |
429 | archetype *new_head = parts.front (); |
388 | archetype *old_head = find (new_head->archname); |
430 | archetype *old_head = find (new_head->archname); |
389 | |
431 | |
390 | if (old_head && !old_head->is_head ()) |
432 | if (old_head && !old_head->is_head ()) |
391 | { |
433 | { |
… | |
… | |
393 | &new_head->archname, &old_head->archname); |
435 | &new_head->archname, &old_head->archname); |
394 | goto fail; |
436 | goto fail; |
395 | } |
437 | } |
396 | |
438 | |
397 | // 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 |
398 | for (auto (at, parts.begin ()); at != parts.end (); ++at) |
440 | for (auto &&at : parts) |
399 | { |
441 | { |
400 | archetype *new_part = *at; |
442 | archetype *new_part = at; |
401 | archetype *old_part = find (new_part->archname); |
443 | archetype *old_part = find (new_part->archname); |
402 | |
444 | |
403 | if (old_part && old_part->head_ () != old_head) |
445 | if (old_part && old_part->head_ () != old_head) |
404 | { |
446 | { |
405 | 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", |
… | |
… | |
407 | goto fail; |
449 | goto fail; |
408 | } |
450 | } |
409 | } |
451 | } |
410 | |
452 | |
411 | // assemble new chain |
453 | // assemble new chain |
412 | new_head->min_x = new_head->max_x = new_head->x; |
454 | new_head->max_x = new_head->x; |
413 | new_head->min_y = new_head->max_y = new_head->y; |
|
|
414 | |
455 | |
415 | archetype *less = new_head; |
456 | archetype *less = new_head; |
416 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
457 | for (auto &&p = parts.begin () + 1; p != parts.end (); ++p) |
417 | { |
458 | { |
418 | archetype *at = *p; |
459 | archetype *at = *p; |
419 | |
460 | |
420 | // some flags get inherited from the head (probably a lot more) |
461 | // some flags get inherited from the head (probably a lot more) |
421 | // 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 |
… | |
… | |
423 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
464 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
424 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
465 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
425 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
466 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
426 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
467 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
427 | |
468 | |
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); |
469 | new_head->max_x = max (new_head->max_x, at->x); |
431 | new_head->max_y = max (new_head->max_y, at->y); |
|
|
432 | |
470 | |
433 | at->head = new_head; |
471 | at->head = new_head; |
434 | less->more = at; |
472 | less->more = at; |
435 | less = at; |
473 | less = at; |
436 | } |
474 | } |
… | |
… | |
439 | |
477 | |
440 | return new_head; |
478 | return new_head; |
441 | } |
479 | } |
442 | |
480 | |
443 | fail: |
481 | fail: |
444 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
482 | for (auto &&at : parts) |
445 | (*p)->destroy (); |
483 | at->destroy (); |
446 | |
484 | |
447 | return 0; |
485 | return 0; |
448 | } |
486 | } |
449 | |
487 | |
450 | void |
488 | void |
… | |
… | |
456 | |
494 | |
457 | void |
495 | void |
458 | archetype::commit_load () |
496 | archetype::commit_load () |
459 | { |
497 | { |
460 | // unlink old archetypes and link in new ones */ |
498 | // unlink old archetypes and link in new ones */ |
461 | for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p) |
499 | for (auto &&at : postponed_arch) |
462 | { |
500 | { |
463 | archetype *at = *p; |
|
|
464 | |
|
|
465 | if (archetype *old = find (at->archname)) |
501 | if (archetype *old = find (at->archname)) |
466 | old->unlink (); |
502 | old->unlink (); |
467 | |
503 | |
468 | allarch.push_back (at); |
504 | allarch.push_back (at); |
469 | |
505 | |
… | |
… | |
472 | } |
508 | } |
473 | |
509 | |
474 | postponed_arch.clear (); |
510 | postponed_arch.clear (); |
475 | |
511 | |
476 | // now resolve arch references |
512 | // now resolve arch references |
477 | for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p) |
513 | for (auto &&p : postponed_arch_ref) // not yet C++17 |
478 | { |
514 | { |
479 | arch_ptr *ap = p->first; |
515 | arch_ptr *ap = p.first; |
480 | archetype *at = find (p->second); |
516 | archetype *at = find (p.second); |
481 | |
517 | |
482 | if (!at) |
518 | if (!at) |
483 | 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); |
484 | |
520 | |
485 | *ap = at; |
521 | *ap = at; |
486 | } |
522 | } |
487 | |
523 | |
488 | postponed_arch_ref.clear (); |
524 | postponed_arch_ref.clear (); |
… | |
… | |
491 | } |
527 | } |
492 | |
528 | |
493 | void |
529 | void |
494 | archetype::gc () |
530 | archetype::gc () |
495 | { |
531 | { |
496 | int cnt = max (1, min (allarch.size () / 128, dirtycnt)); |
532 | int cnt = max (1, min<int> (allarch.size () / 128, dirtycnt)); |
497 | dirtycnt = max (0, dirtycnt - cnt); |
533 | dirtycnt = max (0, dirtycnt - cnt); |
498 | |
534 | |
499 | do |
535 | do |
500 | { |
536 | { |
501 | static int idx; |
537 | static int idx; |
… | |
… | |
510 | |
546 | |
511 | 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 |
512 | ++idx; |
548 | ++idx; |
513 | else |
549 | else |
514 | { |
550 | { |
515 | LOG (llevDebug, "garbage collect arch %s", &at->archname); |
551 | //LOG (llevDebug, "garbage collect arch %s", &at->archname); |
516 | assert (at->arch == at); // verify that refcnt == 1 is truly valid |
552 | assert (at->arch == at); // verify that refcnt == 1 is truly valid |
517 | allarch.erase (idx); |
553 | allarch.erase (idx); |
518 | |
554 | |
519 | // break chain |
555 | // break chain |
520 | for (object *op = at->head_ (); op; ) |
556 | for (object *op = at->head_ (); op; ) |
… | |
… | |
538 | object *op = clone (); |
574 | object *op = clone (); |
539 | op->instantiate (); |
575 | op->instantiate (); |
540 | return op; |
576 | return op; |
541 | } |
577 | } |
542 | |
578 | |
543 | /* |
579 | //+GPL |
544 | * Creates an object. This function is called by get_archetype() |
|
|
545 | * if it fails to find the appropriate archetype. |
|
|
546 | * Thus get_archetype() will be guaranteed to always return |
|
|
547 | * an object, and never NULL. |
|
|
548 | */ |
|
|
549 | object * |
|
|
550 | create_singularity (const char *name) |
|
|
551 | { |
|
|
552 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
|
|
553 | |
|
|
554 | if (!strcmp (name, "bug")) |
|
|
555 | abort (); |
|
|
556 | |
|
|
557 | object *op = archetype::get (shstr_bug); |
|
|
558 | op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name); |
|
|
559 | |
|
|
560 | return op; |
|
|
561 | } |
|
|
562 | |
580 | |
563 | /* |
581 | /* |
564 | * Finds which archetype matches the given name, and returns a new |
582 | * Finds which archetype matches the given name, and returns a new |
565 | * object containing a copy of the archetype. |
583 | * object containing a copy of the archetype. |
566 | */ |
584 | */ |
567 | object * |
585 | object * |
568 | get_archetype (const char *name) |
|
|
569 | { |
|
|
570 | return archetype::get (name); |
|
|
571 | } |
|
|
572 | |
|
|
573 | object * |
|
|
574 | archetype::get (const char *name) |
586 | archetype::get (const char *name) |
575 | { |
587 | { |
576 | archetype *at = find (name); |
588 | archetype *at = find (name); |
577 | |
589 | |
578 | if (!at) |
590 | if (!at) |
… | |
… | |
583 | |
595 | |
584 | /* |
596 | /* |
585 | * Returns the first archetype using the given type. |
597 | * Returns the first archetype using the given type. |
586 | * Used in treasure-generation. |
598 | * Used in treasure-generation. |
587 | */ |
599 | */ |
588 | archetype * |
600 | static archetype * |
589 | type_to_archetype (int type) |
601 | type_to_archetype (int type) |
590 | { |
602 | { |
591 | for_all_archetypes (at) |
603 | for_all_archetypes (at) |
592 | if (at->type == type && at->head_ () != at) |
604 | if (at->type == type && at->head_ () != at) |
593 | return at; |
605 | return at; |
… | |
… | |
640 | } |
652 | } |
641 | |
653 | |
642 | return head; |
654 | return head; |
643 | } |
655 | } |
644 | |
656 | |
|
|
657 | //-GPL |
|
|
658 | |