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

Diff Legend

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