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.51 by root, Sun Sep 17 16:21:53 2006 UTC vs.
Revision 1.202 by root, Thu Apr 10 15:35:15 2008 UTC

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

Diff Legend

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