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.42 by root, Thu Sep 14 01:19:47 2006 UTC vs.
Revision 1.187 by root, Tue Sep 4 08:42:55 2007 UTC

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

Diff Legend

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