… | |
… | |
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 () |
… | |
… | |
183 | * |
183 | * |
184 | * Note that this function appears a lot longer than the macro it |
184 | * Note that this function appears a lot longer than the macro it |
185 | * replaces - this is mostly for clarity - a decent compiler should hopefully |
185 | * replaces - this is mostly for clarity - a decent compiler should hopefully |
186 | * reduce this to the same efficiency. |
186 | * reduce this to the same efficiency. |
187 | * |
187 | * |
188 | * Check nrof variable *before* calling CAN_MERGE() |
188 | * Check nrof variable *before* calling can_merge() |
189 | * |
189 | * |
190 | * Improvements made with merge: Better checking on potion, and also |
190 | * Improvements made with merge: Better checking on potion, and also |
191 | * check weight |
191 | * check weight |
192 | */ |
192 | */ |
193 | |
193 | |
194 | bool object::can_merge (object *ob1, object *ob2) |
194 | bool object::can_merge_slow (object *ob1, object *ob2) |
195 | { |
195 | { |
196 | /* A couple quicksanity checks */ |
196 | /* A couple quicksanity checks */ |
197 | if ((ob1 == ob2) || (ob1->type != ob2->type)) |
197 | if (ob1 == ob2 |
|
|
198 | || ob1->type != ob2->type |
|
|
199 | || ob1->speed != ob2->speed |
|
|
200 | || ob1->value != ob2->value |
|
|
201 | || ob1->name != ob2->name) |
198 | return 0; |
202 | return 0; |
199 | |
203 | |
200 | if (ob1->speed != ob2->speed) |
204 | //TODO: this ain't working well, use nicer and correct overflow check |
201 | return 0; |
|
|
202 | |
|
|
203 | /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that |
205 | /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that |
204 | * value could not be stored in a sint32 (which unfortunately sometimes is |
206 | * value could not be stored in a sint32 (which unfortunately sometimes is |
205 | * used to store nrof). |
207 | * used to store nrof). |
206 | */ |
208 | */ |
207 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
209 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
… | |
… | |
260 | /* if one object has inventory but the other doesn't, not equiv */ |
262 | /* if one object has inventory but the other doesn't, not equiv */ |
261 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
263 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
262 | return 0; |
264 | return 0; |
263 | |
265 | |
264 | /* Now check to see if the two inventory objects could merge */ |
266 | /* Now check to see if the two inventory objects could merge */ |
265 | if (!CAN_MERGE (ob1->inv, ob2->inv)) |
267 | if (!object::can_merge (ob1->inv, ob2->inv)) |
266 | return 0; |
268 | return 0; |
267 | |
269 | |
268 | /* inventory ok - still need to check rest of this object to see |
270 | /* inventory ok - still need to check rest of this object to see |
269 | * if it is valid. |
271 | * if it is valid. |
270 | */ |
272 | */ |
… | |
… | |
526 | |
528 | |
527 | if (settings.casting_time) |
529 | if (settings.casting_time) |
528 | casting_time = -1; |
530 | casting_time = -1; |
529 | } |
531 | } |
530 | |
532 | |
531 | void object::clone (object *destination) |
|
|
532 | { |
|
|
533 | *(object_copy *)destination = *this; |
|
|
534 | *(object_pod *)destination = *this; |
|
|
535 | |
|
|
536 | if (self || cb) |
|
|
537 | INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination)); |
|
|
538 | } |
|
|
539 | |
|
|
540 | /* |
533 | /* |
541 | * copy object first frees everything allocated by the second object, |
534 | * copy_to first frees everything allocated by the dst object, |
542 | * and then copies the contends of the first object into the second |
535 | * and then copies the contents of itself into the second |
543 | * object, allocating what needs to be allocated. Basically, any |
536 | * object, allocating what needs to be allocated. Basically, any |
544 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
537 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
545 | * if the first object is freed, the pointers in the new object |
538 | * if the first object is freed, the pointers in the new object |
546 | * will point at garbage. |
539 | * will point at garbage. |
547 | */ |
540 | */ |
548 | void |
541 | void |
549 | copy_object (object *op2, object *op) |
542 | object::copy_to (object *dst) |
550 | { |
543 | { |
551 | bool is_freed = QUERY_FLAG (op, FLAG_FREED); |
544 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
552 | bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); |
545 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
553 | |
546 | |
554 | op2->clone (op); |
547 | *(object_copy *)dst = *this; |
|
|
548 | *(object_pod *)dst = *this; |
|
|
549 | |
|
|
550 | if (self || cb) |
|
|
551 | INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst)); |
555 | |
552 | |
556 | if (is_freed) |
553 | if (is_freed) |
557 | SET_FLAG (op, FLAG_FREED); |
554 | SET_FLAG (dst, FLAG_FREED); |
|
|
555 | |
558 | if (is_removed) |
556 | if (is_removed) |
559 | SET_FLAG (op, FLAG_REMOVED); |
557 | SET_FLAG (dst, FLAG_REMOVED); |
560 | |
558 | |
561 | if (op2->speed < 0) |
559 | if (speed < 0) |
562 | op->speed_left = op2->speed_left - RANDOM () % 200 / 100.0; |
560 | dst->speed_left = speed_left - RANDOM () % 200 / 100.0; |
563 | |
561 | |
564 | /* Copy over key_values, if any. */ |
562 | /* Copy over key_values, if any. */ |
565 | if (op2->key_values) |
563 | if (key_values) |
566 | { |
564 | { |
567 | key_value *tail = 0; |
565 | key_value *tail = 0; |
568 | key_value *i; |
566 | key_value *i; |
569 | |
567 | |
570 | op->key_values = 0; |
568 | dst->key_values = 0; |
571 | |
569 | |
572 | for (i = op2->key_values; i; i = i->next) |
570 | for (i = key_values; i; i = i->next) |
573 | { |
571 | { |
574 | key_value *new_link = new key_value; |
572 | key_value *new_link = new key_value; |
575 | |
573 | |
576 | new_link->next = 0; |
574 | new_link->next = 0; |
577 | new_link->key = i->key; |
575 | new_link->key = i->key; |
578 | new_link->value = i->value; |
576 | new_link->value = i->value; |
579 | |
577 | |
580 | /* Try and be clever here, too. */ |
578 | /* Try and be clever here, too. */ |
581 | if (!op->key_values) |
579 | if (!dst->key_values) |
582 | { |
580 | { |
583 | op->key_values = new_link; |
581 | dst->key_values = new_link; |
584 | tail = new_link; |
582 | tail = new_link; |
585 | } |
583 | } |
586 | else |
584 | else |
587 | { |
585 | { |
588 | tail->next = new_link; |
586 | tail->next = new_link; |
589 | tail = new_link; |
587 | tail = new_link; |
590 | } |
588 | } |
591 | } |
589 | } |
592 | } |
590 | } |
593 | |
591 | |
594 | update_ob_speed (op); |
592 | update_ob_speed (dst); |
|
|
593 | } |
|
|
594 | |
|
|
595 | object * |
|
|
596 | object::clone () |
|
|
597 | { |
|
|
598 | object *neu = create (); |
|
|
599 | copy_to (neu); |
|
|
600 | return neu; |
595 | } |
601 | } |
596 | |
602 | |
597 | /* |
603 | /* |
598 | * If an object with the IS_TURNABLE() flag needs to be turned due |
604 | * If an object with the IS_TURNABLE() flag needs to be turned due |
599 | * to the closest player being on the other side, this function can |
605 | * to the closest player being on the other side, this function can |
… | |
… | |
804 | update_now = 1; |
810 | update_now = 1; |
805 | |
811 | |
806 | if ((move_slow | op->move_slow) != move_slow) |
812 | if ((move_slow | op->move_slow) != move_slow) |
807 | update_now = 1; |
813 | update_now = 1; |
808 | } |
814 | } |
|
|
815 | |
809 | /* if the object is being removed, we can't make intelligent |
816 | /* if the object is being removed, we can't make intelligent |
810 | * decisions, because remove_ob can't really pass the object |
817 | * decisions, because remove_ob can't really pass the object |
811 | * that is being removed. |
818 | * that is being removed. |
812 | */ |
819 | */ |
813 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
820 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
… | |
… | |
839 | else |
846 | else |
840 | { |
847 | { |
841 | delete *i; |
848 | delete *i; |
842 | mortals.erase (i); |
849 | mortals.erase (i); |
843 | } |
850 | } |
844 | |
|
|
845 | static int lastmortals = 0;//D |
|
|
846 | |
|
|
847 | if (mortals.size() != lastmortals && lastmortals > 100)//D |
|
|
848 | { |
|
|
849 | lastmortals = mortals.size ();//D |
|
|
850 | LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D |
|
|
851 | } |
|
|
852 | } |
851 | } |
853 | |
852 | |
854 | object::object () |
853 | object::object () |
855 | { |
854 | { |
856 | SET_FLAG (this, FLAG_REMOVED); |
855 | SET_FLAG (this, FLAG_REMOVED); |
… | |
… | |
915 | |
914 | |
916 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
915 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
917 | remove_friendly_object (this); |
916 | remove_friendly_object (this); |
918 | |
917 | |
919 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
918 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
920 | remove_ob (this); |
919 | remove (); |
921 | |
920 | |
922 | SET_FLAG (this, FLAG_FREED); |
921 | SET_FLAG (this, FLAG_FREED); |
923 | |
922 | |
924 | if (more) |
923 | if (more) |
925 | { |
924 | { |
… | |
… | |
950 | |
949 | |
951 | while (op) |
950 | while (op) |
952 | { |
951 | { |
953 | object *tmp = op->below; |
952 | object *tmp = op->below; |
954 | |
953 | |
955 | remove_ob (op); |
954 | op->remove (); |
956 | |
955 | |
957 | if (QUERY_FLAG (op, FLAG_STARTEQUIP) |
956 | if (QUERY_FLAG (op, FLAG_STARTEQUIP) |
958 | || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) |
957 | || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) |
959 | free_object (op); |
958 | op->destroy (); |
960 | else |
959 | else |
961 | { |
960 | { |
962 | op->x = x; |
961 | op->x = x; |
963 | op->y = y; |
962 | op->y = y; |
964 | insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */ |
963 | insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */ |
… | |
… | |
967 | op = tmp; |
966 | op = tmp; |
968 | } |
967 | } |
969 | } |
968 | } |
970 | } |
969 | } |
971 | |
970 | |
|
|
971 | // hack to ensure that freed objects still have a valid map |
|
|
972 | { |
|
|
973 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
|
|
974 | |
|
|
975 | if (!freed_map) |
|
|
976 | { |
|
|
977 | freed_map = new maptile; |
|
|
978 | |
|
|
979 | freed_map->name = "/internal/freed_objects_map"; |
|
|
980 | freed_map->width = 3; |
|
|
981 | freed_map->height = 3; |
|
|
982 | |
|
|
983 | freed_map->allocate (); |
|
|
984 | } |
|
|
985 | |
|
|
986 | map = freed_map; |
|
|
987 | x = 1; |
|
|
988 | y = 1; |
|
|
989 | } |
|
|
990 | |
972 | // clear those pointers that likely might have circular references to us |
991 | // clear those pointers that likely might have circular references to us |
973 | owner = 0; |
992 | owner = 0; |
974 | enemy = 0; |
993 | enemy = 0; |
975 | attacked_by = 0; |
994 | attacked_by = 0; |
976 | |
995 | |
… | |
… | |
988 | |
1007 | |
989 | /* |
1008 | /* |
990 | * sub_weight() recursively (outwards) subtracts a number from the |
1009 | * sub_weight() recursively (outwards) subtracts a number from the |
991 | * weight of an object (and what is carried by it's environment(s)). |
1010 | * weight of an object (and what is carried by it's environment(s)). |
992 | */ |
1011 | */ |
993 | |
|
|
994 | void |
1012 | void |
995 | sub_weight (object *op, signed long weight) |
1013 | sub_weight (object *op, signed long weight) |
996 | { |
1014 | { |
997 | while (op != NULL) |
1015 | while (op != NULL) |
998 | { |
1016 | { |
… | |
… | |
1002 | op->carrying -= weight; |
1020 | op->carrying -= weight; |
1003 | op = op->env; |
1021 | op = op->env; |
1004 | } |
1022 | } |
1005 | } |
1023 | } |
1006 | |
1024 | |
1007 | /* remove_ob(op): |
1025 | /* op->remove (): |
1008 | * This function removes the object op from the linked list of objects |
1026 | * This function removes the object op from the linked list of objects |
1009 | * which it is currently tied to. When this function is done, the |
1027 | * which it is currently tied to. When this function is done, the |
1010 | * object will have no environment. If the object previously had an |
1028 | * object will have no environment. If the object previously had an |
1011 | * environment, the x and y coordinates will be updated to |
1029 | * environment, the x and y coordinates will be updated to |
1012 | * the previous environment. |
1030 | * the previous environment. |
1013 | * Beware: This function is called from the editor as well! |
1031 | * Beware: This function is called from the editor as well! |
1014 | */ |
1032 | */ |
1015 | |
|
|
1016 | void |
1033 | void |
1017 | remove_ob (object *op) |
1034 | object::remove () |
1018 | { |
1035 | { |
1019 | object *tmp, *last = 0; |
1036 | object *tmp, *last = 0; |
1020 | object *otmp; |
1037 | object *otmp; |
1021 | |
1038 | |
1022 | int check_walk_off; |
1039 | int check_walk_off; |
1023 | maptile *m; |
|
|
1024 | |
1040 | |
1025 | sint16 x, y; |
|
|
1026 | |
|
|
1027 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1041 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
1028 | return; |
1042 | return; |
1029 | |
1043 | |
1030 | SET_FLAG (op, FLAG_REMOVED); |
1044 | SET_FLAG (this, FLAG_REMOVED); |
1031 | |
1045 | |
1032 | if (op->more != NULL) |
1046 | if (more) |
1033 | remove_ob (op->more); |
1047 | more->remove (); |
1034 | |
1048 | |
1035 | /* |
1049 | /* |
1036 | * In this case, the object to be removed is in someones |
1050 | * In this case, the object to be removed is in someones |
1037 | * inventory. |
1051 | * inventory. |
1038 | */ |
1052 | */ |
1039 | if (op->env != NULL) |
1053 | if (env) |
1040 | { |
1054 | { |
1041 | if (op->nrof) |
1055 | if (nrof) |
1042 | sub_weight (op->env, op->weight * op->nrof); |
1056 | sub_weight (env, weight * nrof); |
1043 | else |
1057 | else |
1044 | sub_weight (op->env, op->weight + op->carrying); |
1058 | sub_weight (env, weight + carrying); |
1045 | |
1059 | |
1046 | /* NO_FIX_PLAYER is set when a great many changes are being |
1060 | /* NO_FIX_PLAYER is set when a great many changes are being |
1047 | * made to players inventory. If set, avoiding the call |
1061 | * made to players inventory. If set, avoiding the call |
1048 | * to save cpu time. |
1062 | * to save cpu time. |
1049 | */ |
1063 | */ |
1050 | if ((otmp = is_player_inv (op->env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1064 | if ((otmp = is_player_inv (env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1051 | fix_player (otmp); |
1065 | fix_player (otmp); |
1052 | |
1066 | |
1053 | if (op->above != NULL) |
1067 | if (above != NULL) |
1054 | op->above->below = op->below; |
1068 | above->below = below; |
1055 | else |
1069 | else |
1056 | op->env->inv = op->below; |
1070 | env->inv = below; |
1057 | |
1071 | |
1058 | if (op->below != NULL) |
1072 | if (below != NULL) |
1059 | op->below->above = op->above; |
1073 | below->above = above; |
1060 | |
1074 | |
1061 | /* we set up values so that it could be inserted into |
1075 | /* we set up values so that it could be inserted into |
1062 | * the map, but we don't actually do that - it is up |
1076 | * the map, but we don't actually do that - it is up |
1063 | * to the caller to decide what we want to do. |
1077 | * to the caller to decide what we want to do. |
1064 | */ |
1078 | */ |
1065 | op->x = op->env->x, op->y = op->env->y; |
1079 | x = env->x, y = env->y; |
1066 | op->map = op->env->map; |
1080 | map = env->map; |
1067 | op->above = NULL, op->below = NULL; |
1081 | above = 0, below = 0; |
1068 | op->env = NULL; |
1082 | env = 0; |
1069 | } |
1083 | } |
1070 | else if (op->map) |
1084 | else if (map) |
1071 | { |
1085 | { |
1072 | x = op->x; |
|
|
1073 | y = op->y; |
|
|
1074 | m = get_map_from_coord (op->map, &x, &y); |
|
|
1075 | |
|
|
1076 | if (!m) |
|
|
1077 | { |
|
|
1078 | LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n", |
|
|
1079 | op->map->path, op->x, op->y); |
|
|
1080 | /* in old days, we used to set x and y to 0 and continue. |
|
|
1081 | * it seems if we get into this case, something is probablye |
|
|
1082 | * screwed up and should be fixed. |
|
|
1083 | */ |
|
|
1084 | abort (); |
|
|
1085 | } |
|
|
1086 | |
|
|
1087 | if (op->map != m) |
|
|
1088 | LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n", |
|
|
1089 | op->map->path, m->path, op->x, op->y, x, y); |
|
|
1090 | |
|
|
1091 | /* Re did the following section of code - it looks like it had |
1086 | /* Re did the following section of code - it looks like it had |
1092 | * lots of logic for things we no longer care about |
1087 | * lots of logic for things we no longer care about |
1093 | */ |
1088 | */ |
1094 | |
1089 | |
1095 | /* link the object above us */ |
1090 | /* link the object above us */ |
1096 | if (op->above) |
1091 | if (above) |
1097 | op->above->below = op->below; |
1092 | above->below = below; |
1098 | else |
1093 | else |
1099 | SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */ |
1094 | SET_MAP_TOP (map, x, y, below); /* we were top, set new top */ |
1100 | |
1095 | |
1101 | /* Relink the object below us, if there is one */ |
1096 | /* Relink the object below us, if there is one */ |
1102 | if (op->below) |
1097 | if (below) |
1103 | op->below->above = op->above; |
1098 | below->above = above; |
1104 | else |
1099 | else |
1105 | { |
1100 | { |
1106 | /* Nothing below, which means we need to relink map object for this space |
1101 | /* Nothing below, which means we need to relink map object for this space |
1107 | * use translated coordinates in case some oddness with map tiling is |
1102 | * use translated coordinates in case some oddness with map tiling is |
1108 | * evident |
1103 | * evident |
1109 | */ |
1104 | */ |
1110 | if (GET_MAP_OB (m, x, y) != op) |
1105 | if (GET_MAP_OB (map, x, y) != this) |
1111 | { |
1106 | { |
1112 | char *dump = dump_object (op); |
1107 | char *dump = dump_object (this); |
1113 | LOG (llevError, |
1108 | LOG (llevError, |
1114 | "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); |
1109 | "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); |
1115 | free (dump); |
1110 | free (dump); |
1116 | dump = dump_object (GET_MAP_OB (m, x, y)); |
1111 | dump = dump_object (GET_MAP_OB (map, x, y)); |
1117 | LOG (llevError, "%s\n", dump); |
1112 | LOG (llevError, "%s\n", dump); |
1118 | free (dump); |
1113 | free (dump); |
1119 | } |
1114 | } |
1120 | |
1115 | |
1121 | SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ |
1116 | SET_MAP_OB (map, x, y, above); /* goes on above it. */ |
1122 | } |
1117 | } |
1123 | |
1118 | |
1124 | op->above = 0; |
1119 | above = 0; |
1125 | op->below = 0; |
1120 | below = 0; |
1126 | |
1121 | |
1127 | if (op->map->in_memory == MAP_SAVING) |
1122 | if (map->in_memory == MAP_SAVING) |
1128 | return; |
1123 | return; |
1129 | |
1124 | |
1130 | check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); |
1125 | check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY); |
1131 | |
1126 | |
1132 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1127 | for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above) |
1133 | { |
1128 | { |
1134 | /* No point updating the players look faces if he is the object |
1129 | /* No point updating the players look faces if he is the object |
1135 | * being removed. |
1130 | * being removed. |
1136 | */ |
1131 | */ |
1137 | |
1132 | |
1138 | if (tmp->type == PLAYER && tmp != op) |
1133 | if (tmp->type == PLAYER && tmp != this) |
1139 | { |
1134 | { |
1140 | /* If a container that the player is currently using somehow gets |
1135 | /* If a container that the player is currently using somehow gets |
1141 | * removed (most likely destroyed), update the player view |
1136 | * removed (most likely destroyed), update the player view |
1142 | * appropriately. |
1137 | * appropriately. |
1143 | */ |
1138 | */ |
1144 | if (tmp->container == op) |
1139 | if (tmp->container == this) |
1145 | { |
1140 | { |
1146 | CLEAR_FLAG (op, FLAG_APPLIED); |
1141 | CLEAR_FLAG (this, FLAG_APPLIED); |
1147 | tmp->container = NULL; |
1142 | tmp->container = 0; |
1148 | } |
1143 | } |
1149 | |
1144 | |
1150 | tmp->contr->socket.update_look = 1; |
1145 | tmp->contr->socket.update_look = 1; |
1151 | } |
1146 | } |
1152 | |
1147 | |
1153 | /* See if player moving off should effect something */ |
1148 | /* See if player moving off should effect something */ |
1154 | if (check_walk_off |
1149 | if (check_walk_off |
1155 | && ((op->move_type & tmp->move_off) |
1150 | && ((move_type & tmp->move_off) |
1156 | && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1151 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1157 | { |
1152 | { |
1158 | move_apply (tmp, op, NULL); |
1153 | move_apply (tmp, this, 0); |
1159 | |
1154 | |
1160 | if (op->destroyed ()) |
1155 | if (destroyed ()) |
1161 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1156 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1162 | } |
1157 | } |
1163 | |
1158 | |
1164 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1159 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1165 | |
1160 | |
1166 | if (tmp->above == tmp) |
1161 | if (tmp->above == tmp) |
1167 | tmp->above = NULL; |
1162 | tmp->above = 0; |
1168 | |
1163 | |
1169 | last = tmp; |
1164 | last = tmp; |
1170 | } |
1165 | } |
1171 | |
1166 | |
1172 | /* last == NULL of there are no objects on this space */ |
1167 | /* last == NULL of there are no objects on this space */ |
1173 | if (last == NULL) |
1168 | if (!last) |
1174 | { |
1169 | { |
1175 | /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, |
1170 | /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, |
1176 | * we could preserve the flags (GET_MAP_FLAGS), but update_position figures |
1171 | * we could preserve the flags (GET_MAP_FLAGS), but update_position figures |
1177 | * those out anyways, and if there are any flags set right now, they won't |
1172 | * those out anyways, and if there are any flags set right now, they won't |
1178 | * be correct anyways. |
1173 | * be correct anyways. |
1179 | */ |
1174 | */ |
1180 | SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE); |
1175 | SET_MAP_FLAGS (map, x, y, P_NEED_UPDATE); |
1181 | update_position (op->map, op->x, op->y); |
1176 | update_position (map, x, y); |
1182 | } |
1177 | } |
1183 | else |
1178 | else |
1184 | update_object (last, UP_OBJ_REMOVE); |
1179 | update_object (last, UP_OBJ_REMOVE); |
1185 | |
1180 | |
1186 | if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0)) |
1181 | if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius) |
1187 | update_all_los (op->map, op->x, op->y); |
1182 | update_all_los (map, x, y); |
1188 | } |
1183 | } |
1189 | } |
1184 | } |
1190 | |
1185 | |
1191 | /* |
1186 | /* |
1192 | * merge_ob(op,top): |
1187 | * merge_ob(op,top): |
… | |
… | |
1207 | |
1202 | |
1208 | for (; top != NULL; top = top->below) |
1203 | for (; top != NULL; top = top->below) |
1209 | { |
1204 | { |
1210 | if (top == op) |
1205 | if (top == op) |
1211 | continue; |
1206 | continue; |
1212 | if (CAN_MERGE (op, top)) |
1207 | |
|
|
1208 | if (object::can_merge (op, top)) |
1213 | { |
1209 | { |
1214 | top->nrof += op->nrof; |
1210 | top->nrof += op->nrof; |
1215 | |
1211 | |
1216 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1212 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1217 | op->weight = 0; /* Don't want any adjustements now */ |
1213 | op->weight = 0; /* Don't want any adjustements now */ |
1218 | remove_ob (op); |
1214 | op->destroy (); |
1219 | free_object (op); |
|
|
1220 | return top; |
1215 | return top; |
1221 | } |
1216 | } |
1222 | } |
1217 | } |
1223 | |
1218 | |
1224 | return 0; |
1219 | return 0; |
… | |
… | |
1351 | |
1346 | |
1352 | /* this has to be done after we translate the coordinates. |
1347 | /* this has to be done after we translate the coordinates. |
1353 | */ |
1348 | */ |
1354 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1349 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1355 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1350 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1356 | if (CAN_MERGE (op, tmp)) |
1351 | if (object::can_merge (op, tmp)) |
1357 | { |
1352 | { |
1358 | op->nrof += tmp->nrof; |
1353 | op->nrof += tmp->nrof; |
1359 | remove_ob (tmp); |
1354 | tmp->destroy (); |
1360 | free_object (tmp); |
|
|
1361 | } |
1355 | } |
1362 | |
1356 | |
1363 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1357 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1364 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1358 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1365 | |
1359 | |
… | |
… | |
1551 | tmp1; |
1545 | tmp1; |
1552 | |
1546 | |
1553 | /* first search for itself and remove any old instances */ |
1547 | /* first search for itself and remove any old instances */ |
1554 | |
1548 | |
1555 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1549 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1556 | { |
|
|
1557 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1550 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1558 | { |
1551 | tmp->destroy (); |
1559 | remove_ob (tmp); |
|
|
1560 | free_object (tmp); |
|
|
1561 | } |
|
|
1562 | } |
|
|
1563 | |
1552 | |
1564 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1553 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1565 | |
1554 | |
1566 | tmp1->x = op->x; |
1555 | tmp1->x = op->x; |
1567 | tmp1->y = op->y; |
1556 | tmp1->y = op->y; |
… | |
… | |
1577 | */ |
1566 | */ |
1578 | |
1567 | |
1579 | object * |
1568 | object * |
1580 | get_split_ob (object *orig_ob, uint32 nr) |
1569 | get_split_ob (object *orig_ob, uint32 nr) |
1581 | { |
1570 | { |
1582 | object * |
1571 | object *newob; |
1583 | newob; |
|
|
1584 | int |
|
|
1585 | is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1572 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1586 | |
1573 | |
1587 | if (orig_ob->nrof < nr) |
1574 | if (orig_ob->nrof < nr) |
1588 | { |
1575 | { |
1589 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
1576 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
1590 | return NULL; |
1577 | return NULL; |
1591 | } |
1578 | } |
1592 | |
1579 | |
1593 | newob = object_create_clone (orig_ob); |
1580 | newob = object_create_clone (orig_ob); |
1594 | |
1581 | |
1595 | if ((orig_ob->nrof -= nr) < 1) |
1582 | if ((orig_ob->nrof -= nr) < 1) |
1596 | { |
1583 | orig_ob->destroy (1); |
1597 | if (!is_removed) |
|
|
1598 | remove_ob (orig_ob); |
|
|
1599 | free_object2 (orig_ob, 1); |
|
|
1600 | } |
|
|
1601 | else if (!is_removed) |
1584 | else if (!is_removed) |
1602 | { |
1585 | { |
1603 | if (orig_ob->env != NULL) |
1586 | if (orig_ob->env != NULL) |
1604 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
1587 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
1605 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
1588 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
… | |
… | |
1669 | esrv_send_item (tmp, op); |
1652 | esrv_send_item (tmp, op); |
1670 | } |
1653 | } |
1671 | } |
1654 | } |
1672 | else |
1655 | else |
1673 | { |
1656 | { |
1674 | remove_ob (op); |
1657 | op->remove (); |
1675 | op->nrof = 0; |
1658 | op->nrof = 0; |
1676 | if (tmp) |
1659 | if (tmp) |
1677 | { |
1660 | { |
1678 | esrv_del_item (tmp->contr, op->count); |
1661 | esrv_del_item (tmp->contr, op->count); |
1679 | } |
1662 | } |
… | |
… | |
1685 | |
1668 | |
1686 | if (i < op->nrof) |
1669 | if (i < op->nrof) |
1687 | op->nrof -= i; |
1670 | op->nrof -= i; |
1688 | else |
1671 | else |
1689 | { |
1672 | { |
1690 | remove_ob (op); |
1673 | op->remove (); |
1691 | op->nrof = 0; |
1674 | op->nrof = 0; |
1692 | } |
1675 | } |
1693 | |
1676 | |
1694 | /* Since we just removed op, op->above is null */ |
1677 | /* Since we just removed op, op->above is null */ |
1695 | for (tmp = above; tmp != NULL; tmp = tmp->above) |
1678 | for (tmp = above; tmp != NULL; tmp = tmp->above) |
… | |
… | |
1704 | |
1687 | |
1705 | if (op->nrof) |
1688 | if (op->nrof) |
1706 | return op; |
1689 | return op; |
1707 | else |
1690 | else |
1708 | { |
1691 | { |
1709 | free_object (op); |
1692 | op->destroy (); |
1710 | return NULL; |
1693 | return NULL; |
1711 | } |
1694 | } |
1712 | } |
1695 | } |
1713 | |
1696 | |
1714 | /* |
1697 | /* |
… | |
… | |
1727 | op->carrying += weight; |
1710 | op->carrying += weight; |
1728 | op = op->env; |
1711 | op = op->env; |
1729 | } |
1712 | } |
1730 | } |
1713 | } |
1731 | |
1714 | |
1732 | /* |
|
|
1733 | * insert_ob_in_ob(op,environment): |
|
|
1734 | * This function inserts the object op in the linked list |
|
|
1735 | * inside the object environment. |
|
|
1736 | * |
|
|
1737 | * Eneq(@csd.uu.se): Altered insert_ob_in_ob to make things picked up enter |
|
|
1738 | * the inventory at the last position or next to other objects of the same |
|
|
1739 | * type. |
|
|
1740 | * Frank: Now sorted by type, archetype and magic! |
|
|
1741 | * |
|
|
1742 | * The function returns now pointer to inserted item, and return value can |
|
|
1743 | * be != op, if items are merged. -Tero |
|
|
1744 | */ |
|
|
1745 | |
|
|
1746 | object * |
1715 | object * |
1747 | insert_ob_in_ob (object *op, object *where) |
1716 | insert_ob_in_ob (object *op, object *where) |
1748 | { |
1717 | { |
1749 | object * |
1718 | if (!where) |
1750 | tmp, * |
|
|
1751 | otmp; |
|
|
1752 | |
|
|
1753 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1754 | { |
|
|
1755 | char *dump = dump_object (op); |
|
|
1756 | LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", dump); |
|
|
1757 | free (dump); |
|
|
1758 | return op; |
|
|
1759 | } |
|
|
1760 | |
|
|
1761 | if (where == NULL) |
|
|
1762 | { |
1719 | { |
1763 | char *dump = dump_object (op); |
1720 | char *dump = dump_object (op); |
1764 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1721 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1765 | free (dump); |
1722 | free (dump); |
1766 | return op; |
1723 | return op; |
1767 | } |
1724 | } |
1768 | |
1725 | |
1769 | if (where->head) |
1726 | if (where->head) |
1770 | { |
1727 | { |
1771 | LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n"); |
1728 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1772 | where = where->head; |
1729 | where = where->head; |
1773 | } |
1730 | } |
|
|
1731 | |
|
|
1732 | return where->insert (op); |
|
|
1733 | } |
|
|
1734 | |
|
|
1735 | /* |
|
|
1736 | * env->insert (op) |
|
|
1737 | * This function inserts the object op in the linked list |
|
|
1738 | * inside the object environment. |
|
|
1739 | * |
|
|
1740 | * The function returns now pointer to inserted item, and return value can |
|
|
1741 | * be != op, if items are merged. -Tero |
|
|
1742 | */ |
|
|
1743 | |
|
|
1744 | object * |
|
|
1745 | object::insert (object *op) |
|
|
1746 | { |
|
|
1747 | object *tmp, *otmp; |
|
|
1748 | |
|
|
1749 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1750 | op->remove (); |
1774 | |
1751 | |
1775 | if (op->more) |
1752 | if (op->more) |
1776 | { |
1753 | { |
1777 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1754 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1778 | return op; |
1755 | return op; |
… | |
… | |
1780 | |
1757 | |
1781 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1758 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1782 | CLEAR_FLAG (op, FLAG_REMOVED); |
1759 | CLEAR_FLAG (op, FLAG_REMOVED); |
1783 | if (op->nrof) |
1760 | if (op->nrof) |
1784 | { |
1761 | { |
1785 | for (tmp = where->inv; tmp != NULL; tmp = tmp->below) |
1762 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1786 | if (CAN_MERGE (tmp, op)) |
1763 | if (object::can_merge (tmp, op)) |
1787 | { |
1764 | { |
1788 | /* return the original object and remove inserted object |
1765 | /* return the original object and remove inserted object |
1789 | (client needs the original object) */ |
1766 | (client needs the original object) */ |
1790 | tmp->nrof += op->nrof; |
1767 | tmp->nrof += op->nrof; |
1791 | /* Weight handling gets pretty funky. Since we are adding to |
1768 | /* Weight handling gets pretty funky. Since we are adding to |
1792 | * tmp->nrof, we need to increase the weight. |
1769 | * tmp->nrof, we need to increase the weight. |
1793 | */ |
1770 | */ |
1794 | add_weight (where, op->weight * op->nrof); |
1771 | add_weight (this, op->weight * op->nrof); |
1795 | SET_FLAG (op, FLAG_REMOVED); |
1772 | SET_FLAG (op, FLAG_REMOVED); |
1796 | free_object (op); /* free the inserted object */ |
1773 | op->destroy (); /* free the inserted object */ |
1797 | op = tmp; |
1774 | op = tmp; |
1798 | remove_ob (op); /* and fix old object's links */ |
1775 | op->remove (); /* and fix old object's links */ |
1799 | CLEAR_FLAG (op, FLAG_REMOVED); |
1776 | CLEAR_FLAG (op, FLAG_REMOVED); |
1800 | break; |
1777 | break; |
1801 | } |
1778 | } |
1802 | |
1779 | |
1803 | /* I assume combined objects have no inventory |
1780 | /* I assume combined objects have no inventory |
1804 | * We add the weight - this object could have just been removed |
1781 | * We add the weight - this object could have just been removed |
1805 | * (if it was possible to merge). calling remove_ob will subtract |
1782 | * (if it was possible to merge). calling remove_ob will subtract |
1806 | * the weight, so we need to add it in again, since we actually do |
1783 | * the weight, so we need to add it in again, since we actually do |
1807 | * the linking below |
1784 | * the linking below |
1808 | */ |
1785 | */ |
1809 | add_weight (where, op->weight * op->nrof); |
1786 | add_weight (this, op->weight * op->nrof); |
1810 | } |
1787 | } |
1811 | else |
1788 | else |
1812 | add_weight (where, (op->weight + op->carrying)); |
1789 | add_weight (this, (op->weight + op->carrying)); |
1813 | |
1790 | |
1814 | otmp = is_player_inv (where); |
1791 | otmp = is_player_inv (this); |
1815 | if (otmp && otmp->contr != NULL) |
1792 | if (otmp && otmp->contr) |
1816 | { |
|
|
1817 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1793 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1818 | fix_player (otmp); |
1794 | fix_player (otmp); |
1819 | } |
|
|
1820 | |
1795 | |
1821 | op->map = NULL; |
1796 | op->map = NULL; |
1822 | op->env = where; |
1797 | op->env = this; |
1823 | op->above = NULL; |
1798 | op->above = NULL; |
1824 | op->below = NULL; |
1799 | op->below = NULL; |
1825 | op->x = 0, op->y = 0; |
1800 | op->x = 0, op->y = 0; |
1826 | |
1801 | |
1827 | /* reset the light list and los of the players on the map */ |
1802 | /* reset the light list and los of the players on the map */ |
1828 | if ((op->glow_radius != 0) && where->map) |
1803 | if ((op->glow_radius != 0) && map) |
1829 | { |
1804 | { |
1830 | #ifdef DEBUG_LIGHTS |
1805 | #ifdef DEBUG_LIGHTS |
1831 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1806 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1832 | #endif /* DEBUG_LIGHTS */ |
1807 | #endif /* DEBUG_LIGHTS */ |
1833 | if (MAP_DARKNESS (where->map)) |
1808 | if (MAP_DARKNESS (map)) |
1834 | update_all_los (where->map, where->x, where->y); |
1809 | update_all_los (map, x, y); |
1835 | } |
1810 | } |
1836 | |
1811 | |
1837 | /* Client has no idea of ordering so lets not bother ordering it here. |
1812 | /* Client has no idea of ordering so lets not bother ordering it here. |
1838 | * It sure simplifies this function... |
1813 | * It sure simplifies this function... |
1839 | */ |
1814 | */ |
1840 | if (where->inv == NULL) |
1815 | if (!inv) |
1841 | where->inv = op; |
1816 | inv = op; |
1842 | else |
1817 | else |
1843 | { |
1818 | { |
1844 | op->below = where->inv; |
1819 | op->below = inv; |
1845 | op->below->above = op; |
1820 | op->below->above = op; |
1846 | where->inv = op; |
1821 | inv = op; |
1847 | } |
1822 | } |
|
|
1823 | |
1848 | return op; |
1824 | return op; |
1849 | } |
1825 | } |
1850 | |
1826 | |
1851 | /* |
1827 | /* |
1852 | * Checks if any objects has a move_type that matches objects |
1828 | * Checks if any objects has a move_type that matches objects |
… | |
… | |
2541 | * create clone from object to another |
2517 | * create clone from object to another |
2542 | */ |
2518 | */ |
2543 | object * |
2519 | object * |
2544 | object_create_clone (object *asrc) |
2520 | object_create_clone (object *asrc) |
2545 | { |
2521 | { |
2546 | object * |
|
|
2547 | dst = NULL, *tmp, *src, *part, *prev, *item; |
2522 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2548 | |
2523 | |
2549 | if (!asrc) |
2524 | if (!asrc) |
2550 | return NULL; |
2525 | return 0; |
|
|
2526 | |
2551 | src = asrc; |
2527 | src = asrc; |
2552 | if (src->head) |
2528 | if (src->head) |
2553 | src = src->head; |
2529 | src = src->head; |
2554 | |
2530 | |
2555 | prev = NULL; |
2531 | prev = 0; |
2556 | for (part = src; part; part = part->more) |
2532 | for (part = src; part; part = part->more) |
2557 | { |
2533 | { |
2558 | tmp = get_object (); |
2534 | tmp = part->clone (); |
2559 | copy_object (part, tmp); |
|
|
2560 | tmp->x -= src->x; |
2535 | tmp->x -= src->x; |
2561 | tmp->y -= src->y; |
2536 | tmp->y -= src->y; |
|
|
2537 | |
2562 | if (!part->head) |
2538 | if (!part->head) |
2563 | { |
2539 | { |
2564 | dst = tmp; |
2540 | dst = tmp; |
2565 | tmp->head = NULL; |
2541 | tmp->head = 0; |
2566 | } |
2542 | } |
2567 | else |
2543 | else |
2568 | { |
2544 | { |
2569 | tmp->head = dst; |
2545 | tmp->head = dst; |
2570 | } |
2546 | } |
|
|
2547 | |
2571 | tmp->more = NULL; |
2548 | tmp->more = 0; |
|
|
2549 | |
2572 | if (prev) |
2550 | if (prev) |
2573 | prev->more = tmp; |
2551 | prev->more = tmp; |
|
|
2552 | |
2574 | prev = tmp; |
2553 | prev = tmp; |
2575 | } |
2554 | } |
2576 | |
2555 | |
2577 | for (item = src->inv; item; item = item->below) |
2556 | for (item = src->inv; item; item = item->below) |
2578 | insert_ob_in_ob (object_create_clone (item), dst); |
2557 | insert_ob_in_ob (object_create_clone (item), dst); |
… | |
… | |
2604 | } |
2583 | } |
2605 | |
2584 | |
2606 | fprintf (tempfile, obstr); |
2585 | fprintf (tempfile, obstr); |
2607 | fclose (tempfile); |
2586 | fclose (tempfile); |
2608 | |
2587 | |
2609 | op = get_object (); |
2588 | op = object::create (); |
2610 | |
2589 | |
2611 | object_thawer thawer (filename); |
2590 | object_thawer thawer (filename); |
2612 | |
2591 | |
2613 | if (thawer) |
2592 | if (thawer) |
2614 | load_object (thawer, op, 0); |
2593 | load_object (thawer, op, 0); |