ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/arch.C
(Generate patch)

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.89 by root, Mon Oct 12 14:00:57 2009 UTC vs.
Revision 1.104 by root, Mon Apr 12 05:22:37 2010 UTC

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
33archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing 32archetype *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
52static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; 51static 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
54static std::vector<archetype *> postponed_arch; 53static 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 */
63static object *
64create_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 */
142object * 163object *
143get_archetype_by_object_name (const char *name) 164get_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 ();
… …
192 /* All is a very generic match - low match value */ 212 /* All is a very generic match - low match value */
193 if (!strcmp (cp, "all")) 213 if (!strcmp (cp, "all"))
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") && op->flag [FLAG_UNPAID])
198 return 2; 218 return 2;
199 if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) 219
220 if (!strcmp (cp, "cursed") && op->flag [FLAG_KNOWN_CURSED] && (op->flag [FLAG_CURSED] || op->flag [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") && !op->flag [FLAG_INV_LOCKED])
203 return 2; 224 return 2;
204 225
205 /* Allow for things like '100 arrows' */ 226 /* Allow for things like '100 arrows' */
206 if ((count = atoi (cp)) != 0) 227 if ((count = atoi (cp)) != 0)
207 { 228 {
… …
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
304void
305archetype::do_delete ()
306{
307 delete this;
308}
309
279archetype::archetype (const char *name) 310archetype::archetype (const char *name)
280{ 311{
281 arch = this; 312 arch = this;
282 this->archname = this->name = this->name_pl = name; 313 this->archname = this->name = this->name_pl = name;
283} 314}
… …
323 return 0; 354 return 0;
324 else 355 else
325 return i->second; 356 return i->second;
326} 357}
327 358
359void
360archetype::post_load_check ()
361{
362 object::post_load_check ();
363
364 assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL]));
365}
366
328archetype * 367archetype *
329archetype::read (object_thawer &f) 368archetype::read (object_thawer &f)
330{ 369{
331 assert (f.kw == KW_object); 370 assert (f.kw == KW_object);
332 371
… …
341 f.next (); 380 f.next ();
342 381
343#if 0 382#if 0
344 // implementing it here in the server does neither allow multiple inheritence 383 // implementing it here in the server does neither allow multiple inheritence
345 // nor does it cleanly "just override". it would allow use in map files, though, 384 // nor does it cleanly "just override". it would allow use in map files, though,
346 // and other resource files dynamically laoded (as opposed to being preprocessed). 385 // and other resource files dynamically loaded (as opposed to being preprocessed).
347 // not that any of this is relevant as of yet... 386 // not that any of this is relevant as of yet...
348 if (f.kw == KW_inherit) 387 if (f.kw == KW_inherit)
349 { 388 {
350 if (archetype *at = find (f.get_str ())) 389 if (archetype *at = find (f.get_str ()))
351 *op = at->clone; 390 *op = at->clone;
… …
408 goto fail; 447 goto fail;
409 } 448 }
410 } 449 }
411 450
412 // assemble new chain 451 // assemble new chain
413 new_head->min_x = new_head->max_x = new_head->x; 452 new_head->max_x = new_head->x;
414 new_head->min_y = new_head->max_y = new_head->y;
415 453
416 archetype *less = new_head; 454 archetype *less = new_head;
417 for (auto (p, parts.begin () + 1); p != parts.end (); ++p) 455 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
418 { 456 {
419 archetype *at = *p; 457 archetype *at = *p;
… …
424 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; 462 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
425 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; 463 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
426 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; 464 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
427 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; 465 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
428 466
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); 467 new_head->max_x = max (new_head->max_x, at->x);
432 new_head->max_y = max (new_head->max_y, at->y);
433 468
434 at->head = new_head; 469 at->head = new_head;
435 less->more = at; 470 less->more = at;
436 less = at; 471 less = at;
437 } 472 }
… …
539 object *op = clone (); 574 object *op = clone ();
540 op->instantiate (); 575 op->instantiate ();
541 return op; 576 return op;
542} 577}
543 578
544/* 579//+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 */
550object *
551create_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 580
564/* 581/*
565 * Finds which archetype matches the given name, and returns a new 582 * Finds which archetype matches the given name, and returns a new
566 * object containing a copy of the archetype. 583 * object containing a copy of the archetype.
567 */ 584 */
… …
584 601
585/* 602/*
586 * Returns the first archetype using the given type. 603 * Returns the first archetype using the given type.
587 * Used in treasure-generation. 604 * Used in treasure-generation.
588 */ 605 */
589archetype * 606static archetype *
590type_to_archetype (int type) 607type_to_archetype (int type)
591{ 608{
592 for_all_archetypes (at) 609 for_all_archetypes (at)
593 if (at->type == type && at->head_ () != at) 610 if (at->type == type && at->head_ () != at)
594 return at; 611 return at;
… …
641 } 658 }
642 659
643 return head; 660 return head;
644} 661}
645 662
663//-GPL
664

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines