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.110 by root, Sun Jan 7 23:12:03 2007 UTC vs.
Revision 1.145 by root, Mon May 7 03:05:58 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.
… …
447 owner = owner->owner; 449 owner = owner->owner;
448 450
449 this->owner = owner; 451 this->owner = owner;
450} 452}
451 453
454void
455object::set_weapon (object *ob)
456{
457 if (current_weapon == ob)
458 return;
459
460 current_weapon = ob;
461 new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
462 update_stats ();
463}
464
452/* Zero the key_values on op, decrementing the shared-string 465/* Zero the key_values on op, decrementing the shared-string
453 * refcounts and freeing the links. 466 * refcounts and freeing the links.
454 */ 467 */
455static void 468static void
456free_key_values (object *op) 469free_key_values (object *op)
457{ 470{
458 for (key_value *i = op->key_values; i != 0;) 471 for (key_value *i = op->key_values; i; )
459 { 472 {
460 key_value *next = i->next; 473 key_value *next = i->next;
461 delete i; 474 delete i;
462 475
463 i = next; 476 i = next;
464 } 477 }
465 478
466 op->key_values = 0; 479 op->key_values = 0;
467} 480}
468 481
469/* 482object &
470 * copy_to first frees everything allocated by the dst object, 483object::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{ 484{
480 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 485 bool is_freed = flag [FLAG_FREED];
481 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 486 bool is_removed = flag [FLAG_REMOVED];
482 487
483 *(object_copy *)dst = *this; 488 *(object_copy *)this = src;
484 489
485 if (is_freed) 490 flag [FLAG_FREED] = is_freed;
486 SET_FLAG (dst, FLAG_FREED); 491 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 492
494 /* Copy over key_values, if any. */ 493 /* Copy over key_values, if any. */
495 if (key_values) 494 if (src.key_values)
496 { 495 {
497 key_value *tail = 0; 496 key_value *tail = 0;
498 key_value *i;
499
500 dst->key_values = 0; 497 key_values = 0;
501 498
502 for (i = key_values; i; i = i->next) 499 for (key_value *i = src.key_values; i; i = i->next)
503 { 500 {
504 key_value *new_link = new key_value; 501 key_value *new_link = new key_value;
505 502
506 new_link->next = 0; 503 new_link->next = 0;
507 new_link->key = i->key; 504 new_link->key = i->key;
508 new_link->value = i->value; 505 new_link->value = i->value;
509 506
510 /* Try and be clever here, too. */ 507 /* Try and be clever here, too. */
511 if (!dst->key_values) 508 if (!key_values)
512 { 509 {
513 dst->key_values = new_link; 510 key_values = new_link;
514 tail = new_link; 511 tail = new_link;
515 } 512 }
516 else 513 else
517 { 514 {
518 tail->next = new_link; 515 tail->next = new_link;
519 tail = new_link; 516 tail = new_link;
520 } 517 }
521 } 518 }
522 } 519 }
520}
521
522/*
523 * copy_to first frees everything allocated by the dst object,
524 * and then copies the contents of itself into the second
525 * object, allocating what needs to be allocated. Basically, any
526 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
527 * if the first object is freed, the pointers in the new object
528 * will point at garbage.
529 */
530void
531object::copy_to (object *dst)
532{
533 *dst = *this;
534
535 if (speed < 0)
536 dst->speed_left = speed_left - rndm ();
523 537
524 dst->set_speed (dst->speed); 538 dst->set_speed (dst->speed);
539}
540
541void
542object::instantiate ()
543{
544 if (!uuid.seq) // HACK
545 uuid = gen_uuid ();
546
547 speed_left = -0.1f;
548 /* copy the body_info to the body_used - this is only really
549 * need for monsters, but doesn't hurt to do it for everything.
550 * by doing so, when a monster is created, it has good starting
551 * values for the body_used info, so when items are created
552 * for it, they can be properly equipped.
553 */
554 for (int i = NUM_BODY_LOCATIONS; i--; )
555 slot[i].used = slot[i].info;
556
557 attachable::instantiate ();
525} 558}
526 559
527object * 560object *
528object::clone () 561object::clone ()
529{ 562{
… …
587 * UP_OBJ_FACE: only the objects face has changed. 620 * UP_OBJ_FACE: only the objects face has changed.
588 */ 621 */
589void 622void
590update_object (object *op, int action) 623update_object (object *op, int action)
591{ 624{
592 MoveType move_on, move_off, move_block, move_slow;
593
594 if (op == NULL) 625 if (op == NULL)
595 { 626 {
596 /* this should never happen */ 627 /* this should never happen */
597 LOG (llevDebug, "update_object() called for NULL object.\n"); 628 LOG (llevDebug, "update_object() called for NULL object.\n");
598 return; 629 return;
… …
658 689
659 if (op->more) 690 if (op->more)
660 update_object (op->more, action); 691 update_object (op->more, action);
661} 692}
662 693
663object *object::first;
664
665object::object () 694object::object ()
666{ 695{
667 SET_FLAG (this, FLAG_REMOVED); 696 SET_FLAG (this, FLAG_REMOVED);
668 697
669 expmul = 1.0; 698 expmul = 1.0;
670 face = blank_face; 699 face = blank_face;
671} 700}
672 701
673object::~object () 702object::~object ()
674{ 703{
704 unlink ();
705
675 free_key_values (this); 706 free_key_values (this);
676} 707}
677 708
709static int object_count;
710
678void object::link () 711void object::link ()
679{ 712{
713 assert (!index);//D
680 uuid = gen_uuid (); 714 uuid = gen_uuid ();
715 count = ++object_count;
681 716
682 refcnt_inc (); 717 refcnt_inc ();
683 objects.insert (this); 718 objects.insert (this);
684} 719}
685 720
686void object::unlink () 721void object::unlink ()
687{ 722{
723 if (!index)
724 return;
725
688 objects.erase (this); 726 objects.erase (this);
689 refcnt_dec (); 727 refcnt_dec ();
690} 728}
691 729
692void 730void
… …
766 * drop on that space. 804 * drop on that space.
767 */ 805 */
768 if (!drop_to_ground 806 if (!drop_to_ground
769 || !map 807 || !map
770 || map->in_memory != MAP_IN_MEMORY 808 || map->in_memory != MAP_IN_MEMORY
809 || map->nodrop
771 || ms ().move_block == MOVE_ALL) 810 || ms ().move_block == MOVE_ALL)
772 { 811 {
773 while (inv) 812 while (inv)
774 { 813 {
775 inv->destroy_inv (drop_to_ground); 814 inv->destroy_inv (drop_to_ground);
… …
803} 842}
804 843
805void 844void
806object::do_destroy () 845object::do_destroy ()
807{ 846{
847 attachable::do_destroy ();
848
808 if (flag [FLAG_IS_LINKED]) 849 if (flag [FLAG_IS_LINKED])
809 remove_button_link (this); 850 remove_button_link (this);
810 851
811 if (flag [FLAG_FRIENDLY]) 852 if (flag [FLAG_FRIENDLY])
812 remove_friendly_object (this); 853 remove_friendly_object (this);
813 854
814 if (!flag [FLAG_REMOVED]) 855 if (!flag [FLAG_REMOVED])
815 remove (); 856 remove ();
816 857
817 if (flag [FLAG_FREED]) 858 destroy_inv (true);
818 return;
819 859
820 set_speed (0); 860 deactivate ();
861 unlink ();
821 862
822 flag [FLAG_FREED] = 1; 863 flag [FLAG_FREED] = 1;
823
824 attachable::do_destroy ();
825
826 destroy_inv (true);
827 unlink ();
828 864
829 // hack to ensure that freed objects still have a valid map 865 // hack to ensure that freed objects still have a valid map
830 { 866 {
831 static maptile *freed_map; // freed objects are moved here to avoid crashes 867 static maptile *freed_map; // freed objects are moved here to avoid crashes
832 868
… …
894 * This function removes the object op from the linked list of objects 930 * This function removes the object op from the linked list of objects
895 * which it is currently tied to. When this function is done, the 931 * which it is currently tied to. When this function is done, the
896 * object will have no environment. If the object previously had an 932 * object will have no environment. If the object previously had an
897 * environment, the x and y coordinates will be updated to 933 * environment, the x and y coordinates will be updated to
898 * the previous environment. 934 * the previous environment.
899 * Beware: This function is called from the editor as well!
900 */ 935 */
901void 936void
902object::remove () 937object::do_remove ()
903{ 938{
904 object *tmp, *last = 0; 939 object *tmp, *last = 0;
905 object *otmp; 940 object *otmp;
906 941
907 if (QUERY_FLAG (this, FLAG_REMOVED)) 942 if (QUERY_FLAG (this, FLAG_REMOVED))
… …
950 } 985 }
951 else if (map) 986 else if (map)
952 { 987 {
953 if (type == PLAYER) 988 if (type == PLAYER)
954 { 989 {
990 // leaving a spot always closes any open container on the ground
991 if (container && !container->env)
992 // this causes spurious floorbox updates, but it ensures
993 // that the CLOSE event is being sent.
994 close_container ();
995
955 --map->players; 996 --map->players;
956 map->touch (); 997 map->touch ();
957 } 998 }
958 999
959 map->dirty = true; 1000 map->dirty = true;
1001 mapspace &ms = this->ms ();
960 1002
961 /* link the object above us */ 1003 /* link the object above us */
962 if (above) 1004 if (above)
963 above->below = below; 1005 above->below = below;
964 else 1006 else
965 map->at (x, y).top = below; /* we were top, set new top */ 1007 ms.top = below; /* we were top, set new top */
966 1008
967 /* Relink the object below us, if there is one */ 1009 /* Relink the object below us, if there is one */
968 if (below) 1010 if (below)
969 below->above = above; 1011 below->above = above;
970 else 1012 else
… …
972 /* Nothing below, which means we need to relink map object for this space 1014 /* Nothing below, which means we need to relink map object for this space
973 * use translated coordinates in case some oddness with map tiling is 1015 * use translated coordinates in case some oddness with map tiling is
974 * evident 1016 * evident
975 */ 1017 */
976 if (GET_MAP_OB (map, x, y) != this) 1018 if (GET_MAP_OB (map, x, y) != this)
977 {
978 char *dump = dump_object (this);
979 LOG (llevError,
980 "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); 1019 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 ());
981 free (dump);
982 dump = dump_object (GET_MAP_OB (map, x, y));
983 LOG (llevError, "%s\n", dump);
984 free (dump);
985 }
986 1020
987 map->at (x, y).bot = above; /* goes on above it. */ 1021 ms.bot = above; /* goes on above it. */
988 } 1022 }
989 1023
990 above = 0; 1024 above = 0;
991 below = 0; 1025 below = 0;
992 1026
993 if (map->in_memory == MAP_SAVING) 1027 if (map->in_memory == MAP_SAVING)
994 return; 1028 return;
995 1029
996 int check_walk_off = !flag [FLAG_NO_APPLY]; 1030 int check_walk_off = !flag [FLAG_NO_APPLY];
997 1031
998 for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above) 1032 for (tmp = ms.bot; tmp; tmp = tmp->above)
999 { 1033 {
1000 /* No point updating the players look faces if he is the object 1034 /* No point updating the players look faces if he is the object
1001 * being removed. 1035 * being removed.
1002 */ 1036 */
1003 1037
… …
1083 } 1117 }
1084 1118
1085 return 0; 1119 return 0;
1086} 1120}
1087 1121
1122void
1123object::expand_tail ()
1124{
1125 if (more)
1126 return;
1127
1128 object *prev = this;
1129
1130 for (archetype *at = arch->more; at; at = at->more)
1131 {
1132 object *op = arch_to_object (at);
1133
1134 op->name = name;
1135 op->name_pl = name_pl;
1136 op->title = title;
1137
1138 op->head = this;
1139 prev->more = op;
1140
1141 prev = op;
1142 }
1143}
1144
1088/* 1145/*
1089 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1146 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1090 * job preparing multi-part monsters 1147 * job preparing multi-part monsters.
1091 */ 1148 */
1092object * 1149object *
1093insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1150insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1094{ 1151{
1095 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1152 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
… …
1122 * just 'op' otherwise 1179 * just 'op' otherwise
1123 */ 1180 */
1124object * 1181object *
1125insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1182insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1126{ 1183{
1184 assert (!op->flag [FLAG_FREED]);
1185
1127 object *tmp, *top, *floor = NULL; 1186 object *tmp, *top, *floor = NULL;
1128 sint16 x, y;
1129 1187
1130 if (QUERY_FLAG (op, FLAG_FREED)) 1188 op->remove ();
1131 {
1132 LOG (llevError, "Trying to insert freed object!\n");
1133 return NULL;
1134 }
1135 1189
1136 if (!m) 1190#if 0
1137 { 1191 if (!m->active != !op->active)
1138 char *dump = dump_object (op); 1192 if (m->active)
1139 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1193 op->activate_recursive ();
1140 free (dump); 1194 else
1141 return op; 1195 op->deactivate_recursive ();
1142 } 1196#endif
1143 1197
1144 if (out_of_map (m, op->x, op->y)) 1198 if (out_of_map (m, op->x, op->y))
1145 { 1199 {
1146 char *dump = dump_object (op);
1147 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1200 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1148#ifdef MANY_CORES 1201#ifdef MANY_CORES
1149 /* Better to catch this here, as otherwise the next use of this object 1202 /* Better to catch this here, as otherwise the next use of this object
1150 * is likely to cause a crash. Better to find out where it is getting 1203 * is likely to cause a crash. Better to find out where it is getting
1151 * improperly inserted. 1204 * improperly inserted.
1152 */ 1205 */
1153 abort (); 1206 abort ();
1154#endif 1207#endif
1155 free (dump);
1156 return op; 1208 return op;
1157 } 1209 }
1158 1210
1159 if (!QUERY_FLAG (op, FLAG_REMOVED))
1160 {
1161 char *dump = dump_object (op);
1162 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1163 free (dump);
1164 return op;
1165 }
1166
1167 if (op->more)
1168 {
1169 /* The part may be on a different map. */
1170
1171 object *more = op->more; 1211 if (object *more = op->more)
1172 1212 {
1173 /* We really need the caller to normalise coordinates - if
1174 * we set the map, that doesn't work if the location is within
1175 * a map and this is straddling an edge. So only if coordinate
1176 * is clear wrong do we normalise it.
1177 */
1178 if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1179 more->map = get_map_from_coord (m, &more->x, &more->y);
1180 else if (!more->map)
1181 {
1182 /* For backwards compatibility - when not dealing with tiled maps,
1183 * more->map should always point to the parent.
1184 */
1185 more->map = m;
1186 }
1187
1188 if (insert_ob_in_map (more, more->map, originator, flag) == NULL) 1213 if (!insert_ob_in_map (more, m, originator, flag))
1189 { 1214 {
1190 if (!op->head) 1215 if (!op->head)
1191 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); 1216 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1192 1217
1193 return 0; 1218 return 0;
… …
1198 1223
1199 /* Ideally, the caller figures this out. However, it complicates a lot 1224 /* Ideally, the caller figures this out. However, it complicates a lot
1200 * of areas of callers (eg, anything that uses find_free_spot would now 1225 * of areas of callers (eg, anything that uses find_free_spot would now
1201 * need extra work 1226 * need extra work
1202 */ 1227 */
1203 op->map = get_map_from_coord (m, &op->x, &op->y); 1228 if (!xy_normalise (m, op->x, op->y))
1204 x = op->x; 1229 return 0;
1205 y = op->y; 1230
1231 op->map = m;
1232 mapspace &ms = op->ms ();
1206 1233
1207 /* this has to be done after we translate the coordinates. 1234 /* this has to be done after we translate the coordinates.
1208 */ 1235 */
1209 if (op->nrof && !(flag & INS_NO_MERGE)) 1236 if (op->nrof && !(flag & INS_NO_MERGE))
1210 for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above) 1237 for (tmp = ms.bot; tmp; tmp = tmp->above)
1211 if (object::can_merge (op, tmp)) 1238 if (object::can_merge (op, tmp))
1212 { 1239 {
1213 op->nrof += tmp->nrof; 1240 op->nrof += tmp->nrof;
1214 tmp->destroy (); 1241 tmp->destroy ();
1215 } 1242 }
… …
1232 op->below = originator->below; 1259 op->below = originator->below;
1233 1260
1234 if (op->below) 1261 if (op->below)
1235 op->below->above = op; 1262 op->below->above = op;
1236 else 1263 else
1237 op->ms ().bot = op; 1264 ms.bot = op;
1238 1265
1239 /* since *below* originator, no need to update top */ 1266 /* since *below* originator, no need to update top */
1240 originator->below = op; 1267 originator->below = op;
1241 } 1268 }
1242 else 1269 else
1243 { 1270 {
1271 top = ms.bot;
1272
1244 /* If there are other objects, then */ 1273 /* If there are other objects, then */
1245 if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) 1274 if ((!(flag & INS_MAP_LOAD)) && top)
1246 { 1275 {
1247 object *last = 0; 1276 object *last = 0;
1248 1277
1249 /* 1278 /*
1250 * If there are multiple objects on this space, we do some trickier handling. 1279 * If there are multiple objects on this space, we do some trickier handling.
… …
1256 * once we get to them. This reduces the need to traverse over all of 1285 * once we get to them. This reduces the need to traverse over all of
1257 * them when adding another one - this saves quite a bit of cpu time 1286 * them when adding another one - this saves quite a bit of cpu time
1258 * when lots of spells are cast in one area. Currently, it is presumed 1287 * when lots of spells are cast in one area. Currently, it is presumed
1259 * that flying non pickable objects are spell objects. 1288 * that flying non pickable objects are spell objects.
1260 */ 1289 */
1261 while (top) 1290 for (top = ms.bot; top; top = top->above)
1262 { 1291 {
1263 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) 1292 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1264 floor = top; 1293 floor = top;
1265 1294
1266 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) 1295 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
… …
1269 top = top->below; 1298 top = top->below;
1270 break; 1299 break;
1271 } 1300 }
1272 1301
1273 last = top; 1302 last = top;
1274 top = top->above;
1275 } 1303 }
1276 1304
1277 /* Don't want top to be NULL, so set it to the last valid object */ 1305 /* Don't want top to be NULL, so set it to the last valid object */
1278 top = last; 1306 top = last;
1279 1307
… …
1281 * looks like instead of lots of conditions here. 1309 * looks like instead of lots of conditions here.
1282 * makes things faster, and effectively the same result. 1310 * makes things faster, and effectively the same result.
1283 */ 1311 */
1284 1312
1285 /* Have object 'fall below' other objects that block view. 1313 /* Have object 'fall below' other objects that block view.
1286 * Unless those objects are exits, type 66 1314 * Unless those objects are exits.
1287 * If INS_ON_TOP is used, don't do this processing 1315 * If INS_ON_TOP is used, don't do this processing
1288 * Need to find the object that in fact blocks view, otherwise 1316 * Need to find the object that in fact blocks view, otherwise
1289 * stacking is a bit odd. 1317 * stacking is a bit odd.
1290 */ 1318 */
1291 if (!(flag & INS_ON_TOP) && 1319 if (!(flag & INS_ON_TOP)
1292 (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) 1320 && ms.flags () & P_BLOCKSVIEW
1321 && (op->face && !faces [op->face].visibility))
1293 { 1322 {
1294 for (last = top; last != floor; last = last->below) 1323 for (last = top; last != floor; last = last->below)
1295 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1324 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1296 break; 1325 break;
1326
1297 /* Check to see if we found the object that blocks view, 1327 /* Check to see if we found the object that blocks view,
1298 * and make sure we have a below pointer for it so that 1328 * and make sure we have a below pointer for it so that
1299 * we can get inserted below this one, which requires we 1329 * we can get inserted below this one, which requires we
1300 * set top to the object below us. 1330 * set top to the object below us.
1301 */ 1331 */
… …
1303 top = last->below; 1333 top = last->below;
1304 } 1334 }
1305 } /* If objects on this space */ 1335 } /* If objects on this space */
1306 1336
1307 if (flag & INS_MAP_LOAD) 1337 if (flag & INS_MAP_LOAD)
1308 top = GET_MAP_TOP (op->map, op->x, op->y); 1338 top = ms.top;
1309 1339
1310 if (flag & INS_ABOVE_FLOOR_ONLY) 1340 if (flag & INS_ABOVE_FLOOR_ONLY)
1311 top = floor; 1341 top = floor;
1312 1342
1313 /* Top is the object that our object (op) is going to get inserted above. 1343 /* Top is the object that our object (op) is going to get inserted above.
1314 */ 1344 */
1315 1345
1316 /* First object on this space */ 1346 /* First object on this space */
1317 if (!top) 1347 if (!top)
1318 { 1348 {
1319 op->above = GET_MAP_OB (op->map, op->x, op->y); 1349 op->above = ms.bot;
1320 1350
1321 if (op->above) 1351 if (op->above)
1322 op->above->below = op; 1352 op->above->below = op;
1323 1353
1324 op->below = 0; 1354 op->below = 0;
1325 op->ms ().bot = op; 1355 ms.bot = op;
1326 } 1356 }
1327 else 1357 else
1328 { /* get inserted into the stack above top */ 1358 { /* get inserted into the stack above top */
1329 op->above = top->above; 1359 op->above = top->above;
1330 1360
… …
1334 op->below = top; 1364 op->below = top;
1335 top->above = op; 1365 top->above = op;
1336 } 1366 }
1337 1367
1338 if (!op->above) 1368 if (!op->above)
1339 op->ms ().top = op; 1369 ms.top = op;
1340 } /* else not INS_BELOW_ORIGINATOR */ 1370 } /* else not INS_BELOW_ORIGINATOR */
1341 1371
1342 if (op->type == PLAYER) 1372 if (op->type == PLAYER)
1343 { 1373 {
1344 op->contr->do_los = 1; 1374 op->contr->do_los = 1;
… …
1350 1380
1351 /* If we have a floor, we know the player, if any, will be above 1381 /* If we have a floor, we know the player, if any, will be above
1352 * it, so save a few ticks and start from there. 1382 * it, so save a few ticks and start from there.
1353 */ 1383 */
1354 if (!(flag & INS_MAP_LOAD)) 1384 if (!(flag & INS_MAP_LOAD))
1355 if (object *pl = op->ms ().player ()) 1385 if (object *pl = ms.player ())
1356 if (pl->contr->ns) 1386 if (pl->contr->ns)
1357 pl->contr->ns->floorbox_update (); 1387 pl->contr->ns->floorbox_update ();
1358 1388
1359 /* If this object glows, it may affect lighting conditions that are 1389 /* If this object glows, it may affect lighting conditions that are
1360 * visible to others on this map. But update_all_los is really 1390 * visible to others on this map. But update_all_los is really
… …
1422} 1452}
1423 1453
1424object * 1454object *
1425object::insert_at (object *where, object *originator, int flags) 1455object::insert_at (object *where, object *originator, int flags)
1426{ 1456{
1427 where->map->insert (this, where->x, where->y, originator, flags); 1457 return where->map->insert (this, where->x, where->y, originator, flags);
1428} 1458}
1429 1459
1430/* 1460/*
1431 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1461 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1432 * is returned contains nr objects, and the remaining parts contains 1462 * is returned contains nr objects, and the remaining parts contains
… …
1472 * the amount of an object. If the amount reaches 0, the object 1502 * the amount of an object. If the amount reaches 0, the object
1473 * is subsequently removed and freed. 1503 * is subsequently removed and freed.
1474 * 1504 *
1475 * Return value: 'op' if something is left, NULL if the amount reached 0 1505 * Return value: 'op' if something is left, NULL if the amount reached 0
1476 */ 1506 */
1477
1478object * 1507object *
1479decrease_ob_nr (object *op, uint32 i) 1508decrease_ob_nr (object *op, uint32 i)
1480{ 1509{
1481 object *tmp; 1510 object *tmp;
1482 1511
… …
1557 1586
1558/* 1587/*
1559 * add_weight(object, weight) adds the specified weight to an object, 1588 * add_weight(object, weight) adds the specified weight to an object,
1560 * and also updates how much the environment(s) is/are carrying. 1589 * and also updates how much the environment(s) is/are carrying.
1561 */ 1590 */
1562
1563void 1591void
1564add_weight (object *op, signed long weight) 1592add_weight (object *op, signed long weight)
1565{ 1593{
1566 while (op != NULL) 1594 while (op != NULL)
1567 { 1595 {
… …
1599 * inside the object environment. 1627 * inside the object environment.
1600 * 1628 *
1601 * The function returns now pointer to inserted item, and return value can 1629 * The function returns now pointer to inserted item, and return value can
1602 * be != op, if items are merged. -Tero 1630 * be != op, if items are merged. -Tero
1603 */ 1631 */
1604
1605object * 1632object *
1606object::insert (object *op) 1633object::insert (object *op)
1607{ 1634{
1608 object *tmp, *otmp; 1635 object *tmp, *otmp;
1609 1636
… …
1769 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1796 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1770 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) 1797 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1771 { 1798 {
1772 1799
1773 float 1800 float
1774 diff = tmp->move_slow_penalty * FABS (op->speed); 1801 diff = tmp->move_slow_penalty * fabs (op->speed);
1775 1802
1776 if (op->type == PLAYER) 1803 if (op->type == PLAYER)
1777 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 1804 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1778 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) 1805 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1779 diff /= 4.0; 1806 diff /= 4.0;
… …
1986 } 2013 }
1987 2014
1988 if (!index) 2015 if (!index)
1989 return -1; 2016 return -1;
1990 2017
1991 return altern[RANDOM () % index]; 2018 return altern [rndm (index)];
1992} 2019}
1993 2020
1994/* 2021/*
1995 * find_first_free_spot(archetype, maptile, x, y) works like 2022 * find_first_free_spot(archetype, maptile, x, y) works like
1996 * find_free_spot(), but it will search max number of squares. 2023 * find_free_spot(), but it will search max number of squares.
… …
2017{ 2044{
2018 arr += begin; 2045 arr += begin;
2019 end -= begin; 2046 end -= begin;
2020 2047
2021 while (--end) 2048 while (--end)
2022 swap (arr [end], arr [RANDOM () % (end + 1)]); 2049 swap (arr [end], arr [rndm (end + 1)]);
2023} 2050}
2024 2051
2025/* new function to make monster searching more efficient, and effective! 2052/* new function to make monster searching more efficient, and effective!
2026 * This basically returns a randomized array (in the passed pointer) of 2053 * This basically returns a randomized array (in the passed pointer) of
2027 * the spaces to find monsters. In this way, it won't always look for 2054 * the spaces to find monsters. In this way, it won't always look for
… …
2161 2188
2162 return 3; 2189 return 3;
2163} 2190}
2164 2191
2165/* 2192/*
2166 * absdir(int): Returns a number between 1 and 8, which represent
2167 * the "absolute" direction of a number (it actually takes care of
2168 * "overflow" in previous calculations of a direction).
2169 */
2170
2171int
2172absdir (int d)
2173{
2174 while (d < 1)
2175 d += 8;
2176
2177 while (d > 8)
2178 d -= 8;
2179
2180 return d;
2181}
2182
2183/*
2184 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is 2193 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2185 * between two directions (which are expected to be absolute (see absdir()) 2194 * between two directions (which are expected to be absolute (see absdir())
2186 */ 2195 */
2187
2188int 2196int
2189dirdiff (int dir1, int dir2) 2197dirdiff (int dir1, int dir2)
2190{ 2198{
2191 int d; 2199 int d;
2192 2200
… …
2358 insert_ob_in_ob (object_create_clone (item), dst); 2366 insert_ob_in_ob (object_create_clone (item), dst);
2359 2367
2360 return dst; 2368 return dst;
2361} 2369}
2362 2370
2363/* GROS - Creates an object using a string representing its content. */
2364/* Basically, we save the content of the string to a temp file, then call */
2365/* load_object on it. I admit it is a highly inefficient way to make things, */
2366/* but it was simple to make and allows reusing the load_object function. */
2367/* Remember not to use load_object_str in a time-critical situation. */
2368/* Also remember that multiparts objects are not supported for now. */
2369object *
2370load_object_str (const char *obstr)
2371{
2372 object *op;
2373 char filename[MAX_BUF];
2374
2375 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2376
2377 FILE *tempfile = fopen (filename, "w");
2378
2379 if (tempfile == NULL)
2380 {
2381 LOG (llevError, "Error - Unable to access load object temp file\n");
2382 return NULL;
2383 }
2384
2385 fprintf (tempfile, obstr);
2386 fclose (tempfile);
2387
2388 op = object::create ();
2389
2390 object_thawer thawer (filename);
2391
2392 if (thawer)
2393 load_object (thawer, op, 0);
2394
2395 LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2396 CLEAR_FLAG (op, FLAG_REMOVED);
2397
2398 return op;
2399}
2400
2401/* This returns the first object in who's inventory that 2371/* This returns the first object in who's inventory that
2402 * has the same type and subtype match. 2372 * has the same type and subtype match.
2403 * returns NULL if no match. 2373 * returns NULL if no match.
2404 */ 2374 */
2405object * 2375object *
… …
2458 if (link->key == canonical_key) 2428 if (link->key == canonical_key)
2459 return link->value; 2429 return link->value;
2460 2430
2461 return 0; 2431 return 0;
2462} 2432}
2463
2464 2433
2465/* 2434/*
2466 * Updates the canonical_key in op to value. 2435 * Updates the canonical_key in op to value.
2467 * 2436 *
2468 * canonical_key is a shared string (value doesn't have to be). 2437 * canonical_key is a shared string (value doesn't have to be).
… …
2608{ 2577{
2609 char flagdesc[512]; 2578 char flagdesc[512];
2610 char info2[256 * 4]; 2579 char info2[256 * 4];
2611 char *p = info; 2580 char *p = info;
2612 2581
2613 p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}", 2582 p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2614 count, uuid.seq, 2583 count, uuid.seq,
2615 &name, 2584 &name,
2616 title ? "\",title:" : "", 2585 title ? "\",title:\"" : "",
2617 title ? (const char *)title : "", 2586 title ? (const char *)title : "",
2618 flag_desc (flagdesc, 512), type); 2587 flag_desc (flagdesc, 512), type);
2619 2588
2620 if (env) 2589 if (env)
2621 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); 2590 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
… …
2627} 2596}
2628 2597
2629const char * 2598const char *
2630object::debug_desc () const 2599object::debug_desc () const
2631{ 2600{
2632 static char info[256 * 4]; 2601 static char info[3][256 * 4];
2602 static int info_idx;
2603
2633 return debug_desc (info); 2604 return debug_desc (info [++info_idx % 3]);
2634} 2605}
2635 2606
2607struct region *
2608object::region () const
2609{
2610 return map ? map->region (x, y)
2611 : region::default_region ();
2612}
2613
2614const materialtype_t *
2615object::dominant_material () const
2616{
2617 if (materialtype_t *mat = name_to_material (materialname))
2618 return mat;
2619
2620 // omfg this is slow, this has to be temporary :)
2621 shstr unknown ("unknown");
2622
2623 return name_to_material (unknown);
2624}
2625
2626void
2627object::open_container (object *new_container)
2628{
2629 if (container == new_container)
2630 return;
2631
2632 if (object *old_container = container)
2633 {
2634 if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2635 return;
2636
2637#if 0
2638 // remove the "Close old_container" object.
2639 if (object *closer = old_container->inv)
2640 if (closer->type == CLOSE_CON)
2641 closer->destroy ();
2642#endif
2643
2644 old_container->flag [FLAG_APPLIED] = 0;
2645 container = 0;
2646
2647 esrv_update_item (UPD_FLAGS, this, old_container);
2648 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2649 }
2650
2651 if (new_container)
2652 {
2653 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
2654 return;
2655
2656 // TODO: this does not seem to serve any purpose anymore?
2657#if 0
2658 // insert the "Close Container" object.
2659 if (archetype *closer = new_container->other_arch)
2660 {
2661 object *closer = arch_to_object (new_container->other_arch);
2662 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2663 new_container->insert (closer);
2664 }
2665#endif
2666
2667 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2668
2669 new_container->flag [FLAG_APPLIED] = 1;
2670 container = new_container;
2671
2672 esrv_update_item (UPD_FLAGS, this, new_container);
2673 esrv_send_inventory (this, new_container);
2674 }
2675}
2676
2677

Diff Legend

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