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.73 by root, Sun Apr 20 00:44:12 2008 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,2008 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>
… …
29#include <loader.h> 28#include <loader.h>
30 29
31#include <tr1/functional> 30#include <tr1/functional>
32#include <tr1/unordered_map> 31#include <tr1/unordered_map>
33 32
34/* The naming of these functions is really poor - they are all
35 * pretty much named '.._arch_...', but they may more may not
36 * return archetypes. Some make the arch_to_object call, and thus
37 * return an object. Perhaps those should be called 'archob' functions
38 * to denote they return an object derived from the archetype.
39 * MSW 2003-04-29
40 */
41
42bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing 33archetype *loading_arch; // ugly flag to object laoder etc. to suppress/request special processing
34archetype *archetype::empty;
43 35
44// the hashtable 36// the hashtable
45typedef std::tr1::unordered_map 37typedef std::tr1::unordered_map
46 < 38 <
47 const char *, 39 const char *,
… …
50 str_equal, 42 str_equal,
51 slice_allocator< std::pair<const char *const, arch_ptr> > 43 slice_allocator< std::pair<const char *const, arch_ptr> >
52 > HT; 44 > HT;
53 45
54static HT ht (5000); 46static HT ht (5000);
47archvec archetypes;
48
49// the vector of other_arch references to be resolved
50static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
51// the vector of loaded but not yet committed archetypes
55static std::vector<archetype *> archetypes; 52static std::vector<archetype *> postponed_arch;
56 53
57/** 54/**
58 * GROS - This function retrieves an archetype given the name that appears 55 * GROS - This function retrieves an archetype given the name that appears
59 * during the game (for example, "writing pen" instead of "stylus"). 56 * 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. 57 * It does not use the hashtable system, but browse the whole archlist each time.
… …
68archetype * 65archetype *
69find_archetype_by_object_name (const char *name) 66find_archetype_by_object_name (const char *name)
70{ 67{
71 shstr_cmp name_cmp (name); 68 shstr_cmp name_cmp (name);
72 69
73 for (archetype *at = first_archetype; at; at = at->next) 70 for_all_archetypes (at)
74 if (at->clone.name == name_cmp) 71 if (at->name == name_cmp)
75 return at; 72 return at;
76 73
77 return 0; 74 return 0;
78} 75}
79 76
… …
85archetype * 82archetype *
86find_archetype_by_object_type_name (int type, const char *name) 83find_archetype_by_object_type_name (int type, const char *name)
87{ 84{
88 shstr_cmp name_cmp (name); 85 shstr_cmp name_cmp (name);
89 86
90 for (archetype *at = first_archetype; at; at = at->next) 87 for_all_archetypes (at)
91 if (at->clone.name == name_cmp && at->clone.type == type) 88 if (at->name == name_cmp && at->type == type)
92 return at; 89 return at;
93 90
94 return 0; 91 return 0;
95} 92}
96 93
… …
102object * 99object *
103get_archetype_by_skill_name (const char *skill, int type) 100get_archetype_by_skill_name (const char *skill, int type)
104{ 101{
105 shstr_cmp skill_cmp (skill); 102 shstr_cmp skill_cmp (skill);
106 103
107 for (archetype *at = first_archetype; at; at = at->next) 104 for_all_archetypes (at)
108 if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.type)) 105 if (at->skill == skill_cmp && (type == -1 || type == at->type))
109 return arch_to_object (at); 106 return arch_to_object (at);
110 107
111 return 0; 108 return 0;
112} 109}
113 110
… …
119 * (eg, skills) 116 * (eg, skills)
120 */ 117 */
121archetype * 118archetype *
122get_archetype_by_type_subtype (int type, int subtype) 119get_archetype_by_type_subtype (int type, int subtype)
123{ 120{
124 for (archetype *at = first_archetype; at; at = at->next) 121 for_all_archetypes (at)
125 if ((type == -1 || type == at->clone.type) && (subtype == -1 || subtype == at->clone.subtype)) 122 if ((type == -1 || type == at->type) && (subtype == -1 || subtype == at->subtype))
126 return at; 123 return at;
127 124
128 return 0; 125 return 0;
129} 126}
130 127
… …
157 } 154 }
158 155
159 return create_singularity (name); 156 return create_singularity (name);
160} 157}
161 158
162 /* This is a subset of the parse_id command. Basically, name can be 159/* 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. 160 * a string seperated lists of things to match, with certain keywords.
164 * pl is the player (only needed to set count properly) 161 * pl is the player (only needed to set count properly)
165 * op is the item we are trying to match. Calling function takes care 162 * 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 163 * 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 164 * (pickup, drop, etc.) Return NONZERO if we have a match. A higher
168 * value means a better match. 0 means no match. 165 * value means a better match. 0 means no match.
169 * 166 *
170 * Brief outline of the procedure: 167 * Brief outline of the procedure:
171 * We take apart the name variable into the individual components. 168 * We take apart the name variable into the individual components.
172 * cases for 'all' and unpaid are pretty obvious. 169 * cases for 'all' and unpaid are pretty obvious.
173 * Next, we check for a count (either specified in name, or in the 170 * Next, we check for a count (either specified in name, or in the
174 * player object.) 171 * player object.)
175 * If count is 1, make a quick check on the name. 172 * 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. 173 * IF count is >1, we need to make plural name. Return if match.
177 * Last, make a check on the full name. 174 * Last, make a check on the full name.
178 */ 175 */
179int 176int
180item_matched_string (object *pl, object *op, const char *name) 177item_matched_string (object *pl, object *op, const char *name)
181{ 178{
182 char *cp, local_name[MAX_BUF]; 179 char *cp, local_name[MAX_BUF];
183 int count, retval = 0; 180 int count, retval = 0;
… …
275 } 272 }
276 273
277 return 0; 274 return 0;
278} 275}
279 276
280archetype::archetype () 277archetype::archetype (const char *name)
281{ 278{
282 clone.arch = this; 279 arch = this;
283 280 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} 281}
287 282
288archetype::~archetype () 283archetype::~archetype ()
289{ 284{
290 //TODO: nuke ->more's 285 unlink ();
291} 286}
292 287
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 288void
311overwrite (archetype *at, object *op) 289archetype::link ()
312{ 290{
313 at->clone = *op; 291 ht.insert (std::make_pair (archname, this));
314 292
315 at->clone.arch = at; 293 if (!archetypes.contains (this))
316 //TODO: inv et al. 294 archetypes.insert (this);
295}
296
297void
298archetype::unlink ()
299{
300 ht.erase (archname);
301
302 if (archetypes.contains (this))
303 archetypes.erase (this);
304}
305
306/*
307 * Finds, using the hashtable, which archetype matches the given name.
308 * returns a pointer to the found archetype, otherwise NULL.
309 */
310archetype *
311archetype::find (const char *name)
312{
313 if (!name)
314 return 0;
315
316 auto (i, ht.find (name));
317
318 if (i == ht.end ())
319 return 0;
320 else
321 return i->second;
317} 322}
318 323
319archetype * 324archetype *
320archetype::read (object_thawer &f) 325archetype::read (object_thawer &f)
321{ 326{
322 assert (f.kw == KW_object); 327 assert (f.kw == KW_object);
323 328
324 archetype *head = get (f.get_str ()); 329 std::vector<archetype *> parts;
325 unlink (head);
326 object *op = object::create ();
327 330
328 if (!op->parse_kv (f)) 331 coroapi::cede_to_tick ();
329 { 332
330 op->destroy (true); 333 for (;;)
331 // leak head
332 return 0;
333 } 334 {
335 archetype *at = new archetype (f.get_str ());
334 336
335 overwrite (head, op);
336 op->destroy ();
337
338 for (archetype *prev = head; f.kw == KW_more; )
339 {
340 f.next (); 337 f.next ();
341 assert (f.kw == KW_object);
342 338
343 archetype *more = get (f.get_str ()); 339#if 0
344 unlink (more); 340 // implementing it here in the server does neither allow multiple inheritence
345 object *op = object::create (); 341 // nor does it cleanly "just override". it would allow use in map files, though,
346 342 // and other resource files dynamically laoded (as opposed to being preprocessed).
347 if (!op->parse_kv (f)) 343 // not that any of this is relevant as of yet...
344 if (f.kw == KW_inherit)
348 { 345 {
349 op->destroy (true); 346 if (archetype *at = find (f.get_str ()))
350 // leak head more* 347 *op = at->clone;
351 return 0; 348 else
349 LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
350 &at->archname, f.get_str ());
351
352 f.next ();
352 } 353 }
354#endif
353 355
354 overwrite (more, op); 356 loading_arch = at; // hack to tell parse_kv et al. to behave
355 op->destroy (); 357 bool parse_ok = at->parse_kv (f);
358 loading_arch = 0;
356 359
357 if (more->clone.x > head->tail_x) head->tail_x = more->clone.x; 360 if (!parse_ok)
358 if (more->clone.y > head->tail_y) head->tail_y = more->clone.y; 361 goto fail;
359 362
360 more->head = head; 363 loading_arch = at; // hack to tell parse_kv et al. to behave
361 more->clone.head = &head->clone; 364 at->post_load_check ();
362 prev->more = more; 365 loading_arch = 0;
363 prev->clone.more = &more->clone;
364 366
365 prev = more; 367 parts.push_back (at);
366 }
367 368
368 if (!head->next) 369 if (f.kw != KW_more)
369 { 370 break;
370 head->next = first_archetype;
371 first_archetype = head;
372 }
373 371
374 return head; 372 f.next ();
375}
376 373
377/* 374 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 { 375 {
388 case KW_object: 376 f.parse_error ("more object");
389 loading_arch = true; 377 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 } 378 }
379 }
406 380
407 f.next (); 381 {
382 auto (at, parts.begin ());
383
384 archetype *new_head = parts.front ();
385 archetype *old_head = find (new_head->archname);
386
387 if (old_head && !old_head->is_head ())
388 {
389 LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
390 &new_head->archname, &old_head->archname);
391 goto fail;
408 } 392 }
409}
410 393
411/* 394 // check that all archetypes belong to the same old object or are new
412 * First initialises the archtype hash-table (init_archetable()). 395 for (auto (at, parts.begin ()); at != parts.end (); ++at)
413 * Reads and parses the archetype file (with the first and second-pass 396 {
414 * functions). 397 archetype *new_part = *at;
415 */ 398 archetype *old_part = find (new_part->archname);
416bool
417load_archetype_file (const char *filename)
418{
419 object_thawer f (filename);
420 399
421 f.next (); 400 if (old_part && old_part->head_ () != old_head)
401 {
402 LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
403 &new_part->archname, &((archetype *)old_part->head_ ())->archname);
404 goto fail;
405 }
406 }
422 407
423 // make sure the next - long - step is only done after a tick 408 // assemble new chain
424 coroapi::wait_for_tick_begin (); 409 new_head->min_x = new_head->max_x = new_head->x;
410 new_head->min_y = new_head->max_y = new_head->y;
425 411
426 if (!load_archetypes (f)) 412 archetype *less = new_head;
427 return false; 413 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
414 {
415 archetype *at = *p;
428 416
429 warn_archetypes = 1; 417 // some flags get inherited formt he head (probably a lot more)
418 // doing it here doesn't feel too cozy, but it allows code
419 // to ignore head checks for these flags, which saves time
420 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
421 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
422 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
423 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
430 424
431 empty_archetype = archetype::find ("empty_archetype"); 425 if (at->x < new_head->min_x) new_head->min_x = at->x;
432 if (!empty_archetype) 426 if (at->y < new_head->min_y) new_head->min_y = at->y;
433 return false; 427 if (at->x > new_head->max_x) new_head->max_x = at->x;
428 if (at->y > new_head->max_y) new_head->max_y = at->y;
434 429
435 coroapi::cede (); 430 at->head = new_head;
431 less->more = at;
432 less = at;
433 }
436 434
435 postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
436
437 return new_head;
438 }
439
440fail:
441 for (auto (p, parts.begin ()); p != parts.end (); ++p)
442 (*p)->destroy (true);
443
437 return true; 444 return 0;
445}
446
447void
448archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
449{
450 ref = 0;
451 postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
452}
453
454void
455archetype::commit_load ()
456{
457 // unlink old archetypes and link in new ones */
458 for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
459 {
460 archetype *at = *p;
461
462 if (archetype *old = find (at->archname))
463 old->unlink ();
464
465 at->link ();
466 }
467
468 postponed_arch.clear ();
469
470 // now resolve arch references
471 for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
472 {
473 arch_ptr *ap = p->first;
474 archetype *at = find (p->second);
475
476 if (!at)
477 LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
478
479 *ap = at;
480 }
481
482 postponed_arch_ref.clear ();
483
484 empty = find (shstr_empty_archetype);
438} 485}
439 486
440/* 487/*
441 * Creates and returns a new object which is a copy of the given archetype. 488 * Creates and returns a new object which is a copy of the given archetype.
442 * This function returns NULL on failure. 489 * This function returns NULL on failure.
… …
444object * 491object *
445arch_to_object (archetype *at) 492arch_to_object (archetype *at)
446{ 493{
447 if (!at) 494 if (!at)
448 { 495 {
449 if (warn_archetypes)
450 LOG (llevError, "Couldn't find archetype.\n"); 496 LOG (llevError, "Couldn't find archetype.\n");
451
452 return NULL; 497 return 0;
453 } 498 }
454 499
455 object *op = at->clone.clone (); 500 object *op = at->clone ();
456 op->arch = at; 501 op->arch = at;
457 op->instantiate (); 502 op->instantiate ();
503
458 return op; 504 return op;
505}
506
507object *
508archetype::instance ()
509{
510 return arch_to_object (this);
459} 511}
460 512
461/* 513/*
462 * Creates an object. This function is called by get_archetype() 514 * Creates an object. This function is called by get_archetype()
463 * if it fails to find the appropriate archetype. 515 * if it fails to find the appropriate archetype.
… …
465 * an object, and never NULL. 517 * an object, and never NULL.
466 */ 518 */
467object * 519object *
468create_singularity (const char *name) 520create_singularity (const char *name)
469{ 521{
470 object *op; 522 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
523
524 if (!strcmp (name, "bug"))
525 abort ();
526
471 char buf[MAX_BUF]; 527 char buf[MAX_BUF];
528 sprintf (buf, "bug, please report (%s)", name);
472 529
473 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); 530 object *op = get_archetype ("bug");
474 op = object::create ();
475 op->name = op->name_pl = buf; 531 op->name = op->name_pl = buf;
476 SET_FLAG (op, FLAG_NO_PICK); 532
477 return op; 533 return op;
478} 534}
479 535
480/* 536/*
481 * Finds which archetype matches the given name, and returns a new 537 * Finds which archetype matches the given name, and returns a new
… …
491 547
492 return arch_to_object (at); 548 return arch_to_object (at);
493} 549}
494 550
495/* 551/*
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. 552 * Returns the first archetype using the given type.
575 * Used in treasure-generation. 553 * Used in treasure-generation.
576 */ 554 */
577archetype * 555archetype *
578type_to_archetype (int type) 556type_to_archetype (int type)
579{ 557{
580 for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more) 558 for_all_archetypes (at)
581 if (at->clone.type == type) 559 if (at->type == type && at->head_ () != at)
582 return at; 560 return at;
583 561
584 return 0; 562 return 0;
585} 563}
586 564
… …
598 { 576 {
599 LOG (llevError, "Can't clone archetype %d\n", type); 577 LOG (llevError, "Can't clone archetype %d\n", type);
600 return 0; 578 return 0;
601 } 579 }
602 580
603 object *op = at->clone.clone (); 581 object *op = at->clone ();
604 op->instantiate (); 582 op->instantiate ();
605 return op; 583 return op;
606} 584}
607 585
608/* 586/*
609 * member: make instance from class 587 * member: make instance from class
610 */ 588 */
611
612object * 589object *
613object_create_arch (archetype *at) 590object_create_arch (archetype *at)
614{ 591{
615 object *op, *prev = 0, *head = 0; 592 object *op, *prev = 0, *head = 0;
616 593
617 while (at) 594 while (at)
618 { 595 {
619 op = arch_to_object (at); 596 op = arch_to_object (at);
597
620 op->x = at->clone.x; 598 op->x = at->x;
621 op->y = at->clone.y; 599 op->y = at->y;
622 600
623 if (head) 601 if (head)
624 op->head = head, prev->more = op; 602 op->head = head, prev->more = op;
625 603
626 if (!head) 604 if (!head)
627 head = op; 605 head = op;
628 606
629 prev = op; 607 prev = op;
630 at = at->more; 608 at = (archetype *)at->more;
631 } 609 }
632 610
633 return (head); 611 return head;
634} 612}
635 613

Diff Legend

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