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.34 by root, Tue Sep 12 01:09:53 2006 UTC vs.
Revision 1.286 by root, Wed Sep 2 16:54:20 2009 UTC

1
2/* 1/*
3 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
4 3 *
4 * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 7 *
8 This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 (at your option) any later version. 11 * (at your option) any later version.
12 12 *
13 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details. 16 * GNU General Public License for more details.
17 17 *
18 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 *
21 21 * The authors can be reached via e-mail to <support@deliantra.net>
22 The authors can be reached via e-mail at crossfire-devel@real-time.com
23*/ 22 */
24 23
25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26 sub/add_weight will transcend the environment updating the carrying
27 variable. */
28#include <global.h> 24#include <global.h>
29#include <stdio.h> 25#include <stdio.h>
30#include <sys/types.h> 26#include <sys/types.h>
31#include <sys/uio.h> 27#include <sys/uio.h>
32#include <object.h> 28#include <object.h>
33#include <funcpoint.h> 29#include <sproto.h>
34#include <loader.h> 30#include <loader.h>
35 31
36int nrofallocobjects = 0; 32#include <bitset>
37 33
38object *objects; /* Pointer to the list of used objects */ 34UUID UUID::cur;
39object *active_objects; /* List of active objects that need to be processed */ 35static uint64_t seq_next_save;
36static const uint64 UUID_GAP = 1<<19;
37uint32_t mapspace::smellcount = 10000;
40 38
41short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, 39objectvec objects;
40activevec actives;
41
42short freearr_x[SIZEOFFREE] = {
43 0,
44 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,
42 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 46 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
43}; 47};
44short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, 48short freearr_y[SIZEOFFREE] = {
49 0,
50 -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,
45 -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 -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
46}; 53};
47int maxfree[SIZEOFFREE] = { 0, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 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,
48 48, 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 49, 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};
50int freedir[SIZEOFFREE] = { 60int freedir[SIZEOFFREE] = {
51 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, 61 0,
62 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,
52 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 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
53}; 65};
54 66
67static void
68write_uuid (uval64 skip, bool sync)
69{
70 CALL_BEGIN (2);
71 CALL_ARG_SV (newSVval64 (skip));
72 CALL_ARG_SV (boolSV (sync));
73 CALL_CALL ("cf::write_uuid", G_DISCARD);
74 CALL_END;
75}
76
77static void
78read_uuid (void)
79{
80 char filename[MAX_BUF];
81
82 sprintf (filename, "%s/uuid", settings.localdir);
83
84 seq_next_save = 0;
85
86 FILE *fp;
87
88 if (!(fp = fopen (filename, "r")))
89 {
90 if (errno == ENOENT)
91 {
92 LOG (llevInfo, "RESET uid to 1\n");
93 UUID::cur.seq = 0;
94 write_uuid (UUID_GAP, true);
95 return;
96 }
97
98 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
99 _exit (1);
100 }
101
102 UUID::BUF buf;
103 buf[0] = 0;
104 fgets (buf, sizeof (buf), fp);
105
106 if (!UUID::cur.parse (buf))
107 {
108 LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
109 _exit (1);
110 }
111
112 LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
113
114 write_uuid (UUID_GAP, true);
115 fclose (fp);
116}
117
118UUID
119UUID::gen ()
120{
121 UUID uid;
122
123 uid.seq = ++cur.seq;
124
125 if (expect_false (cur.seq >= seq_next_save))
126 {
127 seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
128 write_uuid (UUID_GAP, false);
129 }
130
131
132 return uid;
133}
134
135void
136UUID::init ()
137{
138 read_uuid ();
139}
140
55/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ 141/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
56static int 142static bool
57compare_ob_value_lists_one (const object *wants, const object *has) 143compare_ob_value_lists_one (const object *wants, const object *has)
58{ 144{
59 key_value *wants_field;
60
61 /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both 145 /* n-squared behaviour (see kv_get), but I'm hoping both
62 * objects with lists are rare, and lists stay short. If not, use a 146 * objects with lists are rare, and lists stay short. If not, use a
63 * different structure or at least keep the lists sorted... 147 * different structure or at least keep the lists sorted...
64 */ 148 */
65 149
66 /* For each field in wants, */ 150 /* For each field in wants, */
67 for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next) 151 for (key_value *kv = wants->key_values; kv; kv = kv->next)
68 { 152 if (has->kv_get (kv->key) != kv->value)
69 key_value *has_field; 153 return false;
70
71 /* Look for a field in has with the same key. */
72 has_field = get_ob_key_link (has, wants_field->key);
73
74 if (has_field == NULL)
75 {
76 /* No field with that name. */
77 return FALSE;
78 }
79
80 /* Found the matching field. */
81 if (has_field->value != wants_field->value)
82 {
83 /* Values don't match, so this half of the comparison is false. */
84 return FALSE;
85 }
86
87 /* If we get here, we found a match. Now for the next field in wants. */
88 }
89 154
90 /* If we get here, every field in wants has a matching field in has. */ 155 /* If we get here, every field in wants has a matching field in has. */
91 return TRUE; 156 return true;
92} 157}
93 158
94/* Returns TRUE if ob1 has the same key_values as ob2. */ 159/* Returns TRUE if ob1 has the same key_values as ob2. */
95static int 160static bool
96compare_ob_value_lists (const object *ob1, const object *ob2) 161compare_ob_value_lists (const object *ob1, const object *ob2)
97{ 162{
98 /* However, there may be fields in has which aren't partnered in wants, 163 /* However, there may be fields in has which aren't partnered in wants,
99 * so we need to run the comparison *twice*. :( 164 * so we need to run the comparison *twice*. :(
100 */ 165 */
101 return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1); 166 return compare_ob_value_lists_one (ob1, ob2)
167 && compare_ob_value_lists_one (ob2, ob1);
102} 168}
103 169
104/* Function examines the 2 objects given to it, and returns true if 170/* Function examines the 2 objects given to it, and returns true if
105 * they can be merged together. 171 * they can be merged together.
106 * 172 *
107 * Note that this function appears a lot longer than the macro it 173 * Note that this function appears a lot longer than the macro it
108 * replaces - this is mostly for clarity - a decent compiler should hopefully 174 * replaces - this is mostly for clarity - a decent compiler should hopefully
109 * reduce this to the same efficiency. 175 * reduce this to the same efficiency.
110 * 176 *
111 * Check nrof variable *before* calling CAN_MERGE() 177 * Check nrof variable *before* calling can_merge()
112 * 178 *
113 * Improvements made with merge: Better checking on potion, and also 179 * Improvements made with merge: Better checking on potion, and also
114 * check weight 180 * check weight
115 */ 181 */
116
117bool object::can_merge (object *ob1, object *ob2) 182bool object::can_merge_slow (object *ob1, object *ob2)
118{ 183{
119 /* A couple quicksanity checks */ 184 /* A couple quicksanity checks */
120 if ((ob1 == ob2) || (ob1->type != ob2->type)) 185 if (ob1 == ob2
186 || ob1->type != ob2->type
187 || ob1->speed != ob2->speed
188 || ob1->value != ob2->value
189 || ob1->name != ob2->name)
121 return 0; 190 return 0;
122 191
123 if (ob1->speed != ob2->speed) 192 /* Do not merge objects if nrof would overflow, assume nrof
193 * is always 0 .. 2**31-1 */
194 if (ob1->nrof > 0x7fffffff - ob2->nrof)
124 return 0; 195 return 0;
125 196
126 /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that
127 * value could not be stored in a sint32 (which unfortunately sometimes is
128 * used to store nrof).
129 */
130 if (ob1->nrof + ob2->nrof >= 1UL << 31)
131 return 0;
132
133 /* If the objects have been identified, set the BEEN_APPLIED flag. 197 /* If the objects have been identified, set the BEEN_APPLIED flag.
134 * This is to the comparison of the flags below will be OK. We 198 * This is to the comparison of the flags below will be OK. We
135 * just can't ignore the been applied or identified flags, as they 199 * just can't ignore the been applied or identified flags, as they
136 * are not equal - just if it has been identified, the been_applied 200 * are not equal - just if it has been identified, the been_applied
137 * flags lose any meaning. 201 * flags lose any meaning.
138 */ 202 */
139 if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) 203 if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
140 SET_FLAG (ob1, FLAG_BEEN_APPLIED); 204 SET_FLAG (ob1, FLAG_BEEN_APPLIED);
141 205
142 if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) 206 if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
143 SET_FLAG (ob2, FLAG_BEEN_APPLIED); 207 SET_FLAG (ob2, FLAG_BEEN_APPLIED);
144 208
145 209 if (ob1->arch->archname != ob2->arch->archname
146 /* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something
147 * being locked in inventory should prevent merging.
148 * 0x4 in flags3 is CLIENT_SENT
149 */
150 if ((ob1->arch != ob2->arch) ||
151 (ob1->flags[0] != ob2->flags[0]) ||
152 (ob1->flags[1] != ob2->flags[1]) ||
153 ((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~0x400000)) ||
154 ((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) ||
155 (ob1->name != ob2->name) || 210 || ob1->name != ob2->name
156 (ob1->title != ob2->title) || 211 || ob1->title != ob2->title
157 (ob1->msg != ob2->msg) || 212 || ob1->msg != ob2->msg
158 (ob1->weight != ob2->weight) || 213 || ob1->weight != ob2->weight
159 (memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) != 0) ||
160 (memcmp (&ob1->stats, &ob2->stats, sizeof (ob1->stats)) != 0) ||
161 (ob1->attacktype != ob2->attacktype) || 214 || ob1->attacktype != ob2->attacktype
162 (ob1->magic != ob2->magic) || 215 || ob1->magic != ob2->magic
163 (ob1->slaying != ob2->slaying) || 216 || ob1->slaying != ob2->slaying
164 (ob1->skill != ob2->skill) || 217 || ob1->skill != ob2->skill
165 (ob1->value != ob2->value) || 218 || ob1->value != ob2->value
166 (ob1->animation_id != ob2->animation_id) || 219 || ob1->animation_id != ob2->animation_id
220 || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other
167 (ob1->client_type != ob2->client_type) || 221 || ob1->client_type != ob2->client_type
168 (ob1->materialname != ob2->materialname) || 222 || ob1->materialname != ob2->materialname
169 (ob1->lore != ob2->lore) || 223 || ob1->lore != ob2->lore
170 (ob1->subtype != ob2->subtype) || 224 || ob1->subtype != ob2->subtype
171 (ob1->move_type != ob2->move_type) || 225 || ob1->move_type != ob2->move_type
172 (ob1->move_block != ob2->move_block) || 226 || ob1->move_block != ob2->move_block
173 (ob1->move_allow != ob2->move_allow) || 227 || ob1->move_allow != ob2->move_allow
174 (ob1->move_on != ob2->move_on) || 228 || ob1->move_on != ob2->move_on
175 (ob1->move_off != ob2->move_off) || (ob1->move_slow != ob2->move_slow) || (ob1->move_slow_penalty != ob2->move_slow_penalty)) 229 || ob1->move_off != ob2->move_off
230 || ob1->move_slow != ob2->move_slow
231 || ob1->move_slow_penalty != ob2->move_slow_penalty
232 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
233 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
176 return 0; 234 return 0;
177 235
236 if ((ob1->flag ^ ob2->flag)
237 .reset (FLAG_INV_LOCKED)
238 .reset (FLAG_REMOVED)
239 .any ())
240 return 0;
241
178 /* This is really a spellbook check - really, we should 242 /* This is really a spellbook check - we should in general
179 * check all objects in the inventory. 243 * not merge objects with real inventories, as splitting them
244 * is hard.
180 */ 245 */
181 if (ob1->inv || ob2->inv) 246 if (ob1->inv || ob2->inv)
182 { 247 {
183 /* if one object has inventory but the other doesn't, not equiv */
184 if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))
185 return 0;
186
187 /* Now check to see if the two inventory objects could merge */
188 if (!CAN_MERGE (ob1->inv, ob2->inv)) 248 if (!(ob1->inv && ob2->inv))
189 return 0; 249 return 0; /* inventories differ in length */
250
251 if (ob1->inv->below || ob2->inv->below)
252 return 0; /* more than one object in inv */
253
254 if (!object::can_merge (ob1->inv, ob2->inv))
255 return 0; /* inventory objects differ */
190 256
191 /* inventory ok - still need to check rest of this object to see 257 /* inventory ok - still need to check rest of this object to see
192 * if it is valid. 258 * if it is valid.
193 */ 259 */
194 } 260 }
… …
202 268
203 /* Note sure why the following is the case - either the object has to 269 /* Note sure why the following is the case - either the object has to
204 * be animated or have a very low speed. Is this an attempted monster 270 * be animated or have a very low speed. Is this an attempted monster
205 * check? 271 * check?
206 */ 272 */
207 if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED) 273 if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
208 return 0; 274 return 0;
209 275
210 switch (ob1->type) 276 switch (ob1->type)
211 { 277 {
212 case SCROLL: 278 case SCROLL:
213 if (ob1->level != ob2->level) 279 if (ob1->level != ob2->level)
214 return 0; 280 return 0;
215 break; 281 break;
216 } 282 }
217 283
218 if (ob1->key_values != NULL || ob2->key_values != NULL) 284 if (ob1->key_values || ob2->key_values)
219 { 285 {
220 /* At least one of these has key_values. */ 286 /* At least one of these has key_values. */
221 if ((ob1->key_values == NULL) != (ob2->key_values == NULL)) 287 if ((!ob1->key_values) != (!ob2->key_values))
222 /* One has fields, but the other one doesn't. */ 288 return 0; /* One has fields, but the other one doesn't. */
289
290 if (!compare_ob_value_lists (ob1, ob2))
223 return 0; 291 return 0;
224 else if (!compare_ob_value_lists (ob1, ob2))
225 return 0;
226 } 292 }
227 293
228 //TODO: generate an event or call into perl for additional checks
229 if (ob1->self || ob2->self) 294 if (ob1->self || ob2->self)
230 { 295 {
231 ob1->optimise (); 296 ob1->optimise ();
232 ob2->optimise (); 297 ob2->optimise ();
233 298
234 if (ob1->self || ob2->self) 299 if (ob1->self || ob2->self)
300 {
301 int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
302 int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
303
304 if (k1 != k2)
235 return 0; 305 return 0;
306
307 if (k1 == 0)
308 return 1;
309
310 if (!cfperl_can_merge (ob1, ob2))
311 return 0;
312 }
236 } 313 }
237 314
238 /* Everything passes, must be OK. */ 315 /* Everything passes, must be OK. */
239 return 1; 316 return 1;
240} 317}
241 318
319// find player who can see this object
320object *
321object::visible_to () const
322{
323 if (client_visible () && !flag [FLAG_REMOVED])
324 {
325 // see if we are in a container of sorts
326 if (env)
327 {
328 // the player inventory itself is always visible
329 if (env->is_player ())
330 return env;
331
332 // else a player could have our env open
333 object *envest = env->outer_env_or_self ();
334
335 // the player itself is always on a map, so we will find him here
336 // even if our inv is in a player.
337 if (envest->is_on_map ())
338 if (object *pl = envest->ms ().player ())
339 if (pl->container == env)
340 return pl;
341 }
342 else
343 {
344 // maybe there is a player standing on the same mapspace
345 // this will catch the case where "this" is a player
346 if (object *pl = ms ().player ())
347 if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look)
348 || this == pl->container)
349 return pl;
350 }
351 }
352
353 return 0;
354}
355
356// adjust weight per container type ("of holding")
357static sint32
358weight_adjust_for (object *op, sint32 weight)
359{
360 return op->type == CONTAINER
361 ? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
362 : weight;
363}
364
242/* 365/*
366 * adjust_weight(object, weight) adds the specified weight to an object,
367 * and also updates how much the environment(s) is/are carrying.
368 */
369static void
370adjust_weight (object *op, sint32 weight)
371{
372 while (op)
373 {
374 // adjust by actual difference to account for rounding errors
375 // i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
376 weight = weight_adjust_for (op, op->carrying)
377 - weight_adjust_for (op, op->carrying - weight);
378
379 if (!weight)
380 return;
381
382 op->carrying += weight;
383
384 if (object *pl = op->visible_to ())
385 if (pl != op) // player is handled lazily
386 esrv_update_item (UPD_WEIGHT, pl, op);
387
388 op = op->env;
389 }
390}
391
392/*
243 * sum_weight() is a recursive function which calculates the weight 393 * this is a recursive function which calculates the weight
244 * an object is carrying. It goes through in figures out how much 394 * an object is carrying. It goes through op and figures out how much
245 * containers are carrying, and sums it up. 395 * containers are carrying, and sums it up.
246 */ 396 */
247long 397void
248sum_weight (object *op) 398object::update_weight ()
249{ 399{
250 long sum; 400 sint32 sum = 0;
251 object *inv;
252 401
253 for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) 402 for (object *op = inv; op; op = op->below)
254 { 403 {
255 if (inv->inv) 404 if (op->inv)
256 sum_weight (inv); 405 op->update_weight ();
257 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); 406
407 sum += op->total_weight ();
408 }
409
410 sum = weight_adjust_for (this, sum);
411
412 if (sum != carrying)
258 } 413 {
259 if (op->type == CONTAINER && op->stats.Str)
260 sum = (sum * (100 - op->stats.Str)) / 100;
261 if (op->carrying != sum)
262 op->carrying = sum; 414 carrying = sum;
263 return sum;
264}
265 415
266/** 416 if (object *pl = visible_to ())
267 * Return the outermost environment object for a given object. 417 if (pl != this) // player is handled lazily
268 */ 418 esrv_update_item (UPD_WEIGHT, pl, this);
269
270object *
271object_get_env_recursive (object *op)
272{
273 while (op->env != NULL)
274 op = op->env;
275 return op;
276}
277
278/*
279 * Eneq(@csd.uu.se): Since we can have items buried in a character we need
280 * a better check. We basically keeping traversing up until we can't
281 * or find a player.
282 */
283
284object *
285is_player_inv (object *op)
286{
287 for (; op != NULL && op->type != PLAYER; op = op->env)
288 if (op->env == op)
289 op->env = NULL;
290 return op;
291}
292
293/*
294 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
295 * Some error messages.
296 * The result of the dump is stored in the static global errmsg array.
297 */
298
299void
300dump_object2 (object *op)
301{
302 errmsg[0] = 0;
303 return;
304 //TODO//D#d#
305#if 0
306 char *cp;
307
308/* object *tmp;*/
309
310 if (op->arch != NULL)
311 { 419 }
312 strcat (errmsg, "arch ");
313 strcat (errmsg, op->arch->name ? op->arch->name : "(null)");
314 strcat (errmsg, "\n");
315 if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
316 strcat (errmsg, cp);
317# if 0
318 /* Don't dump player diffs - they are too long, mostly meaningless, and
319 * will overflow the buffer.
320 * Changed so that we don't dump inventory either. This may
321 * also overflow the buffer.
322 */
323 if (op->type != PLAYER && (cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
324 strcat (errmsg, cp);
325 for (tmp = op->inv; tmp; tmp = tmp->below)
326 dump_object2 (tmp);
327# endif
328 strcat (errmsg, "end\n");
329 }
330 else
331 {
332 strcat (errmsg, "Object ");
333 if (op->name == NULL)
334 strcat (errmsg, "(null)");
335 else
336 strcat (errmsg, op->name);
337 strcat (errmsg, "\n");
338# if 0
339 if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
340 strcat (errmsg, cp);
341 for (tmp = op->inv; tmp; tmp = tmp->below)
342 dump_object2 (tmp);
343# endif
344 strcat (errmsg, "end\n");
345 }
346#endif
347} 420}
348 421
349/* 422/*
350 * Dumps an object. Returns output in the static global errmsg array. 423 * Used by: Server DM commands: dumpbelow, dump. Some error messages.
351 */ 424 */
352 425char *
353void
354dump_object (object *op) 426dump_object (object *op)
355{ 427{
356 if (op == NULL) 428 if (!op)
357 { 429 return strdup ("[NULLOBJ]");
358 strcpy (errmsg, "[NULL pointer]");
359 return;
360 }
361 errmsg[0] = '\0';
362 dump_object2 (op);
363}
364 430
365void 431 object_freezer freezer;
366dump_all_objects (void) 432 op->write (freezer);
367{ 433 return freezer.as_string ();
368 object *op;
369
370 for (op = objects; op != NULL; op = op->next)
371 {
372 dump_object (op);
373 fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg);
374 }
375} 434}
376 435
377/* 436/*
378 * get_nearest_part(multi-object, object 2) returns the part of the 437 * get_nearest_part(multi-object, object 2) returns the part of the
379 * multi-object 1 which is closest to the second object. 438 * multi-object 1 which is closest to the second object.
380 * If it's not a multi-object, it is returned. 439 * If it's not a multi-object, it is returned.
381 */ 440 */
382
383object * 441object *
384get_nearest_part (object *op, const object *pl) 442get_nearest_part (object *op, const object *pl)
385{ 443{
386 object *tmp, *closest; 444 object *tmp, *closest;
387 int last_dist, i; 445 int last_dist, i;
388 446
389 if (op->more == NULL) 447 if (!op->more)
390 return op; 448 return op;
449
391 for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more) 450 for (last_dist = distance (op, pl), closest = op, tmp = op->more;
451 tmp;
452 tmp = tmp->more)
392 if ((i = distance (tmp, pl)) < last_dist) 453 if ((i = distance (tmp, pl)) < last_dist)
393 closest = tmp, last_dist = i; 454 closest = tmp, last_dist = i;
455
394 return closest; 456 return closest;
395} 457}
396 458
397/* 459/*
398 * Returns the object which has the count-variable equal to the argument. 460 * Returns the object which has the count-variable equal to the argument.
461 * VERRRY slow.
399 */ 462 */
400
401object * 463object *
402find_object (tag_t i) 464find_object (tag_t i)
403{ 465{
404 object *op; 466 for_all_objects (op)
405
406 for (op = objects; op != NULL; op = op->next)
407 if (op->count == i) 467 if (op->count == i)
408 break;
409 return op; 468 return op;
469
470 return 0;
410} 471}
411 472
412/* 473/*
413 * Returns the first object which has a name equal to the argument. 474 * Returns the first object which has a name equal to the argument.
414 * Used only by the patch command, but not all that useful. 475 * Used only by the patch command, but not all that useful.
415 * Enables features like "patch <name-of-other-player> food 999" 476 * Enables features like "patch <name-of-other-player> food 999"
416 */ 477 */
417
418object * 478object *
419find_object_name (const char *str) 479find_object_name (const char *str)
420{ 480{
421 const char *name = shstr::find (str); 481 shstr_cmp str_ (str);
422 object *op;
423 482
424 for (op = objects; op != NULL; op = op->next) 483 if (str_)
484 for_all_objects (op)
425 if (&op->name == name) 485 if (op->name == str_)
426 break; 486 return op;
427 487
428 return op; 488 return 0;
429}
430
431void
432free_all_object_data ()
433{
434 LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
435}
436
437/*
438 * Returns the object which this object marks as being the owner.
439 * A id-scheme is used to avoid pointing to objects which have been
440 * freed and are now reused. If this is detected, the owner is
441 * set to NULL, and NULL is returned.
442 * Changed 2004-02-12 - if the player is setting at the play again
443 * prompt, he is removed, and we don't want to treat him as an owner of
444 * anything, so check removed flag. I don't expect that this should break
445 * anything - once an object is removed, it is basically dead anyways.
446 */
447object *
448object::get_owner ()
449{
450 if (!owner
451 || QUERY_FLAG (owner, FLAG_FREED)
452 || QUERY_FLAG (owner, FLAG_REMOVED))
453 owner = 0;
454
455 return owner;
456} 489}
457 490
458/* 491/*
459 * Sets the owner and sets the skill and exp pointers to owner's current 492 * Sets the owner and sets the skill and exp pointers to owner's current
460 * skill and experience objects. 493 * skill and experience objects.
494 * ACTUALLY NO! investigate! TODO
461 */ 495 */
462void 496void
463object::set_owner (object *owner) 497object::set_owner (object *owner)
464{ 498{
499 // allow objects which own objects
465 if (!owner) 500 if (owner)
466 return;
467
468 /* next line added to allow objects which own objects */
469 /* Add a check for ownercounts in here, as I got into an endless loop
470 * with the fireball owning a poison cloud which then owned the
471 * fireball. I believe that was caused by one of the objects getting
472 * freed and then another object replacing it. Since the ownercounts
473 * didn't match, this check is valid and I believe that cause is valid.
474 */
475 while (owner->owner) 501 while (owner->owner)
476 owner = owner->owner; 502 owner = owner->owner;
503
504 if (flag [FLAG_FREED])
505 {
506 LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
507 return;
508 }
477 509
478 this->owner = owner; 510 this->owner = owner;
511}
512
513int
514object::slottype () const
515{
516 if (type == SKILL)
517 {
518 if (IS_COMBAT_SKILL (subtype)) return slot_combat;
519 if (IS_RANGED_SKILL (subtype)) return slot_ranged;
520 }
521 else
522 {
523 if (slot [body_combat].info) return slot_combat;
524 if (slot [body_range ].info) return slot_ranged;
525 }
526
527 return slot_none;
528}
529
530bool
531object::change_weapon (object *ob)
532{
533 if (current_weapon == ob)
534 return true;
535
536 if (chosen_skill)
537 chosen_skill->flag [FLAG_APPLIED] = false;
538
539 current_weapon = ob;
540 chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
541
542 if (chosen_skill)
543 chosen_skill->flag [FLAG_APPLIED] = true;
544
545 update_stats ();
546
547 if (ob)
548 {
549 // now check wether any body locations became invalid, in which case
550 // we cannot apply the weapon at the moment.
551 for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
552 if (slot[i].used < 0)
553 {
554 current_weapon = chosen_skill = 0;
555 update_stats ();
556
557 new_draw_info_format (NDI_UNIQUE, 0, this,
558 "You try to balance all your items at once, "
559 "but the %s is just too much for your body. "
560 "[You need to unapply some items first.]", &ob->name);
561 return false;
562 }
563
564 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
565 }
566 else
567 ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
568
569 if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
570 {
571 LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
572 &name, ob->debug_desc ());
573 return false;
574 }
575
576 return true;
479} 577}
480 578
481/* Zero the key_values on op, decrementing the shared-string 579/* Zero the key_values on op, decrementing the shared-string
482 * refcounts and freeing the links. 580 * refcounts and freeing the links.
483 */ 581 */
484static void 582static void
485free_key_values (object *op) 583free_key_values (object *op)
486{ 584{
487 for (key_value *i = op->key_values; i != 0;) 585 for (key_value *i = op->key_values; i; )
488 { 586 {
489 key_value *next = i->next; 587 key_value *next = i->next;
490 delete i; 588 delete i;
491 589
492 i = next; 590 i = next;
493 } 591 }
494 592
495 op->key_values = 0; 593 op->key_values = 0;
496} 594}
497 595
498void object::clear ()
499{
500 attachable_base::clear ();
501
502 free_key_values (this);
503
504 owner = 0;
505 name = 0;
506 name_pl = 0;
507 title = 0;
508 race = 0;
509 slaying = 0;
510 skill = 0;
511 msg = 0;
512 lore = 0;
513 custom_name = 0;
514 materialname = 0;
515 contr = 0;
516 below = 0;
517 above = 0;
518 inv = 0;
519 container = 0;
520 env = 0;
521 more = 0;
522 head = 0;
523 map = 0;
524 active_next = 0;
525 active_prev = 0;
526
527 memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
528
529 SET_FLAG (this, FLAG_REMOVED);
530
531 /* What is not cleared is next, prev, and count */
532
533 expmul = 1.0;
534 face = blank_face;
535 attacked_by_count = -1;
536
537 if (settings.casting_time)
538 casting_time = -1;
539}
540
541void object::clone (object *destination)
542{
543 *(object_copy *)destination = *this;
544 *(object_pod *)destination = *this;
545
546 if (self || cb)
547 INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
548}
549
550/* 596/*
551 * copy object first frees everything allocated by the second object, 597 * copy_to first frees everything allocated by the dst object,
552 * and then copies the contends of the first object into the second 598 * and then copies the contents of itself into the second
553 * object, allocating what needs to be allocated. Basically, any 599 * object, allocating what needs to be allocated. Basically, any
554 * data that is malloc'd needs to be re-malloc/copied. Otherwise, 600 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
555 * if the first object is freed, the pointers in the new object 601 * if the first object is freed, the pointers in the new object
556 * will point at garbage. 602 * will point at garbage.
557 */ 603 */
558void 604void
559copy_object (object *op2, object *op) 605object::copy_to (object *dst)
560{ 606{
561 bool is_freed = QUERY_FLAG (op, FLAG_FREED); 607 dst->remove ();
562 bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); 608 *(object_copy *)dst = *this;
563 609 dst->flag [FLAG_REMOVED] = true;
564 op2->clone (op);
565
566 if (is_freed)
567 SET_FLAG (op, FLAG_FREED);
568 if (is_removed)
569 SET_FLAG (op, FLAG_REMOVED);
570
571 if (op2->speed < 0)
572 op->speed_left = op2->speed_left - RANDOM () % 200 / 100.0;
573 610
574 /* Copy over key_values, if any. */ 611 /* Copy over key_values, if any. */
575 if (op2->key_values) 612 if (key_values)
576 { 613 {
577 key_value *tail = 0; 614 key_value *tail = 0;
578 key_value *i;
579
580 op->key_values = 0; 615 dst->key_values = 0;
581 616
582 for (i = op2->key_values; i; i = i->next) 617 for (key_value *i = key_values; i; i = i->next)
583 { 618 {
584 key_value *new_link = new key_value; 619 key_value *new_link = new key_value;
585 620
586 new_link->next = 0; 621 new_link->next = 0;
587 new_link->key = i->key; 622 new_link->key = i->key;
588 new_link->value = i->value; 623 new_link->value = i->value;
589 624
590 /* Try and be clever here, too. */ 625 /* Try and be clever here, too. */
591 if (!op->key_values) 626 if (!dst->key_values)
592 { 627 {
593 op->key_values = new_link; 628 dst->key_values = new_link;
594 tail = new_link; 629 tail = new_link;
595 } 630 }
596 else 631 else
597 { 632 {
598 tail->next = new_link; 633 tail->next = new_link;
599 tail = new_link; 634 tail = new_link;
600 } 635 }
601 } 636 }
602 } 637 }
603 638
604 update_ob_speed (op); 639 if (speed < 0)
640 dst->speed_left -= rndm ();
641
642 dst->activate ();
643}
644
645void
646object::instantiate ()
647{
648 if (!uuid.seq) // HACK
649 uuid = UUID::gen ();
650
651 speed_left = -0.1f;
652 /* copy the body_info to the body_used - this is only really
653 * need for monsters, but doesn't hurt to do it for everything.
654 * by doing so, when a monster is created, it has good starting
655 * values for the body_used info, so when items are created
656 * for it, they can be properly equipped.
657 */
658 for (int i = NUM_BODY_LOCATIONS; i--; )
659 slot[i].used = slot[i].info;
660
661 attachable::instantiate ();
662}
663
664object *
665object::clone ()
666{
667 object *neu = create ();
668 copy_to (neu);
669 neu->map = map; // not copied by copy_to
670 return neu;
605} 671}
606 672
607/* 673/*
608 * If an object with the IS_TURNABLE() flag needs to be turned due 674 * If an object with the IS_TURNABLE() flag needs to be turned due
609 * to the closest player being on the other side, this function can 675 * to the closest player being on the other side, this function can
610 * be called to update the face variable, _and_ how it looks on the map. 676 * be called to update the face variable, _and_ how it looks on the map.
611 */ 677 */
612
613void 678void
614update_turn_face (object *op) 679update_turn_face (object *op)
615{ 680{
616 if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL) 681 if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
617 return; 682 return;
683
618 SET_ANIMATION (op, op->direction); 684 SET_ANIMATION (op, op->direction);
619 update_object (op, UP_OBJ_FACE); 685 update_object (op, UP_OBJ_FACE);
620} 686}
621 687
622/* 688/*
623 * Updates the speed of an object. If the speed changes from 0 to another 689 * Updates the speed of an object. If the speed changes from 0 to another
624 * value, or vice versa, then add/remove the object from the active list. 690 * value, or vice versa, then add/remove the object from the active list.
625 * This function needs to be called whenever the speed of an object changes. 691 * This function needs to be called whenever the speed of an object changes.
626 */ 692 */
627void 693void
628update_ob_speed (object *op) 694object::set_speed (float speed)
629{ 695{
630 extern int arch_init; 696 if (flag [FLAG_FREED] && speed)
631
632 /* No reason putting the archetypes objects on the speed list,
633 * since they never really need to be updated.
634 */
635
636 if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
637 { 697 {
638 LOG (llevError, "Object %s is freed but has speed.\n", &op->name); 698 LOG (llevError, "Object %s is freed but has speed.\n", &name);
639#ifdef MANY_CORES
640 abort ();
641#else
642 op->speed = 0; 699 speed = 0;
643#endif
644 }
645
646 if (arch_init)
647 return;
648
649 if (FABS (op->speed) > MIN_ACTIVE_SPEED)
650 { 700 }
651 /* If already on active list, don't do anything */
652 if (op->active_next || op->active_prev || op == active_objects)
653 return;
654 701
655 /* process_events() expects us to insert the object at the beginning 702 this->speed = speed;
656 * of the list. */
657 op->active_next = active_objects;
658 703
659 if (op->active_next != NULL) 704 if (has_active_speed ())
660 op->active_next->active_prev = op; 705 activate ();
661
662 active_objects = op;
663 }
664 else 706 else
665 { 707 deactivate ();
666 /* If not on the active list, nothing needs to be done */
667 if (!op->active_next && !op->active_prev && op != active_objects)
668 return;
669
670 if (op->active_prev == NULL)
671 {
672 active_objects = op->active_next;
673
674 if (op->active_next != NULL)
675 op->active_next->active_prev = NULL;
676 }
677 else
678 {
679 op->active_prev->active_next = op->active_next;
680
681 if (op->active_next)
682 op->active_next->active_prev = op->active_prev;
683 }
684
685 op->active_next = NULL;
686 op->active_prev = NULL;
687 }
688} 708}
689 709
690/* This function removes object 'op' from the list of active
691 * objects.
692 * This should only be used for style maps or other such
693 * reference maps where you don't want an object that isn't
694 * in play chewing up cpu time getting processed.
695 * The reverse of this is to call update_ob_speed, which
696 * will do the right thing based on the speed of the object.
697 */
698void
699remove_from_active_list (object *op)
700{
701 /* If not on the active list, nothing needs to be done */
702 if (!op->active_next && !op->active_prev && op != active_objects)
703 return;
704
705 if (op->active_prev == NULL)
706 {
707 active_objects = op->active_next;
708 if (op->active_next != NULL)
709 op->active_next->active_prev = NULL;
710 }
711 else
712 {
713 op->active_prev->active_next = op->active_next;
714 if (op->active_next)
715 op->active_next->active_prev = op->active_prev;
716 }
717 op->active_next = NULL;
718 op->active_prev = NULL;
719}
720
721/* 710/*
722 * update_object() updates the array which represents the map. 711 * update_object() updates the the map.
723 * It takes into account invisible objects (and represent squares covered 712 * It takes into account invisible objects (and represent squares covered
724 * by invisible objects by whatever is below them (unless it's another 713 * by invisible objects by whatever is below them (unless it's another
725 * invisible object, etc...) 714 * invisible object, etc...)
726 * If the object being updated is beneath a player, the look-window 715 * If the object being updated is beneath a player, the look-window
727 * of that player is updated (this might be a suboptimal way of 716 * of that player is updated (this might be a suboptimal way of
728 * updating that window, though, since update_object() is called _often_) 717 * updating that window, though, since update_object() is called _often_)
729 * 718 *
730 * action is a hint of what the caller believes need to be done. 719 * action is a hint of what the caller believes need to be done.
731 * For example, if the only thing that has changed is the face (due to
732 * an animation), we don't need to call update_position until that actually
733 * comes into view of a player. OTOH, many other things, like addition/removal
734 * of walls or living creatures may need us to update the flags now.
735 * current action are: 720 * current action are:
736 * UP_OBJ_INSERT: op was inserted 721 * UP_OBJ_INSERT: op was inserted
737 * UP_OBJ_REMOVE: op was removed 722 * UP_OBJ_REMOVE: op was removed
738 * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update 723 * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
739 * as that is easier than trying to look at what may have changed. 724 * as that is easier than trying to look at what may have changed.
740 * UP_OBJ_FACE: only the objects face has changed. 725 * UP_OBJ_FACE: only the objects face has changed.
741 */ 726 */
742
743void 727void
744update_object (object *op, int action) 728update_object (object *op, int action)
745{ 729{
746 int update_now = 0, flags; 730 if (!op)
747 MoveType move_on, move_off, move_block, move_slow;
748
749 if (op == NULL)
750 { 731 {
751 /* this should never happen */ 732 /* this should never happen */
752 LOG (llevDebug, "update_object() called for NULL object.\n"); 733 LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
753 return; 734 return;
754 } 735 }
755 736
756 if (op->env != NULL) 737 if (!op->is_on_map ())
757 { 738 {
758 /* Animation is currently handled by client, so nothing 739 /* Animation is currently handled by client, so nothing
759 * to do in this case. 740 * to do in this case.
760 */ 741 */
761 return; 742 return;
762 } 743 }
763 744
764 /* If the map is saving, don't do anything as everything is
765 * going to get freed anyways.
766 */
767 if (!op->map || op->map->in_memory == MAP_SAVING)
768 return;
769
770 /* make sure the object is within map boundaries */ 745 /* make sure the object is within map boundaries */
771 if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map)) 746 if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
772 { 747 {
773 LOG (llevError, "update_object() called for object out of map!\n"); 748 LOG (llevError, "update_object() called for object out of map!\n");
774#ifdef MANY_CORES 749#ifdef MANY_CORES
775 abort (); 750 abort ();
776#endif 751#endif
777 return; 752 return;
778 } 753 }
779 754
780 flags = GET_MAP_FLAGS (op->map, op->x, op->y); 755 mapspace &m = op->ms ();
781 SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
782 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
783 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
784 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
785 move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
786 756
757 if (!(m.flags_ & P_UPTODATE))
758 /* nop */;
787 if (action == UP_OBJ_INSERT) 759 else if (action == UP_OBJ_INSERT)
788 { 760 {
761 // this is likely overkill, TODO: revisit (schmorp)
789 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW)) 762 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
790 update_now = 1;
791
792 if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC)) 763 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
793 update_now = 1; 764 || (op->is_player () && !(m.flags_ & P_PLAYER))
794 765 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
766 || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
795 if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC)) 767 || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
796 update_now = 1;
797
798 if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
799 update_now = 1;
800
801 if (op->type == SAFE_GROUND && !(flags & P_SAFE))
802 update_now = 1;
803
804 if ((move_on | op->move_on) != move_on) 768 || (m.move_on | op->move_on ) != m.move_on
805 update_now = 1;
806
807 if ((move_off | op->move_off) != move_off) 769 || (m.move_off | op->move_off ) != m.move_off
808 update_now = 1; 770 || (m.move_slow | op->move_slow) != m.move_slow
809
810 /* This isn't perfect, but I don't expect a lot of objects to 771 /* This isn't perfect, but I don't expect a lot of objects to
811 * to have move_allow right now. 772 * have move_allow right now.
812 */ 773 */
813 if (((move_block | op->move_block) & ~op->move_allow) != move_block) 774 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
814 update_now = 1; 775 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
815 776 m.invalidate ();
816 if ((move_slow | op->move_slow) != move_slow)
817 update_now = 1;
818 } 777 }
819 /* if the object is being removed, we can't make intelligent 778 /* if the object is being removed, we can't make intelligent
820 * decisions, because remove_ob can't really pass the object 779 * decisions, because remove_ob can't really pass the object
821 * that is being removed. 780 * that is being removed.
822 */ 781 */
823 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) 782 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
824 update_now = 1; 783 m.invalidate ();
825 else if (action == UP_OBJ_FACE) 784 else if (action == UP_OBJ_FACE)
826 /* Nothing to do for that case */ ; 785 /* Nothing to do for that case */ ;
827 else 786 else
828 LOG (llevError, "update_object called with invalid action: %d\n", action); 787 LOG (llevError, "update_object called with invalid action: %d\n", action);
829 788
830 if (update_now)
831 {
832 SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
833 update_position (op->map, op->x, op->y);
834 }
835
836 if (op->more != NULL) 789 if (op->more)
837 update_object (op->more, action); 790 update_object (op->more, action);
838} 791}
839 792
840static unordered_vector<object *> mortals;
841static std::vector<object *> freed;
842
843void object::free_mortals ()
844{
845 for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end ();)
846 if ((*i)->refcnt)
847 ++i; // further delay freeing
848 else
849 {
850 freed.push_back (*i);//D
851 //delete *i;
852 mortals.erase (i);
853 }
854
855 if (mortals.size())//D
856 LOG (llevDebug, "%d objects in mortal queue\n", mortals.size());//D
857}
858
859object::object () 793object::object ()
860{ 794{
861 SET_FLAG (this, FLAG_REMOVED); 795 SET_FLAG (this, FLAG_REMOVED);
862 796
863 expmul = 1.0; 797 //expmul = 1.0; declared const for the time being
864 face = blank_face; 798 face = blank_face;
865 attacked_by_count = -1;
866} 799}
867 800
868object::~object () 801object::~object ()
869{ 802{
803 unlink ();
804
870 free_key_values (this); 805 free_key_values (this);
871} 806}
872 807
808static int object_count;
809
873void object::link () 810void object::link ()
874{ 811{
812 assert (!index);//D
813 uuid = UUID::gen ();
875 count = ++ob_count; 814 count = ++object_count;
876 815
877 prev = 0; 816 refcnt_inc ();
878 next = objects; 817 objects.insert (this);
879
880 if (objects)
881 objects->prev = this;
882
883 objects = this;
884} 818}
885 819
886void object::unlink () 820void object::unlink ()
887{ 821{
888 count = 0;
889
890 /* Remove this object from the list of used objects */
891 if (prev)
892 {
893 prev->next = next;
894 prev = 0;
895 }
896
897 if (next) 822 if (!index)
898 { 823 return;
899 next->prev = prev; 824
900 next = 0; 825 objects.erase (this);
826 refcnt_dec ();
827}
828
829void
830object::activate ()
831{
832 /* If already on active list, don't do anything */
833 if (active)
834 return;
835
836 if (has_active_speed ())
901 } 837 {
838 if (flag [FLAG_FREED])
839 LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
902 840
903 if (this == objects) 841 actives.insert (this);
904 objects = next; 842 }
843}
844
845void
846object::activate_recursive ()
847{
848 activate ();
849
850 for (object *op = inv; op; op = op->below)
851 op->activate_recursive ();
852}
853
854/* This function removes object 'op' from the list of active
855 * objects.
856 * This should only be used for style maps or other such
857 * reference maps where you don't want an object that isn't
858 * in play chewing up cpu time getting processed.
859 * The reverse of this is to call update_ob_speed, which
860 * will do the right thing based on the speed of the object.
861 */
862void
863object::deactivate ()
864{
865 /* If not on the active list, nothing needs to be done */
866 if (!active)
867 return;
868
869 actives.erase (this);
870}
871
872void
873object::deactivate_recursive ()
874{
875 for (object *op = inv; op; op = op->below)
876 op->deactivate_recursive ();
877
878 deactivate ();
879}
880
881void
882object::set_flag_inv (int flag, int value)
883{
884 for (object *op = inv; op; op = op->below)
885 {
886 op->flag [flag] = value;
887 op->set_flag_inv (flag, value);
888 }
889}
890
891/*
892 * Remove and free all objects in the inventory of the given object.
893 * object.c ?
894 */
895void
896object::destroy_inv (bool drop_to_ground)
897{
898 // need to check first, because the checks below might segfault
899 // as we might be on an invalid mapspace and crossfire code
900 // is too buggy to ensure that the inventory is empty.
901 // corollary: if you create arrows etc. with stuff in its inventory,
902 // cf will crash below with off-map x and y
903 if (!inv)
904 return;
905
906 /* Only if the space blocks everything do we not process -
907 * if some form of movement is allowed, let objects
908 * drop on that space.
909 */
910 if (!drop_to_ground
911 || !map
912 || map->in_memory != MAP_ACTIVE
913 || map->no_drop
914 || ms ().move_block == MOVE_ALL)
915 {
916 while (inv)
917 inv->destroy ();
918 }
919 else
920 { /* Put objects in inventory onto this space */
921 while (inv)
922 {
923 object *op = inv;
924
925 if (op->flag [FLAG_STARTEQUIP]
926 || op->flag [FLAG_NO_DROP]
927 || op->type == RUNE
928 || op->type == TRAP
929 || op->flag [FLAG_IS_A_TEMPLATE]
930 || op->flag [FLAG_DESTROY_ON_DEATH])
931 op->destroy ();
932 else
933 map->insert (op, x, y);
934 }
935 }
905} 936}
906 937
907object *object::create () 938object *object::create ()
908{ 939{
909 object *op;
910
911 if (freed.empty ())
912 op = new object; 940 object *op = new object;
913 else
914 {
915 // highly annoying, but the only way to get it stable right now
916 op = freed.back ();
917 freed.pop_back ();
918 op->~object ();
919 new ((void *) op) object;
920 }
921
922 op->link (); 941 op->link ();
923 return op; 942 return op;
924} 943}
925 944
926/* 945static struct freed_map : maptile
927 * free_object() frees everything allocated by an object, removes
928 * it from the list of used objects, and puts it on the list of
929 * free objects. The IS_FREED() flag is set in the object.
930 * The object must have been removed by remove_ob() first for
931 * this function to succeed.
932 *
933 * If free_inventory is set, free inventory as well. Else drop items in
934 * inventory to the ground.
935 */
936void object::free (bool free_inventory)
937{ 946{
938 if (QUERY_FLAG (this, FLAG_FREED)) 947 freed_map ()
948 {
949 path = "<freed objects map>";
950 name = "/internal/freed_objects_map";
951 width = 3;
952 height = 3;
953 no_drop = 1;
954 no_reset = 1;
955
956 alloc ();
957 in_memory = MAP_ACTIVE;
958 }
959
960 ~freed_map ()
961 {
962 destroy ();
963 }
964} freed_map; // freed objects are moved here to avoid crashes
965
966void
967object::do_destroy ()
968{
969 if (flag [FLAG_IS_LINKED])
970 remove_link ();
971
972 if (flag [FLAG_FRIENDLY])
973 remove_friendly_object (this);
974
975 remove ();
976
977 attachable::do_destroy ();
978
979 deactivate ();
980 unlink ();
981
982 flag [FLAG_FREED] = 1;
983
984 // hack to ensure that freed objects still have a valid map
985 map = &freed_map;
986 x = 1;
987 y = 1;
988
989 if (more)
990 {
991 more->destroy ();
992 more = 0;
993 }
994
995 head = 0;
996
997 // clear those pointers that likely might cause circular references
998 owner = 0;
999 enemy = 0;
1000 attacked_by = 0;
1001 current_weapon = 0;
1002}
1003
1004void
1005object::destroy ()
1006{
1007 if (destroyed ())
939 return; 1008 return;
940 1009
941 if (QUERY_FLAG (this, FLAG_FRIENDLY)) 1010 if (!is_head () && !head->destroyed ())
942 remove_friendly_object (this);
943
944 if (!QUERY_FLAG (this, FLAG_REMOVED))
945 remove_ob (this);
946
947 SET_FLAG (this, FLAG_FREED);
948
949 if (more)
950 {
951 more->free (free_inventory);
952 more = 0;
953 } 1011 {
954 1012 LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
955 if (inv) 1013 head->destroy ();
1014 return;
956 { 1015 }
957 /* Only if the space blocks everything do we not process -
958 * if some form of movement is allowed, let objects
959 * drop on that space.
960 */
961 if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
962 {
963 object *op = inv;
964 1016
965 while (op) 1017 destroy_inv (false);
966 {
967 object *tmp = op->below;
968 op->free (free_inventory);
969 op = tmp;
970 }
971 }
972 else
973 { /* Put objects in inventory onto this space */
974 object *op = inv;
975 1018
976 while (op) 1019 if (is_head ())
977 { 1020 if (sound_destroy)
978 object *tmp = op->below; 1021 play_sound (sound_destroy);
1022 else if (flag [FLAG_MONSTER])
1023 play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
979 1024
980 remove_ob (op); 1025 attachable::destroy ();
981
982 if (QUERY_FLAG (op, FLAG_STARTEQUIP)
983 || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
984 free_object (op);
985 else
986 {
987 op->x = x;
988 op->y = y;
989 insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
990 }
991
992 op = tmp;
993 }
994 }
995 }
996
997 owner = 0;
998
999 /* Remove object from the active list */
1000 speed = 0;
1001 update_ob_speed (this);
1002
1003 unlink ();
1004
1005 mortals.push_back (this);
1006} 1026}
1007 1027
1008/* 1028/* op->remove ():
1009 * sub_weight() recursively (outwards) subtracts a number from the
1010 * weight of an object (and what is carried by it's environment(s)).
1011 */
1012
1013void
1014sub_weight (object *op, signed long weight)
1015{
1016 while (op != NULL)
1017 {
1018 if (op->type == CONTAINER)
1019 {
1020 weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1021 }
1022 op->carrying -= weight;
1023 op = op->env;
1024 }
1025}
1026
1027/* remove_ob(op):
1028 * This function removes the object op from the linked list of objects 1029 * This function removes the object op from the linked list of objects
1029 * which it is currently tied to. When this function is done, the 1030 * which it is currently tied to. When this function is done, the
1030 * object will have no environment. If the object previously had an 1031 * object will have no environment. If the object previously had an
1031 * environment, the x and y coordinates will be updated to 1032 * environment, the x and y coordinates will be updated to
1032 * the previous environment. 1033 * the previous environment.
1033 * Beware: This function is called from the editor as well!
1034 */ 1034 */
1035
1036void 1035void
1037remove_ob (object *op) 1036object::do_remove ()
1038{ 1037{
1038 object *tmp, *last = 0;
1039 object * 1039 object *otmp;
1040 tmp, *
1041 last = NULL;
1042 object *
1043 otmp;
1044 1040
1045 tag_t 1041 if (flag [FLAG_REMOVED])
1046 tag;
1047 int
1048 check_walk_off;
1049 mapstruct *
1050 m;
1051
1052 sint16
1053 x,
1054 y;
1055
1056 if (QUERY_FLAG (op, FLAG_REMOVED))
1057 return; 1042 return;
1058 1043
1059 SET_FLAG (op, FLAG_REMOVED); 1044 INVOKE_OBJECT (REMOVE, this);
1060 1045
1061 if (op->more != NULL) 1046 flag [FLAG_REMOVED] = true;
1062 remove_ob (op->more); 1047
1048 if (more)
1049 more->remove ();
1063 1050
1064 /* 1051 /*
1065 * In this case, the object to be removed is in someones 1052 * In this case, the object to be removed is in someones
1066 * inventory. 1053 * inventory.
1067 */ 1054 */
1068 if (op->env != NULL) 1055 if (env)
1069 { 1056 {
1070 if (op->nrof) 1057 flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1071 sub_weight (op->env, op->weight * op->nrof); 1058 if (object *pl = visible_to ())
1072 else 1059 esrv_del_item (pl->contr, count);
1073 sub_weight (op->env, op->weight + op->carrying); 1060 flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1061
1062 adjust_weight (env, -total_weight ());
1063
1064 object *pl = in_player ();
1065
1066 /* we set up values so that it could be inserted into
1067 * the map, but we don't actually do that - it is up
1068 * to the caller to decide what we want to do.
1069 */
1070 map = env->map;
1071 x = env->x;
1072 y = env->y;
1073
1074 // make sure cmov optimisation is applicable
1075 *(above ? &above->below : &env->inv) = below;
1076 *(below ? &below->above : &above ) = above; // &above is just a dummy
1077
1078 above = 0;
1079 below = 0;
1080 env = 0;
1074 1081
1075 /* NO_FIX_PLAYER is set when a great many changes are being 1082 /* NO_FIX_PLAYER is set when a great many changes are being
1076 * made to players inventory. If set, avoiding the call 1083 * made to players inventory. If set, avoiding the call
1077 * to save cpu time. 1084 * to save cpu time.
1078 */ 1085 */
1079 if ((otmp = is_player_inv (op->env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 1086 if (pl)
1080 fix_player (otmp); 1087 if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
1088 {
1089 pl->update_stats ();
1081 1090
1082 if (op->above != NULL) 1091 if (glow_radius && pl->is_on_map ())
1083 op->above->below = op->below; 1092 update_all_los (pl->map, pl->x, pl->y);
1084 else 1093 }
1085 op->env->inv = op->below;
1086
1087 if (op->below != NULL)
1088 op->below->above = op->above;
1089
1090 /* we set up values so that it could be inserted into
1091 * the map, but we don't actually do that - it is up
1092 * to the caller to decide what we want to do.
1093 */
1094 op->x = op->env->x, op->y = op->env->y;
1095 op->map = op->env->map;
1096 op->above = NULL, op->below = NULL;
1097 op->env = NULL;
1098 } 1094 }
1099 else if (op->map) 1095 else if (map)
1100 { 1096 {
1101 x = op->x; 1097 map->dirty = true;
1102 y = op->y; 1098 mapspace &ms = this->ms ();
1103 m = get_map_from_coord (op->map, &x, &y);
1104 1099
1105 if (!m) 1100 if (object *pl = ms.player ())
1106 { 1101 {
1107 LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n", 1102 if (is_player ())
1108 op->map->path, op->x, op->y);
1109 /* in old days, we used to set x and y to 0 and continue.
1110 * it seems if we get into this case, something is probablye
1111 * screwed up and should be fixed.
1112 */ 1103 {
1113 abort (); 1104 if (!flag [FLAG_WIZPASS])
1105 ms.smell = ++mapspace::smellcount; // remember the smell of the player
1106
1107 // leaving a spot always closes any open container on the ground
1108 if (container && !container->env)
1109 // this causes spurious floorbox updates, but it ensures
1110 // that the CLOSE event is being sent.
1111 close_container ();
1112
1113 --map->players;
1114 map->touch ();
1115 }
1116 else if (pl->container == this)
1117 {
1118 // removing a container should close it
1119 close_container ();
1120 }
1121
1122 esrv_del_item (pl->contr, count);
1114 } 1123 }
1115 1124
1116 if (op->map != m)
1117 LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1118 op->map->path, m->path, op->x, op->y, x, y);
1119
1120 /* Re did the following section of code - it looks like it had
1121 * lots of logic for things we no longer care about
1122 */
1123
1124 /* link the object above us */ 1125 /* link the object above us */
1125 if (op->above) 1126 // re-link, make sure compiler can easily use cmove
1126 op->above->below = op->below; 1127 *(above ? &above->below : &ms.top) = below;
1127 else 1128 *(below ? &below->above : &ms.bot) = above;
1128 SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */
1129 1129
1130 /* Relink the object below us, if there is one */ 1130 above = 0;
1131 if (op->below) 1131 below = 0;
1132 op->below->above = op->above; 1132
1133 else 1133 ms.invalidate ();
1134
1135 if (map->in_memory == MAP_SAVING)
1136 return;
1137
1138 int check_walk_off = !flag [FLAG_NO_APPLY];
1139
1140 if (object *pl = ms.player ())
1134 { 1141 {
1135 /* Nothing below, which means we need to relink map object for this space 1142 if (pl->container == this)
1136 * use translated coordinates in case some oddness with map tiling is 1143 /* If a container that the player is currently using somehow gets
1137 * evident 1144 * removed (most likely destroyed), update the player view
1145 * appropriately.
1138 */ 1146 */
1139 if (GET_MAP_OB (m, x, y) != op) 1147 pl->close_container ();
1140 {
1141 dump_object (op);
1142 LOG (llevError,
1143 "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", errmsg);
1144 dump_object (GET_MAP_OB (m, x, y));
1145 LOG (llevError, "%s\n", errmsg);
1146 }
1147 1148
1148 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ 1149 //TODO: the floorbox prev/next might need updating
1150 //esrv_del_item (pl->contr, count);
1151 //TODO: update floorbox to preserve ordering
1152 if (pl->contr->ns)
1153 pl->contr->ns->floorbox_update ();
1149 } 1154 }
1150 1155
1151 op->above = 0; 1156 for (tmp = ms.bot; tmp; tmp = tmp->above)
1152 op->below = 0;
1153
1154 if (op->map->in_memory == MAP_SAVING)
1155 return;
1156
1157 tag = op->count;
1158 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1159
1160 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1161 { 1157 {
1162 /* No point updating the players look faces if he is the object 1158 /* No point updating the players look faces if he is the object
1163 * being removed. 1159 * being removed.
1164 */ 1160 */
1165 1161
1166 if (tmp->type == PLAYER && tmp != op) 1162 /* See if object moving off should effect something */
1163 if (check_walk_off
1164 && ((move_type & tmp->move_off)
1165 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1167 { 1166 {
1168 /* If a container that the player is currently using somehow gets 1167 move_apply (tmp, this, 0);
1169 * removed (most likely destroyed), update the player view
1170 * appropriately.
1171 */
1172 if (tmp->container == op)
1173 {
1174 CLEAR_FLAG (op, FLAG_APPLIED);
1175 tmp->container = NULL;
1176 }
1177 1168
1178 tmp->contr->socket.update_look = 1; 1169 if (destroyed ())
1170 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1179 } 1171 }
1180
1181 /* See if player moving off should effect something */
1182 if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1183 {
1184 move_apply (tmp, op, NULL);
1185
1186 if (was_destroyed (op, tag))
1187 {
1188 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name);
1189 }
1190 }
1191
1192 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1193
1194 if (tmp->above == tmp)
1195 tmp->above = NULL;
1196 1172
1197 last = tmp; 1173 last = tmp;
1198 } 1174 }
1199 1175
1200 /* last == NULL of there are no objects on this space */ 1176 if (affects_los ())
1201 if (last == NULL)
1202 {
1203 /* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1204 * we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1205 * those out anyways, and if there are any flags set right now, they won't
1206 * be correct anyways.
1207 */
1208 SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE);
1209 update_position (op->map, op->x, op->y);
1210 }
1211 else
1212 update_object (last, UP_OBJ_REMOVE);
1213
1214 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0))
1215 update_all_los (op->map, op->x, op->y); 1177 update_all_los (map, x, y);
1216 } 1178 }
1217} 1179}
1218 1180
1219/* 1181/*
1220 * merge_ob(op,top): 1182 * merge_ob(op,top):
… …
1222 * This function goes through all objects below and including top, and 1184 * This function goes through all objects below and including top, and
1223 * merges op to the first matching object. 1185 * merges op to the first matching object.
1224 * If top is NULL, it is calculated. 1186 * If top is NULL, it is calculated.
1225 * Returns pointer to object if it succeded in the merge, otherwise NULL 1187 * Returns pointer to object if it succeded in the merge, otherwise NULL
1226 */ 1188 */
1227
1228object * 1189object *
1229merge_ob (object *op, object *top) 1190merge_ob (object *op, object *top)
1230{ 1191{
1231 if (!op->nrof) 1192 if (!op->nrof)
1232 return 0; 1193 return 0;
1233 1194
1234 if (top == NULL) 1195 if (!top)
1235 for (top = op; top != NULL && top->above != NULL; top = top->above); 1196 for (top = op; top && top->above; top = top->above)
1197 ;
1236 1198
1237 for (; top != NULL; top = top->below) 1199 for (; top; top = top->below)
1238 { 1200 if (object::can_merge (op, top))
1239 if (top == op)
1240 continue;
1241 if (CAN_MERGE (op, top))
1242 { 1201 {
1243 top->nrof += op->nrof; 1202 top->nrof += op->nrof;
1244 1203
1245/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ 1204 if (object *pl = top->visible_to ())
1246 op->weight = 0; /* Don't want any adjustements now */ 1205 esrv_update_item (UPD_NROF, pl, top);
1247 remove_ob (op); 1206
1248 free_object (op); 1207 op->weight = 0; // cancel the addition above
1208 op->carrying = 0; // must be 0 already
1209
1210 op->destroy ();
1211
1249 return top; 1212 return top;
1250 } 1213 }
1251 }
1252 1214
1253 return NULL; 1215 return 0;
1254} 1216}
1255 1217
1218void
1219object::expand_tail ()
1220{
1221 if (more)
1222 return;
1223
1224 object *prev = this;
1225
1226 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1227 {
1228 object *op = arch_to_object (at);
1229
1230 op->name = name;
1231 op->name_pl = name_pl;
1232 op->title = title;
1233
1234 op->head = this;
1235 prev->more = op;
1236
1237 prev = op;
1238 }
1239}
1240
1256/* 1241/*
1257 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1242 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1258 * job preparing multi-part monsters 1243 * job preparing multi-part monsters.
1259 */ 1244 */
1260object * 1245object *
1261insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y) 1246insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1262{ 1247{
1263 object *tmp; 1248 op->remove ();
1264 1249
1265 if (op->head)
1266 op = op->head;
1267
1268 for (tmp = op; tmp; tmp = tmp->more) 1250 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1269 { 1251 {
1270 tmp->x = x + tmp->arch->clone.x; 1252 tmp->x = x + tmp->arch->x;
1271 tmp->y = y + tmp->arch->clone.y; 1253 tmp->y = y + tmp->arch->y;
1272 } 1254 }
1273 1255
1274 return insert_ob_in_map (op, m, originator, flag); 1256 return insert_ob_in_map (op, m, originator, flag);
1275} 1257}
1276 1258
… …
1292 * Return value: 1274 * Return value:
1293 * new object if 'op' was merged with other object 1275 * new object if 'op' was merged with other object
1294 * NULL if 'op' was destroyed 1276 * NULL if 'op' was destroyed
1295 * just 'op' otherwise 1277 * just 'op' otherwise
1296 */ 1278 */
1297
1298object * 1279object *
1299insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag) 1280insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1300{ 1281{
1301 object *tmp, *top, *floor = NULL; 1282 op->remove ();
1302 sint16 x, y;
1303 1283
1304 if (QUERY_FLAG (op, FLAG_FREED)) 1284 if (m == &freed_map)//D TODO: remove soon
1305 { 1285 {//D
1306 LOG (llevError, "Trying to insert freed object!\n"); 1286 LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
1307 return NULL;
1308 } 1287 }//D
1309
1310 if (m == NULL)
1311 {
1312 dump_object (op);
1313 LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg);
1314 return op;
1315 }
1316
1317 if (out_of_map (m, op->x, op->y))
1318 {
1319 dump_object (op);
1320 LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg);
1321#ifdef MANY_CORES
1322 /* Better to catch this here, as otherwise the next use of this object
1323 * is likely to cause a crash. Better to find out where it is getting
1324 * improperly inserted.
1325 */
1326 abort ();
1327#endif
1328 return op;
1329 }
1330
1331 if (!QUERY_FLAG (op, FLAG_REMOVED))
1332 {
1333 dump_object (op);
1334 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg);
1335 return op;
1336 }
1337
1338 if (op->more != NULL)
1339 {
1340 /* The part may be on a different map. */
1341
1342 object *more = op->more;
1343
1344 /* We really need the caller to normalize coordinates - if
1345 * we set the map, that doesn't work if the location is within
1346 * a map and this is straddling an edge. So only if coordinate
1347 * is clear wrong do we normalize it.
1348 */
1349 if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1350 more->map = get_map_from_coord (m, &more->x, &more->y);
1351 else if (!more->map)
1352 {
1353 /* For backwards compatibility - when not dealing with tiled maps,
1354 * more->map should always point to the parent.
1355 */
1356 more->map = m;
1357 }
1358
1359 if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1360 {
1361 if (!op->head)
1362 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1363
1364 return NULL;
1365 }
1366 }
1367
1368 CLEAR_FLAG (op, FLAG_REMOVED);
1369 1288
1370 /* Ideally, the caller figures this out. However, it complicates a lot 1289 /* Ideally, the caller figures this out. However, it complicates a lot
1371 * of areas of callers (eg, anything that uses find_free_spot would now 1290 * of areas of callers (eg, anything that uses find_free_spot would now
1372 * need extra work 1291 * need extra work
1373 */ 1292 */
1374 op->map = get_map_from_coord (m, &op->x, &op->y); 1293 maptile *newmap = m;
1375 x = op->x; 1294 if (!xy_normalise (newmap, op->x, op->y))
1376 y = op->y; 1295 {
1296 op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1297 return 0;
1298 }
1299
1300 if (object *more = op->more)
1301 if (!insert_ob_in_map (more, m, originator, flag))
1302 return 0;
1303
1304 op->flag [FLAG_REMOVED] = false;
1305 op->env = 0;
1306 op->map = newmap;
1307
1308 mapspace &ms = op->ms ();
1377 1309
1378 /* this has to be done after we translate the coordinates. 1310 /* this has to be done after we translate the coordinates.
1379 */ 1311 */
1380 if (op->nrof && !(flag & INS_NO_MERGE)) 1312 if (op->nrof && !(flag & INS_NO_MERGE))
1381 for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) 1313 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1382 if (CAN_MERGE (op, tmp)) 1314 if (object::can_merge (op, tmp))
1383 { 1315 {
1316 // TODO: we actually want to update tmp, not op,
1317 // but some caller surely breaks when we return tmp
1318 // from here :/
1384 op->nrof += tmp->nrof; 1319 op->nrof += tmp->nrof;
1385 remove_ob (tmp); 1320 tmp->destroy ();
1386 free_object (tmp);
1387 } 1321 }
1388 1322
1389 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ 1323 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1390 CLEAR_FLAG (op, FLAG_INV_LOCKED); 1324 CLEAR_FLAG (op, FLAG_INV_LOCKED);
1391 1325
… …
1398 { 1332 {
1399 LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); 1333 LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1400 abort (); 1334 abort ();
1401 } 1335 }
1402 1336
1337 if (!originator->is_on_map ())
1338 {
1339 LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
1340 op->debug_desc (), originator->debug_desc ());
1341 abort ();
1342 }
1343
1403 op->above = originator; 1344 op->above = originator;
1404 op->below = originator->below; 1345 op->below = originator->below;
1405
1406 if (op->below)
1407 op->below->above = op;
1408 else
1409 SET_MAP_OB (op->map, op->x, op->y, op);
1410
1411 /* since *below* originator, no need to update top */
1412 originator->below = op; 1346 originator->below = op;
1347
1348 *(op->below ? &op->below->above : &ms.bot) = op;
1413 } 1349 }
1414 else 1350 else
1415 { 1351 {
1352 object *floor = 0;
1353 object *top = ms.top;
1354
1416 /* If there are other objects, then */ 1355 /* If there are other objects, then */
1417 if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) 1356 if (top)
1418 { 1357 {
1419 object *last = NULL;
1420
1421 /* 1358 /*
1422 * If there are multiple objects on this space, we do some trickier handling. 1359 * If there are multiple objects on this space, we do some trickier handling.
1423 * We've already dealt with merging if appropriate. 1360 * We've already dealt with merging if appropriate.
1424 * Generally, we want to put the new object on top. But if 1361 * Generally, we want to put the new object on top. But if
1425 * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last 1362 * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
… …
1428 * once we get to them. This reduces the need to traverse over all of 1365 * once we get to them. This reduces the need to traverse over all of
1429 * them when adding another one - this saves quite a bit of cpu time 1366 * them when adding another one - this saves quite a bit of cpu time
1430 * when lots of spells are cast in one area. Currently, it is presumed 1367 * when lots of spells are cast in one area. Currently, it is presumed
1431 * that flying non pickable objects are spell objects. 1368 * that flying non pickable objects are spell objects.
1432 */ 1369 */
1433 1370 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1434 while (top != NULL)
1435 { 1371 {
1436 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) 1372 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1437 floor = top; 1373 floor = tmp;
1438 1374
1439 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) 1375 if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1440 { 1376 {
1441 /* We insert above top, so we want this object below this */ 1377 /* We insert above top, so we want this object below this */
1442 top = top->below; 1378 top = tmp->below;
1443 break; 1379 break;
1444 } 1380 }
1445 1381
1446 last = top;
1447 top = top->above; 1382 top = tmp;
1448 } 1383 }
1449
1450 /* Don't want top to be NULL, so set it to the last valid object */
1451 top = last;
1452 1384
1453 /* We let update_position deal with figuring out what the space 1385 /* We let update_position deal with figuring out what the space
1454 * looks like instead of lots of conditions here. 1386 * looks like instead of lots of conditions here.
1455 * makes things faster, and effectively the same result. 1387 * makes things faster, and effectively the same result.
1456 */ 1388 */
1457 1389
1458 /* Have object 'fall below' other objects that block view. 1390 /* Have object 'fall below' other objects that block view.
1459 * Unless those objects are exits, type 66 1391 * Unless those objects are exits.
1460 * If INS_ON_TOP is used, don't do this processing 1392 * If INS_ON_TOP is used, don't do this processing
1461 * Need to find the object that in fact blocks view, otherwise 1393 * Need to find the object that in fact blocks view, otherwise
1462 * stacking is a bit odd. 1394 * stacking is a bit odd.
1463 */ 1395 */
1464 if (!(flag & INS_ON_TOP) && 1396 if (!(flag & INS_ON_TOP)
1465 (get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) 1397 && ms.flags () & P_BLOCKSVIEW
1398 && (op->face && !faces [op->face].visibility))
1466 { 1399 {
1400 object *last;
1401
1467 for (last = top; last != floor; last = last->below) 1402 for (last = top; last != floor; last = last->below)
1468 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1403 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1469 break; 1404 break;
1405
1470 /* Check to see if we found the object that blocks view, 1406 /* Check to see if we found the object that blocks view,
1471 * and make sure we have a below pointer for it so that 1407 * and make sure we have a below pointer for it so that
1472 * we can get inserted below this one, which requires we 1408 * we can get inserted below this one, which requires we
1473 * set top to the object below us. 1409 * set top to the object below us.
1474 */ 1410 */
1475 if (last && last->below && last != floor) 1411 if (last && last->below && last != floor)
1476 top = last->below; 1412 top = last->below;
1477 } 1413 }
1478 } /* If objects on this space */ 1414 } /* If objects on this space */
1479 1415
1480 if (flag & INS_MAP_LOAD)
1481 top = GET_MAP_TOP (op->map, op->x, op->y);
1482
1483 if (flag & INS_ABOVE_FLOOR_ONLY) 1416 if (flag & INS_ABOVE_FLOOR_ONLY)
1484 top = floor; 1417 top = floor;
1485 1418
1486 /* Top is the object that our object (op) is going to get inserted above. 1419 // insert object above top, or bottom-most if top = 0
1487 */
1488
1489 /* First object on this space */
1490 if (!top) 1420 if (!top)
1491 { 1421 {
1492 op->above = GET_MAP_OB (op->map, op->x, op->y);
1493
1494 if (op->above)
1495 op->above->below = op;
1496
1497 op->below = NULL; 1422 op->below = 0;
1498 SET_MAP_OB (op->map, op->x, op->y, op); 1423 op->above = ms.bot;
1424 ms.bot = op;
1425
1426 *(op->above ? &op->above->below : &ms.top) = op;
1499 } 1427 }
1500 else 1428 else
1501 { /* get inserted into the stack above top */ 1429 {
1502 op->above = top->above; 1430 op->above = top->above;
1503
1504 if (op->above)
1505 op->above->below = op; 1431 top->above = op;
1506 1432
1507 op->below = top; 1433 op->below = top;
1508 top->above = op; 1434 *(op->above ? &op->above->below : &ms.top) = op;
1509 } 1435 }
1436 }
1510 1437
1511 if (op->above == NULL) 1438 if (op->is_player ())
1512 SET_MAP_TOP (op->map, op->x, op->y, op); 1439 {
1513 } /* else not INS_BELOW_ORIGINATOR */
1514
1515 if (op->type == PLAYER)
1516 op->contr->do_los = 1; 1440 op->contr->do_los = 1;
1441 ++op->map->players;
1442 op->map->touch ();
1443 }
1517 1444
1518 /* If we have a floor, we know the player, if any, will be above 1445 op->map->dirty = true;
1519 * it, so save a few ticks and start from there. 1446
1520 */ 1447 if (object *pl = ms.player ())
1521 if (!(flag & INS_MAP_LOAD)) 1448 //TODO: the floorbox prev/next might need updating
1522 for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1449 //esrv_send_item (pl, op);
1523 if (tmp->type == PLAYER) 1450 //TODO: update floorbox to preserve ordering
1524 tmp->contr->socket.update_look = 1; 1451 if (pl->contr->ns)
1452 pl->contr->ns->floorbox_update ();
1525 1453
1526 /* If this object glows, it may affect lighting conditions that are 1454 /* If this object glows, it may affect lighting conditions that are
1527 * visible to others on this map. But update_all_los is really 1455 * visible to others on this map. But update_all_los is really
1528 * an inefficient way to do this, as it means los for all players 1456 * an inefficient way to do this, as it means los for all players
1529 * on the map will get recalculated. The players could very well 1457 * on the map will get recalculated. The players could very well
1530 * be far away from this change and not affected in any way - 1458 * be far away from this change and not affected in any way -
1531 * this should get redone to only look for players within range, 1459 * this should get redone to only look for players within range,
1532 * or just updating the P_NEED_UPDATE for spaces within this area 1460 * or just updating the P_UPTODATE for spaces within this area
1533 * of effect may be sufficient. 1461 * of effect may be sufficient.
1534 */ 1462 */
1535 if (MAP_DARKNESS (op->map) && (op->glow_radius != 0)) 1463 if (op->affects_los ())
1464 {
1465 op->ms ().invalidate ();
1536 update_all_los (op->map, op->x, op->y); 1466 update_all_los (op->map, op->x, op->y);
1467 }
1537 1468
1538 /* updates flags (blocked, alive, no magic, etc) for this map space */ 1469 /* updates flags (blocked, alive, no magic, etc) for this map space */
1539 update_object (op, UP_OBJ_INSERT); 1470 update_object (op, UP_OBJ_INSERT);
1540 1471
1472 INVOKE_OBJECT (INSERT, op);
1473
1541 /* Don't know if moving this to the end will break anything. However, 1474 /* Don't know if moving this to the end will break anything. However,
1542 * we want to have update_look set above before calling this. 1475 * we want to have floorbox_update called before calling this.
1543 * 1476 *
1544 * check_move_on() must be after this because code called from 1477 * check_move_on() must be after this because code called from
1545 * check_move_on() depends on correct map flags (so functions like 1478 * check_move_on() depends on correct map flags (so functions like
1546 * blocked() and wall() work properly), and these flags are updated by 1479 * blocked() and wall() work properly), and these flags are updated by
1547 * update_object(). 1480 * update_object().
1548 */ 1481 */
1549 1482
1550 /* if this is not the head or flag has been passed, don't check walk on status */ 1483 /* if this is not the head or flag has been passed, don't check walk on status */
1551 if (!(flag & INS_NO_WALK_ON) && !op->head) 1484 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1552 { 1485 {
1553 if (check_move_on (op, originator)) 1486 if (check_move_on (op, originator))
1554 return NULL; 1487 return 0;
1555 1488
1556 /* If we are a multi part object, lets work our way through the check 1489 /* If we are a multi part object, lets work our way through the check
1557 * walk on's. 1490 * walk on's.
1558 */ 1491 */
1559 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1492 for (object *tmp = op->more; tmp; tmp = tmp->more)
1560 if (check_move_on (tmp, originator)) 1493 if (check_move_on (tmp, originator))
1561 return NULL; 1494 return 0;
1562 } 1495 }
1563 1496
1564 return op; 1497 return op;
1565} 1498}
1566 1499
1567/* this function inserts an object in the map, but if it 1500/* this function inserts an object in the map, but if it
1568 * finds an object of its own type, it'll remove that one first. 1501 * finds an object of its own type, it'll remove that one first.
1569 * op is the object to insert it under: supplies x and the map. 1502 * op is the object to insert it under: supplies x and the map.
1570 */ 1503 */
1571void 1504void
1572replace_insert_ob_in_map (const char *arch_string, object *op) 1505replace_insert_ob_in_map (shstr_tmp archname, object *op)
1573{ 1506{
1574 object *
1575 tmp;
1576 object *
1577 tmp1;
1578
1579 /* first search for itself and remove any old instances */ 1507 /* first search for itself and remove any old instances */
1580 1508
1581 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1509 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1582 {
1583 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1510 if (tmp->arch->archname == archname) /* same archetype */
1584 { 1511 tmp->destroy ();
1585 remove_ob (tmp);
1586 free_object (tmp);
1587 }
1588 }
1589 1512
1590 tmp1 = arch_to_object (find_archetype (arch_string)); 1513 object *tmp = arch_to_object (archetype::find (archname));
1591 1514
1592 tmp1->x = op->x; 1515 tmp->x = op->x;
1593 tmp1->y = op->y; 1516 tmp->y = op->y;
1517
1594 insert_ob_in_map (tmp1, op->map, op, 0); 1518 insert_ob_in_map (tmp, op->map, op, 0);
1595} 1519}
1596
1597/*
1598 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1599 * is returned contains nr objects, and the remaining parts contains
1600 * the rest (or is removed and freed if that number is 0).
1601 * On failure, NULL is returned, and the reason put into the
1602 * global static errmsg array.
1603 */
1604 1520
1605object * 1521object *
1606get_split_ob (object *orig_ob, uint32 nr) 1522object::insert_at (object *where, object *originator, int flags)
1607{ 1523{
1608 object * 1524 if (where->env)
1609 newob; 1525 return where->env->insert (this);
1610 int 1526 else
1611 is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); 1527 return where->map->insert (this, where->x, where->y, originator, flags);
1612
1613 if (orig_ob->nrof < nr)
1614 {
1615 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1616 return NULL;
1617 }
1618
1619 newob = object_create_clone (orig_ob);
1620
1621 if ((orig_ob->nrof -= nr) < 1)
1622 {
1623 if (!is_removed)
1624 remove_ob (orig_ob);
1625 free_object2 (orig_ob, 1);
1626 }
1627 else if (!is_removed)
1628 {
1629 if (orig_ob->env != NULL)
1630 sub_weight (orig_ob->env, orig_ob->weight * nr);
1631 if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1632 {
1633 strcpy (errmsg, "Tried to split object whose map is not in memory.");
1634 LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1635 return NULL;
1636 }
1637 }
1638
1639 newob->nrof = nr;
1640
1641 return newob;
1642} 1528}
1643 1529
1644/* 1530/*
1645 * decrease_ob_nr(object, number) decreases a specified number from 1531 * decrease(object, number) decreases a specified number from
1646 * the amount of an object. If the amount reaches 0, the object 1532 * the amount of an object. If the amount reaches 0, the object
1647 * is subsequently removed and freed. 1533 * is subsequently removed and freed.
1648 * 1534 *
1649 * Return value: 'op' if something is left, NULL if the amount reached 0 1535 * Return value: 'op' if something is left, NULL if the amount reached 0
1650 */ 1536 */
1537bool
1538object::decrease (sint32 nr)
1539{
1540 if (!nr)
1541 return true;
1651 1542
1543 nr = min (nr, nrof);
1544
1545 if (nrof > nr)
1546 {
1547 nrof -= nr;
1548 adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1549
1550 if (object *pl = visible_to ())
1551 esrv_update_item (UPD_NROF, pl, this);
1552
1553 return true;
1554 }
1555 else
1556 {
1557 destroy ();
1558 return false;
1559 }
1560}
1561
1562/*
1563 * split(ob,nr) splits up ob into two parts. The part which
1564 * is returned contains nr objects, and the remaining parts contains
1565 * the rest (or is removed and returned if that number is 0).
1566 * On failure, NULL is returned.
1567 */
1652object * 1568object *
1653decrease_ob_nr (object *op, uint32 i) 1569object::split (sint32 nr)
1654{ 1570{
1655 object *tmp; 1571 int have = number_of ();
1656 player *pl;
1657 1572
1658 if (i == 0) /* objects with op->nrof require this check */ 1573 if (have < nr)
1659 return op; 1574 return 0;
1660 1575 else if (have == nr)
1661 if (i > op->nrof)
1662 i = op->nrof;
1663
1664 if (QUERY_FLAG (op, FLAG_REMOVED))
1665 op->nrof -= i;
1666 else if (op->env != NULL)
1667 { 1576 {
1668 /* is this object in the players inventory, or sub container
1669 * therein?
1670 */
1671 tmp = is_player_inv (op->env);
1672 /* nope. Is this a container the player has opened?
1673 * If so, set tmp to that player.
1674 * IMO, searching through all the players will mostly
1675 * likely be quicker than following op->env to the map,
1676 * and then searching the map for a player.
1677 */
1678 if (!tmp)
1679 {
1680 for (pl = first_player; pl; pl = pl->next)
1681 if (pl->ob->container == op->env)
1682 break;
1683 if (pl)
1684 tmp = pl->ob;
1685 else
1686 tmp = NULL;
1687 }
1688
1689 if (i < op->nrof)
1690 {
1691 sub_weight (op->env, op->weight * i);
1692 op->nrof -= i;
1693 if (tmp)
1694 {
1695 esrv_send_item (tmp, op);
1696 }
1697 }
1698 else
1699 {
1700 remove_ob (op); 1577 remove ();
1701 op->nrof = 0; 1578 return this;
1702 if (tmp)
1703 {
1704 esrv_del_item (tmp->contr, op->count);
1705 }
1706 }
1707 } 1579 }
1708 else 1580 else
1709 { 1581 {
1710 object *above = op->above; 1582 decrease (nr);
1711 1583
1712 if (i < op->nrof) 1584 object *op = deep_clone ();
1713 op->nrof -= i; 1585 op->nrof = nr;
1714 else
1715 {
1716 remove_ob (op);
1717 op->nrof = 0;
1718 }
1719
1720 /* Since we just removed op, op->above is null */
1721 for (tmp = above; tmp != NULL; tmp = tmp->above)
1722 if (tmp->type == PLAYER)
1723 {
1724 if (op->nrof)
1725 esrv_send_item (tmp, op);
1726 else
1727 esrv_del_item (tmp->contr, op->count);
1728 }
1729 }
1730
1731 if (op->nrof)
1732 return op; 1586 return op;
1733 else
1734 { 1587 }
1735 free_object (op); 1588}
1589
1590object *
1591insert_ob_in_ob (object *op, object *where)
1592{
1593 if (!where)
1594 {
1595 char *dump = dump_object (op);
1596 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1597 free (dump);
1736 return NULL; 1598 return op;
1737 }
1738}
1739
1740/*
1741 * add_weight(object, weight) adds the specified weight to an object,
1742 * and also updates how much the environment(s) is/are carrying.
1743 */
1744
1745void
1746add_weight (object *op, signed long weight)
1747{
1748 while (op != NULL)
1749 { 1599 }
1750 if (op->type == CONTAINER)
1751 weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1752 1600
1753 op->carrying += weight; 1601 if (where->head_ () != where)
1754 op = op->env;
1755 } 1602 {
1756} 1603 LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1604 where = where->head;
1605 }
1757 1606
1607 return where->insert (op);
1608}
1609
1758/* 1610/*
1759 * insert_ob_in_ob(op,environment): 1611 * env->insert (op)
1760 * This function inserts the object op in the linked list 1612 * This function inserts the object op in the linked list
1761 * inside the object environment. 1613 * inside the object environment.
1762 * 1614 *
1763 * Eneq(@csd.uu.se): Altered insert_ob_in_ob to make things picked up enter
1764 * the inventory at the last position or next to other objects of the same
1765 * type.
1766 * Frank: Now sorted by type, archetype and magic!
1767 *
1768 * The function returns now pointer to inserted item, and return value can 1615 * The function returns now pointer to inserted item, and return value can
1769 * be != op, if items are merged. -Tero 1616 * be != op, if items are merged. -Tero
1770 */ 1617 */
1771
1772object * 1618object *
1773insert_ob_in_ob (object *op, object *where) 1619object::insert (object *op)
1774{ 1620{
1775 object *
1776 tmp, *
1777 otmp;
1778
1779 if (!QUERY_FLAG (op, FLAG_REMOVED))
1780 {
1781 dump_object (op);
1782 LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg);
1783 return op;
1784 }
1785
1786 if (where == NULL)
1787 {
1788 dump_object (op);
1789 LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg);
1790 return op;
1791 }
1792
1793 if (where->head)
1794 {
1795 LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n");
1796 where = where->head;
1797 }
1798
1799 if (op->more) 1621 if (op->more)
1800 { 1622 {
1801 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); 1623 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1802 return op; 1624 return op;
1803 } 1625 }
1804 1626
1805 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); 1627 op->remove ();
1806 CLEAR_FLAG (op, FLAG_REMOVED); 1628
1629 op->flag [FLAG_OBJ_ORIGINAL] = 0;
1630
1807 if (op->nrof) 1631 if (op->nrof)
1808 {
1809 for (tmp = where->inv; tmp != NULL; tmp = tmp->below) 1632 for (object *tmp = inv; tmp; tmp = tmp->below)
1810 if (CAN_MERGE (tmp, op)) 1633 if (object::can_merge (tmp, op))
1811 { 1634 {
1812 /* return the original object and remove inserted object 1635 /* return the original object and remove inserted object
1813 (client needs the original object) */ 1636 (client needs the original object) */
1814 tmp->nrof += op->nrof; 1637 tmp->nrof += op->nrof;
1815 /* Weight handling gets pretty funky. Since we are adding to 1638
1816 * tmp->nrof, we need to increase the weight. 1639 if (object *pl = tmp->visible_to ())
1817 */ 1640 esrv_update_item (UPD_NROF, pl, tmp);
1818 add_weight (where, op->weight * op->nrof); 1641
1819 SET_FLAG (op, FLAG_REMOVED); 1642 adjust_weight (this, op->total_weight ());
1820 free_object (op); /* free the inserted object */ 1643
1644 op->destroy ();
1821 op = tmp; 1645 op = tmp;
1822 remove_ob (op); /* and fix old object's links */ 1646 goto inserted;
1823 CLEAR_FLAG (op, FLAG_REMOVED);
1824 break;
1825 } 1647 }
1826 1648
1827 /* I assume combined objects have no inventory 1649 op->owner = 0; // it's his/hers now. period.
1828 * We add the weight - this object could have just been removed
1829 * (if it was possible to merge). calling remove_ob will subtract
1830 * the weight, so we need to add it in again, since we actually do
1831 * the linking below
1832 */
1833 add_weight (where, op->weight * op->nrof);
1834 }
1835 else
1836 add_weight (where, (op->weight + op->carrying));
1837
1838 otmp = is_player_inv (where);
1839 if (otmp && otmp->contr != NULL)
1840 {
1841 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1842 fix_player (otmp);
1843 }
1844
1845 op->map = NULL; 1650 op->map = 0;
1846 op->env = where; 1651 op->x = 0;
1652 op->y = 0;
1653
1847 op->above = NULL; 1654 op->above = 0;
1848 op->below = NULL; 1655 op->below = inv;
1849 op->x = 0, op->y = 0; 1656 op->env = this;
1850 1657
1658 if (inv)
1659 inv->above = op;
1660
1661 inv = op;
1662
1663 op->flag [FLAG_REMOVED] = 0;
1664
1665 if (object *pl = op->visible_to ())
1666 esrv_send_item (pl, op);
1667
1668 adjust_weight (this, op->total_weight ());
1669
1670inserted:
1851 /* reset the light list and los of the players on the map */ 1671 /* reset the light list and los of the players on the map */
1852 if ((op->glow_radius != 0) && where->map) 1672 if (op->glow_radius && is_on_map ())
1853 {
1854#ifdef DEBUG_LIGHTS
1855 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1856#endif /* DEBUG_LIGHTS */
1857 if (MAP_DARKNESS (where->map))
1858 update_all_los (where->map, where->x, where->y);
1859 } 1673 {
1860 1674 update_stats ();
1861 /* Client has no idea of ordering so lets not bother ordering it here. 1675 update_all_los (map, x, y);
1862 * It sure simplifies this function...
1863 */
1864 if (where->inv == NULL)
1865 where->inv = op;
1866 else
1867 { 1676 }
1868 op->below = where->inv; 1677 else if (is_player () && !flag [FLAG_NO_FIX_PLAYER])
1869 op->below->above = op; 1678 // if this is a player's inventory, update stats
1870 where->inv = op; 1679 update_stats ();
1871 } 1680
1681 INVOKE_OBJECT (INSERT, this);
1682
1872 return op; 1683 return op;
1873} 1684}
1874 1685
1875/* 1686/*
1876 * Checks if any objects has a move_type that matches objects 1687 * Checks if any objects has a move_type that matches objects
… …
1890 * 1701 *
1891 * MSW 2001-07-08: Check all objects on space, not just those below 1702 * MSW 2001-07-08: Check all objects on space, not just those below
1892 * object being inserted. insert_ob_in_map may not put new objects 1703 * object being inserted. insert_ob_in_map may not put new objects
1893 * on top. 1704 * on top.
1894 */ 1705 */
1895
1896int 1706int
1897check_move_on (object *op, object *originator) 1707check_move_on (object *op, object *originator)
1898{ 1708{
1899 object * 1709 object *tmp;
1900 tmp; 1710 maptile *m = op->map;
1901 tag_t
1902 tag;
1903 mapstruct *
1904 m = op->map;
1905 int
1906 x = op->x, y = op->y; 1711 int x = op->x, y = op->y;
1907 1712
1908 MoveType 1713 MoveType move_on, move_slow, move_block;
1909 move_on,
1910 move_slow,
1911 move_block;
1912 1714
1913 if (QUERY_FLAG (op, FLAG_NO_APPLY)) 1715 if (QUERY_FLAG (op, FLAG_NO_APPLY))
1914 return 0; 1716 return 0;
1915
1916 tag = op->count;
1917 1717
1918 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); 1718 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
1919 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); 1719 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
1920 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); 1720 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
1921 1721
… …
1937 1737
1938 /* The objects have to be checked from top to bottom. 1738 /* The objects have to be checked from top to bottom.
1939 * Hence, we first go to the top: 1739 * Hence, we first go to the top:
1940 */ 1740 */
1941 1741
1942 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above) 1742 for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1943 { 1743 {
1944 /* Trim the search when we find the first other spell effect 1744 /* Trim the search when we find the first other spell effect
1945 * this helps performance so that if a space has 50 spell objects, 1745 * this helps performance so that if a space has 50 spell objects,
1946 * we don't need to check all of them. 1746 * we don't need to check all of them.
1947 */ 1747 */
… …
1965 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1765 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1966 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) 1766 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1967 { 1767 {
1968 1768
1969 float 1769 float
1970 diff = tmp->move_slow_penalty * FABS (op->speed); 1770 diff = tmp->move_slow_penalty * fabs (op->speed);
1971 1771
1972 if (op->type == PLAYER) 1772 if (op->is_player ())
1973 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 1773 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1974 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) 1774 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1975 diff /= 4.0; 1775 diff /= 4.0;
1976 1776
1977 op->speed_left -= diff; 1777 op->speed_left -= diff;
… …
1982 if ((!op->move_type && tmp->move_on & MOVE_WALK) || 1782 if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
1983 ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) 1783 ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
1984 { 1784 {
1985 move_apply (tmp, op, originator); 1785 move_apply (tmp, op, originator);
1986 1786
1987 if (was_destroyed (op, tag)) 1787 if (op->destroyed ())
1988 return 1; 1788 return 1;
1989 1789
1990 /* what the person/creature stepped onto has moved the object 1790 /* what the person/creature stepped onto has moved the object
1991 * someplace new. Don't process any further - if we did, 1791 * someplace new. Don't process any further - if we did,
1992 * have a feeling strange problems would result. 1792 * have a feeling strange problems would result.
… …
2002/* 1802/*
2003 * present_arch(arch, map, x, y) searches for any objects with 1803 * present_arch(arch, map, x, y) searches for any objects with
2004 * a matching archetype at the given map and coordinates. 1804 * a matching archetype at the given map and coordinates.
2005 * The first matching object is returned, or NULL if none. 1805 * The first matching object is returned, or NULL if none.
2006 */ 1806 */
2007
2008object * 1807object *
2009present_arch (const archetype *at, mapstruct *m, int x, int y) 1808present_arch (const archetype *at, maptile *m, int x, int y)
2010{ 1809{
2011 object *
2012 tmp;
2013
2014 if (m == NULL || out_of_map (m, x, y)) 1810 if (!m || out_of_map (m, x, y))
2015 { 1811 {
2016 LOG (llevError, "Present_arch called outside map.\n"); 1812 LOG (llevError, "Present_arch called outside map.\n");
2017 return NULL; 1813 return NULL;
2018 } 1814 }
2019 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1815
2020 if (tmp->arch == at) 1816 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1817 if (tmp->arch->archname == at->archname)
2021 return tmp; 1818 return tmp;
1819
2022 return NULL; 1820 return NULL;
2023} 1821}
2024 1822
2025/* 1823/*
2026 * present(type, map, x, y) searches for any objects with 1824 * present(type, map, x, y) searches for any objects with
2027 * a matching type variable at the given map and coordinates. 1825 * a matching type variable at the given map and coordinates.
2028 * The first matching object is returned, or NULL if none. 1826 * The first matching object is returned, or NULL if none.
2029 */ 1827 */
2030
2031object * 1828object *
2032present (unsigned char type, mapstruct *m, int x, int y) 1829present (unsigned char type, maptile *m, int x, int y)
2033{ 1830{
2034 object *
2035 tmp;
2036
2037 if (out_of_map (m, x, y)) 1831 if (out_of_map (m, x, y))
2038 { 1832 {
2039 LOG (llevError, "Present called outside map.\n"); 1833 LOG (llevError, "Present called outside map.\n");
2040 return NULL; 1834 return NULL;
2041 } 1835 }
2042 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1836
1837 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
2043 if (tmp->type == type) 1838 if (tmp->type == type)
2044 return tmp; 1839 return tmp;
1840
2045 return NULL; 1841 return NULL;
2046} 1842}
2047 1843
2048/* 1844/*
2049 * present_in_ob(type, object) searches for any objects with 1845 * present_in_ob(type, object) searches for any objects with
2050 * a matching type variable in the inventory of the given object. 1846 * a matching type variable in the inventory of the given object.
2051 * The first matching object is returned, or NULL if none. 1847 * The first matching object is returned, or NULL if none.
2052 */ 1848 */
2053
2054object * 1849object *
2055present_in_ob (unsigned char type, const object *op) 1850present_in_ob (unsigned char type, const object *op)
2056{ 1851{
2057 object *
2058 tmp;
2059
2060 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1852 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2061 if (tmp->type == type) 1853 if (tmp->type == type)
2062 return tmp; 1854 return tmp;
1855
2063 return NULL; 1856 return NULL;
2064} 1857}
2065 1858
2066/* 1859/*
2067 * present_in_ob (type, str, object) searches for any objects with 1860 * present_in_ob (type, str, object) searches for any objects with
… …
2075 * str is the string to match against. Note that we match against 1868 * str is the string to match against. Note that we match against
2076 * the object name, not the archetype name. this is so that the 1869 * the object name, not the archetype name. this is so that the
2077 * spell code can use one object type (force), but change it's name 1870 * spell code can use one object type (force), but change it's name
2078 * to be unique. 1871 * to be unique.
2079 */ 1872 */
2080
2081object * 1873object *
2082present_in_ob_by_name (int type, const char *str, const object *op) 1874present_in_ob_by_name (int type, const char *str, const object *op)
2083{ 1875{
2084 object *
2085 tmp;
2086
2087 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1876 for (object *tmp = op->inv; tmp; tmp = tmp->below)
2088 {
2089 if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name))) 1877 if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2090 return tmp; 1878 return tmp;
2091 } 1879
2092 return NULL; 1880 return 0;
2093} 1881}
2094 1882
2095/* 1883/*
2096 * present_arch_in_ob(archetype, object) searches for any objects with 1884 * present_arch_in_ob(archetype, object) searches for any objects with
2097 * a matching archetype in the inventory of the given object. 1885 * a matching archetype in the inventory of the given object.
2098 * The first matching object is returned, or NULL if none. 1886 * The first matching object is returned, or NULL if none.
2099 */ 1887 */
2100
2101object * 1888object *
2102present_arch_in_ob (const archetype *at, const object *op) 1889present_arch_in_ob (const archetype *at, const object *op)
2103{ 1890{
2104 object *
2105 tmp;
2106
2107 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1891 for (object *tmp = op->inv; tmp; tmp = tmp->below)
2108 if (tmp->arch == at) 1892 if (tmp->arch->archname == at->archname)
2109 return tmp; 1893 return tmp;
1894
2110 return NULL; 1895 return NULL;
2111} 1896}
2112 1897
2113/* 1898/*
2114 * activate recursively a flag on an object inventory 1899 * activate recursively a flag on an object inventory
2115 */ 1900 */
2116void 1901void
2117flag_inv (object *op, int flag) 1902flag_inv (object *op, int flag)
2118{ 1903{
2119 object *
2120 tmp;
2121
2122 if (op->inv)
2123 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1904 for (object *tmp = op->inv; tmp; tmp = tmp->below)
2124 { 1905 {
2125 SET_FLAG (tmp, flag); 1906 SET_FLAG (tmp, flag);
2126 flag_inv (tmp, flag); 1907 flag_inv (tmp, flag);
2127 } 1908 }
2128} /* 1909}
1910
1911/*
2129 * desactivate recursively a flag on an object inventory 1912 * deactivate recursively a flag on an object inventory
2130 */ 1913 */
2131void 1914void
2132unflag_inv (object *op, int flag) 1915unflag_inv (object *op, int flag)
2133{ 1916{
2134 object *
2135 tmp;
2136
2137 if (op->inv)
2138 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1917 for (object *tmp = op->inv; tmp; tmp = tmp->below)
2139 { 1918 {
2140 CLEAR_FLAG (tmp, flag); 1919 CLEAR_FLAG (tmp, flag);
2141 unflag_inv (tmp, flag); 1920 unflag_inv (tmp, flag);
2142 } 1921 }
2143}
2144
2145/*
2146 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2147 * all it's inventory (recursively).
2148 * If checksums are used, a player will get set_cheat called for
2149 * him/her-self and all object carried by a call to this function.
2150 */
2151
2152void
2153set_cheat (object *op)
2154{
2155 SET_FLAG (op, FLAG_WAS_WIZ);
2156 flag_inv (op, FLAG_WAS_WIZ);
2157} 1922}
2158 1923
2159/* 1924/*
2160 * find_free_spot(object, map, x, y, start, stop) will search for 1925 * find_free_spot(object, map, x, y, start, stop) will search for
2161 * a spot at the given map and coordinates which will be able to contain 1926 * a spot at the given map and coordinates which will be able to contain
… …
2163 * to search (see the freearr_x/y[] definition). 1928 * to search (see the freearr_x/y[] definition).
2164 * It returns a random choice among the alternatives found. 1929 * It returns a random choice among the alternatives found.
2165 * start and stop are where to start relative to the free_arr array (1,9 1930 * start and stop are where to start relative to the free_arr array (1,9
2166 * does all 4 immediate directions). This returns the index into the 1931 * does all 4 immediate directions). This returns the index into the
2167 * array of the free spot, -1 if no spot available (dir 0 = x,y) 1932 * array of the free spot, -1 if no spot available (dir 0 = x,y)
2168 * Note - this only checks to see if there is space for the head of the
2169 * object - if it is a multispace object, this should be called for all
2170 * pieces.
2171 * Note2: This function does correctly handle tiled maps, but does not 1933 * Note: This function does correctly handle tiled maps, but does not
2172 * inform the caller. However, insert_ob_in_map will update as 1934 * inform the caller. However, insert_ob_in_map will update as
2173 * necessary, so the caller shouldn't need to do any special work. 1935 * necessary, so the caller shouldn't need to do any special work.
2174 * Note - updated to take an object instead of archetype - this is necessary 1936 * Note - updated to take an object instead of archetype - this is necessary
2175 * because arch_blocked (now ob_blocked) needs to know the movement type 1937 * because arch_blocked (now ob_blocked) needs to know the movement type
2176 * to know if the space in question will block the object. We can't use 1938 * to know if the space in question will block the object. We can't use
2177 * the archetype because that isn't correct if the monster has been 1939 * the archetype because that isn't correct if the monster has been
2178 * customized, changed states, etc. 1940 * customized, changed states, etc.
2179 */ 1941 */
2180
2181int 1942int
2182find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop) 1943find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2183{ 1944{
2184 int
2185 i,
2186 index = 0, flag;
2187 static int
2188 altern[SIZEOFFREE]; 1945 int altern[SIZEOFFREE];
1946 int index = 0, flag;
2189 1947
2190 for (i = start; i < stop; i++) 1948 for (int i = start; i < stop; i++)
2191 { 1949 {
2192 flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); 1950 mapxy pos (m, x, y); pos.move (i);
2193 if (!flag) 1951
1952 if (!pos.normalise ())
1953 continue;
1954
1955 mapspace &ms = *pos;
1956
1957 if (ms.flags () & P_IS_ALIVE)
1958 continue;
1959
1960 /* However, often
1961 * ob doesn't have any move type (when used to place exits)
1962 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
1963 */
1964 if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
1965 {
2194 altern[index++] = i; 1966 altern [index++] = i;
1967 continue;
1968 }
2195 1969
2196 /* Basically, if we find a wall on a space, we cut down the search size. 1970 /* Basically, if we find a wall on a space, we cut down the search size.
2197 * In this way, we won't return spaces that are on another side of a wall. 1971 * In this way, we won't return spaces that are on another side of a wall.
2198 * This mostly work, but it cuts down the search size in all directions - 1972 * This mostly work, but it cuts down the search size in all directions -
2199 * if the space being examined only has a wall to the north and empty 1973 * if the space being examined only has a wall to the north and empty
2200 * spaces in all the other directions, this will reduce the search space 1974 * spaces in all the other directions, this will reduce the search space
2201 * to only the spaces immediately surrounding the target area, and 1975 * to only the spaces immediately surrounding the target area, and
2202 * won't look 2 spaces south of the target space. 1976 * won't look 2 spaces south of the target space.
2203 */ 1977 */
2204 else if ((flag & AB_NO_PASS) && maxfree[i] < stop) 1978 if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
1979 {
2205 stop = maxfree[i]; 1980 stop = maxfree[i];
1981 continue;
1982 }
1983
1984 /* Note it is intentional that we check ob - the movement type of the
1985 * head of the object should correspond for the entire object.
1986 */
1987 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
1988 continue;
1989
1990 if (ob->blocked (pos.m, pos.x, pos.y))
1991 continue;
1992
1993 altern [index++] = i;
2206 } 1994 }
1995
2207 if (!index) 1996 if (!index)
2208 return -1; 1997 return -1;
1998
2209 return altern[RANDOM () % index]; 1999 return altern [rndm (index)];
2210} 2000}
2211 2001
2212/* 2002/*
2213 * find_first_free_spot(archetype, mapstruct, x, y) works like 2003 * find_first_free_spot(archetype, maptile, x, y) works like
2214 * find_free_spot(), but it will search max number of squares. 2004 * find_free_spot(), but it will search max number of squares.
2215 * But it will return the first available spot, not a random choice. 2005 * But it will return the first available spot, not a random choice.
2216 * Changed 0.93.2: Have it return -1 if there is no free spot available. 2006 * Changed 0.93.2: Have it return -1 if there is no free spot available.
2217 */ 2007 */
2218
2219int 2008int
2220find_first_free_spot (const object *ob, mapstruct *m, int x, int y) 2009find_first_free_spot (const object *ob, maptile *m, int x, int y)
2221{ 2010{
2222 int
2223 i;
2224
2225 for (i = 0; i < SIZEOFFREE; i++) 2011 for (int i = 0; i < SIZEOFFREE; i++)
2226 {
2227 if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) 2012 if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2228 return i; 2013 return i;
2229 } 2014
2230 return -1; 2015 return -1;
2231} 2016}
2232 2017
2233/* 2018/*
2234 * The function permute(arr, begin, end) randomly reorders the array 2019 * The function permute(arr, begin, end) randomly reorders the array
2235 * arr[begin..end-1]. 2020 * arr[begin..end-1].
2021 * now uses a fisher-yates shuffle, old permute was broken
2236 */ 2022 */
2237static void 2023static void
2238permute (int *arr, int begin, int end) 2024permute (int *arr, int begin, int end)
2239{ 2025{
2240 int 2026 arr += begin;
2241 i,
2242 j,
2243 tmp,
2244 len;
2245
2246 len = end - begin; 2027 end -= begin;
2247 for (i = begin; i < end; i++)
2248 {
2249 j = begin + RANDOM () % len;
2250 2028
2251 tmp = arr[i]; 2029 while (--end)
2252 arr[i] = arr[j]; 2030 swap (arr [end], arr [rndm (end + 1)]);
2253 arr[j] = tmp;
2254 }
2255} 2031}
2256 2032
2257/* new function to make monster searching more efficient, and effective! 2033/* new function to make monster searching more efficient, and effective!
2258 * This basically returns a randomized array (in the passed pointer) of 2034 * This basically returns a randomized array (in the passed pointer) of
2259 * the spaces to find monsters. In this way, it won't always look for 2035 * the spaces to find monsters. In this way, it won't always look for
… …
2262 * the 3x3 area will be searched, just not in a predictable order. 2038 * the 3x3 area will be searched, just not in a predictable order.
2263 */ 2039 */
2264void 2040void
2265get_search_arr (int *search_arr) 2041get_search_arr (int *search_arr)
2266{ 2042{
2267 int 2043 int i;
2268 i;
2269 2044
2270 for (i = 0; i < SIZEOFFREE; i++) 2045 for (i = 0; i < SIZEOFFREE; i++)
2271 {
2272 search_arr[i] = i; 2046 search_arr[i] = i;
2273 }
2274 2047
2275 permute (search_arr, 1, SIZEOFFREE1 + 1); 2048 permute (search_arr, 1, SIZEOFFREE1 + 1);
2276 permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1); 2049 permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2277 permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE); 2050 permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2278} 2051}
… …
2287 * Perhaps incorrectly, but I'm making the assumption that exclude 2060 * Perhaps incorrectly, but I'm making the assumption that exclude
2288 * is actually want is going to try and move there. We need this info 2061 * is actually want is going to try and move there. We need this info
2289 * because we have to know what movement the thing looking to move 2062 * because we have to know what movement the thing looking to move
2290 * there is capable of. 2063 * there is capable of.
2291 */ 2064 */
2292
2293int 2065int
2294find_dir (mapstruct *m, int x, int y, object *exclude) 2066find_dir (maptile *m, int x, int y, object *exclude)
2295{ 2067{
2296 int
2297 i,
2298 max = SIZEOFFREE, mflags; 2068 int max = SIZEOFFREE, mflags;
2299
2300 sint16 nx, ny;
2301 object *
2302 tmp;
2303 mapstruct *
2304 mp;
2305
2306 MoveType blocked, move_type; 2069 MoveType move_type;
2307 2070
2308 if (exclude && exclude->head) 2071 if (exclude && exclude->head_ () != exclude)
2309 { 2072 {
2310 exclude = exclude->head; 2073 exclude = exclude->head;
2311 move_type = exclude->move_type; 2074 move_type = exclude->move_type;
2312 } 2075 }
2313 else 2076 else
2314 { 2077 {
2315 /* If we don't have anything, presume it can use all movement types. */ 2078 /* If we don't have anything, presume it can use all movement types. */
2316 move_type = MOVE_ALL; 2079 move_type = MOVE_ALL;
2317 } 2080 }
2318 2081
2319 for (i = 1; i < max; i++) 2082 for (int i = 1; i < max; i++)
2320 { 2083 {
2321 mp = m; 2084 mapxy pos (m, x, y);
2322 nx = x + freearr_x[i]; 2085 pos.move (i);
2323 ny = y + freearr_y[i];
2324 2086
2325 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); 2087 if (!pos.normalise ())
2326 if (mflags & P_OUT_OF_MAP)
2327 {
2328 max = maxfree[i]; 2088 max = maxfree[i];
2329 }
2330 else 2089 else
2331 { 2090 {
2332 blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny); 2091 mapspace &ms = *pos;
2333 2092
2334 if ((move_type & blocked) == move_type) 2093 if ((move_type & ms.move_block) == move_type)
2094 max = maxfree [i];
2095 else if (ms.flags () & P_IS_ALIVE)
2335 { 2096 {
2336 max = maxfree[i]; 2097 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2337 } 2098 if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2338 else if (mflags & P_IS_ALIVE) 2099 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2339 {
2340 for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above)
2341 {
2342 if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))
2343 {
2344 break;
2345 }
2346 }
2347 if (tmp)
2348 {
2349 return freedir[i]; 2100 return freedir [i];
2350 }
2351 } 2101 }
2352 } 2102 }
2353 } 2103 }
2104
2354 return 0; 2105 return 0;
2355} 2106}
2356 2107
2357/* 2108/*
2358 * distance(object 1, object 2) will return the square of the 2109 * distance(object 1, object 2) will return the square of the
2359 * distance between the two given objects. 2110 * distance between the two given objects.
2360 */ 2111 */
2361
2362int 2112int
2363distance (const object *ob1, const object *ob2) 2113distance (const object *ob1, const object *ob2)
2364{ 2114{
2365 int
2366 i;
2367
2368 i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); 2115 return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2369 return i;
2370} 2116}
2371 2117
2372/* 2118/*
2373 * find_dir_2(delta-x,delta-y) will return a direction in which 2119 * find_dir_2(delta-x,delta-y) will return a direction in which
2374 * an object which has subtracted the x and y coordinates of another 2120 * an object which has subtracted the x and y coordinates of another
2375 * object, needs to travel toward it. 2121 * object, needs to travel toward it.
2376 */ 2122 */
2377
2378int 2123int
2379find_dir_2 (int x, int y) 2124find_dir_2 (int x, int y)
2380{ 2125{
2381 int 2126 int q;
2382 q;
2383 2127
2384 if (y) 2128 if (y)
2385 q = x * 100 / y; 2129 q = x * 100 / y;
2386 else if (x) 2130 else if (x)
2387 q = -300 * x; 2131 q = -300 * x;
… …
2412 2156
2413 return 3; 2157 return 3;
2414} 2158}
2415 2159
2416/* 2160/*
2417 * absdir(int): Returns a number between 1 and 8, which represent
2418 * the "absolute" direction of a number (it actually takes care of
2419 * "overflow" in previous calculations of a direction).
2420 */
2421
2422int
2423absdir (int d)
2424{
2425 while (d < 1)
2426 d += 8;
2427 while (d > 8)
2428 d -= 8;
2429 return d;
2430}
2431
2432/*
2433 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is 2161 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2434 * between two directions (which are expected to be absolute (see absdir()) 2162 * between two directions (which are expected to be absolute (see absdir())
2435 */ 2163 */
2436
2437int 2164int
2438dirdiff (int dir1, int dir2) 2165dirdiff (int dir1, int dir2)
2439{ 2166{
2440 int 2167 int d;
2441 d;
2442 2168
2443 d = abs (dir1 - dir2); 2169 d = abs (dir1 - dir2);
2444 if (d > 4) 2170 if (d > 4)
2445 d = 8 - d; 2171 d = 8 - d;
2172
2446 return d; 2173 return d;
2447} 2174}
2448 2175
2449/* peterm: 2176/* peterm:
2450 * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. 2177 * do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
… …
2453 * This basically means that if direction is 15, then it could either go 2180 * This basically means that if direction is 15, then it could either go
2454 * direction 4, 14, or 16 to get back to where we are. 2181 * direction 4, 14, or 16 to get back to where we are.
2455 * Moved from spell_util.c to object.c with the other related direction 2182 * Moved from spell_util.c to object.c with the other related direction
2456 * functions. 2183 * functions.
2457 */ 2184 */
2458
2459int
2460 reduction_dir[SIZEOFFREE][3] = { 2185const int reduction_dir[SIZEOFFREE][3] = {
2461 {0, 0, 0}, /* 0 */ 2186 {0, 0, 0}, /* 0 */
2462 {0, 0, 0}, /* 1 */ 2187 {0, 0, 0}, /* 1 */
2463 {0, 0, 0}, /* 2 */ 2188 {0, 0, 0}, /* 2 */
2464 {0, 0, 0}, /* 3 */ 2189 {0, 0, 0}, /* 3 */
2465 {0, 0, 0}, /* 4 */ 2190 {0, 0, 0}, /* 4 */
… …
2513 * find a path to that monster that we found. If not, 2238 * find a path to that monster that we found. If not,
2514 * we don't bother going toward it. Returns 1 if we 2239 * we don't bother going toward it. Returns 1 if we
2515 * can see a direct way to get it 2240 * can see a direct way to get it
2516 * Modified to be map tile aware -.MSW 2241 * Modified to be map tile aware -.MSW
2517 */ 2242 */
2518
2519
2520int 2243int
2521can_see_monsterP (mapstruct *m, int x, int y, int dir) 2244can_see_monsterP (maptile *m, int x, int y, int dir)
2522{ 2245{
2523 sint16 dx, dy; 2246 sint16 dx, dy;
2524 int
2525 mflags; 2247 int mflags;
2526 2248
2527 if (dir < 0) 2249 if (dir < 0)
2528 return 0; /* exit condition: invalid direction */ 2250 return 0; /* exit condition: invalid direction */
2529 2251
2530 dx = x + freearr_x[dir]; 2252 dx = x + freearr_x[dir];
… …
2543 return 0; 2265 return 0;
2544 2266
2545 /* yes, can see. */ 2267 /* yes, can see. */
2546 if (dir < 9) 2268 if (dir < 9)
2547 return 1; 2269 return 1;
2270
2548 return can_see_monsterP (m, x, y, reduction_dir[dir][0]) | 2271 return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2549 can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]); 2272 | can_see_monsterP (m, x, y, reduction_dir[dir][1])
2273 | can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2550} 2274}
2551
2552
2553 2275
2554/* 2276/*
2555 * can_pick(picker, item): finds out if an object is possible to be 2277 * can_pick(picker, item): finds out if an object is possible to be
2556 * picked up by the picker. Returnes 1 if it can be 2278 * picked up by the picker. Returnes 1 if it can be
2557 * picked up, otherwise 0. 2279 * picked up, otherwise 0.
… …
2559 * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause 2281 * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2560 * core dumps if they do. 2282 * core dumps if they do.
2561 * 2283 *
2562 * Add a check so we can't pick up invisible objects (0.93.8) 2284 * Add a check so we can't pick up invisible objects (0.93.8)
2563 */ 2285 */
2564
2565int 2286int
2566can_pick (const object *who, const object *item) 2287can_pick (const object *who, const object *item)
2567{ 2288{
2568 return /*QUERY_FLAG(who,FLAG_WIZ)|| */ 2289 return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2569 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && 2290 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2570 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); 2291 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2571} 2292}
2572
2573 2293
2574/* 2294/*
2575 * create clone from object to another 2295 * create clone from object to another
2576 */ 2296 */
2577object * 2297object *
2578object_create_clone (object *asrc) 2298object::deep_clone ()
2579{ 2299{
2580 object * 2300 assert (("deep_clone called on non-head object", is_head ()));
2581 dst = NULL, *tmp, *src, *part, *prev, *item;
2582 2301
2583 if (!asrc) 2302 object *dst = clone ();
2584 return NULL;
2585 src = asrc;
2586 if (src->head)
2587 src = src->head;
2588 2303
2589 prev = NULL; 2304 object *prev = dst;
2590 for (part = src; part; part = part->more) 2305 for (object *part = this->more; part; part = part->more)
2591 { 2306 {
2592 tmp = get_object (); 2307 object *tmp = part->clone ();
2593 copy_object (part, tmp);
2594 tmp->x -= src->x;
2595 tmp->y -= src->y;
2596 if (!part->head)
2597 {
2598 dst = tmp;
2599 tmp->head = NULL;
2600 }
2601 else
2602 {
2603 tmp->head = dst; 2308 tmp->head = dst;
2604 }
2605 tmp->more = NULL;
2606 if (prev)
2607 prev->more = tmp; 2309 prev->more = tmp;
2608 prev = tmp; 2310 prev = tmp;
2609 } 2311 }
2610 2312
2611 /*** copy inventory ***/
2612 for (item = src->inv; item; item = item->below) 2313 for (object *item = inv; item; item = item->below)
2613 { 2314 insert_ob_in_ob (item->deep_clone (), dst);
2614 (void) insert_ob_in_ob (object_create_clone (item), dst);
2615 }
2616 2315
2617 return dst; 2316 return dst;
2618}
2619
2620/* return true if the object was destroyed, 0 otherwise */
2621int
2622was_destroyed (const object *op, tag_t old_tag)
2623{
2624 /* checking for FLAG_FREED isn't necessary, but makes this function more
2625 * robust */
2626 return op->count != old_tag || QUERY_FLAG (op, FLAG_FREED);
2627}
2628
2629/* GROS - Creates an object using a string representing its content. */
2630
2631/* Basically, we save the content of the string to a temp file, then call */
2632
2633/* load_object on it. I admit it is a highly inefficient way to make things, */
2634
2635/* but it was simple to make and allows reusing the load_object function. */
2636
2637/* Remember not to use load_object_str in a time-critical situation. */
2638
2639/* Also remember that multiparts objects are not supported for now. */
2640
2641object *
2642load_object_str (const char *obstr)
2643{
2644 object *
2645 op;
2646 char
2647 filename[MAX_BUF];
2648
2649 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2650
2651 FILE *
2652 tempfile = fopen (filename, "w");
2653
2654 if (tempfile == NULL)
2655 {
2656 LOG (llevError, "Error - Unable to access load object temp file\n");
2657 return NULL;
2658 };
2659 fprintf (tempfile, obstr);
2660 fclose (tempfile);
2661
2662 op = get_object ();
2663
2664 object_thawer thawer (filename);
2665
2666 if (thawer)
2667 load_object (thawer, op, 0);
2668
2669 LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2670 CLEAR_FLAG (op, FLAG_REMOVED);
2671
2672 return op;
2673} 2317}
2674 2318
2675/* This returns the first object in who's inventory that 2319/* This returns the first object in who's inventory that
2676 * has the same type and subtype match. 2320 * has the same type and subtype match.
2677 * returns NULL if no match. 2321 * returns NULL if no match.
2678 */ 2322 */
2679object * 2323object *
2680find_obj_by_type_subtype (const object *who, int type, int subtype) 2324find_obj_by_type_subtype (const object *who, int type, int subtype)
2681{ 2325{
2682 object *
2683 tmp;
2684
2685 for (tmp = who->inv; tmp; tmp = tmp->below) 2326 for (object *tmp = who->inv; tmp; tmp = tmp->below)
2686 if (tmp->type == type && tmp->subtype == subtype) 2327 if (tmp->type == type && tmp->subtype == subtype)
2687 return tmp; 2328 return tmp;
2688 2329
2689 return NULL; 2330 return 0;
2690} 2331}
2691 2332
2692/* If ob has a field named key, return the link from the list, 2333shstr_tmp
2693 * otherwise return NULL. 2334object::kv_get (shstr_tmp key) const
2694 *
2695 * key must be a passed in shared string - otherwise, this won't
2696 * do the desired thing.
2697 */
2698key_value *
2699get_ob_key_link (const object *ob, const char *key)
2700{ 2335{
2701 key_value * 2336 for (key_value *kv = key_values; kv; kv = kv->next)
2702 link;
2703
2704 for (link = ob->key_values; link != NULL; link = link->next)
2705 {
2706 if (link->key == key) 2337 if (kv->key == key)
2338 return kv->value;
2339
2340 return shstr ();
2341}
2342
2343void
2344object::kv_set (shstr_tmp key, shstr_tmp value)
2345{
2346 for (key_value *kv = key_values; kv; kv = kv->next)
2347 if (kv->key == key)
2707 { 2348 {
2349 kv->value = value;
2708 return link; 2350 return;
2709 } 2351 }
2710 }
2711 2352
2712 return NULL; 2353 key_value *kv = new key_value;
2713}
2714 2354
2715/* 2355 kv->next = key_values;
2716 * Returns the value of op has an extra_field for key, or NULL. 2356 kv->key = key;
2717 * 2357 kv->value = value;
2718 * The argument doesn't need to be a shared string.
2719 *
2720 * The returned string is shared.
2721 */
2722const char *
2723get_ob_key_value (const object *op, const char *const key)
2724{
2725 key_value *
2726 link;
2727 const char *
2728 canonical_key;
2729 2358
2730 canonical_key = shstr::find (key); 2359 key_values = kv;
2360}
2731 2361
2732 if (canonical_key == NULL) 2362void
2733 { 2363object::kv_del (shstr_tmp key)
2734 /* 1. There being a field named key on any object 2364{
2735 * implies there'd be a shared string to find. 2365 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
2736 * 2. Since there isn't, no object has this field. 2366 if ((*kvp)->key == key)
2737 * 3. Therefore, *this* object doesn't have this field.
2738 */
2739 return NULL;
2740 }
2741
2742 /* This is copied from get_ob_key_link() above -
2743 * only 4 lines, and saves the function call overhead.
2744 */
2745 for (link = op->key_values; link != NULL; link = link->next)
2746 {
2747 if (link->key == canonical_key)
2748 { 2367 {
2749 return link->value; 2368 key_value *kv = *kvp;
2369 *kvp = (*kvp)->next;
2370 delete kv;
2371 return;
2750 } 2372 }
2751 }
2752 return NULL;
2753}
2754
2755
2756/*
2757 * Updates the canonical_key in op to value.
2758 *
2759 * canonical_key is a shared string (value doesn't have to be).
2760 *
2761 * Unless add_key is TRUE, it won't add fields, only change the value of existing
2762 * keys.
2763 *
2764 * Returns TRUE on success.
2765 */
2766int
2767set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2768{
2769 key_value *
2770 field = NULL, *last = NULL;
2771
2772 for (field = op->key_values; field != NULL; field = field->next)
2773 {
2774 if (field->key != canonical_key)
2775 {
2776 last = field;
2777 continue;
2778 }
2779
2780 if (value)
2781 field->value = value;
2782 else
2783 {
2784 /* Basically, if the archetype has this key set,
2785 * we need to store the null value so when we save
2786 * it, we save the empty value so that when we load,
2787 * we get this value back again.
2788 */
2789 if (get_ob_key_link (&op->arch->clone, canonical_key))
2790 field->value = 0;
2791 else
2792 {
2793 if (last)
2794 last->next = field->next;
2795 else
2796 op->key_values = field->next;
2797
2798 delete field;
2799 }
2800 }
2801 return TRUE;
2802 }
2803 /* IF we get here, key doesn't exist */
2804
2805 /* No field, we'll have to add it. */
2806
2807 if (!add_key)
2808 {
2809 return FALSE;
2810 }
2811 /* There isn't any good reason to store a null
2812 * value in the key/value list. If the archetype has
2813 * this key, then we should also have it, so shouldn't
2814 * be here. If user wants to store empty strings,
2815 * should pass in ""
2816 */
2817 if (value == NULL)
2818 return TRUE;
2819
2820 field = new key_value;
2821
2822 field->key = canonical_key;
2823 field->value = value;
2824 /* Usual prepend-addition. */
2825 field->next = op->key_values;
2826 op->key_values = field;
2827
2828 return TRUE;
2829}
2830
2831/*
2832 * Updates the key in op to value.
2833 *
2834 * If add_key is FALSE, this will only update existing keys,
2835 * and not add new ones.
2836 * In general, should be little reason FALSE is ever passed in for add_key
2837 *
2838 * Returns TRUE on success.
2839 */
2840int
2841set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2842{
2843 shstr key_ (key);
2844
2845 return set_ob_key_value_s (op, key_, value, add_key);
2846} 2373}
2847 2374
2848object::depth_iterator::depth_iterator (object *container) 2375object::depth_iterator::depth_iterator (object *container)
2849: iterator_base (container) 2376: iterator_base (container)
2850{ 2377{
… …
2864 } 2391 }
2865 else 2392 else
2866 item = item->env; 2393 item = item->env;
2867} 2394}
2868 2395
2396const char *
2397object::flag_desc (char *desc, int len) const
2398{
2399 char *p = desc;
2400 bool first = true;
2401
2402 *p = 0;
2403
2404 for (int i = 0; i < NUM_FLAGS; i++)
2405 {
2406 if (len <= 10) // magic constant!
2407 {
2408 snprintf (p, len, ",...");
2409 break;
2410 }
2411
2412 if (flag [i])
2413 {
2414 int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
2415 len -= cnt;
2416 p += cnt;
2417 first = false;
2418 }
2419 }
2420
2421 return desc;
2422}
2423
2424// return a suitable string describing an object in enough detail to find it
2425const char *
2426object::debug_desc (char *info) const
2427{
2428 char flagdesc[512];
2429 char info2[256 * 4];
2430 char *p = info;
2431
2432 p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2433 count,
2434 uuid.c_str (),
2435 &name,
2436 title ? ",title:\"" : "",
2437 title ? (const char *)title : "",
2438 title ? "\"" : "",
2439 flag_desc (flagdesc, 512), type);
2440
2441 if (!flag[FLAG_REMOVED] && env)
2442 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2443
2444 if (map)
2445 p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2446
2447 return info;
2448}
2449
2450const char *
2451object::debug_desc () const
2452{
2453 static char info[3][256 * 4];
2454 static int info_idx;
2455
2456 return debug_desc (info [++info_idx % 3]);
2457}
2458
2459struct region *
2460object::region () const
2461{
2462 return map ? map->region (x, y)
2463 : region::default_region ();
2464}
2465
2466const materialtype_t *
2467object::dominant_material () const
2468{
2469 if (materialtype_t *mt = name_to_material (materialname))
2470 return mt;
2471
2472 return name_to_material (shstr_unknown);
2473}
2474
2475void
2476object::open_container (object *new_container)
2477{
2478 if (container == new_container)
2479 return;
2480
2481 object *old_container = container;
2482
2483 if (old_container)
2484 {
2485 if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2486 return;
2487
2488#if 0
2489 // remove the "Close old_container" object.
2490 if (object *closer = old_container->inv)
2491 if (closer->type == CLOSE_CON)
2492 closer->destroy ();
2493#endif
2494
2495 // make sure the container is available
2496 esrv_send_item (this, old_container);
2497
2498 old_container->flag [FLAG_APPLIED] = false;
2499 container = 0;
2500
2501 // client needs item update to make it work, client bug requires this to be separate
2502 esrv_update_item (UPD_FLAGS, this, old_container);
2503
2504 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2505 play_sound (sound_find ("chest_close"));
2506 }
2507
2508 if (new_container)
2509 {
2510 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
2511 return;
2512
2513 // TODO: this does not seem to serve any purpose anymore?
2514#if 0
2515 // insert the "Close Container" object.
2516 if (archetype *closer = new_container->other_arch)
2517 {
2518 object *closer = arch_to_object (new_container->other_arch);
2519 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2520 new_container->insert (closer);
2521 }
2522#endif
2523
2524 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2525
2526 // make sure the container is available, client bug requires this to be separate
2527 esrv_send_item (this, new_container);
2528
2529 new_container->flag [FLAG_APPLIED] = true;
2530 container = new_container;
2531
2532 // client needs flag change
2533 esrv_update_item (UPD_FLAGS, this, new_container);
2534 esrv_send_inventory (this, new_container);
2535 play_sound (sound_find ("chest_open"));
2536 }
2537// else if (!old_container->env && contr && contr->ns)
2538// contr->ns->floorbox_reset ();
2539}
2540
2541object *
2542object::force_find (shstr_tmp name)
2543{
2544 /* cycle through his inventory to look for the MARK we want to
2545 * place
2546 */
2547 for (object *tmp = inv; tmp; tmp = tmp->below)
2548 if (tmp->type == FORCE && tmp->slaying == name)
2549 return splay (tmp);
2550
2551 return 0;
2552}
2553
2554object *
2555object::force_add (shstr_tmp name, int duration)
2556{
2557 if (object *force = force_find (name))
2558 force->destroy ();
2559
2560 object *force = get_archetype (FORCE_NAME);
2561
2562 force->slaying = name;
2563 force->stats.food = 1;
2564 force->speed_left = -1.f;
2565
2566 force->set_speed (duration ? 1.f / duration : 0.f);
2567 force->flag [FLAG_IS_USED_UP] = true;
2568 force->flag [FLAG_APPLIED] = true;
2569
2570 return insert (force);
2571}
2572
2573void
2574object::play_sound (faceidx sound) const
2575{
2576 if (!sound)
2577 return;
2578
2579 if (is_on_map ())
2580 map->play_sound (sound, x, y);
2581 else if (object *pl = in_player ())
2582 pl->contr->play_sound (sound);
2583}
2584
2585void
2586object::say_msg (const char *msg) const
2587{
2588 if (is_on_map ())
2589 map->say_msg (msg, x, y);
2590 else if (object *pl = in_player ())
2591 pl->contr->play_sound (sound);
2592}
2593
2594void
2595object::make_noise ()
2596{
2597 // we do not model noise in the map, so instead put
2598 // a temporary light into the noise source
2599 // could use the map instead, but that's less reliable for our
2600 // goal, which is to make invisibility a bit harder to exploit
2601
2602 // currently only works sensibly for players
2603 if (!is_player ())
2604 return;
2605
2606 // find old force, or create new one
2607 object *force = force_find (shstr_noise_force);
2608
2609 if (force)
2610 force->speed_left = -1.f; // patch old speed up
2611 else
2612 {
2613 force = archetype::get (shstr_noise_force);
2614
2615 force->slaying = shstr_noise_force;
2616 force->stats.food = 1;
2617 force->speed_left = -1.f;
2618
2619 force->set_speed (1.f / 4.f);
2620 force->flag [FLAG_IS_USED_UP] = true;
2621 force->flag [FLAG_APPLIED] = true;
2622
2623 insert (force);
2624 }
2625}
2626

Diff Legend

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