ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/object.C
(Generate patch)

Comparing deliantra/server/common/object.C (file contents):
Revision 1.111 by root, Mon Jan 8 01:19:02 2007 UTC vs.
Revision 1.140 by root, Tue Apr 24 12:32:14 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game
3 3 *
4 Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
5 Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team
6 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
7 7 *
8 This program is free software; you can redistribute it and/or modify 8 * This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version. 11 * (at your option) any later version.
12 12 *
13 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details. 16 * GNU General Public License for more details.
17 17 *
18 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software 19 * along with this program; if not, write to the Free Software
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 21 *
22 The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail at <crossfire@schmorp.de>
23*/ 23 */
24 24
25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. 25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26 sub/add_weight will transcend the environment updating the carrying 26 sub/add_weight will transcend the environment updating the carrying
27 variable. */ 27 variable. */
28#include <global.h> 28#include <global.h>
… …
357/* 357/*
358 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. 358 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
359 * Some error messages. 359 * Some error messages.
360 * The result of the dump is stored in the static global errmsg array. 360 * The result of the dump is stored in the static global errmsg array.
361 */ 361 */
362
363char * 362char *
364dump_object (object *op) 363dump_object (object *op)
365{ 364{
366 if (!op) 365 if (!op)
367 return strdup ("[NULLOBJ]"); 366 return strdup ("[NULLOBJ]");
368 367
369 object_freezer freezer; 368 object_freezer freezer;
370 save_object (freezer, op, 1); 369 op->write (freezer);
371 return freezer.as_string (); 370 return freezer.as_string ();
372} 371}
373 372
374/* 373/*
375 * get_nearest_part(multi-object, object 2) returns the part of the 374 * get_nearest_part(multi-object, object 2) returns the part of the
… …
395 * Returns the object which has the count-variable equal to the argument. 394 * Returns the object which has the count-variable equal to the argument.
396 */ 395 */
397object * 396object *
398find_object (tag_t i) 397find_object (tag_t i)
399{ 398{
400 return ((unsigned int)i) < objects.size () 399 for_all_objects (op)
401 ? objects [i] 400 if (op->count == i)
402 : 0; 401 return op;
402
403 return 0;
403} 404}
404 405
405/* 406/*
406 * Returns the first object which has a name equal to the argument. 407 * Returns the first object which has a name equal to the argument.
407 * Used only by the patch command, but not all that useful. 408 * Used only by the patch command, but not all that useful.
… …
453 * refcounts and freeing the links. 454 * refcounts and freeing the links.
454 */ 455 */
455static void 456static void
456free_key_values (object *op) 457free_key_values (object *op)
457{ 458{
458 for (key_value *i = op->key_values; i != 0;) 459 for (key_value *i = op->key_values; i; )
459 { 460 {
460 key_value *next = i->next; 461 key_value *next = i->next;
461 delete i; 462 delete i;
462 463
463 i = next; 464 i = next;
464 } 465 }
465 466
466 op->key_values = 0; 467 op->key_values = 0;
467} 468}
468 469
469/* 470object &
470 * copy_to first frees everything allocated by the dst object, 471object::operator =(const object &src)
471 * and then copies the contents of itself into the second
472 * object, allocating what needs to be allocated. Basically, any
473 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
474 * if the first object is freed, the pointers in the new object
475 * will point at garbage.
476 */
477void
478object::copy_to (object *dst)
479{ 472{
480 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 473 bool is_freed = flag [FLAG_FREED];
481 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 474 bool is_removed = flag [FLAG_REMOVED];
482 475
483 *(object_copy *)dst = *this; 476 *(object_copy *)this = src;
484 477
485 if (is_freed) 478 flag [FLAG_FREED] = is_freed;
486 SET_FLAG (dst, FLAG_FREED); 479 flag [FLAG_REMOVED] = is_removed;
487
488 if (is_removed)
489 SET_FLAG (dst, FLAG_REMOVED);
490
491 if (speed < 0)
492 dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
493 480
494 /* Copy over key_values, if any. */ 481 /* Copy over key_values, if any. */
495 if (key_values) 482 if (src.key_values)
496 { 483 {
497 key_value *tail = 0; 484 key_value *tail = 0;
498 key_value *i;
499
500 dst->key_values = 0; 485 key_values = 0;
501 486
502 for (i = key_values; i; i = i->next) 487 for (key_value *i = src.key_values; i; i = i->next)
503 { 488 {
504 key_value *new_link = new key_value; 489 key_value *new_link = new key_value;
505 490
506 new_link->next = 0; 491 new_link->next = 0;
507 new_link->key = i->key; 492 new_link->key = i->key;
508 new_link->value = i->value; 493 new_link->value = i->value;
509 494
510 /* Try and be clever here, too. */ 495 /* Try and be clever here, too. */
511 if (!dst->key_values) 496 if (!key_values)
512 { 497 {
513 dst->key_values = new_link; 498 key_values = new_link;
514 tail = new_link; 499 tail = new_link;
515 } 500 }
516 else 501 else
517 { 502 {
518 tail->next = new_link; 503 tail->next = new_link;
519 tail = new_link; 504 tail = new_link;
520 } 505 }
521 } 506 }
522 } 507 }
508}
509
510/*
511 * copy_to first frees everything allocated by the dst object,
512 * and then copies the contents of itself into the second
513 * object, allocating what needs to be allocated. Basically, any
514 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
515 * if the first object is freed, the pointers in the new object
516 * will point at garbage.
517 */
518void
519object::copy_to (object *dst)
520{
521 *dst = *this;
522
523 if (speed < 0)
524 dst->speed_left = speed_left - rndm ();
523 525
524 dst->set_speed (dst->speed); 526 dst->set_speed (dst->speed);
527}
528
529void
530object::instantiate ()
531{
532 if (!uuid.seq) // HACK
533 uuid = gen_uuid ();
534
535 speed_left = -0.1f;
536 /* copy the body_info to the body_used - this is only really
537 * need for monsters, but doesn't hurt to do it for everything.
538 * by doing so, when a monster is created, it has good starting
539 * values for the body_used info, so when items are created
540 * for it, they can be properly equipped.
541 */
542 memcpy (body_used, body_info, sizeof (body_used));
543
544 attachable::instantiate ();
525} 545}
526 546
527object * 547object *
528object::clone () 548object::clone ()
529{ 549{
… …
587 * UP_OBJ_FACE: only the objects face has changed. 607 * UP_OBJ_FACE: only the objects face has changed.
588 */ 608 */
589void 609void
590update_object (object *op, int action) 610update_object (object *op, int action)
591{ 611{
592 MoveType move_on, move_off, move_block, move_slow;
593
594 if (op == NULL) 612 if (op == NULL)
595 { 613 {
596 /* this should never happen */ 614 /* this should never happen */
597 LOG (llevDebug, "update_object() called for NULL object.\n"); 615 LOG (llevDebug, "update_object() called for NULL object.\n");
598 return; 616 return;
… …
658 676
659 if (op->more) 677 if (op->more)
660 update_object (op->more, action); 678 update_object (op->more, action);
661} 679}
662 680
663object *object::first;
664
665object::object () 681object::object ()
666{ 682{
667 SET_FLAG (this, FLAG_REMOVED); 683 SET_FLAG (this, FLAG_REMOVED);
668 684
669 expmul = 1.0; 685 expmul = 1.0;
670 face = blank_face; 686 face = blank_face;
671} 687}
672 688
673object::~object () 689object::~object ()
674{ 690{
691 unlink ();
692
675 free_key_values (this); 693 free_key_values (this);
676} 694}
677 695
696static int object_count;
697
678void object::link () 698void object::link ()
679{ 699{
680 assert (!count);//D 700 assert (!index);//D
681 uuid = gen_uuid (); 701 uuid = gen_uuid ();
702 count = ++object_count;
682 703
683 refcnt_inc (); 704 refcnt_inc ();
684 objects.insert (this); 705 objects.insert (this);
685} 706}
686 707
687void object::unlink () 708void object::unlink ()
688{ 709{
689 assert (count);//D 710 if (!index)
711 return;
712
690 objects.erase (this); 713 objects.erase (this);
691 refcnt_dec (); 714 refcnt_dec ();
692} 715}
693 716
694void 717void
… …
768 * drop on that space. 791 * drop on that space.
769 */ 792 */
770 if (!drop_to_ground 793 if (!drop_to_ground
771 || !map 794 || !map
772 || map->in_memory != MAP_IN_MEMORY 795 || map->in_memory != MAP_IN_MEMORY
796 || map->nodrop
773 || ms ().move_block == MOVE_ALL) 797 || ms ().move_block == MOVE_ALL)
774 { 798 {
775 while (inv) 799 while (inv)
776 { 800 {
777 inv->destroy_inv (drop_to_ground); 801 inv->destroy_inv (drop_to_ground);
… …
805} 829}
806 830
807void 831void
808object::do_destroy () 832object::do_destroy ()
809{ 833{
834 attachable::do_destroy ();
835
810 if (flag [FLAG_IS_LINKED]) 836 if (flag [FLAG_IS_LINKED])
811 remove_button_link (this); 837 remove_button_link (this);
812 838
813 if (flag [FLAG_FRIENDLY]) 839 if (flag [FLAG_FRIENDLY])
814 remove_friendly_object (this); 840 remove_friendly_object (this);
815 841
816 if (!flag [FLAG_REMOVED]) 842 if (!flag [FLAG_REMOVED])
817 remove (); 843 remove ();
818 844
819 if (flag [FLAG_FREED]) 845 destroy_inv (true);
820 return;
821 846
822 set_speed (0); 847 deactivate ();
848 unlink ();
823 849
824 flag [FLAG_FREED] = 1; 850 flag [FLAG_FREED] = 1;
825
826 attachable::do_destroy ();
827
828 destroy_inv (true);
829 unlink ();
830 851
831 // hack to ensure that freed objects still have a valid map 852 // hack to ensure that freed objects still have a valid map
832 { 853 {
833 static maptile *freed_map; // freed objects are moved here to avoid crashes 854 static maptile *freed_map; // freed objects are moved here to avoid crashes
834 855
… …
896 * This function removes the object op from the linked list of objects 917 * This function removes the object op from the linked list of objects
897 * which it is currently tied to. When this function is done, the 918 * which it is currently tied to. When this function is done, the
898 * object will have no environment. If the object previously had an 919 * object will have no environment. If the object previously had an
899 * environment, the x and y coordinates will be updated to 920 * environment, the x and y coordinates will be updated to
900 * the previous environment. 921 * the previous environment.
901 * Beware: This function is called from the editor as well!
902 */ 922 */
903void 923void
904object::remove () 924object::do_remove ()
905{ 925{
906 object *tmp, *last = 0; 926 object *tmp, *last = 0;
907 object *otmp; 927 object *otmp;
908 928
909 if (QUERY_FLAG (this, FLAG_REMOVED)) 929 if (QUERY_FLAG (this, FLAG_REMOVED))
… …
952 } 972 }
953 else if (map) 973 else if (map)
954 { 974 {
955 if (type == PLAYER) 975 if (type == PLAYER)
956 { 976 {
977 // leaving a spot always closes any open container on the ground
978 if (container && !container->env)
979 // this causes spurious floorbox updates, but it ensures
980 // that the CLOSE event is being sent.
981 close_container ();
982
957 --map->players; 983 --map->players;
958 map->touch (); 984 map->touch ();
959 } 985 }
960 986
961 map->dirty = true; 987 map->dirty = true;
988 mapspace &ms = this->ms ();
962 989
963 /* link the object above us */ 990 /* link the object above us */
964 if (above) 991 if (above)
965 above->below = below; 992 above->below = below;
966 else 993 else
967 map->at (x, y).top = below; /* we were top, set new top */ 994 ms.top = below; /* we were top, set new top */
968 995
969 /* Relink the object below us, if there is one */ 996 /* Relink the object below us, if there is one */
970 if (below) 997 if (below)
971 below->above = above; 998 below->above = above;
972 else 999 else
… …
974 /* Nothing below, which means we need to relink map object for this space 1001 /* Nothing below, which means we need to relink map object for this space
975 * use translated coordinates in case some oddness with map tiling is 1002 * use translated coordinates in case some oddness with map tiling is
976 * evident 1003 * evident
977 */ 1004 */
978 if (GET_MAP_OB (map, x, y) != this) 1005 if (GET_MAP_OB (map, x, y) != this)
979 {
980 char *dump = dump_object (this);
981 LOG (llevError,
982 "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); 1006 LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
983 free (dump);
984 dump = dump_object (GET_MAP_OB (map, x, y));
985 LOG (llevError, "%s\n", dump);
986 free (dump);
987 }
988 1007
989 map->at (x, y).bot = above; /* goes on above it. */ 1008 ms.bot = above; /* goes on above it. */
990 } 1009 }
991 1010
992 above = 0; 1011 above = 0;
993 below = 0; 1012 below = 0;
994 1013
995 if (map->in_memory == MAP_SAVING) 1014 if (map->in_memory == MAP_SAVING)
996 return; 1015 return;
997 1016
998 int check_walk_off = !flag [FLAG_NO_APPLY]; 1017 int check_walk_off = !flag [FLAG_NO_APPLY];
999 1018
1000 for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above) 1019 for (tmp = ms.bot; tmp; tmp = tmp->above)
1001 { 1020 {
1002 /* No point updating the players look faces if he is the object 1021 /* No point updating the players look faces if he is the object
1003 * being removed. 1022 * being removed.
1004 */ 1023 */
1005 1024
… …
1085 } 1104 }
1086 1105
1087 return 0; 1106 return 0;
1088} 1107}
1089 1108
1109void
1110object::expand_tail ()
1111{
1112 if (more)
1113 return;
1114
1115 object *prev = this;
1116
1117 for (archetype *at = arch->more; at; at = at->more)
1118 {
1119 object *op = arch_to_object (at);
1120
1121 op->name = name;
1122 op->name_pl = name_pl;
1123 op->title = title;
1124
1125 op->head = this;
1126 prev->more = op;
1127
1128 prev = op;
1129 }
1130}
1131
1090/* 1132/*
1091 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1133 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1092 * job preparing multi-part monsters 1134 * job preparing multi-part monsters.
1093 */ 1135 */
1094object * 1136object *
1095insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1137insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1096{ 1138{
1097 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1139 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
… …
1124 * just 'op' otherwise 1166 * just 'op' otherwise
1125 */ 1167 */
1126object * 1168object *
1127insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1169insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1128{ 1170{
1171 assert (!op->flag [FLAG_FREED]);
1172
1129 object *tmp, *top, *floor = NULL; 1173 object *tmp, *top, *floor = NULL;
1130 sint16 x, y;
1131 1174
1132 if (QUERY_FLAG (op, FLAG_FREED)) 1175 op->remove ();
1133 {
1134 LOG (llevError, "Trying to insert freed object!\n");
1135 return NULL;
1136 }
1137 1176
1138 if (!m) 1177#if 0
1139 { 1178 if (!m->active != !op->active)
1140 char *dump = dump_object (op); 1179 if (m->active)
1141 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1180 op->activate_recursive ();
1142 free (dump); 1181 else
1143 return op; 1182 op->deactivate_recursive ();
1144 } 1183#endif
1145 1184
1146 if (out_of_map (m, op->x, op->y)) 1185 if (out_of_map (m, op->x, op->y))
1147 { 1186 {
1148 char *dump = dump_object (op);
1149 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1187 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1150#ifdef MANY_CORES 1188#ifdef MANY_CORES
1151 /* Better to catch this here, as otherwise the next use of this object 1189 /* Better to catch this here, as otherwise the next use of this object
1152 * is likely to cause a crash. Better to find out where it is getting 1190 * is likely to cause a crash. Better to find out where it is getting
1153 * improperly inserted. 1191 * improperly inserted.
1154 */ 1192 */
1155 abort (); 1193 abort ();
1156#endif 1194#endif
1157 free (dump);
1158 return op; 1195 return op;
1159 } 1196 }
1160 1197
1161 if (!QUERY_FLAG (op, FLAG_REMOVED))
1162 {
1163 char *dump = dump_object (op);
1164 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1165 free (dump);
1166 return op;
1167 }
1168
1169 if (op->more)
1170 {
1171 /* The part may be on a different map. */
1172
1173 object *more = op->more; 1198 if (object *more = op->more)
1174 1199 {
1175 /* We really need the caller to normalise coordinates - if
1176 * we set the map, that doesn't work if the location is within
1177 * a map and this is straddling an edge. So only if coordinate
1178 * is clear wrong do we normalise it.
1179 */
1180 if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1181 more->map = get_map_from_coord (m, &more->x, &more->y);
1182 else if (!more->map)
1183 {
1184 /* For backwards compatibility - when not dealing with tiled maps,
1185 * more->map should always point to the parent.
1186 */
1187 more->map = m;
1188 }
1189
1190 if (insert_ob_in_map (more, more->map, originator, flag) == NULL) 1200 if (!insert_ob_in_map (more, m, originator, flag))
1191 { 1201 {
1192 if (!op->head) 1202 if (!op->head)
1193 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); 1203 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1194 1204
1195 return 0; 1205 return 0;
… …
1200 1210
1201 /* Ideally, the caller figures this out. However, it complicates a lot 1211 /* Ideally, the caller figures this out. However, it complicates a lot
1202 * of areas of callers (eg, anything that uses find_free_spot would now 1212 * of areas of callers (eg, anything that uses find_free_spot would now
1203 * need extra work 1213 * need extra work
1204 */ 1214 */
1205 op->map = get_map_from_coord (m, &op->x, &op->y); 1215 if (!xy_normalise (m, op->x, op->y))
1206 x = op->x; 1216 return 0;
1207 y = op->y; 1217
1218 op->map = m;
1219 mapspace &ms = op->ms ();
1208 1220
1209 /* this has to be done after we translate the coordinates. 1221 /* this has to be done after we translate the coordinates.
1210 */ 1222 */
1211 if (op->nrof && !(flag & INS_NO_MERGE)) 1223 if (op->nrof && !(flag & INS_NO_MERGE))
1212 for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above) 1224 for (tmp = ms.bot; tmp; tmp = tmp->above)
1213 if (object::can_merge (op, tmp)) 1225 if (object::can_merge (op, tmp))
1214 { 1226 {
1215 op->nrof += tmp->nrof; 1227 op->nrof += tmp->nrof;
1216 tmp->destroy (); 1228 tmp->destroy ();
1217 } 1229 }
… …
1234 op->below = originator->below; 1246 op->below = originator->below;
1235 1247
1236 if (op->below) 1248 if (op->below)
1237 op->below->above = op; 1249 op->below->above = op;
1238 else 1250 else
1239 op->ms ().bot = op; 1251 ms.bot = op;
1240 1252
1241 /* since *below* originator, no need to update top */ 1253 /* since *below* originator, no need to update top */
1242 originator->below = op; 1254 originator->below = op;
1243 } 1255 }
1244 else 1256 else
1245 { 1257 {
1258 top = ms.bot;
1259
1246 /* If there are other objects, then */ 1260 /* If there are other objects, then */
1247 if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) 1261 if ((!(flag & INS_MAP_LOAD)) && top)
1248 { 1262 {
1249 object *last = 0; 1263 object *last = 0;
1250 1264
1251 /* 1265 /*
1252 * If there are multiple objects on this space, we do some trickier handling. 1266 * If there are multiple objects on this space, we do some trickier handling.
… …
1258 * once we get to them. This reduces the need to traverse over all of 1272 * once we get to them. This reduces the need to traverse over all of
1259 * them when adding another one - this saves quite a bit of cpu time 1273 * them when adding another one - this saves quite a bit of cpu time
1260 * when lots of spells are cast in one area. Currently, it is presumed 1274 * when lots of spells are cast in one area. Currently, it is presumed
1261 * that flying non pickable objects are spell objects. 1275 * that flying non pickable objects are spell objects.
1262 */ 1276 */
1263 while (top) 1277 for (top = ms.bot; top; top = top->above)
1264 { 1278 {
1265 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) 1279 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1266 floor = top; 1280 floor = top;
1267 1281
1268 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) 1282 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
… …
1271 top = top->below; 1285 top = top->below;
1272 break; 1286 break;
1273 } 1287 }
1274 1288
1275 last = top; 1289 last = top;
1276 top = top->above;
1277 } 1290 }
1278 1291
1279 /* Don't want top to be NULL, so set it to the last valid object */ 1292 /* Don't want top to be NULL, so set it to the last valid object */
1280 top = last; 1293 top = last;
1281 1294
… …
1283 * looks like instead of lots of conditions here. 1296 * looks like instead of lots of conditions here.
1284 * makes things faster, and effectively the same result. 1297 * makes things faster, and effectively the same result.
1285 */ 1298 */
1286 1299
1287 /* Have object 'fall below' other objects that block view. 1300 /* Have object 'fall below' other objects that block view.
1288 * Unless those objects are exits, type 66 1301 * Unless those objects are exits.
1289 * If INS_ON_TOP is used, don't do this processing 1302 * If INS_ON_TOP is used, don't do this processing
1290 * Need to find the object that in fact blocks view, otherwise 1303 * Need to find the object that in fact blocks view, otherwise
1291 * stacking is a bit odd. 1304 * stacking is a bit odd.
1292 */ 1305 */
1293 if (!(flag & INS_ON_TOP) && 1306 if (!(flag & INS_ON_TOP)
1294 (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) 1307 && ms.flags () & P_BLOCKSVIEW
1308 && (op->face && !faces [op->face].visibility))
1295 { 1309 {
1296 for (last = top; last != floor; last = last->below) 1310 for (last = top; last != floor; last = last->below)
1297 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1311 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1298 break; 1312 break;
1313
1299 /* Check to see if we found the object that blocks view, 1314 /* Check to see if we found the object that blocks view,
1300 * and make sure we have a below pointer for it so that 1315 * and make sure we have a below pointer for it so that
1301 * we can get inserted below this one, which requires we 1316 * we can get inserted below this one, which requires we
1302 * set top to the object below us. 1317 * set top to the object below us.
1303 */ 1318 */
… …
1305 top = last->below; 1320 top = last->below;
1306 } 1321 }
1307 } /* If objects on this space */ 1322 } /* If objects on this space */
1308 1323
1309 if (flag & INS_MAP_LOAD) 1324 if (flag & INS_MAP_LOAD)
1310 top = GET_MAP_TOP (op->map, op->x, op->y); 1325 top = ms.top;
1311 1326
1312 if (flag & INS_ABOVE_FLOOR_ONLY) 1327 if (flag & INS_ABOVE_FLOOR_ONLY)
1313 top = floor; 1328 top = floor;
1314 1329
1315 /* Top is the object that our object (op) is going to get inserted above. 1330 /* Top is the object that our object (op) is going to get inserted above.
1316 */ 1331 */
1317 1332
1318 /* First object on this space */ 1333 /* First object on this space */
1319 if (!top) 1334 if (!top)
1320 { 1335 {
1321 op->above = GET_MAP_OB (op->map, op->x, op->y); 1336 op->above = ms.bot;
1322 1337
1323 if (op->above) 1338 if (op->above)
1324 op->above->below = op; 1339 op->above->below = op;
1325 1340
1326 op->below = 0; 1341 op->below = 0;
1327 op->ms ().bot = op; 1342 ms.bot = op;
1328 } 1343 }
1329 else 1344 else
1330 { /* get inserted into the stack above top */ 1345 { /* get inserted into the stack above top */
1331 op->above = top->above; 1346 op->above = top->above;
1332 1347
… …
1336 op->below = top; 1351 op->below = top;
1337 top->above = op; 1352 top->above = op;
1338 } 1353 }
1339 1354
1340 if (!op->above) 1355 if (!op->above)
1341 op->ms ().top = op; 1356 ms.top = op;
1342 } /* else not INS_BELOW_ORIGINATOR */ 1357 } /* else not INS_BELOW_ORIGINATOR */
1343 1358
1344 if (op->type == PLAYER) 1359 if (op->type == PLAYER)
1345 { 1360 {
1346 op->contr->do_los = 1; 1361 op->contr->do_los = 1;
… …
1352 1367
1353 /* If we have a floor, we know the player, if any, will be above 1368 /* If we have a floor, we know the player, if any, will be above
1354 * it, so save a few ticks and start from there. 1369 * it, so save a few ticks and start from there.
1355 */ 1370 */
1356 if (!(flag & INS_MAP_LOAD)) 1371 if (!(flag & INS_MAP_LOAD))
1357 if (object *pl = op->ms ().player ()) 1372 if (object *pl = ms.player ())
1358 if (pl->contr->ns) 1373 if (pl->contr->ns)
1359 pl->contr->ns->floorbox_update (); 1374 pl->contr->ns->floorbox_update ();
1360 1375
1361 /* If this object glows, it may affect lighting conditions that are 1376 /* If this object glows, it may affect lighting conditions that are
1362 * visible to others on this map. But update_all_los is really 1377 * visible to others on this map. But update_all_los is really
… …
1424} 1439}
1425 1440
1426object * 1441object *
1427object::insert_at (object *where, object *originator, int flags) 1442object::insert_at (object *where, object *originator, int flags)
1428{ 1443{
1429 where->map->insert (this, where->x, where->y, originator, flags); 1444 return where->map->insert (this, where->x, where->y, originator, flags);
1430} 1445}
1431 1446
1432/* 1447/*
1433 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1448 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1434 * is returned contains nr objects, and the remaining parts contains 1449 * is returned contains nr objects, and the remaining parts contains
… …
1474 * the amount of an object. If the amount reaches 0, the object 1489 * the amount of an object. If the amount reaches 0, the object
1475 * is subsequently removed and freed. 1490 * is subsequently removed and freed.
1476 * 1491 *
1477 * Return value: 'op' if something is left, NULL if the amount reached 0 1492 * Return value: 'op' if something is left, NULL if the amount reached 0
1478 */ 1493 */
1479
1480object * 1494object *
1481decrease_ob_nr (object *op, uint32 i) 1495decrease_ob_nr (object *op, uint32 i)
1482{ 1496{
1483 object *tmp; 1497 object *tmp;
1484 1498
… …
1559 1573
1560/* 1574/*
1561 * add_weight(object, weight) adds the specified weight to an object, 1575 * add_weight(object, weight) adds the specified weight to an object,
1562 * and also updates how much the environment(s) is/are carrying. 1576 * and also updates how much the environment(s) is/are carrying.
1563 */ 1577 */
1564
1565void 1578void
1566add_weight (object *op, signed long weight) 1579add_weight (object *op, signed long weight)
1567{ 1580{
1568 while (op != NULL) 1581 while (op != NULL)
1569 { 1582 {
… …
1601 * inside the object environment. 1614 * inside the object environment.
1602 * 1615 *
1603 * The function returns now pointer to inserted item, and return value can 1616 * The function returns now pointer to inserted item, and return value can
1604 * be != op, if items are merged. -Tero 1617 * be != op, if items are merged. -Tero
1605 */ 1618 */
1606
1607object * 1619object *
1608object::insert (object *op) 1620object::insert (object *op)
1609{ 1621{
1610 object *tmp, *otmp; 1622 object *tmp, *otmp;
1611 1623
… …
1771 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1783 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1772 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) 1784 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1773 { 1785 {
1774 1786
1775 float 1787 float
1776 diff = tmp->move_slow_penalty * FABS (op->speed); 1788 diff = tmp->move_slow_penalty * fabs (op->speed);
1777 1789
1778 if (op->type == PLAYER) 1790 if (op->type == PLAYER)
1779 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 1791 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1780 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) 1792 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1781 diff /= 4.0; 1793 diff /= 4.0;
… …
1988 } 2000 }
1989 2001
1990 if (!index) 2002 if (!index)
1991 return -1; 2003 return -1;
1992 2004
1993 return altern[RANDOM () % index]; 2005 return altern [rndm (index)];
1994} 2006}
1995 2007
1996/* 2008/*
1997 * find_first_free_spot(archetype, maptile, x, y) works like 2009 * find_first_free_spot(archetype, maptile, x, y) works like
1998 * find_free_spot(), but it will search max number of squares. 2010 * find_free_spot(), but it will search max number of squares.
… …
2019{ 2031{
2020 arr += begin; 2032 arr += begin;
2021 end -= begin; 2033 end -= begin;
2022 2034
2023 while (--end) 2035 while (--end)
2024 swap (arr [end], arr [RANDOM () % (end + 1)]); 2036 swap (arr [end], arr [rndm (end + 1)]);
2025} 2037}
2026 2038
2027/* new function to make monster searching more efficient, and effective! 2039/* new function to make monster searching more efficient, and effective!
2028 * This basically returns a randomized array (in the passed pointer) of 2040 * This basically returns a randomized array (in the passed pointer) of
2029 * the spaces to find monsters. In this way, it won't always look for 2041 * the spaces to find monsters. In this way, it won't always look for
… …
2163 2175
2164 return 3; 2176 return 3;
2165} 2177}
2166 2178
2167/* 2179/*
2168 * absdir(int): Returns a number between 1 and 8, which represent
2169 * the "absolute" direction of a number (it actually takes care of
2170 * "overflow" in previous calculations of a direction).
2171 */
2172
2173int
2174absdir (int d)
2175{
2176 while (d < 1)
2177 d += 8;
2178
2179 while (d > 8)
2180 d -= 8;
2181
2182 return d;
2183}
2184
2185/*
2186 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is 2180 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2187 * between two directions (which are expected to be absolute (see absdir()) 2181 * between two directions (which are expected to be absolute (see absdir())
2188 */ 2182 */
2189
2190int 2183int
2191dirdiff (int dir1, int dir2) 2184dirdiff (int dir1, int dir2)
2192{ 2185{
2193 int d; 2186 int d;
2194 2187
… …
2360 insert_ob_in_ob (object_create_clone (item), dst); 2353 insert_ob_in_ob (object_create_clone (item), dst);
2361 2354
2362 return dst; 2355 return dst;
2363} 2356}
2364 2357
2365/* GROS - Creates an object using a string representing its content. */
2366/* Basically, we save the content of the string to a temp file, then call */
2367/* load_object on it. I admit it is a highly inefficient way to make things, */
2368/* but it was simple to make and allows reusing the load_object function. */
2369/* Remember not to use load_object_str in a time-critical situation. */
2370/* Also remember that multiparts objects are not supported for now. */
2371object *
2372load_object_str (const char *obstr)
2373{
2374 object *op;
2375 char filename[MAX_BUF];
2376
2377 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2378
2379 FILE *tempfile = fopen (filename, "w");
2380
2381 if (tempfile == NULL)
2382 {
2383 LOG (llevError, "Error - Unable to access load object temp file\n");
2384 return NULL;
2385 }
2386
2387 fprintf (tempfile, obstr);
2388 fclose (tempfile);
2389
2390 op = object::create ();
2391
2392 object_thawer thawer (filename);
2393
2394 if (thawer)
2395 load_object (thawer, op, 0);
2396
2397 LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2398 CLEAR_FLAG (op, FLAG_REMOVED);
2399
2400 return op;
2401}
2402
2403/* This returns the first object in who's inventory that 2358/* This returns the first object in who's inventory that
2404 * has the same type and subtype match. 2359 * has the same type and subtype match.
2405 * returns NULL if no match. 2360 * returns NULL if no match.
2406 */ 2361 */
2407object * 2362object *
… …
2460 if (link->key == canonical_key) 2415 if (link->key == canonical_key)
2461 return link->value; 2416 return link->value;
2462 2417
2463 return 0; 2418 return 0;
2464} 2419}
2465
2466 2420
2467/* 2421/*
2468 * Updates the canonical_key in op to value. 2422 * Updates the canonical_key in op to value.
2469 * 2423 *
2470 * canonical_key is a shared string (value doesn't have to be). 2424 * canonical_key is a shared string (value doesn't have to be).
… …
2610{ 2564{
2611 char flagdesc[512]; 2565 char flagdesc[512];
2612 char info2[256 * 4]; 2566 char info2[256 * 4];
2613 char *p = info; 2567 char *p = info;
2614 2568
2615 p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}", 2569 p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2616 count, uuid.seq, 2570 count, uuid.seq,
2617 &name, 2571 &name,
2618 title ? "\",title:" : "", 2572 title ? "\",title:\"" : "",
2619 title ? (const char *)title : "", 2573 title ? (const char *)title : "",
2620 flag_desc (flagdesc, 512), type); 2574 flag_desc (flagdesc, 512), type);
2621 2575
2622 if (env) 2576 if (env)
2623 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); 2577 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
… …
2633{ 2587{
2634 static char info[256 * 4]; 2588 static char info[256 * 4];
2635 return debug_desc (info); 2589 return debug_desc (info);
2636} 2590}
2637 2591
2592const char *
2593object::debug_desc2 () const
2594{
2595 static char info[256 * 4];
2596 return debug_desc (info);
2597}
2598
2599struct region *
2600object::region () const
2601{
2602 return map ? map->region (x, y)
2603 : region::default_region ();
2604}
2605
2606const materialtype_t *
2607object::dominant_material () const
2608{
2609 if (materialtype_t *mat = name_to_material (materialname))
2610 return mat;
2611
2612 // omfg this is slow, this has to be temporary :)
2613 shstr unknown ("unknown");
2614
2615 return name_to_material (unknown);
2616}
2617
2618void
2619object::open_container (object *new_container)
2620{
2621 if (container == new_container)
2622 return;
2623
2624 if (object *old_container = container)
2625 {
2626 if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2627 return;
2628
2629#if 0
2630 // remove the "Close old_container" object.
2631 if (object *closer = old_container->inv)
2632 if (closer->type == CLOSE_CON)
2633 closer->destroy ();
2634#endif
2635
2636 old_container->flag [FLAG_APPLIED] = 0;
2637 container = 0;
2638
2639 esrv_update_item (UPD_FLAGS, this, old_container);
2640 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2641 }
2642
2643 if (new_container)
2644 {
2645 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
2646 return;
2647
2648 // TODO: this does not seem to serve any purpose anymore?
2649#if 0
2650 // insert the "Close Container" object.
2651 if (archetype *closer = new_container->other_arch)
2652 {
2653 object *closer = arch_to_object (new_container->other_arch);
2654 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2655 new_container->insert (closer);
2656 }
2657#endif
2658
2659 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2660
2661 new_container->flag [FLAG_APPLIED] = 1;
2662 container = new_container;
2663
2664 esrv_update_item (UPD_FLAGS, this, new_container);
2665 esrv_send_inventory (this, new_container);
2666 }
2667}
2668
2669

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines