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

Diff Legend

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