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

Diff Legend

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