| … | |
… | |
| 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 | archetype *at; |
|
|
| 306 | |
|
|
| 307 | LOG (llevDebug, " Setting up archetable...\n"); |
|
|
| 308 | |
|
|
| 309 | for (at = first_archetype; at; at = at->more ? at->more : at->next) |
|
|
| 310 | at->hash_add (); |
|
|
| 311 | |
|
|
| 312 | LOG (llevDebug, "done\n"); |
|
|
| 313 | } |
|
|
| 314 | |
|
|
| 315 | void |
|
|
| 316 | free_all_archs (void) |
|
|
| 317 | { |
|
|
| 318 | archetype *at, *next; |
|
|
| 319 | int i = 0, f = 0; |
|
|
| 320 | |
|
|
| 321 | for (at = first_archetype; at; at = next) |
|
|
| 322 | { |
|
|
| 323 | if (at->more) |
|
|
| 324 | next = at->more; |
|
|
| 325 | else |
|
|
| 326 | next = at->next; |
|
|
| 327 | |
|
|
| 328 | delete |
|
|
| 329 | at; |
|
|
| 330 | |
|
|
| 331 | i++; |
|
|
| 332 | } |
|
|
| 333 | |
|
|
| 334 | LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f); |
|
|
| 335 | } |
|
|
| 336 | |
|
|
| 337 | archetype::archetype () |
280 | archetype::archetype () |
| 338 | { |
281 | { |
|
|
282 | clone.arch = this; |
|
|
283 | |
| 339 | 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 */ |
| 340 | SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ |
285 | SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ |
| 341 | } |
286 | } |
| 342 | |
287 | |
| 343 | archetype::~archetype () |
288 | archetype::~archetype () |
| 344 | { |
289 | { |
|
|
290 | //TODO: nuke ->more's |
|
|
291 | } |
|
|
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 | |
|
|
319 | archetype * |
|
|
320 | archetype::read (object_thawer &f) |
|
|
321 | { |
|
|
322 | assert (f.kw == KW_object); |
|
|
323 | |
|
|
324 | archetype *head = get (f.get_str ()); |
|
|
325 | unlink (head); |
|
|
326 | object *op = object::create (); |
|
|
327 | |
|
|
328 | if (!op->parse_kv (f)) |
|
|
329 | { |
|
|
330 | op->destroy (true); |
|
|
331 | // leak head |
|
|
332 | return 0; |
|
|
333 | } |
|
|
334 | |
|
|
335 | overwrite (head, op); |
|
|
336 | op->destroy (); |
|
|
337 | |
|
|
338 | for (archetype *prev = head; f.kw == KW_more; ) |
|
|
339 | { |
|
|
340 | f.next (); |
|
|
341 | assert (f.kw == KW_object); |
|
|
342 | |
|
|
343 | archetype *more = get (f.get_str ()); |
|
|
344 | unlink (more); |
|
|
345 | object *op = object::create (); |
|
|
346 | |
|
|
347 | if (!op->parse_kv (f)) |
|
|
348 | { |
|
|
349 | op->destroy (true); |
|
|
350 | // leak head more* |
|
|
351 | return 0; |
|
|
352 | } |
|
|
353 | |
|
|
354 | overwrite (more, op); |
|
|
355 | op->destroy (); |
|
|
356 | |
|
|
357 | if (more->clone.x > head->tail_x) head->tail_x = more->clone.x; |
|
|
358 | if (more->clone.y > head->tail_y) head->tail_y = more->clone.y; |
|
|
359 | |
|
|
360 | more->head = head; |
|
|
361 | more->clone.head = &head->clone; |
|
|
362 | prev->more = more; |
|
|
363 | prev->clone.more = &more->clone; |
|
|
364 | |
|
|
365 | prev = more; |
|
|
366 | } |
|
|
367 | |
|
|
368 | if (!head->next) |
|
|
369 | { |
|
|
370 | head->next = first_archetype; |
|
|
371 | first_archetype = head; |
|
|
372 | } |
|
|
373 | |
|
|
374 | return head; |
| 345 | } |
375 | } |
| 346 | |
376 | |
| 347 | /* |
377 | /* |
| 348 | * Reads/parses the archetype-file, and copies into a linked list |
378 | * Reads/parses the archetype-file, and copies into a linked list |
| 349 | * of archetype-structures. |
379 | * of archetype-structures. |
| 350 | */ |
380 | */ |
| 351 | void |
381 | static bool |
| 352 | first_arch_pass (object_thawer & fp) |
382 | load_archetypes (object_thawer &f) |
| 353 | { |
383 | { |
| 354 | archetype *head = 0, *last_more = 0; |
384 | for (;;) |
| 355 | |
|
|
| 356 | archetype *at = new archetype; |
|
|
| 357 | at->clone.arch = first_archetype = at; |
|
|
| 358 | |
|
|
| 359 | while (int i = load_object (fp, &at->clone, 0)) |
|
|
| 360 | { |
385 | { |
| 361 | at->clone.speed_left = (float) (-0.1); |
|
|
| 362 | /* copy the body_info to the body_used - this is only really |
|
|
| 363 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
| 364 | * by doing so, when a monster is created, it has good starting |
|
|
| 365 | * values for the body_used info, so when items are created |
|
|
| 366 | * for it, they can be properly equipped. |
|
|
| 367 | */ |
|
|
| 368 | memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info)); |
|
|
| 369 | |
|
|
| 370 | switch (i) |
386 | switch (f.kw) |
| 371 | { |
387 | { |
| 372 | case LL_NORMAL: /* A new archetype, just link it with the previous */ |
388 | case KW_object: |
| 373 | if (last_more != NULL) |
389 | loading_arch = true; |
| 374 | last_more->next = at; |
390 | if (!archetype::read (f)) |
| 375 | if (head != NULL) |
|
|
| 376 | head->next = at; |
|
|
| 377 | head = last_more = at; |
|
|
| 378 | #if 0 |
|
|
| 379 | if (!op->type) |
|
|
| 380 | LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name); |
|
|
| 381 | #endif |
|
|
| 382 | at->tail_x = 0; |
|
|
| 383 | at->tail_y = 0; |
|
|
| 384 | break; |
|
|
| 385 | |
|
|
| 386 | case LL_MORE: /* Another part of the previous archetype, link it correctly */ |
|
|
| 387 | |
|
|
| 388 | at->head = head; |
|
|
| 389 | at->clone.head = &head->clone; |
|
|
| 390 | if (last_more != NULL) |
|
|
| 391 | { |
391 | { |
| 392 | last_more->more = at; |
392 | loading_arch = false; |
| 393 | last_more->clone.more = &at->clone; |
393 | return false; |
| 394 | } |
394 | } |
| 395 | last_more = at; |
|
|
| 396 | |
395 | |
| 397 | /* If this multipart image is still composed of individual small |
396 | loading_arch = false; |
| 398 | * images, don't set the tail_.. values. We can't use them anyways, |
397 | continue; |
| 399 | * and setting these to zero makes the map sending to the client much |
398 | |
| 400 | * easier as just looking at the head, we know what to do. |
399 | case KW_EOF: |
| 401 | */ |
400 | return true; |
| 402 | if (at->clone.face != head->clone.face) |
401 | |
| 403 | { |
402 | default: |
| 404 | head->tail_x = 0; |
403 | if (!f.parse_error ("archetypes file")) |
| 405 | head->tail_y = 0; |
|
|
| 406 | } |
|
|
| 407 | else |
404 | return false; |
| 408 | { |
|
|
| 409 | if (at->clone.x > head->tail_x) |
|
|
| 410 | head->tail_x = at->clone.x; |
|
|
| 411 | if (at->clone.y > head->tail_y) |
|
|
| 412 | head->tail_y = at->clone.y; |
|
|
| 413 | } |
|
|
| 414 | break; |
|
|
| 415 | |
|
|
| 416 | } |
405 | } |
| 417 | |
406 | |
| 418 | at = new archetype; |
407 | f.next (); |
| 419 | |
|
|
| 420 | at->clone.arch = at; |
|
|
| 421 | } |
|
|
| 422 | |
|
|
| 423 | delete at; |
|
|
| 424 | } |
|
|
| 425 | |
|
|
| 426 | /* |
|
|
| 427 | * Reads the archetype file once more, and links all pointers between |
|
|
| 428 | * archetypes. |
|
|
| 429 | */ |
|
|
| 430 | |
|
|
| 431 | void |
|
|
| 432 | second_arch_pass (object_thawer & thawer) |
|
|
| 433 | { |
|
|
| 434 | char buf[MAX_BUF], *variable = buf, *argument, *cp; |
|
|
| 435 | archetype *at = NULL, *other; |
|
|
| 436 | |
|
|
| 437 | while (fgets (buf, MAX_BUF, thawer) != NULL) |
|
|
| 438 | { |
408 | } |
| 439 | if (*buf == '#') |
|
|
| 440 | continue; |
|
|
| 441 | |
|
|
| 442 | if ((argument = strchr (buf, ' ')) != NULL) |
|
|
| 443 | { |
|
|
| 444 | *argument = '\0', argument++; |
|
|
| 445 | cp = argument + strlen (argument) - 1; |
|
|
| 446 | while (isspace (*cp)) |
|
|
| 447 | { |
|
|
| 448 | *cp = '\0'; |
|
|
| 449 | cp--; |
|
|
| 450 | } |
|
|
| 451 | } |
|
|
| 452 | |
|
|
| 453 | if (!strcmp ("object", variable)) |
|
|
| 454 | { |
|
|
| 455 | if ((at = archetype::find (argument)) == NULL) |
|
|
| 456 | LOG (llevError, "Warning: failed to find arch %s\n", argument); |
|
|
| 457 | } |
|
|
| 458 | else if (!strcmp ("other_arch", variable)) |
|
|
| 459 | { |
|
|
| 460 | if (at != NULL && at->clone.other_arch == NULL) |
|
|
| 461 | { |
|
|
| 462 | if ((other = archetype::find (argument)) == NULL) |
|
|
| 463 | LOG (llevError, "Warning: failed to find other_arch %s\n", argument); |
|
|
| 464 | else if (at != NULL) |
|
|
| 465 | at->clone.other_arch = other; |
|
|
| 466 | } |
|
|
| 467 | } |
|
|
| 468 | else if (!strcmp ("randomitems", variable)) |
|
|
| 469 | { |
|
|
| 470 | if (at) |
|
|
| 471 | { |
|
|
| 472 | treasurelist *tl = find_treasurelist (argument); |
|
|
| 473 | |
|
|
| 474 | if (tl == NULL) |
|
|
| 475 | LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument); |
|
|
| 476 | else |
|
|
| 477 | at->clone.randomitems = tl; |
|
|
| 478 | } |
|
|
| 479 | } |
|
|
| 480 | } |
|
|
| 481 | } |
409 | } |
| 482 | |
|
|
| 483 | #ifdef DEBUG |
|
|
| 484 | void |
|
|
| 485 | check_generators (void) |
|
|
| 486 | { |
|
|
| 487 | archetype *at; |
|
|
| 488 | |
|
|
| 489 | for (at = first_archetype; at != NULL; at = at->next) |
|
|
| 490 | if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL) |
|
|
| 491 | LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name); |
|
|
| 492 | } |
|
|
| 493 | #endif |
|
|
| 494 | |
410 | |
| 495 | /* |
411 | /* |
| 496 | * First initialises the archtype hash-table (init_archetable()). |
412 | * First initialises the archtype hash-table (init_archetable()). |
| 497 | * 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 |
| 498 | * functions). |
414 | * functions). |
| 499 | * Then initialises treasures by calling load_treasures(). |
|
|
| 500 | */ |
415 | */ |
| 501 | |
416 | bool |
| 502 | void |
417 | load_archetype_file (const char *filename) |
| 503 | load_archetypes (void) |
|
|
| 504 | { |
418 | { |
| 505 | char filename[MAX_BUF]; |
|
|
| 506 | |
|
|
| 507 | sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); |
|
|
| 508 | LOG (llevDebug, "Reading archetypes from %s:\n", filename); |
|
|
| 509 | |
|
|
| 510 | { |
|
|
| 511 | object_thawer |
|
|
| 512 | thawer (filename); |
419 | object_thawer f (filename); |
| 513 | |
420 | |
| 514 | LOG (llevDebug, " arch-pass 1...\n"); |
421 | f.next (); |
| 515 | first_arch_pass (thawer); |
|
|
| 516 | LOG (llevDebug, " done\n"); |
|
|
| 517 | } |
|
|
| 518 | |
422 | |
| 519 | init_archetable (); |
423 | // make sure the next - long - step is only done after a tick |
|
|
424 | coroapi::wait_for_tick_begin (); |
|
|
425 | |
|
|
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 |
432 | if (!empty_archetype) |
| 524 | thawer (filename); |
433 | return false; |
| 525 | |
434 | |
| 526 | LOG (llevDebug, " loading treasure...\n"); |
435 | coroapi::cede (); |
| 527 | load_treasures (); |
436 | |
| 528 | LOG (llevDebug, " done\n"); |
437 | return true; |
| 529 | LOG (llevDebug, " arch-pass 2...\n"); |
|
|
| 530 | second_arch_pass (thawer); |
|
|
| 531 | LOG (llevDebug, " done\n"); |
|
|
| 532 | #ifdef DEBUG |
|
|
| 533 | check_generators (); |
|
|
| 534 | #endif |
|
|
| 535 | } |
|
|
| 536 | LOG (llevDebug, " done\n"); |
|
|
| 537 | } |
438 | } |
| 538 | |
439 | |
| 539 | /* |
440 | /* |
| 540 | * 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. |
| 541 | * This function returns NULL on failure. |
442 | * This function returns NULL on failure. |
| 542 | */ |
443 | */ |
| 543 | object * |
444 | object * |
| 544 | arch_to_object (archetype *at) |
445 | arch_to_object (archetype *at) |
| 545 | { |
446 | { |
| 546 | object *op; |
447 | if (!at) |
| 547 | |
|
|
| 548 | if (at == NULL) |
|
|
| 549 | { |
448 | { |
| 550 | if (warn_archetypes) |
449 | if (warn_archetypes) |
| 551 | LOG (llevError, "Couldn't find archetype.\n"); |
450 | LOG (llevError, "Couldn't find archetype.\n"); |
| 552 | |
451 | |
| 553 | return NULL; |
452 | return NULL; |
| 554 | } |
453 | } |
| 555 | |
454 | |
| 556 | op = at->clone.clone (); |
455 | object *op = at->clone.clone (); |
| 557 | op->arch = at; |
456 | op->arch = at; |
| 558 | op->instantiate (); |
457 | op->instantiate (); |
| 559 | return op; |
458 | return op; |
| 560 | } |
459 | } |
| 561 | |
460 | |
| … | |
… | |
| 639 | return 0; |
538 | return 0; |
| 640 | else |
539 | else |
| 641 | return i->second; |
540 | return i->second; |
| 642 | } |
541 | } |
| 643 | |
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 | |
| 644 | /* |
558 | /* |
| 645 | * Adds an archetype to the hashtable. |
559 | * Adds an archetype to the hashtable. |
| 646 | */ |
560 | */ |
| 647 | void |
561 | void |
| 648 | archetype::hash_add () |
562 | archetype::hash_add () |
| … | |
… | |
| 661 | * Used in treasure-generation. |
575 | * Used in treasure-generation. |
| 662 | */ |
576 | */ |
| 663 | archetype * |
577 | archetype * |
| 664 | type_to_archetype (int type) |
578 | type_to_archetype (int type) |
| 665 | { |
579 | { |
| 666 | archetype *at; |
|
|
| 667 | |
|
|
| 668 | 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) |
| 669 | if (at->clone.type == type) |
581 | if (at->clone.type == type) |
| 670 | return at; |
582 | return at; |
| 671 | |
583 | |
| 672 | return 0; |
584 | return 0; |
| 673 | } |
585 | } |
| … | |
… | |
| 675 | /* |
587 | /* |
| 676 | * Returns a new object copied from the first archetype matching |
588 | * Returns a new object copied from the first archetype matching |
| 677 | * the given type. |
589 | * the given type. |
| 678 | * Used in treasure-generation. |
590 | * Used in treasure-generation. |
| 679 | */ |
591 | */ |
| 680 | |
|
|
| 681 | object * |
592 | object * |
| 682 | clone_arch (int type) |
593 | clone_arch (int type) |
| 683 | { |
594 | { |
| 684 | archetype *at; |
595 | archetype *at; |
| 685 | |
596 | |
