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.44 by root, Thu Sep 14 17:29:27 2006 UTC vs.
Revision 1.160 by root, Tue Jun 5 13:05:02 2007 UTC

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

Diff Legend

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