1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
3 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | |
21 | * |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
25 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
25 | sub/add_weight will transcend the environment updating the carrying |
26 | sub/add_weight will transcend the environment updating the carrying |
26 | variable. */ |
27 | variable. */ |
27 | #include <global.h> |
28 | #include <global.h> |
… | |
… | |
36 | |
37 | |
37 | int nrofallocobjects = 0; |
38 | int nrofallocobjects = 0; |
38 | static UUID uuid; |
39 | static UUID uuid; |
39 | const uint64 UUID_SKIP = 1<<19; |
40 | const uint64 UUID_SKIP = 1<<19; |
40 | |
41 | |
41 | object *active_objects; /* List of active objects that need to be processed */ |
42 | objectvec objects; |
|
|
43 | activevec actives; |
42 | |
44 | |
43 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
45 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
44 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
46 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
45 | }; |
47 | }; |
46 | short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
48 | short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
… | |
… | |
190 | * Check nrof variable *before* calling can_merge() |
192 | * Check nrof variable *before* calling can_merge() |
191 | * |
193 | * |
192 | * Improvements made with merge: Better checking on potion, and also |
194 | * Improvements made with merge: Better checking on potion, and also |
193 | * check weight |
195 | * check weight |
194 | */ |
196 | */ |
195 | |
|
|
196 | bool object::can_merge_slow (object *ob1, object *ob2) |
197 | bool object::can_merge_slow (object *ob1, object *ob2) |
197 | { |
198 | { |
198 | /* A couple quicksanity checks */ |
199 | /* A couple quicksanity checks */ |
199 | if (ob1 == ob2 |
200 | if (ob1 == ob2 |
200 | || ob1->type != ob2->type |
201 | || ob1->type != ob2->type |
… | |
… | |
277 | |
278 | |
278 | /* Note sure why the following is the case - either the object has to |
279 | /* Note sure why the following is the case - either the object has to |
279 | * be animated or have a very low speed. Is this an attempted monster |
280 | * be animated or have a very low speed. Is this an attempted monster |
280 | * check? |
281 | * check? |
281 | */ |
282 | */ |
282 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED) |
283 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ()) |
283 | return 0; |
284 | return 0; |
284 | |
285 | |
285 | switch (ob1->type) |
286 | switch (ob1->type) |
286 | { |
287 | { |
287 | case SCROLL: |
288 | case SCROLL: |
… | |
… | |
356 | /* |
357 | /* |
357 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
358 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
358 | * Some error messages. |
359 | * Some error messages. |
359 | * The result of the dump is stored in the static global errmsg array. |
360 | * The result of the dump is stored in the static global errmsg array. |
360 | */ |
361 | */ |
361 | |
|
|
362 | char * |
362 | char * |
363 | dump_object (object *op) |
363 | dump_object (object *op) |
364 | { |
364 | { |
365 | if (!op) |
365 | if (!op) |
366 | return strdup ("[NULLOBJ]"); |
366 | return strdup ("[NULLOBJ]"); |
367 | |
367 | |
368 | object_freezer freezer; |
368 | object_freezer freezer; |
369 | save_object (freezer, op, 1); |
369 | op->write (freezer); |
370 | return freezer.as_string (); |
370 | return freezer.as_string (); |
371 | } |
371 | } |
372 | |
372 | |
373 | /* |
373 | /* |
374 | * get_nearest_part(multi-object, object 2) returns the part of the |
374 | * get_nearest_part(multi-object, object 2) returns the part of the |
… | |
… | |
391 | } |
391 | } |
392 | |
392 | |
393 | /* |
393 | /* |
394 | * Returns the object which has the count-variable equal to the argument. |
394 | * Returns the object which has the count-variable equal to the argument. |
395 | */ |
395 | */ |
396 | |
|
|
397 | object * |
396 | object * |
398 | find_object (tag_t i) |
397 | find_object (tag_t i) |
399 | { |
398 | { |
400 | for (object *op = object::first; op; op = op->next) |
399 | for_all_objects (op) |
401 | if (op->count == i) |
400 | if (op->count == i) |
402 | return op; |
401 | return op; |
403 | |
402 | |
404 | return 0; |
403 | return 0; |
405 | } |
404 | } |
406 | |
405 | |
407 | /* |
406 | /* |
408 | * Returns the first object which has a name equal to the argument. |
407 | * Returns the first object which has a name equal to the argument. |
409 | * Used only by the patch command, but not all that useful. |
408 | * Used only by the patch command, but not all that useful. |
410 | * Enables features like "patch <name-of-other-player> food 999" |
409 | * Enables features like "patch <name-of-other-player> food 999" |
411 | */ |
410 | */ |
412 | |
|
|
413 | object * |
411 | object * |
414 | find_object_name (const char *str) |
412 | find_object_name (const char *str) |
415 | { |
413 | { |
416 | shstr_cmp str_ (str); |
414 | shstr_cmp str_ (str); |
417 | object *op; |
415 | object *op; |
418 | |
416 | |
419 | for (op = object::first; op != NULL; op = op->next) |
417 | for_all_objects (op) |
420 | if (op->name == str_) |
418 | if (op->name == str_) |
421 | break; |
419 | break; |
422 | |
420 | |
423 | return op; |
421 | return op; |
424 | } |
422 | } |
… | |
… | |
456 | * refcounts and freeing the links. |
454 | * refcounts and freeing the links. |
457 | */ |
455 | */ |
458 | static void |
456 | static void |
459 | free_key_values (object *op) |
457 | free_key_values (object *op) |
460 | { |
458 | { |
461 | for (key_value *i = op->key_values; i != 0;) |
459 | for (key_value *i = op->key_values; i; ) |
462 | { |
460 | { |
463 | key_value *next = i->next; |
461 | key_value *next = i->next; |
464 | delete i; |
462 | delete i; |
465 | |
463 | |
466 | i = next; |
464 | i = next; |
467 | } |
465 | } |
468 | |
466 | |
469 | op->key_values = 0; |
467 | op->key_values = 0; |
470 | } |
468 | } |
471 | |
469 | |
472 | /* |
470 | object & |
473 | * copy_to first frees everything allocated by the dst object, |
471 | object::operator =(const object &src) |
474 | * and then copies the contents of itself into the second |
|
|
475 | * object, allocating what needs to be allocated. Basically, any |
|
|
476 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
477 | * if the first object is freed, the pointers in the new object |
|
|
478 | * will point at garbage. |
|
|
479 | */ |
|
|
480 | void |
|
|
481 | object::copy_to (object *dst) |
|
|
482 | { |
472 | { |
483 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
473 | bool is_freed = flag [FLAG_FREED]; |
484 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
474 | bool is_removed = flag [FLAG_REMOVED]; |
485 | |
475 | |
486 | *(object_copy *)dst = *this; |
476 | *(object_copy *)this = src; |
487 | |
477 | |
488 | if (is_freed) |
478 | flag [FLAG_FREED] = is_freed; |
489 | SET_FLAG (dst, FLAG_FREED); |
479 | flag [FLAG_REMOVED] = is_removed; |
490 | |
|
|
491 | if (is_removed) |
|
|
492 | SET_FLAG (dst, FLAG_REMOVED); |
|
|
493 | |
|
|
494 | if (speed < 0) |
|
|
495 | dst->speed_left = speed_left - RANDOM () % 200 / 100.0; |
|
|
496 | |
480 | |
497 | /* Copy over key_values, if any. */ |
481 | /* Copy over key_values, if any. */ |
498 | if (key_values) |
482 | if (src.key_values) |
499 | { |
483 | { |
500 | key_value *tail = 0; |
484 | key_value *tail = 0; |
501 | key_value *i; |
|
|
502 | |
|
|
503 | dst->key_values = 0; |
485 | key_values = 0; |
504 | |
486 | |
505 | for (i = key_values; i; i = i->next) |
487 | for (key_value *i = src.key_values; i; i = i->next) |
506 | { |
488 | { |
507 | key_value *new_link = new key_value; |
489 | key_value *new_link = new key_value; |
508 | |
490 | |
509 | new_link->next = 0; |
491 | new_link->next = 0; |
510 | new_link->key = i->key; |
492 | new_link->key = i->key; |
511 | new_link->value = i->value; |
493 | new_link->value = i->value; |
512 | |
494 | |
513 | /* Try and be clever here, too. */ |
495 | /* Try and be clever here, too. */ |
514 | if (!dst->key_values) |
496 | if (!key_values) |
515 | { |
497 | { |
516 | dst->key_values = new_link; |
498 | key_values = new_link; |
517 | tail = new_link; |
499 | tail = new_link; |
518 | } |
500 | } |
519 | else |
501 | else |
520 | { |
502 | { |
521 | tail->next = new_link; |
503 | tail->next = new_link; |
522 | tail = new_link; |
504 | tail = new_link; |
523 | } |
505 | } |
524 | } |
506 | } |
525 | } |
507 | } |
|
|
508 | } |
|
|
509 | |
|
|
510 | /* |
|
|
511 | * copy_to first frees everything allocated by the dst object, |
|
|
512 | * and then copies the contents of itself into the second |
|
|
513 | * object, allocating what needs to be allocated. Basically, any |
|
|
514 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
515 | * if the first object is freed, the pointers in the new object |
|
|
516 | * will point at garbage. |
|
|
517 | */ |
|
|
518 | void |
|
|
519 | object::copy_to (object *dst) |
|
|
520 | { |
|
|
521 | *dst = *this; |
|
|
522 | |
|
|
523 | if (speed < 0) |
|
|
524 | dst->speed_left = speed_left - rndm (); |
526 | |
525 | |
527 | dst->set_speed (dst->speed); |
526 | dst->set_speed (dst->speed); |
|
|
527 | } |
|
|
528 | |
|
|
529 | void |
|
|
530 | object::instantiate () |
|
|
531 | { |
|
|
532 | if (!uuid.seq) // HACK |
|
|
533 | uuid = gen_uuid (); |
|
|
534 | |
|
|
535 | speed_left = -0.1f; |
|
|
536 | /* copy the body_info to the body_used - this is only really |
|
|
537 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
538 | * by doing so, when a monster is created, it has good starting |
|
|
539 | * values for the body_used info, so when items are created |
|
|
540 | * for it, they can be properly equipped. |
|
|
541 | */ |
|
|
542 | memcpy (body_used, body_info, sizeof (body_used)); |
|
|
543 | |
|
|
544 | attachable::instantiate (); |
528 | } |
545 | } |
529 | |
546 | |
530 | object * |
547 | object * |
531 | object::clone () |
548 | object::clone () |
532 | { |
549 | { |
… | |
… | |
538 | /* |
555 | /* |
539 | * If an object with the IS_TURNABLE() flag needs to be turned due |
556 | * If an object with the IS_TURNABLE() flag needs to be turned due |
540 | * to the closest player being on the other side, this function can |
557 | * to the closest player being on the other side, this function can |
541 | * be called to update the face variable, _and_ how it looks on the map. |
558 | * be called to update the face variable, _and_ how it looks on the map. |
542 | */ |
559 | */ |
543 | |
|
|
544 | void |
560 | void |
545 | update_turn_face (object *op) |
561 | update_turn_face (object *op) |
546 | { |
562 | { |
547 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL) |
563 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch) |
548 | return; |
564 | return; |
|
|
565 | |
549 | SET_ANIMATION (op, op->direction); |
566 | SET_ANIMATION (op, op->direction); |
550 | update_object (op, UP_OBJ_FACE); |
567 | update_object (op, UP_OBJ_FACE); |
551 | } |
568 | } |
552 | |
569 | |
553 | /* |
570 | /* |
… | |
… | |
556 | * This function needs to be called whenever the speed of an object changes. |
573 | * This function needs to be called whenever the speed of an object changes. |
557 | */ |
574 | */ |
558 | void |
575 | void |
559 | object::set_speed (float speed) |
576 | object::set_speed (float speed) |
560 | { |
577 | { |
561 | extern int arch_init; |
|
|
562 | |
|
|
563 | /* No reason putting the archetypes objects on the speed list, |
|
|
564 | * since they never really need to be updated. |
|
|
565 | */ |
|
|
566 | if (flag [FLAG_FREED] && speed) |
578 | if (flag [FLAG_FREED] && speed) |
567 | { |
579 | { |
568 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
580 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
569 | speed = 0; |
581 | speed = 0; |
570 | } |
582 | } |
571 | |
583 | |
572 | this->speed = speed; |
584 | this->speed = speed; |
573 | |
585 | |
574 | if (arch_init) |
586 | if (has_active_speed ()) |
575 | return; |
587 | activate (); |
576 | |
|
|
577 | if (FABS (speed) > MIN_ACTIVE_SPEED) |
|
|
578 | { |
|
|
579 | /* If already on active list, don't do anything */ |
|
|
580 | if (active_next || active_prev || this == active_objects) |
|
|
581 | return; |
|
|
582 | |
|
|
583 | /* process_events() expects us to insert the object at the beginning |
|
|
584 | * of the list. */ |
|
|
585 | active_next = active_objects; |
|
|
586 | |
|
|
587 | if (active_next) |
|
|
588 | active_next->active_prev = this; |
|
|
589 | |
|
|
590 | active_objects = this; |
|
|
591 | } |
|
|
592 | else |
588 | else |
593 | { |
589 | deactivate (); |
594 | /* If not on the active list, nothing needs to be done */ |
|
|
595 | if (!active_next && !active_prev && this != active_objects) |
|
|
596 | return; |
|
|
597 | |
|
|
598 | if (!active_prev) |
|
|
599 | { |
|
|
600 | active_objects = active_next; |
|
|
601 | |
|
|
602 | if (active_next) |
|
|
603 | active_next->active_prev = 0; |
|
|
604 | } |
|
|
605 | else |
|
|
606 | { |
|
|
607 | active_prev->active_next = active_next; |
|
|
608 | |
|
|
609 | if (active_next) |
|
|
610 | active_next->active_prev = active_prev; |
|
|
611 | } |
|
|
612 | |
|
|
613 | active_next = 0; |
|
|
614 | active_prev = 0; |
|
|
615 | } |
|
|
616 | } |
|
|
617 | |
|
|
618 | /* This function removes object 'op' from the list of active |
|
|
619 | * objects. |
|
|
620 | * This should only be used for style maps or other such |
|
|
621 | * reference maps where you don't want an object that isn't |
|
|
622 | * in play chewing up cpu time getting processed. |
|
|
623 | * The reverse of this is to call update_ob_speed, which |
|
|
624 | * will do the right thing based on the speed of the object. |
|
|
625 | */ |
|
|
626 | void |
|
|
627 | remove_from_active_list (object *op) |
|
|
628 | { |
|
|
629 | /* If not on the active list, nothing needs to be done */ |
|
|
630 | if (!op->active_next && !op->active_prev && op != active_objects) |
|
|
631 | return; |
|
|
632 | |
|
|
633 | if (op->active_prev == NULL) |
|
|
634 | { |
|
|
635 | active_objects = op->active_next; |
|
|
636 | if (op->active_next != NULL) |
|
|
637 | op->active_next->active_prev = NULL; |
|
|
638 | } |
|
|
639 | else |
|
|
640 | { |
|
|
641 | op->active_prev->active_next = op->active_next; |
|
|
642 | if (op->active_next) |
|
|
643 | op->active_next->active_prev = op->active_prev; |
|
|
644 | } |
|
|
645 | op->active_next = NULL; |
|
|
646 | op->active_prev = NULL; |
|
|
647 | } |
590 | } |
648 | |
591 | |
649 | /* |
592 | /* |
650 | * update_object() updates the the map. |
593 | * update_object() updates the the map. |
651 | * It takes into account invisible objects (and represent squares covered |
594 | * It takes into account invisible objects (and represent squares covered |
… | |
… | |
664 | * UP_OBJ_FACE: only the objects face has changed. |
607 | * UP_OBJ_FACE: only the objects face has changed. |
665 | */ |
608 | */ |
666 | void |
609 | void |
667 | update_object (object *op, int action) |
610 | update_object (object *op, int action) |
668 | { |
611 | { |
669 | MoveType move_on, move_off, move_block, move_slow; |
|
|
670 | |
|
|
671 | if (op == NULL) |
612 | if (op == NULL) |
672 | { |
613 | { |
673 | /* this should never happen */ |
614 | /* this should never happen */ |
674 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
615 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
675 | return; |
616 | return; |
… | |
… | |
699 | return; |
640 | return; |
700 | } |
641 | } |
701 | |
642 | |
702 | mapspace &m = op->ms (); |
643 | mapspace &m = op->ms (); |
703 | |
644 | |
704 | if (m.flags_ & P_NEED_UPDATE) |
645 | if (!(m.flags_ & P_UPTODATE)) |
705 | /* nop */; |
646 | /* nop */; |
706 | else if (action == UP_OBJ_INSERT) |
647 | else if (action == UP_OBJ_INSERT) |
707 | { |
648 | { |
708 | // this is likely overkill, TODO: revisit (schmorp) |
649 | // this is likely overkill, TODO: revisit (schmorp) |
709 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
650 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
… | |
… | |
718 | /* This isn't perfect, but I don't expect a lot of objects to |
659 | /* This isn't perfect, but I don't expect a lot of objects to |
719 | * to have move_allow right now. |
660 | * to have move_allow right now. |
720 | */ |
661 | */ |
721 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
662 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
722 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
663 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
723 | m.flags_ = P_NEED_UPDATE; |
664 | m.flags_ = 0; |
724 | } |
665 | } |
725 | /* if the object is being removed, we can't make intelligent |
666 | /* if the object is being removed, we can't make intelligent |
726 | * decisions, because remove_ob can't really pass the object |
667 | * decisions, because remove_ob can't really pass the object |
727 | * that is being removed. |
668 | * that is being removed. |
728 | */ |
669 | */ |
729 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
670 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
730 | m.flags_ = P_NEED_UPDATE; |
671 | m.flags_ = 0; |
731 | else if (action == UP_OBJ_FACE) |
672 | else if (action == UP_OBJ_FACE) |
732 | /* Nothing to do for that case */ ; |
673 | /* Nothing to do for that case */ ; |
733 | else |
674 | else |
734 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
675 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
735 | |
676 | |
736 | if (op->more) |
677 | if (op->more) |
737 | update_object (op->more, action); |
678 | update_object (op->more, action); |
738 | } |
679 | } |
739 | |
680 | |
740 | object::vector object::objects; // not yet used |
|
|
741 | object *object::first; |
|
|
742 | |
|
|
743 | object::object () |
681 | object::object () |
744 | { |
682 | { |
745 | SET_FLAG (this, FLAG_REMOVED); |
683 | SET_FLAG (this, FLAG_REMOVED); |
746 | |
684 | |
747 | expmul = 1.0; |
685 | expmul = 1.0; |
748 | face = blank_face; |
686 | face = blank_face; |
749 | } |
687 | } |
750 | |
688 | |
751 | object::~object () |
689 | object::~object () |
752 | { |
690 | { |
|
|
691 | unlink (); |
|
|
692 | |
753 | free_key_values (this); |
693 | free_key_values (this); |
754 | } |
694 | } |
755 | |
695 | |
|
|
696 | static int object_count; |
|
|
697 | |
756 | void object::link () |
698 | void object::link () |
757 | { |
699 | { |
758 | count = ++ob_count; |
700 | assert (!index);//D |
759 | uuid = gen_uuid (); |
701 | uuid = gen_uuid (); |
|
|
702 | count = ++object_count; |
760 | |
703 | |
761 | prev = 0; |
704 | refcnt_inc (); |
762 | next = object::first; |
705 | objects.insert (this); |
763 | |
|
|
764 | if (object::first) |
|
|
765 | object::first->prev = this; |
|
|
766 | |
|
|
767 | object::first = this; |
|
|
768 | } |
706 | } |
769 | |
707 | |
770 | void object::unlink () |
708 | void object::unlink () |
771 | { |
709 | { |
772 | if (this == object::first) |
710 | if (!index) |
773 | object::first = next; |
711 | return; |
774 | |
712 | |
775 | /* Remove this object from the list of used objects */ |
713 | objects.erase (this); |
776 | if (prev) prev->next = next; |
714 | refcnt_dec (); |
777 | if (next) next->prev = prev; |
715 | } |
778 | |
716 | |
779 | prev = 0; |
717 | void |
780 | next = 0; |
718 | object::activate () |
|
|
719 | { |
|
|
720 | /* If already on active list, don't do anything */ |
|
|
721 | if (active) |
|
|
722 | return; |
|
|
723 | |
|
|
724 | if (has_active_speed ()) |
|
|
725 | actives.insert (this); |
|
|
726 | } |
|
|
727 | |
|
|
728 | void |
|
|
729 | object::activate_recursive () |
|
|
730 | { |
|
|
731 | activate (); |
|
|
732 | |
|
|
733 | for (object *op = inv; op; op = op->below) |
|
|
734 | op->activate_recursive (); |
|
|
735 | } |
|
|
736 | |
|
|
737 | /* This function removes object 'op' from the list of active |
|
|
738 | * objects. |
|
|
739 | * This should only be used for style maps or other such |
|
|
740 | * reference maps where you don't want an object that isn't |
|
|
741 | * in play chewing up cpu time getting processed. |
|
|
742 | * The reverse of this is to call update_ob_speed, which |
|
|
743 | * will do the right thing based on the speed of the object. |
|
|
744 | */ |
|
|
745 | void |
|
|
746 | object::deactivate () |
|
|
747 | { |
|
|
748 | /* If not on the active list, nothing needs to be done */ |
|
|
749 | if (!active) |
|
|
750 | return; |
|
|
751 | |
|
|
752 | actives.erase (this); |
|
|
753 | } |
|
|
754 | |
|
|
755 | void |
|
|
756 | object::deactivate_recursive () |
|
|
757 | { |
|
|
758 | for (object *op = inv; op; op = op->below) |
|
|
759 | op->deactivate_recursive (); |
|
|
760 | |
|
|
761 | deactivate (); |
|
|
762 | } |
|
|
763 | |
|
|
764 | void |
|
|
765 | object::set_flag_inv (int flag, int value) |
|
|
766 | { |
|
|
767 | for (object *op = inv; op; op = op->below) |
|
|
768 | { |
|
|
769 | op->flag [flag] = value; |
|
|
770 | op->set_flag_inv (flag, value); |
|
|
771 | } |
|
|
772 | } |
|
|
773 | |
|
|
774 | /* |
|
|
775 | * Remove and free all objects in the inventory of the given object. |
|
|
776 | * object.c ? |
|
|
777 | */ |
|
|
778 | void |
|
|
779 | object::destroy_inv (bool drop_to_ground) |
|
|
780 | { |
|
|
781 | // need to check first, because the checks below might segfault |
|
|
782 | // as we might be on an invalid mapspace and crossfire code |
|
|
783 | // is too buggy to ensure that the inventory is empty. |
|
|
784 | // corollary: if you create arrows etc. with stuff in tis inventory, |
|
|
785 | // cf will crash below with off-map x and y |
|
|
786 | if (!inv) |
|
|
787 | return; |
|
|
788 | |
|
|
789 | /* Only if the space blocks everything do we not process - |
|
|
790 | * if some form of movement is allowed, let objects |
|
|
791 | * drop on that space. |
|
|
792 | */ |
|
|
793 | if (!drop_to_ground |
|
|
794 | || !map |
|
|
795 | || map->in_memory != MAP_IN_MEMORY |
|
|
796 | || map->nodrop |
|
|
797 | || ms ().move_block == MOVE_ALL) |
|
|
798 | { |
|
|
799 | while (inv) |
|
|
800 | { |
|
|
801 | inv->destroy_inv (drop_to_ground); |
|
|
802 | inv->destroy (); |
|
|
803 | } |
|
|
804 | } |
|
|
805 | else |
|
|
806 | { /* Put objects in inventory onto this space */ |
|
|
807 | while (inv) |
|
|
808 | { |
|
|
809 | object *op = inv; |
|
|
810 | |
|
|
811 | if (op->flag [FLAG_STARTEQUIP] |
|
|
812 | || op->flag [FLAG_NO_DROP] |
|
|
813 | || op->type == RUNE |
|
|
814 | || op->type == TRAP |
|
|
815 | || op->flag [FLAG_IS_A_TEMPLATE] |
|
|
816 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
|
|
817 | op->destroy (); |
|
|
818 | else |
|
|
819 | map->insert (op, x, y); |
|
|
820 | } |
|
|
821 | } |
781 | } |
822 | } |
782 | |
823 | |
783 | object *object::create () |
824 | object *object::create () |
784 | { |
825 | { |
785 | object *op = new object; |
826 | object *op = new object; |
… | |
… | |
794 | |
835 | |
795 | if (flag [FLAG_IS_LINKED]) |
836 | if (flag [FLAG_IS_LINKED]) |
796 | remove_button_link (this); |
837 | remove_button_link (this); |
797 | |
838 | |
798 | if (flag [FLAG_FRIENDLY]) |
839 | if (flag [FLAG_FRIENDLY]) |
|
|
840 | { |
799 | remove_friendly_object (this); |
841 | remove_friendly_object (this); |
|
|
842 | |
|
|
843 | if (type == GOLEM |
|
|
844 | && owner |
|
|
845 | && owner->type == PLAYER |
|
|
846 | && owner->contr->ranges[range_golem] == this) |
|
|
847 | owner->contr->ranges[range_golem] = 0; |
|
|
848 | } |
800 | |
849 | |
801 | if (!flag [FLAG_REMOVED]) |
850 | if (!flag [FLAG_REMOVED]) |
802 | remove (); |
851 | remove (); |
803 | |
852 | |
804 | if (flag [FLAG_FREED]) |
853 | destroy_inv (true); |
805 | return; |
854 | |
|
|
855 | deactivate (); |
|
|
856 | unlink (); |
806 | |
857 | |
807 | flag [FLAG_FREED] = 1; |
858 | flag [FLAG_FREED] = 1; |
808 | |
859 | |
809 | // hack to ensure that freed objects still have a valid map |
860 | // hack to ensure that freed objects still have a valid map |
810 | { |
861 | { |
… | |
… | |
816 | |
867 | |
817 | freed_map->name = "/internal/freed_objects_map"; |
868 | freed_map->name = "/internal/freed_objects_map"; |
818 | freed_map->width = 3; |
869 | freed_map->width = 3; |
819 | freed_map->height = 3; |
870 | freed_map->height = 3; |
820 | |
871 | |
821 | freed_map->allocate (); |
872 | freed_map->alloc (); |
|
|
873 | freed_map->in_memory = MAP_IN_MEMORY; |
822 | } |
874 | } |
823 | |
875 | |
824 | map = freed_map; |
876 | map = freed_map; |
825 | x = 1; |
877 | x = 1; |
826 | y = 1; |
878 | y = 1; |
827 | } |
879 | } |
828 | |
880 | |
829 | more = 0; |
|
|
830 | head = 0; |
881 | head = 0; |
831 | inv = 0; |
882 | |
|
|
883 | if (more) |
|
|
884 | { |
|
|
885 | more->destroy (); |
|
|
886 | more = 0; |
|
|
887 | } |
832 | |
888 | |
833 | // clear those pointers that likely might have circular references to us |
889 | // clear those pointers that likely might have circular references to us |
834 | owner = 0; |
890 | owner = 0; |
835 | enemy = 0; |
891 | enemy = 0; |
836 | attacked_by = 0; |
892 | attacked_by = 0; |
837 | |
|
|
838 | // only relevant for players(?), but make sure of it anyways |
|
|
839 | contr = 0; |
|
|
840 | |
|
|
841 | /* Remove object from the active list */ |
|
|
842 | set_speed (0); |
|
|
843 | |
|
|
844 | unlink (); |
|
|
845 | } |
|
|
846 | |
|
|
847 | /* |
|
|
848 | * Remove and free all objects in the inventory of the given object. |
|
|
849 | * object.c ? |
|
|
850 | */ |
|
|
851 | void |
|
|
852 | object::destroy_inv (bool drop_to_ground) |
|
|
853 | { |
|
|
854 | if (!inv) |
|
|
855 | return; |
|
|
856 | |
|
|
857 | /* Only if the space blocks everything do we not process - |
|
|
858 | * if some form of movement is allowed, let objects |
|
|
859 | * drop on that space. |
|
|
860 | */ |
|
|
861 | if (!drop_to_ground || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) |
|
|
862 | { |
|
|
863 | while (inv) |
|
|
864 | { |
|
|
865 | inv->destroy_inv (drop_to_ground); |
|
|
866 | inv->destroy (); |
|
|
867 | } |
|
|
868 | } |
|
|
869 | else |
|
|
870 | { /* Put objects in inventory onto this space */ |
|
|
871 | while (inv) |
|
|
872 | { |
|
|
873 | object *op = inv; |
|
|
874 | |
|
|
875 | if (op->flag [FLAG_STARTEQUIP] |
|
|
876 | || op->flag [FLAG_NO_DROP] |
|
|
877 | || op->type == RUNE |
|
|
878 | || op->type == TRAP |
|
|
879 | || op->flag [FLAG_IS_A_TEMPLATE]) |
|
|
880 | op->destroy (); |
|
|
881 | else |
|
|
882 | { |
|
|
883 | op->remove (); |
|
|
884 | op->x = x; |
|
|
885 | op->y = y; |
|
|
886 | insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */ |
|
|
887 | } |
|
|
888 | } |
|
|
889 | } |
|
|
890 | } |
893 | } |
891 | |
894 | |
892 | void |
895 | void |
893 | object::destroy (bool destroy_inventory) |
896 | object::destroy (bool destroy_inventory) |
894 | { |
897 | { |
895 | if (destroyed ()) |
898 | if (destroyed ()) |
896 | return; |
899 | return; |
897 | |
900 | |
898 | if (more) |
|
|
899 | { |
|
|
900 | //TODO: non-head objects must not have inventory |
|
|
901 | more->destroy (destroy_inventory); |
|
|
902 | more = 0; |
|
|
903 | } |
|
|
904 | |
|
|
905 | if (destroy_inventory) |
901 | if (destroy_inventory) |
906 | destroy_inv (true); |
902 | destroy_inv (false); |
907 | |
903 | |
908 | attachable::destroy (); |
904 | attachable::destroy (); |
909 | } |
905 | } |
910 | |
906 | |
911 | /* |
907 | /* |
… | |
… | |
929 | * This function removes the object op from the linked list of objects |
925 | * This function removes the object op from the linked list of objects |
930 | * which it is currently tied to. When this function is done, the |
926 | * which it is currently tied to. When this function is done, the |
931 | * object will have no environment. If the object previously had an |
927 | * object will have no environment. If the object previously had an |
932 | * environment, the x and y coordinates will be updated to |
928 | * environment, the x and y coordinates will be updated to |
933 | * the previous environment. |
929 | * the previous environment. |
934 | * Beware: This function is called from the editor as well! |
|
|
935 | */ |
930 | */ |
936 | void |
931 | void |
937 | object::remove () |
932 | object::do_remove () |
938 | { |
933 | { |
939 | object *tmp, *last = 0; |
934 | object *tmp, *last = 0; |
940 | object *otmp; |
935 | object *otmp; |
941 | |
936 | |
942 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
937 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
… | |
… | |
964 | * to save cpu time. |
959 | * to save cpu time. |
965 | */ |
960 | */ |
966 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
961 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
967 | otmp->update_stats (); |
962 | otmp->update_stats (); |
968 | |
963 | |
969 | if (above != NULL) |
964 | if (above) |
970 | above->below = below; |
965 | above->below = below; |
971 | else |
966 | else |
972 | env->inv = below; |
967 | env->inv = below; |
973 | |
968 | |
974 | if (below != NULL) |
969 | if (below) |
975 | below->above = above; |
970 | below->above = above; |
976 | |
971 | |
977 | /* we set up values so that it could be inserted into |
972 | /* we set up values so that it could be inserted into |
978 | * the map, but we don't actually do that - it is up |
973 | * the map, but we don't actually do that - it is up |
979 | * to the caller to decide what we want to do. |
974 | * to the caller to decide what we want to do. |
… | |
… | |
983 | above = 0, below = 0; |
978 | above = 0, below = 0; |
984 | env = 0; |
979 | env = 0; |
985 | } |
980 | } |
986 | else if (map) |
981 | else if (map) |
987 | { |
982 | { |
988 | /* Re did the following section of code - it looks like it had |
983 | if (type == PLAYER) |
989 | * lots of logic for things we no longer care about |
|
|
990 | */ |
984 | { |
|
|
985 | // leaving a spot always closes any open container on the ground |
|
|
986 | if (container && !container->env) |
|
|
987 | // this causes spurious floorbox updates, but it ensures |
|
|
988 | // that the CLOSE event is being sent. |
|
|
989 | close_container (); |
|
|
990 | |
|
|
991 | --map->players; |
|
|
992 | map->touch (); |
|
|
993 | } |
|
|
994 | |
|
|
995 | map->dirty = true; |
|
|
996 | mapspace &ms = this->ms (); |
991 | |
997 | |
992 | /* link the object above us */ |
998 | /* link the object above us */ |
993 | if (above) |
999 | if (above) |
994 | above->below = below; |
1000 | above->below = below; |
995 | else |
1001 | else |
996 | map->at (x, y).top = below; /* we were top, set new top */ |
1002 | ms.top = below; /* we were top, set new top */ |
997 | |
1003 | |
998 | /* Relink the object below us, if there is one */ |
1004 | /* Relink the object below us, if there is one */ |
999 | if (below) |
1005 | if (below) |
1000 | below->above = above; |
1006 | below->above = above; |
1001 | else |
1007 | else |
… | |
… | |
1003 | /* Nothing below, which means we need to relink map object for this space |
1009 | /* Nothing below, which means we need to relink map object for this space |
1004 | * use translated coordinates in case some oddness with map tiling is |
1010 | * use translated coordinates in case some oddness with map tiling is |
1005 | * evident |
1011 | * evident |
1006 | */ |
1012 | */ |
1007 | if (GET_MAP_OB (map, x, y) != this) |
1013 | if (GET_MAP_OB (map, x, y) != this) |
1008 | { |
|
|
1009 | char *dump = dump_object (this); |
|
|
1010 | LOG (llevError, |
|
|
1011 | "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump); |
1014 | LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ()); |
1012 | free (dump); |
|
|
1013 | dump = dump_object (GET_MAP_OB (map, x, y)); |
|
|
1014 | LOG (llevError, "%s\n", dump); |
|
|
1015 | free (dump); |
|
|
1016 | } |
|
|
1017 | |
1015 | |
1018 | map->at (x, y).bot = above; /* goes on above it. */ |
1016 | ms.bot = above; /* goes on above it. */ |
1019 | } |
1017 | } |
1020 | |
1018 | |
1021 | above = 0; |
1019 | above = 0; |
1022 | below = 0; |
1020 | below = 0; |
1023 | |
1021 | |
1024 | if (map->in_memory == MAP_SAVING) |
1022 | if (map->in_memory == MAP_SAVING) |
1025 | return; |
1023 | return; |
1026 | |
1024 | |
1027 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1025 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1028 | |
1026 | |
1029 | for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above) |
1027 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1030 | { |
1028 | { |
1031 | /* No point updating the players look faces if he is the object |
1029 | /* No point updating the players look faces if he is the object |
1032 | * being removed. |
1030 | * being removed. |
1033 | */ |
1031 | */ |
1034 | |
1032 | |
… | |
… | |
1046 | |
1044 | |
1047 | if (tmp->contr->ns) |
1045 | if (tmp->contr->ns) |
1048 | tmp->contr->ns->floorbox_update (); |
1046 | tmp->contr->ns->floorbox_update (); |
1049 | } |
1047 | } |
1050 | |
1048 | |
1051 | /* See if player moving off should effect something */ |
1049 | /* See if object moving off should effect something */ |
1052 | if (check_walk_off |
1050 | if (check_walk_off |
1053 | && ((move_type & tmp->move_off) |
1051 | && ((move_type & tmp->move_off) |
1054 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1052 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1055 | { |
1053 | { |
1056 | move_apply (tmp, this, 0); |
1054 | move_apply (tmp, this, 0); |
… | |
… | |
1058 | if (destroyed ()) |
1056 | if (destroyed ()) |
1059 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1057 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1060 | } |
1058 | } |
1061 | |
1059 | |
1062 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1060 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1063 | |
1061 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
1064 | if (tmp->above == tmp) |
1062 | if (tmp->above == tmp) |
1065 | tmp->above = 0; |
1063 | tmp->above = 0; |
1066 | |
1064 | |
1067 | last = tmp; |
1065 | last = tmp; |
1068 | } |
1066 | } |
1069 | |
1067 | |
1070 | /* last == NULL of there are no objects on this space */ |
1068 | /* last == NULL if there are no objects on this space */ |
|
|
1069 | //TODO: this makes little sense, why only update the topmost object? |
1071 | if (!last) |
1070 | if (!last) |
1072 | map->at (x, y).flags_ = P_NEED_UPDATE; |
1071 | map->at (x, y).flags_ = 0; |
1073 | else |
1072 | else |
1074 | update_object (last, UP_OBJ_REMOVE); |
1073 | update_object (last, UP_OBJ_REMOVE); |
1075 | |
1074 | |
1076 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1075 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1077 | update_all_los (map, x, y); |
1076 | update_all_los (map, x, y); |
… | |
… | |
1113 | } |
1112 | } |
1114 | |
1113 | |
1115 | return 0; |
1114 | return 0; |
1116 | } |
1115 | } |
1117 | |
1116 | |
|
|
1117 | void |
|
|
1118 | object::expand_tail () |
|
|
1119 | { |
|
|
1120 | if (more) |
|
|
1121 | return; |
|
|
1122 | |
|
|
1123 | object *prev = this; |
|
|
1124 | |
|
|
1125 | for (archetype *at = arch->more; at; at = at->more) |
|
|
1126 | { |
|
|
1127 | object *op = arch_to_object (at); |
|
|
1128 | |
|
|
1129 | op->name = name; |
|
|
1130 | op->name_pl = name_pl; |
|
|
1131 | op->title = title; |
|
|
1132 | |
|
|
1133 | op->head = this; |
|
|
1134 | prev->more = op; |
|
|
1135 | |
|
|
1136 | prev = op; |
|
|
1137 | } |
|
|
1138 | } |
|
|
1139 | |
1118 | /* |
1140 | /* |
1119 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1141 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1120 | * job preparing multi-part monsters |
1142 | * job preparing multi-part monsters. |
1121 | */ |
1143 | */ |
1122 | object * |
1144 | object * |
1123 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1145 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1124 | { |
1146 | { |
1125 | object *tmp; |
|
|
1126 | |
|
|
1127 | if (op->head) |
|
|
1128 | op = op->head; |
|
|
1129 | |
|
|
1130 | for (tmp = op; tmp; tmp = tmp->more) |
1147 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1131 | { |
1148 | { |
1132 | tmp->x = x + tmp->arch->clone.x; |
1149 | tmp->x = x + tmp->arch->clone.x; |
1133 | tmp->y = y + tmp->arch->clone.y; |
1150 | tmp->y = y + tmp->arch->clone.y; |
1134 | } |
1151 | } |
1135 | |
1152 | |
… | |
… | |
1157 | * just 'op' otherwise |
1174 | * just 'op' otherwise |
1158 | */ |
1175 | */ |
1159 | object * |
1176 | object * |
1160 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1177 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1161 | { |
1178 | { |
|
|
1179 | assert (!op->flag [FLAG_FREED]); |
|
|
1180 | |
1162 | object *tmp, *top, *floor = NULL; |
1181 | object *tmp, *top, *floor = NULL; |
1163 | sint16 x, y; |
|
|
1164 | |
1182 | |
1165 | if (QUERY_FLAG (op, FLAG_FREED)) |
1183 | op->remove (); |
1166 | { |
|
|
1167 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1168 | return NULL; |
|
|
1169 | } |
|
|
1170 | |
1184 | |
1171 | if (m == NULL) |
1185 | if (!m->active != !op->active) |
1172 | { |
1186 | if (m->active) |
1173 | char *dump = dump_object (op); |
1187 | op->activate_recursive (); |
1174 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1188 | else |
1175 | free (dump); |
1189 | op->deactivate_recursive (); |
1176 | return op; |
|
|
1177 | } |
|
|
1178 | |
1190 | |
1179 | if (out_of_map (m, op->x, op->y)) |
1191 | if (out_of_map (m, op->x, op->y)) |
1180 | { |
1192 | { |
1181 | char *dump = dump_object (op); |
|
|
1182 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1193 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
1183 | #ifdef MANY_CORES |
1194 | #ifdef MANY_CORES |
1184 | /* Better to catch this here, as otherwise the next use of this object |
1195 | /* Better to catch this here, as otherwise the next use of this object |
1185 | * is likely to cause a crash. Better to find out where it is getting |
1196 | * is likely to cause a crash. Better to find out where it is getting |
1186 | * improperly inserted. |
1197 | * improperly inserted. |
1187 | */ |
1198 | */ |
1188 | abort (); |
1199 | abort (); |
1189 | #endif |
1200 | #endif |
1190 | free (dump); |
|
|
1191 | return op; |
1201 | return op; |
1192 | } |
1202 | } |
1193 | |
1203 | |
1194 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1195 | { |
|
|
1196 | char *dump = dump_object (op); |
|
|
1197 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); |
|
|
1198 | free (dump); |
|
|
1199 | return op; |
|
|
1200 | } |
|
|
1201 | |
|
|
1202 | if (op->more) |
|
|
1203 | { |
|
|
1204 | /* The part may be on a different map. */ |
|
|
1205 | |
|
|
1206 | object *more = op->more; |
1204 | if (object *more = op->more) |
1207 | |
1205 | { |
1208 | /* We really need the caller to normalize coordinates - if |
|
|
1209 | * we set the map, that doesn't work if the location is within |
|
|
1210 | * a map and this is straddling an edge. So only if coordinate |
|
|
1211 | * is clear wrong do we normalize it. |
|
|
1212 | */ |
|
|
1213 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
|
|
1214 | more->map = get_map_from_coord (m, &more->x, &more->y); |
|
|
1215 | else if (!more->map) |
|
|
1216 | { |
|
|
1217 | /* For backwards compatibility - when not dealing with tiled maps, |
|
|
1218 | * more->map should always point to the parent. |
|
|
1219 | */ |
|
|
1220 | more->map = m; |
|
|
1221 | } |
|
|
1222 | |
|
|
1223 | if (insert_ob_in_map (more, more->map, originator, flag) == NULL) |
1206 | if (!insert_ob_in_map (more, m, originator, flag)) |
1224 | { |
1207 | { |
1225 | if (!op->head) |
1208 | if (!op->head) |
1226 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
1209 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
1227 | |
1210 | |
1228 | return 0; |
1211 | return 0; |
… | |
… | |
1233 | |
1216 | |
1234 | /* Ideally, the caller figures this out. However, it complicates a lot |
1217 | /* Ideally, the caller figures this out. However, it complicates a lot |
1235 | * of areas of callers (eg, anything that uses find_free_spot would now |
1218 | * of areas of callers (eg, anything that uses find_free_spot would now |
1236 | * need extra work |
1219 | * need extra work |
1237 | */ |
1220 | */ |
1238 | op->map = get_map_from_coord (m, &op->x, &op->y); |
1221 | if (!xy_normalise (m, op->x, op->y)) |
1239 | x = op->x; |
1222 | return 0; |
1240 | y = op->y; |
1223 | |
|
|
1224 | op->map = m; |
|
|
1225 | mapspace &ms = op->ms (); |
1241 | |
1226 | |
1242 | /* this has to be done after we translate the coordinates. |
1227 | /* this has to be done after we translate the coordinates. |
1243 | */ |
1228 | */ |
1244 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1229 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1245 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1230 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1246 | if (object::can_merge (op, tmp)) |
1231 | if (object::can_merge (op, tmp)) |
1247 | { |
1232 | { |
1248 | op->nrof += tmp->nrof; |
1233 | op->nrof += tmp->nrof; |
1249 | tmp->destroy (); |
1234 | tmp->destroy (); |
1250 | } |
1235 | } |
… | |
… | |
1267 | op->below = originator->below; |
1252 | op->below = originator->below; |
1268 | |
1253 | |
1269 | if (op->below) |
1254 | if (op->below) |
1270 | op->below->above = op; |
1255 | op->below->above = op; |
1271 | else |
1256 | else |
1272 | op->ms ().bot = op; |
1257 | ms.bot = op; |
1273 | |
1258 | |
1274 | /* since *below* originator, no need to update top */ |
1259 | /* since *below* originator, no need to update top */ |
1275 | originator->below = op; |
1260 | originator->below = op; |
1276 | } |
1261 | } |
1277 | else |
1262 | else |
1278 | { |
1263 | { |
|
|
1264 | top = ms.bot; |
|
|
1265 | |
1279 | /* If there are other objects, then */ |
1266 | /* If there are other objects, then */ |
1280 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1267 | if ((!(flag & INS_MAP_LOAD)) && top) |
1281 | { |
1268 | { |
1282 | object *last = NULL; |
1269 | object *last = 0; |
1283 | |
1270 | |
1284 | /* |
1271 | /* |
1285 | * If there are multiple objects on this space, we do some trickier handling. |
1272 | * If there are multiple objects on this space, we do some trickier handling. |
1286 | * We've already dealt with merging if appropriate. |
1273 | * We've already dealt with merging if appropriate. |
1287 | * Generally, we want to put the new object on top. But if |
1274 | * Generally, we want to put the new object on top. But if |
… | |
… | |
1291 | * once we get to them. This reduces the need to traverse over all of |
1278 | * once we get to them. This reduces the need to traverse over all of |
1292 | * them when adding another one - this saves quite a bit of cpu time |
1279 | * them when adding another one - this saves quite a bit of cpu time |
1293 | * when lots of spells are cast in one area. Currently, it is presumed |
1280 | * when lots of spells are cast in one area. Currently, it is presumed |
1294 | * that flying non pickable objects are spell objects. |
1281 | * that flying non pickable objects are spell objects. |
1295 | */ |
1282 | */ |
1296 | |
1283 | for (top = ms.bot; top; top = top->above) |
1297 | while (top != NULL) |
|
|
1298 | { |
1284 | { |
1299 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1285 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1300 | floor = top; |
1286 | floor = top; |
1301 | |
1287 | |
1302 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1288 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
… | |
… | |
1305 | top = top->below; |
1291 | top = top->below; |
1306 | break; |
1292 | break; |
1307 | } |
1293 | } |
1308 | |
1294 | |
1309 | last = top; |
1295 | last = top; |
1310 | top = top->above; |
|
|
1311 | } |
1296 | } |
1312 | |
1297 | |
1313 | /* Don't want top to be NULL, so set it to the last valid object */ |
1298 | /* Don't want top to be NULL, so set it to the last valid object */ |
1314 | top = last; |
1299 | top = last; |
1315 | |
1300 | |
… | |
… | |
1317 | * looks like instead of lots of conditions here. |
1302 | * looks like instead of lots of conditions here. |
1318 | * makes things faster, and effectively the same result. |
1303 | * makes things faster, and effectively the same result. |
1319 | */ |
1304 | */ |
1320 | |
1305 | |
1321 | /* Have object 'fall below' other objects that block view. |
1306 | /* Have object 'fall below' other objects that block view. |
1322 | * Unless those objects are exits, type 66 |
1307 | * Unless those objects are exits. |
1323 | * If INS_ON_TOP is used, don't do this processing |
1308 | * If INS_ON_TOP is used, don't do this processing |
1324 | * Need to find the object that in fact blocks view, otherwise |
1309 | * Need to find the object that in fact blocks view, otherwise |
1325 | * stacking is a bit odd. |
1310 | * stacking is a bit odd. |
1326 | */ |
1311 | */ |
1327 | if (!(flag & INS_ON_TOP) && |
1312 | if (!(flag & INS_ON_TOP) |
1328 | (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) |
1313 | && ms.flags () & P_BLOCKSVIEW |
|
|
1314 | && (op->face && !faces [op->face].visibility)) |
1329 | { |
1315 | { |
1330 | for (last = top; last != floor; last = last->below) |
1316 | for (last = top; last != floor; last = last->below) |
1331 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1317 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1332 | break; |
1318 | break; |
|
|
1319 | |
1333 | /* Check to see if we found the object that blocks view, |
1320 | /* Check to see if we found the object that blocks view, |
1334 | * and make sure we have a below pointer for it so that |
1321 | * and make sure we have a below pointer for it so that |
1335 | * we can get inserted below this one, which requires we |
1322 | * we can get inserted below this one, which requires we |
1336 | * set top to the object below us. |
1323 | * set top to the object below us. |
1337 | */ |
1324 | */ |
… | |
… | |
1339 | top = last->below; |
1326 | top = last->below; |
1340 | } |
1327 | } |
1341 | } /* If objects on this space */ |
1328 | } /* If objects on this space */ |
1342 | |
1329 | |
1343 | if (flag & INS_MAP_LOAD) |
1330 | if (flag & INS_MAP_LOAD) |
1344 | top = GET_MAP_TOP (op->map, op->x, op->y); |
1331 | top = ms.top; |
1345 | |
1332 | |
1346 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1333 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1347 | top = floor; |
1334 | top = floor; |
1348 | |
1335 | |
1349 | /* Top is the object that our object (op) is going to get inserted above. |
1336 | /* Top is the object that our object (op) is going to get inserted above. |
1350 | */ |
1337 | */ |
1351 | |
1338 | |
1352 | /* First object on this space */ |
1339 | /* First object on this space */ |
1353 | if (!top) |
1340 | if (!top) |
1354 | { |
1341 | { |
1355 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1342 | op->above = ms.bot; |
1356 | |
1343 | |
1357 | if (op->above) |
1344 | if (op->above) |
1358 | op->above->below = op; |
1345 | op->above->below = op; |
1359 | |
1346 | |
1360 | op->below = NULL; |
1347 | op->below = 0; |
1361 | op->ms ().bot = op; |
1348 | ms.bot = op; |
1362 | } |
1349 | } |
1363 | else |
1350 | else |
1364 | { /* get inserted into the stack above top */ |
1351 | { /* get inserted into the stack above top */ |
1365 | op->above = top->above; |
1352 | op->above = top->above; |
1366 | |
1353 | |
… | |
… | |
1369 | |
1356 | |
1370 | op->below = top; |
1357 | op->below = top; |
1371 | top->above = op; |
1358 | top->above = op; |
1372 | } |
1359 | } |
1373 | |
1360 | |
1374 | if (op->above == NULL) |
1361 | if (!op->above) |
1375 | op->ms ().top = op; |
1362 | ms.top = op; |
1376 | } /* else not INS_BELOW_ORIGINATOR */ |
1363 | } /* else not INS_BELOW_ORIGINATOR */ |
1377 | |
1364 | |
1378 | if (op->type == PLAYER) |
1365 | if (op->type == PLAYER) |
|
|
1366 | { |
1379 | op->contr->do_los = 1; |
1367 | op->contr->do_los = 1; |
|
|
1368 | ++op->map->players; |
|
|
1369 | op->map->touch (); |
|
|
1370 | } |
|
|
1371 | |
|
|
1372 | op->map->dirty = true; |
1380 | |
1373 | |
1381 | /* If we have a floor, we know the player, if any, will be above |
1374 | /* If we have a floor, we know the player, if any, will be above |
1382 | * it, so save a few ticks and start from there. |
1375 | * it, so save a few ticks and start from there. |
1383 | */ |
1376 | */ |
1384 | if (!(flag & INS_MAP_LOAD)) |
1377 | if (!(flag & INS_MAP_LOAD)) |
1385 | if (object *pl = op->ms ().player ()) |
1378 | if (object *pl = ms.player ()) |
1386 | if (pl->contr->ns) |
1379 | if (pl->contr->ns) |
1387 | pl->contr->ns->floorbox_update (); |
1380 | pl->contr->ns->floorbox_update (); |
1388 | |
1381 | |
1389 | /* If this object glows, it may affect lighting conditions that are |
1382 | /* If this object glows, it may affect lighting conditions that are |
1390 | * visible to others on this map. But update_all_los is really |
1383 | * visible to others on this map. But update_all_los is really |
1391 | * an inefficient way to do this, as it means los for all players |
1384 | * an inefficient way to do this, as it means los for all players |
1392 | * on the map will get recalculated. The players could very well |
1385 | * on the map will get recalculated. The players could very well |
1393 | * be far away from this change and not affected in any way - |
1386 | * be far away from this change and not affected in any way - |
1394 | * this should get redone to only look for players within range, |
1387 | * this should get redone to only look for players within range, |
1395 | * or just updating the P_NEED_UPDATE for spaces within this area |
1388 | * or just updating the P_UPTODATE for spaces within this area |
1396 | * of effect may be sufficient. |
1389 | * of effect may be sufficient. |
1397 | */ |
1390 | */ |
1398 | if (op->map->darkness && (op->glow_radius != 0)) |
1391 | if (op->map->darkness && (op->glow_radius != 0)) |
1399 | update_all_los (op->map, op->x, op->y); |
1392 | update_all_los (op->map, op->x, op->y); |
1400 | |
1393 | |
… | |
… | |
1438 | { |
1431 | { |
1439 | object *tmp, *tmp1; |
1432 | object *tmp, *tmp1; |
1440 | |
1433 | |
1441 | /* first search for itself and remove any old instances */ |
1434 | /* first search for itself and remove any old instances */ |
1442 | |
1435 | |
1443 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1436 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1444 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1437 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1445 | tmp->destroy (); |
1438 | tmp->destroy (); |
1446 | |
1439 | |
1447 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1440 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1448 | |
1441 | |
1449 | tmp1->x = op->x; |
1442 | tmp1->x = op->x; |
1450 | tmp1->y = op->y; |
1443 | tmp1->y = op->y; |
1451 | insert_ob_in_map (tmp1, op->map, op, 0); |
1444 | insert_ob_in_map (tmp1, op->map, op, 0); |
|
|
1445 | } |
|
|
1446 | |
|
|
1447 | object * |
|
|
1448 | object::insert_at (object *where, object *originator, int flags) |
|
|
1449 | { |
|
|
1450 | return where->map->insert (this, where->x, where->y, originator, flags); |
1452 | } |
1451 | } |
1453 | |
1452 | |
1454 | /* |
1453 | /* |
1455 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1454 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1456 | * is returned contains nr objects, and the remaining parts contains |
1455 | * is returned contains nr objects, and the remaining parts contains |
1457 | * the rest (or is removed and freed if that number is 0). |
1456 | * the rest (or is removed and freed if that number is 0). |
1458 | * On failure, NULL is returned, and the reason put into the |
1457 | * On failure, NULL is returned, and the reason put into the |
1459 | * global static errmsg array. |
1458 | * global static errmsg array. |
1460 | */ |
1459 | */ |
1461 | |
|
|
1462 | object * |
1460 | object * |
1463 | get_split_ob (object *orig_ob, uint32 nr) |
1461 | get_split_ob (object *orig_ob, uint32 nr) |
1464 | { |
1462 | { |
1465 | object *newob; |
1463 | object *newob; |
1466 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1464 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
… | |
… | |
1497 | * the amount of an object. If the amount reaches 0, the object |
1495 | * the amount of an object. If the amount reaches 0, the object |
1498 | * is subsequently removed and freed. |
1496 | * is subsequently removed and freed. |
1499 | * |
1497 | * |
1500 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1498 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1501 | */ |
1499 | */ |
1502 | |
|
|
1503 | object * |
1500 | object * |
1504 | decrease_ob_nr (object *op, uint32 i) |
1501 | decrease_ob_nr (object *op, uint32 i) |
1505 | { |
1502 | { |
1506 | object *tmp; |
1503 | object *tmp; |
1507 | |
1504 | |
… | |
… | |
1582 | |
1579 | |
1583 | /* |
1580 | /* |
1584 | * add_weight(object, weight) adds the specified weight to an object, |
1581 | * add_weight(object, weight) adds the specified weight to an object, |
1585 | * and also updates how much the environment(s) is/are carrying. |
1582 | * and also updates how much the environment(s) is/are carrying. |
1586 | */ |
1583 | */ |
1587 | |
|
|
1588 | void |
1584 | void |
1589 | add_weight (object *op, signed long weight) |
1585 | add_weight (object *op, signed long weight) |
1590 | { |
1586 | { |
1591 | while (op != NULL) |
1587 | while (op != NULL) |
1592 | { |
1588 | { |
… | |
… | |
1624 | * inside the object environment. |
1620 | * inside the object environment. |
1625 | * |
1621 | * |
1626 | * The function returns now pointer to inserted item, and return value can |
1622 | * The function returns now pointer to inserted item, and return value can |
1627 | * be != op, if items are merged. -Tero |
1623 | * be != op, if items are merged. -Tero |
1628 | */ |
1624 | */ |
1629 | |
|
|
1630 | object * |
1625 | object * |
1631 | object::insert (object *op) |
1626 | object::insert (object *op) |
1632 | { |
1627 | { |
1633 | object *tmp, *otmp; |
1628 | object *tmp, *otmp; |
1634 | |
1629 | |
… | |
… | |
1730 | * |
1725 | * |
1731 | * MSW 2001-07-08: Check all objects on space, not just those below |
1726 | * MSW 2001-07-08: Check all objects on space, not just those below |
1732 | * object being inserted. insert_ob_in_map may not put new objects |
1727 | * object being inserted. insert_ob_in_map may not put new objects |
1733 | * on top. |
1728 | * on top. |
1734 | */ |
1729 | */ |
1735 | |
|
|
1736 | int |
1730 | int |
1737 | check_move_on (object *op, object *originator) |
1731 | check_move_on (object *op, object *originator) |
1738 | { |
1732 | { |
1739 | object *tmp; |
1733 | object *tmp; |
1740 | maptile *m = op->map; |
1734 | maptile *m = op->map; |
… | |
… | |
1767 | |
1761 | |
1768 | /* The objects have to be checked from top to bottom. |
1762 | /* The objects have to be checked from top to bottom. |
1769 | * Hence, we first go to the top: |
1763 | * Hence, we first go to the top: |
1770 | */ |
1764 | */ |
1771 | |
1765 | |
1772 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above) |
1766 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
1773 | { |
1767 | { |
1774 | /* Trim the search when we find the first other spell effect |
1768 | /* Trim the search when we find the first other spell effect |
1775 | * this helps performance so that if a space has 50 spell objects, |
1769 | * this helps performance so that if a space has 50 spell objects, |
1776 | * we don't need to check all of them. |
1770 | * we don't need to check all of them. |
1777 | */ |
1771 | */ |
… | |
… | |
1795 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1789 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1796 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1790 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1797 | { |
1791 | { |
1798 | |
1792 | |
1799 | float |
1793 | float |
1800 | diff = tmp->move_slow_penalty * FABS (op->speed); |
1794 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1801 | |
1795 | |
1802 | if (op->type == PLAYER) |
1796 | if (op->type == PLAYER) |
1803 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1797 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1804 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1798 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1805 | diff /= 4.0; |
1799 | diff /= 4.0; |
… | |
… | |
1835 | * The first matching object is returned, or NULL if none. |
1829 | * The first matching object is returned, or NULL if none. |
1836 | */ |
1830 | */ |
1837 | object * |
1831 | object * |
1838 | present_arch (const archetype *at, maptile *m, int x, int y) |
1832 | present_arch (const archetype *at, maptile *m, int x, int y) |
1839 | { |
1833 | { |
1840 | if (m == NULL || out_of_map (m, x, y)) |
1834 | if (!m || out_of_map (m, x, y)) |
1841 | { |
1835 | { |
1842 | LOG (llevError, "Present_arch called outside map.\n"); |
1836 | LOG (llevError, "Present_arch called outside map.\n"); |
1843 | return NULL; |
1837 | return NULL; |
1844 | } |
1838 | } |
1845 | |
1839 | |
1846 | for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1840 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1847 | if (tmp->arch == at) |
1841 | if (tmp->arch == at) |
1848 | return tmp; |
1842 | return tmp; |
1849 | |
1843 | |
1850 | return NULL; |
1844 | return NULL; |
1851 | } |
1845 | } |
… | |
… | |
1862 | { |
1856 | { |
1863 | LOG (llevError, "Present called outside map.\n"); |
1857 | LOG (llevError, "Present called outside map.\n"); |
1864 | return NULL; |
1858 | return NULL; |
1865 | } |
1859 | } |
1866 | |
1860 | |
1867 | for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1861 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1868 | if (tmp->type == type) |
1862 | if (tmp->type == type) |
1869 | return tmp; |
1863 | return tmp; |
1870 | |
1864 | |
1871 | return NULL; |
1865 | return NULL; |
1872 | } |
1866 | } |
… | |
… | |
2012 | } |
2006 | } |
2013 | |
2007 | |
2014 | if (!index) |
2008 | if (!index) |
2015 | return -1; |
2009 | return -1; |
2016 | |
2010 | |
2017 | return altern[RANDOM () % index]; |
2011 | return altern [rndm (index)]; |
2018 | } |
2012 | } |
2019 | |
2013 | |
2020 | /* |
2014 | /* |
2021 | * find_first_free_spot(archetype, maptile, x, y) works like |
2015 | * find_first_free_spot(archetype, maptile, x, y) works like |
2022 | * find_free_spot(), but it will search max number of squares. |
2016 | * find_free_spot(), but it will search max number of squares. |
… | |
… | |
2043 | { |
2037 | { |
2044 | arr += begin; |
2038 | arr += begin; |
2045 | end -= begin; |
2039 | end -= begin; |
2046 | |
2040 | |
2047 | while (--end) |
2041 | while (--end) |
2048 | swap (arr [end], arr [RANDOM () % (end + 1)]); |
2042 | swap (arr [end], arr [rndm (end + 1)]); |
2049 | } |
2043 | } |
2050 | |
2044 | |
2051 | /* new function to make monster searching more efficient, and effective! |
2045 | /* new function to make monster searching more efficient, and effective! |
2052 | * This basically returns a randomized array (in the passed pointer) of |
2046 | * This basically returns a randomized array (in the passed pointer) of |
2053 | * the spaces to find monsters. In this way, it won't always look for |
2047 | * the spaces to find monsters. In this way, it won't always look for |
… | |
… | |
2187 | |
2181 | |
2188 | return 3; |
2182 | return 3; |
2189 | } |
2183 | } |
2190 | |
2184 | |
2191 | /* |
2185 | /* |
2192 | * absdir(int): Returns a number between 1 and 8, which represent |
|
|
2193 | * the "absolute" direction of a number (it actually takes care of |
|
|
2194 | * "overflow" in previous calculations of a direction). |
|
|
2195 | */ |
|
|
2196 | |
|
|
2197 | int |
|
|
2198 | absdir (int d) |
|
|
2199 | { |
|
|
2200 | while (d < 1) |
|
|
2201 | d += 8; |
|
|
2202 | |
|
|
2203 | while (d > 8) |
|
|
2204 | d -= 8; |
|
|
2205 | |
|
|
2206 | return d; |
|
|
2207 | } |
|
|
2208 | |
|
|
2209 | /* |
|
|
2210 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2186 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2211 | * between two directions (which are expected to be absolute (see absdir()) |
2187 | * between two directions (which are expected to be absolute (see absdir()) |
2212 | */ |
2188 | */ |
2213 | |
|
|
2214 | int |
2189 | int |
2215 | dirdiff (int dir1, int dir2) |
2190 | dirdiff (int dir1, int dir2) |
2216 | { |
2191 | { |
2217 | int d; |
2192 | int d; |
2218 | |
2193 | |
… | |
… | |
2384 | insert_ob_in_ob (object_create_clone (item), dst); |
2359 | insert_ob_in_ob (object_create_clone (item), dst); |
2385 | |
2360 | |
2386 | return dst; |
2361 | return dst; |
2387 | } |
2362 | } |
2388 | |
2363 | |
2389 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2390 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2391 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2392 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2393 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2394 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2395 | object * |
|
|
2396 | load_object_str (const char *obstr) |
|
|
2397 | { |
|
|
2398 | object *op; |
|
|
2399 | char filename[MAX_BUF]; |
|
|
2400 | |
|
|
2401 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2402 | |
|
|
2403 | FILE *tempfile = fopen (filename, "w"); |
|
|
2404 | |
|
|
2405 | if (tempfile == NULL) |
|
|
2406 | { |
|
|
2407 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2408 | return NULL; |
|
|
2409 | } |
|
|
2410 | |
|
|
2411 | fprintf (tempfile, obstr); |
|
|
2412 | fclose (tempfile); |
|
|
2413 | |
|
|
2414 | op = object::create (); |
|
|
2415 | |
|
|
2416 | object_thawer thawer (filename); |
|
|
2417 | |
|
|
2418 | if (thawer) |
|
|
2419 | load_object (thawer, op, 0); |
|
|
2420 | |
|
|
2421 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2422 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2423 | |
|
|
2424 | return op; |
|
|
2425 | } |
|
|
2426 | |
|
|
2427 | /* This returns the first object in who's inventory that |
2364 | /* This returns the first object in who's inventory that |
2428 | * has the same type and subtype match. |
2365 | * has the same type and subtype match. |
2429 | * returns NULL if no match. |
2366 | * returns NULL if no match. |
2430 | */ |
2367 | */ |
2431 | object * |
2368 | object * |
… | |
… | |
2484 | if (link->key == canonical_key) |
2421 | if (link->key == canonical_key) |
2485 | return link->value; |
2422 | return link->value; |
2486 | |
2423 | |
2487 | return 0; |
2424 | return 0; |
2488 | } |
2425 | } |
2489 | |
|
|
2490 | |
2426 | |
2491 | /* |
2427 | /* |
2492 | * Updates the canonical_key in op to value. |
2428 | * Updates the canonical_key in op to value. |
2493 | * |
2429 | * |
2494 | * canonical_key is a shared string (value doesn't have to be). |
2430 | * canonical_key is a shared string (value doesn't have to be). |
… | |
… | |
2597 | } |
2533 | } |
2598 | else |
2534 | else |
2599 | item = item->env; |
2535 | item = item->env; |
2600 | } |
2536 | } |
2601 | |
2537 | |
|
|
2538 | |
|
|
2539 | const char * |
|
|
2540 | object::flag_desc (char *desc, int len) const |
|
|
2541 | { |
|
|
2542 | char *p = desc; |
|
|
2543 | bool first = true; |
|
|
2544 | |
|
|
2545 | *p = 0; |
|
|
2546 | |
|
|
2547 | for (int i = 0; i < NUM_FLAGS; i++) |
|
|
2548 | { |
|
|
2549 | if (len <= 10) // magic constant! |
|
|
2550 | { |
|
|
2551 | snprintf (p, len, ",..."); |
|
|
2552 | break; |
|
|
2553 | } |
|
|
2554 | |
|
|
2555 | if (flag [i]) |
|
|
2556 | { |
|
|
2557 | int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i); |
|
|
2558 | len -= cnt; |
|
|
2559 | p += cnt; |
|
|
2560 | first = false; |
|
|
2561 | } |
|
|
2562 | } |
|
|
2563 | |
|
|
2564 | return desc; |
|
|
2565 | } |
|
|
2566 | |
2602 | // return a suitable string describing an objetc in enough detail to find it |
2567 | // return a suitable string describing an object in enough detail to find it |
2603 | const char * |
2568 | const char * |
2604 | object::debug_desc (char *info) const |
2569 | object::debug_desc (char *info) const |
2605 | { |
2570 | { |
|
|
2571 | char flagdesc[512]; |
2606 | char info2[256 * 3]; |
2572 | char info2[256 * 4]; |
2607 | char *p = info; |
2573 | char *p = info; |
2608 | |
2574 | |
2609 | p += snprintf (p, 256, "%d=\"%s%s%s\"", |
2575 | p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2610 | count, |
2576 | count, uuid.seq, |
2611 | &name, |
2577 | &name, |
2612 | title ? " " : "", |
2578 | title ? "\",title:\"" : "", |
2613 | title ? (const char *)title : ""); |
2579 | title ? (const char *)title : "", |
|
|
2580 | flag_desc (flagdesc, 512), type); |
2614 | |
2581 | |
2615 | if (env) |
2582 | if (env) |
2616 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2583 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2617 | |
2584 | |
2618 | if (map) |
2585 | if (map) |
2619 | p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y); |
2586 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2620 | |
2587 | |
2621 | return info; |
2588 | return info; |
2622 | } |
2589 | } |
2623 | |
2590 | |
2624 | const char * |
2591 | const char * |
2625 | object::debug_desc () const |
2592 | object::debug_desc () const |
2626 | { |
2593 | { |
2627 | static char info[256 * 3]; |
2594 | static char info[256 * 4]; |
2628 | return debug_desc (info); |
2595 | return debug_desc (info); |
2629 | } |
2596 | } |
2630 | |
2597 | |
|
|
2598 | const char * |
|
|
2599 | object::debug_desc2 () const |
|
|
2600 | { |
|
|
2601 | static char info[256 * 4]; |
|
|
2602 | return debug_desc (info); |
|
|
2603 | } |
|
|
2604 | |
|
|
2605 | struct region * |
|
|
2606 | object::region () const |
|
|
2607 | { |
|
|
2608 | return map ? map->region (x, y) |
|
|
2609 | : region::default_region (); |
|
|
2610 | } |
|
|
2611 | |
|
|
2612 | const materialtype_t * |
|
|
2613 | object::dominant_material () const |
|
|
2614 | { |
|
|
2615 | if (materialtype_t *mat = name_to_material (materialname)) |
|
|
2616 | return mat; |
|
|
2617 | |
|
|
2618 | // omfg this is slow, this has to be temporary :) |
|
|
2619 | shstr unknown ("unknown"); |
|
|
2620 | |
|
|
2621 | return name_to_material (unknown); |
|
|
2622 | } |
|
|
2623 | |
|
|
2624 | void |
|
|
2625 | object::open_container (object *new_container) |
|
|
2626 | { |
|
|
2627 | if (container == new_container) |
|
|
2628 | return; |
|
|
2629 | |
|
|
2630 | if (object *old_container = container) |
|
|
2631 | { |
|
|
2632 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
|
|
2633 | return; |
|
|
2634 | |
|
|
2635 | #if 0 |
|
|
2636 | // remove the "Close old_container" object. |
|
|
2637 | if (object *closer = old_container->inv) |
|
|
2638 | if (closer->type == CLOSE_CON) |
|
|
2639 | closer->destroy (); |
|
|
2640 | #endif |
|
|
2641 | |
|
|
2642 | old_container->flag [FLAG_APPLIED] = 0; |
|
|
2643 | container = 0; |
|
|
2644 | |
|
|
2645 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2646 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2647 | } |
|
|
2648 | |
|
|
2649 | if (new_container) |
|
|
2650 | { |
|
|
2651 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
|
|
2652 | return; |
|
|
2653 | |
|
|
2654 | // TODO: this does not seem to serve any purpose anymore? |
|
|
2655 | #if 0 |
|
|
2656 | // insert the "Close Container" object. |
|
|
2657 | if (archetype *closer = new_container->other_arch) |
|
|
2658 | { |
|
|
2659 | object *closer = arch_to_object (new_container->other_arch); |
|
|
2660 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
|
|
2661 | new_container->insert (closer); |
|
|
2662 | } |
|
|
2663 | #endif |
|
|
2664 | |
|
|
2665 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2666 | |
|
|
2667 | new_container->flag [FLAG_APPLIED] = 1; |
|
|
2668 | container = new_container; |
|
|
2669 | |
|
|
2670 | esrv_update_item (UPD_FLAGS, this, new_container); |
|
|
2671 | esrv_send_inventory (this, new_container); |
|
|
2672 | } |
|
|
2673 | } |
|
|
2674 | |
|
|
2675 | |