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.122 by root, Wed Jan 24 22:42:48 2007 UTC vs.
Revision 1.172 by root, Wed Aug 1 20:44:11 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Crossfire TRT 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 3 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, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 22 */
24 23
25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. 24/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26 sub/add_weight will transcend the environment updating the carrying 25 sub/add_weight will transcend the environment updating the carrying
27 variable. */ 26 variable. */
29#include <stdio.h> 28#include <stdio.h>
30#include <sys/types.h> 29#include <sys/types.h>
31#include <sys/uio.h> 30#include <sys/uio.h>
32#include <object.h> 31#include <object.h>
33#include <funcpoint.h> 32#include <funcpoint.h>
33#include <sproto.h>
34#include <loader.h> 34#include <loader.h>
35 35
36#include <bitset> 36#include <bitset>
37 37
38int nrofallocobjects = 0; 38int nrofallocobjects = 0;
299 return 0; 299 return 0;
300 else if (!compare_ob_value_lists (ob1, ob2)) 300 else if (!compare_ob_value_lists (ob1, ob2))
301 return 0; 301 return 0;
302 } 302 }
303 303
304 //TODO: generate an event or call into perl for additional checks
305 if (ob1->self || ob2->self) 304 if (ob1->self || ob2->self)
306 { 305 {
307 ob1->optimise (); 306 ob1->optimise ();
308 ob2->optimise (); 307 ob2->optimise ();
309 308
310 if (ob1->self || ob2->self) 309 if (ob1->self || ob2->self)
310 if (!cfperl_can_merge (ob1, ob2))
311 return 0; 311 return 0;
312 } 312 }
313 313
314 /* Everything passes, must be OK. */ 314 /* Everything passes, must be OK. */
315 return 1; 315 return 1;
316} 316}
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
449 owner = owner->owner; 449 owner = owner->owner;
450 450
451 this->owner = owner; 451 this->owner = owner;
452} 452}
453 453
454int
455object::slottype () const
456{
457 if (type == SKILL)
458 {
459 if (IS_COMBAT_SKILL (subtype)) return slot_combat;
460 if (IS_RANGED_SKILL (subtype)) return slot_ranged;
461 }
462 else
463 {
464 if (slot [body_combat].info) return slot_combat;
465 if (slot [body_range ].info) return slot_ranged;
466 }
467
468 return slot_none;
469}
470
471bool
472object::change_weapon (object *ob)
473{
474 if (current_weapon == ob)
475 return true;
476
477 if (chosen_skill)
478 chosen_skill->flag [FLAG_APPLIED] = false;
479
480 current_weapon = ob;
481 chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
482
483 if (chosen_skill)
484 chosen_skill->flag [FLAG_APPLIED] = true;
485
486 update_stats ();
487
488 if (ob)
489 {
490 // now check wether any body locations became invalid, in which case
491 // we cannot apply the weapon at the moment.
492 for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
493 if (slot[i].used < 0)
494 {
495 current_weapon = chosen_skill = 0;
496 update_stats ();
497
498 new_draw_info_format (NDI_UNIQUE, 0, this,
499 "You try to balance all your items at once, "
500 "but the %s is just too much for your body. "
501 "[You need to unapply some items first.]", &ob->name);
502 return false;
503 }
504
505 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
506 }
507 else
508 ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
509
510 if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
511 {
512 LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
513 &name, ob->debug_desc ());
514 return false;
515 }
516
517 return true;
518}
519
454/* Zero the key_values on op, decrementing the shared-string 520/* Zero the key_values on op, decrementing the shared-string
455 * refcounts and freeing the links. 521 * refcounts and freeing the links.
456 */ 522 */
457static void 523static void
458free_key_values (object *op) 524free_key_values (object *op)
459{ 525{
460 for (key_value *i = op->key_values; i != 0;) 526 for (key_value *i = op->key_values; i; )
461 { 527 {
462 key_value *next = i->next; 528 key_value *next = i->next;
463 delete i; 529 delete i;
464 530
465 i = next; 531 i = next;
466 } 532 }
467 533
468 op->key_values = 0; 534 op->key_values = 0;
469} 535}
470 536
471/* 537object &
472 * copy_to first frees everything allocated by the dst object, 538object::operator =(const object &src)
473 * and then copies the contents of itself into the second
474 * object, allocating what needs to be allocated. Basically, any
475 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
476 * if the first object is freed, the pointers in the new object
477 * will point at garbage.
478 */
479void
480object::copy_to (object *dst)
481{ 539{
482 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 540 bool is_freed = flag [FLAG_FREED];
483 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 541 bool is_removed = flag [FLAG_REMOVED];
484 542
485 *(object_copy *)dst = *this; 543 *(object_copy *)this = src;
486 544
487 if (is_freed) 545 flag [FLAG_FREED] = is_freed;
488 SET_FLAG (dst, FLAG_FREED); 546 flag [FLAG_REMOVED] = is_removed;
489
490 if (is_removed)
491 SET_FLAG (dst, FLAG_REMOVED);
492
493 if (speed < 0)
494 dst->speed_left = speed_left - rndm ();
495 547
496 /* Copy over key_values, if any. */ 548 /* Copy over key_values, if any. */
497 if (key_values) 549 if (src.key_values)
498 { 550 {
499 key_value *tail = 0; 551 key_value *tail = 0;
500 key_value *i;
501
502 dst->key_values = 0; 552 key_values = 0;
503 553
504 for (i = key_values; i; i = i->next) 554 for (key_value *i = src.key_values; i; i = i->next)
505 { 555 {
506 key_value *new_link = new key_value; 556 key_value *new_link = new key_value;
507 557
508 new_link->next = 0; 558 new_link->next = 0;
509 new_link->key = i->key; 559 new_link->key = i->key;
510 new_link->value = i->value; 560 new_link->value = i->value;
511 561
512 /* Try and be clever here, too. */ 562 /* Try and be clever here, too. */
513 if (!dst->key_values) 563 if (!key_values)
514 { 564 {
515 dst->key_values = new_link; 565 key_values = new_link;
516 tail = new_link; 566 tail = new_link;
517 } 567 }
518 else 568 else
519 { 569 {
520 tail->next = new_link; 570 tail->next = new_link;
521 tail = new_link; 571 tail = new_link;
522 } 572 }
523 } 573 }
524 } 574 }
575}
576
577/*
578 * copy_to first frees everything allocated by the dst object,
579 * and then copies the contents of itself into the second
580 * object, allocating what needs to be allocated. Basically, any
581 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
582 * if the first object is freed, the pointers in the new object
583 * will point at garbage.
584 */
585void
586object::copy_to (object *dst)
587{
588 *dst = *this;
589
590 if (speed < 0)
591 dst->speed_left = speed_left - rndm ();
525 592
526 dst->set_speed (dst->speed); 593 dst->set_speed (dst->speed);
594}
595
596void
597object::instantiate ()
598{
599 if (!uuid.seq) // HACK
600 uuid = gen_uuid ();
601
602 speed_left = -0.1f;
603 /* copy the body_info to the body_used - this is only really
604 * need for monsters, but doesn't hurt to do it for everything.
605 * by doing so, when a monster is created, it has good starting
606 * values for the body_used info, so when items are created
607 * for it, they can be properly equipped.
608 */
609 for (int i = NUM_BODY_LOCATIONS; i--; )
610 slot[i].used = slot[i].info;
611
612 attachable::instantiate ();
527} 613}
528 614
529object * 615object *
530object::clone () 616object::clone ()
531{ 617{
589 * UP_OBJ_FACE: only the objects face has changed. 675 * UP_OBJ_FACE: only the objects face has changed.
590 */ 676 */
591void 677void
592update_object (object *op, int action) 678update_object (object *op, int action)
593{ 679{
594 MoveType move_on, move_off, move_block, move_slow;
595
596 if (op == NULL) 680 if (op == NULL)
597 { 681 {
598 /* this should never happen */ 682 /* this should never happen */
599 LOG (llevDebug, "update_object() called for NULL object.\n"); 683 LOG (llevDebug, "update_object() called for NULL object.\n");
600 return; 684 return;
852 map = freed_map; 936 map = freed_map;
853 x = 1; 937 x = 1;
854 y = 1; 938 y = 1;
855 } 939 }
856 940
857 head = 0;
858
859 if (more) 941 if (more)
860 { 942 {
861 more->destroy (); 943 more->destroy ();
862 more = 0; 944 more = 0;
863 } 945 }
864 946
947 head = 0;
948
865 // clear those pointers that likely might have circular references to us 949 // clear those pointers that likely might cause circular references
866 owner = 0; 950 owner = 0;
867 enemy = 0; 951 enemy = 0;
868 attacked_by = 0; 952 attacked_by = 0;
953 current_weapon = 0;
869} 954}
870 955
871void 956void
872object::destroy (bool destroy_inventory) 957object::destroy (bool destroy_inventory)
873{ 958{
874 if (destroyed ()) 959 if (destroyed ())
875 return; 960 return;
876 961
877 if (destroy_inventory) 962 if (destroy_inventory)
878 destroy_inv (false); 963 destroy_inv (false);
964
965 if (sound_destroy)
966 play_sound (sound_destroy);
967 else if (flag [FLAG_MONSTER])
968 play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
879 969
880 attachable::destroy (); 970 attachable::destroy ();
881} 971}
882 972
883/* 973/*
901 * This function removes the object op from the linked list of objects 991 * This function removes the object op from the linked list of objects
902 * which it is currently tied to. When this function is done, the 992 * which it is currently tied to. When this function is done, the
903 * object will have no environment. If the object previously had an 993 * object will have no environment. If the object previously had an
904 * environment, the x and y coordinates will be updated to 994 * environment, the x and y coordinates will be updated to
905 * the previous environment. 995 * the previous environment.
906 * Beware: This function is called from the editor as well!
907 */ 996 */
908void 997void
909object::remove_slow () 998object::do_remove ()
910{ 999{
911 object *tmp, *last = 0; 1000 object *tmp, *last = 0;
912 object *otmp; 1001 object *otmp;
913 1002
914 if (QUERY_FLAG (this, FLAG_REMOVED)) 1003 if (QUERY_FLAG (this, FLAG_REMOVED))
957 } 1046 }
958 else if (map) 1047 else if (map)
959 { 1048 {
960 if (type == PLAYER) 1049 if (type == PLAYER)
961 { 1050 {
1051 // leaving a spot always closes any open container on the ground
1052 if (container && !container->env)
1053 // this causes spurious floorbox updates, but it ensures
1054 // that the CLOSE event is being sent.
1055 close_container ();
1056
962 --map->players; 1057 --map->players;
963 map->touch (); 1058 map->touch ();
964 } 1059 }
965 1060
966 map->dirty = true; 1061 map->dirty = true;
1026 1121
1027 if (destroyed ()) 1122 if (destroyed ())
1028 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); 1123 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1029 } 1124 }
1030 1125
1031 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1032 //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1033 if (tmp->above == tmp)
1034 tmp->above = 0;
1035
1036 last = tmp; 1126 last = tmp;
1037 } 1127 }
1038 1128
1039 /* last == NULL if there are no objects on this space */ 1129 /* last == NULL if there are no objects on this space */
1040 //TODO: this makes little sense, why only update the topmost object? 1130 //TODO: this makes little sense, why only update the topmost object?
1083 } 1173 }
1084 1174
1085 return 0; 1175 return 0;
1086} 1176}
1087 1177
1178void
1179object::expand_tail ()
1180{
1181 if (more)
1182 return;
1183
1184 object *prev = this;
1185
1186 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1187 {
1188 object *op = arch_to_object (at);
1189
1190 op->name = name;
1191 op->name_pl = name_pl;
1192 op->title = title;
1193
1194 op->head = this;
1195 prev->more = op;
1196
1197 prev = op;
1198 }
1199}
1200
1088/* 1201/*
1089 * same as insert_ob_in_map except it handles separate coordinates and does a clean 1202 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1090 * job preparing multi-part monsters. 1203 * job preparing multi-part monsters.
1091 */ 1204 */
1092object * 1205object *
1093insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1206insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1094{ 1207{
1095 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1208 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1096 { 1209 {
1097 tmp->x = x + tmp->arch->clone.x; 1210 tmp->x = x + tmp->arch->x;
1098 tmp->y = y + tmp->arch->clone.y; 1211 tmp->y = y + tmp->arch->y;
1099 } 1212 }
1100 1213
1101 return insert_ob_in_map (op, m, originator, flag); 1214 return insert_ob_in_map (op, m, originator, flag);
1102} 1215}
1103 1216
1122 * just 'op' otherwise 1235 * just 'op' otherwise
1123 */ 1236 */
1124object * 1237object *
1125insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1238insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1126{ 1239{
1240 assert (!op->flag [FLAG_FREED]);
1241
1127 object *tmp, *top, *floor = NULL; 1242 object *top, *floor = NULL;
1128
1129 if (QUERY_FLAG (op, FLAG_FREED))
1130 {
1131 LOG (llevError, "Trying to insert freed object!\n");
1132 return NULL;
1133 }
1134
1135 if (!QUERY_FLAG (op, FLAG_REMOVED))
1136 LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
1137 1243
1138 op->remove (); 1244 op->remove ();
1139 1245
1140 if (!m) 1246#if 0
1141 { 1247 if (!m->active != !op->active)
1142 char *dump = dump_object (op); 1248 if (m->active)
1143 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1249 op->activate_recursive ();
1144 free (dump); 1250 else
1145 return op; 1251 op->deactivate_recursive ();
1146 } 1252#endif
1147 1253
1148 if (out_of_map (m, op->x, op->y)) 1254 if (out_of_map (m, op->x, op->y))
1149 { 1255 {
1150 char *dump = dump_object (op);
1151 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1256 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1152#ifdef MANY_CORES 1257#ifdef MANY_CORES
1153 /* Better to catch this here, as otherwise the next use of this object 1258 /* Better to catch this here, as otherwise the next use of this object
1154 * is likely to cause a crash. Better to find out where it is getting 1259 * is likely to cause a crash. Better to find out where it is getting
1155 * improperly inserted. 1260 * improperly inserted.
1156 */ 1261 */
1157 abort (); 1262 abort ();
1158#endif 1263#endif
1159 free (dump);
1160 return op; 1264 return op;
1161 } 1265 }
1162 1266
1163 if (object *more = op->more) 1267 if (object *more = op->more)
1164 {
1165 if (!insert_ob_in_map (more, m, originator, flag)) 1268 if (!insert_ob_in_map (more, m, originator, flag))
1166 {
1167 if (!op->head)
1168 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1169
1170 return 0; 1269 return 0;
1171 }
1172 }
1173 1270
1174 CLEAR_FLAG (op, FLAG_REMOVED); 1271 CLEAR_FLAG (op, FLAG_REMOVED);
1175 1272
1176 /* Ideally, the caller figures this out. However, it complicates a lot 1273 /* Ideally, the caller figures this out. However, it complicates a lot
1177 * of areas of callers (eg, anything that uses find_free_spot would now 1274 * of areas of callers (eg, anything that uses find_free_spot would now
1184 mapspace &ms = op->ms (); 1281 mapspace &ms = op->ms ();
1185 1282
1186 /* this has to be done after we translate the coordinates. 1283 /* this has to be done after we translate the coordinates.
1187 */ 1284 */
1188 if (op->nrof && !(flag & INS_NO_MERGE)) 1285 if (op->nrof && !(flag & INS_NO_MERGE))
1189 for (tmp = ms.bot; tmp; tmp = tmp->above) 1286 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1190 if (object::can_merge (op, tmp)) 1287 if (object::can_merge (op, tmp))
1191 { 1288 {
1192 op->nrof += tmp->nrof; 1289 op->nrof += tmp->nrof;
1193 tmp->destroy (); 1290 tmp->destroy ();
1194 } 1291 }
1261 * looks like instead of lots of conditions here. 1358 * looks like instead of lots of conditions here.
1262 * makes things faster, and effectively the same result. 1359 * makes things faster, and effectively the same result.
1263 */ 1360 */
1264 1361
1265 /* Have object 'fall below' other objects that block view. 1362 /* Have object 'fall below' other objects that block view.
1266 * Unless those objects are exits, type 66 1363 * Unless those objects are exits.
1267 * If INS_ON_TOP is used, don't do this processing 1364 * If INS_ON_TOP is used, don't do this processing
1268 * Need to find the object that in fact blocks view, otherwise 1365 * Need to find the object that in fact blocks view, otherwise
1269 * stacking is a bit odd. 1366 * stacking is a bit odd.
1270 */ 1367 */
1271 if (!(flag & INS_ON_TOP) 1368 if (!(flag & INS_ON_TOP)
1272 && ms.flags () & P_BLOCKSVIEW 1369 && ms.flags () & P_BLOCKSVIEW
1273 && (op->face && !op->face->visibility)) 1370 && (op->face && !faces [op->face].visibility))
1274 { 1371 {
1275 for (last = top; last != floor; last = last->below) 1372 for (last = top; last != floor; last = last->below)
1276 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1373 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1277 break; 1374 break;
1278 1375
1283 */ 1380 */
1284 if (last && last->below && last != floor) 1381 if (last && last->below && last != floor)
1285 top = last->below; 1382 top = last->below;
1286 } 1383 }
1287 } /* If objects on this space */ 1384 } /* If objects on this space */
1288
1289 if (flag & INS_MAP_LOAD) 1385 if (flag & INS_MAP_LOAD)
1290 top = ms.top; 1386 top = ms.top;
1291 1387
1292 if (flag & INS_ABOVE_FLOOR_ONLY) 1388 if (flag & INS_ABOVE_FLOOR_ONLY)
1293 top = floor; 1389 top = floor;
1363 * blocked() and wall() work properly), and these flags are updated by 1459 * blocked() and wall() work properly), and these flags are updated by
1364 * update_object(). 1460 * update_object().
1365 */ 1461 */
1366 1462
1367 /* if this is not the head or flag has been passed, don't check walk on status */ 1463 /* if this is not the head or flag has been passed, don't check walk on status */
1368 if (!(flag & INS_NO_WALK_ON) && !op->head) 1464 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1369 { 1465 {
1370 if (check_move_on (op, originator)) 1466 if (check_move_on (op, originator))
1371 return 0; 1467 return 0;
1372 1468
1373 /* If we are a multi part object, lets work our way through the check 1469 /* If we are a multi part object, lets work our way through the check
1374 * walk on's. 1470 * walk on's.
1375 */ 1471 */
1376 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1472 for (object *tmp = op->more; tmp; tmp = tmp->more)
1377 if (check_move_on (tmp, originator)) 1473 if (check_move_on (tmp, originator))
1378 return 0; 1474 return 0;
1379 } 1475 }
1380 1476
1381 return op; 1477 return op;
1391 object *tmp, *tmp1; 1487 object *tmp, *tmp1;
1392 1488
1393 /* first search for itself and remove any old instances */ 1489 /* first search for itself and remove any old instances */
1394 1490
1395 for (tmp = op->ms ().bot; tmp; tmp = tmp->above) 1491 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1396 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1492 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1397 tmp->destroy (); 1493 tmp->destroy ();
1398 1494
1399 tmp1 = arch_to_object (archetype::find (arch_string)); 1495 tmp1 = arch_to_object (archetype::find (arch_string));
1400 1496
1401 tmp1->x = op->x; 1497 tmp1->x = op->x;
1404} 1500}
1405 1501
1406object * 1502object *
1407object::insert_at (object *where, object *originator, int flags) 1503object::insert_at (object *where, object *originator, int flags)
1408{ 1504{
1409 where->map->insert (this, where->x, where->y, originator, flags); 1505 return where->map->insert (this, where->x, where->y, originator, flags);
1410} 1506}
1411 1507
1412/* 1508/*
1413 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1509 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1414 * is returned contains nr objects, and the remaining parts contains 1510 * is returned contains nr objects, and the remaining parts contains
1454 * the amount of an object. If the amount reaches 0, the object 1550 * the amount of an object. If the amount reaches 0, the object
1455 * is subsequently removed and freed. 1551 * is subsequently removed and freed.
1456 * 1552 *
1457 * Return value: 'op' if something is left, NULL if the amount reached 0 1553 * Return value: 'op' if something is left, NULL if the amount reached 0
1458 */ 1554 */
1459
1460object * 1555object *
1461decrease_ob_nr (object *op, uint32 i) 1556decrease_ob_nr (object *op, uint32 i)
1462{ 1557{
1463 object *tmp; 1558 object *tmp;
1464 1559
1539 1634
1540/* 1635/*
1541 * add_weight(object, weight) adds the specified weight to an object, 1636 * add_weight(object, weight) adds the specified weight to an object,
1542 * and also updates how much the environment(s) is/are carrying. 1637 * and also updates how much the environment(s) is/are carrying.
1543 */ 1638 */
1544
1545void 1639void
1546add_weight (object *op, signed long weight) 1640add_weight (object *op, signed long weight)
1547{ 1641{
1548 while (op != NULL) 1642 while (op != NULL)
1549 { 1643 {
1564 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); 1658 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1565 free (dump); 1659 free (dump);
1566 return op; 1660 return op;
1567 } 1661 }
1568 1662
1569 if (where->head) 1663 if (where->head_ () != where)
1570 { 1664 {
1571 LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); 1665 LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1572 where = where->head; 1666 where = where->head;
1573 } 1667 }
1574 1668
1575 return where->insert (op); 1669 return where->insert (op);
1576} 1670}
1581 * inside the object environment. 1675 * inside the object environment.
1582 * 1676 *
1583 * The function returns now pointer to inserted item, and return value can 1677 * The function returns now pointer to inserted item, and return value can
1584 * be != op, if items are merged. -Tero 1678 * be != op, if items are merged. -Tero
1585 */ 1679 */
1586
1587object * 1680object *
1588object::insert (object *op) 1681object::insert (object *op)
1589{ 1682{
1590 object *tmp, *otmp; 1683 object *tmp, *otmp;
1591 1684
1905 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1998 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1906 { 1999 {
1907 CLEAR_FLAG (tmp, flag); 2000 CLEAR_FLAG (tmp, flag);
1908 unflag_inv (tmp, flag); 2001 unflag_inv (tmp, flag);
1909 } 2002 }
1910}
1911
1912/*
1913 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1914 * all it's inventory (recursively).
1915 * If checksums are used, a player will get set_cheat called for
1916 * him/her-self and all object carried by a call to this function.
1917 */
1918void
1919set_cheat (object *op)
1920{
1921 SET_FLAG (op, FLAG_WAS_WIZ);
1922 flag_inv (op, FLAG_WAS_WIZ);
1923} 2003}
1924 2004
1925/* 2005/*
1926 * find_free_spot(object, map, x, y, start, stop) will search for 2006 * find_free_spot(object, map, x, y, start, stop) will search for
1927 * a spot at the given map and coordinates which will be able to contain 2007 * a spot at the given map and coordinates which will be able to contain
1968 } 2048 }
1969 2049
1970 if (!index) 2050 if (!index)
1971 return -1; 2051 return -1;
1972 2052
1973 return altern[RANDOM () % index]; 2053 return altern [rndm (index)];
1974} 2054}
1975 2055
1976/* 2056/*
1977 * find_first_free_spot(archetype, maptile, x, y) works like 2057 * find_first_free_spot(archetype, maptile, x, y) works like
1978 * find_free_spot(), but it will search max number of squares. 2058 * find_free_spot(), but it will search max number of squares.
1999{ 2079{
2000 arr += begin; 2080 arr += begin;
2001 end -= begin; 2081 end -= begin;
2002 2082
2003 while (--end) 2083 while (--end)
2004 swap (arr [end], arr [RANDOM () % (end + 1)]); 2084 swap (arr [end], arr [rndm (end + 1)]);
2005} 2085}
2006 2086
2007/* new function to make monster searching more efficient, and effective! 2087/* new function to make monster searching more efficient, and effective!
2008 * This basically returns a randomized array (in the passed pointer) of 2088 * This basically returns a randomized array (in the passed pointer) of
2009 * the spaces to find monsters. In this way, it won't always look for 2089 * the spaces to find monsters. In this way, it won't always look for
2045 object *tmp; 2125 object *tmp;
2046 maptile *mp; 2126 maptile *mp;
2047 2127
2048 MoveType blocked, move_type; 2128 MoveType blocked, move_type;
2049 2129
2050 if (exclude && exclude->head) 2130 if (exclude && exclude->head_ () != exclude)
2051 { 2131 {
2052 exclude = exclude->head; 2132 exclude = exclude->head;
2053 move_type = exclude->move_type; 2133 move_type = exclude->move_type;
2054 } 2134 }
2055 else 2135 else
2078 max = maxfree[i]; 2158 max = maxfree[i];
2079 else if (mflags & P_IS_ALIVE) 2159 else if (mflags & P_IS_ALIVE)
2080 { 2160 {
2081 for (tmp = ms.bot; tmp; tmp = tmp->above) 2161 for (tmp = ms.bot; tmp; tmp = tmp->above)
2082 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2162 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2083 && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2163 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2084 break; 2164 break;
2085 2165
2086 if (tmp) 2166 if (tmp)
2087 return freedir[i]; 2167 return freedir[i];
2088 } 2168 }
2283 * create clone from object to another 2363 * create clone from object to another
2284 */ 2364 */
2285object * 2365object *
2286object_create_clone (object *asrc) 2366object_create_clone (object *asrc)
2287{ 2367{
2288 object *dst = 0, *tmp, *src, *part, *prev, *item; 2368 object *dst = 0, *tmp, *src, *prev, *item;
2289 2369
2290 if (!asrc) 2370 if (!asrc)
2291 return 0; 2371 return 0;
2292 2372
2293 src = asrc;
2294 if (src->head)
2295 src = src->head; 2373 src = asrc->head_ ();
2296 2374
2297 prev = 0; 2375 prev = 0;
2298 for (part = src; part; part = part->more) 2376 for (object *part = src; part; part = part->more)
2299 { 2377 {
2300 tmp = part->clone (); 2378 tmp = part->clone ();
2301 tmp->x -= src->x; 2379 tmp->x -= src->x;
2302 tmp->y -= src->y; 2380 tmp->y -= src->y;
2303 2381
2321 insert_ob_in_ob (object_create_clone (item), dst); 2399 insert_ob_in_ob (object_create_clone (item), dst);
2322 2400
2323 return dst; 2401 return dst;
2324} 2402}
2325 2403
2326/* GROS - Creates an object using a string representing its content. */
2327/* Basically, we save the content of the string to a temp file, then call */
2328/* load_object on it. I admit it is a highly inefficient way to make things, */
2329/* but it was simple to make and allows reusing the load_object function. */
2330/* Remember not to use load_object_str in a time-critical situation. */
2331/* Also remember that multiparts objects are not supported for now. */
2332object *
2333load_object_str (const char *obstr)
2334{
2335 object *op;
2336 char filename[MAX_BUF];
2337
2338 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2339
2340 FILE *tempfile = fopen (filename, "w");
2341
2342 if (tempfile == NULL)
2343 {
2344 LOG (llevError, "Error - Unable to access load object temp file\n");
2345 return NULL;
2346 }
2347
2348 fprintf (tempfile, obstr);
2349 fclose (tempfile);
2350
2351 op = object::create ();
2352
2353 object_thawer thawer (filename);
2354
2355 if (thawer)
2356 load_object (thawer, op, 0);
2357
2358 LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2359 CLEAR_FLAG (op, FLAG_REMOVED);
2360
2361 return op;
2362}
2363
2364/* This returns the first object in who's inventory that 2404/* This returns the first object in who's inventory that
2365 * has the same type and subtype match. 2405 * has the same type and subtype match.
2366 * returns NULL if no match. 2406 * returns NULL if no match.
2367 */ 2407 */
2368object * 2408object *
2421 if (link->key == canonical_key) 2461 if (link->key == canonical_key)
2422 return link->value; 2462 return link->value;
2423 2463
2424 return 0; 2464 return 0;
2425} 2465}
2426
2427 2466
2428/* 2467/*
2429 * Updates the canonical_key in op to value. 2468 * Updates the canonical_key in op to value.
2430 * 2469 *
2431 * canonical_key is a shared string (value doesn't have to be). 2470 * canonical_key is a shared string (value doesn't have to be).
2455 /* Basically, if the archetype has this key set, 2494 /* Basically, if the archetype has this key set,
2456 * we need to store the null value so when we save 2495 * we need to store the null value so when we save
2457 * it, we save the empty value so that when we load, 2496 * it, we save the empty value so that when we load,
2458 * we get this value back again. 2497 * we get this value back again.
2459 */ 2498 */
2460 if (get_ob_key_link (&op->arch->clone, canonical_key)) 2499 if (get_ob_key_link (op->arch, canonical_key))
2461 field->value = 0; 2500 field->value = 0;
2462 else 2501 else
2463 { 2502 {
2464 if (last) 2503 if (last)
2465 last->next = field->next; 2504 last->next = field->next;
2534 } 2573 }
2535 else 2574 else
2536 item = item->env; 2575 item = item->env;
2537} 2576}
2538 2577
2539
2540const char * 2578const char *
2541object::flag_desc (char *desc, int len) const 2579object::flag_desc (char *desc, int len) const
2542{ 2580{
2543 char *p = desc; 2581 char *p = desc;
2544 bool first = true; 2582 bool first = true;
2571{ 2609{
2572 char flagdesc[512]; 2610 char flagdesc[512];
2573 char info2[256 * 4]; 2611 char info2[256 * 4];
2574 char *p = info; 2612 char *p = info;
2575 2613
2576 p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", 2614 p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2577 count, uuid.seq, 2615 count, uuid.seq,
2578 &name, 2616 &name,
2579 title ? "\",title:\"" : "", 2617 title ? "\",title:\"" : "",
2580 title ? (const char *)title : "", 2618 title ? (const char *)title : "",
2581 flag_desc (flagdesc, 512), type); 2619 flag_desc (flagdesc, 512), type);
2590} 2628}
2591 2629
2592const char * 2630const char *
2593object::debug_desc () const 2631object::debug_desc () const
2594{ 2632{
2595 static char info[256 * 4]; 2633 static char info[3][256 * 4];
2634 static int info_idx;
2635
2596 return debug_desc (info); 2636 return debug_desc (info [++info_idx % 3]);
2597} 2637}
2598 2638
2599const char * 2639struct region *
2600object::debug_desc2 () const 2640object::region () const
2601{ 2641{
2602 static char info[256 * 4]; 2642 return map ? map->region (x, y)
2603 return debug_desc (info); 2643 : region::default_region ();
2604} 2644}
2605 2645
2646const materialtype_t *
2647object::dominant_material () const
2648{
2649 if (materialtype_t *mt = name_to_material (materialname))
2650 return mt;
2651
2652 return name_to_material (shstr_unknown);
2653}
2654
2655void
2656object::open_container (object *new_container)
2657{
2658 if (container == new_container)
2659 return;
2660
2661 if (object *old_container = container)
2662 {
2663 if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2664 return;
2665
2666#if 0
2667 // remove the "Close old_container" object.
2668 if (object *closer = old_container->inv)
2669 if (closer->type == CLOSE_CON)
2670 closer->destroy ();
2671#endif
2672
2673 old_container->flag [FLAG_APPLIED] = 0;
2674 container = 0;
2675
2676 esrv_update_item (UPD_FLAGS, this, old_container);
2677 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2678 }
2679
2680 if (new_container)
2681 {
2682 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
2683 return;
2684
2685 // TODO: this does not seem to serve any purpose anymore?
2686#if 0
2687 // insert the "Close Container" object.
2688 if (archetype *closer = new_container->other_arch)
2689 {
2690 object *closer = arch_to_object (new_container->other_arch);
2691 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2692 new_container->insert (closer);
2693 }
2694#endif
2695
2696 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2697
2698 new_container->flag [FLAG_APPLIED] = 1;
2699 container = new_container;
2700
2701 esrv_update_item (UPD_FLAGS, this, new_container);
2702 esrv_send_inventory (this, new_container);
2703 }
2704}
2705
2706object *
2707object::force_find (const shstr name)
2708{
2709 /* cycle through his inventory to look for the MARK we want to
2710 * place
2711 */
2712 for (object *tmp = inv; tmp; tmp = tmp->below)
2713 if (tmp->type == FORCE && tmp->slaying == name)
2714 return splay (tmp);
2715
2716 return 0;
2717}
2718
2719void
2720object::force_add (const shstr name, int duration)
2721{
2722 if (object *force = force_find (name))
2723 force->destroy ();
2724
2725 object *force = get_archetype (FORCE_NAME);
2726
2727 force->slaying = name;
2728 force->stats.food = 1;
2729 force->speed_left = -1.f;
2730
2731 force->set_speed (duration ? 1.f / duration : 0.f);
2732 force->flag [FLAG_IS_USED_UP] = true;
2733 force->flag [FLAG_APPLIED] = true;
2734
2735 insert (force);
2736}
2737

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines