| … | |
… | |
| 68 | archetype * |
68 | archetype * |
| 69 | find_archetype_by_object_name (const char *name) |
69 | find_archetype_by_object_name (const char *name) |
| 70 | { |
70 | { |
| 71 | shstr_cmp name_cmp (name); |
71 | shstr_cmp name_cmp (name); |
| 72 | |
72 | |
| 73 | for (archetype *at = first_archetype; at; at = at->next) |
73 | for_all_archetypes (at) |
| 74 | if (at->clone.name == name_cmp) |
74 | if (at->archname == name_cmp) |
| 75 | return at; |
75 | return at; |
| 76 | |
76 | |
| 77 | return 0; |
77 | return 0; |
| 78 | } |
78 | } |
| 79 | |
79 | |
| … | |
… | |
| 85 | archetype * |
85 | archetype * |
| 86 | find_archetype_by_object_type_name (int type, const char *name) |
86 | find_archetype_by_object_type_name (int type, const char *name) |
| 87 | { |
87 | { |
| 88 | shstr_cmp name_cmp (name); |
88 | shstr_cmp name_cmp (name); |
| 89 | |
89 | |
| 90 | for (archetype *at = first_archetype; at; at = at->next) |
90 | for_all_archetypes (at) |
| 91 | if (at->clone.name == name_cmp && at->clone.type == type) |
91 | if (at->archname == name_cmp && at->type == type) |
| 92 | return at; |
92 | return at; |
| 93 | |
93 | |
| 94 | return 0; |
94 | return 0; |
| 95 | } |
95 | } |
| 96 | |
96 | |
| … | |
… | |
| 102 | object * |
102 | object * |
| 103 | get_archetype_by_skill_name (const char *skill, int type) |
103 | get_archetype_by_skill_name (const char *skill, int type) |
| 104 | { |
104 | { |
| 105 | shstr_cmp skill_cmp (skill); |
105 | shstr_cmp skill_cmp (skill); |
| 106 | |
106 | |
| 107 | for (archetype *at = first_archetype; at; at = at->next) |
107 | for_all_archetypes (at) |
| 108 | if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.type)) |
108 | if (at->skill == skill_cmp && (type == -1 || type == at->type)) |
| 109 | return arch_to_object (at); |
109 | return arch_to_object (at); |
| 110 | |
110 | |
| 111 | return 0; |
111 | return 0; |
| 112 | } |
112 | } |
| 113 | |
113 | |
| … | |
… | |
| 119 | * (eg, skills) |
119 | * (eg, skills) |
| 120 | */ |
120 | */ |
| 121 | archetype * |
121 | archetype * |
| 122 | get_archetype_by_type_subtype (int type, int subtype) |
122 | get_archetype_by_type_subtype (int type, int subtype) |
| 123 | { |
123 | { |
| 124 | for (archetype *at = first_archetype; at; at = at->next) |
124 | for_all_archetypes (at) |
| 125 | if ((type == -1 || type == at->clone.type) && (subtype == -1 || subtype == at->clone.subtype)) |
125 | if ((type == -1 || type == at->type) && (subtype == -1 || subtype == at->subtype)) |
| 126 | return at; |
126 | return at; |
| 127 | |
127 | |
| 128 | return 0; |
128 | return 0; |
| 129 | } |
129 | } |
| 130 | |
130 | |
| … | |
… | |
| 275 | } |
275 | } |
| 276 | |
276 | |
| 277 | return 0; |
277 | return 0; |
| 278 | } |
278 | } |
| 279 | |
279 | |
| 280 | archetype::archetype () |
280 | archetype::archetype (const char *name) |
| 281 | { |
281 | { |
|
|
282 | stub = true; |
| 282 | clone.arch = this; |
283 | arch = this; |
| 283 | |
284 | 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 | } |
285 | } |
| 287 | |
286 | |
| 288 | archetype::~archetype () |
287 | archetype::~archetype () |
| 289 | { |
288 | { |
| 290 | //TODO: nuke ->more's |
289 | unlink (); |
| 291 | } |
290 | } |
| 292 | |
291 | |
| 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 |
292 | void |
| 311 | overwrite (archetype *at, object *op) |
293 | archetype::link () |
| 312 | { |
294 | { |
| 313 | at->clone = *op; |
295 | ht.insert (std::make_pair (archname, this)); |
| 314 | at->clone.arch = at; |
|
|
| 315 | |
296 | |
| 316 | at->clone.inv = op->inv; op->inv = 0; |
297 | if (!archetypes.contains (this)) |
|
|
298 | archetypes.insert (this); |
|
|
299 | } |
| 317 | |
300 | |
| 318 | op->destroy (); |
301 | void |
|
|
302 | archetype::unlink () |
|
|
303 | { |
|
|
304 | ht.erase (archname); |
|
|
305 | |
|
|
306 | if (archetypes.contains (this)) |
|
|
307 | archetypes.erase (this); |
|
|
308 | } |
|
|
309 | |
|
|
310 | /* |
|
|
311 | * Finds, using the hashtable, which archetype matches the given name. |
|
|
312 | * returns a pointer to the found archetype, otherwise NULL. |
|
|
313 | */ |
|
|
314 | archetype * |
|
|
315 | archetype::find (const char *name) |
|
|
316 | { |
|
|
317 | if (!name) |
|
|
318 | return 0; |
|
|
319 | |
|
|
320 | auto (i, ht.find (name)); |
|
|
321 | |
|
|
322 | if (i == ht.end ()) |
|
|
323 | return 0; |
|
|
324 | else |
|
|
325 | return i->second; |
|
|
326 | } |
|
|
327 | |
|
|
328 | archetype * |
|
|
329 | archetype::get (const char *name) |
|
|
330 | { |
|
|
331 | if (!name) |
|
|
332 | { |
|
|
333 | LOG (llevError, "null archetype requested\n"); |
|
|
334 | name = "(null)"; |
|
|
335 | } |
|
|
336 | |
|
|
337 | archetype *at = find (name); |
|
|
338 | |
|
|
339 | if (loading_arch && at && !at->stub) |
|
|
340 | { |
|
|
341 | at->unlink (); |
|
|
342 | at = 0; |
|
|
343 | } |
|
|
344 | |
|
|
345 | if (!at || (!at->stub && loading_arch)) |
|
|
346 | { |
|
|
347 | at = new archetype (name); |
|
|
348 | at->link (); |
|
|
349 | } |
|
|
350 | |
|
|
351 | return at; |
| 319 | } |
352 | } |
| 320 | |
353 | |
| 321 | archetype * |
354 | archetype * |
| 322 | archetype::read (object_thawer &f) |
355 | archetype::read (object_thawer &f) |
| 323 | { |
356 | { |
| 324 | assert (f.kw == KW_object); |
357 | assert (f.kw == KW_object); |
| 325 | |
358 | |
| 326 | loading_arch = true; // hack to tell parse_kv et al. to behave |
359 | loading_arch = true; // hack to tell parse_kv et al. to behave |
| 327 | |
360 | |
| 328 | typedef std::pair<archetype *, object *> part; |
|
|
| 329 | std::vector<part> parts; |
361 | std::vector<archetype *> parts; |
| 330 | |
362 | |
| 331 | coroapi::cede_to_tick_every (100); |
363 | coroapi::cede_to_tick_every (10); |
| 332 | |
364 | |
| 333 | for (;;) |
365 | for (;;) |
| 334 | { |
366 | { |
| 335 | object *op = object::create (); |
367 | // the archetype might have been referenced earlier |
|
|
368 | // so try to find an existing stub archetype first |
| 336 | archetype *at = get (f.get_str ()); |
369 | archetype *at = find (f.get_str ()); |
| 337 | f.get (op->name); |
370 | |
|
|
371 | if (!at || !at->stub) |
|
|
372 | at = new archetype (f.get_str ()); |
|
|
373 | |
| 338 | f.next (); |
374 | f.next (); |
| 339 | |
375 | |
| 340 | #if 0 |
376 | #if 0 |
|
|
377 | // implementing it here in the server does neither allow multiple inheritence |
|
|
378 | // nor does it cleanly "just override". it would allow use in map files, though, |
|
|
379 | // and other resource files dynamically laoded (as opposed to being preprocessed). |
|
|
380 | // not that any of this is relevant as of yet... |
| 341 | if (f.kw == KW_inherit) |
381 | if (f.kw == KW_inherit) |
| 342 | { |
382 | { |
| 343 | if (archetype *at = find (f.get_str ())) |
383 | if (archetype *at = find (f.get_str ())) |
| 344 | *op = at->clone; |
384 | *op = at->clone; |
| 345 | else |
385 | else |
| 346 | LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n", |
386 | LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n", |
| 347 | &at->name, f.get_str ()); |
387 | &at->archname, f.get_str ()); |
| 348 | |
388 | |
| 349 | f.next (); |
389 | f.next (); |
| 350 | } |
390 | } |
| 351 | #endif |
391 | #endif |
| 352 | |
392 | |
| 353 | if (!op->parse_kv (f)) |
393 | if (!at->parse_kv (f)) |
| 354 | goto fail; |
394 | goto fail; |
| 355 | |
395 | |
| 356 | op->post_load_check (); |
396 | at->post_load_check (); |
| 357 | |
397 | |
| 358 | parts.push_back (std::make_pair (at, op)); |
398 | parts.push_back (at); |
| 359 | |
399 | |
| 360 | if (f.kw != KW_more) |
400 | if (f.kw != KW_more) |
| 361 | break; |
401 | break; |
| 362 | |
402 | |
| 363 | f.next (); |
403 | f.next (); |
| … | |
… | |
| 367 | f.parse_error ("more object"); |
407 | f.parse_error ("more object"); |
| 368 | goto fail; |
408 | goto fail; |
| 369 | } |
409 | } |
| 370 | } |
410 | } |
| 371 | |
411 | |
|
|
412 | loading_arch = false; |
|
|
413 | |
| 372 | { |
414 | { |
|
|
415 | auto (at, parts.begin ()); |
|
|
416 | |
| 373 | archetype *head = parts.front ().first; |
417 | archetype *new_head = parts.front (); |
|
|
418 | archetype *old_head = find (new_head->archname); |
| 374 | |
419 | |
|
|
420 | for (auto (at, parts.begin ()); at != parts.end (); ++at) |
|
|
421 | fprintf (stderr, "%d: %s\n", at - parts.begin(), &(*at)->archname);//D |
|
|
422 | |
| 375 | // check that all archetypes belong to the same object or are heads |
423 | // check that all archetypes belong to the same old object or are new |
| 376 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
424 | for (auto (at, parts.begin ()); at != parts.end (); ++at) |
| 377 | { |
425 | { |
| 378 | archetype *at = p->first; |
426 | archetype *new_part = *at; |
|
|
427 | archetype *old_part = find (new_part->archname); |
| 379 | |
428 | |
| 380 | if (at->head != head && at->head) |
429 | if (old_part && old_part->head_ () != old_head) |
| 381 | { |
430 | { |
| 382 | LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->archname); |
431 | fprintf (stderr, "nhn %s\n", &new_head->archname);//D |
| 383 | goto fail; |
432 | fprintf (stderr, "old_head %p,%p new_head %p,%p ph %p\n", old_head, old_part, new_head, new_part, old_part->head_()); |
| 384 | } |
433 | LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n", |
| 385 | |
434 | &new_part->archname, &((archetype *)old_part->head_ ())->archname); |
| 386 | if (at->next && at != head) |
|
|
| 387 | { |
|
|
| 388 | LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->archname); |
|
|
| 389 | goto fail; |
435 | goto fail; |
| 390 | } |
436 | } |
| 391 | } |
437 | } |
| 392 | |
438 | |
| 393 | // sever chain of existing head object |
439 | fprintf (stderr, "oh %p %s\n", old_head, &new_head->archname);//D |
|
|
440 | |
|
|
441 | // deactivate existing archetype |
| 394 | for (archetype *more, *at = head; at; at = more) |
442 | for (archetype *at = old_head; at; at = (archetype *)at->more) |
| 395 | { |
443 | at->unlink (); |
| 396 | more = at->more; |
|
|
| 397 | |
|
|
| 398 | at->head = 0; |
|
|
| 399 | at->more = 0; |
|
|
| 400 | } |
|
|
| 401 | |
|
|
| 402 | // replace/update head |
|
|
| 403 | overwrite (head, parts.front ().second); |
|
|
| 404 | head->tail_x = 0; |
|
|
| 405 | head->tail_y = 0; |
|
|
| 406 | |
|
|
| 407 | // link into list of heads, if not already there |
|
|
| 408 | if (!head->linked) |
|
|
| 409 | { |
|
|
| 410 | head->linked = true; |
|
|
| 411 | head->next = first_archetype; |
|
|
| 412 | first_archetype = head; |
|
|
| 413 | } |
|
|
| 414 | |
444 | |
| 415 | // reassemble new chain |
445 | // reassemble new chain |
|
|
446 | new_head->min_x = new_head->max_x = new_head->x; |
|
|
447 | new_head->min_y = new_head->max_y = new_head->y; |
|
|
448 | |
| 416 | archetype *prev = head; |
449 | archetype *less = new_head; |
|
|
450 | archetype *head = 0; |
| 417 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
451 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
| 418 | { |
452 | { |
| 419 | archetype *at = p->first; |
453 | archetype *at = *p; |
| 420 | overwrite (at, p->second); |
|
|
| 421 | |
454 | |
| 422 | if (at->clone.x > head->tail_x) head->tail_x = at->clone.x; |
455 | if (at->x < new_head->min_x) new_head->min_x = at->x; |
| 423 | if (at->clone.y > head->tail_y) head->tail_y = at->clone.y; |
456 | if (at->y < new_head->min_y) new_head->min_y = at->y; |
|
|
457 | if (at->x > new_head->max_x) new_head->max_x = at->x; |
|
|
458 | if (at->y > new_head->max_y) new_head->max_y = at->y; |
| 424 | |
459 | |
| 425 | at->head = head; |
460 | at->head = head; head = new_head; |
| 426 | at->clone.head = &head->clone; |
461 | less->more = at; less = at; |
| 427 | prev->more = at; |
|
|
| 428 | prev->clone.more = &at->clone; |
|
|
| 429 | |
|
|
| 430 | prev = at; |
|
|
| 431 | } |
462 | } |
| 432 | |
463 | |
| 433 | loading_arch = false; |
464 | // now activate it |
|
|
465 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
|
|
466 | { |
|
|
467 | archetype *at = *p; |
|
|
468 | at->stub = false; |
|
|
469 | at->link (); |
|
|
470 | } |
|
|
471 | |
| 434 | return head; |
472 | return new_head; |
| 435 | } |
473 | } |
| 436 | |
474 | |
| 437 | fail: |
475 | fail: |
| 438 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
476 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
| 439 | p->second->destroy (true); |
477 | (*p)->destroy (true); |
| 440 | |
478 | |
| 441 | loading_arch = false; |
479 | loading_arch = false; |
| 442 | return 0; |
480 | return 0; |
| 443 | } |
481 | } |
| 444 | |
482 | |
| … | |
… | |
| 466 | { |
504 | { |
| 467 | LOG (llevError, "Couldn't find archetype.\n"); |
505 | LOG (llevError, "Couldn't find archetype.\n"); |
| 468 | return 0; |
506 | return 0; |
| 469 | } |
507 | } |
| 470 | |
508 | |
| 471 | object *op = at->clone.clone (); |
509 | object *op = at->clone (); |
| 472 | op->arch = at; |
510 | op->arch = at; |
| 473 | op->instantiate (); |
511 | op->instantiate (); |
| 474 | |
512 | |
| 475 | return op; |
513 | return op; |
| 476 | } |
514 | } |
| … | |
… | |
| 508 | |
546 | |
| 509 | return arch_to_object (at); |
547 | return arch_to_object (at); |
| 510 | } |
548 | } |
| 511 | |
549 | |
| 512 | /* |
550 | /* |
| 513 | * Finds, using the hashtable, which archetype matches the given name. |
|
|
| 514 | * returns a pointer to the found archetype, otherwise NULL. |
|
|
| 515 | */ |
|
|
| 516 | archetype * |
|
|
| 517 | archetype::find (const char *name) |
|
|
| 518 | { |
|
|
| 519 | if (!name) |
|
|
| 520 | return 0; |
|
|
| 521 | |
|
|
| 522 | auto (i, ht.find (name)); |
|
|
| 523 | |
|
|
| 524 | if (i == ht.end ()) |
|
|
| 525 | return 0; |
|
|
| 526 | else |
|
|
| 527 | return i->second; |
|
|
| 528 | } |
|
|
| 529 | |
|
|
| 530 | archetype * |
|
|
| 531 | archetype::get (const char *name) |
|
|
| 532 | { |
|
|
| 533 | if (!name) |
|
|
| 534 | { |
|
|
| 535 | LOG (llevError, "null archetype requested\n"); |
|
|
| 536 | name = "(null)"; |
|
|
| 537 | } |
|
|
| 538 | |
|
|
| 539 | archetype *at = find (name); |
|
|
| 540 | |
|
|
| 541 | if (!at) |
|
|
| 542 | { |
|
|
| 543 | archetypes.insert (at = new archetype); |
|
|
| 544 | at->archname = at->clone.name = at->clone.name_pl = name; |
|
|
| 545 | at->hash_add (); |
|
|
| 546 | } |
|
|
| 547 | |
|
|
| 548 | return at; |
|
|
| 549 | } |
|
|
| 550 | |
|
|
| 551 | /* |
|
|
| 552 | * Adds an archetype to the hashtable. |
|
|
| 553 | */ |
|
|
| 554 | void |
|
|
| 555 | archetype::hash_add () |
|
|
| 556 | { |
|
|
| 557 | ht.insert (std::make_pair (archname, this)); |
|
|
| 558 | } |
|
|
| 559 | |
|
|
| 560 | void |
|
|
| 561 | archetype::hash_del () |
|
|
| 562 | { |
|
|
| 563 | ht.erase (archname); |
|
|
| 564 | } |
|
|
| 565 | |
|
|
| 566 | /* |
|
|
| 567 | * Returns the first archetype using the given type. |
551 | * Returns the first archetype using the given type. |
| 568 | * Used in treasure-generation. |
552 | * Used in treasure-generation. |
| 569 | */ |
553 | */ |
| 570 | archetype * |
554 | archetype * |
| 571 | type_to_archetype (int type) |
555 | type_to_archetype (int type) |
| 572 | { |
556 | { |
| 573 | for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more) |
557 | for_all_archetypes (at) |
| 574 | if (at->clone.type == type) |
558 | if (at->type == type && at->head_ () != at) |
| 575 | return at; |
559 | return at; |
| 576 | |
560 | |
| 577 | return 0; |
561 | return 0; |
| 578 | } |
562 | } |
| 579 | |
563 | |
| … | |
… | |
| 591 | { |
575 | { |
| 592 | LOG (llevError, "Can't clone archetype %d\n", type); |
576 | LOG (llevError, "Can't clone archetype %d\n", type); |
| 593 | return 0; |
577 | return 0; |
| 594 | } |
578 | } |
| 595 | |
579 | |
| 596 | object *op = at->clone.clone (); |
580 | object *op = at->clone (); |
| 597 | op->instantiate (); |
581 | op->instantiate (); |
| 598 | return op; |
582 | return op; |
| 599 | } |
583 | } |
| 600 | |
584 | |
| 601 | /* |
585 | /* |
| 602 | * member: make instance from class |
586 | * member: make instance from class |
| 603 | */ |
587 | */ |
| 604 | |
|
|
| 605 | object * |
588 | object * |
| 606 | object_create_arch (archetype *at) |
589 | object_create_arch (archetype *at) |
| 607 | { |
590 | { |
| 608 | object *op, *prev = 0, *head = 0; |
591 | object *op, *prev = 0, *head = 0; |
| 609 | |
592 | |
| 610 | while (at) |
593 | while (at) |
| 611 | { |
594 | { |
| 612 | op = arch_to_object (at); |
595 | op = arch_to_object (at); |
|
|
596 | |
| 613 | op->x = at->clone.x; |
597 | op->x = at->x; |
| 614 | op->y = at->clone.y; |
598 | op->y = at->y; |
| 615 | |
599 | |
| 616 | if (head) |
600 | if (head) |
| 617 | op->head = head, prev->more = op; |
601 | op->head = head, prev->more = op; |
| 618 | |
602 | |
| 619 | if (!head) |
603 | if (!head) |
| 620 | head = op; |
604 | head = op; |
| 621 | |
605 | |
| 622 | prev = op; |
606 | prev = op; |
| 623 | at = at->more; |
607 | at = (archetype *)at->more; |
| 624 | } |
608 | } |
| 625 | |
609 | |
| 626 | return (head); |
610 | return head; |
| 627 | } |
611 | } |
| 628 | |
612 | |
