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.292 by root, Mon Oct 19 21:48:49 2009 UTC vs.
Revision 1.303 by root, Tue Nov 10 04:38:45 2009 UTC

38uint32_t mapspace::smellcount = 10000; 38uint32_t mapspace::smellcount = 10000;
39 39
40objectvec objects; 40objectvec objects;
41activevec actives; 41activevec actives;
42 42
43//+GPL
44
43short freearr_x[SIZEOFFREE] = { 45short freearr_x[SIZEOFFREE] = {
44 0, 46 0,
45 0, 1, 1, 1, 0, -1, -1, -1, 47 0, 1, 1, 1, 0, -1, -1, -1,
46 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, 48 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -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 49 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
50 0, 52 0,
51 -1, -1, 0, 1, 1, 1, 0, -1, 53 -1, -1, 0, 1, 1, 1, 0, -1,
52 -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, 54 -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
53 -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 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}; 56};
55int maxfree[SIZEOFFREE] = {
56 0,
57 9, 10, 13, 14, 17, 18, 21, 22,
58 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
59 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
60};
61int freedir[SIZEOFFREE] = { 57int freedir[SIZEOFFREE] = {
62 0, 58 0,
63 1, 2, 3, 4, 5, 6, 7, 8, 59 1, 2, 3, 4, 5, 6, 7, 8,
64 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, 60 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
65 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 61 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
62};
63
64static int maxfree[SIZEOFFREE] = {
65 0,
66 9, 10, 13, 14, 17, 18, 21, 22,
67 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
68 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
66}; 69};
67 70
68static void 71static void
69write_uuid (uval64 skip, bool sync) 72write_uuid (uval64 skip, bool sync)
70{ 73{
98 101
99 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); 102 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
100 _exit (1); 103 _exit (1);
101 } 104 }
102 105
103 UUID::BUF buf; 106 char buf [UUID::MAX_LEN];
104 buf[0] = 0; 107 buf[0] = 0;
105 fgets (buf, sizeof (buf), fp); 108 fgets (buf, sizeof (buf), fp);
106 109
107 if (!UUID::cur.parse (buf)) 110 if (!UUID::cur.parse (buf))
108 { 111 {
135 138
136void 139void
137UUID::init () 140UUID::init ()
138{ 141{
139 read_uuid (); 142 read_uuid ();
143}
144
145bool
146UUID::parse (const char *s)
147{
148 if (*s++ != '<' || *s++ != '1' || *s++ != '.')
149 return false;
150
151 seq = 0;
152
153 while (*s != '>')
154 {
155 if (*s < '0')
156 return false;
157
158 // this gives nice branchless code with gcc
159 assert ('0' < 'a' && '0' == 48 && 'a' == 97);
160 int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15;
161
162 seq = (seq << 4) | digit;
163
164 ++s;
165 }
166
167 return true;
168}
169
170char *
171UUID::append (char *buf) const
172{
173 *buf++ = '<';
174 *buf++ = '1';
175 *buf++ = '.';
176
177 uint64_t seq = this->seq;
178 const int bits = 64;
179 char nz = 0;
180 static const char tohex [] = "0123456789abcdef";
181
182 // assert (len >= 3 + bits / 4 + 1 + 1);
183 for (int i = bits / 4; --i; )
184 {
185 uint8_t digit = seq >> (bits - 4);
186
187 *buf = tohex [digit];
188 nz |= digit;
189 buf += nz ? 1 : 0;
190 seq <<= 4;
191 }
192
193 // last digit is special - always emit
194 uint8_t digit = seq >> (bits - 4);
195 *buf++ = tohex [digit];
196
197 *buf++ = '>';
198
199 return buf;
200}
201
202char *
203UUID::c_str () const
204{
205 static char buf [MAX_LEN];
206 *append (buf) = 0;
207 return buf;
140} 208}
141 209
142/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ 210/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
143static bool 211static bool
144compare_ob_value_lists_one (const object *wants, const object *has) 212compare_ob_value_lists_one (const object *wants, const object *has)
183bool object::can_merge_slow (object *ob1, object *ob2) 251bool object::can_merge_slow (object *ob1, object *ob2)
184{ 252{
185 /* A couple quicksanity checks */ 253 /* A couple quicksanity checks */
186 if (ob1 == ob2 254 if (ob1 == ob2
187 || ob1->type != ob2->type 255 || ob1->type != ob2->type
188 || ob1->speed != ob2->speed 256 || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED
189 || ob1->value != ob2->value 257 || ob1->value != ob2->value
190 || ob1->name != ob2->name) 258 || ob1->name != ob2->name)
191 return 0; 259 return 0;
192 260
193 /* Do not merge objects if nrof would overflow, assume nrof 261 /* Do not merge objects if nrof would overflow, assume nrof
218 || ob1->skill != ob2->skill 286 || ob1->skill != ob2->skill
219 || ob1->value != ob2->value 287 || ob1->value != ob2->value
220 || ob1->animation_id != ob2->animation_id 288 || ob1->animation_id != ob2->animation_id
221 || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other 289 || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other
222 || ob1->client_type != ob2->client_type 290 || ob1->client_type != ob2->client_type
223 || ob1->materialname != ob2->materialname 291 || ob1->material != ob2->material
224 || ob1->lore != ob2->lore 292 || ob1->lore != ob2->lore
225 || ob1->subtype != ob2->subtype 293 || ob1->subtype != ob2->subtype
226 || ob1->move_type != ob2->move_type 294 || ob1->move_type != ob2->move_type
227 || ob1->move_block != ob2->move_block 295 || ob1->move_block != ob2->move_block
228 || ob1->move_allow != ob2->move_allow 296 || ob1->move_allow != ob2->move_allow
229 || ob1->move_on != ob2->move_on 297 || ob1->move_on != ob2->move_on
230 || ob1->move_off != ob2->move_off 298 || ob1->move_off != ob2->move_off
231 || ob1->move_slow != ob2->move_slow 299 || ob1->move_slow != ob2->move_slow
232 || ob1->move_slow_penalty != ob2->move_slow_penalty 300 || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
233 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) 301 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
234 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) 302 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
235 return 0; 303 return 0;
236 304
237 if ((ob1->flag ^ ob2->flag) 305 if ((ob1->flag ^ ob2->flag)
439{ 507{
440 return dump_object (this); 508 return dump_object (this);
441} 509}
442 510
443/* 511/*
444 * get_nearest_part(multi-object, object 2) returns the part of the
445 * multi-object 1 which is closest to the second object.
446 * If it's not a multi-object, it is returned.
447 */
448object *
449get_nearest_part (object *op, const object *pl)
450{
451 object *tmp, *closest;
452 int last_dist, i;
453
454 if (!op->more)
455 return op;
456
457 for (last_dist = distance (op, pl), closest = op, tmp = op->more;
458 tmp;
459 tmp = tmp->more)
460 if ((i = distance (tmp, pl)) < last_dist)
461 closest = tmp, last_dist = i;
462
463 return closest;
464}
465
466/*
467 * Returns the object which has the count-variable equal to the argument. 512 * Returns the object which has the count-variable equal to the argument.
468 * VERRRY slow. 513 * VERRRY slow.
469 */ 514 */
470object * 515object *
471find_object (tag_t i) 516find_object (tag_t i)
699 * This function needs to be called whenever the speed of an object changes. 744 * This function needs to be called whenever the speed of an object changes.
700 */ 745 */
701void 746void
702object::set_speed (float speed) 747object::set_speed (float speed)
703{ 748{
704 if (flag [FLAG_FREED] && speed)
705 {
706 LOG (llevError, "Object %s is freed but has speed.\n", &name);
707 speed = 0;
708 }
709
710 this->speed = speed; 749 this->speed = speed;
711 750
712 if (has_active_speed ()) 751 if (has_active_speed ())
713 activate (); 752 activate ();
714 else 753 else
764 803
765 if (!(m.flags_ & P_UPTODATE)) 804 if (!(m.flags_ & P_UPTODATE))
766 /* nop */; 805 /* nop */;
767 else if (action == UP_OBJ_INSERT) 806 else if (action == UP_OBJ_INSERT)
768 { 807 {
808#if 0
769 // this is likely overkill, TODO: revisit (schmorp) 809 // this is likely overkill, TODO: revisit (schmorp)
770 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) 810 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
771 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) 811 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
772 || (op->is_player () && !(m.flags_ & P_PLAYER)) 812 || (op->is_player () && !(m.flags_ & P_PLAYER))
773 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) 813 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
778 || (m.move_slow | op->move_slow) != m.move_slow 818 || (m.move_slow | op->move_slow) != m.move_slow
779 /* This isn't perfect, but I don't expect a lot of objects to 819 /* This isn't perfect, but I don't expect a lot of objects to
780 * have move_allow right now. 820 * have move_allow right now.
781 */ 821 */
782 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block 822 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
783 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
784 m.invalidate (); 823 m.invalidate ();
824#else
825 // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
826 m.invalidate ();
827#endif
785 } 828 }
786 /* if the object is being removed, we can't make intelligent 829 /* if the object is being removed, we can't make intelligent
787 * decisions, because remove_ob can't really pass the object 830 * decisions, because remove_ob can't really pass the object
788 * that is being removed. 831 * that is being removed.
789 */ 832 */
801object::object () 844object::object ()
802{ 845{
803 SET_FLAG (this, FLAG_REMOVED); 846 SET_FLAG (this, FLAG_REMOVED);
804 847
805 //expmul = 1.0; declared const for the time being 848 //expmul = 1.0; declared const for the time being
806 face = blank_face; 849 face = blank_face;
850 material = &material_null;
807} 851}
808 852
809object::~object () 853object::~object ()
810{ 854{
811 unlink (); 855 unlink ();
1041 * the previous environment. 1085 * the previous environment.
1042 */ 1086 */
1043void 1087void
1044object::do_remove () 1088object::do_remove ()
1045{ 1089{
1046 object *tmp, *last = 0;
1047 object *otmp;
1048
1049 if (flag [FLAG_REMOVED]) 1090 if (flag [FLAG_REMOVED])
1050 return; 1091 return;
1051 1092
1052 INVOKE_OBJECT (REMOVE, this); 1093 INVOKE_OBJECT (REMOVE, this);
1053 1094
1159 //TODO: update floorbox to preserve ordering 1200 //TODO: update floorbox to preserve ordering
1160 if (pl->contr->ns) 1201 if (pl->contr->ns)
1161 pl->contr->ns->floorbox_update (); 1202 pl->contr->ns->floorbox_update ();
1162 } 1203 }
1163 1204
1205 if (check_walk_off)
1164 for (tmp = ms.bot; tmp; tmp = tmp->above) 1206 for (object *above, *tmp = ms.bot; tmp; tmp = above)
1165 { 1207 {
1208 above = tmp->above;
1209
1166 /* No point updating the players look faces if he is the object 1210 /* No point updating the players look faces if he is the object
1167 * being removed. 1211 * being removed.
1168 */ 1212 */
1169 1213
1170 /* See if object moving off should effect something */ 1214 /* See if object moving off should effect something */
1171 if (check_walk_off
1172 && ((move_type & tmp->move_off) 1215 if ((move_type & tmp->move_off)
1173 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1216 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1174 {
1175 move_apply (tmp, this, 0); 1217 move_apply (tmp, this, 0);
1176
1177 if (destroyed ())
1178 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1179 } 1218 }
1180
1181 last = tmp;
1182 }
1183 1219
1184 if (affects_los ()) 1220 if (affects_los ())
1185 update_all_los (map, x, y); 1221 update_all_los (map, x, y);
1186 } 1222 }
1187} 1223}
1533 return where->env->insert (this); 1569 return where->env->insert (this);
1534 else 1570 else
1535 return where->map->insert (this, where->x, where->y, originator, flags); 1571 return where->map->insert (this, where->x, where->y, originator, flags);
1536} 1572}
1537 1573
1574// check whether we can put this into the map, respect max_volume, max_items
1575bool
1576object::can_drop_at (maptile *m, int x, int y, object *originator)
1577{
1578 mapspace &ms = m->at (x, y);
1579
1580 int items = ms.items ();
1581
1582 if (!items // testing !items ensures we can drop at least one item
1583 || (items < m->max_items
1584 && ms.volume () < m->max_volume))
1585 return true;
1586
1587 if (originator && originator->is_player ())
1588 originator->contr->failmsg (format (
1589 "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
1590 query_name ()
1591 ));
1592
1593 return false;
1594}
1595
1538/* 1596/*
1539 * decrease(object, number) decreases a specified number from 1597 * decrease(object, number) decreases a specified number from
1540 * the amount of an object. If the amount reaches 0, the object 1598 * the amount of an object. If the amount reaches 0, the object
1541 * is subsequently removed and freed. 1599 * is subsequently removed and freed.
1542 * 1600 *
2179 * This basically means that if direction is 15, then it could either go 2237 * This basically means that if direction is 15, then it could either go
2180 * direction 4, 14, or 16 to get back to where we are. 2238 * direction 4, 14, or 16 to get back to where we are.
2181 * Moved from spell_util.c to object.c with the other related direction 2239 * Moved from spell_util.c to object.c with the other related direction
2182 * functions. 2240 * functions.
2183 */ 2241 */
2184const int reduction_dir[SIZEOFFREE][3] = { 2242static const int reduction_dir[SIZEOFFREE][3] = {
2185 {0, 0, 0}, /* 0 */ 2243 {0, 0, 0}, /* 0 */
2186 {0, 0, 0}, /* 1 */ 2244 {0, 0, 0}, /* 1 */
2187 {0, 0, 0}, /* 2 */ 2245 {0, 0, 0}, /* 2 */
2188 {0, 0, 0}, /* 3 */ 2246 {0, 0, 0}, /* 3 */
2189 {0, 0, 0}, /* 4 */ 2247 {0, 0, 0}, /* 4 */
2460{ 2518{
2461 return map ? map->region (x, y) 2519 return map ? map->region (x, y)
2462 : region::default_region (); 2520 : region::default_region ();
2463} 2521}
2464 2522
2465const materialtype_t *
2466object::dominant_material () const
2467{
2468 if (materialtype_t *mt = name_to_material (materialname))
2469 return mt;
2470
2471 return name_to_material (shstr_unknown);
2472}
2473
2474void 2523void
2475object::open_container (object *new_container) 2524object::open_container (object *new_container)
2476{ 2525{
2477 if (container == new_container) 2526 if (container == new_container)
2478 return; 2527 return;
2548 return splay (tmp); 2597 return splay (tmp);
2549 2598
2550 return 0; 2599 return 0;
2551} 2600}
2552 2601
2602//-GPL
2603
2553void 2604void
2554object::force_set_timer (int duration) 2605object::force_set_timer (int duration)
2555{ 2606{
2556 this->duration = 1; 2607 this->duration = 1;
2557 this->speed_left = -1.f; 2608 this->speed_left = -1.f;
2566 force->destroy (); 2617 force->destroy ();
2567 2618
2568 object *force = get_archetype (FORCE_NAME); 2619 object *force = get_archetype (FORCE_NAME);
2569 2620
2570 force->slaying = name; 2621 force->slaying = name;
2571
2572 force->force_set_timer (duration); 2622 force->force_set_timer (duration);
2573
2574 force->flag [FLAG_APPLIED] = true; 2623 force->flag [FLAG_APPLIED] = true;
2575 2624
2576 return insert (force); 2625 return insert (force);
2577} 2626}
2578 2627
2579void 2628void

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines