… | |
… | |
104 | _exit (1); |
104 | _exit (1); |
105 | } |
105 | } |
106 | |
106 | |
107 | uuid.seq = uid; |
107 | uuid.seq = uid; |
108 | write_uuid (); |
108 | write_uuid (); |
109 | LOG (llevDebug, "read UID: %lld\n", uid); |
109 | LOG (llevDebug, "read UID: %" PRId64 "\n", uid); |
110 | fclose (fp); |
110 | fclose (fp); |
111 | } |
111 | } |
112 | |
112 | |
113 | UUID |
113 | UUID |
114 | gen_uuid () |
114 | gen_uuid () |
… | |
… | |
374 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
374 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
375 | * Some error messages. |
375 | * Some error messages. |
376 | * The result of the dump is stored in the static global errmsg array. |
376 | * The result of the dump is stored in the static global errmsg array. |
377 | */ |
377 | */ |
378 | |
378 | |
379 | void |
379 | char * |
380 | dump_object2 (object *op) |
|
|
381 | { |
|
|
382 | errmsg[0] = 0; |
|
|
383 | return; |
|
|
384 | //TODO//D#d# |
|
|
385 | #if 0 |
|
|
386 | char *cp; |
|
|
387 | |
|
|
388 | /* object *tmp;*/ |
|
|
389 | |
|
|
390 | if (op->arch != NULL) |
|
|
391 | { |
|
|
392 | strcat (errmsg, "arch "); |
|
|
393 | strcat (errmsg, op->arch->name ? op->arch->name : "(null)"); |
|
|
394 | strcat (errmsg, "\n"); |
|
|
395 | if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL) |
|
|
396 | strcat (errmsg, cp); |
|
|
397 | # if 0 |
|
|
398 | /* Don't dump player diffs - they are too long, mostly meaningless, and |
|
|
399 | * will overflow the buffer. |
|
|
400 | * Changed so that we don't dump inventory either. This may |
|
|
401 | * also overflow the buffer. |
|
|
402 | */ |
|
|
403 | if (op->type != PLAYER && (cp = get_ob_diff (op, &empty_archetype->clone)) != NULL) |
|
|
404 | strcat (errmsg, cp); |
|
|
405 | for (tmp = op->inv; tmp; tmp = tmp->below) |
|
|
406 | dump_object2 (tmp); |
|
|
407 | # endif |
|
|
408 | strcat (errmsg, "end\n"); |
|
|
409 | } |
|
|
410 | else |
|
|
411 | { |
|
|
412 | strcat (errmsg, "Object "); |
|
|
413 | if (op->name == NULL) |
|
|
414 | strcat (errmsg, "(null)"); |
|
|
415 | else |
|
|
416 | strcat (errmsg, op->name); |
|
|
417 | strcat (errmsg, "\n"); |
|
|
418 | # if 0 |
|
|
419 | if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL) |
|
|
420 | strcat (errmsg, cp); |
|
|
421 | for (tmp = op->inv; tmp; tmp = tmp->below) |
|
|
422 | dump_object2 (tmp); |
|
|
423 | # endif |
|
|
424 | strcat (errmsg, "end\n"); |
|
|
425 | } |
|
|
426 | #endif |
|
|
427 | } |
|
|
428 | |
|
|
429 | /* |
|
|
430 | * Dumps an object. Returns output in the static global errmsg array. |
|
|
431 | */ |
|
|
432 | |
|
|
433 | void |
|
|
434 | dump_object (object *op) |
380 | dump_object (object *op) |
435 | { |
381 | { |
436 | if (op == NULL) |
382 | if (!op) |
437 | { |
383 | return strdup ("[NULLOBJ]"); |
438 | strcpy (errmsg, "[NULL pointer]"); |
|
|
439 | return; |
|
|
440 | } |
|
|
441 | errmsg[0] = '\0'; |
|
|
442 | dump_object2 (op); |
|
|
443 | } |
|
|
444 | |
384 | |
445 | void |
385 | object_freezer freezer; |
446 | dump_all_objects (void) |
386 | save_object (freezer, op, 3); |
447 | { |
387 | return freezer.as_string (); |
448 | object *op; |
|
|
449 | |
|
|
450 | for (op = object::first; op != NULL; op = op->next) |
|
|
451 | { |
|
|
452 | dump_object (op); |
|
|
453 | fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg); |
|
|
454 | } |
|
|
455 | } |
388 | } |
456 | |
389 | |
457 | /* |
390 | /* |
458 | * get_nearest_part(multi-object, object 2) returns the part of the |
391 | * get_nearest_part(multi-object, object 2) returns the part of the |
459 | * multi-object 1 which is closest to the second object. |
392 | * multi-object 1 which is closest to the second object. |
… | |
… | |
479 | */ |
412 | */ |
480 | |
413 | |
481 | object * |
414 | object * |
482 | find_object (tag_t i) |
415 | find_object (tag_t i) |
483 | { |
416 | { |
484 | object *op; |
|
|
485 | |
|
|
486 | for (op = object::first; op != NULL; op = op->next) |
417 | for (object *op = object::first; op; op = op->next) |
487 | if (op->count == i) |
418 | if (op->count == i) |
488 | break; |
419 | return op; |
|
|
420 | |
489 | return op; |
421 | return 0; |
490 | } |
422 | } |
491 | |
423 | |
492 | /* |
424 | /* |
493 | * Returns the first object which has a name equal to the argument. |
425 | * Returns the first object which has a name equal to the argument. |
494 | * Used only by the patch command, but not all that useful. |
426 | * Used only by the patch command, but not all that useful. |
… | |
… | |
594 | |
526 | |
595 | if (settings.casting_time) |
527 | if (settings.casting_time) |
596 | casting_time = -1; |
528 | casting_time = -1; |
597 | } |
529 | } |
598 | |
530 | |
599 | void object::clone (object *destination) |
|
|
600 | { |
|
|
601 | *(object_copy *)destination = *this; |
|
|
602 | *(object_pod *)destination = *this; |
|
|
603 | |
|
|
604 | if (self || cb) |
|
|
605 | INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination)); |
|
|
606 | } |
|
|
607 | |
|
|
608 | /* |
531 | /* |
609 | * copy object first frees everything allocated by the second object, |
532 | * copy_to first frees everything allocated by the dst object, |
610 | * and then copies the contends of the first object into the second |
533 | * and then copies the contents of itself into the second |
611 | * object, allocating what needs to be allocated. Basically, any |
534 | * object, allocating what needs to be allocated. Basically, any |
612 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
535 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
613 | * if the first object is freed, the pointers in the new object |
536 | * if the first object is freed, the pointers in the new object |
614 | * will point at garbage. |
537 | * will point at garbage. |
615 | */ |
538 | */ |
616 | void |
539 | void |
617 | copy_object (object *op2, object *op) |
540 | object::copy_to (object *dst) |
618 | { |
541 | { |
619 | bool is_freed = QUERY_FLAG (op, FLAG_FREED); |
542 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
620 | bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); |
543 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
621 | |
544 | |
622 | op2->clone (op); |
545 | *(object_copy *)dst = *this; |
|
|
546 | *(object_pod *)dst = *this; |
|
|
547 | |
|
|
548 | if (self || cb) |
|
|
549 | INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst)); |
623 | |
550 | |
624 | if (is_freed) |
551 | if (is_freed) |
625 | SET_FLAG (op, FLAG_FREED); |
552 | SET_FLAG (dst, FLAG_FREED); |
|
|
553 | |
626 | if (is_removed) |
554 | if (is_removed) |
627 | SET_FLAG (op, FLAG_REMOVED); |
555 | SET_FLAG (dst, FLAG_REMOVED); |
628 | |
556 | |
629 | if (op2->speed < 0) |
557 | if (speed < 0) |
630 | op->speed_left = op2->speed_left - RANDOM () % 200 / 100.0; |
558 | dst->speed_left = speed_left - RANDOM () % 200 / 100.0; |
631 | |
559 | |
632 | /* Copy over key_values, if any. */ |
560 | /* Copy over key_values, if any. */ |
633 | if (op2->key_values) |
561 | if (key_values) |
634 | { |
562 | { |
635 | key_value *tail = 0; |
563 | key_value *tail = 0; |
636 | key_value *i; |
564 | key_value *i; |
637 | |
565 | |
638 | op->key_values = 0; |
566 | dst->key_values = 0; |
639 | |
567 | |
640 | for (i = op2->key_values; i; i = i->next) |
568 | for (i = key_values; i; i = i->next) |
641 | { |
569 | { |
642 | key_value *new_link = new key_value; |
570 | key_value *new_link = new key_value; |
643 | |
571 | |
644 | new_link->next = 0; |
572 | new_link->next = 0; |
645 | new_link->key = i->key; |
573 | new_link->key = i->key; |
646 | new_link->value = i->value; |
574 | new_link->value = i->value; |
647 | |
575 | |
648 | /* Try and be clever here, too. */ |
576 | /* Try and be clever here, too. */ |
649 | if (!op->key_values) |
577 | if (!dst->key_values) |
650 | { |
578 | { |
651 | op->key_values = new_link; |
579 | dst->key_values = new_link; |
652 | tail = new_link; |
580 | tail = new_link; |
653 | } |
581 | } |
654 | else |
582 | else |
655 | { |
583 | { |
656 | tail->next = new_link; |
584 | tail->next = new_link; |
657 | tail = new_link; |
585 | tail = new_link; |
658 | } |
586 | } |
659 | } |
587 | } |
660 | } |
588 | } |
661 | |
589 | |
662 | update_ob_speed (op); |
590 | update_ob_speed (dst); |
663 | } |
591 | } |
664 | |
592 | |
665 | /* |
593 | /* |
666 | * If an object with the IS_TURNABLE() flag needs to be turned due |
594 | * If an object with the IS_TURNABLE() flag needs to be turned due |
667 | * to the closest player being on the other side, this function can |
595 | * to the closest player being on the other side, this function can |
… | |
… | |
872 | update_now = 1; |
800 | update_now = 1; |
873 | |
801 | |
874 | if ((move_slow | op->move_slow) != move_slow) |
802 | if ((move_slow | op->move_slow) != move_slow) |
875 | update_now = 1; |
803 | update_now = 1; |
876 | } |
804 | } |
|
|
805 | |
877 | /* if the object is being removed, we can't make intelligent |
806 | /* if the object is being removed, we can't make intelligent |
878 | * decisions, because remove_ob can't really pass the object |
807 | * decisions, because remove_ob can't really pass the object |
879 | * that is being removed. |
808 | * that is being removed. |
880 | */ |
809 | */ |
881 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
810 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
… | |
… | |
907 | else |
836 | else |
908 | { |
837 | { |
909 | delete *i; |
838 | delete *i; |
910 | mortals.erase (i); |
839 | mortals.erase (i); |
911 | } |
840 | } |
912 | |
|
|
913 | static int lastmortals = 0;//D |
|
|
914 | |
|
|
915 | if (mortals.size() != lastmortals)//D |
|
|
916 | { |
|
|
917 | lastmortals = mortals.size ();//D |
|
|
918 | LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D |
|
|
919 | } |
|
|
920 | } |
841 | } |
921 | |
842 | |
922 | object::object () |
843 | object::object () |
923 | { |
844 | { |
924 | SET_FLAG (this, FLAG_REMOVED); |
845 | SET_FLAG (this, FLAG_REMOVED); |
… | |
… | |
946 | object::first = this; |
867 | object::first = this; |
947 | } |
868 | } |
948 | |
869 | |
949 | void object::unlink () |
870 | void object::unlink () |
950 | { |
871 | { |
951 | //count = 0;//D |
|
|
952 | if (!prev && !next) return;//D |
|
|
953 | |
|
|
954 | if (this == object::first) |
872 | if (this == object::first) |
955 | object::first = next; |
873 | object::first = next; |
956 | |
874 | |
957 | /* Remove this object from the list of used objects */ |
875 | /* Remove this object from the list of used objects */ |
958 | if (prev) prev->next = next; |
876 | if (prev) prev->next = next; |
… | |
… | |
974 | * it from the list of used objects, and puts it on the list of |
892 | * it from the list of used objects, and puts it on the list of |
975 | * free objects. The IS_FREED() flag is set in the object. |
893 | * free objects. The IS_FREED() flag is set in the object. |
976 | * The object must have been removed by remove_ob() first for |
894 | * The object must have been removed by remove_ob() first for |
977 | * this function to succeed. |
895 | * this function to succeed. |
978 | * |
896 | * |
979 | * If free_inventory is set, free inventory as well. Else drop items in |
897 | * If destroy_inventory is set, free inventory as well. Else drop items in |
980 | * inventory to the ground. |
898 | * inventory to the ground. |
981 | */ |
899 | */ |
982 | void object::free (bool free_inventory) |
900 | void object::destroy (bool destroy_inventory) |
983 | { |
901 | { |
984 | if (QUERY_FLAG (this, FLAG_FREED)) |
902 | if (QUERY_FLAG (this, FLAG_FREED)) |
985 | return; |
903 | return; |
986 | |
904 | |
987 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
905 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
988 | remove_friendly_object (this); |
906 | remove_friendly_object (this); |
989 | |
907 | |
990 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
908 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
991 | remove_ob (this); |
909 | remove (); |
992 | |
910 | |
993 | SET_FLAG (this, FLAG_FREED); |
911 | SET_FLAG (this, FLAG_FREED); |
994 | |
912 | |
995 | if (more) |
913 | if (more) |
996 | { |
914 | { |
997 | more->free (free_inventory); |
915 | more->destroy (destroy_inventory); |
998 | more = 0; |
916 | more = 0; |
999 | } |
917 | } |
1000 | |
918 | |
1001 | if (inv) |
919 | if (inv) |
1002 | { |
920 | { |
1003 | /* Only if the space blocks everything do we not process - |
921 | /* Only if the space blocks everything do we not process - |
1004 | * if some form of movement is allowed, let objects |
922 | * if some form of movement is allowed, let objects |
1005 | * drop on that space. |
923 | * drop on that space. |
1006 | */ |
924 | */ |
1007 | if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) |
925 | if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) |
1008 | { |
926 | { |
1009 | object *op = inv; |
927 | object *op = inv; |
1010 | |
928 | |
1011 | while (op) |
929 | while (op) |
1012 | { |
930 | { |
1013 | object *tmp = op->below; |
931 | object *tmp = op->below; |
1014 | op->free (free_inventory); |
932 | op->destroy (destroy_inventory); |
1015 | op = tmp; |
933 | op = tmp; |
1016 | } |
934 | } |
1017 | } |
935 | } |
1018 | else |
936 | else |
1019 | { /* Put objects in inventory onto this space */ |
937 | { /* Put objects in inventory onto this space */ |
… | |
… | |
1021 | |
939 | |
1022 | while (op) |
940 | while (op) |
1023 | { |
941 | { |
1024 | object *tmp = op->below; |
942 | object *tmp = op->below; |
1025 | |
943 | |
1026 | remove_ob (op); |
944 | op->remove (); |
1027 | |
945 | |
1028 | if (QUERY_FLAG (op, FLAG_STARTEQUIP) |
946 | if (QUERY_FLAG (op, FLAG_STARTEQUIP) |
1029 | || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) |
947 | || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) |
1030 | free_object (op); |
948 | op->destroy (); |
1031 | else |
949 | else |
1032 | { |
950 | { |
1033 | op->x = x; |
951 | op->x = x; |
1034 | op->y = y; |
952 | op->y = y; |
1035 | insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */ |
953 | insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */ |
… | |
… | |
1038 | op = tmp; |
956 | op = tmp; |
1039 | } |
957 | } |
1040 | } |
958 | } |
1041 | } |
959 | } |
1042 | |
960 | |
|
|
961 | // hack to ensure that freed objects still have a valid map |
|
|
962 | { |
|
|
963 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
|
|
964 | |
|
|
965 | if (!freed_map) |
|
|
966 | { |
|
|
967 | freed_map = new maptile; |
|
|
968 | |
|
|
969 | freed_map->name = "/internal/freed_objects_map"; |
|
|
970 | freed_map->width = 3; |
|
|
971 | freed_map->height = 3; |
|
|
972 | |
|
|
973 | freed_map->allocate (); |
|
|
974 | } |
|
|
975 | |
|
|
976 | map = freed_map; |
|
|
977 | x = 1; |
|
|
978 | y = 1; |
|
|
979 | } |
|
|
980 | |
1043 | // clear those pointers that likely might have circular references to us |
981 | // clear those pointers that likely might have circular references to us |
1044 | owner = 0; |
982 | owner = 0; |
1045 | enemy = 0; |
983 | enemy = 0; |
1046 | attacked_by = 0; |
984 | attacked_by = 0; |
1047 | |
985 | |
|
|
986 | // only relevant for players(?), but make sure of it anyways |
|
|
987 | contr = 0; |
|
|
988 | |
1048 | /* Remove object from the active list */ |
989 | /* Remove object from the active list */ |
1049 | speed = 0; |
990 | speed = 0; |
1050 | update_ob_speed (this); |
991 | update_ob_speed (this); |
1051 | |
992 | |
1052 | unlink (); |
993 | unlink (); |
… | |
… | |
1056 | |
997 | |
1057 | /* |
998 | /* |
1058 | * sub_weight() recursively (outwards) subtracts a number from the |
999 | * sub_weight() recursively (outwards) subtracts a number from the |
1059 | * weight of an object (and what is carried by it's environment(s)). |
1000 | * weight of an object (and what is carried by it's environment(s)). |
1060 | */ |
1001 | */ |
1061 | |
|
|
1062 | void |
1002 | void |
1063 | sub_weight (object *op, signed long weight) |
1003 | sub_weight (object *op, signed long weight) |
1064 | { |
1004 | { |
1065 | while (op != NULL) |
1005 | while (op != NULL) |
1066 | { |
1006 | { |
… | |
… | |
1070 | op->carrying -= weight; |
1010 | op->carrying -= weight; |
1071 | op = op->env; |
1011 | op = op->env; |
1072 | } |
1012 | } |
1073 | } |
1013 | } |
1074 | |
1014 | |
1075 | /* remove_ob(op): |
1015 | /* op->remove (): |
1076 | * This function removes the object op from the linked list of objects |
1016 | * This function removes the object op from the linked list of objects |
1077 | * which it is currently tied to. When this function is done, the |
1017 | * which it is currently tied to. When this function is done, the |
1078 | * object will have no environment. If the object previously had an |
1018 | * object will have no environment. If the object previously had an |
1079 | * environment, the x and y coordinates will be updated to |
1019 | * environment, the x and y coordinates will be updated to |
1080 | * the previous environment. |
1020 | * the previous environment. |
1081 | * Beware: This function is called from the editor as well! |
1021 | * Beware: This function is called from the editor as well! |
1082 | */ |
1022 | */ |
1083 | |
|
|
1084 | void |
1023 | void |
1085 | remove_ob (object *op) |
1024 | object::remove () |
1086 | { |
1025 | { |
1087 | object *tmp, *last = 0; |
1026 | object *tmp, *last = 0; |
1088 | object *otmp; |
1027 | object *otmp; |
1089 | |
1028 | |
1090 | tag_t tag; |
|
|
1091 | int check_walk_off; |
1029 | int check_walk_off; |
1092 | mapstruct *m; |
|
|
1093 | |
1030 | |
1094 | sint16 x, y; |
|
|
1095 | |
|
|
1096 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1031 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
1097 | return; |
1032 | return; |
1098 | |
1033 | |
1099 | SET_FLAG (op, FLAG_REMOVED); |
1034 | SET_FLAG (this, FLAG_REMOVED); |
1100 | |
1035 | |
1101 | if (op->more != NULL) |
1036 | if (more) |
1102 | remove_ob (op->more); |
1037 | more->remove (); |
1103 | |
1038 | |
1104 | /* |
1039 | /* |
1105 | * In this case, the object to be removed is in someones |
1040 | * In this case, the object to be removed is in someones |
1106 | * inventory. |
1041 | * inventory. |
1107 | */ |
1042 | */ |
1108 | if (op->env != NULL) |
1043 | if (env) |
1109 | { |
1044 | { |
1110 | if (op->nrof) |
1045 | if (nrof) |
1111 | sub_weight (op->env, op->weight * op->nrof); |
1046 | sub_weight (env, weight * nrof); |
1112 | else |
1047 | else |
1113 | sub_weight (op->env, op->weight + op->carrying); |
1048 | sub_weight (env, weight + carrying); |
1114 | |
1049 | |
1115 | /* NO_FIX_PLAYER is set when a great many changes are being |
1050 | /* NO_FIX_PLAYER is set when a great many changes are being |
1116 | * made to players inventory. If set, avoiding the call |
1051 | * made to players inventory. If set, avoiding the call |
1117 | * to save cpu time. |
1052 | * to save cpu time. |
1118 | */ |
1053 | */ |
1119 | if ((otmp = is_player_inv (op->env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1054 | if ((otmp = is_player_inv (env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1120 | fix_player (otmp); |
1055 | fix_player (otmp); |
1121 | |
1056 | |
1122 | if (op->above != NULL) |
1057 | if (above != NULL) |
1123 | op->above->below = op->below; |
1058 | above->below = below; |
1124 | else |
1059 | else |
1125 | op->env->inv = op->below; |
1060 | env->inv = below; |
1126 | |
1061 | |
1127 | if (op->below != NULL) |
1062 | if (below != NULL) |
1128 | op->below->above = op->above; |
1063 | below->above = above; |
1129 | |
1064 | |
1130 | /* we set up values so that it could be inserted into |
1065 | /* we set up values so that it could be inserted into |
1131 | * the map, but we don't actually do that - it is up |
1066 | * the map, but we don't actually do that - it is up |
1132 | * to the caller to decide what we want to do. |
1067 | * to the caller to decide what we want to do. |
1133 | */ |
1068 | */ |
1134 | op->x = op->env->x, op->y = op->env->y; |
1069 | x = env->x, y = env->y; |
1135 | op->map = op->env->map; |
1070 | map = env->map; |
1136 | op->above = NULL, op->below = NULL; |
1071 | above = 0, below = 0; |
1137 | op->env = NULL; |
1072 | env = 0; |
1138 | } |
1073 | } |
1139 | else if (op->map) |
1074 | else if (map) |
1140 | { |
1075 | { |
1141 | x = op->x; |
|
|
1142 | y = op->y; |
|
|
1143 | m = get_map_from_coord (op->map, &x, &y); |
|
|
1144 | |
|
|
1145 | if (!m) |
|
|
1146 | { |
|
|
1147 | LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n", |
|
|
1148 | op->map->path, op->x, op->y); |
|
|
1149 | /* in old days, we used to set x and y to 0 and continue. |
|
|
1150 | * it seems if we get into this case, something is probablye |
|
|
1151 | * screwed up and should be fixed. |
|
|
1152 | */ |
|
|
1153 | abort (); |
|
|
1154 | } |
|
|
1155 | |
|
|
1156 | if (op->map != m) |
|
|
1157 | LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n", |
|
|
1158 | op->map->path, m->path, op->x, op->y, x, y); |
|
|
1159 | |
|
|
1160 | /* Re did the following section of code - it looks like it had |
1076 | /* Re did the following section of code - it looks like it had |
1161 | * lots of logic for things we no longer care about |
1077 | * lots of logic for things we no longer care about |
1162 | */ |
1078 | */ |
1163 | |
1079 | |
1164 | /* link the object above us */ |
1080 | /* link the object above us */ |
1165 | if (op->above) |
1081 | if (above) |
1166 | op->above->below = op->below; |
1082 | above->below = below; |
1167 | else |
1083 | else |
1168 | SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */ |
1084 | SET_MAP_TOP (map, x, y, below); /* we were top, set new top */ |
1169 | |
1085 | |
1170 | /* Relink the object below us, if there is one */ |
1086 | /* Relink the object below us, if there is one */ |
1171 | if (op->below) |
1087 | if (below) |
1172 | op->below->above = op->above; |
1088 | below->above = above; |
1173 | else |
1089 | else |
1174 | { |
1090 | { |
1175 | /* Nothing below, which means we need to relink map object for this space |
1091 | /* Nothing below, which means we need to relink map object for this space |
1176 | * use translated coordinates in case some oddness with map tiling is |
1092 | * use translated coordinates in case some oddness with map tiling is |
1177 | * evident |
1093 | * evident |
1178 | */ |
1094 | */ |
1179 | if (GET_MAP_OB (m, x, y) != op) |
1095 | if (GET_MAP_OB (map, x, y) != this) |
1180 | { |
1096 | { |
1181 | dump_object (op); |
1097 | char *dump = dump_object (this); |
1182 | LOG (llevError, |
1098 | LOG (llevError, |
1183 | "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", errmsg); |
1099 | "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); |
|
|
1100 | free (dump); |
1184 | dump_object (GET_MAP_OB (m, x, y)); |
1101 | dump = dump_object (GET_MAP_OB (map, x, y)); |
1185 | LOG (llevError, "%s\n", errmsg); |
1102 | LOG (llevError, "%s\n", dump); |
|
|
1103 | free (dump); |
1186 | } |
1104 | } |
1187 | |
1105 | |
1188 | SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ |
1106 | SET_MAP_OB (map, x, y, above); /* goes on above it. */ |
1189 | } |
1107 | } |
1190 | |
1108 | |
1191 | op->above = 0; |
1109 | above = 0; |
1192 | op->below = 0; |
1110 | below = 0; |
1193 | |
1111 | |
1194 | if (op->map->in_memory == MAP_SAVING) |
1112 | if (map->in_memory == MAP_SAVING) |
1195 | return; |
1113 | return; |
1196 | |
1114 | |
1197 | tag = op->count; |
|
|
1198 | check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); |
1115 | check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY); |
1199 | |
1116 | |
1200 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1117 | for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above) |
1201 | { |
1118 | { |
1202 | /* No point updating the players look faces if he is the object |
1119 | /* No point updating the players look faces if he is the object |
1203 | * being removed. |
1120 | * being removed. |
1204 | */ |
1121 | */ |
1205 | |
1122 | |
1206 | if (tmp->type == PLAYER && tmp != op) |
1123 | if (tmp->type == PLAYER && tmp != this) |
1207 | { |
1124 | { |
1208 | /* If a container that the player is currently using somehow gets |
1125 | /* If a container that the player is currently using somehow gets |
1209 | * removed (most likely destroyed), update the player view |
1126 | * removed (most likely destroyed), update the player view |
1210 | * appropriately. |
1127 | * appropriately. |
1211 | */ |
1128 | */ |
1212 | if (tmp->container == op) |
1129 | if (tmp->container == this) |
1213 | { |
1130 | { |
1214 | CLEAR_FLAG (op, FLAG_APPLIED); |
1131 | CLEAR_FLAG (this, FLAG_APPLIED); |
1215 | tmp->container = NULL; |
1132 | tmp->container = 0; |
1216 | } |
1133 | } |
1217 | |
1134 | |
1218 | tmp->contr->socket.update_look = 1; |
1135 | tmp->contr->socket.update_look = 1; |
1219 | } |
1136 | } |
1220 | |
1137 | |
1221 | /* See if player moving off should effect something */ |
1138 | /* See if player moving off should effect something */ |
1222 | if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1139 | if (check_walk_off |
|
|
1140 | && ((move_type & tmp->move_off) |
|
|
1141 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1223 | { |
1142 | { |
1224 | move_apply (tmp, op, NULL); |
1143 | move_apply (tmp, this, 0); |
1225 | |
1144 | |
1226 | if (was_destroyed (op, tag)) |
1145 | if (destroyed ()) |
1227 | { |
|
|
1228 | LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name); |
1146 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1229 | } |
|
|
1230 | } |
1147 | } |
1231 | |
1148 | |
1232 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1149 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1233 | |
1150 | |
1234 | if (tmp->above == tmp) |
1151 | if (tmp->above == tmp) |
1235 | tmp->above = NULL; |
1152 | tmp->above = 0; |
1236 | |
1153 | |
1237 | last = tmp; |
1154 | last = tmp; |
1238 | } |
1155 | } |
1239 | |
1156 | |
1240 | /* last == NULL of there are no objects on this space */ |
1157 | /* last == NULL of there are no objects on this space */ |
1241 | if (last == NULL) |
1158 | if (!last) |
1242 | { |
1159 | { |
1243 | /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, |
1160 | /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, |
1244 | * we could preserve the flags (GET_MAP_FLAGS), but update_position figures |
1161 | * we could preserve the flags (GET_MAP_FLAGS), but update_position figures |
1245 | * those out anyways, and if there are any flags set right now, they won't |
1162 | * those out anyways, and if there are any flags set right now, they won't |
1246 | * be correct anyways. |
1163 | * be correct anyways. |
1247 | */ |
1164 | */ |
1248 | SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE); |
1165 | SET_MAP_FLAGS (map, x, y, P_NEED_UPDATE); |
1249 | update_position (op->map, op->x, op->y); |
1166 | update_position (map, x, y); |
1250 | } |
1167 | } |
1251 | else |
1168 | else |
1252 | update_object (last, UP_OBJ_REMOVE); |
1169 | update_object (last, UP_OBJ_REMOVE); |
1253 | |
1170 | |
1254 | if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0)) |
1171 | if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius) |
1255 | update_all_los (op->map, op->x, op->y); |
1172 | update_all_los (map, x, y); |
1256 | } |
1173 | } |
1257 | } |
1174 | } |
1258 | |
1175 | |
1259 | /* |
1176 | /* |
1260 | * merge_ob(op,top): |
1177 | * merge_ob(op,top): |
… | |
… | |
1281 | { |
1198 | { |
1282 | top->nrof += op->nrof; |
1199 | top->nrof += op->nrof; |
1283 | |
1200 | |
1284 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1201 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1285 | op->weight = 0; /* Don't want any adjustements now */ |
1202 | op->weight = 0; /* Don't want any adjustements now */ |
1286 | remove_ob (op); |
1203 | op->destroy (); |
1287 | free_object (op); |
|
|
1288 | return top; |
1204 | return top; |
1289 | } |
1205 | } |
1290 | } |
1206 | } |
1291 | |
1207 | |
1292 | return 0; |
1208 | return 0; |
… | |
… | |
1295 | /* |
1211 | /* |
1296 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1212 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1297 | * job preparing multi-part monsters |
1213 | * job preparing multi-part monsters |
1298 | */ |
1214 | */ |
1299 | object * |
1215 | object * |
1300 | insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y) |
1216 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1301 | { |
1217 | { |
1302 | object *tmp; |
1218 | object *tmp; |
1303 | |
1219 | |
1304 | if (op->head) |
1220 | if (op->head) |
1305 | op = op->head; |
1221 | op = op->head; |
… | |
… | |
1333 | * NULL if 'op' was destroyed |
1249 | * NULL if 'op' was destroyed |
1334 | * just 'op' otherwise |
1250 | * just 'op' otherwise |
1335 | */ |
1251 | */ |
1336 | |
1252 | |
1337 | object * |
1253 | object * |
1338 | insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag) |
1254 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1339 | { |
1255 | { |
1340 | object *tmp, *top, *floor = NULL; |
1256 | object *tmp, *top, *floor = NULL; |
1341 | sint16 x, y; |
1257 | sint16 x, y; |
1342 | |
1258 | |
1343 | if (QUERY_FLAG (op, FLAG_FREED)) |
1259 | if (QUERY_FLAG (op, FLAG_FREED)) |
… | |
… | |
1346 | return NULL; |
1262 | return NULL; |
1347 | } |
1263 | } |
1348 | |
1264 | |
1349 | if (m == NULL) |
1265 | if (m == NULL) |
1350 | { |
1266 | { |
1351 | dump_object (op); |
1267 | char *dump = dump_object (op); |
1352 | LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg); |
1268 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
|
|
1269 | free (dump); |
1353 | return op; |
1270 | return op; |
1354 | } |
1271 | } |
1355 | |
1272 | |
1356 | if (out_of_map (m, op->x, op->y)) |
1273 | if (out_of_map (m, op->x, op->y)) |
1357 | { |
1274 | { |
1358 | dump_object (op); |
1275 | char *dump = dump_object (op); |
1359 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg); |
1276 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1360 | #ifdef MANY_CORES |
1277 | #ifdef MANY_CORES |
1361 | /* Better to catch this here, as otherwise the next use of this object |
1278 | /* Better to catch this here, as otherwise the next use of this object |
1362 | * is likely to cause a crash. Better to find out where it is getting |
1279 | * is likely to cause a crash. Better to find out where it is getting |
1363 | * improperly inserted. |
1280 | * improperly inserted. |
1364 | */ |
1281 | */ |
1365 | abort (); |
1282 | abort (); |
1366 | #endif |
1283 | #endif |
|
|
1284 | free (dump); |
1367 | return op; |
1285 | return op; |
1368 | } |
1286 | } |
1369 | |
1287 | |
1370 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1288 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1371 | { |
1289 | { |
1372 | dump_object (op); |
1290 | char *dump = dump_object (op); |
1373 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg); |
1291 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); |
|
|
1292 | free (dump); |
1374 | return op; |
1293 | return op; |
1375 | } |
1294 | } |
1376 | |
1295 | |
1377 | if (op->more != NULL) |
1296 | if (op->more != NULL) |
1378 | { |
1297 | { |
… | |
… | |
1419 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1338 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1420 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1339 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1421 | if (CAN_MERGE (op, tmp)) |
1340 | if (CAN_MERGE (op, tmp)) |
1422 | { |
1341 | { |
1423 | op->nrof += tmp->nrof; |
1342 | op->nrof += tmp->nrof; |
1424 | remove_ob (tmp); |
1343 | tmp->destroy (); |
1425 | free_object (tmp); |
|
|
1426 | } |
1344 | } |
1427 | |
1345 | |
1428 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1346 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1429 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1347 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1430 | |
1348 | |
… | |
… | |
1616 | tmp1; |
1534 | tmp1; |
1617 | |
1535 | |
1618 | /* first search for itself and remove any old instances */ |
1536 | /* first search for itself and remove any old instances */ |
1619 | |
1537 | |
1620 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1538 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1621 | { |
|
|
1622 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1539 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1623 | { |
1540 | tmp->destroy (); |
1624 | remove_ob (tmp); |
|
|
1625 | free_object (tmp); |
|
|
1626 | } |
|
|
1627 | } |
|
|
1628 | |
1541 | |
1629 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1542 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1630 | |
1543 | |
1631 | tmp1->x = op->x; |
1544 | tmp1->x = op->x; |
1632 | tmp1->y = op->y; |
1545 | tmp1->y = op->y; |
… | |
… | |
1642 | */ |
1555 | */ |
1643 | |
1556 | |
1644 | object * |
1557 | object * |
1645 | get_split_ob (object *orig_ob, uint32 nr) |
1558 | get_split_ob (object *orig_ob, uint32 nr) |
1646 | { |
1559 | { |
1647 | object * |
1560 | object *newob; |
1648 | newob; |
|
|
1649 | int |
|
|
1650 | is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1561 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1651 | |
1562 | |
1652 | if (orig_ob->nrof < nr) |
1563 | if (orig_ob->nrof < nr) |
1653 | { |
1564 | { |
1654 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
1565 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
1655 | return NULL; |
1566 | return NULL; |
1656 | } |
1567 | } |
1657 | |
1568 | |
1658 | newob = object_create_clone (orig_ob); |
1569 | newob = object_create_clone (orig_ob); |
1659 | |
1570 | |
1660 | if ((orig_ob->nrof -= nr) < 1) |
1571 | if ((orig_ob->nrof -= nr) < 1) |
1661 | { |
1572 | orig_ob->destroy (1); |
1662 | if (!is_removed) |
|
|
1663 | remove_ob (orig_ob); |
|
|
1664 | free_object2 (orig_ob, 1); |
|
|
1665 | } |
|
|
1666 | else if (!is_removed) |
1573 | else if (!is_removed) |
1667 | { |
1574 | { |
1668 | if (orig_ob->env != NULL) |
1575 | if (orig_ob->env != NULL) |
1669 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
1576 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
1670 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
1577 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
… | |
… | |
1734 | esrv_send_item (tmp, op); |
1641 | esrv_send_item (tmp, op); |
1735 | } |
1642 | } |
1736 | } |
1643 | } |
1737 | else |
1644 | else |
1738 | { |
1645 | { |
1739 | remove_ob (op); |
1646 | op->remove (); |
1740 | op->nrof = 0; |
1647 | op->nrof = 0; |
1741 | if (tmp) |
1648 | if (tmp) |
1742 | { |
1649 | { |
1743 | esrv_del_item (tmp->contr, op->count); |
1650 | esrv_del_item (tmp->contr, op->count); |
1744 | } |
1651 | } |
… | |
… | |
1750 | |
1657 | |
1751 | if (i < op->nrof) |
1658 | if (i < op->nrof) |
1752 | op->nrof -= i; |
1659 | op->nrof -= i; |
1753 | else |
1660 | else |
1754 | { |
1661 | { |
1755 | remove_ob (op); |
1662 | op->remove (); |
1756 | op->nrof = 0; |
1663 | op->nrof = 0; |
1757 | } |
1664 | } |
1758 | |
1665 | |
1759 | /* Since we just removed op, op->above is null */ |
1666 | /* Since we just removed op, op->above is null */ |
1760 | for (tmp = above; tmp != NULL; tmp = tmp->above) |
1667 | for (tmp = above; tmp != NULL; tmp = tmp->above) |
… | |
… | |
1769 | |
1676 | |
1770 | if (op->nrof) |
1677 | if (op->nrof) |
1771 | return op; |
1678 | return op; |
1772 | else |
1679 | else |
1773 | { |
1680 | { |
1774 | free_object (op); |
1681 | op->destroy (); |
1775 | return NULL; |
1682 | return NULL; |
1776 | } |
1683 | } |
1777 | } |
1684 | } |
1778 | |
1685 | |
1779 | /* |
1686 | /* |
… | |
… | |
1792 | op->carrying += weight; |
1699 | op->carrying += weight; |
1793 | op = op->env; |
1700 | op = op->env; |
1794 | } |
1701 | } |
1795 | } |
1702 | } |
1796 | |
1703 | |
|
|
1704 | object * |
|
|
1705 | insert_ob_in_ob (object *op, object *where) |
|
|
1706 | { |
|
|
1707 | if (!where) |
|
|
1708 | { |
|
|
1709 | char *dump = dump_object (op); |
|
|
1710 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
|
|
1711 | free (dump); |
|
|
1712 | return op; |
|
|
1713 | } |
|
|
1714 | |
|
|
1715 | if (where->head) |
|
|
1716 | { |
|
|
1717 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
|
|
1718 | where = where->head; |
|
|
1719 | } |
|
|
1720 | |
|
|
1721 | return where->insert (op); |
|
|
1722 | } |
|
|
1723 | |
1797 | /* |
1724 | /* |
1798 | * insert_ob_in_ob(op,environment): |
1725 | * env->insert (op) |
1799 | * This function inserts the object op in the linked list |
1726 | * This function inserts the object op in the linked list |
1800 | * inside the object environment. |
1727 | * inside the object environment. |
1801 | * |
1728 | * |
1802 | * Eneq(@csd.uu.se): Altered insert_ob_in_ob to make things picked up enter |
|
|
1803 | * the inventory at the last position or next to other objects of the same |
|
|
1804 | * type. |
|
|
1805 | * Frank: Now sorted by type, archetype and magic! |
|
|
1806 | * |
|
|
1807 | * The function returns now pointer to inserted item, and return value can |
1729 | * The function returns now pointer to inserted item, and return value can |
1808 | * be != op, if items are merged. -Tero |
1730 | * be != op, if items are merged. -Tero |
1809 | */ |
1731 | */ |
1810 | |
1732 | |
1811 | object * |
1733 | object * |
1812 | insert_ob_in_ob (object *op, object *where) |
1734 | object::insert (object *op) |
1813 | { |
1735 | { |
1814 | object * |
1736 | object *tmp, *otmp; |
1815 | tmp, * |
|
|
1816 | otmp; |
|
|
1817 | |
1737 | |
1818 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1738 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1819 | { |
1739 | op->remove (); |
1820 | dump_object (op); |
|
|
1821 | LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg); |
|
|
1822 | return op; |
|
|
1823 | } |
|
|
1824 | |
|
|
1825 | if (where == NULL) |
|
|
1826 | { |
|
|
1827 | dump_object (op); |
|
|
1828 | LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg); |
|
|
1829 | return op; |
|
|
1830 | } |
|
|
1831 | |
|
|
1832 | if (where->head) |
|
|
1833 | { |
|
|
1834 | LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n"); |
|
|
1835 | where = where->head; |
|
|
1836 | } |
|
|
1837 | |
1740 | |
1838 | if (op->more) |
1741 | if (op->more) |
1839 | { |
1742 | { |
1840 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1743 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1841 | return op; |
1744 | return op; |
… | |
… | |
1843 | |
1746 | |
1844 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1747 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1845 | CLEAR_FLAG (op, FLAG_REMOVED); |
1748 | CLEAR_FLAG (op, FLAG_REMOVED); |
1846 | if (op->nrof) |
1749 | if (op->nrof) |
1847 | { |
1750 | { |
1848 | for (tmp = where->inv; tmp != NULL; tmp = tmp->below) |
1751 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1849 | if (CAN_MERGE (tmp, op)) |
1752 | if (CAN_MERGE (tmp, op)) |
1850 | { |
1753 | { |
1851 | /* return the original object and remove inserted object |
1754 | /* return the original object and remove inserted object |
1852 | (client needs the original object) */ |
1755 | (client needs the original object) */ |
1853 | tmp->nrof += op->nrof; |
1756 | tmp->nrof += op->nrof; |
1854 | /* Weight handling gets pretty funky. Since we are adding to |
1757 | /* Weight handling gets pretty funky. Since we are adding to |
1855 | * tmp->nrof, we need to increase the weight. |
1758 | * tmp->nrof, we need to increase the weight. |
1856 | */ |
1759 | */ |
1857 | add_weight (where, op->weight * op->nrof); |
1760 | add_weight (this, op->weight * op->nrof); |
1858 | SET_FLAG (op, FLAG_REMOVED); |
1761 | SET_FLAG (op, FLAG_REMOVED); |
1859 | free_object (op); /* free the inserted object */ |
1762 | op->destroy (); /* free the inserted object */ |
1860 | op = tmp; |
1763 | op = tmp; |
1861 | remove_ob (op); /* and fix old object's links */ |
1764 | op->remove (); /* and fix old object's links */ |
1862 | CLEAR_FLAG (op, FLAG_REMOVED); |
1765 | CLEAR_FLAG (op, FLAG_REMOVED); |
1863 | break; |
1766 | break; |
1864 | } |
1767 | } |
1865 | |
1768 | |
1866 | /* I assume combined objects have no inventory |
1769 | /* I assume combined objects have no inventory |
1867 | * We add the weight - this object could have just been removed |
1770 | * We add the weight - this object could have just been removed |
1868 | * (if it was possible to merge). calling remove_ob will subtract |
1771 | * (if it was possible to merge). calling remove_ob will subtract |
1869 | * the weight, so we need to add it in again, since we actually do |
1772 | * the weight, so we need to add it in again, since we actually do |
1870 | * the linking below |
1773 | * the linking below |
1871 | */ |
1774 | */ |
1872 | add_weight (where, op->weight * op->nrof); |
1775 | add_weight (this, op->weight * op->nrof); |
1873 | } |
1776 | } |
1874 | else |
1777 | else |
1875 | add_weight (where, (op->weight + op->carrying)); |
1778 | add_weight (this, (op->weight + op->carrying)); |
1876 | |
1779 | |
1877 | otmp = is_player_inv (where); |
1780 | otmp = is_player_inv (this); |
1878 | if (otmp && otmp->contr != NULL) |
1781 | if (otmp && otmp->contr) |
1879 | { |
|
|
1880 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1782 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1881 | fix_player (otmp); |
1783 | fix_player (otmp); |
1882 | } |
|
|
1883 | |
1784 | |
1884 | op->map = NULL; |
1785 | op->map = NULL; |
1885 | op->env = where; |
1786 | op->env = this; |
1886 | op->above = NULL; |
1787 | op->above = NULL; |
1887 | op->below = NULL; |
1788 | op->below = NULL; |
1888 | op->x = 0, op->y = 0; |
1789 | op->x = 0, op->y = 0; |
1889 | |
1790 | |
1890 | /* reset the light list and los of the players on the map */ |
1791 | /* reset the light list and los of the players on the map */ |
1891 | if ((op->glow_radius != 0) && where->map) |
1792 | if ((op->glow_radius != 0) && map) |
1892 | { |
1793 | { |
1893 | #ifdef DEBUG_LIGHTS |
1794 | #ifdef DEBUG_LIGHTS |
1894 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1795 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1895 | #endif /* DEBUG_LIGHTS */ |
1796 | #endif /* DEBUG_LIGHTS */ |
1896 | if (MAP_DARKNESS (where->map)) |
1797 | if (MAP_DARKNESS (map)) |
1897 | update_all_los (where->map, where->x, where->y); |
1798 | update_all_los (map, x, y); |
1898 | } |
1799 | } |
1899 | |
1800 | |
1900 | /* Client has no idea of ordering so lets not bother ordering it here. |
1801 | /* Client has no idea of ordering so lets not bother ordering it here. |
1901 | * It sure simplifies this function... |
1802 | * It sure simplifies this function... |
1902 | */ |
1803 | */ |
1903 | if (where->inv == NULL) |
1804 | if (!inv) |
1904 | where->inv = op; |
1805 | inv = op; |
1905 | else |
1806 | else |
1906 | { |
1807 | { |
1907 | op->below = where->inv; |
1808 | op->below = inv; |
1908 | op->below->above = op; |
1809 | op->below->above = op; |
1909 | where->inv = op; |
1810 | inv = op; |
1910 | } |
1811 | } |
|
|
1812 | |
1911 | return op; |
1813 | return op; |
1912 | } |
1814 | } |
1913 | |
1815 | |
1914 | /* |
1816 | /* |
1915 | * Checks if any objects has a move_type that matches objects |
1817 | * Checks if any objects has a move_type that matches objects |
… | |
… | |
1933 | */ |
1835 | */ |
1934 | |
1836 | |
1935 | int |
1837 | int |
1936 | check_move_on (object *op, object *originator) |
1838 | check_move_on (object *op, object *originator) |
1937 | { |
1839 | { |
1938 | object * |
1840 | object *tmp; |
1939 | tmp; |
1841 | maptile *m = op->map; |
1940 | tag_t |
|
|
1941 | tag; |
|
|
1942 | mapstruct * |
|
|
1943 | m = op->map; |
|
|
1944 | int |
|
|
1945 | x = op->x, y = op->y; |
1842 | int x = op->x, y = op->y; |
1946 | |
1843 | |
1947 | MoveType |
1844 | MoveType move_on, move_slow, move_block; |
1948 | move_on, |
|
|
1949 | move_slow, |
|
|
1950 | move_block; |
|
|
1951 | |
1845 | |
1952 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1846 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1953 | return 0; |
1847 | return 0; |
1954 | |
|
|
1955 | tag = op->count; |
|
|
1956 | |
1848 | |
1957 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
1849 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
1958 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
1850 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
1959 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
1851 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
1960 | |
1852 | |
… | |
… | |
2021 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
1913 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
2022 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
1914 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
2023 | { |
1915 | { |
2024 | move_apply (tmp, op, originator); |
1916 | move_apply (tmp, op, originator); |
2025 | |
1917 | |
2026 | if (was_destroyed (op, tag)) |
1918 | if (op->destroyed ()) |
2027 | return 1; |
1919 | return 1; |
2028 | |
1920 | |
2029 | /* what the person/creature stepped onto has moved the object |
1921 | /* what the person/creature stepped onto has moved the object |
2030 | * someplace new. Don't process any further - if we did, |
1922 | * someplace new. Don't process any further - if we did, |
2031 | * have a feeling strange problems would result. |
1923 | * have a feeling strange problems would result. |
… | |
… | |
2043 | * a matching archetype at the given map and coordinates. |
1935 | * a matching archetype at the given map and coordinates. |
2044 | * The first matching object is returned, or NULL if none. |
1936 | * The first matching object is returned, or NULL if none. |
2045 | */ |
1937 | */ |
2046 | |
1938 | |
2047 | object * |
1939 | object * |
2048 | present_arch (const archetype *at, mapstruct *m, int x, int y) |
1940 | present_arch (const archetype *at, maptile *m, int x, int y) |
2049 | { |
1941 | { |
2050 | object * |
1942 | object * |
2051 | tmp; |
1943 | tmp; |
2052 | |
1944 | |
2053 | if (m == NULL || out_of_map (m, x, y)) |
1945 | if (m == NULL || out_of_map (m, x, y)) |
… | |
… | |
2066 | * a matching type variable at the given map and coordinates. |
1958 | * a matching type variable at the given map and coordinates. |
2067 | * The first matching object is returned, or NULL if none. |
1959 | * The first matching object is returned, or NULL if none. |
2068 | */ |
1960 | */ |
2069 | |
1961 | |
2070 | object * |
1962 | object * |
2071 | present (unsigned char type, mapstruct *m, int x, int y) |
1963 | present (unsigned char type, maptile *m, int x, int y) |
2072 | { |
1964 | { |
2073 | object * |
1965 | object * |
2074 | tmp; |
1966 | tmp; |
2075 | |
1967 | |
2076 | if (out_of_map (m, x, y)) |
1968 | if (out_of_map (m, x, y)) |
… | |
… | |
2216 | * the archetype because that isn't correct if the monster has been |
2108 | * the archetype because that isn't correct if the monster has been |
2217 | * customized, changed states, etc. |
2109 | * customized, changed states, etc. |
2218 | */ |
2110 | */ |
2219 | |
2111 | |
2220 | int |
2112 | int |
2221 | find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop) |
2113 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2222 | { |
2114 | { |
2223 | int |
2115 | int |
2224 | i, |
2116 | i, |
2225 | index = 0, flag; |
2117 | index = 0, flag; |
2226 | static int |
2118 | static int |
… | |
… | |
2247 | return -1; |
2139 | return -1; |
2248 | return altern[RANDOM () % index]; |
2140 | return altern[RANDOM () % index]; |
2249 | } |
2141 | } |
2250 | |
2142 | |
2251 | /* |
2143 | /* |
2252 | * find_first_free_spot(archetype, mapstruct, x, y) works like |
2144 | * find_first_free_spot(archetype, maptile, x, y) works like |
2253 | * find_free_spot(), but it will search max number of squares. |
2145 | * find_free_spot(), but it will search max number of squares. |
2254 | * But it will return the first available spot, not a random choice. |
2146 | * But it will return the first available spot, not a random choice. |
2255 | * Changed 0.93.2: Have it return -1 if there is no free spot available. |
2147 | * Changed 0.93.2: Have it return -1 if there is no free spot available. |
2256 | */ |
2148 | */ |
2257 | |
2149 | |
2258 | int |
2150 | int |
2259 | find_first_free_spot (const object *ob, mapstruct *m, int x, int y) |
2151 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2260 | { |
2152 | { |
2261 | int |
2153 | int |
2262 | i; |
2154 | i; |
2263 | |
2155 | |
2264 | for (i = 0; i < SIZEOFFREE; i++) |
2156 | for (i = 0; i < SIZEOFFREE; i++) |
… | |
… | |
2328 | * because we have to know what movement the thing looking to move |
2220 | * because we have to know what movement the thing looking to move |
2329 | * there is capable of. |
2221 | * there is capable of. |
2330 | */ |
2222 | */ |
2331 | |
2223 | |
2332 | int |
2224 | int |
2333 | find_dir (mapstruct *m, int x, int y, object *exclude) |
2225 | find_dir (maptile *m, int x, int y, object *exclude) |
2334 | { |
2226 | { |
2335 | int |
2227 | int |
2336 | i, |
2228 | i, |
2337 | max = SIZEOFFREE, mflags; |
2229 | max = SIZEOFFREE, mflags; |
2338 | |
2230 | |
2339 | sint16 nx, ny; |
2231 | sint16 nx, ny; |
2340 | object * |
2232 | object * |
2341 | tmp; |
2233 | tmp; |
2342 | mapstruct * |
2234 | maptile * |
2343 | mp; |
2235 | mp; |
2344 | |
2236 | |
2345 | MoveType blocked, move_type; |
2237 | MoveType blocked, move_type; |
2346 | |
2238 | |
2347 | if (exclude && exclude->head) |
2239 | if (exclude && exclude->head) |
… | |
… | |
2555 | * Modified to be map tile aware -.MSW |
2447 | * Modified to be map tile aware -.MSW |
2556 | */ |
2448 | */ |
2557 | |
2449 | |
2558 | |
2450 | |
2559 | int |
2451 | int |
2560 | can_see_monsterP (mapstruct *m, int x, int y, int dir) |
2452 | can_see_monsterP (maptile *m, int x, int y, int dir) |
2561 | { |
2453 | { |
2562 | sint16 dx, dy; |
2454 | sint16 dx, dy; |
2563 | int |
2455 | int |
2564 | mflags; |
2456 | mflags; |
2565 | |
2457 | |
… | |
… | |
2614 | * create clone from object to another |
2506 | * create clone from object to another |
2615 | */ |
2507 | */ |
2616 | object * |
2508 | object * |
2617 | object_create_clone (object *asrc) |
2509 | object_create_clone (object *asrc) |
2618 | { |
2510 | { |
2619 | object * |
|
|
2620 | dst = NULL, *tmp, *src, *part, *prev, *item; |
2511 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2621 | |
2512 | |
2622 | if (!asrc) |
2513 | if (!asrc) |
2623 | return NULL; |
2514 | return 0; |
|
|
2515 | |
2624 | src = asrc; |
2516 | src = asrc; |
2625 | if (src->head) |
2517 | if (src->head) |
2626 | src = src->head; |
2518 | src = src->head; |
2627 | |
2519 | |
2628 | prev = NULL; |
2520 | prev = 0; |
2629 | for (part = src; part; part = part->more) |
2521 | for (part = src; part; part = part->more) |
2630 | { |
2522 | { |
2631 | tmp = get_object (); |
2523 | tmp = object::create (); |
2632 | copy_object (part, tmp); |
2524 | part->copy_to (tmp); |
2633 | tmp->x -= src->x; |
2525 | tmp->x -= src->x; |
2634 | tmp->y -= src->y; |
2526 | tmp->y -= src->y; |
|
|
2527 | |
2635 | if (!part->head) |
2528 | if (!part->head) |
2636 | { |
2529 | { |
2637 | dst = tmp; |
2530 | dst = tmp; |
2638 | tmp->head = NULL; |
2531 | tmp->head = 0; |
2639 | } |
2532 | } |
2640 | else |
2533 | else |
2641 | { |
2534 | { |
2642 | tmp->head = dst; |
2535 | tmp->head = dst; |
2643 | } |
2536 | } |
|
|
2537 | |
2644 | tmp->more = NULL; |
2538 | tmp->more = 0; |
|
|
2539 | |
2645 | if (prev) |
2540 | if (prev) |
2646 | prev->more = tmp; |
2541 | prev->more = tmp; |
|
|
2542 | |
2647 | prev = tmp; |
2543 | prev = tmp; |
2648 | } |
2544 | } |
2649 | |
2545 | |
2650 | /*** copy inventory ***/ |
|
|
2651 | for (item = src->inv; item; item = item->below) |
2546 | for (item = src->inv; item; item = item->below) |
2652 | { |
|
|
2653 | (void) insert_ob_in_ob (object_create_clone (item), dst); |
2547 | insert_ob_in_ob (object_create_clone (item), dst); |
2654 | } |
|
|
2655 | |
2548 | |
2656 | return dst; |
2549 | return dst; |
2657 | } |
2550 | } |
2658 | |
2551 | |
2659 | /* return true if the object was destroyed, 0 otherwise */ |
|
|
2660 | int |
|
|
2661 | was_destroyed (const object *op, tag_t old_tag) |
|
|
2662 | { |
|
|
2663 | /* checking for FLAG_FREED isn't necessary, but makes this function more |
|
|
2664 | * robust */ |
|
|
2665 | return op->count != old_tag || QUERY_FLAG (op, FLAG_FREED); |
|
|
2666 | } |
|
|
2667 | |
|
|
2668 | /* GROS - Creates an object using a string representing its content. */ |
2552 | /* GROS - Creates an object using a string representing its content. */ |
2669 | |
|
|
2670 | /* Basically, we save the content of the string to a temp file, then call */ |
2553 | /* Basically, we save the content of the string to a temp file, then call */ |
2671 | |
|
|
2672 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
2554 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
2673 | |
|
|
2674 | /* but it was simple to make and allows reusing the load_object function. */ |
2555 | /* but it was simple to make and allows reusing the load_object function. */ |
2675 | |
|
|
2676 | /* Remember not to use load_object_str in a time-critical situation. */ |
2556 | /* Remember not to use load_object_str in a time-critical situation. */ |
2677 | |
|
|
2678 | /* Also remember that multiparts objects are not supported for now. */ |
2557 | /* Also remember that multiparts objects are not supported for now. */ |
2679 | |
2558 | |
2680 | object * |
2559 | object * |
2681 | load_object_str (const char *obstr) |
2560 | load_object_str (const char *obstr) |
2682 | { |
2561 | { |
2683 | object * |
2562 | object *op; |
2684 | op; |
|
|
2685 | char |
|
|
2686 | filename[MAX_BUF]; |
2563 | char filename[MAX_BUF]; |
2687 | |
2564 | |
2688 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
2565 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
2689 | |
2566 | |
2690 | FILE * |
|
|
2691 | tempfile = fopen (filename, "w"); |
2567 | FILE *tempfile = fopen (filename, "w"); |
2692 | |
2568 | |
2693 | if (tempfile == NULL) |
2569 | if (tempfile == NULL) |
2694 | { |
2570 | { |
2695 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
2571 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
2696 | return NULL; |
2572 | return NULL; |
2697 | } |
2573 | } |
2698 | |
2574 | |
2699 | fprintf (tempfile, obstr); |
2575 | fprintf (tempfile, obstr); |
2700 | fclose (tempfile); |
2576 | fclose (tempfile); |
2701 | |
2577 | |
2702 | op = get_object (); |
2578 | op = object::create (); |
2703 | |
2579 | |
2704 | object_thawer thawer (filename); |
2580 | object_thawer thawer (filename); |
2705 | |
2581 | |
2706 | if (thawer) |
2582 | if (thawer) |
2707 | load_object (thawer, op, 0); |
2583 | load_object (thawer, op, 0); |
… | |
… | |
2717 | * returns NULL if no match. |
2593 | * returns NULL if no match. |
2718 | */ |
2594 | */ |
2719 | object * |
2595 | object * |
2720 | find_obj_by_type_subtype (const object *who, int type, int subtype) |
2596 | find_obj_by_type_subtype (const object *who, int type, int subtype) |
2721 | { |
2597 | { |
2722 | object * |
2598 | object *tmp; |
2723 | tmp; |
|
|
2724 | |
2599 | |
2725 | for (tmp = who->inv; tmp; tmp = tmp->below) |
2600 | for (tmp = who->inv; tmp; tmp = tmp->below) |
2726 | if (tmp->type == type && tmp->subtype == subtype) |
2601 | if (tmp->type == type && tmp->subtype == subtype) |
2727 | return tmp; |
2602 | return tmp; |
2728 | |
2603 | |
… | |
… | |
2736 | * do the desired thing. |
2611 | * do the desired thing. |
2737 | */ |
2612 | */ |
2738 | key_value * |
2613 | key_value * |
2739 | get_ob_key_link (const object *ob, const char *key) |
2614 | get_ob_key_link (const object *ob, const char *key) |
2740 | { |
2615 | { |
2741 | key_value * |
2616 | key_value *link; |
2742 | link; |
|
|
2743 | |
2617 | |
2744 | for (link = ob->key_values; link != NULL; link = link->next) |
2618 | for (link = ob->key_values; link != NULL; link = link->next) |
2745 | { |
|
|
2746 | if (link->key == key) |
2619 | if (link->key == key) |
2747 | { |
|
|
2748 | return link; |
2620 | return link; |
2749 | } |
|
|
2750 | } |
|
|
2751 | |
2621 | |
2752 | return NULL; |
2622 | return NULL; |
2753 | } |
2623 | } |
2754 | |
2624 | |
2755 | /* |
2625 | /* |