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.172 by root, Wed Aug 1 20:44:11 2007 UTC vs.
Revision 1.192 by root, Fri Oct 12 19:13:25 2007 UTC

… …
305 { 305 {
306 ob1->optimise (); 306 ob1->optimise ();
307 ob2->optimise (); 307 ob2->optimise ();
308 308
309 if (ob1->self || ob2->self) 309 if (ob1->self || ob2->self)
310 if (!cfperl_can_merge (ob1, ob2)) 310 {
311 int k1 = ob1->self ? HvTOTALKEYS (SvRV (ob1->self)) : 0;
312 int k2 = ob2->self ? HvTOTALKEYS (SvRV (ob2->self)) : 0;
313
314 if (k1 != k2)
311 return 0; 315 return 0;
316 else if (k1 == 0)
317 return 1;
318 else if (!cfperl_can_merge (ob1, ob2))
319 return 0;
320 }
312 } 321 }
313 322
314 /* Everything passes, must be OK. */ 323 /* Everything passes, must be OK. */
315 return 1; 324 return 1;
316} 325}
… …
374/* 383/*
375 * get_nearest_part(multi-object, object 2) returns the part of the 384 * get_nearest_part(multi-object, object 2) returns the part of the
376 * multi-object 1 which is closest to the second object. 385 * multi-object 1 which is closest to the second object.
377 * If it's not a multi-object, it is returned. 386 * If it's not a multi-object, it is returned.
378 */ 387 */
379
380object * 388object *
381get_nearest_part (object *op, const object *pl) 389get_nearest_part (object *op, const object *pl)
382{ 390{
383 object *tmp, *closest; 391 object *tmp, *closest;
384 int last_dist, i; 392 int last_dist, i;
… …
429} 437}
430 438
431/* 439/*
432 * Sets the owner and sets the skill and exp pointers to owner's current 440 * Sets the owner and sets the skill and exp pointers to owner's current
433 * skill and experience objects. 441 * skill and experience objects.
442 * ACTUALLY NO! investigate! TODO
434 */ 443 */
435void 444void
436object::set_owner (object *owner) 445object::set_owner (object *owner)
437{ 446{
447 // allow objects which own objects
438 if (!owner) 448 if (owner)
439 return;
440
441 /* next line added to allow objects which own objects */
442 /* Add a check for ownercounts in here, as I got into an endless loop
443 * with the fireball owning a poison cloud which then owned the
444 * fireball. I believe that was caused by one of the objects getting
445 * freed and then another object replacing it. Since the ownercounts
446 * didn't match, this check is valid and I believe that cause is valid.
447 */
448 while (owner->owner) 449 while (owner->owner)
449 owner = owner->owner; 450 owner = owner->owner;
450 451
451 this->owner = owner; 452 this->owner = owner;
452} 453}
453 454
454int 455int
… …
586object::copy_to (object *dst) 587object::copy_to (object *dst)
587{ 588{
588 *dst = *this; 589 *dst = *this;
589 590
590 if (speed < 0) 591 if (speed < 0)
591 dst->speed_left = speed_left - rndm (); 592 dst->speed_left -= rndm ();
592 593
593 dst->set_speed (dst->speed); 594 dst->set_speed (dst->speed);
594} 595}
595 596
596void 597void
… …
923 924
924 if (!freed_map) 925 if (!freed_map)
925 { 926 {
926 freed_map = new maptile; 927 freed_map = new maptile;
927 928
929 freed_map->path = "<freed objects map>";
928 freed_map->name = "/internal/freed_objects_map"; 930 freed_map->name = "/internal/freed_objects_map";
929 freed_map->width = 3; 931 freed_map->width = 3;
930 freed_map->height = 3; 932 freed_map->height = 3;
931 933
932 freed_map->alloc (); 934 freed_map->alloc ();
… …
960 return; 962 return;
961 963
962 if (destroy_inventory) 964 if (destroy_inventory)
963 destroy_inv (false); 965 destroy_inv (false);
964 966
967 if (is_head ())
965 if (sound_destroy) 968 if (sound_destroy)
966 play_sound (sound_destroy); 969 play_sound (sound_destroy);
967 else if (flag [FLAG_MONSTER]) 970 else if (flag [FLAG_MONSTER])
968 play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism 971 play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
969 972
970 attachable::destroy (); 973 attachable::destroy ();
971} 974}
972 975
973/* 976/*
… …
1088 if (map->in_memory == MAP_SAVING) 1091 if (map->in_memory == MAP_SAVING)
1089 return; 1092 return;
1090 1093
1091 int check_walk_off = !flag [FLAG_NO_APPLY]; 1094 int check_walk_off = !flag [FLAG_NO_APPLY];
1092 1095
1096 if (object *pl = ms.player ())
1097 {
1098 if (pl->container == this)
1099 /* If a container that the player is currently using somehow gets
1100 * removed (most likely destroyed), update the player view
1101 * appropriately.
1102 */
1103 pl->close_container ();
1104
1105 pl->contr->ns->floorbox_update ();
1106 }
1107
1093 for (tmp = ms.bot; tmp; tmp = tmp->above) 1108 for (tmp = ms.bot; tmp; tmp = tmp->above)
1094 { 1109 {
1095 /* No point updating the players look faces if he is the object 1110 /* No point updating the players look faces if he is the object
1096 * being removed. 1111 * being removed.
1097 */ 1112 */
1098
1099 if (tmp->type == PLAYER && tmp != this)
1100 {
1101 /* If a container that the player is currently using somehow gets
1102 * removed (most likely destroyed), update the player view
1103 * appropriately.
1104 */
1105 if (tmp->container == this)
1106 {
1107 flag [FLAG_APPLIED] = 0;
1108 tmp->container = 0;
1109 }
1110
1111 if (tmp->contr->ns)
1112 tmp->contr->ns->floorbox_update ();
1113 }
1114 1113
1115 /* See if object moving off should effect something */ 1114 /* See if object moving off should effect something */
1116 if (check_walk_off 1115 if (check_walk_off
1117 && ((move_type & tmp->move_off) 1116 && ((move_type & tmp->move_off)
1118 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1117 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
… …
1241 1240
1242 object *top, *floor = NULL; 1241 object *top, *floor = NULL;
1243 1242
1244 op->remove (); 1243 op->remove ();
1245 1244
1246#if 0
1247 if (!m->active != !op->active)
1248 if (m->active)
1249 op->activate_recursive ();
1250 else
1251 op->deactivate_recursive ();
1252#endif
1253
1254 if (out_of_map (m, op->x, op->y))
1255 {
1256 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1257#ifdef MANY_CORES
1258 /* Better to catch this here, as otherwise the next use of this object
1259 * is likely to cause a crash. Better to find out where it is getting
1260 * improperly inserted.
1261 */
1262 abort ();
1263#endif
1264 return op;
1265 }
1266
1267 if (object *more = op->more)
1268 if (!insert_ob_in_map (more, m, originator, flag))
1269 return 0;
1270
1271 CLEAR_FLAG (op, FLAG_REMOVED);
1272
1273 /* Ideally, the caller figures this out. However, it complicates a lot 1245 /* Ideally, the caller figures this out. However, it complicates a lot
1274 * of areas of callers (eg, anything that uses find_free_spot would now 1246 * of areas of callers (eg, anything that uses find_free_spot would now
1275 * need extra work 1247 * need extra work
1276 */ 1248 */
1277 if (!xy_normalise (m, op->x, op->y)) 1249 if (!xy_normalise (m, op->x, op->y))
1250 {
1251 op->destroy ();
1278 return 0; 1252 return 0;
1253 }
1254
1255 if (object *more = op->more)
1256 if (!insert_ob_in_map (more, m, originator, flag))
1257 return 0;
1258
1259 CLEAR_FLAG (op, FLAG_REMOVED);
1279 1260
1280 op->map = m; 1261 op->map = m;
1281 mapspace &ms = op->ms (); 1262 mapspace &ms = op->ms ();
1282 1263
1283 /* this has to be done after we translate the coordinates. 1264 /* this has to be done after we translate the coordinates.
… …
1318 else 1299 else
1319 { 1300 {
1320 top = ms.bot; 1301 top = ms.bot;
1321 1302
1322 /* If there are other objects, then */ 1303 /* If there are other objects, then */
1323 if ((!(flag & INS_MAP_LOAD)) && top) 1304 if (top)
1324 { 1305 {
1325 object *last = 0; 1306 object *last = 0;
1326 1307
1327 /* 1308 /*
1328 * If there are multiple objects on this space, we do some trickier handling. 1309 * If there are multiple objects on this space, we do some trickier handling.
… …
1380 */ 1361 */
1381 if (last && last->below && last != floor) 1362 if (last && last->below && last != floor)
1382 top = last->below; 1363 top = last->below;
1383 } 1364 }
1384 } /* If objects on this space */ 1365 } /* If objects on this space */
1385 if (flag & INS_MAP_LOAD)
1386 top = ms.top;
1387 1366
1388 if (flag & INS_ABOVE_FLOOR_ONLY) 1367 if (flag & INS_ABOVE_FLOOR_ONLY)
1389 top = floor; 1368 top = floor;
1390 1369
1391 /* Top is the object that our object (op) is going to get inserted above. 1370 /* Top is the object that our object (op) is going to get inserted above.
… …
1424 op->map->touch (); 1403 op->map->touch ();
1425 } 1404 }
1426 1405
1427 op->map->dirty = true; 1406 op->map->dirty = true;
1428 1407
1429 /* If we have a floor, we know the player, if any, will be above
1430 * it, so save a few ticks and start from there.
1431 */
1432 if (!(flag & INS_MAP_LOAD))
1433 if (object *pl = ms.player ()) 1408 if (object *pl = ms.player ())
1434 if (pl->contr->ns)
1435 pl->contr->ns->floorbox_update (); 1409 pl->contr->ns->floorbox_update ();
1436 1410
1437 /* If this object glows, it may affect lighting conditions that are 1411 /* If this object glows, it may affect lighting conditions that are
1438 * visible to others on this map. But update_all_los is really 1412 * visible to others on this map. But update_all_los is really
1439 * an inefficient way to do this, as it means los for all players 1413 * an inefficient way to do this, as it means los for all players
1440 * on the map will get recalculated. The players could very well 1414 * on the map will get recalculated. The players could very well
… …
1678 * be != op, if items are merged. -Tero 1652 * be != op, if items are merged. -Tero
1679 */ 1653 */
1680object * 1654object *
1681object::insert (object *op) 1655object::insert (object *op)
1682{ 1656{
1683 object *tmp, *otmp;
1684
1685 if (!QUERY_FLAG (op, FLAG_REMOVED)) 1657 if (!QUERY_FLAG (op, FLAG_REMOVED))
1686 op->remove (); 1658 op->remove ();
1687 1659
1688 if (op->more) 1660 if (op->more)
1689 { 1661 {
… …
1691 return op; 1663 return op;
1692 } 1664 }
1693 1665
1694 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); 1666 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1695 CLEAR_FLAG (op, FLAG_REMOVED); 1667 CLEAR_FLAG (op, FLAG_REMOVED);
1668
1696 if (op->nrof) 1669 if (op->nrof)
1697 { 1670 {
1698 for (tmp = inv; tmp != NULL; tmp = tmp->below) 1671 for (object *tmp = inv; tmp; tmp = tmp->below)
1699 if (object::can_merge (tmp, op)) 1672 if (object::can_merge (tmp, op))
1700 { 1673 {
1701 /* return the original object and remove inserted object 1674 /* return the original object and remove inserted object
1702 (client needs the original object) */ 1675 (client needs the original object) */
1703 tmp->nrof += op->nrof; 1676 tmp->nrof += op->nrof;
… …
1722 add_weight (this, op->weight * op->nrof); 1695 add_weight (this, op->weight * op->nrof);
1723 } 1696 }
1724 else 1697 else
1725 add_weight (this, (op->weight + op->carrying)); 1698 add_weight (this, (op->weight + op->carrying));
1726 1699
1727 otmp = this->in_player (); 1700 if (object *otmp = this->in_player ())
1728 if (otmp && otmp->contr)
1729 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 1701 if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1730 otmp->update_stats (); 1702 otmp->update_stats ();
1731 1703
1704 op->owner = 0; // its his/hers now. period.
1732 op->map = 0; 1705 op->map = 0;
1733 op->env = this; 1706 op->env = this;
1734 op->above = 0; 1707 op->above = 0;
1735 op->below = 0; 1708 op->below = 0;
1736 op->x = 0, op->y = 0; 1709 op->x = op->y = 0;
1737 1710
1738 /* reset the light list and los of the players on the map */ 1711 /* reset the light list and los of the players on the map */
1739 if ((op->glow_radius != 0) && map) 1712 if (op->glow_radius && map)
1740 { 1713 {
1741#ifdef DEBUG_LIGHTS 1714#ifdef DEBUG_LIGHTS
1742 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); 1715 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1743#endif /* DEBUG_LIGHTS */ 1716#endif /* DEBUG_LIGHTS */
1744 if (map->darkness) 1717 if (map->darkness)
… …
2024 * customized, changed states, etc. 1997 * customized, changed states, etc.
2025 */ 1998 */
2026int 1999int
2027find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) 2000find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2028{ 2001{
2002 int altern[SIZEOFFREE];
2029 int index = 0, flag; 2003 int index = 0, flag;
2030 int altern[SIZEOFFREE];
2031 2004
2032 for (int i = start; i < stop; i++) 2005 for (int i = start; i < stop; i++)
2033 { 2006 {
2034 flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); 2007 mapxy pos (m, x, y); pos.move (i);
2035 if (!flag) 2008
2009 if (!pos.normalise ())
2010 continue;
2011
2012 mapspace &ms = *pos;
2013
2014 if (ms.flags () & P_IS_ALIVE)
2015 continue;
2016
2017 /* However, often
2018 * ob doesn't have any move type (when used to place exits)
2019 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
2020 */
2021 if (ob->move_type == 0 && ms.move_block != MOVE_ALL)
2022 {
2036 altern [index++] = i; 2023 altern [index++] = i;
2024 continue;
2025 }
2037 2026
2038 /* Basically, if we find a wall on a space, we cut down the search size. 2027 /* Basically, if we find a wall on a space, we cut down the search size.
2039 * In this way, we won't return spaces that are on another side of a wall. 2028 * In this way, we won't return spaces that are on another side of a wall.
2040 * This mostly work, but it cuts down the search size in all directions - 2029 * This mostly work, but it cuts down the search size in all directions -
2041 * if the space being examined only has a wall to the north and empty 2030 * if the space being examined only has a wall to the north and empty
2042 * spaces in all the other directions, this will reduce the search space 2031 * spaces in all the other directions, this will reduce the search space
2043 * to only the spaces immediately surrounding the target area, and 2032 * to only the spaces immediately surrounding the target area, and
2044 * won't look 2 spaces south of the target space. 2033 * won't look 2 spaces south of the target space.
2045 */ 2034 */
2046 else if ((flag & P_NO_PASS) && maxfree[i] < stop) 2035 if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
2036 {
2047 stop = maxfree[i]; 2037 stop = maxfree[i];
2038 continue;
2039 }
2040
2041 /* Note it is intentional that we check ob - the movement type of the
2042 * head of the object should correspond for the entire object.
2043 */
2044 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
2045 continue;
2046
2047 altern [index++] = i;
2048 } 2048 }
2049 2049
2050 if (!index) 2050 if (!index)
2051 return -1; 2051 return -1;
2052 2052
… …
2061 */ 2061 */
2062int 2062int
2063find_first_free_spot (const object *ob, maptile *m, int x, int y) 2063find_first_free_spot (const object *ob, maptile *m, int x, int y)
2064{ 2064{
2065 for (int i = 0; i < SIZEOFFREE; i++) 2065 for (int i = 0; i < SIZEOFFREE; i++)
2066 if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) 2066 if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2067 return i; 2067 return i;
2068 2068
2069 return -1; 2069 return -1;
2070} 2070}
2071 2071
… …
2348 * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause 2348 * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2349 * core dumps if they do. 2349 * core dumps if they do.
2350 * 2350 *
2351 * Add a check so we can't pick up invisible objects (0.93.8) 2351 * Add a check so we can't pick up invisible objects (0.93.8)
2352 */ 2352 */
2353
2354int 2353int
2355can_pick (const object *who, const object *item) 2354can_pick (const object *who, const object *item)
2356{ 2355{
2357 return /*QUERY_FLAG(who,FLAG_WIZ)|| */ 2356 return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2358 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && 2357 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
… …
2616 &name, 2615 &name,
2617 title ? "\",title:\"" : "", 2616 title ? "\",title:\"" : "",
2618 title ? (const char *)title : "", 2617 title ? (const char *)title : "",
2619 flag_desc (flagdesc, 512), type); 2618 flag_desc (flagdesc, 512), type);
2620 2619
2621 if (env) 2620 if (!this->flag[FLAG_REMOVED] && env)
2622 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); 2621 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2623 2622
2624 if (map) 2623 if (map)
2625 p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); 2624 p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2626 2625
… …
2673 old_container->flag [FLAG_APPLIED] = 0; 2672 old_container->flag [FLAG_APPLIED] = 0;
2674 container = 0; 2673 container = 0;
2675 2674
2676 esrv_update_item (UPD_FLAGS, this, old_container); 2675 esrv_update_item (UPD_FLAGS, this, old_container);
2677 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); 2676 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2677 play_sound (sound_find ("chest_close"));
2678 } 2678 }
2679 2679
2680 if (new_container) 2680 if (new_container)
2681 { 2681 {
2682 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) 2682 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
… …
2698 new_container->flag [FLAG_APPLIED] = 1; 2698 new_container->flag [FLAG_APPLIED] = 1;
2699 container = new_container; 2699 container = new_container;
2700 2700
2701 esrv_update_item (UPD_FLAGS, this, new_container); 2701 esrv_update_item (UPD_FLAGS, this, new_container);
2702 esrv_send_inventory (this, new_container); 2702 esrv_send_inventory (this, new_container);
2703 play_sound (sound_find ("chest_open"));
2703 } 2704 }
2704} 2705}
2705 2706
2706object * 2707object *
2707object::force_find (const shstr name) 2708object::force_find (const shstr name)
… …
2733 force->flag [FLAG_APPLIED] = true; 2734 force->flag [FLAG_APPLIED] = true;
2734 2735
2735 insert (force); 2736 insert (force);
2736} 2737}
2737 2738
2739void
2740object::play_sound (faceidx sound) const
2741{
2742 if (!sound)
2743 return;
2744
2745 if (flag [FLAG_REMOVED])
2746 return;
2747
2748 if (env)
2749 {
2750 if (object *pl = in_player ())
2751 pl->contr->play_sound (sound);
2752 }
2753 else
2754 map->play_sound (sound, x, y);
2755}
2756

Diff Legend

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