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.115 by root, Sat Nov 17 23:33:17 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 (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * 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 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.
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 Affero GNU General Public License 18 * 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 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>. 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * 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>
23 */ 23 */
24 24
25#include <cassert> 25#include <cassert>
26#include <functional>
27
28#include <flat_hash_map.hpp>
26 29
27#include <global.h> 30#include <global.h>
28#include <loader.h>
29
30#include <tr1/functional>
31#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
34arch_ptr archetype::empty; 33arch_ptr archetype::empty;
35 34
36// the hashtable 35// the hashtable
37typedef std::tr1::unordered_map 36typedef ska::flat_hash_map<
38 <
39 const char *, 37 const char *,
40 arch_ptr, 38 arch_ptr,
41 str_hash, 39 str_hash,
42 str_equal, 40 str_equal,
43 slice_allocator< std::pair<const char *const, arch_ptr> > 41 slice_allocator< std::pair<const char *const, arch_ptr> >
44 > HT; 42> HT;
45 43
46static HT ht (10000); 44static HT ht (10000);
47archvec archetypes; 45archvec archetypes;
48static unordered_vector<archetype *> allarch; 46static unordered_vector<archetype *> allarch;
49static int dirtycnt; 47static int dirtycnt;
50 48
51// the vector of other_arch references to be resolved 49// the vector of other_arch references to be resolved
52static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; 50static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
53// the vector of loaded but not yet committed archetypes 51// the vector of loaded but not yet committed archetypes
54static std::vector<archetype *> postponed_arch; 52static std::vector<archetype *> postponed_arch;
53
54//+GPL
55
56/*
57 * Creates an object. This function is called by archetype::get ()
58 * if it fails to find the appropriate archetype.
59 * Thus archetype::get() will be guaranteed to always return
60 * an object, and never NULL.
61 */
62static object *
63create_singularity (const char *name)
64{
65 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
66
67 if (!strcmp (name, "bug"))
68 abort ();
69
70 object *op = archetype::get (shstr_bug);
71 op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name);
72
73 return op;
74}
55 75
56/** 76/**
57 * GROS - This function retrieves an archetype given the name that appears 77 * GROS - This function retrieves an archetype given the name that appears
58 * during the game (for example, "writing pen" instead of "stylus"). 78 * 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. 79 * It does not use the hashtable system, but browse the whole archlist each time.
… …
141 */ 161 */
142object * 162object *
143get_archetype_by_object_name (const char *name) 163get_archetype_by_object_name (const char *name)
144{ 164{
145 char tmpname[MAX_BUF]; 165 char tmpname[MAX_BUF];
146 int i;
147 166
148 assign (tmpname, name); 167 assign (tmpname, name);
149 168
150 for (i = strlen (tmpname); i > 0; i--) 169 for (int i = strlen (tmpname); i > 0; i--)
151 { 170 {
152 tmpname[i] = 0; 171 tmpname[i] = 0;
153 172
154 if (archetype *at = find_archetype_by_object_name (tmpname)) 173 if (archetype *at = find_archetype_by_object_name (tmpname))
155 return at->instance (); 174 return at->instance ();
… …
192 /* All is a very generic match - low match value */ 211 /* All is a very generic match - low match value */
193 if (!strcmp (cp, "all")) 212 if (!strcmp (cp, "all"))
194 return 1; 213 return 1;
195 214
196 /* unpaid is a little more specific */ 215 /* unpaid is a little more specific */
197 if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) 216 if (!strcmp (cp, "unpaid") && op->flag [FLAG_UNPAID])
198 return 2; 217 return 2;
199 if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) 218
219 if (!strcmp (cp, "cursed") && op->flag [FLAG_KNOWN_CURSED] && (op->flag [FLAG_CURSED] || op->flag [FLAG_DAMNED]))
200 return 2; 220 return 2;
201 221
202 if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) 222 if (!strcmp (cp, "unlocked") && !op->flag [FLAG_INV_LOCKED])
203 return 2; 223 return 2;
204 224
205 /* Allow for things like '100 arrows' */ 225 /* Allow for things like '100 arrows' */
206 if ((count = atoi (cp)) != 0) 226 if ((count = atoi (cp)) != 0)
207 { 227 {
… …
225 * is because of the 'else' handling - we don't want to match on 245 * 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 246 * 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 247 * later. So keep it in descending order here, so we try for the best
228 * match first, and work downward. 248 * match first, and work downward.
229 */ 249 */
250 const char *qbn0, *qbn1, *qsn; // query base name/short name caches
251
230 if (!strcasecmp (cp, query_name (op))) 252 if (!strcasecmp (cp, query_name (op)))
231 retval = 20; 253 retval = 20;
232 else if (!strcasecmp (cp, query_short_name (op))) 254 else if (!strcasecmp (cp, qsn = query_short_name (op)))
233 retval = 18; 255 retval = 18;
234 else if (!strcasecmp (cp, query_base_name (op, 0))) 256 else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
235 retval = 16; 257 retval = 16;
236 else if (!strcasecmp (cp, query_base_name (op, 1))) 258 else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
237 retval = 16; 259 retval = 16;
238 else if (op->custom_name && !strcasecmp (cp, op->custom_name)) 260 else if (op->custom_name && !strcasecmp (cp, op->custom_name))
239 retval = 15; 261 retval = 15;
240 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) 262 else if (!strncasecmp (cp, qbn0, strlen (cp)))
241 retval = 14; 263 retval = 14;
242 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) 264 else if (!strncasecmp (cp, qbn1, strlen (cp)))
243 retval = 14; 265 retval = 14;
244 /* Do substring checks, so things like 'Str+1' will match. 266 /* Do substring checks, so things like 'Str+1' will match.
245 * retval of these should perhaps be lower - they are lower 267 * retval of these should perhaps be lower - they are lower
246 * then the specific strcasecmp aboves, but still higher than 268 * then the specific strcasecmp aboves, but still higher than
247 * some other match criteria. 269 * some other match criteria.
248 */ 270 */
249 else if (strstr (query_base_name (op, 1), cp)) 271 else if (strstr (qbn1, cp))
250 retval = 12; 272 retval = 12;
251 else if (strstr (query_base_name (op, 0), cp)) 273 else if (strstr (qbn0, cp))
252 retval = 12; 274 retval = 12;
253 else if (strstr (query_short_name (op), cp)) 275 else if (strstr (qsn, cp))
254 retval = 12; 276 retval = 12;
255 /* Check against plural/non plural based on count. */ 277 /* Check against plural/non plural based on count. */
256 else if (count > 1 && !strcasecmp (cp, op->name_pl)) 278 else if (count > 1 && !strcasecmp (cp, op->name_pl))
257 retval = 6; 279 retval = 6;
258 else if (count == 1 && !strcasecmp (op->name, cp)) 280 else if (count == 1 && !strcasecmp (op->name, cp))
… …
274 } 296 }
275 297
276 return 0; 298 return 0;
277} 299}
278 300
301//-GPL
302
303void
304archetype::do_delete ()
305{
306 delete this;
307}
308
279archetype::archetype (const char *name) 309archetype::archetype (const char *name)
280{ 310{
281 arch = this; 311 arch = this;
282 this->archname = this->name = this->name_pl = name; 312 this->archname = this->name = this->name_pl = name;
283} 313}
… …
323 return 0; 353 return 0;
324 else 354 else
325 return i->second; 355 return i->second;
326} 356}
327 357
358void
359archetype::post_load_check ()
360{
361 assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL]));
362
363 if (type == SKILL)
364 add_skill_archetype (this);
365
366 object::post_load_check ();
367}
368
328archetype * 369archetype *
329archetype::read (object_thawer &f) 370archetype::read (object_thawer &f)
330{ 371{
331 assert (f.kw == KW_object); 372 assert (f.kw == KW_object);
332 373
… …
341 f.next (); 382 f.next ();
342 383
343#if 0 384#if 0
344 // implementing it here in the server does neither allow multiple inheritence 385 // 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, 386 // 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). 387 // and other resource files dynamically loaded (as opposed to being preprocessed).
347 // not that any of this is relevant as of yet... 388 // not that any of this is relevant as of yet...
348 if (f.kw == KW_inherit) 389 if (f.kw == KW_inherit)
349 { 390 {
350 if (archetype *at = find (f.get_str ())) 391 if (archetype *at = find (f.get_str ()))
351 *op = at->clone; 392 *op = at->clone;
… …
408 goto fail; 449 goto fail;
409 } 450 }
410 } 451 }
411 452
412 // assemble new chain 453 // assemble new chain
413 new_head->min_x = new_head->max_x = new_head->x; 454 new_head->max_x = new_head->x;
414 new_head->min_y = new_head->max_y = new_head->y;
415 455
416 archetype *less = new_head; 456 archetype *less = new_head;
417 for (auto (p, parts.begin () + 1); p != parts.end (); ++p) 457 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
418 { 458 {
419 archetype *at = *p; 459 archetype *at = *p;
… …
424 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; 464 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
425 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; 465 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
426 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; 466 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
427 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; 467 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
428 468
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); 469 new_head->max_x = max (new_head->max_x, at->x);
432 new_head->max_y = max (new_head->max_y, at->y);
433 470
434 at->head = new_head; 471 at->head = new_head;
435 less->more = at; 472 less->more = at;
436 less = at; 473 less = at;
437 } 474 }
… …
492} 529}
493 530
494void 531void
495archetype::gc () 532archetype::gc ()
496{ 533{
497 int cnt = max (1, min (allarch.size () / 128, dirtycnt)); 534 int cnt = max (1, min<int> (allarch.size () / 128, dirtycnt));
498 dirtycnt = max (0, dirtycnt - cnt); 535 dirtycnt = max (0, dirtycnt - cnt);
499 536
500 do 537 do
501 { 538 {
502 static int idx; 539 static int idx;
… …
511 548
512 if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object 549 if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
513 ++idx; 550 ++idx;
514 else 551 else
515 { 552 {
516 LOG (llevDebug, "garbage collect arch %s", &at->archname); 553 //LOG (llevDebug, "garbage collect arch %s", &at->archname);
517 assert (at->arch == at); // verify that refcnt == 1 is truly valid 554 assert (at->arch == at); // verify that refcnt == 1 is truly valid
518 allarch.erase (idx); 555 allarch.erase (idx);
519 556
520 // break chain 557 // break chain
521 for (object *op = at->head_ (); op; ) 558 for (object *op = at->head_ (); op; )
… …
539 object *op = clone (); 576 object *op = clone ();
540 op->instantiate (); 577 op->instantiate ();
541 return op; 578 return op;
542} 579}
543 580
544/* 581//+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 582
564/* 583/*
565 * Finds which archetype matches the given name, and returns a new 584 * Finds which archetype matches the given name, and returns a new
566 * object containing a copy of the archetype. 585 * object containing a copy of the archetype.
567 */ 586 */
568object * 587object *
569get_archetype (const char *name)
570{
571 return archetype::get (name);
572}
573
574object *
575archetype::get (const char *name) 588archetype::get (const char *name)
576{ 589{
577 archetype *at = find (name); 590 archetype *at = find (name);
578 591
579 if (!at) 592 if (!at)
… …
584 597
585/* 598/*
586 * Returns the first archetype using the given type. 599 * Returns the first archetype using the given type.
587 * Used in treasure-generation. 600 * Used in treasure-generation.
588 */ 601 */
589archetype * 602static archetype *
590type_to_archetype (int type) 603type_to_archetype (int type)
591{ 604{
592 for_all_archetypes (at) 605 for_all_archetypes (at)
593 if (at->type == type && at->head_ () != at) 606 if (at->type == type && at->head_ () != at)
594 return at; 607 return at;
… …
641 } 654 }
642 655
643 return head; 656 return head;
644} 657}
645 658
659//-GPL
660

Diff Legend

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