… | |
… | |
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 | |
34 | int 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 | |
|
|
42 | bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing |
43 | |
43 | |
44 | // the hashtable |
44 | // the hashtable |
45 | typedef std::tr1::unordered_map |
45 | typedef 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 | |
54 | static HT ht (5000); |
54 | static HT ht (5000); |
|
|
55 | static 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 | |
|
|
285 | void |
|
|
286 | init_archetypes (void) |
|
|
287 | { /* called from add_player() and edit() */ |
|
|
288 | if (first_archetype != NULL) /* Only do this once */ |
|
|
289 | return; |
|
|
290 | |
|
|
291 | arch_init = 1; |
|
|
292 | load_archetypes (); |
|
|
293 | arch_init = 0; |
|
|
294 | 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 | */ |
|
|
302 | void |
|
|
303 | init_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 | |
|
|
314 | void |
|
|
315 | free_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 | } |
|
|
335 | |
|
|
336 | archetype::archetype () |
280 | archetype::archetype () |
337 | { |
281 | { |
338 | clone.arch = this; |
282 | clone.arch = this; |
339 | |
283 | |
340 | CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */ |
284 | CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */ |
… | |
… | |
344 | archetype::~archetype () |
288 | archetype::~archetype () |
345 | { |
289 | { |
346 | //TODO: nuke ->more's |
290 | //TODO: nuke ->more's |
347 | } |
291 | } |
348 | |
292 | |
|
|
293 | static void |
|
|
294 | unlink (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 |
|
|
310 | void |
|
|
311 | overwrite (archetype *at, object *op) |
|
|
312 | { |
|
|
313 | at->clone = *op; |
|
|
314 | |
|
|
315 | at->clone.arch = at; |
|
|
316 | //TODO: inv et al. |
|
|
317 | } |
|
|
318 | |
349 | archetype * |
319 | archetype * |
350 | archetype::read (object_thawer &f) |
320 | archetype::read (object_thawer &f) |
351 | { |
321 | { |
352 | assert (f.kw == KW_object); |
322 | assert (f.kw == KW_object); |
353 | |
323 | |
354 | archetype *head = new archetype; |
324 | archetype *head = get (f.get_str ()); |
355 | f.get (head->name); |
325 | unlink (head); |
|
|
326 | object *op = object::create (); |
356 | |
327 | |
357 | if (!head->clone.parse_kv (f)) |
328 | if (!op->parse_kv (f)) |
358 | { |
329 | { |
359 | delete head; |
330 | op->destroy (true); |
|
|
331 | // leak head |
360 | return 0; |
332 | return 0; |
361 | } |
333 | } |
362 | |
334 | |
|
|
335 | overwrite (head, op); |
|
|
336 | op->destroy (); |
|
|
337 | |
363 | for (archetype *prev = head; f.kw == KW_more; ) |
338 | for (archetype *prev = head; f.kw == KW_more; ) |
364 | { |
339 | { |
365 | f.next (); |
340 | f.next (); |
366 | |
|
|
367 | assert (f.kw == KW_object); |
341 | assert (f.kw == KW_object); |
368 | |
342 | |
369 | archetype *more = new archetype; |
343 | archetype *more = get (f.get_str ()); |
370 | f.get (more->name); |
344 | unlink (more); |
|
|
345 | object *op = object::create (); |
371 | |
346 | |
372 | if (!more->clone.parse_kv (f)) |
347 | if (!op->parse_kv (f)) |
373 | { |
348 | { |
374 | delete head; |
349 | op->destroy (true); |
|
|
350 | // leak head more* |
375 | return 0; |
351 | return 0; |
376 | } |
352 | } |
377 | |
353 | |
378 | assert (("pippijn sagt es gibt keine tiles mehr", head->clone.face == more->clone.face)); |
354 | overwrite (more, op); |
|
|
355 | op->destroy (); |
379 | |
356 | |
380 | if (more->clone.x > head->tail_x) head->tail_x = more->clone.x; |
357 | 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; |
358 | if (more->clone.y > head->tail_y) head->tail_y = more->clone.y; |
382 | |
359 | |
383 | more->head = head; |
360 | more->head = head; |
… | |
… | |
386 | prev->clone.more = &more->clone; |
363 | prev->clone.more = &more->clone; |
387 | |
364 | |
388 | prev = more; |
365 | prev = more; |
389 | } |
366 | } |
390 | |
367 | |
|
|
368 | if (!head->next) |
|
|
369 | { |
391 | head->next = first_archetype; |
370 | head->next = first_archetype; |
392 | first_archetype = head; |
371 | first_archetype = head; |
|
|
372 | } |
393 | |
373 | |
394 | return head; |
374 | return head; |
395 | } |
375 | } |
396 | |
376 | |
397 | /* |
377 | /* |
398 | * Reads/parses the archetype-file, and copies into a linked list |
378 | * Reads/parses the archetype-file, and copies into a linked list |
399 | * of archetype-structures. |
379 | * of archetype-structures. |
400 | */ |
380 | */ |
401 | static bool |
381 | static bool |
402 | first_arch_pass (object_thawer &f) |
382 | load_archetypes (object_thawer &f) |
403 | { |
383 | { |
404 | for (;;) |
384 | for (;;) |
405 | { |
385 | { |
406 | switch (f.kw) |
386 | switch (f.kw) |
407 | { |
387 | { |
408 | case KW_object: |
388 | case KW_object: |
|
|
389 | loading_arch = true; |
409 | if (!archetype::read (f)) |
390 | if (!archetype::read (f)) |
|
|
391 | { |
|
|
392 | loading_arch = false; |
410 | return false; |
393 | return false; |
|
|
394 | } |
|
|
395 | |
|
|
396 | loading_arch = false; |
411 | continue; |
397 | continue; |
412 | |
398 | |
413 | case KW_EOF: |
399 | case KW_EOF: |
414 | return true; |
400 | return true; |
415 | |
401 | |
… | |
… | |
421 | f.next (); |
407 | f.next (); |
422 | } |
408 | } |
423 | } |
409 | } |
424 | |
410 | |
425 | /* |
411 | /* |
426 | * Reads the archetype file once more, and links all pointers between |
|
|
427 | * archetypes. |
|
|
428 | */ |
|
|
429 | void |
|
|
430 | second_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 |
|
|
482 | void |
|
|
483 | check_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()). |
412 | * First initialises the archtype hash-table (init_archetable()). |
495 | * Reads and parses the archetype file (with the first and second-pass |
413 | * Reads and parses the archetype file (with the first and second-pass |
496 | * functions). |
414 | * functions). |
497 | * Then initialises treasures by calling load_treasures(). |
|
|
498 | */ |
415 | */ |
499 | |
416 | bool |
500 | void |
417 | load_archetype_file (const char *filename) |
501 | load_archetypes (void) |
|
|
502 | { |
418 | { |
503 | char filename[MAX_BUF]; |
|
|
504 | |
|
|
505 | sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); |
|
|
506 | LOG (llevDebug, "Reading archetypes from %s:\n", filename); |
|
|
507 | |
|
|
508 | { |
|
|
509 | object_thawer f (filename); |
419 | object_thawer f (filename); |
510 | |
420 | |
511 | f.next (); |
421 | f.next (); |
512 | |
422 | |
513 | LOG (llevDebug, " arch-pass 1...\n"); |
423 | // make sure the next - long - step is only done after a tick |
514 | if (!first_arch_pass (f)) |
424 | coroapi::wait_for_tick_begin (); |
515 | cleanup ("errors during first arch pass are fatal"); |
|
|
516 | LOG (llevDebug, " done\n"); |
|
|
517 | } |
|
|
518 | |
425 | |
519 | init_archetable (); |
426 | if (!load_archetypes (f)) |
|
|
427 | return false; |
|
|
428 | |
520 | warn_archetypes = 1; |
429 | warn_archetypes = 1; |
521 | |
430 | |
522 | { |
431 | empty_archetype = archetype::find ("empty_archetype"); |
523 | object_thawer f (filename); |
432 | if (!empty_archetype) |
|
|
433 | return false; |
524 | |
434 | |
525 | LOG (llevDebug, " loading treasure...\n"); |
435 | coroapi::cede (); |
526 | load_treasures (); |
436 | |
527 | LOG (llevDebug, " done\n"); |
437 | return true; |
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 | } |
438 | } |
537 | |
439 | |
538 | /* |
440 | /* |
539 | * Creates and returns a new object which is a copy of the given archetype. |
441 | * Creates and returns a new object which is a copy of the given archetype. |
540 | * This function returns NULL on failure. |
442 | * This function returns NULL on failure. |
… | |
… | |
636 | return 0; |
538 | return 0; |
637 | else |
539 | else |
638 | return i->second; |
540 | return i->second; |
639 | } |
541 | } |
640 | |
542 | |
|
|
543 | archetype * |
|
|
544 | archetype::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 | |
641 | /* |
558 | /* |
642 | * Adds an archetype to the hashtable. |
559 | * Adds an archetype to the hashtable. |
643 | */ |
560 | */ |
644 | void |
561 | void |
645 | archetype::hash_add () |
562 | archetype::hash_add () |
… | |
… | |
658 | * Used in treasure-generation. |
575 | * Used in treasure-generation. |
659 | */ |
576 | */ |
660 | archetype * |
577 | archetype * |
661 | type_to_archetype (int type) |
578 | type_to_archetype (int type) |
662 | { |
579 | { |
663 | archetype *at; |
|
|
664 | |
|
|
665 | for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more) |
580 | for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more) |
666 | if (at->clone.type == type) |
581 | if (at->clone.type == type) |
667 | return at; |
582 | return at; |
668 | |
583 | |
669 | return 0; |
584 | return 0; |
670 | } |
585 | } |
… | |
… | |
672 | /* |
587 | /* |
673 | * Returns a new object copied from the first archetype matching |
588 | * Returns a new object copied from the first archetype matching |
674 | * the given type. |
589 | * the given type. |
675 | * Used in treasure-generation. |
590 | * Used in treasure-generation. |
676 | */ |
591 | */ |
677 | |
|
|
678 | object * |
592 | object * |
679 | clone_arch (int type) |
593 | clone_arch (int type) |
680 | { |
594 | { |
681 | archetype *at; |
595 | archetype *at; |
682 | |
596 | |