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.65 by root, Thu Jun 7 18:55:24 2007 UTC vs.
Revision 1.73 by root, Sun Apr 20 00:44:12 2008 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software; you can redistribute it and/or modify it 8 * Deliantra is free software: you can redistribute it and/or modify
9 * under the terms of the GNU General Public License as published by the Free 9 * it under the terms of the GNU General Public License as published by
10 * Software Foundation; either version 2 of the License, or (at your option) 10 * the Free Software Foundation, either version 3 of the License, or
11 * any later version. 11 * (at your option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, but 13 * This program is distributed in the hope that it will be useful,
14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * 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 along 18 * You should have received a copy of the GNU General Public License
19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 * 20 *
22 * The authors can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 22 */
24 23
25#include <cassert> 24#include <cassert>
26 25
27#include <global.h> 26#include <global.h>
… …
29#include <loader.h> 28#include <loader.h>
30 29
31#include <tr1/functional> 30#include <tr1/functional>
32#include <tr1/unordered_map> 31#include <tr1/unordered_map>
33 32
34/* The naming of these functions is really poor - they are all
35 * pretty much named '.._arch_...', but they may more may not
36 * return archetypes. Some make the arch_to_object call, and thus
37 * return an object. Perhaps those should be called 'archob' functions
38 * to denote they return an object derived from the archetype.
39 * MSW 2003-04-29
40 */
41
42bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing 33archetype *loading_arch; // ugly flag to object laoder etc. to suppress/request special processing
34archetype *archetype::empty;
43 35
44// the hashtable 36// the hashtable
45typedef std::tr1::unordered_map 37typedef std::tr1::unordered_map
46 < 38 <
47 const char *, 39 const char *,
… …
51 slice_allocator< std::pair<const char *const, arch_ptr> > 43 slice_allocator< std::pair<const char *const, arch_ptr> >
52 > HT; 44 > HT;
53 45
54static HT ht (5000); 46static HT ht (5000);
55archvec archetypes; 47archvec archetypes;
48
49// the vector of other_arch references to be resolved
50static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
51// the vector of loaded but not yet committed archetypes
52static std::vector<archetype *> postponed_arch;
56 53
57/** 54/**
58 * GROS - This function retrieves an archetype given the name that appears 55 * GROS - This function retrieves an archetype given the name that appears
59 * during the game (for example, "writing pen" instead of "stylus"). 56 * during the game (for example, "writing pen" instead of "stylus").
60 * It does not use the hashtable system, but browse the whole archlist each time. 57 * It does not use the hashtable system, but browse the whole archlist each time.
… …
69find_archetype_by_object_name (const char *name) 66find_archetype_by_object_name (const char *name)
70{ 67{
71 shstr_cmp name_cmp (name); 68 shstr_cmp name_cmp (name);
72 69
73 for_all_archetypes (at) 70 for_all_archetypes (at)
74 if (at->archname == name_cmp) 71 if (at->name == name_cmp)
75 return at; 72 return at;
76 73
77 return 0; 74 return 0;
78} 75}
79 76
… …
86find_archetype_by_object_type_name (int type, const char *name) 83find_archetype_by_object_type_name (int type, const char *name)
87{ 84{
88 shstr_cmp name_cmp (name); 85 shstr_cmp name_cmp (name);
89 86
90 for_all_archetypes (at) 87 for_all_archetypes (at)
91 if (at->archname == name_cmp && at->type == type) 88 if (at->name == name_cmp && at->type == type)
92 return at; 89 return at;
93 90
94 return 0; 91 return 0;
95} 92}
96 93
… …
277 return 0; 274 return 0;
278} 275}
279 276
280archetype::archetype (const char *name) 277archetype::archetype (const char *name)
281{ 278{
282 stub = true;
283 arch = this; 279 arch = this;
284 this->archname = this->name = this->name_pl = name; 280 this->archname = this->name = this->name_pl = name;
285} 281}
286 282
287archetype::~archetype () 283archetype::~archetype ()
… …
300 296
301void 297void
302archetype::unlink () 298archetype::unlink ()
303{ 299{
304 ht.erase (archname); 300 ht.erase (archname);
305 if (!strcmp (&archname, "Gaea")) fprintf (stderr, "oI\n");//D 301
306 if (archetypes.contains (this)) 302 if (archetypes.contains (this))
307 archetypes.erase (this); 303 archetypes.erase (this);
308} 304}
309 305
310/* 306/*
… …
324 else 320 else
325 return i->second; 321 return i->second;
326} 322}
327 323
328archetype * 324archetype *
329archetype::get (const char *name)
330{
331 if (!name)
332 {
333 LOG (llevError, "null archetype requested\n");
334 name = "(null)";
335 }
336
337 archetype *at = find (name);
338
339 if (!at)
340 {
341 at = new archetype (name);
342 at->link ();
343 }
344
345 return at;
346}
347
348archetype *
349archetype::read (object_thawer &f) 325archetype::read (object_thawer &f)
350{ 326{
351 assert (f.kw == KW_object); 327 assert (f.kw == KW_object);
352 328
353 loading_arch = true; // hack to tell parse_kv et al. to behave
354
355 std::vector<archetype *> parts; 329 std::vector<archetype *> parts;
356 330
357 coroapi::cede_to_tick_every (10); 331 coroapi::cede_to_tick ();
358 332
359 for (;;) 333 for (;;)
360 { 334 {
361 // the archetype might have been referenced earlier
362 // so try to find an existing stub archetype first
363 archetype *at = find (f.get_str ()); 335 archetype *at = new archetype (f.get_str ());
364
365 if (!at || !at->stub)
366 at = new archetype (f.get_str ());
367 336
368 f.next (); 337 f.next ();
369 338
370#if 0 339#if 0
371 // implementing it here in the server does neither allow multiple inheritence 340 // implementing it here in the server does neither allow multiple inheritence
… …
382 351
383 f.next (); 352 f.next ();
384 } 353 }
385#endif 354#endif
386 355
356 loading_arch = at; // hack to tell parse_kv et al. to behave
357 bool parse_ok = at->parse_kv (f);
358 loading_arch = 0;
359
387 if (!at->parse_kv (f)) 360 if (!parse_ok)
388 goto fail; 361 goto fail;
389 362
363 loading_arch = at; // hack to tell parse_kv et al. to behave
390 at->post_load_check (); 364 at->post_load_check ();
365 loading_arch = 0;
391 366
392 parts.push_back (at); 367 parts.push_back (at);
393 368
394 if (f.kw != KW_more) 369 if (f.kw != KW_more)
395 break; 370 break;
… …
400 { 375 {
401 f.parse_error ("more object"); 376 f.parse_error ("more object");
402 goto fail; 377 goto fail;
403 } 378 }
404 } 379 }
405
406 loading_arch = false;
407 380
408 { 381 {
409 auto (at, parts.begin ()); 382 auto (at, parts.begin ());
410 383
411 archetype *new_head = parts.front (); 384 archetype *new_head = parts.front ();
… …
430 &new_part->archname, &((archetype *)old_part->head_ ())->archname); 403 &new_part->archname, &((archetype *)old_part->head_ ())->archname);
431 goto fail; 404 goto fail;
432 } 405 }
433 } 406 }
434 407
435 // deactivate existing archetype
436 for (archetype *at = old_head; at; at = (archetype *)at->more)
437 at->unlink ();
438
439 // assemble new chain 408 // assemble new chain
440 new_head->min_x = new_head->max_x = new_head->x; 409 new_head->min_x = new_head->max_x = new_head->x;
441 new_head->min_y = new_head->max_y = new_head->y; 410 new_head->min_y = new_head->max_y = new_head->y;
442 411
443 archetype *less = new_head; 412 archetype *less = new_head;
444 for (auto (p, parts.begin () + 1); p != parts.end (); ++p) 413 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
445 { 414 {
446 archetype *at = *p; 415 archetype *at = *p;
447 416
417 // some flags get inherited formt he head (probably a lot more)
418 // doing it here doesn't feel too cozy, but it allows code
419 // to ignore head checks for these flags, which saves time
420 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
421 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
422 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
423 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
424
448 if (at->x < new_head->min_x) new_head->min_x = at->x; 425 if (at->x < new_head->min_x) new_head->min_x = at->x;
449 if (at->y < new_head->min_y) new_head->min_y = at->y; 426 if (at->y < new_head->min_y) new_head->min_y = at->y;
450 if (at->x > new_head->max_x) new_head->max_x = at->x; 427 if (at->x > new_head->max_x) new_head->max_x = at->x;
451 if (at->y > new_head->max_y) new_head->max_y = at->y; 428 if (at->y > new_head->max_y) new_head->max_y = at->y;
452 429
453 at->head = new_head; 430 at->head = new_head;
454 less->more = at; 431 less->more = at;
455 less = at; 432 less = at;
456 } 433 }
457 434
458 // now activate it 435 postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
459 for (auto (p, parts.begin ()); p != parts.end (); ++p)
460 {
461 archetype *at = *p;
462 at->stub = false;
463 at->link ();
464 }
465 436
466 return new_head; 437 return new_head;
467 } 438 }
468 439
469fail: 440fail:
470 for (auto (p, parts.begin ()); p != parts.end (); ++p) 441 for (auto (p, parts.begin ()); p != parts.end (); ++p)
471 (*p)->destroy (true); 442 (*p)->destroy (true);
472 443
473 loading_arch = false;
474 return 0; 444 return 0;
475} 445}
476 446
477/*
478 * Initialize global archtype pointers:
479 */
480void 447void
481init_archetype_pointers () 448archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
482{ 449{
483 ring_arch = archetype::find ("ring"); 450 ref = 0;
484 amulet_arch = archetype::find ("amulet"); 451 postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
485 staff_arch = archetype::find ("staff"); 452}
486 crown_arch = archetype::find ("crown"); 453
487 empty_archetype = archetype::find ("empty_archetype"); 454void
455archetype::commit_load ()
456{
457 // unlink old archetypes and link in new ones */
458 for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
459 {
460 archetype *at = *p;
461
462 if (archetype *old = find (at->archname))
463 old->unlink ();
464
465 at->link ();
466 }
467
468 postponed_arch.clear ();
469
470 // now resolve arch references
471 for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
472 {
473 arch_ptr *ap = p->first;
474 archetype *at = find (p->second);
475
476 if (!at)
477 LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
478
479 *ap = at;
480 }
481
482 postponed_arch_ref.clear ();
483
484 empty = find (shstr_empty_archetype);
488} 485}
489 486
490/* 487/*
491 * Creates and returns a new object which is a copy of the given archetype. 488 * Creates and returns a new object which is a copy of the given archetype.
492 * This function returns NULL on failure. 489 * This function returns NULL on failure.
… …
503 object *op = at->clone (); 500 object *op = at->clone ();
504 op->arch = at; 501 op->arch = at;
505 op->instantiate (); 502 op->instantiate ();
506 503
507 return op; 504 return op;
505}
506
507object *
508archetype::instance ()
509{
510 return arch_to_object (this);
508} 511}
509 512
510/* 513/*
511 * Creates an object. This function is called by get_archetype() 514 * Creates an object. This function is called by get_archetype()
512 * if it fails to find the appropriate archetype. 515 * if it fails to find the appropriate archetype.
… …
520 523
521 if (!strcmp (name, "bug")) 524 if (!strcmp (name, "bug"))
522 abort (); 525 abort ();
523 526
524 char buf[MAX_BUF]; 527 char buf[MAX_BUF];
525 sprintf (buf, "bug, please report (%s)", ARCH_SINGULARITY, name); 528 sprintf (buf, "bug, please report (%s)", name);
526 529
527 object *op = get_archetype ("bug"); 530 object *op = get_archetype ("bug");
528 op->name = op->name_pl = buf; 531 op->name = op->name_pl = buf;
529 532
530 return op; 533 return op;

Diff Legend

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