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.45 by root, Fri Apr 13 07:26:29 2007 UTC vs.
Revision 1.46 by root, Mon Apr 16 06:23:39 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 }
361
362 overwrite (more, op);
363 op->destroy ();
377 364
378 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;
379 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;
380 367
381 more->head = head; 368 more->head = head;
… …
384 prev->clone.more = &more->clone; 371 prev->clone.more = &more->clone;
385 372
386 prev = more; 373 prev = more;
387 } 374 }
388 375
376 if (!head->next)
377 {
389 head->next = first_archetype; 378 head->next = first_archetype;
390 first_archetype = head; 379 first_archetype = head;
380 }
391 381
392 return head; 382 return head;
393} 383}
394 384
395/* 385/*
396 * Reads/parses the archetype-file, and copies into a linked list 386 * Reads/parses the archetype-file, and copies into a linked list
397 * of archetype-structures. 387 * of archetype-structures.
398 */ 388 */
399static bool 389static bool
400first_arch_pass (object_thawer &f) 390load_archetypes (object_thawer &f)
401{ 391{
402 for (;;) 392 for (;;)
403 { 393 {
404 switch (f.kw) 394 switch (f.kw)
405 { 395 {
406 case KW_object: 396 case KW_object:
397 loading_arch = true;
407 if (!archetype::read (f)) 398 if (!archetype::read (f))
399 {
400 loading_arch = false;
408 return false; 401 return false;
402 }
403
404 loading_arch = false;
409 continue; 405 continue;
410 406
411 case KW_EOF: 407 case KW_EOF:
412 return true; 408 return true;
413 409
… …
419 f.next (); 415 f.next ();
420 } 416 }
421} 417}
422 418
423/* 419/*
424 * Reads the archetype file once more, and links all pointers between
425 * archetypes.
426 */
427void
428second_arch_pass (object_thawer & thawer)
429{
430 char buf[MAX_BUF], *variable = buf, *argument, *cp;
431 archetype *at = NULL, *other;
432
433 while (fgets (buf, MAX_BUF, thawer) != NULL)
434 {
435 if (*buf == '#')
436 continue;
437
438 if ((argument = strchr (buf, ' ')) != NULL)
439 {
440 *argument = '\0', argument++;
441 cp = argument + strlen (argument) - 1;
442 while (isspace (*cp))
443 {
444 *cp = '\0';
445 cp--;
446 }
447 }
448
449 if (!strcmp ("object", variable))
450 {
451 if ((at = archetype::find (argument)) == NULL)
452 LOG (llevError, "Warning: failed to find arch %s\n", argument);
453 }
454 else if (!strcmp ("other_arch", variable))
455 {
456 if (at != NULL && at->clone.other_arch == NULL)
457 {
458 if ((other = archetype::find (argument)) == NULL)
459 LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
460 else if (at != NULL)
461 at->clone.other_arch = other;
462 }
463 }
464 else if (!strcmp ("randomitems", variable))
465 {
466 if (at)
467 {
468 treasurelist *tl = find_treasurelist (argument);
469
470 if (tl == NULL)
471 LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
472 else
473 at->clone.randomitems = tl;
474 }
475 }
476 }
477}
478
479/*
480 * First initialises the archtype hash-table (init_archetable()). 420 * First initialises the archtype hash-table (init_archetable()).
481 * 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
482 * functions). 422 * functions).
483 * Then initialises treasures by calling load_treasures(). 423 * Then initialises treasures by calling load_treasures().
484 */ 424 */
… …
488 char filename[MAX_BUF]; 428 char filename[MAX_BUF];
489 429
490 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); 430 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
491 LOG (llevDebug, "Reading archetypes from %s:\n", filename); 431 LOG (llevDebug, "Reading archetypes from %s:\n", filename);
492 432
493 {
494 object_thawer f (filename); 433 object_thawer f (filename);
495 434
496 f.next (); 435 f.next ();
497 436
498 LOG (llevDebug, " arch-pass 1...\n"); 437 if (!load_archetypes (f))
499 if (!first_arch_pass (f)) 438 cleanup ("unable to load archetypes");
500 cleanup ("errors during first arch pass are fatal");
501 LOG (llevDebug, " done\n");
502 }
503 439
504 init_archetable ();
505 warn_archetypes = 1; 440 warn_archetypes = 1;
506
507 {
508 object_thawer f (filename);
509
510 LOG (llevDebug, " loading treasure...\n");
511 load_treasures ();
512 LOG (llevDebug, " done\n");
513 LOG (llevDebug, " arch-pass 2...\n");
514 second_arch_pass (f);
515 LOG (llevDebug, " done\n");
516 }
517 LOG (llevDebug, " done\n");
518} 441}
519 442
520/* 443/*
521 * Creates and returns a new object which is a copy of the given archetype. 444 * Creates and returns a new object which is a copy of the given archetype.
522 * This function returns NULL on failure. 445 * This function returns NULL on failure.
… …
618 return 0; 541 return 0;
619 else 542 else
620 return i->second; 543 return i->second;
621} 544}
622 545
546archetype *
547archetype::get (const char *name)
548{
549 archetype *at = find (name);
550
551 if (!at)
552 {
553 archetypes.push_back (at = new archetype);
554 at->name = name;
555 at->hash_add ();
556 }
557
558 return at;
559}
560
623/* 561/*
624 * Adds an archetype to the hashtable. 562 * Adds an archetype to the hashtable.
625 */ 563 */
626void 564void
627archetype::hash_add () 565archetype::hash_add ()
… …
640 * Used in treasure-generation. 578 * Used in treasure-generation.
641 */ 579 */
642archetype * 580archetype *
643type_to_archetype (int type) 581type_to_archetype (int type)
644{ 582{
645 archetype *at;
646
647 for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more) 583 for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
648 if (at->clone.type == type) 584 if (at->clone.type == type)
649 return at; 585 return at;
650 586
651 return 0; 587 return 0;
652} 588}
… …
654/* 590/*
655 * Returns a new object copied from the first archetype matching 591 * Returns a new object copied from the first archetype matching
656 * the given type. 592 * the given type.
657 * Used in treasure-generation. 593 * Used in treasure-generation.
658 */ 594 */
659
660object * 595object *
661clone_arch (int type) 596clone_arch (int type)
662{ 597{
663 archetype *at; 598 archetype *at;
664 599

Diff Legend

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