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.49 by root, Sat Sep 16 22:24:12 2006 UTC vs.
Revision 1.147 by root, Sat May 12 16:06:42 2007 UTC

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

Diff Legend

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