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.109 by root, Sun Jan 7 21:54:59 2007 UTC vs.
Revision 1.141 by root, Sun Apr 29 21:44:34 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>
… …
313 313
314 /* Everything passes, must be OK. */ 314 /* Everything passes, must be OK. */
315 return 1; 315 return 1;
316} 316}
317 317
318void
319player::set_range (rangetype r)
320{
321 shoottype = r;
322}
323
318/* 324/*
319 * sum_weight() is a recursive function which calculates the weight 325 * sum_weight() is a recursive function which calculates the weight
320 * an object is carrying. It goes through in figures out how much 326 * an object is carrying. It goes through in figures out how much
321 * containers are carrying, and sums it up. 327 * containers are carrying, and sums it up.
322 */ 328 */
… …
357/* 363/*
358 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. 364 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
359 * Some error messages. 365 * Some error messages.
360 * The result of the dump is stored in the static global errmsg array. 366 * The result of the dump is stored in the static global errmsg array.
361 */ 367 */
362
363char * 368char *
364dump_object (object *op) 369dump_object (object *op)
365{ 370{
366 if (!op) 371 if (!op)
367 return strdup ("[NULLOBJ]"); 372 return strdup ("[NULLOBJ]");
368 373
369 object_freezer freezer; 374 object_freezer freezer;
370 save_object (freezer, op, 1); 375 op->write (freezer);
371 return freezer.as_string (); 376 return freezer.as_string ();
372} 377}
373 378
374/* 379/*
375 * get_nearest_part(multi-object, object 2) returns the part of the 380 * 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. 400 * Returns the object which has the count-variable equal to the argument.
396 */ 401 */
397object * 402object *
398find_object (tag_t i) 403find_object (tag_t i)
399{ 404{
400 return ((unsigned int)i) < objects.size () 405 for_all_objects (op)
401 ? objects [i] 406 if (op->count == i)
402 : 0; 407 return op;
408
409 return 0;
403} 410}
404 411
405/* 412/*
406 * Returns the first object which has a name equal to the argument. 413 * Returns the first object which has a name equal to the argument.
407 * Used only by the patch command, but not all that useful. 414 * Used only by the patch command, but not all that useful.
… …
453 * refcounts and freeing the links. 460 * refcounts and freeing the links.
454 */ 461 */
455static void 462static void
456free_key_values (object *op) 463free_key_values (object *op)
457{ 464{
458 for (key_value *i = op->key_values; i != 0;) 465 for (key_value *i = op->key_values; i; )
459 { 466 {
460 key_value *next = i->next; 467 key_value *next = i->next;
461 delete i; 468 delete i;
462 469
463 i = next; 470 i = next;
464 } 471 }
465 472
466 op->key_values = 0; 473 op->key_values = 0;
467} 474}
468 475
469/* 476object &
470 * copy_to first frees everything allocated by the dst object, 477object::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{ 478{
480 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 479 bool is_freed = flag [FLAG_FREED];
481 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 480 bool is_removed = flag [FLAG_REMOVED];
482 481
483 *(object_copy *)dst = *this; 482 *(object_copy *)this = src;
484 483
485 if (is_freed) 484 flag [FLAG_FREED] = is_freed;
486 SET_FLAG (dst, FLAG_FREED); 485 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 486
494 /* Copy over key_values, if any. */ 487 /* Copy over key_values, if any. */
495 if (key_values) 488 if (src.key_values)
496 { 489 {
497 key_value *tail = 0; 490 key_value *tail = 0;
498 key_value *i;
499
500 dst->key_values = 0; 491 key_values = 0;
501 492
502 for (i = key_values; i; i = i->next) 493 for (key_value *i = src.key_values; i; i = i->next)
503 { 494 {
504 key_value *new_link = new key_value; 495 key_value *new_link = new key_value;
505 496
506 new_link->next = 0; 497 new_link->next = 0;
507 new_link->key = i->key; 498 new_link->key = i->key;
508 new_link->value = i->value; 499 new_link->value = i->value;
509 500
510 /* Try and be clever here, too. */ 501 /* Try and be clever here, too. */
511 if (!dst->key_values) 502 if (!key_values)
512 { 503 {
513 dst->key_values = new_link; 504 key_values = new_link;
514 tail = new_link; 505 tail = new_link;
515 } 506 }
516 else 507 else
517 { 508 {
518 tail->next = new_link; 509 tail->next = new_link;
519 tail = new_link; 510 tail = new_link;
520 } 511 }
521 } 512 }
522 } 513 }
514}
515
516/*
517 * copy_to first frees everything allocated by the dst object,
518 * and then copies the contents of itself into the second
519 * object, allocating what needs to be allocated. Basically, any
520 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
521 * if the first object is freed, the pointers in the new object
522 * will point at garbage.
523 */
524void
525object::copy_to (object *dst)
526{
527 *dst = *this;
528
529 if (speed < 0)
530 dst->speed_left = speed_left - rndm ();
523 531
524 dst->set_speed (dst->speed); 532 dst->set_speed (dst->speed);
533}
534
535void
536object::instantiate ()
537{
538 if (!uuid.seq) // HACK
539 uuid = gen_uuid ();
540
541 speed_left = -0.1f;
542 /* copy the body_info to the body_used - this is only really
543 * need for monsters, but doesn't hurt to do it for everything.
544 * by doing so, when a monster is created, it has good starting
545 * values for the body_used info, so when items are created
546 * for it, they can be properly equipped.
547 */
548 memcpy (body_used, body_info, sizeof (body_used));
549
550 attachable::instantiate ();
525} 551}
526 552
527object * 553object *
528object::clone () 554object::clone ()
529{ 555{
… …
587 * UP_OBJ_FACE: only the objects face has changed. 613 * UP_OBJ_FACE: only the objects face has changed.
588 */ 614 */
589void 615void
590update_object (object *op, int action) 616update_object (object *op, int action)
591{ 617{
592 MoveType move_on, move_off, move_block, move_slow;
593
594 if (op == NULL) 618 if (op == NULL)
595 { 619 {
596 /* this should never happen */ 620 /* this should never happen */
597 LOG (llevDebug, "update_object() called for NULL object.\n"); 621 LOG (llevDebug, "update_object() called for NULL object.\n");
598 return; 622 return;
… …
658 682
659 if (op->more) 683 if (op->more)
660 update_object (op->more, action); 684 update_object (op->more, action);
661} 685}
662 686
663object *object::first;
664
665object::object () 687object::object ()
666{ 688{
667 SET_FLAG (this, FLAG_REMOVED); 689 SET_FLAG (this, FLAG_REMOVED);
668 690
669 expmul = 1.0; 691 expmul = 1.0;
670 face = blank_face; 692 face = blank_face;
671} 693}
672 694
673object::~object () 695object::~object ()
674{ 696{
697 unlink ();
698
675 free_key_values (this); 699 free_key_values (this);
676} 700}
677 701
702static int object_count;
703
678void object::link () 704void object::link ()
679{ 705{
706 assert (!index);//D
680 uuid = gen_uuid (); 707 uuid = gen_uuid ();
708 count = ++object_count;
681 709
682 refcnt_inc (); 710 refcnt_inc ();
683 objects.insert (this); 711 objects.insert (this);
684} 712}
685 713
686void object::unlink () 714void object::unlink ()
687{ 715{
716 if (!index)
717 return;
718
688 objects.erase (this); 719 objects.erase (this);
689 refcnt_dec (); 720 refcnt_dec ();
690} 721}
691 722
692void 723void
… …
766 * drop on that space. 797 * drop on that space.
767 */ 798 */
768 if (!drop_to_ground 799 if (!drop_to_ground
769 || !map 800 || !map
770 || map->in_memory != MAP_IN_MEMORY 801 || map->in_memory != MAP_IN_MEMORY
802 || map->nodrop
771 || ms ().move_block == MOVE_ALL) 803 || ms ().move_block == MOVE_ALL)
772 { 804 {
773 while (inv) 805 while (inv)
774 { 806 {
775 inv->destroy_inv (drop_to_ground); 807 inv->destroy_inv (drop_to_ground);
… …
784 816
785 if (op->flag [FLAG_STARTEQUIP] 817 if (op->flag [FLAG_STARTEQUIP]
786 || op->flag [FLAG_NO_DROP] 818 || op->flag [FLAG_NO_DROP]
787 || op->type == RUNE 819 || op->type == RUNE
788 || op->type == TRAP 820 || op->type == TRAP
789 || op->flag [FLAG_IS_A_TEMPLATE]) 821 || op->flag [FLAG_IS_A_TEMPLATE]
822 || op->flag [FLAG_DESTROY_ON_DEATH])
790 op->destroy (); 823 op->destroy ();
791 else 824 else
792 map->insert (op, x, y); 825 map->insert (op, x, y);
793 } 826 }
794 } 827 }
… …
802} 835}
803 836
804void 837void
805object::do_destroy () 838object::do_destroy ()
806{ 839{
840 attachable::do_destroy ();
841
807 if (flag [FLAG_IS_LINKED]) 842 if (flag [FLAG_IS_LINKED])
808 remove_button_link (this); 843 remove_button_link (this);
809 844
810 if (flag [FLAG_FRIENDLY]) 845 if (flag [FLAG_FRIENDLY])
811 remove_friendly_object (this); 846 remove_friendly_object (this);
812 847
813 if (!flag [FLAG_REMOVED]) 848 if (!flag [FLAG_REMOVED])
814 remove (); 849 remove ();
815 850
816 if (flag [FLAG_FREED]) 851 destroy_inv (true);
817 return;
818 852
819 set_speed (0); 853 deactivate ();
854 unlink ();
820 855
821 flag [FLAG_FREED] = 1; 856 flag [FLAG_FREED] = 1;
822
823 attachable::do_destroy ();
824
825 destroy_inv (true);
826 unlink ();
827 857
828 // hack to ensure that freed objects still have a valid map 858 // hack to ensure that freed objects still have a valid map
829 { 859 {
830 static maptile *freed_map; // freed objects are moved here to avoid crashes 860 static maptile *freed_map; // freed objects are moved here to avoid crashes
831 861
… …
893 * This function removes the object op from the linked list of objects 923 * This function removes the object op from the linked list of objects
894 * which it is currently tied to. When this function is done, the 924 * which it is currently tied to. When this function is done, the
895 * object will have no environment. If the object previously had an 925 * object will have no environment. If the object previously had an
896 * environment, the x and y coordinates will be updated to 926 * environment, the x and y coordinates will be updated to
897 * the previous environment. 927 * the previous environment.
898 * Beware: This function is called from the editor as well!
899 */ 928 */
900void 929void
901object::remove () 930object::do_remove ()
902{ 931{
903 object *tmp, *last = 0; 932 object *tmp, *last = 0;
904 object *otmp; 933 object *otmp;
905 934
906 if (QUERY_FLAG (this, FLAG_REMOVED)) 935 if (QUERY_FLAG (this, FLAG_REMOVED))
… …
949 } 978 }
950 else if (map) 979 else if (map)
951 { 980 {
952 if (type == PLAYER) 981 if (type == PLAYER)
953 { 982 {
983 // leaving a spot always closes any open container on the ground
984 if (container && !container->env)
985 // this causes spurious floorbox updates, but it ensures
986 // that the CLOSE event is being sent.
987 close_container ();
988
954 --map->players; 989 --map->players;
955 map->touch (); 990 map->touch ();
956 } 991 }
957 992
958 map->dirty = true; 993 map->dirty = true;
994 mapspace &ms = this->ms ();
959 995
960 /* link the object above us */ 996 /* link the object above us */
961 if (above) 997 if (above)
962 above->below = below; 998 above->below = below;
963 else 999 else
964 map->at (x, y).top = below; /* we were top, set new top */ 1000 ms.top = below; /* we were top, set new top */
965 1001
966 /* Relink the object below us, if there is one */ 1002 /* Relink the object below us, if there is one */
967 if (below) 1003 if (below)
968 below->above = above; 1004 below->above = above;
969 else 1005 else
… …
971 /* Nothing below, which means we need to relink map object for this space 1007 /* Nothing below, which means we need to relink map object for this space
972 * use translated coordinates in case some oddness with map tiling is 1008 * use translated coordinates in case some oddness with map tiling is
973 * evident 1009 * evident
974 */ 1010 */
975 if (GET_MAP_OB (map, x, y) != this) 1011 if (GET_MAP_OB (map, x, y) != this)
976 {
977 char *dump = dump_object (this);
978 LOG (llevError,
979 "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); 1012 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 ());
980 free (dump);
981 dump = dump_object (GET_MAP_OB (map, x, y));
982 LOG (llevError, "%s\n", dump);
983 free (dump);
984 }
985 1013
986 map->at (x, y).bot = above; /* goes on above it. */ 1014 ms.bot = above; /* goes on above it. */
987 } 1015 }
988 1016
989 above = 0; 1017 above = 0;
990 below = 0; 1018 below = 0;
991 1019
992 if (map->in_memory == MAP_SAVING) 1020 if (map->in_memory == MAP_SAVING)
993 return; 1021 return;
994 1022
995 int check_walk_off = !flag [FLAG_NO_APPLY]; 1023 int check_walk_off = !flag [FLAG_NO_APPLY];
996 1024
997 for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above) 1025 for (tmp = ms.bot; tmp; tmp = tmp->above)
998 { 1026 {
999 /* No point updating the players look faces if he is the object 1027 /* No point updating the players look faces if he is the object
1000 * being removed. 1028 * being removed.
1001 */ 1029 */
1002 1030
… …
1082 } 1110 }
1083 1111
1084 return 0; 1112 return 0;
1085} 1113}
1086 1114
1115void
1116object::expand_tail ()
1117{
1118 if (more)
1119 return;
1120
1121 object *prev = this;
1122
1123 for (archetype *at = arch->more; at; at = at->more)
1124 {
1125 object *op = arch_to_object (at);
1126
1127 op->name = name;
1128 op->name_pl = name_pl;
1129 op->title = title;
1130
1131 op->head = this;
1132 prev->more = op;
1133
1134 prev = op;
1135 }
1136}
1137
1087/* 1138/*
1088 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1139 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1089 * job preparing multi-part monsters 1140 * job preparing multi-part monsters.
1090 */ 1141 */
1091object * 1142object *
1092insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1143insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1093{ 1144{
1094 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1145 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
… …
1121 * just 'op' otherwise 1172 * just 'op' otherwise
1122 */ 1173 */
1123object * 1174object *
1124insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1175insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1125{ 1176{
1177 assert (!op->flag [FLAG_FREED]);
1178
1126 object *tmp, *top, *floor = NULL; 1179 object *tmp, *top, *floor = NULL;
1127 sint16 x, y;
1128 1180
1129 if (QUERY_FLAG (op, FLAG_FREED)) 1181 op->remove ();
1130 {
1131 LOG (llevError, "Trying to insert freed object!\n");
1132 return NULL;
1133 }
1134 1182
1135 if (!m) 1183#if 0
1136 { 1184 if (!m->active != !op->active)
1137 char *dump = dump_object (op); 1185 if (m->active)
1138 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1186 op->activate_recursive ();
1139 free (dump); 1187 else
1140 return op; 1188 op->deactivate_recursive ();
1141 } 1189#endif
1142 1190
1143 if (out_of_map (m, op->x, op->y)) 1191 if (out_of_map (m, op->x, op->y))
1144 { 1192 {
1145 char *dump = dump_object (op);
1146 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1193 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1147#ifdef MANY_CORES 1194#ifdef MANY_CORES
1148 /* Better to catch this here, as otherwise the next use of this object 1195 /* Better to catch this here, as otherwise the next use of this object
1149 * is likely to cause a crash. Better to find out where it is getting 1196 * is likely to cause a crash. Better to find out where it is getting
1150 * improperly inserted. 1197 * improperly inserted.
1151 */ 1198 */
1152 abort (); 1199 abort ();
1153#endif 1200#endif
1154 free (dump);
1155 return op; 1201 return op;
1156 } 1202 }
1157 1203
1158 if (!QUERY_FLAG (op, FLAG_REMOVED))
1159 {
1160 char *dump = dump_object (op);
1161 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1162 free (dump);
1163 return op;
1164 }
1165
1166 if (op->more)
1167 {
1168 /* The part may be on a different map. */
1169
1170 object *more = op->more; 1204 if (object *more = op->more)
1171 1205 {
1172 /* We really need the caller to normalise coordinates - if
1173 * we set the map, that doesn't work if the location is within
1174 * a map and this is straddling an edge. So only if coordinate
1175 * is clear wrong do we normalise it.
1176 */
1177 if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1178 more->map = get_map_from_coord (m, &more->x, &more->y);
1179 else if (!more->map)
1180 {
1181 /* For backwards compatibility - when not dealing with tiled maps,
1182 * more->map should always point to the parent.
1183 */
1184 more->map = m;
1185 }
1186
1187 if (insert_ob_in_map (more, more->map, originator, flag) == NULL) 1206 if (!insert_ob_in_map (more, m, originator, flag))
1188 { 1207 {
1189 if (!op->head) 1208 if (!op->head)
1190 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); 1209 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1191 1210
1192 return 0; 1211 return 0;
… …
1197 1216
1198 /* Ideally, the caller figures this out. However, it complicates a lot 1217 /* Ideally, the caller figures this out. However, it complicates a lot
1199 * of areas of callers (eg, anything that uses find_free_spot would now 1218 * of areas of callers (eg, anything that uses find_free_spot would now
1200 * need extra work 1219 * need extra work
1201 */ 1220 */
1202 op->map = get_map_from_coord (m, &op->x, &op->y); 1221 if (!xy_normalise (m, op->x, op->y))
1203 x = op->x; 1222 return 0;
1204 y = op->y; 1223
1224 op->map = m;
1225 mapspace &ms = op->ms ();
1205 1226
1206 /* this has to be done after we translate the coordinates. 1227 /* this has to be done after we translate the coordinates.
1207 */ 1228 */
1208 if (op->nrof && !(flag & INS_NO_MERGE)) 1229 if (op->nrof && !(flag & INS_NO_MERGE))
1209 for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above) 1230 for (tmp = ms.bot; tmp; tmp = tmp->above)
1210 if (object::can_merge (op, tmp)) 1231 if (object::can_merge (op, tmp))
1211 { 1232 {
1212 op->nrof += tmp->nrof; 1233 op->nrof += tmp->nrof;
1213 tmp->destroy (); 1234 tmp->destroy ();
1214 } 1235 }
… …
1231 op->below = originator->below; 1252 op->below = originator->below;
1232 1253
1233 if (op->below) 1254 if (op->below)
1234 op->below->above = op; 1255 op->below->above = op;
1235 else 1256 else
1236 op->ms ().bot = op; 1257 ms.bot = op;
1237 1258
1238 /* since *below* originator, no need to update top */ 1259 /* since *below* originator, no need to update top */
1239 originator->below = op; 1260 originator->below = op;
1240 } 1261 }
1241 else 1262 else
1242 { 1263 {
1264 top = ms.bot;
1265
1243 /* If there are other objects, then */ 1266 /* If there are other objects, then */
1244 if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) 1267 if ((!(flag & INS_MAP_LOAD)) && top)
1245 { 1268 {
1246 object *last = 0; 1269 object *last = 0;
1247 1270
1248 /* 1271 /*
1249 * If there are multiple objects on this space, we do some trickier handling. 1272 * If there are multiple objects on this space, we do some trickier handling.
… …
1255 * once we get to them. This reduces the need to traverse over all of 1278 * once we get to them. This reduces the need to traverse over all of
1256 * them when adding another one - this saves quite a bit of cpu time 1279 * them when adding another one - this saves quite a bit of cpu time
1257 * when lots of spells are cast in one area. Currently, it is presumed 1280 * when lots of spells are cast in one area. Currently, it is presumed
1258 * that flying non pickable objects are spell objects. 1281 * that flying non pickable objects are spell objects.
1259 */ 1282 */
1260 while (top) 1283 for (top = ms.bot; top; top = top->above)
1261 { 1284 {
1262 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) 1285 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1263 floor = top; 1286 floor = top;
1264 1287
1265 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) 1288 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
… …
1268 top = top->below; 1291 top = top->below;
1269 break; 1292 break;
1270 } 1293 }
1271 1294
1272 last = top; 1295 last = top;
1273 top = top->above;
1274 } 1296 }
1275 1297
1276 /* Don't want top to be NULL, so set it to the last valid object */ 1298 /* Don't want top to be NULL, so set it to the last valid object */
1277 top = last; 1299 top = last;
1278 1300
… …
1280 * looks like instead of lots of conditions here. 1302 * looks like instead of lots of conditions here.
1281 * makes things faster, and effectively the same result. 1303 * makes things faster, and effectively the same result.
1282 */ 1304 */
1283 1305
1284 /* Have object 'fall below' other objects that block view. 1306 /* Have object 'fall below' other objects that block view.
1285 * Unless those objects are exits, type 66 1307 * Unless those objects are exits.
1286 * If INS_ON_TOP is used, don't do this processing 1308 * If INS_ON_TOP is used, don't do this processing
1287 * Need to find the object that in fact blocks view, otherwise 1309 * Need to find the object that in fact blocks view, otherwise
1288 * stacking is a bit odd. 1310 * stacking is a bit odd.
1289 */ 1311 */
1290 if (!(flag & INS_ON_TOP) && 1312 if (!(flag & INS_ON_TOP)
1291 (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) 1313 && ms.flags () & P_BLOCKSVIEW
1314 && (op->face && !faces [op->face].visibility))
1292 { 1315 {
1293 for (last = top; last != floor; last = last->below) 1316 for (last = top; last != floor; last = last->below)
1294 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1317 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1295 break; 1318 break;
1319
1296 /* Check to see if we found the object that blocks view, 1320 /* Check to see if we found the object that blocks view,
1297 * and make sure we have a below pointer for it so that 1321 * and make sure we have a below pointer for it so that
1298 * we can get inserted below this one, which requires we 1322 * we can get inserted below this one, which requires we
1299 * set top to the object below us. 1323 * set top to the object below us.
1300 */ 1324 */
… …
1302 top = last->below; 1326 top = last->below;
1303 } 1327 }
1304 } /* If objects on this space */ 1328 } /* If objects on this space */
1305 1329
1306 if (flag & INS_MAP_LOAD) 1330 if (flag & INS_MAP_LOAD)
1307 top = GET_MAP_TOP (op->map, op->x, op->y); 1331 top = ms.top;
1308 1332
1309 if (flag & INS_ABOVE_FLOOR_ONLY) 1333 if (flag & INS_ABOVE_FLOOR_ONLY)
1310 top = floor; 1334 top = floor;
1311 1335
1312 /* Top is the object that our object (op) is going to get inserted above. 1336 /* Top is the object that our object (op) is going to get inserted above.
1313 */ 1337 */
1314 1338
1315 /* First object on this space */ 1339 /* First object on this space */
1316 if (!top) 1340 if (!top)
1317 { 1341 {
1318 op->above = GET_MAP_OB (op->map, op->x, op->y); 1342 op->above = ms.bot;
1319 1343
1320 if (op->above) 1344 if (op->above)
1321 op->above->below = op; 1345 op->above->below = op;
1322 1346
1323 op->below = 0; 1347 op->below = 0;
1324 op->ms ().bot = op; 1348 ms.bot = op;
1325 } 1349 }
1326 else 1350 else
1327 { /* get inserted into the stack above top */ 1351 { /* get inserted into the stack above top */
1328 op->above = top->above; 1352 op->above = top->above;
1329 1353
… …
1333 op->below = top; 1357 op->below = top;
1334 top->above = op; 1358 top->above = op;
1335 } 1359 }
1336 1360
1337 if (!op->above) 1361 if (!op->above)
1338 op->ms ().top = op; 1362 ms.top = op;
1339 } /* else not INS_BELOW_ORIGINATOR */ 1363 } /* else not INS_BELOW_ORIGINATOR */
1340 1364
1341 if (op->type == PLAYER) 1365 if (op->type == PLAYER)
1342 { 1366 {
1343 op->contr->do_los = 1; 1367 op->contr->do_los = 1;
… …
1349 1373
1350 /* If we have a floor, we know the player, if any, will be above 1374 /* If we have a floor, we know the player, if any, will be above
1351 * it, so save a few ticks and start from there. 1375 * it, so save a few ticks and start from there.
1352 */ 1376 */
1353 if (!(flag & INS_MAP_LOAD)) 1377 if (!(flag & INS_MAP_LOAD))
1354 if (object *pl = op->ms ().player ()) 1378 if (object *pl = ms.player ())
1355 if (pl->contr->ns) 1379 if (pl->contr->ns)
1356 pl->contr->ns->floorbox_update (); 1380 pl->contr->ns->floorbox_update ();
1357 1381
1358 /* If this object glows, it may affect lighting conditions that are 1382 /* If this object glows, it may affect lighting conditions that are
1359 * visible to others on this map. But update_all_los is really 1383 * visible to others on this map. But update_all_los is really
… …
1421} 1445}
1422 1446
1423object * 1447object *
1424object::insert_at (object *where, object *originator, int flags) 1448object::insert_at (object *where, object *originator, int flags)
1425{ 1449{
1426 where->map->insert (this, where->x, where->y, originator, flags); 1450 return where->map->insert (this, where->x, where->y, originator, flags);
1427} 1451}
1428 1452
1429/* 1453/*
1430 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1454 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1431 * is returned contains nr objects, and the remaining parts contains 1455 * is returned contains nr objects, and the remaining parts contains
… …
1471 * the amount of an object. If the amount reaches 0, the object 1495 * the amount of an object. If the amount reaches 0, the object
1472 * is subsequently removed and freed. 1496 * is subsequently removed and freed.
1473 * 1497 *
1474 * Return value: 'op' if something is left, NULL if the amount reached 0 1498 * Return value: 'op' if something is left, NULL if the amount reached 0
1475 */ 1499 */
1476
1477object * 1500object *
1478decrease_ob_nr (object *op, uint32 i) 1501decrease_ob_nr (object *op, uint32 i)
1479{ 1502{
1480 object *tmp; 1503 object *tmp;
1481 1504
… …
1556 1579
1557/* 1580/*
1558 * add_weight(object, weight) adds the specified weight to an object, 1581 * add_weight(object, weight) adds the specified weight to an object,
1559 * and also updates how much the environment(s) is/are carrying. 1582 * and also updates how much the environment(s) is/are carrying.
1560 */ 1583 */
1561
1562void 1584void
1563add_weight (object *op, signed long weight) 1585add_weight (object *op, signed long weight)
1564{ 1586{
1565 while (op != NULL) 1587 while (op != NULL)
1566 { 1588 {
… …
1598 * inside the object environment. 1620 * inside the object environment.
1599 * 1621 *
1600 * The function returns now pointer to inserted item, and return value can 1622 * The function returns now pointer to inserted item, and return value can
1601 * be != op, if items are merged. -Tero 1623 * be != op, if items are merged. -Tero
1602 */ 1624 */
1603
1604object * 1625object *
1605object::insert (object *op) 1626object::insert (object *op)
1606{ 1627{
1607 object *tmp, *otmp; 1628 object *tmp, *otmp;
1608 1629
… …
1768 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1789 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1769 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) 1790 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1770 { 1791 {
1771 1792
1772 float 1793 float
1773 diff = tmp->move_slow_penalty * FABS (op->speed); 1794 diff = tmp->move_slow_penalty * fabs (op->speed);
1774 1795
1775 if (op->type == PLAYER) 1796 if (op->type == PLAYER)
1776 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 1797 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1777 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) 1798 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1778 diff /= 4.0; 1799 diff /= 4.0;
… …
1985 } 2006 }
1986 2007
1987 if (!index) 2008 if (!index)
1988 return -1; 2009 return -1;
1989 2010
1990 return altern[RANDOM () % index]; 2011 return altern [rndm (index)];
1991} 2012}
1992 2013
1993/* 2014/*
1994 * find_first_free_spot(archetype, maptile, x, y) works like 2015 * find_first_free_spot(archetype, maptile, x, y) works like
1995 * find_free_spot(), but it will search max number of squares. 2016 * find_free_spot(), but it will search max number of squares.
… …
2016{ 2037{
2017 arr += begin; 2038 arr += begin;
2018 end -= begin; 2039 end -= begin;
2019 2040
2020 while (--end) 2041 while (--end)
2021 swap (arr [end], arr [RANDOM () % (end + 1)]); 2042 swap (arr [end], arr [rndm (end + 1)]);
2022} 2043}
2023 2044
2024/* new function to make monster searching more efficient, and effective! 2045/* new function to make monster searching more efficient, and effective!
2025 * This basically returns a randomized array (in the passed pointer) of 2046 * This basically returns a randomized array (in the passed pointer) of
2026 * the spaces to find monsters. In this way, it won't always look for 2047 * the spaces to find monsters. In this way, it won't always look for
… …
2160 2181
2161 return 3; 2182 return 3;
2162} 2183}
2163 2184
2164/* 2185/*
2165 * absdir(int): Returns a number between 1 and 8, which represent
2166 * the "absolute" direction of a number (it actually takes care of
2167 * "overflow" in previous calculations of a direction).
2168 */
2169
2170int
2171absdir (int d)
2172{
2173 while (d < 1)
2174 d += 8;
2175
2176 while (d > 8)
2177 d -= 8;
2178
2179 return d;
2180}
2181
2182/*
2183 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is 2186 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2184 * between two directions (which are expected to be absolute (see absdir()) 2187 * between two directions (which are expected to be absolute (see absdir())
2185 */ 2188 */
2186
2187int 2189int
2188dirdiff (int dir1, int dir2) 2190dirdiff (int dir1, int dir2)
2189{ 2191{
2190 int d; 2192 int d;
2191 2193
… …
2357 insert_ob_in_ob (object_create_clone (item), dst); 2359 insert_ob_in_ob (object_create_clone (item), dst);
2358 2360
2359 return dst; 2361 return dst;
2360} 2362}
2361 2363
2362/* GROS - Creates an object using a string representing its content. */
2363/* Basically, we save the content of the string to a temp file, then call */
2364/* load_object on it. I admit it is a highly inefficient way to make things, */
2365/* but it was simple to make and allows reusing the load_object function. */
2366/* Remember not to use load_object_str in a time-critical situation. */
2367/* Also remember that multiparts objects are not supported for now. */
2368object *
2369load_object_str (const char *obstr)
2370{
2371 object *op;
2372 char filename[MAX_BUF];
2373
2374 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2375
2376 FILE *tempfile = fopen (filename, "w");
2377
2378 if (tempfile == NULL)
2379 {
2380 LOG (llevError, "Error - Unable to access load object temp file\n");
2381 return NULL;
2382 }
2383
2384 fprintf (tempfile, obstr);
2385 fclose (tempfile);
2386
2387 op = object::create ();
2388
2389 object_thawer thawer (filename);
2390
2391 if (thawer)
2392 load_object (thawer, op, 0);
2393
2394 LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2395 CLEAR_FLAG (op, FLAG_REMOVED);
2396
2397 return op;
2398}
2399
2400/* This returns the first object in who's inventory that 2364/* This returns the first object in who's inventory that
2401 * has the same type and subtype match. 2365 * has the same type and subtype match.
2402 * returns NULL if no match. 2366 * returns NULL if no match.
2403 */ 2367 */
2404object * 2368object *
… …
2457 if (link->key == canonical_key) 2421 if (link->key == canonical_key)
2458 return link->value; 2422 return link->value;
2459 2423
2460 return 0; 2424 return 0;
2461} 2425}
2462
2463 2426
2464/* 2427/*
2465 * Updates the canonical_key in op to value. 2428 * Updates the canonical_key in op to value.
2466 * 2429 *
2467 * canonical_key is a shared string (value doesn't have to be). 2430 * canonical_key is a shared string (value doesn't have to be).
… …
2607{ 2570{
2608 char flagdesc[512]; 2571 char flagdesc[512];
2609 char info2[256 * 4]; 2572 char info2[256 * 4];
2610 char *p = info; 2573 char *p = info;
2611 2574
2612 p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}", 2575 p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2613 count, uuid.seq, 2576 count, uuid.seq,
2614 &name, 2577 &name,
2615 title ? "\",title:" : "", 2578 title ? "\",title:\"" : "",
2616 title ? (const char *)title : "", 2579 title ? (const char *)title : "",
2617 flag_desc (flagdesc, 512), type); 2580 flag_desc (flagdesc, 512), type);
2618 2581
2619 if (env) 2582 if (env)
2620 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); 2583 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
… …
2630{ 2593{
2631 static char info[256 * 4]; 2594 static char info[256 * 4];
2632 return debug_desc (info); 2595 return debug_desc (info);
2633} 2596}
2634 2597
2598const char *
2599object::debug_desc2 () const
2600{
2601 static char info[256 * 4];
2602 return debug_desc (info);
2603}
2604
2605struct region *
2606object::region () const
2607{
2608 return map ? map->region (x, y)
2609 : region::default_region ();
2610}
2611
2612const materialtype_t *
2613object::dominant_material () const
2614{
2615 if (materialtype_t *mat = name_to_material (materialname))
2616 return mat;
2617
2618 // omfg this is slow, this has to be temporary :)
2619 shstr unknown ("unknown");
2620
2621 return name_to_material (unknown);
2622}
2623
2624void
2625object::open_container (object *new_container)
2626{
2627 if (container == new_container)
2628 return;
2629
2630 if (object *old_container = container)
2631 {
2632 if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2633 return;
2634
2635#if 0
2636 // remove the "Close old_container" object.
2637 if (object *closer = old_container->inv)
2638 if (closer->type == CLOSE_CON)
2639 closer->destroy ();
2640#endif
2641
2642 old_container->flag [FLAG_APPLIED] = 0;
2643 container = 0;
2644
2645 esrv_update_item (UPD_FLAGS, this, old_container);
2646 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2647 }
2648
2649 if (new_container)
2650 {
2651 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
2652 return;
2653
2654 // TODO: this does not seem to serve any purpose anymore?
2655#if 0
2656 // insert the "Close Container" object.
2657 if (archetype *closer = new_container->other_arch)
2658 {
2659 object *closer = arch_to_object (new_container->other_arch);
2660 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2661 new_container->insert (closer);
2662 }
2663#endif
2664
2665 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2666
2667 new_container->flag [FLAG_APPLIED] = 1;
2668 container = new_container;
2669
2670 esrv_update_item (UPD_FLAGS, this, new_container);
2671 esrv_send_inventory (this, new_container);
2672 }
2673}
2674
2675

Diff Legend

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