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.49 by root, Mon Apr 16 12:37:08 2007 UTC vs.
Revision 1.62 by root, Mon Jun 4 12:19:08 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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 * Crossfire TRT is free software; you can redistribute it and/or modify it
9 * it under the terms of the GNU General Public License as published by 9 * under the terms of the GNU General Public License as published by the Free
10 * the Free Software Foundation; either version 2 of the License, or 10 * Software Foundation; either version 2 of the License, or (at your option)
11 * (at your option) any later version. 11 * 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, but
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 * GNU General Public License for more details. 16 * 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 along
19 * along with this program; if not, write to the Free Software 19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 * 21 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 23 */
24 24
25#include <cassert> 25#include <cassert>
26 26
27#include <global.h> 27#include <global.h>
… …
50 str_equal, 50 str_equal,
51 slice_allocator< std::pair<const char *const, arch_ptr> > 51 slice_allocator< std::pair<const char *const, arch_ptr> >
52 > HT; 52 > HT;
53 53
54static HT ht (5000); 54static HT ht (5000);
55static std::vector<archetype *> archetypes; 55archvec archetypes;
56 56
57/** 57/**
58 * GROS - This function retrieves an archetype given the name that appears 58 * GROS - This function retrieves an archetype given the name that appears
59 * during the game (for example, "writing pen" instead of "stylus"). 59 * 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. 60 * It does not use the hashtable system, but browse the whole archlist each time.
… …
309// dire hack, need to rationalise 309// dire hack, need to rationalise
310void 310void
311overwrite (archetype *at, object *op) 311overwrite (archetype *at, object *op)
312{ 312{
313 at->clone = *op; 313 at->clone = *op;
314
315 at->clone.arch = at; 314 at->clone.arch = at;
315
316 at->clone.inv = op->inv; op->inv = 0; 316 at->clone.inv = op->inv; op->inv = 0;
317 317
318 op->destroy (); 318 op->destroy ();
319} 319}
320 320
321bool 321archetype *
322archetype::load (object_thawer &f) 322archetype::read (object_thawer &f)
323{ 323{
324 assert (f.kw == KW_object); 324 assert (f.kw == KW_object);
325
326 loading_arch = true; // hack to tell parse_kv et al. to behave
325 327
326 typedef std::pair<archetype *, object *> part; 328 typedef std::pair<archetype *, object *> part;
327 std::vector<part> parts; 329 std::vector<part> parts;
328 330
331 coroapi::cede_to_tick_every (100);
332
329 for (;;) 333 for (;;)
330 { 334 {
335 object *op = object::create ();
331 archetype *at = get (f.get_str ()); 336 archetype *at = get (f.get_str ());
332 object *op = object::create (); 337 f.get (op->name);
338 f.next ();
339
340#if 0
341 if (f.kw == KW_inherit)
342 {
343 if (archetype *at = find (f.get_str ()))
344 *op = at->clone;
345 else
346 LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
347 &at->name, f.get_str ());
348
349 f.next ();
350 }
351#endif
333 352
334 if (!op->parse_kv (f)) 353 if (!op->parse_kv (f))
335 goto fail; 354 goto fail;
336 355
356 op->post_load_check ();
357
337 parts.push_back (std::make_pair (at, op)); 358 parts.push_back (std::make_pair (at, op));
338 359
339 if (f.kw != KW_more) 360 if (f.kw != KW_more)
340 break; 361 break;
341 362
342 f.next (); 363 f.next ();
364
343 assert (f.kw == KW_object); 365 if (f.kw != KW_object)
366 {
367 f.parse_error ("more object");
368 goto fail;
369 }
344 } 370 }
345 371
346 { 372 {
347 archetype *head = parts.front ().first; 373 archetype *head = parts.front ().first;
348 374
349 // check that all archetypes belong to the same object or are heads 375 // check that all archetypes belong to the same object or are heads
350 for (AUTODECL (p, parts.begin ()); p != parts.end (); ++p) 376 for (auto (p, parts.begin ()); p != parts.end (); ++p)
351 { 377 {
352 archetype *at = p->first; 378 archetype *at = p->first;
353 379
354 if (at->head != head && at->head) 380 if (at->head != head && at->head)
355 { 381 {
356 LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->name); 382 LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->archname);
357 goto fail; 383 goto fail;
358 } 384 }
359 385
360 if (at->next && at != head) 386 if (at->next && at != head)
361 { 387 {
362 LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->name); 388 LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->archname);
363 goto fail; 389 goto fail;
364 } 390 }
365 } 391 }
366 392
367 // sever chain of existing head object 393 // sever chain of existing head object
… …
377 overwrite (head, parts.front ().second); 403 overwrite (head, parts.front ().second);
378 head->tail_x = 0; 404 head->tail_x = 0;
379 head->tail_y = 0; 405 head->tail_y = 0;
380 406
381 // link into list of heads, if not already there 407 // link into list of heads, if not already there
382 if (!head->next) 408 if (!head->linked)
383 { 409 {
410 head->linked = true;
384 head->next = first_archetype; 411 head->next = first_archetype;
385 first_archetype = head; 412 first_archetype = head;
386 } 413 }
387 414
388 // reassemble new chain 415 // reassemble new chain
389 archetype *prev = head; 416 archetype *prev = head;
390 for (AUTODECL (p, parts.begin () + 1); p != parts.end (); ++p) 417 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
391 { 418 {
392 archetype *at = p->first; 419 archetype *at = p->first;
393 overwrite (at, p->second); 420 overwrite (at, p->second);
394 421
395 if (at->clone.x > head->tail_x) head->tail_x = at->clone.x; 422 if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
… …
400 prev->more = at; 427 prev->more = at;
401 prev->clone.more = &at->clone; 428 prev->clone.more = &at->clone;
402 429
403 prev = at; 430 prev = at;
404 } 431 }
432
433 loading_arch = false;
434 return head;
405 } 435 }
406 436
407 return true;
408
409fail: 437fail:
410 for (AUTODECL (p, parts.begin ()); p != parts.end (); ++p) 438 for (auto (p, parts.begin ()); p != parts.end (); ++p)
411 p->second->destroy (true); 439 p->second->destroy (true);
412 440
413 return false;
414}
415
416/*
417 * Reads/parses the archetype-file, and copies into a linked list
418 * of archetype-structures.
419 */
420static bool
421load_archetypes (object_thawer &f)
422{
423 for (;;)
424 {
425 switch (f.kw)
426 {
427 case KW_object:
428 loading_arch = true;
429 if (!archetype::load (f))
430 {
431 loading_arch = false;
432 return false;
433 }
434
435 loading_arch = false; 441 loading_arch = false;
436 continue; 442 return 0;
437
438 case KW_EOF:
439 return true;
440
441 default:
442 if (!f.parse_error ("archetypes file"))
443 return false;
444 }
445
446 f.next ();
447 }
448} 443}
449 444
450/* 445/*
451 * First initialises the archtype hash-table (init_archetable()). 446 * Initialize global archtype pointers:
452 * Reads and parses the archetype file (with the first and second-pass
453 * functions).
454 */ 447 */
455bool 448void
456load_archetype_file (const char *filename) 449init_archetype_pointers ()
457{ 450{
458 object_thawer f (filename); 451 ring_arch = archetype::find ("ring");
459 452 amulet_arch = archetype::find ("amulet");
460 f.next (); 453 staff_arch = archetype::find ("staff");
461 454 crown_arch = archetype::find ("crown");
462 // make sure the next - long - step is only done after a tick
463 coroapi::wait_for_tick_begin ();
464
465 if (!load_archetypes (f))
466 return false;
467
468 warn_archetypes = 1;
469
470 empty_archetype = archetype::find ("empty_archetype"); 455 empty_archetype = archetype::find ("empty_archetype");
471 if (!empty_archetype)
472 return false;
473
474 coroapi::cede ();
475
476 return true;
477} 456}
478 457
479/* 458/*
480 * Creates and returns a new object which is a copy of the given archetype. 459 * Creates and returns a new object which is a copy of the given archetype.
481 * This function returns NULL on failure. 460 * This function returns NULL on failure.
… …
483object * 462object *
484arch_to_object (archetype *at) 463arch_to_object (archetype *at)
485{ 464{
486 if (!at) 465 if (!at)
487 { 466 {
488 if (warn_archetypes)
489 LOG (llevError, "Couldn't find archetype.\n"); 467 LOG (llevError, "Couldn't find archetype.\n");
490
491 return NULL; 468 return 0;
492 } 469 }
493 470
494 object *op = at->clone.clone (); 471 object *op = at->clone.clone ();
495 op->arch = at; 472 op->arch = at;
496 op->instantiate (); 473 op->instantiate ();
474
497 return op; 475 return op;
498} 476}
499 477
500/* 478/*
501 * Creates an object. This function is called by get_archetype() 479 * Creates an object. This function is called by get_archetype()
… …
530 508
531 return arch_to_object (at); 509 return arch_to_object (at);
532} 510}
533 511
534/* 512/*
535 * Hash-function used by the arch-hashtable.
536 */
537
538unsigned long
539hasharch (const char *str, int tablesize)
540{
541 unsigned long hash = 0;
542 unsigned int i = 0;
543 const char *p;
544
545 /* use the one-at-a-time hash function, which supposedly is
546 * better than the djb2-like one used by perl5.005, but
547 * certainly is better then the bug used here before.
548 * see http://burtleburtle.net/bob/hash/doobs.html
549 */
550 for (p = str; i < MAXSTRING && *p; p++, i++)
551 {
552 hash += *p;
553 hash += hash << 10;
554 hash ^= hash >> 6;
555 }
556
557 hash += hash << 3;
558 hash ^= hash >> 11;
559 hash += hash << 15;
560
561 return hash % tablesize;
562}
563
564/*
565 * Finds, using the hashtable, which archetype matches the given name. 513 * Finds, using the hashtable, which archetype matches the given name.
566 * returns a pointer to the found archetype, otherwise NULL. 514 * returns a pointer to the found archetype, otherwise NULL.
567 */ 515 */
568archetype * 516archetype *
569archetype::find (const char *name) 517archetype::find (const char *name)
570{ 518{
571 if (!name) 519 if (!name)
572 return 0; 520 return 0;
573 521
574 AUTODECL (i, ht.find (name)); 522 auto (i, ht.find (name));
575 523
576 if (i == ht.end ()) 524 if (i == ht.end ())
577 return 0; 525 return 0;
578 else 526 else
579 return i->second; 527 return i->second;
580} 528}
581 529
582archetype * 530archetype *
583archetype::get (const char *name) 531archetype::get (const char *name)
584{ 532{
533 if (!name)
534 {
535 LOG (llevError, "null archetype requested\n");
536 name = "(null)";
537 }
538
585 archetype *at = find (name); 539 archetype *at = find (name);
586 540
587 if (!at) 541 if (!at)
588 { 542 {
589 archetypes.push_back (at = new archetype); 543 archetypes.insert (at = new archetype);
590 at->name = name; 544 at->archname = at->clone.name = at->clone.name_pl = name;
591 at->hash_add (); 545 at->hash_add ();
592 } 546 }
593 547
594 return at; 548 return at;
595} 549}
… …
598 * Adds an archetype to the hashtable. 552 * Adds an archetype to the hashtable.
599 */ 553 */
600void 554void
601archetype::hash_add () 555archetype::hash_add ()
602{ 556{
603 ht.insert (std::make_pair (name, this)); 557 ht.insert (std::make_pair (archname, this));
604} 558}
605 559
606void 560void
607archetype::hash_del () 561archetype::hash_del ()
608{ 562{
609 ht.erase (name); 563 ht.erase (archname);
610} 564}
611 565
612/* 566/*
613 * Returns the first archetype using the given type. 567 * Returns the first archetype using the given type.
614 * Used in treasure-generation. 568 * Used in treasure-generation.

Diff Legend

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