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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * 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 |
9 | * 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 |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your 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 GNU General Public License |
18 | * 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/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * 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> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <cassert> |
25 | #include <cassert> |
25 | |
26 | |
26 | #include <global.h> |
27 | #include <global.h> |
27 | #include <loader.h> |
|
|
28 | |
28 | |
29 | #include <tr1/functional> |
29 | #include <tr1/functional> |
30 | #include <tr1/unordered_map> |
30 | #include <tr1/unordered_map> |
31 | |
31 | |
32 | archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing |
32 | archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing |
… | |
… | |
49 | |
49 | |
50 | // the vector of other_arch references to be resolved |
50 | // the vector of other_arch references to be resolved |
51 | static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; |
51 | static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; |
52 | // the vector of loaded but not yet committed archetypes |
52 | // the vector of loaded but not yet committed archetypes |
53 | static std::vector<archetype *> postponed_arch; |
53 | static std::vector<archetype *> postponed_arch; |
|
|
54 | |
|
|
55 | //+GPL |
|
|
56 | |
|
|
57 | /* |
|
|
58 | * Creates an object. This function is called by get_archetype () |
|
|
59 | * if it fails to find the appropriate archetype. |
|
|
60 | * Thus get_archetype() will be guaranteed to always return |
|
|
61 | * an object, and never NULL. |
|
|
62 | */ |
|
|
63 | static object * |
|
|
64 | create_singularity (const char *name) |
|
|
65 | { |
|
|
66 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
|
|
67 | |
|
|
68 | if (!strcmp (name, "bug")) |
|
|
69 | abort (); |
|
|
70 | |
|
|
71 | object *op = archetype::get (shstr_bug); |
|
|
72 | op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name); |
|
|
73 | |
|
|
74 | return op; |
|
|
75 | } |
54 | |
76 | |
55 | /** |
77 | /** |
56 | * GROS - This function retrieves an archetype given the name that appears |
78 | * GROS - This function retrieves an archetype given the name that appears |
57 | * during the game (for example, "writing pen" instead of "stylus"). |
79 | * 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. |
80 | * It does not use the hashtable system, but browse the whole archlist each time. |
… | |
… | |
102 | { |
124 | { |
103 | shstr_cmp skill_cmp (skill); |
125 | shstr_cmp skill_cmp (skill); |
104 | |
126 | |
105 | for_all_archetypes (at) |
127 | for_all_archetypes (at) |
106 | if (at->skill == skill_cmp && (type == -1 || type == at->type)) |
128 | if (at->skill == skill_cmp && (type == -1 || type == at->type)) |
107 | return arch_to_object (at); |
129 | return at->instance (); |
108 | |
130 | |
109 | return 0; |
131 | return 0; |
110 | } |
132 | } |
111 | |
133 | |
112 | /* similiar to above - this returns the first archetype |
134 | /* similiar to above - this returns the first archetype |
… | |
… | |
133 | * - name: The name we're searching for (ex: "writing pen"); |
155 | * - name: The name we're searching for (ex: "writing pen"); |
134 | * Return value: |
156 | * Return value: |
135 | * - a corresponding object if found; a singularity object if not found. |
157 | * - a corresponding object if found; a singularity object if not found. |
136 | * Note by MSW - it appears that it takes the full name and keeps |
158 | * Note by MSW - it appears that it takes the full name and keeps |
137 | * shortening it until it finds a match. I re-wrote this so that it |
159 | * shortening it until it finds a match. I re-wrote this so that it |
138 | * doesn't malloc it each time - not that this function is used much, |
160 | * doesn't allocate it each time - not that this function is used much, |
139 | * but it otherwise had a big memory leak. |
161 | * but it otherwise had a big memory leak. |
140 | */ |
162 | */ |
141 | object * |
163 | object * |
142 | get_archetype_by_object_name (const char *name) |
164 | get_archetype_by_object_name (const char *name) |
143 | { |
165 | { |
144 | char tmpname[MAX_BUF]; |
166 | char tmpname[MAX_BUF]; |
145 | int i; |
|
|
146 | |
167 | |
147 | assign (tmpname, name); |
168 | assign (tmpname, name); |
148 | |
169 | |
149 | for (i = strlen (tmpname); i > 0; i--) |
170 | for (int i = strlen (tmpname); i > 0; i--) |
150 | { |
171 | { |
151 | tmpname[i] = 0; |
172 | tmpname[i] = 0; |
152 | |
173 | |
153 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
174 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
154 | return arch_to_object (at); |
175 | return at->instance (); |
155 | } |
176 | } |
156 | |
177 | |
157 | return create_singularity (name); |
178 | return create_singularity (name); |
158 | } |
179 | } |
159 | |
180 | |
… | |
… | |
193 | return 1; |
214 | return 1; |
194 | |
215 | |
195 | /* unpaid is a little more specific */ |
216 | /* unpaid is a little more specific */ |
196 | if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) |
217 | if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) |
197 | return 2; |
218 | return 2; |
|
|
219 | |
198 | if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) |
220 | if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) |
199 | return 2; |
221 | return 2; |
200 | |
222 | |
201 | if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) |
223 | if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) |
202 | return 2; |
224 | return 2; |
… | |
… | |
224 | * is because of the 'else' handling - we don't want to match on |
246 | * 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 |
247 | * 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 |
248 | * later. So keep it in descending order here, so we try for the best |
227 | * match first, and work downward. |
249 | * match first, and work downward. |
228 | */ |
250 | */ |
|
|
251 | const char *qbn0, *qbn1, *qsn; // query base name/short name caches |
|
|
252 | |
229 | if (!strcasecmp (cp, query_name (op))) |
253 | if (!strcasecmp (cp, query_name (op))) |
230 | retval = 20; |
254 | retval = 20; |
231 | else if (!strcasecmp (cp, query_short_name (op))) |
255 | else if (!strcasecmp (cp, qsn = query_short_name (op))) |
232 | retval = 18; |
256 | retval = 18; |
233 | else if (!strcasecmp (cp, query_base_name (op, 0))) |
257 | else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0))) |
234 | retval = 16; |
258 | retval = 16; |
235 | else if (!strcasecmp (cp, query_base_name (op, 1))) |
259 | else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1))) |
236 | retval = 16; |
260 | retval = 16; |
237 | else if (op->custom_name && !strcasecmp (cp, op->custom_name)) |
261 | else if (op->custom_name && !strcasecmp (cp, op->custom_name)) |
238 | retval = 15; |
262 | retval = 15; |
239 | else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) |
263 | else if (!strncasecmp (cp, qbn0, strlen (cp))) |
240 | retval = 14; |
264 | retval = 14; |
241 | else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) |
265 | else if (!strncasecmp (cp, qbn1, strlen (cp))) |
242 | retval = 14; |
266 | retval = 14; |
243 | /* Do substring checks, so things like 'Str+1' will match. |
267 | /* Do substring checks, so things like 'Str+1' will match. |
244 | * retval of these should perhaps be lower - they are lower |
268 | * retval of these should perhaps be lower - they are lower |
245 | * then the specific strcasecmp aboves, but still higher than |
269 | * then the specific strcasecmp aboves, but still higher than |
246 | * some other match criteria. |
270 | * some other match criteria. |
247 | */ |
271 | */ |
248 | else if (strstr (query_base_name (op, 1), cp)) |
272 | else if (strstr (qbn1, cp)) |
249 | retval = 12; |
273 | retval = 12; |
250 | else if (strstr (query_base_name (op, 0), cp)) |
274 | else if (strstr (qbn0, cp)) |
251 | retval = 12; |
275 | retval = 12; |
252 | else if (strstr (query_short_name (op), cp)) |
276 | else if (strstr (qsn, cp)) |
253 | retval = 12; |
277 | retval = 12; |
254 | /* Check against plural/non plural based on count. */ |
278 | /* Check against plural/non plural based on count. */ |
255 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
279 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
256 | retval = 6; |
280 | retval = 6; |
257 | else if (count == 1 && !strcasecmp (op->name, cp)) |
281 | else if (count == 1 && !strcasecmp (op->name, cp)) |
258 | retval = 6; |
282 | retval = 6; |
259 | /* base name matched - not bad */ |
283 | /* base name matched - not bad */ |
260 | else if (strcasecmp (cp, op->name) == 0 && !count) |
284 | else if (strcasecmp (cp, op->name) == 0 && !count) |
261 | retval = 4; |
285 | retval = 4; |
262 | /* Check for partial custom name, but give a real low priority */ |
286 | /* Check for partial custom name, but give a real low priority */ |
263 | else if (op->custom_name && strstr (op->custom_name, cp)) |
287 | else if (op->custom_name.contains (cp)) |
264 | retval = 3; |
288 | retval = 3; |
265 | |
289 | |
266 | if (retval) |
290 | if (retval) |
267 | { |
291 | { |
268 | if (pl->type == PLAYER) |
292 | if (pl->type == PLAYER) |
… | |
… | |
273 | } |
297 | } |
274 | |
298 | |
275 | return 0; |
299 | return 0; |
276 | } |
300 | } |
277 | |
301 | |
|
|
302 | //-GPL |
|
|
303 | |
278 | archetype::archetype (const char *name) |
304 | archetype::archetype (const char *name) |
279 | { |
305 | { |
280 | arch = this; |
306 | arch = this; |
281 | this->archname = this->name = this->name_pl = name; |
307 | this->archname = this->name = this->name_pl = name; |
282 | } |
308 | } |
… | |
… | |
320 | |
346 | |
321 | if (i == ht.end ()) |
347 | if (i == ht.end ()) |
322 | return 0; |
348 | return 0; |
323 | else |
349 | else |
324 | return i->second; |
350 | return i->second; |
|
|
351 | } |
|
|
352 | |
|
|
353 | void |
|
|
354 | archetype::post_load_check () |
|
|
355 | { |
|
|
356 | object::post_load_check (); |
|
|
357 | |
|
|
358 | assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL])); |
325 | } |
359 | } |
326 | |
360 | |
327 | archetype * |
361 | archetype * |
328 | archetype::read (object_thawer &f) |
362 | archetype::read (object_thawer &f) |
329 | { |
363 | { |
… | |
… | |
407 | goto fail; |
441 | goto fail; |
408 | } |
442 | } |
409 | } |
443 | } |
410 | |
444 | |
411 | // assemble new chain |
445 | // assemble new chain |
412 | new_head->min_x = new_head->max_x = new_head->x; |
446 | new_head->max_x = new_head->x; |
413 | new_head->min_y = new_head->max_y = new_head->y; |
|
|
414 | |
447 | |
415 | archetype *less = new_head; |
448 | archetype *less = new_head; |
416 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
449 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
417 | { |
450 | { |
418 | archetype *at = *p; |
451 | archetype *at = *p; |
… | |
… | |
423 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
456 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
424 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
457 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
425 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
458 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
426 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
459 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
427 | |
460 | |
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); |
461 | new_head->max_x = max (new_head->max_x, at->x); |
431 | new_head->max_y = max (new_head->max_y, at->y); |
|
|
432 | |
462 | |
433 | at->head = new_head; |
463 | at->head = new_head; |
434 | less->more = at; |
464 | less->more = at; |
435 | less = at; |
465 | less = at; |
436 | } |
466 | } |
… | |
… | |
440 | return new_head; |
470 | return new_head; |
441 | } |
471 | } |
442 | |
472 | |
443 | fail: |
473 | fail: |
444 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
474 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
445 | (*p)->destroy (true); |
475 | (*p)->destroy (); |
446 | |
476 | |
447 | return 0; |
477 | return 0; |
448 | } |
478 | } |
449 | |
479 | |
450 | void |
480 | void |
… | |
… | |
510 | |
540 | |
511 | if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object |
541 | if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object |
512 | ++idx; |
542 | ++idx; |
513 | else |
543 | else |
514 | { |
544 | { |
515 | LOG (llevDebug, "garbage collect arch %s", at->debug_desc ()); |
545 | LOG (llevDebug, "garbage collect arch %s", &at->archname); |
516 | assert (at->arch == at); // verify that refcnt == 1 is truely valid |
546 | assert (at->arch == at); // verify that refcnt == 1 is truly valid |
517 | allarch.erase (idx); |
547 | allarch.erase (idx); |
|
|
548 | |
|
|
549 | // break chain |
|
|
550 | for (object *op = at->head_ (); op; ) |
|
|
551 | { |
|
|
552 | object *next = op->more; |
|
|
553 | op->head = 0; |
|
|
554 | op->more = 0; |
|
|
555 | op = next; |
|
|
556 | } |
|
|
557 | |
|
|
558 | at->destroy (); |
518 | at->arch = 0; |
559 | at->arch = 0; |
519 | at->more = 0; |
|
|
520 | at->destroy (); |
|
|
521 | } |
560 | } |
522 | } |
561 | } |
523 | while (--cnt); |
562 | while (--cnt); |
524 | } |
|
|
525 | |
|
|
526 | /* |
|
|
527 | * Creates and returns a new object which is a copy of the given archetype. |
|
|
528 | * This function returns NULL on failure. |
|
|
529 | */ |
|
|
530 | object * |
|
|
531 | arch_to_object (archetype *at) |
|
|
532 | { |
|
|
533 | if (!at) |
|
|
534 | { |
|
|
535 | LOG (llevError, "Couldn't find archetype.\n"); |
|
|
536 | return 0; |
|
|
537 | } |
|
|
538 | |
|
|
539 | object *op = at->clone (); |
|
|
540 | op->arch = at; |
|
|
541 | op->instantiate (); |
|
|
542 | |
|
|
543 | return op; |
|
|
544 | } |
563 | } |
545 | |
564 | |
546 | object * |
565 | object * |
547 | archetype::instance () |
566 | archetype::instance () |
548 | { |
567 | { |
549 | return arch_to_object (this); |
568 | object *op = clone (); |
550 | } |
569 | op->instantiate (); |
551 | |
|
|
552 | /* |
|
|
553 | * Creates an object. This function is called by get_archetype() |
|
|
554 | * if it fails to find the appropriate archetype. |
|
|
555 | * Thus get_archetype() will be guaranteed to always return |
|
|
556 | * an object, and never NULL. |
|
|
557 | */ |
|
|
558 | object * |
|
|
559 | create_singularity (const char *name) |
|
|
560 | { |
|
|
561 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
|
|
562 | |
|
|
563 | if (!strcmp (name, "bug")) |
|
|
564 | abort (); |
|
|
565 | |
|
|
566 | char buf[MAX_BUF]; |
|
|
567 | sprintf (buf, "bug, please report (%s)", name); |
|
|
568 | |
|
|
569 | object *op = get_archetype ("bug"); |
|
|
570 | op->name = op->name_pl = buf; |
|
|
571 | |
|
|
572 | return op; |
570 | return op; |
573 | } |
571 | } |
|
|
572 | |
|
|
573 | //+GPL |
574 | |
574 | |
575 | /* |
575 | /* |
576 | * Finds which archetype matches the given name, and returns a new |
576 | * Finds which archetype matches the given name, and returns a new |
577 | * object containing a copy of the archetype. |
577 | * object containing a copy of the archetype. |
578 | */ |
578 | */ |
579 | object * |
579 | object * |
580 | get_archetype (const char *name) |
580 | get_archetype (const char *name) |
581 | { |
581 | { |
|
|
582 | return archetype::get (name); |
|
|
583 | } |
|
|
584 | |
|
|
585 | object * |
|
|
586 | archetype::get (const char *name) |
|
|
587 | { |
582 | archetype *at = archetype::find (name); |
588 | archetype *at = find (name); |
583 | |
589 | |
584 | if (!at) |
590 | if (!at) |
585 | return create_singularity (name); |
591 | return create_singularity (name); |
586 | |
592 | |
587 | return arch_to_object (at); |
593 | return at->instance (); |
588 | } |
|
|
589 | |
|
|
590 | object * |
|
|
591 | archetype::get (const char *name) |
|
|
592 | { |
|
|
593 | return get_archetype (name); |
|
|
594 | } |
594 | } |
595 | |
595 | |
596 | /* |
596 | /* |
597 | * Returns the first archetype using the given type. |
597 | * Returns the first archetype using the given type. |
598 | * Used in treasure-generation. |
598 | * Used in treasure-generation. |
599 | */ |
599 | */ |
600 | archetype * |
600 | static archetype * |
601 | type_to_archetype (int type) |
601 | type_to_archetype (int type) |
602 | { |
602 | { |
603 | for_all_archetypes (at) |
603 | for_all_archetypes (at) |
604 | if (at->type == type && at->head_ () != at) |
604 | if (at->type == type && at->head_ () != at) |
605 | return at; |
605 | return at; |
… | |
… | |
613 | * Used in treasure-generation. |
613 | * Used in treasure-generation. |
614 | */ |
614 | */ |
615 | object * |
615 | object * |
616 | clone_arch (int type) |
616 | clone_arch (int type) |
617 | { |
617 | { |
618 | archetype *at; |
618 | archetype *at = type_to_archetype (type); |
619 | |
619 | |
620 | if ((at = type_to_archetype (type)) == NULL) |
620 | if (!at) |
621 | { |
621 | { |
622 | LOG (llevError, "Can't clone archetype %d\n", type); |
622 | LOG (llevError, "Can't clone archetype %d\n", type); |
623 | return 0; |
623 | return 0; |
624 | } |
624 | } |
625 | |
625 | |
626 | object *op = at->clone (); |
626 | return at->instance (); |
627 | op->instantiate (); |
|
|
628 | return op; |
|
|
629 | } |
627 | } |
630 | |
628 | |
631 | /* |
629 | /* |
632 | * member: make instance from class |
630 | * member: make instance from class |
633 | */ |
631 | */ |
… | |
… | |
636 | { |
634 | { |
637 | object *op, *prev = 0, *head = 0; |
635 | object *op, *prev = 0, *head = 0; |
638 | |
636 | |
639 | while (at) |
637 | while (at) |
640 | { |
638 | { |
641 | op = arch_to_object (at); |
639 | op = at->instance (); |
642 | |
640 | |
643 | op->x = at->x; |
641 | op->x = at->x; |
644 | op->y = at->y; |
642 | op->y = at->y; |
645 | |
643 | |
646 | if (head) |
644 | if (head) |
… | |
… | |
654 | } |
652 | } |
655 | |
653 | |
656 | return head; |
654 | return head; |
657 | } |
655 | } |
658 | |
656 | |
|
|
657 | //-GPL |
|
|
658 | |