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

Diff Legend

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