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.48 by root, Mon Apr 16 11:09:30 2007 UTC vs.
Revision 1.71 by root, Thu Nov 8 19:43:23 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) 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, 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 GNU General Public License
19 * along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The authors can be reached via e-mail at <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>
… …
37 * return an object. Perhaps those should be called 'archob' functions 36 * return an object. Perhaps those should be called 'archob' functions
38 * to denote they return an object derived from the archetype. 37 * to denote they return an object derived from the archetype.
39 * MSW 2003-04-29 38 * MSW 2003-04-29
40 */ 39 */
41 40
42bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing 41archetype *loading_arch; // ugly flag to object laoder etc. to suppress/request special processing
43 42
44// the hashtable 43// the hashtable
45typedef std::tr1::unordered_map 44typedef std::tr1::unordered_map
46 < 45 <
47 const char *, 46 const char *,
… …
50 str_equal, 49 str_equal,
51 slice_allocator< std::pair<const char *const, arch_ptr> > 50 slice_allocator< std::pair<const char *const, arch_ptr> >
52 > HT; 51 > HT;
53 52
54static HT ht (5000); 53static HT ht (5000);
55static std::vector<archetype *> archetypes; 54archvec archetypes;
56 55
57/** 56/**
58 * GROS - This function retrieves an archetype given the name that appears 57 * GROS - This function retrieves an archetype given the name that appears
59 * during the game (for example, "writing pen" instead of "stylus"). 58 * 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. 59 * It does not use the hashtable system, but browse the whole archlist each time.
… …
68archetype * 67archetype *
69find_archetype_by_object_name (const char *name) 68find_archetype_by_object_name (const char *name)
70{ 69{
71 shstr_cmp name_cmp (name); 70 shstr_cmp name_cmp (name);
72 71
73 for (archetype *at = first_archetype; at; at = at->next) 72 for_all_archetypes (at)
74 if (at->clone.name == name_cmp) 73 if (at->name == name_cmp)
75 return at; 74 return at;
76 75
77 return 0; 76 return 0;
78} 77}
79 78
… …
85archetype * 84archetype *
86find_archetype_by_object_type_name (int type, const char *name) 85find_archetype_by_object_type_name (int type, const char *name)
87{ 86{
88 shstr_cmp name_cmp (name); 87 shstr_cmp name_cmp (name);
89 88
90 for (archetype *at = first_archetype; at; at = at->next) 89 for_all_archetypes (at)
91 if (at->clone.name == name_cmp && at->clone.type == type) 90 if (at->name == name_cmp && at->type == type)
92 return at; 91 return at;
93 92
94 return 0; 93 return 0;
95} 94}
96 95
… …
102object * 101object *
103get_archetype_by_skill_name (const char *skill, int type) 102get_archetype_by_skill_name (const char *skill, int type)
104{ 103{
105 shstr_cmp skill_cmp (skill); 104 shstr_cmp skill_cmp (skill);
106 105
107 for (archetype *at = first_archetype; at; at = at->next) 106 for_all_archetypes (at)
108 if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.type)) 107 if (at->skill == skill_cmp && (type == -1 || type == at->type))
109 return arch_to_object (at); 108 return arch_to_object (at);
110 109
111 return 0; 110 return 0;
112} 111}
113 112
… …
119 * (eg, skills) 118 * (eg, skills)
120 */ 119 */
121archetype * 120archetype *
122get_archetype_by_type_subtype (int type, int subtype) 121get_archetype_by_type_subtype (int type, int subtype)
123{ 122{
124 for (archetype *at = first_archetype; at; at = at->next) 123 for_all_archetypes (at)
125 if ((type == -1 || type == at->clone.type) && (subtype == -1 || subtype == at->clone.subtype)) 124 if ((type == -1 || type == at->type) && (subtype == -1 || subtype == at->subtype))
126 return at; 125 return at;
127 126
128 return 0; 127 return 0;
129} 128}
130 129
… …
157 } 156 }
158 157
159 return create_singularity (name); 158 return create_singularity (name);
160} 159}
161 160
162 /* This is a subset of the parse_id command. Basically, name can be 161/* This is a subset of the parse_id command. Basically, name can be
163 * a string seperated lists of things to match, with certain keywords. 162 * a string seperated lists of things to match, with certain keywords.
164 * pl is the player (only needed to set count properly) 163 * pl is the player (only needed to set count properly)
165 * op is the item we are trying to match. Calling function takes care 164 * op is the item we are trying to match. Calling function takes care
166 * of what action might need to be done and if it is valid 165 * of what action might need to be done and if it is valid
167 * (pickup, drop, etc.) Return NONZERO if we have a match. A higher 166 * (pickup, drop, etc.) Return NONZERO if we have a match. A higher
168 * value means a better match. 0 means no match. 167 * value means a better match. 0 means no match.
169 * 168 *
170 * Brief outline of the procedure: 169 * Brief outline of the procedure:
171 * We take apart the name variable into the individual components. 170 * We take apart the name variable into the individual components.
172 * cases for 'all' and unpaid are pretty obvious. 171 * cases for 'all' and unpaid are pretty obvious.
173 * Next, we check for a count (either specified in name, or in the 172 * Next, we check for a count (either specified in name, or in the
174 * player object.) 173 * player object.)
175 * If count is 1, make a quick check on the name. 174 * If count is 1, make a quick check on the name.
176 * IF count is >1, we need to make plural name. Return if match. 175 * IF count is >1, we need to make plural name. Return if match.
177 * Last, make a check on the full name. 176 * Last, make a check on the full name.
178 */ 177 */
179int 178int
180item_matched_string (object *pl, object *op, const char *name) 179item_matched_string (object *pl, object *op, const char *name)
181{ 180{
182 char *cp, local_name[MAX_BUF]; 181 char *cp, local_name[MAX_BUF];
183 int count, retval = 0; 182 int count, retval = 0;
… …
275 } 274 }
276 275
277 return 0; 276 return 0;
278} 277}
279 278
280archetype::archetype () 279archetype::archetype (const char *name)
281{ 280{
281 stub = true;
282 clone.arch = this; 282 arch = this;
283 283 this->archname = this->name = this->name_pl = name;
284 CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
285 SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
286} 284}
287 285
288archetype::~archetype () 286archetype::~archetype ()
289{ 287{
290 //TODO: nuke ->more's 288 unlink ();
291} 289}
292 290
293static void
294unlink (archetype *at)
295{
296 if (at->head)
297 at = at->head;
298
299 // destroy this archetype's link, making singletons out of its parts
300 while (at)
301 {
302 archetype *more = at->more;
303 at->clone.destroy_inv ();
304 at->head = at->more = 0;
305 at = more;
306 }
307}
308
309// dire hack, need to rationalise
310void 291void
311overwrite (archetype *at, object *op) 292archetype::link ()
312{ 293{
313 at->clone = *op; 294 ht.insert (std::make_pair (archname, this));
314 295
315 at->clone.arch = at; 296 if (!archetypes.contains (this))
316 //TODO: inv et al. 297 archetypes.insert (this);
298}
299
300void
301archetype::unlink ()
302{
303 ht.erase (archname);
304
305 if (archetypes.contains (this))
306 archetypes.erase (this);
307}
308
309/*
310 * Finds, using the hashtable, which archetype matches the given name.
311 * returns a pointer to the found archetype, otherwise NULL.
312 */
313archetype *
314archetype::find (const char *name)
315{
316 if (!name)
317 return 0;
318
319 auto (i, ht.find (name));
320
321 if (i == ht.end ())
322 return 0;
323 else
324 return i->second;
325}
326
327archetype *
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;
317} 348}
318 349
319archetype * 350archetype *
320archetype::read (object_thawer &f) 351archetype::read (object_thawer &f)
321{ 352{
322 assert (f.kw == KW_object); 353 assert (f.kw == KW_object);
323 354
324 archetype *head = get (f.get_str ()); 355 std::vector<archetype *> parts;
325 unlink (head);
326 object *op = object::create ();
327 356
328 if (!op->parse_kv (f)) 357 coroapi::cede_to_tick_every (10);
329 { 358
330 op->destroy (true); 359 for (;;)
331 // leak head
332 return 0;
333 } 360 {
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 ());
334 364
335 overwrite (head, op); 365 if (!at || !at->stub)
336 op->destroy (); 366 at = new archetype (f.get_str ());
337 367
338 for (archetype *prev = head; f.kw == KW_more; )
339 {
340 f.next (); 368 f.next ();
341 assert (f.kw == KW_object);
342 369
343 archetype *more = get (f.get_str ()); 370#if 0
344 unlink (more); 371 // implementing it here in the server does neither allow multiple inheritence
345 object *op = object::create (); 372 // nor does it cleanly "just override". it would allow use in map files, though,
346 373 // and other resource files dynamically laoded (as opposed to being preprocessed).
347 if (!op->parse_kv (f)) 374 // not that any of this is relevant as of yet...
375 if (f.kw == KW_inherit)
348 { 376 {
349 op->destroy (true); 377 if (archetype *at = find (f.get_str ()))
350 // leak head more* 378 *op = at->clone;
351 return 0; 379 else
380 LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
381 &at->archname, f.get_str ());
382
383 f.next ();
352 } 384 }
385#endif
353 386
354 overwrite (more, op); 387 loading_arch = at; // hack to tell parse_kv et al. to behave
355 op->destroy (); 388 bool parse_ok = at->parse_kv (f);
389 loading_arch = 0;
356 390
357 if (more->clone.x > head->tail_x) head->tail_x = more->clone.x; 391 if (!parse_ok)
358 if (more->clone.y > head->tail_y) head->tail_y = more->clone.y; 392 goto fail;
359 393
360 more->head = head; 394 loading_arch = at; // hack to tell parse_kv et al. to behave
361 more->clone.head = &head->clone; 395 at->post_load_check ();
362 prev->more = more; 396 loading_arch = 0;
363 prev->clone.more = &more->clone;
364 397
365 prev = more; 398 parts.push_back (at);
366 }
367 399
368 if (!head->next) 400 if (f.kw != KW_more)
369 { 401 break;
370 head->next = first_archetype;
371 first_archetype = head;
372 }
373 402
374 return head; 403 f.next ();
375}
376 404
377/* 405 if (f.kw != KW_object)
378 * Reads/parses the archetype-file, and copies into a linked list
379 * of archetype-structures.
380 */
381static bool
382load_archetypes (object_thawer &f)
383{
384 for (;;)
385 {
386 switch (f.kw)
387 { 406 {
388 case KW_object: 407 f.parse_error ("more object");
389 loading_arch = true; 408 goto fail;
390 if (!archetype::read (f))
391 {
392 loading_arch = false;
393 return false;
394 }
395
396 loading_arch = false;
397 continue;
398
399 case KW_EOF:
400 return true;
401
402 default:
403 if (!f.parse_error ("archetypes file"))
404 return false;
405 } 409 }
410 }
406 411
407 f.next (); 412 {
413 auto (at, parts.begin ());
414
415 archetype *new_head = parts.front ();
416 archetype *old_head = find (new_head->archname);
417
418 if (old_head && !old_head->is_head ())
419 {
420 LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
421 &new_head->archname, &old_head->archname);
422 goto fail;
408 } 423 }
409}
410 424
411/* 425 // check that all archetypes belong to the same old object or are new
412 * First initialises the archtype hash-table (init_archetable()). 426 for (auto (at, parts.begin ()); at != parts.end (); ++at)
413 * Reads and parses the archetype file (with the first and second-pass 427 {
414 * functions). 428 archetype *new_part = *at;
415 */ 429 archetype *old_part = find (new_part->archname);
416bool
417load_archetype_file (const char *filename)
418{
419 object_thawer f (filename);
420 430
421 f.next (); 431 if (old_part && old_part->head_ () != old_head)
432 {
433 LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
434 &new_part->archname, &((archetype *)old_part->head_ ())->archname);
435 goto fail;
436 }
437 }
422 438
423 // make sure the next - long - step is only done after a tick 439 // deactivate existing archetype
424 coroapi::wait_for_tick_begin (); 440 for (archetype *at = old_head; at; at = (archetype *)at->more)
441 at->unlink ();
425 442
426 if (!load_archetypes (f)) 443 // assemble new chain
427 return false; 444 new_head->min_x = new_head->max_x = new_head->x;
445 new_head->min_y = new_head->max_y = new_head->y;
428 446
429 warn_archetypes = 1; 447 archetype *less = new_head;
448 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
449 {
450 archetype *at = *p;
430 451
452 // some flags get inherited formt he head (probably a lot more)
453 // doing it here doesn't feel too cozy, but it allows code
454 // to ignore head checks for these flags, which saves time
455 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
456 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
457 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
458 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
459
460 if (at->x < new_head->min_x) new_head->min_x = at->x;
461 if (at->y < new_head->min_y) new_head->min_y = at->y;
462 if (at->x > new_head->max_x) new_head->max_x = at->x;
463 if (at->y > new_head->max_y) new_head->max_y = at->y;
464
465 at->head = new_head;
466 less->more = at;
467 less = at;
468 }
469
470 // now activate it
471 for (auto (p, parts.begin ()); p != parts.end (); ++p)
472 {
473 archetype *at = *p;
474 at->stub = false;
475 at->link ();
476 }
477
478 return new_head;
479 }
480
481fail:
482 for (auto (p, parts.begin ()); p != parts.end (); ++p)
483 (*p)->destroy (true);
484
485 return 0;
486}
487
488/*
489 * Initialize global archtype pointers:
490 */
491void
492init_archetype_pointers ()
493{
494 ring_arch = archetype::find ("ring");
495 amulet_arch = archetype::find ("amulet");
496 staff_arch = archetype::find ("staff");
497 crown_arch = archetype::find ("crown");
431 empty_archetype = archetype::find ("empty_archetype"); 498 empty_archetype = archetype::find ("empty_archetype");
432 if (!empty_archetype)
433 return false;
434
435 coroapi::cede ();
436
437 return true;
438} 499}
439 500
440/* 501/*
441 * Creates and returns a new object which is a copy of the given archetype. 502 * Creates and returns a new object which is a copy of the given archetype.
442 * This function returns NULL on failure. 503 * This function returns NULL on failure.
… …
444object * 505object *
445arch_to_object (archetype *at) 506arch_to_object (archetype *at)
446{ 507{
447 if (!at) 508 if (!at)
448 { 509 {
449 if (warn_archetypes)
450 LOG (llevError, "Couldn't find archetype.\n"); 510 LOG (llevError, "Couldn't find archetype.\n");
451
452 return NULL; 511 return 0;
453 } 512 }
454 513
455 object *op = at->clone.clone (); 514 object *op = at->clone ();
456 op->arch = at; 515 op->arch = at;
457 op->instantiate (); 516 op->instantiate ();
517
458 return op; 518 return op;
519}
520
521object *
522archetype::instance ()
523{
524 return arch_to_object (this);
459} 525}
460 526
461/* 527/*
462 * Creates an object. This function is called by get_archetype() 528 * Creates an object. This function is called by get_archetype()
463 * if it fails to find the appropriate archetype. 529 * if it fails to find the appropriate archetype.
… …
465 * an object, and never NULL. 531 * an object, and never NULL.
466 */ 532 */
467object * 533object *
468create_singularity (const char *name) 534create_singularity (const char *name)
469{ 535{
470 object *op; 536 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
537
538 if (!strcmp (name, "bug"))
539 abort ();
540
471 char buf[MAX_BUF]; 541 char buf[MAX_BUF];
542 sprintf (buf, "bug, please report (%s)", name);
472 543
473 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); 544 object *op = get_archetype ("bug");
474 op = object::create ();
475 op->name = op->name_pl = buf; 545 op->name = op->name_pl = buf;
476 SET_FLAG (op, FLAG_NO_PICK); 546
477 return op; 547 return op;
478} 548}
479 549
480/* 550/*
481 * Finds which archetype matches the given name, and returns a new 551 * Finds which archetype matches the given name, and returns a new
… …
491 561
492 return arch_to_object (at); 562 return arch_to_object (at);
493} 563}
494 564
495/* 565/*
496 * Hash-function used by the arch-hashtable.
497 */
498
499unsigned long
500hasharch (const char *str, int tablesize)
501{
502 unsigned long hash = 0;
503 unsigned int i = 0;
504 const char *p;
505
506 /* use the one-at-a-time hash function, which supposedly is
507 * better than the djb2-like one used by perl5.005, but
508 * certainly is better then the bug used here before.
509 * see http://burtleburtle.net/bob/hash/doobs.html
510 */
511 for (p = str; i < MAXSTRING && *p; p++, i++)
512 {
513 hash += *p;
514 hash += hash << 10;
515 hash ^= hash >> 6;
516 }
517
518 hash += hash << 3;
519 hash ^= hash >> 11;
520 hash += hash << 15;
521
522 return hash % tablesize;
523}
524
525/*
526 * Finds, using the hashtable, which archetype matches the given name.
527 * returns a pointer to the found archetype, otherwise NULL.
528 */
529archetype *
530archetype::find (const char *name)
531{
532 if (!name)
533 return 0;
534
535 AUTODECL (i, ht.find (name));
536
537 if (i == ht.end ())
538 return 0;
539 else
540 return i->second;
541}
542
543archetype *
544archetype::get (const char *name)
545{
546 archetype *at = find (name);
547
548 if (!at)
549 {
550 archetypes.push_back (at = new archetype);
551 at->name = name;
552 at->hash_add ();
553 }
554
555 return at;
556}
557
558/*
559 * Adds an archetype to the hashtable.
560 */
561void
562archetype::hash_add ()
563{
564 ht.insert (std::make_pair (name, this));
565}
566
567void
568archetype::hash_del ()
569{
570 ht.erase (name);
571}
572
573/*
574 * Returns the first archetype using the given type. 566 * Returns the first archetype using the given type.
575 * Used in treasure-generation. 567 * Used in treasure-generation.
576 */ 568 */
577archetype * 569archetype *
578type_to_archetype (int type) 570type_to_archetype (int type)
579{ 571{
580 for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more) 572 for_all_archetypes (at)
581 if (at->clone.type == type) 573 if (at->type == type && at->head_ () != at)
582 return at; 574 return at;
583 575
584 return 0; 576 return 0;
585} 577}
586 578
… …
598 { 590 {
599 LOG (llevError, "Can't clone archetype %d\n", type); 591 LOG (llevError, "Can't clone archetype %d\n", type);
600 return 0; 592 return 0;
601 } 593 }
602 594
603 object *op = at->clone.clone (); 595 object *op = at->clone ();
604 op->instantiate (); 596 op->instantiate ();
605 return op; 597 return op;
606} 598}
607 599
608/* 600/*
609 * member: make instance from class 601 * member: make instance from class
610 */ 602 */
611
612object * 603object *
613object_create_arch (archetype *at) 604object_create_arch (archetype *at)
614{ 605{
615 object *op, *prev = 0, *head = 0; 606 object *op, *prev = 0, *head = 0;
616 607
617 while (at) 608 while (at)
618 { 609 {
619 op = arch_to_object (at); 610 op = arch_to_object (at);
611
620 op->x = at->clone.x; 612 op->x = at->x;
621 op->y = at->clone.y; 613 op->y = at->y;
622 614
623 if (head) 615 if (head)
624 op->head = head, prev->more = op; 616 op->head = head, prev->more = op;
625 617
626 if (!head) 618 if (!head)
627 head = op; 619 head = op;
628 620
629 prev = op; 621 prev = op;
630 at = at->more; 622 at = (archetype *)at->more;
631 } 623 }
632 624
633 return (head); 625 return head;
634} 626}
635 627

Diff Legend

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