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.91 by root, Tue Oct 27 01:38:39 2009 UTC vs.
Revision 1.117 by root, Sun Nov 18 00:37:11 2018 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 (©) 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 it under 9 * 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 10 * 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 11 * Free Software Foundation, either version 3 of the License, or (at your
11 * 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 Affero GNU General Public License 19 * You should have received a copy of the Affero GNU General Public License
19 * and the GNU General Public License along with this program. If not, see 20 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>. 21 * <http://www.gnu.org/licenses/>.
21 * 22 *
22 * 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>
23 */ 24 */
24 25
25#include <cassert> 26#include <cassert>
27#include <functional>
28
29#include <flat_hash_map.hpp>
26 30
27#include <global.h> 31#include <global.h>
28#include <loader.h>
29
30#include <tr1/functional>
31#include <tr1/unordered_map>
32 32
33archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing 33archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
34arch_ptr archetype::empty; 34arch_ptr archetype::empty;
35 35
36// the hashtable 36// the hashtable
37typedef std::tr1::unordered_map 37typedef ska::flat_hash_map<
38 <
39 const char *, 38 const char *,
40 arch_ptr, 39 arch_ptr,
41 str_hash, 40 str_hash,
42 str_equal, 41 str_equal,
43 slice_allocator< std::pair<const char *const, arch_ptr> > 42 slice_allocator< std::pair<const char *const, arch_ptr> >
44 > HT; 43> HT;
45 44
46static HT ht (10000); 45static HT ht (10000);
47archvec archetypes; 46archvec archetypes;
48static unordered_vector<archetype *> allarch; 47static unordered_vector<archetype *> allarch;
49static int dirtycnt; 48static int dirtycnt;
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 archetype::get ()
59 * if it fails to find the appropriate archetype.
60 * Thus archetype::get() 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.
… …
191 /* All is a very generic match - low match value */ 212 /* All is a very generic match - low match value */
192 if (!strcmp (cp, "all")) 213 if (!strcmp (cp, "all"))
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") && op->flag [FLAG_UNPAID])
197 return 2; 218 return 2;
198 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") && 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 {
… …
276 } 297 }
277 298
278 return 0; 299 return 0;
279} 300}
280 301
302//-GPL
303
304void
305archetype::do_delete ()
306{
307 delete this;
308}
309
281archetype::archetype (const char *name) 310archetype::archetype (const char *name)
282{ 311{
283 arch = this; 312 arch = this;
284 this->archname = this->name = this->name_pl = name; 313 this->archname = this->name = this->name_pl = name;
285} 314}
… …
325 return 0; 354 return 0;
326 else 355 else
327 return i->second; 356 return i->second;
328} 357}
329 358
359void
360archetype::post_load_check ()
361{
362 assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL]));
363
364 if (type == SKILL)
365 add_skill_archetype (this);
366
367 object::post_load_check ();
368}
369
330archetype * 370archetype *
331archetype::read (object_thawer &f) 371archetype::read (object_thawer &f)
332{ 372{
333 assert (f.kw == KW_object); 373 assert (f.kw == KW_object);
334 374
… …
343 f.next (); 383 f.next ();
344 384
345#if 0 385#if 0
346 // implementing it here in the server does neither allow multiple inheritence 386 // implementing it here in the server does neither allow multiple inheritence
347 // nor does it cleanly "just override". it would allow use in map files, though, 387 // nor does it cleanly "just override". it would allow use in map files, though,
348 // and other resource files dynamically laoded (as opposed to being preprocessed). 388 // and other resource files dynamically loaded (as opposed to being preprocessed).
349 // not that any of this is relevant as of yet... 389 // not that any of this is relevant as of yet...
350 if (f.kw == KW_inherit) 390 if (f.kw == KW_inherit)
351 { 391 {
352 if (archetype *at = find (f.get_str ())) 392 if (archetype *at = find (f.get_str ()))
353 *op = at->clone; 393 *op = at->clone;
… …
383 goto fail; 423 goto fail;
384 } 424 }
385 } 425 }
386 426
387 { 427 {
388 auto (at, parts.begin ());
389
390 archetype *new_head = parts.front (); 428 archetype *new_head = parts.front ();
391 archetype *old_head = find (new_head->archname); 429 archetype *old_head = find (new_head->archname);
392 430
393 if (old_head && !old_head->is_head ()) 431 if (old_head && !old_head->is_head ())
394 { 432 {
… …
396 &new_head->archname, &old_head->archname); 434 &new_head->archname, &old_head->archname);
397 goto fail; 435 goto fail;
398 } 436 }
399 437
400 // check that all archetypes belong to the same old object or are new 438 // check that all archetypes belong to the same old object or are new
401 for (auto (at, parts.begin ()); at != parts.end (); ++at) 439 for (auto &&at : parts)
402 { 440 {
403 archetype *new_part = *at; 441 archetype *new_part = at;
404 archetype *old_part = find (new_part->archname); 442 archetype *old_part = find (new_part->archname);
405 443
406 if (old_part && old_part->head_ () != old_head) 444 if (old_part && old_part->head_ () != old_head)
407 { 445 {
408 LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n", 446 LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
… …
410 goto fail; 448 goto fail;
411 } 449 }
412 } 450 }
413 451
414 // assemble new chain 452 // assemble new chain
415 new_head->min_x = new_head->max_x = new_head->x; 453 new_head->max_x = new_head->x;
416 new_head->min_y = new_head->max_y = new_head->y;
417 454
418 archetype *less = new_head; 455 archetype *less = new_head;
419 for (auto (p, parts.begin () + 1); p != parts.end (); ++p) 456 for (auto &&p = parts.begin () + 1; p != parts.end (); ++p)
420 { 457 {
421 archetype *at = *p; 458 archetype *at = *p;
422 459
423 // some flags get inherited from the head (probably a lot more) 460 // some flags get inherited from the head (probably a lot more)
424 // doing it here doesn't feel too cozy, but it allows code 461 // doing it here doesn't feel too cozy, but it allows code
… …
426 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; 463 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
427 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; 464 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
428 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; 465 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
429 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; 466 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
430 467
431 new_head->min_x = min (new_head->min_x, at->x);
432 new_head->min_y = min (new_head->min_y, at->y);
433 new_head->max_x = max (new_head->max_x, at->x); 468 new_head->max_x = max (new_head->max_x, at->x);
434 new_head->max_y = max (new_head->max_y, at->y);
435 469
436 at->head = new_head; 470 at->head = new_head;
437 less->more = at; 471 less->more = at;
438 less = at; 472 less = at;
439 } 473 }
… …
442 476
443 return new_head; 477 return new_head;
444 } 478 }
445 479
446fail: 480fail:
447 for (auto (p, parts.begin ()); p != parts.end (); ++p) 481 for (auto &&at : parts)
448 (*p)->destroy (); 482 at->destroy ();
449 483
450 return 0; 484 return 0;
451} 485}
452 486
453void 487void
… …
459 493
460void 494void
461archetype::commit_load () 495archetype::commit_load ()
462{ 496{
463 // unlink old archetypes and link in new ones */ 497 // unlink old archetypes and link in new ones */
464 for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p) 498 for (auto &&at : postponed_arch)
465 { 499 {
466 archetype *at = *p;
467
468 if (archetype *old = find (at->archname)) 500 if (archetype *old = find (at->archname))
469 old->unlink (); 501 old->unlink ();
470 502
471 allarch.push_back (at); 503 allarch.push_back (at);
472 504
… …
475 } 507 }
476 508
477 postponed_arch.clear (); 509 postponed_arch.clear ();
478 510
479 // now resolve arch references 511 // now resolve arch references
480 for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p) 512 for (auto &&p : postponed_arch_ref) // not yet C++17
481 { 513 {
482 arch_ptr *ap = p->first; 514 arch_ptr *ap = p.first;
483 archetype *at = find (p->second); 515 archetype *at = find (p.second);
484 516
485 if (!at) 517 if (!at)
486 LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second); 518 LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p.second);
487 519
488 *ap = at; 520 *ap = at;
489 } 521 }
490 522
491 postponed_arch_ref.clear (); 523 postponed_arch_ref.clear ();
… …
494} 526}
495 527
496void 528void
497archetype::gc () 529archetype::gc ()
498{ 530{
499 int cnt = max (1, min (allarch.size () / 128, dirtycnt)); 531 int cnt = max (1, min<int> (allarch.size () / 128, dirtycnt));
500 dirtycnt = max (0, dirtycnt - cnt); 532 dirtycnt = max (0, dirtycnt - cnt);
501 533
502 do 534 do
503 { 535 {
504 static int idx; 536 static int idx;
… …
513 545
514 if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object 546 if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
515 ++idx; 547 ++idx;
516 else 548 else
517 { 549 {
518 LOG (llevDebug, "garbage collect arch %s", &at->archname); 550 //LOG (llevDebug, "garbage collect arch %s", &at->archname);
519 assert (at->arch == at); // verify that refcnt == 1 is truly valid 551 assert (at->arch == at); // verify that refcnt == 1 is truly valid
520 allarch.erase (idx); 552 allarch.erase (idx);
521 553
522 // break chain 554 // break chain
523 for (object *op = at->head_ (); op; ) 555 for (object *op = at->head_ (); op; )
… …
541 object *op = clone (); 573 object *op = clone ();
542 op->instantiate (); 574 op->instantiate ();
543 return op; 575 return op;
544} 576}
545 577
546/* 578//+GPL
547 * Creates an object. This function is called by get_archetype()
548 * if it fails to find the appropriate archetype.
549 * Thus get_archetype() will be guaranteed to always return
550 * an object, and never NULL.
551 */
552object *
553create_singularity (const char *name)
554{
555 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
556
557 if (!strcmp (name, "bug"))
558 abort ();
559
560 object *op = archetype::get (shstr_bug);
561 op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name);
562
563 return op;
564}
565 579
566/* 580/*
567 * Finds which archetype matches the given name, and returns a new 581 * Finds which archetype matches the given name, and returns a new
568 * object containing a copy of the archetype. 582 * object containing a copy of the archetype.
569 */ 583 */
570object * 584object *
571get_archetype (const char *name)
572{
573 return archetype::get (name);
574}
575
576object *
577archetype::get (const char *name) 585archetype::get (const char *name)
578{ 586{
579 archetype *at = find (name); 587 archetype *at = find (name);
580 588
581 if (!at) 589 if (!at)
… …
586 594
587/* 595/*
588 * Returns the first archetype using the given type. 596 * Returns the first archetype using the given type.
589 * Used in treasure-generation. 597 * Used in treasure-generation.
590 */ 598 */
591archetype * 599static archetype *
592type_to_archetype (int type) 600type_to_archetype (int type)
593{ 601{
594 for_all_archetypes (at) 602 for_all_archetypes (at)
595 if (at->type == type && at->head_ () != at) 603 if (at->type == type && at->head_ () != at)
596 return at; 604 return at;
… …
643 } 651 }
644 652
645 return head; 653 return head;
646} 654}
647 655
656//-GPL
657

Diff Legend

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