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.146 by root, Fri May 11 21:07:13 2007 UTC

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

Diff Legend

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