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.267 by root, Tue Dec 23 01:51:27 2008 UTC vs.
Revision 1.302 by root, Tue Nov 10 00:01:31 2009 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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009 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>
… …
32#include <bitset> 33#include <bitset>
33 34
34UUID UUID::cur; 35UUID UUID::cur;
35static uint64_t seq_next_save; 36static uint64_t seq_next_save;
36static const uint64 UUID_GAP = 1<<19; 37static const uint64 UUID_GAP = 1<<19;
38uint32_t mapspace::smellcount = 10000;
37 39
38objectvec objects; 40objectvec objects;
39activevec actives; 41activevec actives;
42
43//+GPL
40 44
41short freearr_x[SIZEOFFREE] = { 45short freearr_x[SIZEOFFREE] = {
42 0, 46 0,
43 0, 1, 1, 1, 0, -1, -1, -1, 47 0, 1, 1, 1, 0, -1, -1, -1,
44 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, 48 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
… …
48 0, 52 0,
49 -1, -1, 0, 1, 1, 1, 0, -1, 53 -1, -1, 0, 1, 1, 1, 0, -1,
50 -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, 54 -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
51 -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 55 -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
52}; 56};
53int maxfree[SIZEOFFREE] = {
54 0,
55 9, 10, 13, 14, 17, 18, 21, 22,
56 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
57 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
58};
59int freedir[SIZEOFFREE] = { 57int freedir[SIZEOFFREE] = {
60 0, 58 0,
61 1, 2, 3, 4, 5, 6, 7, 8, 59 1, 2, 3, 4, 5, 6, 7, 8,
62 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, 60 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
63 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 61 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
62};
63
64static int maxfree[SIZEOFFREE] = {
65 0,
66 9, 10, 13, 14, 17, 18, 21, 22,
67 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
68 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
64}; 69};
65 70
66static void 71static void
67write_uuid (uval64 skip, bool sync) 72write_uuid (uval64 skip, bool sync)
68{ 73{
… …
96 101
97 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); 102 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
98 _exit (1); 103 _exit (1);
99 } 104 }
100 105
101 UUID::BUF buf; 106 char buf [UUID::MAX_LEN];
102 buf[0] = 0; 107 buf[0] = 0;
103 fgets (buf, sizeof (buf), fp); 108 fgets (buf, sizeof (buf), fp);
104 109
105 if (!UUID::cur.parse (buf)) 110 if (!UUID::cur.parse (buf))
106 { 111 {
… …
133 138
134void 139void
135UUID::init () 140UUID::init ()
136{ 141{
137 read_uuid (); 142 read_uuid ();
143}
144
145bool
146UUID::parse (const char *s)
147{
148 if (*s++ != '<' || *s++ != '1' || *s++ != '.')
149 return false;
150
151 seq = 0;
152
153 while (*s != '>')
154 {
155 if (*s < '0')
156 return false;
157
158 // this gives nice branchless code with gcc
159 assert ('0' < 'a' && '0' == 48 && 'a' == 97);
160 int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15;
161
162 seq = (seq << 4) | digit;
163
164 ++s;
165 }
166
167 return true;
168}
169
170char *
171UUID::append (char *buf) const
172{
173 *buf++ = '<';
174 *buf++ = '1';
175 *buf++ = '.';
176
177 uint64_t seq = this->seq;
178 const int bits = 64;
179 char nz = 0;
180 static const char tohex [] = "0123456789abcdef";
181
182 // assert (len >= 3 + bits / 4 + 1 + 1);
183 for (int i = bits / 4; --i; )
184 {
185 uint8_t digit = seq >> (bits - 4);
186
187 *buf = tohex [digit];
188 nz |= digit;
189 buf += nz ? 1 : 0;
190 seq <<= 4;
191 }
192
193 // last digit is special - always emit
194 uint8_t digit = seq >> (bits - 4);
195 *buf++ = tohex [digit];
196
197 *buf++ = '>';
198
199 return buf;
200}
201
202char *
203UUID::c_str () const
204{
205 static char buf [MAX_LEN];
206 *append (buf) = 0;
207 return buf;
138} 208}
139 209
140/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ 210/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
141static bool 211static bool
142compare_ob_value_lists_one (const object *wants, const object *has) 212compare_ob_value_lists_one (const object *wants, const object *has)
… …
181bool object::can_merge_slow (object *ob1, object *ob2) 251bool object::can_merge_slow (object *ob1, object *ob2)
182{ 252{
183 /* A couple quicksanity checks */ 253 /* A couple quicksanity checks */
184 if (ob1 == ob2 254 if (ob1 == ob2
185 || ob1->type != ob2->type 255 || ob1->type != ob2->type
186 || ob1->speed != ob2->speed 256 || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED
187 || ob1->value != ob2->value 257 || ob1->value != ob2->value
188 || ob1->name != ob2->name) 258 || ob1->name != ob2->name)
189 return 0; 259 return 0;
190 260
191 /* Do not merge objects if nrof would overflow, assume nrof 261 /* Do not merge objects if nrof would overflow, assume nrof
… …
225 || ob1->move_block != ob2->move_block 295 || ob1->move_block != ob2->move_block
226 || ob1->move_allow != ob2->move_allow 296 || ob1->move_allow != ob2->move_allow
227 || ob1->move_on != ob2->move_on 297 || ob1->move_on != ob2->move_on
228 || ob1->move_off != ob2->move_off 298 || ob1->move_off != ob2->move_off
229 || ob1->move_slow != ob2->move_slow 299 || ob1->move_slow != ob2->move_slow
230 || ob1->move_slow_penalty != ob2->move_slow_penalty 300 || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
231 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) 301 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
232 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) 302 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
233 return 0; 303 return 0;
234 304
235 if ((ob1->flag ^ ob2->flag) 305 if ((ob1->flag ^ ob2->flag)
… …
323 { 393 {
324 // see if we are in a container of sorts 394 // see if we are in a container of sorts
325 if (env) 395 if (env)
326 { 396 {
327 // the player inventory itself is always visible 397 // the player inventory itself is always visible
328 if (env->type == PLAYER) 398 if (env->is_player ())
329 return env; 399 return env;
330 400
331 // else a player could have our env open 401 // else a player could have our env open
332 object *envest = env->outer_env (); 402 object *envest = env->outer_env_or_self ();
333 403
334 // the player itself is always on a map, so we will find him here 404 // the player itself is always on a map, so we will find him here
335 // even if our inv is in a player. 405 // even if our inv is in a player.
336 if (envest->is_on_map ()) 406 if (envest->is_on_map ())
337 if (object *pl = envest->ms ().player ()) 407 if (object *pl = envest->ms ().player ())
338 if (pl->container == env) 408 if (pl->container_ () == env)
339 return pl; 409 return pl;
340 } 410 }
341 else 411 else
342 { 412 {
343 // maybe there is a player standing on the same mapspace 413 // maybe there is a player standing on the same mapspace
344 // this will catch the case where "this" is a player 414 // this will catch the case where "this" is a player
345 if (object *pl = ms ().player ()) 415 if (object *pl = ms ().player ())
346 if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look) 416 if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
347 || this == pl->container) 417 || pl->container_ () == this)
348 return pl; 418 return pl;
349 } 419 }
350 } 420 }
351 421
352 return 0; 422 return 0;
… …
430 object_freezer freezer; 500 object_freezer freezer;
431 op->write (freezer); 501 op->write (freezer);
432 return freezer.as_string (); 502 return freezer.as_string ();
433} 503}
434 504
435/* 505char *
436 * get_nearest_part(multi-object, object 2) returns the part of the 506object::as_string ()
437 * multi-object 1 which is closest to the second object.
438 * If it's not a multi-object, it is returned.
439 */
440object *
441get_nearest_part (object *op, const object *pl)
442{ 507{
443 object *tmp, *closest; 508 return dump_object (this);
444 int last_dist, i;
445
446 if (!op->more)
447 return op;
448
449 for (last_dist = distance (op, pl), closest = op, tmp = op->more;
450 tmp;
451 tmp = tmp->more)
452 if ((i = distance (tmp, pl)) < last_dist)
453 closest = tmp, last_dist = i;
454
455 return closest;
456} 509}
457 510
458/* 511/*
459 * Returns the object which has the count-variable equal to the argument. 512 * Returns the object which has the count-variable equal to the argument.
460 * VERRRY slow. 513 * VERRRY slow.
… …
554 update_stats (); 607 update_stats ();
555 608
556 new_draw_info_format (NDI_UNIQUE, 0, this, 609 new_draw_info_format (NDI_UNIQUE, 0, this,
557 "You try to balance all your items at once, " 610 "You try to balance all your items at once, "
558 "but the %s is just too much for your body. " 611 "but the %s is just too much for your body. "
559 "[You need to unapply some items first.]", &ob->name); 612 "[You need to unapply some items first - use the 'body' command to see "
613 "how many items you cna wera on a specific body part.]", &ob->name);
560 return false; 614 return false;
561 } 615 }
562 616
563 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); 617 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
564 } 618 }
… …
690 * This function needs to be called whenever the speed of an object changes. 744 * This function needs to be called whenever the speed of an object changes.
691 */ 745 */
692void 746void
693object::set_speed (float speed) 747object::set_speed (float speed)
694{ 748{
695 if (flag [FLAG_FREED] && speed)
696 {
697 LOG (llevError, "Object %s is freed but has speed.\n", &name);
698 speed = 0;
699 }
700
701 this->speed = speed; 749 this->speed = speed;
702 750
703 if (has_active_speed ()) 751 if (has_active_speed ())
704 activate (); 752 activate ();
705 else 753 else
… …
755 803
756 if (!(m.flags_ & P_UPTODATE)) 804 if (!(m.flags_ & P_UPTODATE))
757 /* nop */; 805 /* nop */;
758 else if (action == UP_OBJ_INSERT) 806 else if (action == UP_OBJ_INSERT)
759 { 807 {
808#if 0
760 // this is likely overkill, TODO: revisit (schmorp) 809 // this is likely overkill, TODO: revisit (schmorp)
761 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) 810 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
762 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) 811 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
763 || (op->type == PLAYER && !(m.flags_ & P_PLAYER)) 812 || (op->is_player () && !(m.flags_ & P_PLAYER))
764 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) 813 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
765 || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) 814 || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
766 || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) 815 || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
767 || (m.move_on | op->move_on ) != m.move_on 816 || (m.move_on | op->move_on ) != m.move_on
768 || (m.move_off | op->move_off ) != m.move_off 817 || (m.move_off | op->move_off ) != m.move_off
769 || (m.move_slow | op->move_slow) != m.move_slow 818 || (m.move_slow | op->move_slow) != m.move_slow
770 /* This isn't perfect, but I don't expect a lot of objects to 819 /* This isn't perfect, but I don't expect a lot of objects to
771 * have move_allow right now. 820 * have move_allow right now.
772 */ 821 */
773 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block 822 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
774 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
775 m.invalidate (); 823 m.invalidate ();
824#else
825 // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
826 m.invalidate ();
827#endif
776 } 828 }
777 /* if the object is being removed, we can't make intelligent 829 /* if the object is being removed, we can't make intelligent
778 * decisions, because remove_ob can't really pass the object 830 * decisions, because remove_ob can't really pass the object
779 * that is being removed. 831 * that is being removed.
780 */ 832 */
… …
791 843
792object::object () 844object::object ()
793{ 845{
794 SET_FLAG (this, FLAG_REMOVED); 846 SET_FLAG (this, FLAG_REMOVED);
795 847
796 expmul = 1.0; 848 //expmul = 1.0; declared const for the time being
797 face = blank_face; 849 face = blank_face;
798} 850}
799 851
800object::~object () 852object::~object ()
801{ 853{
… …
830{ 882{
831 /* If already on active list, don't do anything */ 883 /* If already on active list, don't do anything */
832 if (active) 884 if (active)
833 return; 885 return;
834 886
835 if (has_active_speed () && flag [FLAG_FREED]) LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
836 if (has_active_speed () && flag [FLAG_DEBUG]) LOG (llevError | logBacktrace, "BUG: tried to activate DEBUG object %s\n", debug_desc ());//D temp
837
838 if (has_active_speed ()) 887 if (has_active_speed ())
888 {
889 if (flag [FLAG_FREED])
890 LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
891
839 actives.insert (this); 892 actives.insert (this);
893 }
840} 894}
841 895
842void 896void
843object::activate_recursive () 897object::activate_recursive ()
844{ 898{
… …
962 1016
963void 1017void
964object::do_destroy () 1018object::do_destroy ()
965{ 1019{
966 if (flag [FLAG_IS_LINKED]) 1020 if (flag [FLAG_IS_LINKED])
967 remove_button_link (this); 1021 remove_link ();
968 1022
969 if (flag [FLAG_FRIENDLY]) 1023 if (flag [FLAG_FRIENDLY])
970 remove_friendly_object (this); 1024 remove_friendly_object (this);
971 1025
972 remove (); 1026 remove ();
… …
1030 * the previous environment. 1084 * the previous environment.
1031 */ 1085 */
1032void 1086void
1033object::do_remove () 1087object::do_remove ()
1034{ 1088{
1035 object *tmp, *last = 0;
1036 object *otmp;
1037
1038 if (flag [FLAG_REMOVED]) 1089 if (flag [FLAG_REMOVED])
1039 return; 1090 return;
1040 1091
1041 INVOKE_OBJECT (REMOVE, this); 1092 INVOKE_OBJECT (REMOVE, this);
1042 1093
… …
1083 if (pl) 1134 if (pl)
1084 if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER))) 1135 if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
1085 { 1136 {
1086 pl->update_stats (); 1137 pl->update_stats ();
1087 1138
1088 if (glow_radius && pl->is_on_map () && pl->map->darkness) 1139 if (glow_radius && pl->is_on_map ())
1089 update_all_los (pl->map, pl->x, pl->y); 1140 update_all_los (pl->map, pl->x, pl->y);
1090 } 1141 }
1091 } 1142 }
1092 else if (map) 1143 else if (map)
1093 { 1144 {
1094 map->dirty = true; 1145 map->dirty = true;
1095 mapspace &ms = this->ms (); 1146 mapspace &ms = this->ms ();
1096 1147
1097 if (object *pl = ms.player ()) 1148 if (object *pl = ms.player ())
1098 { 1149 {
1099 if (type == PLAYER) // this == pl(!) 1150 if (is_player ())
1100 { 1151 {
1152 if (!flag [FLAG_WIZPASS])
1153 ms.smell = ++mapspace::smellcount; // remember the smell of the player
1154
1101 // leaving a spot always closes any open container on the ground 1155 // leaving a spot always closes any open container on the ground
1102 if (container && !container->env) 1156 if (container && !container->env)
1103 // this causes spurious floorbox updates, but it ensures 1157 // this causes spurious floorbox updates, but it ensures
1104 // that the CLOSE event is being sent. 1158 // that the CLOSE event is being sent.
1105 close_container (); 1159 close_container ();
1106 1160
1107 --map->players; 1161 --map->players;
1108 map->touch (); 1162 map->touch ();
1109 } 1163 }
1110 else if (pl->container == this) 1164 else if (pl->container_ () == this)
1111 { 1165 {
1112 // removing a container should close it 1166 // removing a container should close it
1113 close_container (); 1167 close_container ();
1114 } 1168 }
1115 1169
… …
1131 1185
1132 int check_walk_off = !flag [FLAG_NO_APPLY]; 1186 int check_walk_off = !flag [FLAG_NO_APPLY];
1133 1187
1134 if (object *pl = ms.player ()) 1188 if (object *pl = ms.player ())
1135 { 1189 {
1136 if (pl->container == this) 1190 if (pl->container_ () == this)
1137 /* If a container that the player is currently using somehow gets 1191 /* If a container that the player is currently using somehow gets
1138 * removed (most likely destroyed), update the player view 1192 * removed (most likely destroyed), update the player view
1139 * appropriately. 1193 * appropriately.
1140 */ 1194 */
1141 pl->close_container (); 1195 pl->close_container ();
… …
1145 //TODO: update floorbox to preserve ordering 1199 //TODO: update floorbox to preserve ordering
1146 if (pl->contr->ns) 1200 if (pl->contr->ns)
1147 pl->contr->ns->floorbox_update (); 1201 pl->contr->ns->floorbox_update ();
1148 } 1202 }
1149 1203
1204 if (check_walk_off)
1150 for (tmp = ms.bot; tmp; tmp = tmp->above) 1205 for (object *above, *tmp = ms.bot; tmp; tmp = above)
1151 { 1206 {
1207 above = tmp->above;
1208
1152 /* No point updating the players look faces if he is the object 1209 /* No point updating the players look faces if he is the object
1153 * being removed. 1210 * being removed.
1154 */ 1211 */
1155 1212
1156 /* See if object moving off should effect something */ 1213 /* See if object moving off should effect something */
1157 if (check_walk_off
1158 && ((move_type & tmp->move_off) 1214 if ((move_type & tmp->move_off)
1159 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1215 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1160 {
1161 move_apply (tmp, this, 0); 1216 move_apply (tmp, this, 0);
1162
1163 if (destroyed ())
1164 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1165 } 1217 }
1166 1218
1167 last = tmp; 1219 if (affects_los ())
1168 }
1169
1170 if (map->darkness && affects_los ())
1171 update_all_los (map, x, y); 1220 update_all_los (map, x, y);
1172 } 1221 }
1173} 1222}
1174 1223
1175/* 1224/*
… …
1282 1331
1283 /* Ideally, the caller figures this out. However, it complicates a lot 1332 /* Ideally, the caller figures this out. However, it complicates a lot
1284 * of areas of callers (eg, anything that uses find_free_spot would now 1333 * of areas of callers (eg, anything that uses find_free_spot would now
1285 * need extra work 1334 * need extra work
1286 */ 1335 */
1336 maptile *newmap = m;
1287 if (!xy_normalise (m, op->x, op->y)) 1337 if (!xy_normalise (newmap, op->x, op->y))
1288 { 1338 {
1289 op->head_ ()->destroy ();// remove head_ once all tail object destroyers found 1339 op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1290 return 0; 1340 return 0;
1291 } 1341 }
1292 1342
1293 if (object *more = op->more) 1343 if (object *more = op->more)
1294 if (!insert_ob_in_map (more, m, originator, flag)) 1344 if (!insert_ob_in_map (more, m, originator, flag))
1295 return 0; 1345 return 0;
1296 1346
1297 CLEAR_FLAG (op, FLAG_REMOVED); 1347 op->flag [FLAG_REMOVED] = false;
1298 1348 op->env = 0;
1299 op->map = m; 1349 op->map = newmap;
1350
1300 mapspace &ms = op->ms (); 1351 mapspace &ms = op->ms ();
1301 1352
1302 /* this has to be done after we translate the coordinates. 1353 /* this has to be done after we translate the coordinates.
1303 */ 1354 */
1304 if (op->nrof && !(flag & INS_NO_MERGE)) 1355 if (op->nrof && !(flag & INS_NO_MERGE))
… …
1325 LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); 1376 LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1326 abort (); 1377 abort ();
1327 } 1378 }
1328 1379
1329 if (!originator->is_on_map ()) 1380 if (!originator->is_on_map ())
1381 {
1330 LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map", 1382 LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
1331 op->debug_desc (), originator->debug_desc ()); 1383 op->debug_desc (), originator->debug_desc ());
1384 abort ();
1385 }
1332 1386
1333 op->above = originator; 1387 op->above = originator;
1334 op->below = originator->below; 1388 op->below = originator->below;
1335 originator->below = op; 1389 originator->below = op;
1336 1390
… …
1422 op->below = top; 1476 op->below = top;
1423 *(op->above ? &op->above->below : &ms.top) = op; 1477 *(op->above ? &op->above->below : &ms.top) = op;
1424 } 1478 }
1425 } 1479 }
1426 1480
1427 if (op->type == PLAYER) 1481 if (op->is_player ())
1428 { 1482 {
1429 op->contr->do_los = 1; 1483 op->contr->do_los = 1;
1430 ++op->map->players; 1484 ++op->map->players;
1431 op->map->touch (); 1485 op->map->touch ();
1432 } 1486 }
… …
1447 * be far away from this change and not affected in any way - 1501 * be far away from this change and not affected in any way -
1448 * this should get redone to only look for players within range, 1502 * this should get redone to only look for players within range,
1449 * or just updating the P_UPTODATE for spaces within this area 1503 * or just updating the P_UPTODATE for spaces within this area
1450 * of effect may be sufficient. 1504 * of effect may be sufficient.
1451 */ 1505 */
1452 if (op->affects_los () && op->map->darkness) 1506 if (op->affects_los ())
1453 { 1507 {
1454 op->ms ().invalidate (); 1508 op->ms ().invalidate ();
1455 update_all_los (op->map, op->x, op->y); 1509 update_all_los (op->map, op->x, op->y);
1456 } 1510 }
1457 1511
… …
1468 * blocked() and wall() work properly), and these flags are updated by 1522 * blocked() and wall() work properly), and these flags are updated by
1469 * update_object(). 1523 * update_object().
1470 */ 1524 */
1471 1525
1472 /* if this is not the head or flag has been passed, don't check walk on status */ 1526 /* if this is not the head or flag has been passed, don't check walk on status */
1473 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) 1527 if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1474 { 1528 {
1475 if (check_move_on (op, originator)) 1529 if (check_move_on (op, originator))
1476 return 0; 1530 return 0;
1477 1531
1478 /* If we are a multi part object, lets work our way through the check 1532 /* If we are a multi part object, lets work our way through the check
… …
1489/* this function inserts an object in the map, but if it 1543/* this function inserts an object in the map, but if it
1490 * finds an object of its own type, it'll remove that one first. 1544 * finds an object of its own type, it'll remove that one first.
1491 * op is the object to insert it under: supplies x and the map. 1545 * op is the object to insert it under: supplies x and the map.
1492 */ 1546 */
1493void 1547void
1494replace_insert_ob_in_map (const char *arch_string, object *op) 1548replace_insert_ob_in_map (shstr_tmp archname, object *op)
1495{ 1549{
1496 /* first search for itself and remove any old instances */ 1550 /* first search for itself and remove any old instances */
1497 1551
1498 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) 1552 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1499 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ 1553 if (tmp->arch->archname == archname) /* same archetype */
1500 tmp->destroy (); 1554 tmp->destroy ();
1501 1555
1502 object *tmp = arch_to_object (archetype::find (arch_string)); 1556 object *tmp = arch_to_object (archetype::find (archname));
1503 1557
1504 tmp->x = op->x; 1558 tmp->x = op->x;
1505 tmp->y = op->y; 1559 tmp->y = op->y;
1506 1560
1507 insert_ob_in_map (tmp, op->map, op, 0); 1561 insert_ob_in_map (tmp, op->map, op, 0);
… …
1512{ 1566{
1513 if (where->env) 1567 if (where->env)
1514 return where->env->insert (this); 1568 return where->env->insert (this);
1515 else 1569 else
1516 return where->map->insert (this, where->x, where->y, originator, flags); 1570 return where->map->insert (this, where->x, where->y, originator, flags);
1571}
1572
1573// check whether we can put this into the map, respect max_volume, max_items
1574bool
1575object::can_drop_at (maptile *m, int x, int y, object *originator)
1576{
1577 mapspace &ms = m->at (x, y);
1578
1579 int items = ms.items ();
1580
1581 if (!items // testing !items ensures we can drop at least one item
1582 || (items < m->max_items
1583 && ms.volume () < m->max_volume))
1584 return true;
1585
1586 if (originator && originator->is_player ())
1587 originator->contr->failmsg (format (
1588 "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
1589 query_name ()
1590 ));
1591
1592 return false;
1517} 1593}
1518 1594
1519/* 1595/*
1520 * decrease(object, number) decreases a specified number from 1596 * decrease(object, number) decreases a specified number from
1521 * the amount of an object. If the amount reaches 0, the object 1597 * the amount of an object. If the amount reaches 0, the object
… …
1656 1732
1657 adjust_weight (this, op->total_weight ()); 1733 adjust_weight (this, op->total_weight ());
1658 1734
1659inserted: 1735inserted:
1660 /* reset the light list and los of the players on the map */ 1736 /* reset the light list and los of the players on the map */
1661 if (op->glow_radius && is_on_map () && map->darkness) 1737 if (op->glow_radius && is_on_map ())
1662 { 1738 {
1663 update_stats (); 1739 update_stats ();
1664 update_all_los (map, x, y); 1740 update_all_los (map, x, y);
1665 } 1741 }
1666 else if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER]) 1742 else if (is_player () && !flag [FLAG_NO_FIX_PLAYER])
1667 // if this is a player's inventory, update stats 1743 // if this is a player's inventory, update stats
1668 update_stats (); 1744 update_stats ();
1669 1745
1670 INVOKE_OBJECT (INSERT, this); 1746 INVOKE_OBJECT (INSERT, this);
1671 1747
… …
1693 * on top. 1769 * on top.
1694 */ 1770 */
1695int 1771int
1696check_move_on (object *op, object *originator) 1772check_move_on (object *op, object *originator)
1697{ 1773{
1774 if (QUERY_FLAG (op, FLAG_NO_APPLY))
1775 return 0;
1776
1698 object *tmp; 1777 object *tmp;
1699 maptile *m = op->map; 1778 maptile *m = op->map;
1700 int x = op->x, y = op->y; 1779 int x = op->x, y = op->y;
1701 1780
1702 MoveType move_on, move_slow, move_block; 1781 mapspace &ms = m->at (x, y);
1703 1782
1704 if (QUERY_FLAG (op, FLAG_NO_APPLY)) 1783 ms.update ();
1705 return 0;
1706 1784
1707 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); 1785 MoveType move_on = ms.move_on;
1708 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); 1786 MoveType move_slow = ms.move_slow;
1709 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); 1787 MoveType move_block = ms.move_block;
1710 1788
1711 /* if nothing on this space will slow op down or be applied, 1789 /* if nothing on this space will slow op down or be applied,
1712 * no need to do checking below. have to make sure move_type 1790 * no need to do checking below. have to make sure move_type
1713 * is set, as lots of objects don't have it set - we treat that 1791 * is set, as lots of objects don't have it set - we treat that
1714 * as walking. 1792 * as walking.
… …
1725 return 0; 1803 return 0;
1726 1804
1727 /* The objects have to be checked from top to bottom. 1805 /* The objects have to be checked from top to bottom.
1728 * Hence, we first go to the top: 1806 * Hence, we first go to the top:
1729 */ 1807 */
1730 1808 for (object *next, *tmp = ms.top; tmp; tmp = next)
1731 for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1732 {
1733 /* Trim the search when we find the first other spell effect
1734 * this helps performance so that if a space has 50 spell objects,
1735 * we don't need to check all of them.
1736 */
1737 if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1738 break;
1739 } 1809 {
1810 next = tmp->below;
1740 1811
1741 for (; tmp; tmp = tmp->below)
1742 {
1743 if (tmp == op) 1812 if (tmp == op)
1744 continue; /* Can't apply yourself */ 1813 continue; /* Can't apply yourself */
1745 1814
1746 /* Check to see if one of the movement types should be slowed down. 1815 /* Check to see if one of the movement types should be slowed down.
1747 * Second check makes sure that the movement types not being slowed 1816 * Second check makes sure that the movement types not being slowed
… …
1752 if (!QUERY_FLAG (op, FLAG_WIZPASS)) 1821 if (!QUERY_FLAG (op, FLAG_WIZPASS))
1753 { 1822 {
1754 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1823 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1755 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) 1824 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1756 { 1825 {
1757
1758 float
1759 diff = tmp->move_slow_penalty * fabs (op->speed); 1826 float diff = tmp->move_slow_penalty * fabs (op->speed);
1760 1827
1761 if (op->type == PLAYER) 1828 if (op->is_player ())
1762 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 1829 if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1763 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) 1830 (tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1764 diff /= 4.0; 1831 diff /= 4.0;
1765 1832
1766 op->speed_left -= diff; 1833 op->speed_left -= diff;
1767 } 1834 }
1768 } 1835 }
… …
2052 * there is capable of. 2119 * there is capable of.
2053 */ 2120 */
2054int 2121int
2055find_dir (maptile *m, int x, int y, object *exclude) 2122find_dir (maptile *m, int x, int y, object *exclude)
2056{ 2123{
2057 int i, max = SIZEOFFREE, mflags; 2124 int max = SIZEOFFREE, mflags;
2058
2059 sint16 nx, ny;
2060 object *tmp;
2061 maptile *mp;
2062
2063 MoveType blocked, move_type; 2125 MoveType move_type;
2064 2126
2065 if (exclude && exclude->head_ () != exclude) 2127 if (exclude && exclude->head_ () != exclude)
2066 { 2128 {
2067 exclude = exclude->head; 2129 exclude = exclude->head;
2068 move_type = exclude->move_type; 2130 move_type = exclude->move_type;
… …
2071 { 2133 {
2072 /* If we don't have anything, presume it can use all movement types. */ 2134 /* If we don't have anything, presume it can use all movement types. */
2073 move_type = MOVE_ALL; 2135 move_type = MOVE_ALL;
2074 } 2136 }
2075 2137
2076 for (i = 1; i < max; i++) 2138 for (int i = 1; i < max; i++)
2077 { 2139 {
2078 mp = m; 2140 mapxy pos (m, x, y);
2079 nx = x + freearr_x[i]; 2141 pos.move (i);
2080 ny = y + freearr_y[i];
2081 2142
2082 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); 2143 if (!pos.normalise ())
2083
2084 if (mflags & P_OUT_OF_MAP)
2085 max = maxfree[i]; 2144 max = maxfree[i];
2086 else 2145 else
2087 { 2146 {
2088 mapspace &ms = mp->at (nx, ny); 2147 mapspace &ms = *pos;
2089 2148
2090 blocked = ms.move_block;
2091
2092 if ((move_type & blocked) == move_type) 2149 if ((move_type & ms.move_block) == move_type)
2093 max = maxfree[i]; 2150 max = maxfree [i];
2094 else if (mflags & P_IS_ALIVE) 2151 else if (ms.flags () & P_IS_ALIVE)
2095 { 2152 {
2096 for (tmp = ms.bot; tmp; tmp = tmp->above) 2153 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2097 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2154 if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2098 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) 2155 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2099 break;
2100
2101 if (tmp)
2102 return freedir[i]; 2156 return freedir [i];
2103 } 2157 }
2104 } 2158 }
2105 } 2159 }
2106 2160
2107 return 0; 2161 return 0;
… …
2182 * This basically means that if direction is 15, then it could either go 2236 * This basically means that if direction is 15, then it could either go
2183 * direction 4, 14, or 16 to get back to where we are. 2237 * direction 4, 14, or 16 to get back to where we are.
2184 * Moved from spell_util.c to object.c with the other related direction 2238 * Moved from spell_util.c to object.c with the other related direction
2185 * functions. 2239 * functions.
2186 */ 2240 */
2187int reduction_dir[SIZEOFFREE][3] = { 2241static const int reduction_dir[SIZEOFFREE][3] = {
2188 {0, 0, 0}, /* 0 */ 2242 {0, 0, 0}, /* 0 */
2189 {0, 0, 0}, /* 1 */ 2243 {0, 0, 0}, /* 1 */
2190 {0, 0, 0}, /* 2 */ 2244 {0, 0, 0}, /* 2 */
2191 {0, 0, 0}, /* 3 */ 2245 {0, 0, 0}, /* 3 */
2192 {0, 0, 0}, /* 4 */ 2246 {0, 0, 0}, /* 4 */
… …
2288int 2342int
2289can_pick (const object *who, const object *item) 2343can_pick (const object *who, const object *item)
2290{ 2344{
2291 return /*QUERY_FLAG(who,FLAG_WIZ)|| */ 2345 return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2292 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && 2346 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2293 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); 2347 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2294} 2348}
2295 2349
2296/* 2350/*
2297 * create clone from object to another 2351 * create clone from object to another
2298 */ 2352 */
… …
2330 return tmp; 2384 return tmp;
2331 2385
2332 return 0; 2386 return 0;
2333} 2387}
2334 2388
2335const shstr & 2389shstr_tmp
2336object::kv_get (const shstr &key) const 2390object::kv_get (shstr_tmp key) const
2337{ 2391{
2338 for (key_value *kv = key_values; kv; kv = kv->next) 2392 for (key_value *kv = key_values; kv; kv = kv->next)
2339 if (kv->key == key) 2393 if (kv->key == key)
2340 return kv->value; 2394 return kv->value;
2341 2395
2342 return shstr_null; 2396 return shstr ();
2343} 2397}
2344 2398
2345void 2399void
2346object::kv_set (const shstr &key, const shstr &value) 2400object::kv_set (shstr_tmp key, shstr_tmp value)
2347{ 2401{
2348 for (key_value *kv = key_values; kv; kv = kv->next) 2402 for (key_value *kv = key_values; kv; kv = kv->next)
2349 if (kv->key == key) 2403 if (kv->key == key)
2350 { 2404 {
2351 kv->value = value; 2405 kv->value = value;
… …
2360 2414
2361 key_values = kv; 2415 key_values = kv;
2362} 2416}
2363 2417
2364void 2418void
2365object::kv_del (const shstr &key) 2419object::kv_del (shstr_tmp key)
2366{ 2420{
2367 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) 2421 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
2368 if ((*kvp)->key == key) 2422 if ((*kvp)->key == key)
2369 { 2423 {
2370 key_value *kv = *kvp; 2424 key_value *kv = *kvp;
… …
2463{ 2517{
2464 return map ? map->region (x, y) 2518 return map ? map->region (x, y)
2465 : region::default_region (); 2519 : region::default_region ();
2466} 2520}
2467 2521
2468const materialtype_t *
2469object::dominant_material () const
2470{
2471 if (materialtype_t *mt = name_to_material (materialname))
2472 return mt;
2473
2474 return name_to_material (shstr_unknown);
2475}
2476
2477void 2522void
2478object::open_container (object *new_container) 2523object::open_container (object *new_container)
2479{ 2524{
2480 if (container == new_container) 2525 if (container == new_container)
2481 return; 2526 return;
… …
2501 container = 0; 2546 container = 0;
2502 2547
2503 // client needs item update to make it work, client bug requires this to be separate 2548 // client needs item update to make it work, client bug requires this to be separate
2504 esrv_update_item (UPD_FLAGS, this, old_container); 2549 esrv_update_item (UPD_FLAGS, this, old_container);
2505 2550
2506 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); 2551 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2507 play_sound (sound_find ("chest_close")); 2552 play_sound (sound_find ("chest_close"));
2508 } 2553 }
2509 2554
2510 if (new_container) 2555 if (new_container)
2511 { 2556 {
… …
2521 closer->flag [FLAG_NO_MAP_SAVE] = 1; 2566 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2522 new_container->insert (closer); 2567 new_container->insert (closer);
2523 } 2568 }
2524#endif 2569#endif
2525 2570
2526 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); 2571 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2527 2572
2528 // make sure the container is available, client bug requires this to be separate 2573 // make sure the container is available, client bug requires this to be separate
2529 esrv_send_item (this, new_container); 2574 esrv_send_item (this, new_container);
2530 2575
2531 new_container->flag [FLAG_APPLIED] = true; 2576 new_container->flag [FLAG_APPLIED] = true;
… …
2539// else if (!old_container->env && contr && contr->ns) 2584// else if (!old_container->env && contr && contr->ns)
2540// contr->ns->floorbox_reset (); 2585// contr->ns->floorbox_reset ();
2541} 2586}
2542 2587
2543object * 2588object *
2544object::force_find (const shstr name) 2589object::force_find (shstr_tmp name)
2545{ 2590{
2546 /* cycle through his inventory to look for the MARK we want to 2591 /* cycle through his inventory to look for the MARK we want to
2547 * place 2592 * place
2548 */ 2593 */
2549 for (object *tmp = inv; tmp; tmp = tmp->below) 2594 for (object *tmp = inv; tmp; tmp = tmp->below)
… …
2551 return splay (tmp); 2596 return splay (tmp);
2552 2597
2553 return 0; 2598 return 0;
2554} 2599}
2555 2600
2601//-GPL
2602
2603void
2604object::force_set_timer (int duration)
2605{
2606 this->duration = 1;
2607 this->speed_left = -1.f;
2608
2609 this->set_speed (duration ? 1.f / duration : 0.f);
2610}
2611
2556object * 2612object *
2557object::force_add (const shstr name, int duration) 2613object::force_add (shstr_tmp name, int duration)
2558{ 2614{
2559 if (object *force = force_find (name)) 2615 if (object *force = force_find (name))
2560 force->destroy (); 2616 force->destroy ();
2561 2617
2562 object *force = get_archetype (FORCE_NAME); 2618 object *force = get_archetype (FORCE_NAME);
2563 2619
2564 force->slaying = name; 2620 force->slaying = name;
2565 force->stats.food = 1; 2621 force->force_set_timer (duration);
2566 force->speed_left = -1.f;
2567
2568 force->set_speed (duration ? 1.f / duration : 0.f);
2569 force->flag [FLAG_IS_USED_UP] = true;
2570 force->flag [FLAG_APPLIED] = true; 2622 force->flag [FLAG_APPLIED] = true;
2571 2623
2572 return insert (force); 2624 return insert (force);
2573} 2625}
2574 2626
2575void 2627void
2576object::play_sound (faceidx sound) 2628object::play_sound (faceidx sound) const
2577{ 2629{
2578 if (!sound) 2630 if (!sound)
2579 return; 2631 return;
2580 2632
2581 if (flag [FLAG_REMOVED]) 2633 if (is_on_map ())
2582 return;
2583
2584 if (env)
2585 {
2586 if (object *pl = in_player ())
2587 pl->contr->play_sound (sound);
2588 }
2589 else
2590 map->play_sound (sound, x, y); 2634 map->play_sound (sound, x, y);
2635 else if (object *pl = in_player ())
2636 pl->contr->play_sound (sound);
2637}
2638
2639void
2640object::say_msg (const char *msg) const
2641{
2642 if (is_on_map ())
2643 map->say_msg (msg, x, y);
2644 else if (object *pl = in_player ())
2645 pl->contr->play_sound (sound);
2591} 2646}
2592 2647
2593void 2648void
2594object::make_noise () 2649object::make_noise ()
2595{ 2650{
… …
2604 2659
2605 // find old force, or create new one 2660 // find old force, or create new one
2606 object *force = force_find (shstr_noise_force); 2661 object *force = force_find (shstr_noise_force);
2607 2662
2608 if (force) 2663 if (force)
2609 force->speed = 1.f / 4; // patch old speed up 2664 force->speed_left = -1.f; // patch old speed up
2610 else 2665 else
2611 force_add (shstr_noise_force, 4); 2666 {
2612} 2667 force = archetype::get (shstr_noise_force);
2613 2668
2669 force->slaying = shstr_noise_force;
2670 force->stats.food = 1;
2671 force->speed_left = -1.f;
2672
2673 force->set_speed (1.f / 4.f);
2674 force->flag [FLAG_IS_USED_UP] = true;
2675 force->flag [FLAG_APPLIED] = true;
2676
2677 insert (force);
2678 }
2679}
2680

Diff Legend

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