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,2009,2010 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 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. |
… | |
… | |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #include <cassert> |
25 | #include <cassert> |
26 | |
26 | |
27 | #include <global.h> |
27 | #include <global.h> |
28 | #include <loader.h> |
|
|
29 | |
28 | |
30 | #include <tr1/functional> |
29 | #include <tr1/functional> |
31 | #include <tr1/unordered_map> |
30 | #include <tr1/unordered_map> |
32 | |
31 | |
33 | 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 |
… | |
… | |
50 | |
49 | |
51 | // the vector of other_arch references to be resolved |
50 | // the vector of other_arch references to be resolved |
52 | static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; |
51 | static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; |
53 | // the vector of loaded but not yet committed archetypes |
52 | // the vector of loaded but not yet committed archetypes |
54 | 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 | } |
55 | |
76 | |
56 | /** |
77 | /** |
57 | * GROS - This function retrieves an archetype given the name that appears |
78 | * GROS - This function retrieves an archetype given the name that appears |
58 | * during the game (for example, "writing pen" instead of "stylus"). |
79 | * during the game (for example, "writing pen" instead of "stylus"). |
59 | * 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. |
… | |
… | |
141 | */ |
162 | */ |
142 | object * |
163 | object * |
143 | get_archetype_by_object_name (const char *name) |
164 | get_archetype_by_object_name (const char *name) |
144 | { |
165 | { |
145 | char tmpname[MAX_BUF]; |
166 | char tmpname[MAX_BUF]; |
146 | int i; |
|
|
147 | |
167 | |
148 | assign (tmpname, name); |
168 | assign (tmpname, name); |
149 | |
169 | |
150 | for (i = strlen (tmpname); i > 0; i--) |
170 | for (int i = strlen (tmpname); i > 0; i--) |
151 | { |
171 | { |
152 | tmpname[i] = 0; |
172 | tmpname[i] = 0; |
153 | |
173 | |
154 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
174 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
155 | return at->instance (); |
175 | return at->instance (); |
… | |
… | |
194 | return 1; |
214 | return 1; |
195 | |
215 | |
196 | /* unpaid is a little more specific */ |
216 | /* unpaid is a little more specific */ |
197 | if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) |
217 | if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) |
198 | return 2; |
218 | return 2; |
|
|
219 | |
199 | 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))) |
200 | return 2; |
221 | return 2; |
201 | |
222 | |
202 | if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) |
223 | if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) |
203 | return 2; |
224 | return 2; |
… | |
… | |
225 | * 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 |
226 | * 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 |
227 | * 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 |
228 | * match first, and work downward. |
249 | * match first, and work downward. |
229 | */ |
250 | */ |
|
|
251 | const char *qbn0, *qbn1, *qsn; // query base name/short name caches |
|
|
252 | |
230 | if (!strcasecmp (cp, query_name (op))) |
253 | if (!strcasecmp (cp, query_name (op))) |
231 | retval = 20; |
254 | retval = 20; |
232 | else if (!strcasecmp (cp, query_short_name (op))) |
255 | else if (!strcasecmp (cp, qsn = query_short_name (op))) |
233 | retval = 18; |
256 | retval = 18; |
234 | else if (!strcasecmp (cp, query_base_name (op, 0))) |
257 | else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0))) |
235 | retval = 16; |
258 | retval = 16; |
236 | else if (!strcasecmp (cp, query_base_name (op, 1))) |
259 | else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1))) |
237 | retval = 16; |
260 | retval = 16; |
238 | else if (op->custom_name && !strcasecmp (cp, op->custom_name)) |
261 | else if (op->custom_name && !strcasecmp (cp, op->custom_name)) |
239 | retval = 15; |
262 | retval = 15; |
240 | else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) |
263 | else if (!strncasecmp (cp, qbn0, strlen (cp))) |
241 | retval = 14; |
264 | retval = 14; |
242 | else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) |
265 | else if (!strncasecmp (cp, qbn1, strlen (cp))) |
243 | retval = 14; |
266 | retval = 14; |
244 | /* Do substring checks, so things like 'Str+1' will match. |
267 | /* Do substring checks, so things like 'Str+1' will match. |
245 | * retval of these should perhaps be lower - they are lower |
268 | * retval of these should perhaps be lower - they are lower |
246 | * then the specific strcasecmp aboves, but still higher than |
269 | * then the specific strcasecmp aboves, but still higher than |
247 | * some other match criteria. |
270 | * some other match criteria. |
248 | */ |
271 | */ |
249 | else if (strstr (query_base_name (op, 1), cp)) |
272 | else if (strstr (qbn1, cp)) |
250 | retval = 12; |
273 | retval = 12; |
251 | else if (strstr (query_base_name (op, 0), cp)) |
274 | else if (strstr (qbn0, cp)) |
252 | retval = 12; |
275 | retval = 12; |
253 | else if (strstr (query_short_name (op), cp)) |
276 | else if (strstr (qsn, cp)) |
254 | retval = 12; |
277 | retval = 12; |
255 | /* Check against plural/non plural based on count. */ |
278 | /* Check against plural/non plural based on count. */ |
256 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
279 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
257 | retval = 6; |
280 | retval = 6; |
258 | else if (count == 1 && !strcasecmp (op->name, cp)) |
281 | else if (count == 1 && !strcasecmp (op->name, cp)) |
… | |
… | |
274 | } |
297 | } |
275 | |
298 | |
276 | return 0; |
299 | return 0; |
277 | } |
300 | } |
278 | |
301 | |
|
|
302 | //-GPL |
|
|
303 | |
279 | archetype::archetype (const char *name) |
304 | archetype::archetype (const char *name) |
280 | { |
305 | { |
281 | arch = this; |
306 | arch = this; |
282 | this->archname = this->name = this->name_pl = name; |
307 | this->archname = this->name = this->name_pl = name; |
283 | } |
308 | } |
… | |
… | |
321 | |
346 | |
322 | if (i == ht.end ()) |
347 | if (i == ht.end ()) |
323 | return 0; |
348 | return 0; |
324 | else |
349 | else |
325 | 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])); |
326 | } |
359 | } |
327 | |
360 | |
328 | archetype * |
361 | archetype * |
329 | archetype::read (object_thawer &f) |
362 | archetype::read (object_thawer &f) |
330 | { |
363 | { |
… | |
… | |
408 | goto fail; |
441 | goto fail; |
409 | } |
442 | } |
410 | } |
443 | } |
411 | |
444 | |
412 | // assemble new chain |
445 | // assemble new chain |
413 | new_head->min_x = new_head->max_x = new_head->x; |
446 | new_head->max_x = new_head->x; |
414 | new_head->min_y = new_head->max_y = new_head->y; |
|
|
415 | |
447 | |
416 | archetype *less = new_head; |
448 | archetype *less = new_head; |
417 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
449 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
418 | { |
450 | { |
419 | archetype *at = *p; |
451 | archetype *at = *p; |
… | |
… | |
424 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
456 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
425 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
457 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
426 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
458 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
427 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
459 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
428 | |
460 | |
429 | new_head->min_x = min (new_head->min_x, at->x); |
|
|
430 | new_head->min_y = min (new_head->min_y, at->y); |
|
|
431 | new_head->max_x = max (new_head->max_x, at->x); |
461 | new_head->max_x = max (new_head->max_x, at->x); |
432 | new_head->max_y = max (new_head->max_y, at->y); |
|
|
433 | |
462 | |
434 | at->head = new_head; |
463 | at->head = new_head; |
435 | less->more = at; |
464 | less->more = at; |
436 | less = at; |
465 | less = at; |
437 | } |
466 | } |
… | |
… | |
539 | object *op = clone (); |
568 | object *op = clone (); |
540 | op->instantiate (); |
569 | op->instantiate (); |
541 | return op; |
570 | return op; |
542 | } |
571 | } |
543 | |
572 | |
544 | /* |
573 | //+GPL |
545 | * Creates an object. This function is called by get_archetype() |
|
|
546 | * if it fails to find the appropriate archetype. |
|
|
547 | * Thus get_archetype() will be guaranteed to always return |
|
|
548 | * an object, and never NULL. |
|
|
549 | */ |
|
|
550 | object * |
|
|
551 | create_singularity (const char *name) |
|
|
552 | { |
|
|
553 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
|
|
554 | |
|
|
555 | if (!strcmp (name, "bug")) |
|
|
556 | abort (); |
|
|
557 | |
|
|
558 | object *op = archetype::get (shstr_bug); |
|
|
559 | op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name); |
|
|
560 | |
|
|
561 | return op; |
|
|
562 | } |
|
|
563 | |
574 | |
564 | /* |
575 | /* |
565 | * Finds which archetype matches the given name, and returns a new |
576 | * Finds which archetype matches the given name, and returns a new |
566 | * object containing a copy of the archetype. |
577 | * object containing a copy of the archetype. |
567 | */ |
578 | */ |
… | |
… | |
584 | |
595 | |
585 | /* |
596 | /* |
586 | * Returns the first archetype using the given type. |
597 | * Returns the first archetype using the given type. |
587 | * Used in treasure-generation. |
598 | * Used in treasure-generation. |
588 | */ |
599 | */ |
589 | archetype * |
600 | static archetype * |
590 | type_to_archetype (int type) |
601 | type_to_archetype (int type) |
591 | { |
602 | { |
592 | for_all_archetypes (at) |
603 | for_all_archetypes (at) |
593 | if (at->type == type && at->head_ () != at) |
604 | if (at->type == type && at->head_ () != at) |
594 | return at; |
605 | return at; |
… | |
… | |
641 | } |
652 | } |
642 | |
653 | |
643 | return head; |
654 | return head; |
644 | } |
655 | } |
645 | |
656 | |
|
|
657 | //-GPL |
|
|
658 | |