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.291 by root, Mon Oct 12 14:00:57 2009 UTC vs.
Revision 1.314 by root, Fri Mar 26 00:59:20 2010 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Deliantra is free software: you can redistribute it and/or modify it under 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * the terms of the Affero GNU General Public License as published by the 9 * the terms of the Affero GNU General Public License as published by the
10 * Free Software Foundation, either version 3 of the License, or (at your 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * option) any later version. 11 * option) any later version.
26#include <stdio.h> 26#include <stdio.h>
27#include <sys/types.h> 27#include <sys/types.h>
28#include <sys/uio.h> 28#include <sys/uio.h>
29#include <object.h> 29#include <object.h>
30#include <sproto.h> 30#include <sproto.h>
31#include <loader.h>
32 31
33#include <bitset> 32#include <bitset>
34 33
35UUID UUID::cur; 34UUID UUID::cur;
36static uint64_t seq_next_save; 35static uint64_t seq_next_save;
37static const uint64 UUID_GAP = 1<<19; 36static const uint64 UUID_GAP = 1<<19;
38uint32_t mapspace::smellcount = 10000; 37uint32_t mapspace::smellcount = 10000;
39 38
40objectvec objects; 39objectvec objects;
41activevec actives; 40activevec actives;
41
42//+GPL
42 43
43short freearr_x[SIZEOFFREE] = { 44short freearr_x[SIZEOFFREE] = {
44 0, 45 0,
45 0, 1, 1, 1, 0, -1, -1, -1, 46 0, 1, 1, 1, 0, -1, -1, -1,
46 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, 47 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
50 0, 51 0,
51 -1, -1, 0, 1, 1, 1, 0, -1, 52 -1, -1, 0, 1, 1, 1, 0, -1,
52 -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, 53 -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
53 -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 54 -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
54}; 55};
55int maxfree[SIZEOFFREE] = {
56 0,
57 9, 10, 13, 14, 17, 18, 21, 22,
58 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
59 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
60};
61int freedir[SIZEOFFREE] = { 56int freedir[SIZEOFFREE] = {
62 0, 57 0,
63 1, 2, 3, 4, 5, 6, 7, 8, 58 1, 2, 3, 4, 5, 6, 7, 8,
64 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, 59 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
65 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 60 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
66}; 61};
67 62
63static int maxfree[SIZEOFFREE] = {
64 0,
65 9, 10, 13, 14, 17, 18, 21, 22,
66 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
67 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
68};
69
68static void 70static void
69write_uuid (uval64 skip, bool sync) 71write_uuid (uval64 skip, bool sync)
70{ 72{
71 CALL_BEGIN (2); 73 CALL_BEGIN (2);
72 CALL_ARG_SV (newSVval64 (skip)); 74 CALL_ARG_SV (newSVval64 (skip));
74 CALL_CALL ("cf::write_uuid", G_DISCARD); 76 CALL_CALL ("cf::write_uuid", G_DISCARD);
75 CALL_END; 77 CALL_END;
76} 78}
77 79
78static void 80static void
79read_uuid (void) 81read_uuid ()
80{ 82{
81 char filename[MAX_BUF]; 83 char filename[MAX_BUF];
82 84
83 sprintf (filename, "%s/uuid", settings.localdir); 85 sprintf (filename, "%s/uuid", settings.localdir);
84 86
98 100
99 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); 101 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
100 _exit (1); 102 _exit (1);
101 } 103 }
102 104
103 UUID::BUF buf; 105 char buf [UUID::MAX_LEN];
104 buf[0] = 0; 106 buf[0] = 0;
105 fgets (buf, sizeof (buf), fp); 107 fgets (buf, sizeof (buf), fp);
106 108
107 if (!UUID::cur.parse (buf)) 109 if (!UUID::cur.parse (buf))
108 { 110 {
135 137
136void 138void
137UUID::init () 139UUID::init ()
138{ 140{
139 read_uuid (); 141 read_uuid ();
142}
143
144bool
145UUID::parse (const char *s)
146{
147 if (*s++ != '<' || *s++ != '1' || *s++ != '.')
148 return false;
149
150 seq = 0;
151
152 while (*s != '>')
153 {
154 if (*s < '0')
155 return false;
156
157 // this gives nice branchless code with gcc
158 assert ('0' < 'a' && '0' == 48 && 'a' == 97);
159 int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15;
160
161 seq = (seq << 4) | digit;
162
163 ++s;
164 }
165
166 return true;
167}
168
169char *
170UUID::append (char *buf) const
171{
172 *buf++ = '<';
173 *buf++ = '1';
174 *buf++ = '.';
175
176 uint64_t seq = this->seq;
177 const int bits = 64;
178 char nz = 0;
179 static const char tohex [] = "0123456789abcdef";
180
181 // assert (len >= 3 + bits / 4 + 1 + 1);
182 for (int i = bits / 4; --i; )
183 {
184 uint8_t digit = seq >> (bits - 4);
185
186 *buf = tohex [digit];
187 nz |= digit;
188 buf += nz ? 1 : 0;
189 seq <<= 4;
190 }
191
192 // last digit is special - always emit
193 uint8_t digit = seq >> (bits - 4);
194 *buf++ = tohex [digit];
195
196 *buf++ = '>';
197
198 return buf;
199}
200
201char *
202UUID::c_str () const
203{
204 static char buf [MAX_LEN];
205 *append (buf) = 0;
206 return buf;
140} 207}
141 208
142/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ 209/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
143static bool 210static bool
144compare_ob_value_lists_one (const object *wants, const object *has) 211compare_ob_value_lists_one (const object *wants, const object *has)
180 * Improvements made with merge: Better checking on potion, and also 247 * Improvements made with merge: Better checking on potion, and also
181 * check weight 248 * check weight
182 */ 249 */
183bool object::can_merge_slow (object *ob1, object *ob2) 250bool object::can_merge_slow (object *ob1, object *ob2)
184{ 251{
185 /* A couple quicksanity checks */ 252 /* A couple quick sanity checks */
186 if (ob1 == ob2 253 if (ob1 == ob2
187 || ob1->type != ob2->type 254 || ob1->type != ob2->type
188 || ob1->speed != ob2->speed
189 || ob1->value != ob2->value 255 || ob1->value != ob2->value
190 || ob1->name != ob2->name) 256 || ob1->name != ob2->name
257 || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
191 return 0; 258 return 0;
192 259
193 /* Do not merge objects if nrof would overflow, assume nrof 260 /* Do not merge objects if nrof would overflow, assume nrof
194 * is always 0 .. 2**31-1 */ 261 * is always 0 .. 2**31-1 */
195 if (ob1->nrof > 0x7fffffff - ob2->nrof) 262 if (ob1->nrof > 0x7fffffff - ob2->nrof)
216 || ob1->magic != ob2->magic 283 || ob1->magic != ob2->magic
217 || ob1->slaying != ob2->slaying 284 || ob1->slaying != ob2->slaying
218 || ob1->skill != ob2->skill 285 || ob1->skill != ob2->skill
219 || ob1->value != ob2->value 286 || ob1->value != ob2->value
220 || ob1->animation_id != ob2->animation_id 287 || ob1->animation_id != ob2->animation_id
221 || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other 288 || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other
222 || ob1->client_type != ob2->client_type 289 || ob1->client_type != ob2->client_type
223 || ob1->materialname != ob2->materialname 290 || ob1->material != ob2->material
224 || ob1->lore != ob2->lore 291 || ob1->lore != ob2->lore
225 || ob1->subtype != ob2->subtype 292 || ob1->subtype != ob2->subtype
226 || ob1->move_type != ob2->move_type 293 || ob1->move_type != ob2->move_type
227 || ob1->move_block != ob2->move_block 294 || ob1->move_block != ob2->move_block
228 || ob1->move_allow != ob2->move_allow 295 || ob1->move_allow != ob2->move_allow
229 || ob1->move_on != ob2->move_on 296 || ob1->move_on != ob2->move_on
230 || ob1->move_off != ob2->move_off 297 || ob1->move_off != ob2->move_off
231 || ob1->move_slow != ob2->move_slow 298 || ob1->move_slow != ob2->move_slow
232 || ob1->move_slow_penalty != ob2->move_slow_penalty 299 || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
233 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) 300 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
234 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) 301 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
235 return 0; 302 return 0;
236 303
237 if ((ob1->flag ^ ob2->flag) 304 if ((ob1->flag ^ ob2->flag)
335 402
336 // the player itself is always on a map, so we will find him here 403 // the player itself is always on a map, so we will find him here
337 // even if our inv is in a player. 404 // even if our inv is in a player.
338 if (envest->is_on_map ()) 405 if (envest->is_on_map ())
339 if (object *pl = envest->ms ().player ()) 406 if (object *pl = envest->ms ().player ())
340 if (pl->container == env) 407 if (pl->container_ () == env)
341 return pl; 408 return pl;
342 } 409 }
343 else 410 else
344 { 411 {
345 // maybe there is a player standing on the same mapspace 412 // maybe there is a player standing on the same mapspace
346 // this will catch the case where "this" is a player 413 // this will catch the case where "this" is a player
347 if (object *pl = ms ().player ()) 414 if (object *pl = ms ().player ())
348 if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look) 415 if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
349 || this == pl->container) 416 || pl->container_ () == this)
350 return pl; 417 return pl;
351 } 418 }
352 } 419 }
353 420
354 return 0; 421 return 0;
439{ 506{
440 return dump_object (this); 507 return dump_object (this);
441} 508}
442 509
443/* 510/*
444 * get_nearest_part(multi-object, object 2) returns the part of the
445 * multi-object 1 which is closest to the second object.
446 * If it's not a multi-object, it is returned.
447 */
448object *
449get_nearest_part (object *op, const object *pl)
450{
451 object *tmp, *closest;
452 int last_dist, i;
453
454 if (!op->more)
455 return op;
456
457 for (last_dist = distance (op, pl), closest = op, tmp = op->more;
458 tmp;
459 tmp = tmp->more)
460 if ((i = distance (tmp, pl)) < last_dist)
461 closest = tmp, last_dist = i;
462
463 return closest;
464}
465
466/*
467 * Returns the object which has the count-variable equal to the argument. 511 * Returns the object which has the count-variable equal to the argument.
468 * VERRRY slow. 512 * VERRRY slow.
469 */ 513 */
470object * 514object *
471find_object (tag_t i) 515find_object (tag_t i)
472{ 516{
473 for_all_objects (op) 517 for_all_objects (op)
474 if (op->count == i) 518 if (op->count == i)
519 return op;
520
521 return 0;
522}
523
524/*
525 * Returns the object which has the uuid equal to the argument.
526 * MOAR VERRRY slow.
527 */
528
529object *
530find_object_uuid (UUID i)
531{
532 for_all_objects (op)
533 if (op->uuid == i)
475 return op; 534 return op;
476 535
477 return 0; 536 return 0;
478} 537}
479 538
642 tail = new_link; 701 tail = new_link;
643 } 702 }
644 } 703 }
645 } 704 }
646 705
647 if (speed < 0)
648 dst->speed_left -= rndm ();
649
650 dst->activate (); 706 dst->activate ();
651} 707}
652 708
653void 709void
654object::instantiate () 710object::instantiate ()
655{ 711{
656 if (!uuid.seq) // HACK 712 if (!uuid.seq) // HACK
657 uuid = UUID::gen (); 713 uuid = UUID::gen ();
658 714
715 // TODO: unclean state changes, should nt be done in copy_to AND instantiate
716 if (flag [FLAG_RANDOM_SPEED] && speed)
717 speed_left = - speed - rndm (); // TODO animation
718 else
659 speed_left = -0.1f; 719 speed_left = -1.;
720
660 /* copy the body_info to the body_used - this is only really 721 /* copy the body_info to the body_used - this is only really
661 * need for monsters, but doesn't hurt to do it for everything. 722 * need for monsters, but doesn't hurt to do it for everything.
662 * by doing so, when a monster is created, it has good starting 723 * by doing so, when a monster is created, it has good starting
663 * values for the body_used info, so when items are created 724 * values for the body_used info, so when items are created
664 * for it, they can be properly equipped. 725 * for it, they can be properly equipped.
672object * 733object *
673object::clone () 734object::clone ()
674{ 735{
675 object *neu = create (); 736 object *neu = create ();
676 copy_to (neu); 737 copy_to (neu);
738
739 // TODO: unclean state changes, should not be done in clone AND instantiate
740 if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed)
741 neu->speed_left = - neu->speed - rndm (); // TODO animation
742
677 neu->map = map; // not copied by copy_to 743 neu->map = map; // not copied by copy_to
678 return neu; 744 return neu;
679} 745}
680 746
681/* 747/*
699 * This function needs to be called whenever the speed of an object changes. 765 * This function needs to be called whenever the speed of an object changes.
700 */ 766 */
701void 767void
702object::set_speed (float speed) 768object::set_speed (float speed)
703{ 769{
704 if (flag [FLAG_FREED] && speed)
705 {
706 LOG (llevError, "Object %s is freed but has speed.\n", &name);
707 speed = 0;
708 }
709
710 this->speed = speed; 770 this->speed = speed;
711 771
712 if (has_active_speed ()) 772 if (has_active_speed ())
713 activate (); 773 activate ();
714 else 774 else
764 824
765 if (!(m.flags_ & P_UPTODATE)) 825 if (!(m.flags_ & P_UPTODATE))
766 /* nop */; 826 /* nop */;
767 else if (action == UP_OBJ_INSERT) 827 else if (action == UP_OBJ_INSERT)
768 { 828 {
829#if 0
769 // this is likely overkill, TODO: revisit (schmorp) 830 // this is likely overkill, TODO: revisit (schmorp)
770 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) 831 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
771 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) 832 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
772 || (op->is_player () && !(m.flags_ & P_PLAYER)) 833 || (op->is_player () && !(m.flags_ & P_PLAYER))
773 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) 834 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
778 || (m.move_slow | op->move_slow) != m.move_slow 839 || (m.move_slow | op->move_slow) != m.move_slow
779 /* This isn't perfect, but I don't expect a lot of objects to 840 /* This isn't perfect, but I don't expect a lot of objects to
780 * have move_allow right now. 841 * have move_allow right now.
781 */ 842 */
782 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block 843 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
783 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
784 m.invalidate (); 844 m.invalidate ();
845#else
846 // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
847 m.invalidate ();
848#endif
785 } 849 }
786 /* if the object is being removed, we can't make intelligent 850 /* if the object is being removed, we can't make intelligent
787 * decisions, because remove_ob can't really pass the object 851 * decisions, because remove_ob can't really pass the object
788 * that is being removed. 852 * that is being removed.
789 */ 853 */
801object::object () 865object::object ()
802{ 866{
803 SET_FLAG (this, FLAG_REMOVED); 867 SET_FLAG (this, FLAG_REMOVED);
804 868
805 //expmul = 1.0; declared const for the time being 869 //expmul = 1.0; declared const for the time being
806 face = blank_face; 870 face = blank_face;
871 material = MATERIAL_NULL;
807} 872}
808 873
809object::~object () 874object::~object ()
810{ 875{
811 unlink (); 876 unlink ();
1041 * the previous environment. 1106 * the previous environment.
1042 */ 1107 */
1043void 1108void
1044object::do_remove () 1109object::do_remove ()
1045{ 1110{
1046 object *tmp, *last = 0;
1047 object *otmp;
1048
1049 if (flag [FLAG_REMOVED]) 1111 if (flag [FLAG_REMOVED])
1050 return; 1112 return;
1051 1113
1052 INVOKE_OBJECT (REMOVE, this); 1114 INVOKE_OBJECT (REMOVE, this);
1053 1115
1085 1147
1086 above = 0; 1148 above = 0;
1087 below = 0; 1149 below = 0;
1088 env = 0; 1150 env = 0;
1089 1151
1090 /* NO_FIX_PLAYER is set when a great many changes are being 1152 if (pl && pl->is_player ())
1091 * made to players inventory. If set, avoiding the call
1092 * to save cpu time.
1093 */
1094 if (pl)
1095 if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
1096 { 1153 {
1097 pl->update_stats (); 1154 pl->contr->queue_stats_update ();
1098 1155
1099 if (glow_radius && pl->is_on_map ()) 1156 if (glow_radius && pl->is_on_map ())
1100 update_all_los (pl->map, pl->x, pl->y); 1157 update_all_los (pl->map, pl->x, pl->y);
1101 } 1158 }
1102 } 1159 }
1103 else if (map) 1160 else if (map)
1104 { 1161 {
1105 map->dirty = true; 1162 map->dirty = true;
1106 mapspace &ms = this->ms (); 1163 mapspace &ms = this->ms ();
1119 close_container (); 1176 close_container ();
1120 1177
1121 --map->players; 1178 --map->players;
1122 map->touch (); 1179 map->touch ();
1123 } 1180 }
1124 else if (pl->container == this) 1181 else if (pl->container_ () == this)
1125 { 1182 {
1126 // removing a container should close it 1183 // removing a container should close it
1127 close_container (); 1184 close_container ();
1128 } 1185 }
1129 1186
1145 1202
1146 int check_walk_off = !flag [FLAG_NO_APPLY]; 1203 int check_walk_off = !flag [FLAG_NO_APPLY];
1147 1204
1148 if (object *pl = ms.player ()) 1205 if (object *pl = ms.player ())
1149 { 1206 {
1150 if (pl->container == this) 1207 if (pl->container_ () == this)
1151 /* If a container that the player is currently using somehow gets 1208 /* If a container that the player is currently using somehow gets
1152 * removed (most likely destroyed), update the player view 1209 * removed (most likely destroyed), update the player view
1153 * appropriately. 1210 * appropriately.
1154 */ 1211 */
1155 pl->close_container (); 1212 pl->close_container ();
1159 //TODO: update floorbox to preserve ordering 1216 //TODO: update floorbox to preserve ordering
1160 if (pl->contr->ns) 1217 if (pl->contr->ns)
1161 pl->contr->ns->floorbox_update (); 1218 pl->contr->ns->floorbox_update ();
1162 } 1219 }
1163 1220
1221 if (check_walk_off)
1164 for (tmp = ms.bot; tmp; tmp = tmp->above) 1222 for (object *above, *tmp = ms.bot; tmp; tmp = above)
1165 { 1223 {
1224 above = tmp->above;
1225
1166 /* No point updating the players look faces if he is the object 1226 /* No point updating the players look faces if he is the object
1167 * being removed. 1227 * being removed.
1168 */ 1228 */
1169 1229
1170 /* See if object moving off should effect something */ 1230 /* See if object moving off should effect something */
1171 if (check_walk_off
1172 && ((move_type & tmp->move_off) 1231 if ((move_type & tmp->move_off)
1173 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1232 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1174 {
1175 move_apply (tmp, this, 0); 1233 move_apply (tmp, this, 0);
1176
1177 if (destroyed ())
1178 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1179 } 1234 }
1180
1181 last = tmp;
1182 }
1183 1235
1184 if (affects_los ()) 1236 if (affects_los ())
1185 update_all_los (map, x, y); 1237 update_all_los (map, x, y);
1186 } 1238 }
1187} 1239}
1231 1283
1232 object *prev = this; 1284 object *prev = this;
1233 1285
1234 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) 1286 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1235 { 1287 {
1236 object *op = arch_to_object (at); 1288 object *op = at->instance ();
1237 1289
1238 op->name = name; 1290 op->name = name;
1239 op->name_pl = name_pl; 1291 op->name_pl = name_pl;
1240 op->title = title; 1292 op->title = title;
1241 1293
1279 * Passing 0 for flag gives proper default values, so flag really only needs 1331 * Passing 0 for flag gives proper default values, so flag really only needs
1280 * to be set if special handling is needed. 1332 * to be set if special handling is needed.
1281 * 1333 *
1282 * Return value: 1334 * Return value:
1283 * new object if 'op' was merged with other object 1335 * new object if 'op' was merged with other object
1284 * NULL if 'op' was destroyed 1336 * NULL if there was an error (destroyed, blocked etc.)
1285 * just 'op' otherwise 1337 * just 'op' otherwise
1286 */ 1338 */
1287object * 1339object *
1288insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1340insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1289{ 1341{
1516 1568
1517 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) 1569 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1518 if (tmp->arch->archname == archname) /* same archetype */ 1570 if (tmp->arch->archname == archname) /* same archetype */
1519 tmp->destroy (); 1571 tmp->destroy ();
1520 1572
1521 object *tmp = arch_to_object (archetype::find (archname)); 1573 object *tmp = archetype::find (archname)->instance ();
1522 1574
1523 tmp->x = op->x; 1575 tmp->x = op->x;
1524 tmp->y = op->y; 1576 tmp->y = op->y;
1525 1577
1526 insert_ob_in_map (tmp, op->map, op, 0); 1578 insert_ob_in_map (tmp, op->map, op, 0);
1531{ 1583{
1532 if (where->env) 1584 if (where->env)
1533 return where->env->insert (this); 1585 return where->env->insert (this);
1534 else 1586 else
1535 return where->map->insert (this, where->x, where->y, originator, flags); 1587 return where->map->insert (this, where->x, where->y, originator, flags);
1588}
1589
1590// check whether we can put this into the map, respect max_volume, max_items
1591bool
1592object::can_drop_at (maptile *m, int x, int y, object *originator)
1593{
1594 mapspace &ms = m->at (x, y);
1595
1596 int items = ms.items ();
1597
1598 if (!items // testing !items ensures we can drop at least one item
1599 || (items < m->max_items
1600 && ms.volume () < m->max_volume))
1601 return true;
1602
1603 if (originator && originator->is_player ())
1604 originator->contr->failmsg (format (
1605 "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
1606 query_name ()
1607 ));
1608
1609 return false;
1536} 1610}
1537 1611
1538/* 1612/*
1539 * decrease(object, number) decreases a specified number from 1613 * decrease(object, number) decreases a specified number from
1540 * the amount of an object. If the amount reaches 0, the object 1614 * the amount of an object. If the amount reaches 0, the object
1680 if (op->glow_radius && is_on_map ()) 1754 if (op->glow_radius && is_on_map ())
1681 { 1755 {
1682 update_stats (); 1756 update_stats ();
1683 update_all_los (map, x, y); 1757 update_all_los (map, x, y);
1684 } 1758 }
1685 else if (is_player () && !flag [FLAG_NO_FIX_PLAYER]) 1759 else if (is_player ())
1686 // if this is a player's inventory, update stats 1760 // if this is a player's inventory, update stats
1687 update_stats (); 1761 contr->queue_stats_update ();
1688 1762
1689 INVOKE_OBJECT (INSERT, this); 1763 INVOKE_OBJECT (INSERT, this);
1690 1764
1691 return op; 1765 return op;
1692} 1766}
2179 * This basically means that if direction is 15, then it could either go 2253 * This basically means that if direction is 15, then it could either go
2180 * direction 4, 14, or 16 to get back to where we are. 2254 * direction 4, 14, or 16 to get back to where we are.
2181 * Moved from spell_util.c to object.c with the other related direction 2255 * Moved from spell_util.c to object.c with the other related direction
2182 * functions. 2256 * functions.
2183 */ 2257 */
2184const int reduction_dir[SIZEOFFREE][3] = { 2258static const int reduction_dir[SIZEOFFREE][3] = {
2185 {0, 0, 0}, /* 0 */ 2259 {0, 0, 0}, /* 0 */
2186 {0, 0, 0}, /* 1 */ 2260 {0, 0, 0}, /* 1 */
2187 {0, 0, 0}, /* 2 */ 2261 {0, 0, 0}, /* 2 */
2188 {0, 0, 0}, /* 3 */ 2262 {0, 0, 0}, /* 3 */
2189 {0, 0, 0}, /* 4 */ 2263 {0, 0, 0}, /* 4 */
2460{ 2534{
2461 return map ? map->region (x, y) 2535 return map ? map->region (x, y)
2462 : region::default_region (); 2536 : region::default_region ();
2463} 2537}
2464 2538
2465const materialtype_t *
2466object::dominant_material () const
2467{
2468 if (materialtype_t *mt = name_to_material (materialname))
2469 return mt;
2470
2471 return name_to_material (shstr_unknown);
2472}
2473
2474void 2539void
2475object::open_container (object *new_container) 2540object::open_container (object *new_container)
2476{ 2541{
2477 if (container == new_container) 2542 if (container == new_container)
2478 return; 2543 return;
2512 // TODO: this does not seem to serve any purpose anymore? 2577 // TODO: this does not seem to serve any purpose anymore?
2513#if 0 2578#if 0
2514 // insert the "Close Container" object. 2579 // insert the "Close Container" object.
2515 if (archetype *closer = new_container->other_arch) 2580 if (archetype *closer = new_container->other_arch)
2516 { 2581 {
2517 object *closer = arch_to_object (new_container->other_arch); 2582 object *closer = new_container->other_arch->instance ();
2518 closer->flag [FLAG_NO_MAP_SAVE] = 1; 2583 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2519 new_container->insert (closer); 2584 new_container->insert (closer);
2520 } 2585 }
2521#endif 2586#endif
2522 2587
2548 return splay (tmp); 2613 return splay (tmp);
2549 2614
2550 return 0; 2615 return 0;
2551} 2616}
2552 2617
2618//-GPL
2619
2553void 2620void
2554object::force_set_timer (int duration) 2621object::force_set_timer (int duration)
2555{ 2622{
2556 this->duration = 1; 2623 this->duration = 1;
2557 this->speed_left = -1.f; 2624 this->speed_left = -1.f;
2566 force->destroy (); 2633 force->destroy ();
2567 2634
2568 object *force = get_archetype (FORCE_NAME); 2635 object *force = get_archetype (FORCE_NAME);
2569 2636
2570 force->slaying = name; 2637 force->slaying = name;
2571
2572 force->force_set_timer (duration); 2638 force->force_set_timer (duration);
2573
2574 force->flag [FLAG_APPLIED] = true; 2639 force->flag [FLAG_APPLIED] = true;
2575 2640
2576 return insert (force); 2641 return insert (force);
2577} 2642}
2578 2643
2579void 2644void
2628 2693
2629 insert (force); 2694 insert (force);
2630 } 2695 }
2631} 2696}
2632 2697
2698void object::change_move_type (MoveType mt)
2699{
2700 if (move_type == mt)
2701 return;
2702
2703 if (is_on_map ())
2704 {
2705 // we are on the map, so handle move_on/off effects
2706 remove ();
2707 move_type = mt;
2708 map->insert (this, x, y, this);
2709 }
2710 else
2711 move_type = mt;
2712}
2713

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines