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.43 by root, Fri Feb 16 19:43:40 2007 UTC vs.
Revision 1.47 by root, Mon Apr 16 10:14:25 2007 UTC

… …
29#include <loader.h> 29#include <loader.h>
30 30
31#include <tr1/functional> 31#include <tr1/functional>
32#include <tr1/unordered_map> 32#include <tr1/unordered_map>
33 33
34int arch_init; /* True if doing arch initialization */
35
36/* The naming of these functions is really poor - they are all 34/* The naming of these functions is really poor - they are all
37 * pretty much named '.._arch_...', but they may more may not 35 * pretty much named '.._arch_...', but they may more may not
38 * return archetypes. Some make the arch_to_object call, and thus 36 * return archetypes. Some make the arch_to_object call, and thus
39 * return an object. Perhaps those should be called 'archob' functions 37 * return an object. Perhaps those should be called 'archob' functions
40 * to denote they return an object derived from the archetype. 38 * to denote they return an object derived from the archetype.
41 * MSW 2003-04-29 39 * MSW 2003-04-29
42 */ 40 */
41
42bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing
43 43
44// the hashtable 44// the hashtable
45typedef std::tr1::unordered_map 45typedef std::tr1::unordered_map
46 < 46 <
47 const char *, 47 const char *,
… …
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;
55 56
56/** 57/**
57 * GROS - This function retrieves an archetype given the name that appears 58 * GROS - This function retrieves an archetype given the name that appears
58 * during the game (for example, "writing pen" instead of "stylus"). 59 * 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. 60 * It does not use the hashtable system, but browse the whole archlist each time.
… …
274 } 275 }
275 276
276 return 0; 277 return 0;
277} 278}
278 279
279/*
280 * Initialises the internal linked list of archetypes (read from file).
281 * Then the global "empty_archetype" pointer is initialised.
282 * Then the blocksview[] array is initialised.
283 */
284
285void 280void
286init_archetypes (void) 281init_archetypes (void)
287{ /* called from add_player() and edit() */ 282{
288 if (first_archetype != NULL) /* Only do this once */
289 return;
290
291 arch_init = 1;
292 load_archetypes (); 283 load_archetypes ();
293 arch_init = 0; 284
294 empty_archetype = archetype::find ("empty_archetype"); 285 empty_archetype = archetype::find ("empty_archetype");
295
296/* init_blocksview();*/
297}
298
299/*
300 * An alternative way to init the hashtable which is slower, but _works_...
301 */
302void
303init_archetable (void)
304{
305 LOG (llevDebug, " Setting up archetable...\n");
306
307 for (archetype *at = first_archetype; at; at = at->next)
308 for (archetype *bt = at; bt; bt = bt->more)
309 bt->hash_add ();
310
311 LOG (llevDebug, "done\n");
312}
313
314void
315free_all_archs (void)
316{
317 archetype *at, *next;
318 int i = 0, f = 0;
319
320 for (at = first_archetype; at; at = next)
321 {
322 if (at->more)
323 next = at->more;
324 else
325 next = at->next;
326
327 delete
328 at;
329
330 i++;
331 }
332
333 LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
334} 286}
335 287
336archetype::archetype () 288archetype::archetype ()
337{ 289{
338 clone.arch = this; 290 clone.arch = this;
… …
344archetype::~archetype () 296archetype::~archetype ()
345{ 297{
346 //TODO: nuke ->more's 298 //TODO: nuke ->more's
347} 299}
348 300
301static void
302unlink (archetype *at)
303{
304 if (at->head)
305 at = at->head;
306
307 // destroy this archetype's link, making singletons out of its parts
308 while (at)
309 {
310 archetype *more = at->more;
311 at->clone.destroy_inv ();
312 at->head = at->more = 0;
313 at = more;
314 }
315}
316
317// dire hack, need to rationalise
318void
319overwrite (archetype *at, object *op)
320{
321 at->clone = *op;
322
323 at->clone.arch = at;
324 //TODO: inv et al.
325}
326
349archetype * 327archetype *
350archetype::read (object_thawer &f) 328archetype::read (object_thawer &f)
351{ 329{
352 assert (f.kw == KW_object); 330 assert (f.kw == KW_object);
353 331
354 archetype *head = new archetype; 332 archetype *head = get (f.get_str ());
355 f.get (head->name); 333 unlink (head);
334 object *op = object::create ();
356 335
357 if (!head->clone.parse_kv (f)) 336 if (!op->parse_kv (f))
358 { 337 {
359 delete head; 338 op->destroy (true);
339 // leak head
360 return 0; 340 return 0;
361 } 341 }
362 342
343 overwrite (head, op);
344 op->destroy ();
345
363 for (archetype *prev = head; f.kw == KW_more; ) 346 for (archetype *prev = head; f.kw == KW_more; )
364 { 347 {
365 f.next (); 348 f.next ();
366
367 assert (f.kw == KW_object); 349 assert (f.kw == KW_object);
368 350
369 archetype *more = new archetype; 351 archetype *more = get (f.get_str ());
370 f.get (more->name); 352 unlink (more);
353 object *op = object::create ();
371 354
372 if (!more->clone.parse_kv (f)) 355 if (!op->parse_kv (f))
373 { 356 {
374 delete head; 357 op->destroy (true);
358 // leak head more*
375 return 0; 359 return 0;
376 } 360 }
377 361
378 assert (("pippijn sagt es gibt keine tiles mehr", head->clone.face == more->clone.face)); 362 overwrite (more, op);
363 op->destroy ();
379 364
380 if (more->clone.x > head->tail_x) head->tail_x = more->clone.x; 365 if (more->clone.x > head->tail_x) head->tail_x = more->clone.x;
381 if (more->clone.y > head->tail_y) head->tail_y = more->clone.y; 366 if (more->clone.y > head->tail_y) head->tail_y = more->clone.y;
382 367
383 more->head = head; 368 more->head = head;
… …
386 prev->clone.more = &more->clone; 371 prev->clone.more = &more->clone;
387 372
388 prev = more; 373 prev = more;
389 } 374 }
390 375
376 if (!head->next)
377 {
391 head->next = first_archetype; 378 head->next = first_archetype;
392 first_archetype = head; 379 first_archetype = head;
380 }
393 381
394 return head; 382 return head;
395} 383}
396 384
397/* 385/*
398 * Reads/parses the archetype-file, and copies into a linked list 386 * Reads/parses the archetype-file, and copies into a linked list
399 * of archetype-structures. 387 * of archetype-structures.
400 */ 388 */
401static bool 389static bool
402first_arch_pass (object_thawer &f) 390load_archetypes (object_thawer &f)
403{ 391{
404 for (;;) 392 for (;;)
405 { 393 {
406 switch (f.kw) 394 switch (f.kw)
407 { 395 {
408 case KW_object: 396 case KW_object:
397 loading_arch = true;
409 if (!archetype::read (f)) 398 if (!archetype::read (f))
399 {
400 loading_arch = false;
410 return false; 401 return false;
402 }
403
404 loading_arch = false;
411 continue; 405 continue;
412 406
413 case KW_EOF: 407 case KW_EOF:
414 return true; 408 return true;
415 409
… …
421 f.next (); 415 f.next ();
422 } 416 }
423} 417}
424 418
425/* 419/*
426 * Reads the archetype file once more, and links all pointers between
427 * archetypes.
428 */
429void
430second_arch_pass (object_thawer & thawer)
431{
432 char buf[MAX_BUF], *variable = buf, *argument, *cp;
433 archetype *at = NULL, *other;
434
435 while (fgets (buf, MAX_BUF, thawer) != NULL)
436 {
437 if (*buf == '#')
438 continue;
439
440 if ((argument = strchr (buf, ' ')) != NULL)
441 {
442 *argument = '\0', argument++;
443 cp = argument + strlen (argument) - 1;
444 while (isspace (*cp))
445 {
446 *cp = '\0';
447 cp--;
448 }
449 }
450
451 if (!strcmp ("object", variable))
452 {
453 if ((at = archetype::find (argument)) == NULL)
454 LOG (llevError, "Warning: failed to find arch %s\n", argument);
455 }
456 else if (!strcmp ("other_arch", variable))
457 {
458 if (at != NULL && at->clone.other_arch == NULL)
459 {
460 if ((other = archetype::find (argument)) == NULL)
461 LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
462 else if (at != NULL)
463 at->clone.other_arch = other;
464 }
465 }
466 else if (!strcmp ("randomitems", variable))
467 {
468 if (at)
469 {
470 treasurelist *tl = find_treasurelist (argument);
471
472 if (tl == NULL)
473 LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
474 else
475 at->clone.randomitems = tl;
476 }
477 }
478 }
479}
480
481#ifdef DEBUG
482void
483check_generators (void)
484{
485 archetype *at;
486
487 for (at = first_archetype; at != NULL; at = at->next)
488 if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
489 LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
490}
491#endif
492
493/*
494 * First initialises the archtype hash-table (init_archetable()). 420 * First initialises the archtype hash-table (init_archetable()).
495 * Reads and parses the archetype file (with the first and second-pass 421 * Reads and parses the archetype file (with the first and second-pass
496 * functions). 422 * functions).
497 * Then initialises treasures by calling load_treasures().
498 */ 423 */
499
500void 424void
501load_archetypes (void) 425load_archetypes (void)
502{ 426{
503 char filename[MAX_BUF]; 427 char filename[MAX_BUF];
504 428
505 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); 429 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
506 LOG (llevDebug, "Reading archetypes from %s:\n", filename); 430 LOG (llevDebug, "Reading archetypes from %s:\n", filename);
507 431
508 {
509 object_thawer f (filename); 432 object_thawer f (filename);
510 433
511 f.next (); 434 f.next ();
512 435
513 LOG (llevDebug, " arch-pass 1...\n"); 436 if (!load_archetypes (f))
514 if (!first_arch_pass (f)) 437 cleanup ("unable to load archetypes");
515 cleanup ("errors during first arch pass are fatal");
516 LOG (llevDebug, " done\n");
517 }
518 438
519 init_archetable ();
520 warn_archetypes = 1; 439 warn_archetypes = 1;
521 440
522 {
523 object_thawer f (filename);
524
525 LOG (llevDebug, " loading treasure...\n");
526 load_treasures (); 441 load_treasures ();
527 LOG (llevDebug, " done\n");
528 LOG (llevDebug, " arch-pass 2...\n");
529 second_arch_pass (f);
530 LOG (llevDebug, " done\n");
531#ifdef DEBUG
532 check_generators ();
533#endif
534 }
535 LOG (llevDebug, " done\n");
536} 442}
537 443
538/* 444/*
539 * Creates and returns a new object which is a copy of the given archetype. 445 * Creates and returns a new object which is a copy of the given archetype.
540 * This function returns NULL on failure. 446 * This function returns NULL on failure.
… …
636 return 0; 542 return 0;
637 else 543 else
638 return i->second; 544 return i->second;
639} 545}
640 546
547archetype *
548archetype::get (const char *name)
549{
550 archetype *at = find (name);
551
552 if (!at)
553 {
554 archetypes.push_back (at = new archetype);
555 at->name = name;
556 at->hash_add ();
557 }
558
559 return at;
560}
561
641/* 562/*
642 * Adds an archetype to the hashtable. 563 * Adds an archetype to the hashtable.
643 */ 564 */
644void 565void
645archetype::hash_add () 566archetype::hash_add ()
… …
658 * Used in treasure-generation. 579 * Used in treasure-generation.
659 */ 580 */
660archetype * 581archetype *
661type_to_archetype (int type) 582type_to_archetype (int type)
662{ 583{
663 archetype *at;
664
665 for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more) 584 for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
666 if (at->clone.type == type) 585 if (at->clone.type == type)
667 return at; 586 return at;
668 587
669 return 0; 588 return 0;
670} 589}
… …
672/* 591/*
673 * Returns a new object copied from the first archetype matching 592 * Returns a new object copied from the first archetype matching
674 * the given type. 593 * the given type.
675 * Used in treasure-generation. 594 * Used in treasure-generation.
676 */ 595 */
677
678object * 596object *
679clone_arch (int type) 597clone_arch (int type)
680{ 598{
681 archetype *at; 599 archetype *at;
682 600

Diff Legend

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