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.294 by root, Thu Nov 5 15:43:21 2009 UTC vs.
Revision 1.321 by root, Sat Apr 10 04:54:09 2010 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Deliantra is free software: you can redistribute it and/or modify it under 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * the terms of the Affero GNU General Public License as published by the 9 * the terms of the Affero GNU General Public License as published by the
10 * Free Software Foundation, either version 3 of the License, or (at your 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * option) any later version. 11 * option) any later version.
26#include <stdio.h> 26#include <stdio.h>
27#include <sys/types.h> 27#include <sys/types.h>
28#include <sys/uio.h> 28#include <sys/uio.h>
29#include <object.h> 29#include <object.h>
30#include <sproto.h> 30#include <sproto.h>
31#include <loader.h>
32 31
33#include <bitset> 32#include <bitset>
34 33
35UUID UUID::cur; 34UUID UUID::cur;
36static uint64_t seq_next_save; 35static uint64_t seq_next_save;
52 0, 51 0,
53 -1, -1, 0, 1, 1, 1, 0, -1, 52 -1, -1, 0, 1, 1, 1, 0, -1,
54 -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, 53 -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
55 -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 54 -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
56}; 55};
57int maxfree[SIZEOFFREE] = {
58 0,
59 9, 10, 13, 14, 17, 18, 21, 22,
60 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
61 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
62};
63int freedir[SIZEOFFREE] = { 56int freedir[SIZEOFFREE] = {
64 0, 57 0,
65 1, 2, 3, 4, 5, 6, 7, 8, 58 1, 2, 3, 4, 5, 6, 7, 8,
66 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, 59 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
67 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 60 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
68}; 61};
69 62
63static int maxfree[SIZEOFFREE] = {
64 0,
65 9, 10, 13, 14, 17, 18, 21, 22,
66 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
67 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
68};
69
70static void 70static void
71write_uuid (uval64 skip, bool sync) 71write_uuid (uval64 skip, bool sync)
72{ 72{
73 CALL_BEGIN (2); 73 CALL_BEGIN (2);
74 CALL_ARG_SV (newSVval64 (skip)); 74 CALL_ARG_SV (newSVval64 (skip));
76 CALL_CALL ("cf::write_uuid", G_DISCARD); 76 CALL_CALL ("cf::write_uuid", G_DISCARD);
77 CALL_END; 77 CALL_END;
78} 78}
79 79
80static void 80static void
81read_uuid (void) 81read_uuid ()
82{ 82{
83 char filename[MAX_BUF]; 83 char filename[MAX_BUF];
84 84
85 sprintf (filename, "%s/uuid", settings.localdir); 85 sprintf (filename, "%s/uuid", settings.localdir);
86 86
100 100
101 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); 101 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
102 _exit (1); 102 _exit (1);
103 } 103 }
104 104
105 UUID::BUF buf; 105 char buf [UUID::MAX_LEN];
106 buf[0] = 0; 106 buf[0] = 0;
107 fgets (buf, sizeof (buf), fp); 107 fgets (buf, sizeof (buf), fp);
108 108
109 if (!UUID::cur.parse (buf)) 109 if (!UUID::cur.parse (buf))
110 { 110 {
137 137
138void 138void
139UUID::init () 139UUID::init ()
140{ 140{
141 read_uuid (); 141 read_uuid ();
142}
143
144bool
145UUID::parse (const char *s)
146{
147 if (*s++ != '<' || *s++ != '1' || *s++ != '.')
148 return false;
149
150 seq = 0;
151
152 while (*s != '>')
153 {
154 if (*s < '0')
155 return false;
156
157 // this gives nice branchless code with gcc
158 assert ('0' < 'a' && '0' == 48 && 'a' == 97);
159 int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15;
160
161 seq = (seq << 4) | digit;
162
163 ++s;
164 }
165
166 return true;
167}
168
169char *
170UUID::append (char *buf) const
171{
172 *buf++ = '<';
173 *buf++ = '1';
174 *buf++ = '.';
175
176 uint64_t seq = this->seq;
177 const int bits = 64;
178 char nz = 0;
179 static const char tohex [] = "0123456789abcdef";
180
181 // assert (len >= 3 + bits / 4 + 1 + 1);
182 for (int i = bits / 4; --i; )
183 {
184 uint8_t digit = seq >> (bits - 4);
185
186 *buf = tohex [digit];
187 nz |= digit;
188 buf += nz ? 1 : 0;
189 seq <<= 4;
190 }
191
192 // last digit is special - always emit
193 uint8_t digit = seq >> (bits - 4);
194 *buf++ = tohex [digit];
195
196 *buf++ = '>';
197
198 return buf;
199}
200
201char *
202UUID::c_str () const
203{
204 static char buf [MAX_LEN];
205 *append (buf) = 0;
206 return buf;
142} 207}
143 208
144/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ 209/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
145static bool 210static bool
146compare_ob_value_lists_one (const object *wants, const object *has) 211compare_ob_value_lists_one (const object *wants, const object *has)
182 * Improvements made with merge: Better checking on potion, and also 247 * Improvements made with merge: Better checking on potion, and also
183 * check weight 248 * check weight
184 */ 249 */
185bool object::can_merge_slow (object *ob1, object *ob2) 250bool object::can_merge_slow (object *ob1, object *ob2)
186{ 251{
187 /* A couple quicksanity checks */ 252 /* A couple quick sanity checks */
188 if (ob1 == ob2 253 if (ob1 == ob2
189 || ob1->type != ob2->type 254 || ob1->type != ob2->type
190 || ob1->speed != ob2->speed
191 || ob1->value != ob2->value 255 || ob1->value != ob2->value
192 || ob1->name != ob2->name) 256 || ob1->name != ob2->name
257 || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
193 return 0; 258 return 0;
194 259
195 /* Do not merge objects if nrof would overflow, assume nrof 260 /* Do not merge objects if nrof would overflow, assume nrof
196 * is always 0 .. 2**31-1 */ 261 * is always 0 .. 2**31-1 */
197 if (ob1->nrof > 0x7fffffff - ob2->nrof) 262 if (ob1->nrof > 0x7fffffff - ob2->nrof)
218 || ob1->magic != ob2->magic 283 || ob1->magic != ob2->magic
219 || ob1->slaying != ob2->slaying 284 || ob1->slaying != ob2->slaying
220 || ob1->skill != ob2->skill 285 || ob1->skill != ob2->skill
221 || ob1->value != ob2->value 286 || ob1->value != ob2->value
222 || ob1->animation_id != ob2->animation_id 287 || ob1->animation_id != ob2->animation_id
223 || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other 288 || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other
224 || ob1->client_type != ob2->client_type 289 || ob1->client_type != ob2->client_type
225 || ob1->materialname != ob2->materialname 290 || ob1->material != ob2->material
226 || ob1->lore != ob2->lore 291 || ob1->lore != ob2->lore
227 || ob1->subtype != ob2->subtype 292 || ob1->subtype != ob2->subtype
228 || ob1->move_type != ob2->move_type 293 || ob1->move_type != ob2->move_type
229 || ob1->move_block != ob2->move_block 294 || ob1->move_block != ob2->move_block
230 || ob1->move_allow != ob2->move_allow 295 || ob1->move_allow != ob2->move_allow
231 || ob1->move_on != ob2->move_on 296 || ob1->move_on != ob2->move_on
232 || ob1->move_off != ob2->move_off 297 || ob1->move_off != ob2->move_off
233 || ob1->move_slow != ob2->move_slow 298 || ob1->move_slow != ob2->move_slow
234 || ob1->move_slow_penalty != ob2->move_slow_penalty 299 || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
235 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) 300 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
236 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) 301 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
237 return 0; 302 return 0;
238 303
239 if ((ob1->flag ^ ob2->flag) 304 if ((ob1->flag ^ ob2->flag)
441{ 506{
442 return dump_object (this); 507 return dump_object (this);
443} 508}
444 509
445/* 510/*
446 * get_nearest_part(multi-object, object 2) returns the part of the
447 * multi-object 1 which is closest to the second object.
448 * If it's not a multi-object, it is returned.
449 */
450object *
451get_nearest_part (object *op, const object *pl)
452{
453 object *tmp, *closest;
454 int last_dist, i;
455
456 if (!op->more)
457 return op;
458
459 for (last_dist = distance (op, pl), closest = op, tmp = op->more;
460 tmp;
461 tmp = tmp->more)
462 if ((i = distance (tmp, pl)) < last_dist)
463 closest = tmp, last_dist = i;
464
465 return closest;
466}
467
468/*
469 * Returns the object which has the count-variable equal to the argument. 511 * Returns the object which has the count-variable equal to the argument.
470 * VERRRY slow. 512 * VERRRY slow.
471 */ 513 */
472object * 514object *
473find_object (tag_t i) 515find_object (tag_t i)
474{ 516{
475 for_all_objects (op) 517 for_all_objects (op)
476 if (op->count == i) 518 if (op->count == i)
519 return op;
520
521 return 0;
522}
523
524/*
525 * Returns the object which has the uuid equal to the argument.
526 * MOAR VERRRY slow.
527 */
528
529object *
530find_object_uuid (UUID i)
531{
532 for_all_objects (op)
533 if (op->uuid == i)
477 return op; 534 return op;
478 535
479 return 0; 536 return 0;
480} 537}
481 538
515 LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); 572 LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
516 return; 573 return;
517 } 574 }
518 575
519 this->owner = owner; 576 this->owner = owner;
520}
521
522int
523object::slottype () const
524{
525 if (type == SKILL)
526 {
527 if (IS_COMBAT_SKILL (subtype)) return slot_combat;
528 if (IS_RANGED_SKILL (subtype)) return slot_ranged;
529 }
530 else
531 {
532 if (slot [body_combat].info) return slot_combat;
533 if (slot [body_range ].info) return slot_ranged;
534 }
535
536 return slot_none;
537}
538
539bool
540object::change_weapon (object *ob)
541{
542 if (current_weapon == ob)
543 return true;
544
545 if (chosen_skill)
546 chosen_skill->flag [FLAG_APPLIED] = false;
547
548 current_weapon = ob;
549 chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
550
551 if (chosen_skill)
552 chosen_skill->flag [FLAG_APPLIED] = true;
553
554 update_stats ();
555
556 if (ob)
557 {
558 // now check wether any body locations became invalid, in which case
559 // we cannot apply the weapon at the moment.
560 for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
561 if (slot[i].used < 0)
562 {
563 current_weapon = chosen_skill = 0;
564 update_stats ();
565
566 new_draw_info_format (NDI_UNIQUE, 0, this,
567 "You try to balance all your items at once, "
568 "but the %s is just too much for your body. "
569 "[You need to unapply some items first - use the 'body' command to see "
570 "how many items you cna wera on a specific body part.]", &ob->name);
571 return false;
572 }
573
574 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
575 }
576 else
577 ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
578
579 if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
580 {
581 LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
582 &name, ob->debug_desc ());
583 return false;
584 }
585
586 return true;
587} 577}
588 578
589/* Zero the key_values on op, decrementing the shared-string 579/* Zero the key_values on op, decrementing the shared-string
590 * refcounts and freeing the links. 580 * refcounts and freeing the links.
591 */ 581 */
644 tail = new_link; 634 tail = new_link;
645 } 635 }
646 } 636 }
647 } 637 }
648 638
649 if (speed < 0)
650 dst->speed_left -= rndm ();
651
652 dst->activate (); 639 dst->activate ();
653} 640}
654 641
655void 642void
656object::instantiate () 643object::instantiate ()
657{ 644{
658 if (!uuid.seq) // HACK 645 if (!uuid.seq) // HACK
659 uuid = UUID::gen (); 646 uuid = UUID::gen ();
660 647
648 // TODO: unclean state changes, should nt be done in copy_to AND instantiate
649 if (flag [FLAG_RANDOM_SPEED] && speed)
650 speed_left = - speed - rndm (); // TODO animation
651 else
661 speed_left = -0.1f; 652 speed_left = -1.;
653
662 /* copy the body_info to the body_used - this is only really 654 /* copy the body_info to the body_used - this is only really
663 * need for monsters, but doesn't hurt to do it for everything. 655 * need for monsters, but doesn't hurt to do it for everything.
664 * by doing so, when a monster is created, it has good starting 656 * by doing so, when a monster is created, it has good starting
665 * values for the body_used info, so when items are created 657 * values for the body_used info, so when items are created
666 * for it, they can be properly equipped. 658 * for it, they can be properly equipped.
674object * 666object *
675object::clone () 667object::clone ()
676{ 668{
677 object *neu = create (); 669 object *neu = create ();
678 copy_to (neu); 670 copy_to (neu);
671
672 // TODO: unclean state changes, should not be done in clone AND instantiate
673 if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed)
674 neu->speed_left = - neu->speed - rndm (); // TODO animation
675
679 neu->map = map; // not copied by copy_to 676 neu->map = map; // not copied by copy_to
680 return neu; 677 return neu;
681} 678}
682 679
683/* 680/*
701 * This function needs to be called whenever the speed of an object changes. 698 * This function needs to be called whenever the speed of an object changes.
702 */ 699 */
703void 700void
704object::set_speed (float speed) 701object::set_speed (float speed)
705{ 702{
706 if (flag [FLAG_FREED] && speed)
707 {
708 LOG (llevError, "Object %s is freed but has speed.\n", &name);
709 speed = 0;
710 }
711
712 this->speed = speed; 703 this->speed = speed;
713 704
714 if (has_active_speed ()) 705 if (has_active_speed ())
715 activate (); 706 activate ();
716 else 707 else
766 757
767 if (!(m.flags_ & P_UPTODATE)) 758 if (!(m.flags_ & P_UPTODATE))
768 /* nop */; 759 /* nop */;
769 else if (action == UP_OBJ_INSERT) 760 else if (action == UP_OBJ_INSERT)
770 { 761 {
762#if 0
771 // this is likely overkill, TODO: revisit (schmorp) 763 // this is likely overkill, TODO: revisit (schmorp)
772 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) 764 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
773 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) 765 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
774 || (op->is_player () && !(m.flags_ & P_PLAYER)) 766 || (op->is_player () && !(m.flags_ & P_PLAYER))
775 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) 767 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
780 || (m.move_slow | op->move_slow) != m.move_slow 772 || (m.move_slow | op->move_slow) != m.move_slow
781 /* This isn't perfect, but I don't expect a lot of objects to 773 /* This isn't perfect, but I don't expect a lot of objects to
782 * have move_allow right now. 774 * have move_allow right now.
783 */ 775 */
784 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block 776 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
785 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
786 m.invalidate (); 777 m.invalidate ();
778#else
779 // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
780 m.invalidate ();
781#endif
787 } 782 }
788 /* if the object is being removed, we can't make intelligent 783 /* if the object is being removed, we can't make intelligent
789 * decisions, because remove_ob can't really pass the object 784 * decisions, because remove_ob can't really pass the object
790 * that is being removed. 785 * that is being removed.
791 */ 786 */
803object::object () 798object::object ()
804{ 799{
805 SET_FLAG (this, FLAG_REMOVED); 800 SET_FLAG (this, FLAG_REMOVED);
806 801
807 //expmul = 1.0; declared const for the time being 802 //expmul = 1.0; declared const for the time being
808 face = blank_face; 803 face = blank_face;
804 material = MATERIAL_NULL;
809} 805}
810 806
811object::~object () 807object::~object ()
812{ 808{
813 unlink (); 809 unlink ();
943 map->insert (op, x, y); 939 map->insert (op, x, y);
944 } 940 }
945 } 941 }
946} 942}
947 943
944/*
945 * Remove and free all objects in the inventory of the given object.
946 * Unlike destroy_inv, this assumes the *this is destroyed as well
947 * well, so we can (and have to!) take shortcuts.
948 */
949void
950object::destroy_inv_fast ()
951{
952 while (object *op = inv)
953 {
954 // remove from object the fast way
955 op->flag [FLAG_REMOVED] = true;
956 op->env = 0;
957 if ((inv = inv->below))
958 inv->above = 0;
959
960 // then destroy
961 op->destroy ();
962 }
963}
964
948object *object::create () 965object *object::create ()
949{ 966{
950 object *op = new object; 967 object *op = new object;
951 op->link (); 968 op->link ();
952 return op; 969 return op;
1022 LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); 1039 LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1023 head->destroy (); 1040 head->destroy ();
1024 return; 1041 return;
1025 } 1042 }
1026 1043
1027 destroy_inv (false); 1044 destroy_inv_fast ();
1028 1045
1029 if (is_head ()) 1046 if (is_head ())
1030 if (sound_destroy) 1047 if (sound_destroy)
1031 play_sound (sound_destroy); 1048 play_sound (sound_destroy);
1032 else if (flag [FLAG_MONSTER]) 1049 else if (flag [FLAG_MONSTER])
1084 1101
1085 above = 0; 1102 above = 0;
1086 below = 0; 1103 below = 0;
1087 env = 0; 1104 env = 0;
1088 1105
1089 /* NO_FIX_PLAYER is set when a great many changes are being 1106 if (pl && pl->is_player ())
1090 * made to players inventory. If set, avoiding the call
1091 * to save cpu time.
1092 */ 1107 {
1093 if (pl) 1108 if (expect_false (pl->contr->combat_ob == this))
1094 if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
1095 { 1109 {
1096 pl->update_stats (); 1110 pl->apply (pl->contr->combat_ob, AP_UNAPPLY);
1111 pl->contr->combat_ob = 0;
1112 if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob);
1113 }
1097 1114
1115 if (expect_false (pl->contr->ranged_ob == this))
1116 {
1117 pl->apply (pl->contr->ranged_ob, AP_UNAPPLY);
1118 pl->contr->ranged_ob = 0;
1119 if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob);
1120 }
1121
1122 pl->contr->queue_stats_update ();
1123
1098 if (glow_radius && pl->is_on_map ()) 1124 if (expect_false (glow_radius) && pl->is_on_map ())
1099 update_all_los (pl->map, pl->x, pl->y); 1125 update_all_los (pl->map, pl->x, pl->y);
1100 } 1126 }
1101 } 1127 }
1102 else if (map) 1128 else if (map)
1103 { 1129 {
1104 map->dirty = true; 1130 map->dirty = true;
1105 mapspace &ms = this->ms (); 1131 mapspace &ms = this->ms ();
1225 1251
1226 object *prev = this; 1252 object *prev = this;
1227 1253
1228 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) 1254 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1229 { 1255 {
1230 object *op = arch_to_object (at); 1256 object *op = at->instance ();
1231 1257
1232 op->name = name; 1258 op->name = name;
1233 op->name_pl = name_pl; 1259 op->name_pl = name_pl;
1234 op->title = title; 1260 op->title = title;
1235 1261
1273 * Passing 0 for flag gives proper default values, so flag really only needs 1299 * Passing 0 for flag gives proper default values, so flag really only needs
1274 * to be set if special handling is needed. 1300 * to be set if special handling is needed.
1275 * 1301 *
1276 * Return value: 1302 * Return value:
1277 * new object if 'op' was merged with other object 1303 * new object if 'op' was merged with other object
1278 * NULL if 'op' was destroyed 1304 * NULL if there was an error (destroyed, blocked etc.)
1279 * just 'op' otherwise 1305 * just 'op' otherwise
1280 */ 1306 */
1281object * 1307object *
1282insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1308insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1283{ 1309{
1510 1536
1511 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) 1537 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1512 if (tmp->arch->archname == archname) /* same archetype */ 1538 if (tmp->arch->archname == archname) /* same archetype */
1513 tmp->destroy (); 1539 tmp->destroy ();
1514 1540
1515 object *tmp = arch_to_object (archetype::find (archname)); 1541 object *tmp = archetype::find (archname)->instance ();
1516 1542
1517 tmp->x = op->x; 1543 tmp->x = op->x;
1518 tmp->y = op->y; 1544 tmp->y = op->y;
1519 1545
1520 insert_ob_in_map (tmp, op->map, op, 0); 1546 insert_ob_in_map (tmp, op->map, op, 0);
1525{ 1551{
1526 if (where->env) 1552 if (where->env)
1527 return where->env->insert (this); 1553 return where->env->insert (this);
1528 else 1554 else
1529 return where->map->insert (this, where->x, where->y, originator, flags); 1555 return where->map->insert (this, where->x, where->y, originator, flags);
1556}
1557
1558// check whether we can put this into the map, respect max_volume, max_items
1559bool
1560object::can_drop_at (maptile *m, int x, int y, object *originator)
1561{
1562 mapspace &ms = m->at (x, y);
1563
1564 int items = ms.items ();
1565
1566 if (!items // testing !items ensures we can drop at least one item
1567 || (items < m->max_items
1568 && ms.volume () < m->max_volume))
1569 return true;
1570
1571 if (originator && originator->is_player ())
1572 originator->contr->failmsgf (
1573 "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
1574 query_name ()
1575 );
1576
1577 return false;
1530} 1578}
1531 1579
1532/* 1580/*
1533 * decrease(object, number) decreases a specified number from 1581 * decrease(object, number) decreases a specified number from
1534 * the amount of an object. If the amount reaches 0, the object 1582 * the amount of an object. If the amount reaches 0, the object
1674 if (op->glow_radius && is_on_map ()) 1722 if (op->glow_radius && is_on_map ())
1675 { 1723 {
1676 update_stats (); 1724 update_stats ();
1677 update_all_los (map, x, y); 1725 update_all_los (map, x, y);
1678 } 1726 }
1679 else if (is_player () && !flag [FLAG_NO_FIX_PLAYER]) 1727 else if (is_player ())
1680 // if this is a player's inventory, update stats 1728 // if this is a player's inventory, update stats
1681 update_stats (); 1729 contr->queue_stats_update ();
1682 1730
1683 INVOKE_OBJECT (INSERT, this); 1731 INVOKE_OBJECT (INSERT, this);
1684 1732
1685 return op; 1733 return op;
1686} 1734}
2173 * This basically means that if direction is 15, then it could either go 2221 * This basically means that if direction is 15, then it could either go
2174 * direction 4, 14, or 16 to get back to where we are. 2222 * direction 4, 14, or 16 to get back to where we are.
2175 * Moved from spell_util.c to object.c with the other related direction 2223 * Moved from spell_util.c to object.c with the other related direction
2176 * functions. 2224 * functions.
2177 */ 2225 */
2178const int reduction_dir[SIZEOFFREE][3] = { 2226static const int reduction_dir[SIZEOFFREE][3] = {
2179 {0, 0, 0}, /* 0 */ 2227 {0, 0, 0}, /* 0 */
2180 {0, 0, 0}, /* 1 */ 2228 {0, 0, 0}, /* 1 */
2181 {0, 0, 0}, /* 2 */ 2229 {0, 0, 0}, /* 2 */
2182 {0, 0, 0}, /* 3 */ 2230 {0, 0, 0}, /* 3 */
2183 {0, 0, 0}, /* 4 */ 2231 {0, 0, 0}, /* 4 */
2454{ 2502{
2455 return map ? map->region (x, y) 2503 return map ? map->region (x, y)
2456 : region::default_region (); 2504 : region::default_region ();
2457} 2505}
2458 2506
2459const materialtype_t *
2460object::dominant_material () const
2461{
2462 if (materialtype_t *mt = name_to_material (materialname))
2463 return mt;
2464
2465 return name_to_material (shstr_unknown);
2466}
2467
2468void 2507void
2469object::open_container (object *new_container) 2508object::open_container (object *new_container)
2470{ 2509{
2471 if (container == new_container) 2510 if (container == new_container)
2472 return; 2511 return;
2506 // TODO: this does not seem to serve any purpose anymore? 2545 // TODO: this does not seem to serve any purpose anymore?
2507#if 0 2546#if 0
2508 // insert the "Close Container" object. 2547 // insert the "Close Container" object.
2509 if (archetype *closer = new_container->other_arch) 2548 if (archetype *closer = new_container->other_arch)
2510 { 2549 {
2511 object *closer = arch_to_object (new_container->other_arch); 2550 object *closer = new_container->other_arch->instance ();
2512 closer->flag [FLAG_NO_MAP_SAVE] = 1; 2551 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2513 new_container->insert (closer); 2552 new_container->insert (closer);
2514 } 2553 }
2515#endif 2554#endif
2516 2555
2622 2661
2623 insert (force); 2662 insert (force);
2624 } 2663 }
2625} 2664}
2626 2665
2666void object::change_move_type (MoveType mt)
2667{
2668 if (move_type == mt)
2669 return;
2670
2671 if (is_on_map ())
2672 {
2673 // we are on the map, so handle move_on/off effects
2674 remove ();
2675 move_type = mt;
2676 map->insert (this, x, y, this);
2677 }
2678 else
2679 move_type = mt;
2680}
2681

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines