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.289 by root, Sun Oct 11 05:31:54 2009 UTC vs.
Revision 1.311 by root, Sat Jan 16 13:41:37 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,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Deliantra is free software: you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * 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 Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * The authors can be reached via e-mail to <support@deliantra.net> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 23 */
23 24
24#include <global.h> 25#include <global.h>
25#include <stdio.h> 26#include <stdio.h>
26#include <sys/types.h> 27#include <sys/types.h>
27#include <sys/uio.h> 28#include <sys/uio.h>
28#include <object.h> 29#include <object.h>
29#include <sproto.h> 30#include <sproto.h>
30#include <loader.h>
31 31
32#include <bitset> 32#include <bitset>
33 33
34UUID UUID::cur; 34UUID UUID::cur;
35static uint64_t seq_next_save; 35static uint64_t seq_next_save;
36static const uint64 UUID_GAP = 1<<19; 36static const uint64 UUID_GAP = 1<<19;
37uint32_t mapspace::smellcount = 10000; 37uint32_t mapspace::smellcount = 10000;
38 38
39objectvec objects; 39objectvec objects;
40activevec actives; 40activevec actives;
41
42//+GPL
41 43
42short freearr_x[SIZEOFFREE] = { 44short freearr_x[SIZEOFFREE] = {
43 0, 45 0,
44 0, 1, 1, 1, 0, -1, -1, -1, 46 0, 1, 1, 1, 0, -1, -1, -1,
45 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,
49 0, 51 0,
50 -1, -1, 0, 1, 1, 1, 0, -1, 52 -1, -1, 0, 1, 1, 1, 0, -1,
51 -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,
52 -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
53}; 55};
54int maxfree[SIZEOFFREE] = {
55 0,
56 9, 10, 13, 14, 17, 18, 21, 22,
57 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
58 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
59};
60int freedir[SIZEOFFREE] = { 56int freedir[SIZEOFFREE] = {
61 0, 57 0,
62 1, 2, 3, 4, 5, 6, 7, 8, 58 1, 2, 3, 4, 5, 6, 7, 8,
63 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,
64 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
65}; 61};
66 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
67static void 70static void
68write_uuid (uval64 skip, bool sync) 71write_uuid (uval64 skip, bool sync)
69{ 72{
70 CALL_BEGIN (2); 73 CALL_BEGIN (2);
71 CALL_ARG_SV (newSVval64 (skip)); 74 CALL_ARG_SV (newSVval64 (skip));
73 CALL_CALL ("cf::write_uuid", G_DISCARD); 76 CALL_CALL ("cf::write_uuid", G_DISCARD);
74 CALL_END; 77 CALL_END;
75} 78}
76 79
77static void 80static void
78read_uuid (void) 81read_uuid ()
79{ 82{
80 char filename[MAX_BUF]; 83 char filename[MAX_BUF];
81 84
82 sprintf (filename, "%s/uuid", settings.localdir); 85 sprintf (filename, "%s/uuid", settings.localdir);
83 86
97 100
98 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); 101 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
99 _exit (1); 102 _exit (1);
100 } 103 }
101 104
102 UUID::BUF buf; 105 char buf [UUID::MAX_LEN];
103 buf[0] = 0; 106 buf[0] = 0;
104 fgets (buf, sizeof (buf), fp); 107 fgets (buf, sizeof (buf), fp);
105 108
106 if (!UUID::cur.parse (buf)) 109 if (!UUID::cur.parse (buf))
107 { 110 {
134 137
135void 138void
136UUID::init () 139UUID::init ()
137{ 140{
138 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;
139} 207}
140 208
141/* 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. */
142static bool 210static bool
143compare_ob_value_lists_one (const object *wants, const object *has) 211compare_ob_value_lists_one (const object *wants, const object *has)
179 * Improvements made with merge: Better checking on potion, and also 247 * Improvements made with merge: Better checking on potion, and also
180 * check weight 248 * check weight
181 */ 249 */
182bool object::can_merge_slow (object *ob1, object *ob2) 250bool object::can_merge_slow (object *ob1, object *ob2)
183{ 251{
184 /* A couple quicksanity checks */ 252 /* A couple quick sanity checks */
185 if (ob1 == ob2 253 if (ob1 == ob2
186 || ob1->type != ob2->type 254 || ob1->type != ob2->type
187 || ob1->speed != ob2->speed
188 || ob1->value != ob2->value 255 || ob1->value != ob2->value
189 || ob1->name != ob2->name) 256 || ob1->name != ob2->name
257 || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
190 return 0; 258 return 0;
191 259
192 /* Do not merge objects if nrof would overflow, assume nrof 260 /* Do not merge objects if nrof would overflow, assume nrof
193 * is always 0 .. 2**31-1 */ 261 * is always 0 .. 2**31-1 */
194 if (ob1->nrof > 0x7fffffff - ob2->nrof) 262 if (ob1->nrof > 0x7fffffff - ob2->nrof)
215 || ob1->magic != ob2->magic 283 || ob1->magic != ob2->magic
216 || ob1->slaying != ob2->slaying 284 || ob1->slaying != ob2->slaying
217 || ob1->skill != ob2->skill 285 || ob1->skill != ob2->skill
218 || ob1->value != ob2->value 286 || ob1->value != ob2->value
219 || ob1->animation_id != ob2->animation_id 287 || ob1->animation_id != ob2->animation_id
220 || (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
221 || ob1->client_type != ob2->client_type 289 || ob1->client_type != ob2->client_type
222 || ob1->materialname != ob2->materialname 290 || ob1->material != ob2->material
223 || ob1->lore != ob2->lore 291 || ob1->lore != ob2->lore
224 || ob1->subtype != ob2->subtype 292 || ob1->subtype != ob2->subtype
225 || ob1->move_type != ob2->move_type 293 || ob1->move_type != ob2->move_type
226 || ob1->move_block != ob2->move_block 294 || ob1->move_block != ob2->move_block
227 || ob1->move_allow != ob2->move_allow 295 || ob1->move_allow != ob2->move_allow
228 || ob1->move_on != ob2->move_on 296 || ob1->move_on != ob2->move_on
229 || ob1->move_off != ob2->move_off 297 || ob1->move_off != ob2->move_off
230 || ob1->move_slow != ob2->move_slow 298 || ob1->move_slow != ob2->move_slow
231 || ob1->move_slow_penalty != ob2->move_slow_penalty 299 || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
232 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) 300 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
233 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) 301 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
234 return 0; 302 return 0;
235 303
236 if ((ob1->flag ^ ob2->flag) 304 if ((ob1->flag ^ ob2->flag)
334 402
335 // 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
336 // even if our inv is in a player. 404 // even if our inv is in a player.
337 if (envest->is_on_map ()) 405 if (envest->is_on_map ())
338 if (object *pl = envest->ms ().player ()) 406 if (object *pl = envest->ms ().player ())
339 if (pl->container == env) 407 if (pl->container_ () == env)
340 return pl; 408 return pl;
341 } 409 }
342 else 410 else
343 { 411 {
344 // maybe there is a player standing on the same mapspace 412 // maybe there is a player standing on the same mapspace
345 // this will catch the case where "this" is a player 413 // this will catch the case where "this" is a player
346 if (object *pl = ms ().player ()) 414 if (object *pl = ms ().player ())
347 if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look) 415 if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
348 || this == pl->container) 416 || pl->container_ () == this)
349 return pl; 417 return pl;
350 } 418 }
351 } 419 }
352 420
353 return 0; 421 return 0;
435 503
436char * 504char *
437object::as_string () 505object::as_string ()
438{ 506{
439 return dump_object (this); 507 return dump_object (this);
440}
441
442/*
443 * get_nearest_part(multi-object, object 2) returns the part of the
444 * multi-object 1 which is closest to the second object.
445 * If it's not a multi-object, it is returned.
446 */
447object *
448get_nearest_part (object *op, const object *pl)
449{
450 object *tmp, *closest;
451 int last_dist, i;
452
453 if (!op->more)
454 return op;
455
456 for (last_dist = distance (op, pl), closest = op, tmp = op->more;
457 tmp;
458 tmp = tmp->more)
459 if ((i = distance (tmp, pl)) < last_dist)
460 closest = tmp, last_dist = i;
461
462 return closest;
463} 508}
464 509
465/* 510/*
466 * 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.
467 * VERRRY slow. 512 * VERRRY slow.
641 tail = new_link; 686 tail = new_link;
642 } 687 }
643 } 688 }
644 } 689 }
645 690
646 if (speed < 0)
647 dst->speed_left -= rndm ();
648
649 dst->activate (); 691 dst->activate ();
650} 692}
651 693
652void 694void
653object::instantiate () 695object::instantiate ()
654{ 696{
655 if (!uuid.seq) // HACK 697 if (!uuid.seq) // HACK
656 uuid = UUID::gen (); 698 uuid = UUID::gen ();
657 699
700 // TODO: unclean state changes, should nt be done in copy_to AND instantiate
701 if (flag [FLAG_RANDOM_SPEED] && speed)
702 speed_left = - speed - rndm (); // TODO animation
703 else
658 speed_left = -0.1f; 704 speed_left = -1.;
705
659 /* copy the body_info to the body_used - this is only really 706 /* copy the body_info to the body_used - this is only really
660 * need for monsters, but doesn't hurt to do it for everything. 707 * need for monsters, but doesn't hurt to do it for everything.
661 * by doing so, when a monster is created, it has good starting 708 * by doing so, when a monster is created, it has good starting
662 * values for the body_used info, so when items are created 709 * values for the body_used info, so when items are created
663 * for it, they can be properly equipped. 710 * for it, they can be properly equipped.
671object * 718object *
672object::clone () 719object::clone ()
673{ 720{
674 object *neu = create (); 721 object *neu = create ();
675 copy_to (neu); 722 copy_to (neu);
723
724 // TODO: unclean state changes, should not be done in clone AND instantiate
725 if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed)
726 neu->speed_left = - neu->speed - rndm (); // TODO animation
727
676 neu->map = map; // not copied by copy_to 728 neu->map = map; // not copied by copy_to
677 return neu; 729 return neu;
678} 730}
679 731
680/* 732/*
698 * This function needs to be called whenever the speed of an object changes. 750 * This function needs to be called whenever the speed of an object changes.
699 */ 751 */
700void 752void
701object::set_speed (float speed) 753object::set_speed (float speed)
702{ 754{
703 if (flag [FLAG_FREED] && speed)
704 {
705 LOG (llevError, "Object %s is freed but has speed.\n", &name);
706 speed = 0;
707 }
708
709 this->speed = speed; 755 this->speed = speed;
710 756
711 if (has_active_speed ()) 757 if (has_active_speed ())
712 activate (); 758 activate ();
713 else 759 else
763 809
764 if (!(m.flags_ & P_UPTODATE)) 810 if (!(m.flags_ & P_UPTODATE))
765 /* nop */; 811 /* nop */;
766 else if (action == UP_OBJ_INSERT) 812 else if (action == UP_OBJ_INSERT)
767 { 813 {
814#if 0
768 // this is likely overkill, TODO: revisit (schmorp) 815 // this is likely overkill, TODO: revisit (schmorp)
769 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) 816 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
770 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) 817 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
771 || (op->is_player () && !(m.flags_ & P_PLAYER)) 818 || (op->is_player () && !(m.flags_ & P_PLAYER))
772 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) 819 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
777 || (m.move_slow | op->move_slow) != m.move_slow 824 || (m.move_slow | op->move_slow) != m.move_slow
778 /* This isn't perfect, but I don't expect a lot of objects to 825 /* This isn't perfect, but I don't expect a lot of objects to
779 * have move_allow right now. 826 * have move_allow right now.
780 */ 827 */
781 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block 828 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
782 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
783 m.invalidate (); 829 m.invalidate ();
830#else
831 // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
832 m.invalidate ();
833#endif
784 } 834 }
785 /* if the object is being removed, we can't make intelligent 835 /* if the object is being removed, we can't make intelligent
786 * decisions, because remove_ob can't really pass the object 836 * decisions, because remove_ob can't really pass the object
787 * that is being removed. 837 * that is being removed.
788 */ 838 */
800object::object () 850object::object ()
801{ 851{
802 SET_FLAG (this, FLAG_REMOVED); 852 SET_FLAG (this, FLAG_REMOVED);
803 853
804 //expmul = 1.0; declared const for the time being 854 //expmul = 1.0; declared const for the time being
805 face = blank_face; 855 face = blank_face;
856 material = MATERIAL_NULL;
806} 857}
807 858
808object::~object () 859object::~object ()
809{ 860{
810 unlink (); 861 unlink ();
1040 * the previous environment. 1091 * the previous environment.
1041 */ 1092 */
1042void 1093void
1043object::do_remove () 1094object::do_remove ()
1044{ 1095{
1045 object *tmp, *last = 0;
1046 object *otmp;
1047
1048 if (flag [FLAG_REMOVED]) 1096 if (flag [FLAG_REMOVED])
1049 return; 1097 return;
1050 1098
1051 INVOKE_OBJECT (REMOVE, this); 1099 INVOKE_OBJECT (REMOVE, this);
1052 1100
1084 1132
1085 above = 0; 1133 above = 0;
1086 below = 0; 1134 below = 0;
1087 env = 0; 1135 env = 0;
1088 1136
1089 /* NO_FIX_PLAYER is set when a great many changes are being 1137 if (pl && pl->is_player ())
1090 * made to players inventory. If set, avoiding the call
1091 * to save cpu time.
1092 */
1093 if (pl)
1094 if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
1095 { 1138 {
1096 pl->update_stats (); 1139 pl->contr->queue_stats_update ();
1097 1140
1098 if (glow_radius && pl->is_on_map ()) 1141 if (glow_radius && pl->is_on_map ())
1099 update_all_los (pl->map, pl->x, pl->y); 1142 update_all_los (pl->map, pl->x, pl->y);
1100 } 1143 }
1101 } 1144 }
1102 else if (map) 1145 else if (map)
1103 { 1146 {
1104 map->dirty = true; 1147 map->dirty = true;
1105 mapspace &ms = this->ms (); 1148 mapspace &ms = this->ms ();
1118 close_container (); 1161 close_container ();
1119 1162
1120 --map->players; 1163 --map->players;
1121 map->touch (); 1164 map->touch ();
1122 } 1165 }
1123 else if (pl->container == this) 1166 else if (pl->container_ () == this)
1124 { 1167 {
1125 // removing a container should close it 1168 // removing a container should close it
1126 close_container (); 1169 close_container ();
1127 } 1170 }
1128 1171
1144 1187
1145 int check_walk_off = !flag [FLAG_NO_APPLY]; 1188 int check_walk_off = !flag [FLAG_NO_APPLY];
1146 1189
1147 if (object *pl = ms.player ()) 1190 if (object *pl = ms.player ())
1148 { 1191 {
1149 if (pl->container == this) 1192 if (pl->container_ () == this)
1150 /* If a container that the player is currently using somehow gets 1193 /* If a container that the player is currently using somehow gets
1151 * removed (most likely destroyed), update the player view 1194 * removed (most likely destroyed), update the player view
1152 * appropriately. 1195 * appropriately.
1153 */ 1196 */
1154 pl->close_container (); 1197 pl->close_container ();
1158 //TODO: update floorbox to preserve ordering 1201 //TODO: update floorbox to preserve ordering
1159 if (pl->contr->ns) 1202 if (pl->contr->ns)
1160 pl->contr->ns->floorbox_update (); 1203 pl->contr->ns->floorbox_update ();
1161 } 1204 }
1162 1205
1206 if (check_walk_off)
1163 for (tmp = ms.bot; tmp; tmp = tmp->above) 1207 for (object *above, *tmp = ms.bot; tmp; tmp = above)
1164 { 1208 {
1209 above = tmp->above;
1210
1165 /* No point updating the players look faces if he is the object 1211 /* No point updating the players look faces if he is the object
1166 * being removed. 1212 * being removed.
1167 */ 1213 */
1168 1214
1169 /* See if object moving off should effect something */ 1215 /* See if object moving off should effect something */
1170 if (check_walk_off
1171 && ((move_type & tmp->move_off) 1216 if ((move_type & tmp->move_off)
1172 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1217 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1173 {
1174 move_apply (tmp, this, 0); 1218 move_apply (tmp, this, 0);
1175
1176 if (destroyed ())
1177 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1178 } 1219 }
1179
1180 last = tmp;
1181 }
1182 1220
1183 if (affects_los ()) 1221 if (affects_los ())
1184 update_all_los (map, x, y); 1222 update_all_los (map, x, y);
1185 } 1223 }
1186} 1224}
1230 1268
1231 object *prev = this; 1269 object *prev = this;
1232 1270
1233 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) 1271 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1234 { 1272 {
1235 object *op = arch_to_object (at); 1273 object *op = at->instance ();
1236 1274
1237 op->name = name; 1275 op->name = name;
1238 op->name_pl = name_pl; 1276 op->name_pl = name_pl;
1239 op->title = title; 1277 op->title = title;
1240 1278
1515 1553
1516 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) 1554 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1517 if (tmp->arch->archname == archname) /* same archetype */ 1555 if (tmp->arch->archname == archname) /* same archetype */
1518 tmp->destroy (); 1556 tmp->destroy ();
1519 1557
1520 object *tmp = arch_to_object (archetype::find (archname)); 1558 object *tmp = archetype::find (archname)->instance ();
1521 1559
1522 tmp->x = op->x; 1560 tmp->x = op->x;
1523 tmp->y = op->y; 1561 tmp->y = op->y;
1524 1562
1525 insert_ob_in_map (tmp, op->map, op, 0); 1563 insert_ob_in_map (tmp, op->map, op, 0);
1530{ 1568{
1531 if (where->env) 1569 if (where->env)
1532 return where->env->insert (this); 1570 return where->env->insert (this);
1533 else 1571 else
1534 return where->map->insert (this, where->x, where->y, originator, flags); 1572 return where->map->insert (this, where->x, where->y, originator, flags);
1573}
1574
1575// check whether we can put this into the map, respect max_volume, max_items
1576bool
1577object::can_drop_at (maptile *m, int x, int y, object *originator)
1578{
1579 mapspace &ms = m->at (x, y);
1580
1581 int items = ms.items ();
1582
1583 if (!items // testing !items ensures we can drop at least one item
1584 || (items < m->max_items
1585 && ms.volume () < m->max_volume))
1586 return true;
1587
1588 if (originator && originator->is_player ())
1589 originator->contr->failmsg (format (
1590 "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
1591 query_name ()
1592 ));
1593
1594 return false;
1535} 1595}
1536 1596
1537/* 1597/*
1538 * decrease(object, number) decreases a specified number from 1598 * decrease(object, number) decreases a specified number from
1539 * the amount of an object. If the amount reaches 0, the object 1599 * the amount of an object. If the amount reaches 0, the object
1679 if (op->glow_radius && is_on_map ()) 1739 if (op->glow_radius && is_on_map ())
1680 { 1740 {
1681 update_stats (); 1741 update_stats ();
1682 update_all_los (map, x, y); 1742 update_all_los (map, x, y);
1683 } 1743 }
1684 else if (is_player () && !flag [FLAG_NO_FIX_PLAYER]) 1744 else if (is_player ())
1685 // if this is a player's inventory, update stats 1745 // if this is a player's inventory, update stats
1686 update_stats (); 1746 contr->queue_stats_update ();
1687 1747
1688 INVOKE_OBJECT (INSERT, this); 1748 INVOKE_OBJECT (INSERT, this);
1689 1749
1690 return op; 1750 return op;
1691} 1751}
2178 * This basically means that if direction is 15, then it could either go 2238 * This basically means that if direction is 15, then it could either go
2179 * direction 4, 14, or 16 to get back to where we are. 2239 * direction 4, 14, or 16 to get back to where we are.
2180 * Moved from spell_util.c to object.c with the other related direction 2240 * Moved from spell_util.c to object.c with the other related direction
2181 * functions. 2241 * functions.
2182 */ 2242 */
2183const int reduction_dir[SIZEOFFREE][3] = { 2243static const int reduction_dir[SIZEOFFREE][3] = {
2184 {0, 0, 0}, /* 0 */ 2244 {0, 0, 0}, /* 0 */
2185 {0, 0, 0}, /* 1 */ 2245 {0, 0, 0}, /* 1 */
2186 {0, 0, 0}, /* 2 */ 2246 {0, 0, 0}, /* 2 */
2187 {0, 0, 0}, /* 3 */ 2247 {0, 0, 0}, /* 3 */
2188 {0, 0, 0}, /* 4 */ 2248 {0, 0, 0}, /* 4 */
2459{ 2519{
2460 return map ? map->region (x, y) 2520 return map ? map->region (x, y)
2461 : region::default_region (); 2521 : region::default_region ();
2462} 2522}
2463 2523
2464const materialtype_t *
2465object::dominant_material () const
2466{
2467 if (materialtype_t *mt = name_to_material (materialname))
2468 return mt;
2469
2470 return name_to_material (shstr_unknown);
2471}
2472
2473void 2524void
2474object::open_container (object *new_container) 2525object::open_container (object *new_container)
2475{ 2526{
2476 if (container == new_container) 2527 if (container == new_container)
2477 return; 2528 return;
2511 // TODO: this does not seem to serve any purpose anymore? 2562 // TODO: this does not seem to serve any purpose anymore?
2512#if 0 2563#if 0
2513 // insert the "Close Container" object. 2564 // insert the "Close Container" object.
2514 if (archetype *closer = new_container->other_arch) 2565 if (archetype *closer = new_container->other_arch)
2515 { 2566 {
2516 object *closer = arch_to_object (new_container->other_arch); 2567 object *closer = new_container->other_arch->instance ();
2517 closer->flag [FLAG_NO_MAP_SAVE] = 1; 2568 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2518 new_container->insert (closer); 2569 new_container->insert (closer);
2519 } 2570 }
2520#endif 2571#endif
2521 2572
2547 return splay (tmp); 2598 return splay (tmp);
2548 2599
2549 return 0; 2600 return 0;
2550} 2601}
2551 2602
2603//-GPL
2604
2605void
2606object::force_set_timer (int duration)
2607{
2608 this->duration = 1;
2609 this->speed_left = -1.f;
2610
2611 this->set_speed (duration ? 1.f / duration : 0.f);
2612}
2613
2552object * 2614object *
2553object::force_add (shstr_tmp name, int duration) 2615object::force_add (shstr_tmp name, int duration)
2554{ 2616{
2555 if (object *force = force_find (name)) 2617 if (object *force = force_find (name))
2556 force->destroy (); 2618 force->destroy ();
2557 2619
2558 object *force = get_archetype (FORCE_NAME); 2620 object *force = get_archetype (FORCE_NAME);
2559 2621
2560 force->slaying = name; 2622 force->slaying = name;
2561 force->stats.food = 1; 2623 force->force_set_timer (duration);
2562 force->speed_left = -1.f;
2563
2564 force->set_speed (duration ? 1.f / duration : 0.f);
2565 force->flag [FLAG_IS_USED_UP] = true;
2566 force->flag [FLAG_APPLIED] = true; 2624 force->flag [FLAG_APPLIED] = true;
2567 2625
2568 return insert (force); 2626 return insert (force);
2569} 2627}
2570 2628
2571void 2629void

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines