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

Diff Legend

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