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.70 by root, Tue Oct 16 00:30:24 2007 UTC vs.
Revision 1.92 by root, Thu Nov 5 15:43:21 2009 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 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 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your 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 GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 23 */
23 24
24#include <cassert> 25#include <cassert>
25 26
26#include <global.h> 27#include <global.h>
27#include <funcpoint.h>
28#include <loader.h> 28#include <loader.h>
29 29
30#include <tr1/functional> 30#include <tr1/functional>
31#include <tr1/unordered_map> 31#include <tr1/unordered_map>
32 32
33/* The naming of these functions is really poor - they are all
34 * pretty much named '.._arch_...', but they may more may not
35 * return archetypes. Some make the arch_to_object call, and thus
36 * return an object. Perhaps those should be called 'archob' functions
37 * to denote they return an object derived from the archetype.
38 * MSW 2003-04-29
39 */
40
41archetype *loading_arch; // ugly flag to object laoder etc. to suppress/request special processing 33archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
34arch_ptr archetype::empty;
42 35
43// the hashtable 36// the hashtable
44typedef std::tr1::unordered_map 37typedef std::tr1::unordered_map
45 < 38 <
46 const char *, 39 const char *,
… …
48 str_hash, 41 str_hash,
49 str_equal, 42 str_equal,
50 slice_allocator< std::pair<const char *const, arch_ptr> > 43 slice_allocator< std::pair<const char *const, arch_ptr> >
51 > HT; 44 > HT;
52 45
53static HT ht (5000); 46static HT ht (10000);
54archvec archetypes; 47archvec archetypes;
48static unordered_vector<archetype *> allarch;
49static int dirtycnt;
50
51// the vector of other_arch references to be resolved
52static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
53// the vector of loaded but not yet committed archetypes
54static std::vector<archetype *> postponed_arch;
55
56//+GPL
55 57
56/** 58/**
57 * GROS - This function retrieves an archetype given the name that appears 59 * GROS - This function retrieves an archetype given the name that appears
58 * during the game (for example, "writing pen" instead of "stylus"). 60 * 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. 61 * It does not use the hashtable system, but browse the whole archlist each time.
… …
103{ 105{
104 shstr_cmp skill_cmp (skill); 106 shstr_cmp skill_cmp (skill);
105 107
106 for_all_archetypes (at) 108 for_all_archetypes (at)
107 if (at->skill == skill_cmp && (type == -1 || type == at->type)) 109 if (at->skill == skill_cmp && (type == -1 || type == at->type))
108 return arch_to_object (at); 110 return at->instance ();
109 111
110 return 0; 112 return 0;
111} 113}
112 114
113/* similiar to above - this returns the first archetype 115/* similiar to above - this returns the first archetype
… …
134 * - name: The name we're searching for (ex: "writing pen"); 136 * - name: The name we're searching for (ex: "writing pen");
135 * Return value: 137 * Return value:
136 * - a corresponding object if found; a singularity object if not found. 138 * - a corresponding object if found; a singularity object if not found.
137 * Note by MSW - it appears that it takes the full name and keeps 139 * Note by MSW - it appears that it takes the full name and keeps
138 * shortening it until it finds a match. I re-wrote this so that it 140 * shortening it until it finds a match. I re-wrote this so that it
139 * doesn't malloc it each time - not that this function is used much, 141 * doesn't allocate it each time - not that this function is used much,
140 * but it otherwise had a big memory leak. 142 * but it otherwise had a big memory leak.
141 */ 143 */
142object * 144object *
143get_archetype_by_object_name (const char *name) 145get_archetype_by_object_name (const char *name)
144{ 146{
145 char tmpname[MAX_BUF]; 147 char tmpname[MAX_BUF];
146 int i;
147 148
148 assign (tmpname, name); 149 assign (tmpname, name);
149 150
150 for (i = strlen (tmpname); i > 0; i--) 151 for (int i = strlen (tmpname); i > 0; i--)
151 { 152 {
152 tmpname[i] = 0; 153 tmpname[i] = 0;
153 154
154 if (archetype *at = find_archetype_by_object_name (tmpname)) 155 if (archetype *at = find_archetype_by_object_name (tmpname))
155 return arch_to_object (at); 156 return at->instance ();
156 } 157 }
157 158
158 return create_singularity (name); 159 return create_singularity (name);
159} 160}
160 161
… …
194 return 1; 195 return 1;
195 196
196 /* unpaid is a little more specific */ 197 /* unpaid is a little more specific */
197 if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) 198 if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))
198 return 2; 199 return 2;
200
199 if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) 201 if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED)))
200 return 2; 202 return 2;
201 203
202 if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) 204 if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
203 return 2; 205 return 2;
… …
225 * is because of the 'else' handling - we don't want to match on 227 * 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 228 * 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 229 * later. So keep it in descending order here, so we try for the best
228 * match first, and work downward. 230 * match first, and work downward.
229 */ 231 */
232 const char *qbn0, *qbn1, *qsn; // query base name/short name caches
233
230 if (!strcasecmp (cp, query_name (op))) 234 if (!strcasecmp (cp, query_name (op)))
231 retval = 20; 235 retval = 20;
232 else if (!strcasecmp (cp, query_short_name (op))) 236 else if (!strcasecmp (cp, qsn = query_short_name (op)))
233 retval = 18; 237 retval = 18;
234 else if (!strcasecmp (cp, query_base_name (op, 0))) 238 else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
235 retval = 16; 239 retval = 16;
236 else if (!strcasecmp (cp, query_base_name (op, 1))) 240 else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
237 retval = 16; 241 retval = 16;
238 else if (op->custom_name && !strcasecmp (cp, op->custom_name)) 242 else if (op->custom_name && !strcasecmp (cp, op->custom_name))
239 retval = 15; 243 retval = 15;
240 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) 244 else if (!strncasecmp (cp, qbn0, strlen (cp)))
241 retval = 14; 245 retval = 14;
242 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) 246 else if (!strncasecmp (cp, qbn1, strlen (cp)))
243 retval = 14; 247 retval = 14;
244 /* Do substring checks, so things like 'Str+1' will match. 248 /* Do substring checks, so things like 'Str+1' will match.
245 * retval of these should perhaps be lower - they are lower 249 * retval of these should perhaps be lower - they are lower
246 * then the specific strcasecmp aboves, but still higher than 250 * then the specific strcasecmp aboves, but still higher than
247 * some other match criteria. 251 * some other match criteria.
248 */ 252 */
249 else if (strstr (query_base_name (op, 1), cp)) 253 else if (strstr (qbn1, cp))
250 retval = 12; 254 retval = 12;
251 else if (strstr (query_base_name (op, 0), cp)) 255 else if (strstr (qbn0, cp))
252 retval = 12; 256 retval = 12;
253 else if (strstr (query_short_name (op), cp)) 257 else if (strstr (qsn, cp))
254 retval = 12; 258 retval = 12;
255 /* Check against plural/non plural based on count. */ 259 /* Check against plural/non plural based on count. */
256 else if (count > 1 && !strcasecmp (cp, op->name_pl)) 260 else if (count > 1 && !strcasecmp (cp, op->name_pl))
257 retval = 6; 261 retval = 6;
258 else if (count == 1 && !strcasecmp (op->name, cp)) 262 else if (count == 1 && !strcasecmp (op->name, cp))
259 retval = 6; 263 retval = 6;
260 /* base name matched - not bad */ 264 /* base name matched - not bad */
261 else if (strcasecmp (cp, op->name) == 0 && !count) 265 else if (strcasecmp (cp, op->name) == 0 && !count)
262 retval = 4; 266 retval = 4;
263 /* Check for partial custom name, but give a real low priority */ 267 /* Check for partial custom name, but give a real low priority */
264 else if (op->custom_name && strstr (op->custom_name, cp)) 268 else if (op->custom_name.contains (cp))
265 retval = 3; 269 retval = 3;
266 270
267 if (retval) 271 if (retval)
268 { 272 {
269 if (pl->type == PLAYER) 273 if (pl->type == PLAYER)
… …
274 } 278 }
275 279
276 return 0; 280 return 0;
277} 281}
278 282
283//-GPL
284
279archetype::archetype (const char *name) 285archetype::archetype (const char *name)
280{ 286{
281 stub = true;
282 arch = this; 287 arch = this;
283 this->archname = this->name = this->name_pl = name; 288 this->archname = this->name = this->name_pl = name;
284} 289}
285 290
286archetype::~archetype () 291archetype::~archetype ()
… …
289} 294}
290 295
291void 296void
292archetype::link () 297archetype::link ()
293{ 298{
294 ht.insert (std::make_pair (archname, this));
295
296 if (!archetypes.contains (this)) 299 if (!archetypes.contains (this))
300 {
297 archetypes.insert (this); 301 archetypes.insert (this);
302 ht.insert (std::make_pair (archname, this));
303 }
298} 304}
299 305
300void 306void
301archetype::unlink () 307archetype::unlink ()
302{ 308{
303 ht.erase (archname);
304
305 if (archetypes.contains (this)) 309 if (archetypes.contains (this))
310 {
306 archetypes.erase (this); 311 archetypes.erase (this);
312 ht.erase (archname);
313 }
307} 314}
308 315
309/* 316/*
310 * Finds, using the hashtable, which archetype matches the given name. 317 * Finds, using the hashtable, which archetype matches the given name.
311 * returns a pointer to the found archetype, otherwise NULL. 318 * returns a pointer to the found archetype, otherwise NULL.
… …
323 else 330 else
324 return i->second; 331 return i->second;
325} 332}
326 333
327archetype * 334archetype *
328archetype::get (const char *name)
329{
330 if (!name)
331 {
332 LOG (llevError, "null archetype requested\n");
333 name = "(null)";
334 }
335
336 if (loading_arch && !strcmp (&loading_arch->archname, name))
337 return loading_arch;
338
339 archetype *at = find (name);
340
341 if (!at)
342 {
343 at = new archetype (name);
344 at->link ();
345 }
346
347 return at;
348}
349
350archetype *
351archetype::read (object_thawer &f) 335archetype::read (object_thawer &f)
352{ 336{
353 assert (f.kw == KW_object); 337 assert (f.kw == KW_object);
354 338
355 std::vector<archetype *> parts; 339 std::vector<archetype *> parts;
356 340
357 coroapi::cede_to_tick_every (10); 341 coroapi::cede_to_tick ();
358 342
359 for (;;) 343 for (;;)
360 { 344 {
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 ()); 345 archetype *at = new archetype (f.get_str ());
364
365 if (!at || !at->stub)
366 at = new archetype (f.get_str ());
367 346
368 f.next (); 347 f.next ();
369 348
370#if 0 349#if 0
371 // implementing it here in the server does neither allow multiple inheritence 350 // implementing it here in the server does neither allow multiple inheritence
… …
434 &new_part->archname, &((archetype *)old_part->head_ ())->archname); 413 &new_part->archname, &((archetype *)old_part->head_ ())->archname);
435 goto fail; 414 goto fail;
436 } 415 }
437 } 416 }
438 417
439 // deactivate existing archetype
440 for (archetype *at = old_head; at; at = (archetype *)at->more)
441 at->unlink ();
442
443 // assemble new chain 418 // assemble new chain
444 new_head->min_x = new_head->max_x = new_head->x; 419 new_head->min_x = new_head->max_x = new_head->x;
445 new_head->min_y = new_head->max_y = new_head->y; 420 new_head->min_y = new_head->max_y = new_head->y;
446 421
447 archetype *less = new_head; 422 archetype *less = new_head;
448 for (auto (p, parts.begin () + 1); p != parts.end (); ++p) 423 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
449 { 424 {
450 archetype *at = *p; 425 archetype *at = *p;
451 426
452 // some flags get inherited formt he head (probably a lot more) 427 // some flags get inherited from the head (probably a lot more)
453 // doing it here doesn't feel too cozy, but it allows code 428 // doing it here doesn't feel too cozy, but it allows code
454 // to ignore head checks for these flags, which saves time 429 // to ignore head checks for these flags, which saves time
455 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; 430 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
456 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; 431 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
457 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; 432 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
458 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; 433 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
459 434
460 if (at->x < new_head->min_x) new_head->min_x = at->x; 435 new_head->min_x = min (new_head->min_x, at->x);
461 if (at->y < new_head->min_y) new_head->min_y = at->y; 436 new_head->min_y = min (new_head->min_y, at->y);
462 if (at->x > new_head->max_x) new_head->max_x = at->x; 437 new_head->max_x = max (new_head->max_x, at->x);
463 if (at->y > new_head->max_y) new_head->max_y = at->y; 438 new_head->max_y = max (new_head->max_y, at->y);
464 439
465 at->head = new_head; 440 at->head = new_head;
466 less->more = at; 441 less->more = at;
467 less = at; 442 less = at;
468 } 443 }
469 444
470 // now activate it 445 postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
471 for (auto (p, parts.begin ()); p != parts.end (); ++p)
472 {
473 archetype *at = *p;
474 at->stub = false;
475 at->link ();
476 }
477 446
478 return new_head; 447 return new_head;
479 } 448 }
480 449
481fail: 450fail:
482 for (auto (p, parts.begin ()); p != parts.end (); ++p) 451 for (auto (p, parts.begin ()); p != parts.end (); ++p)
483 (*p)->destroy (true); 452 (*p)->destroy ();
484 453
485 return 0; 454 return 0;
486} 455}
487 456
488/*
489 * Initialize global archtype pointers:
490 */
491void 457void
492init_archetype_pointers () 458archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
493{ 459{
494 ring_arch = archetype::find ("ring"); 460 ref = 0;
495 amulet_arch = archetype::find ("amulet"); 461 postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
496 staff_arch = archetype::find ("staff");
497 crown_arch = archetype::find ("crown");
498 empty_archetype = archetype::find ("empty_archetype");
499} 462}
500 463
501/* 464void
502 * Creates and returns a new object which is a copy of the given archetype. 465archetype::commit_load ()
503 * This function returns NULL on failure.
504 */
505object *
506arch_to_object (archetype *at)
507{ 466{
467 // unlink old archetypes and link in new ones */
468 for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
469 {
470 archetype *at = *p;
471
472 if (archetype *old = find (at->archname))
473 old->unlink ();
474
475 allarch.push_back (at);
476
477 at->link ();
478 ++dirtycnt;
479 }
480
481 postponed_arch.clear ();
482
483 // now resolve arch references
484 for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
485 {
486 arch_ptr *ap = p->first;
487 archetype *at = find (p->second);
488
508 if (!at) 489 if (!at)
490 LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
491
492 *ap = at;
509 { 493 }
510 LOG (llevError, "Couldn't find archetype.\n"); 494
495 postponed_arch_ref.clear ();
496
497 empty = find (shstr_empty_archetype);
498}
499
500void
501archetype::gc ()
502{
503 int cnt = max (1, min (allarch.size () / 128, dirtycnt));
504 dirtycnt = max (0, dirtycnt - cnt);
505
506 do
507 {
508 static int idx;
509
510 if (idx >= allarch.size ())
511 if (idx)
512 idx = 0;
513 else
511 return 0; 514 return;
512 }
513 515
516 archetype *at = allarch [idx];
517
518 if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
519 ++idx;
520 else
521 {
522 LOG (llevDebug, "garbage collect arch %s", &at->archname);
523 assert (at->arch == at); // verify that refcnt == 1 is truly valid
524 allarch.erase (idx);
525
526 // break chain
527 for (object *op = at->head_ (); op; )
528 {
529 object *next = op->more;
530 op->head = 0;
531 op->more = 0;
532 op = next;
533 }
534
535 at->destroy ();
536 at->arch = 0;
537 }
538 }
539 while (--cnt);
540}
541
542object *
543archetype::instance ()
544{
514 object *op = at->clone (); 545 object *op = clone ();
515 op->arch = at;
516 op->instantiate (); 546 op->instantiate ();
517
518 return op; 547 return op;
519} 548}
520 549
521object * 550//+GPL
522archetype::instance ()
523{
524 return arch_to_object (this);
525}
526 551
527/* 552/*
528 * Creates an object. This function is called by get_archetype() 553 * Creates an object. This function is called by get_archetype()
529 * if it fails to find the appropriate archetype. 554 * if it fails to find the appropriate archetype.
530 * Thus get_archetype() will be guaranteed to always return 555 * Thus get_archetype() will be guaranteed to always return
… …
536 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); 561 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
537 562
538 if (!strcmp (name, "bug")) 563 if (!strcmp (name, "bug"))
539 abort (); 564 abort ();
540 565
541 char buf[MAX_BUF];
542 sprintf (buf, "bug, please report (%s)", name);
543
544 object *op = get_archetype ("bug"); 566 object *op = archetype::get (shstr_bug);
545 op->name = op->name_pl = buf; 567 op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name);
546 568
547 return op; 569 return op;
548} 570}
549 571
550/* 572/*
… …
552 * object containing a copy of the archetype. 574 * object containing a copy of the archetype.
553 */ 575 */
554object * 576object *
555get_archetype (const char *name) 577get_archetype (const char *name)
556{ 578{
579 return archetype::get (name);
580}
581
582object *
583archetype::get (const char *name)
584{
557 archetype *at = archetype::find (name); 585 archetype *at = find (name);
558 586
559 if (!at) 587 if (!at)
560 return create_singularity (name); 588 return create_singularity (name);
561 589
562 return arch_to_object (at); 590 return at->instance ();
563} 591}
564 592
565/* 593/*
566 * Returns the first archetype using the given type. 594 * Returns the first archetype using the given type.
567 * Used in treasure-generation. 595 * Used in treasure-generation.
… …
582 * Used in treasure-generation. 610 * Used in treasure-generation.
583 */ 611 */
584object * 612object *
585clone_arch (int type) 613clone_arch (int type)
586{ 614{
587 archetype *at; 615 archetype *at = type_to_archetype (type);
588 616
589 if ((at = type_to_archetype (type)) == NULL) 617 if (!at)
590 { 618 {
591 LOG (llevError, "Can't clone archetype %d\n", type); 619 LOG (llevError, "Can't clone archetype %d\n", type);
592 return 0; 620 return 0;
593 } 621 }
594 622
595 object *op = at->clone (); 623 return at->instance ();
596 op->instantiate ();
597 return op;
598} 624}
599 625
600/* 626/*
601 * member: make instance from class 627 * member: make instance from class
602 */ 628 */
… …
605{ 631{
606 object *op, *prev = 0, *head = 0; 632 object *op, *prev = 0, *head = 0;
607 633
608 while (at) 634 while (at)
609 { 635 {
610 op = arch_to_object (at); 636 op = at->instance ();
611 637
612 op->x = at->x; 638 op->x = at->x;
613 op->y = at->y; 639 op->y = at->y;
614 640
615 if (head) 641 if (head)
… …
623 } 649 }
624 650
625 return head; 651 return head;
626} 652}
627 653
654//-GPL
655

Diff Legend

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