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.184 by root, Wed Aug 22 20:46:46 2007 UTC vs.
Revision 1.201 by root, Tue Jan 22 16:22:45 2008 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software: you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation, either version 3 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version. 11 * (at your option) 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,
… …
16 * GNU General Public License for more details. 16 * GNU General Public License 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
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * 20 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 22 */
23 23
24/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. 24/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25 sub/add_weight will transcend the environment updating the carrying 25 sub/add_weight will transcend the environment updating the carrying
26 variable. */ 26 variable. */
… …
254 /* This is really a spellbook check - really, we should 254 /* This is really a spellbook check - really, we should
255 * check all objects in the inventory. 255 * check all objects in the inventory.
256 */ 256 */
257 if (ob1->inv || ob2->inv) 257 if (ob1->inv || ob2->inv)
258 { 258 {
259 /* if one object has inventory but the other doesn't, not equiv */ 259 if (!(ob1->inv && ob2->inv))
260 if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) 260 return 0; /* inventories differ in length */
261 return 0;
262 261
263 /* Now check to see if the two inventory objects could merge */ 262 if (ob1->inv->below || ob2->inv->below)
263 return 0; /* more than one object in inv */
264
264 if (!object::can_merge (ob1->inv, ob2->inv)) 265 if (!object::can_merge (ob1->inv, ob2->inv))
265 return 0; 266 return 0; /* inventory objexts differ */
266 267
267 /* 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
268 * if it is valid. 269 * if it is valid.
269 */ 270 */
270 } 271 }
… …
305 { 306 {
306 ob1->optimise (); 307 ob1->optimise ();
307 ob2->optimise (); 308 ob2->optimise ();
308 309
309 if (ob1->self || ob2->self) 310 if (ob1->self || ob2->self)
310 if (!cfperl_can_merge (ob1, ob2)) 311 {
312 int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
313 int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
314
315 if (k1 != k2)
311 return 0; 316 return 0;
317 else if (k1 == 0)
318 return 1;
319 else if (!cfperl_can_merge (ob1, ob2))
320 return 0;
321 }
312 } 322 }
313 323
314 /* Everything passes, must be OK. */ 324 /* Everything passes, must be OK. */
315 return 1; 325 return 1;
316} 326}
… …
437{ 447{
438 // allow objects which own objects 448 // allow objects which own objects
439 if (owner) 449 if (owner)
440 while (owner->owner) 450 while (owner->owner)
441 owner = owner->owner; 451 owner = owner->owner;
452
453 if (flag [FLAG_FREED])
454 {
455 LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
456 return;
457 }
442 458
443 this->owner = owner; 459 this->owner = owner;
444} 460}
445 461
446int 462int
… …
578object::copy_to (object *dst) 594object::copy_to (object *dst)
579{ 595{
580 *dst = *this; 596 *dst = *this;
581 597
582 if (speed < 0) 598 if (speed < 0)
583 dst->speed_left = speed_left - rndm (); 599 dst->speed_left -= rndm ();
584 600
585 dst->set_speed (dst->speed); 601 dst->set_speed (dst->speed);
586} 602}
587 603
588void 604void
… …
915 931
916 if (!freed_map) 932 if (!freed_map)
917 { 933 {
918 freed_map = new maptile; 934 freed_map = new maptile;
919 935
936 freed_map->path = "<freed objects map>";
920 freed_map->name = "/internal/freed_objects_map"; 937 freed_map->name = "/internal/freed_objects_map";
921 freed_map->width = 3; 938 freed_map->width = 3;
922 freed_map->height = 3; 939 freed_map->height = 3;
940 freed_map->nodrop = 1;
923 941
924 freed_map->alloc (); 942 freed_map->alloc ();
925 freed_map->in_memory = MAP_IN_MEMORY; 943 freed_map->in_memory = MAP_IN_MEMORY;
926 } 944 }
927 945
… …
1139merge_ob (object *op, object *top) 1157merge_ob (object *op, object *top)
1140{ 1158{
1141 if (!op->nrof) 1159 if (!op->nrof)
1142 return 0; 1160 return 0;
1143 1161
1144 if (top) 1162 if (!top)
1145 for (top = op; top && top->above; top = top->above) 1163 for (top = op; top && top->above; top = top->above)
1146 ; 1164 ;
1147 1165
1148 for (; top; top = top->below) 1166 for (; top; top = top->below)
1149 { 1167 {
… …
1230 1248
1231 object *top, *floor = NULL; 1249 object *top, *floor = NULL;
1232 1250
1233 op->remove (); 1251 op->remove ();
1234 1252
1235 if (out_of_map (m, op->x, op->y))
1236 {
1237 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1238#ifdef MANY_CORES
1239 /* Better to catch this here, as otherwise the next use of this object
1240 * is likely to cause a crash. Better to find out where it is getting
1241 * improperly inserted.
1242 */
1243 abort ();
1244#endif
1245 return op;
1246 }
1247
1248 if (object *more = op->more)
1249 if (!insert_ob_in_map (more, m, originator, flag))
1250 return 0;
1251
1252 CLEAR_FLAG (op, FLAG_REMOVED);
1253
1254 /* Ideally, the caller figures this out. However, it complicates a lot 1253 /* Ideally, the caller figures this out. However, it complicates a lot
1255 * of areas of callers (eg, anything that uses find_free_spot would now 1254 * of areas of callers (eg, anything that uses find_free_spot would now
1256 * need extra work 1255 * need extra work
1257 */ 1256 */
1258 if (!xy_normalise (m, op->x, op->y)) 1257 if (!xy_normalise (m, op->x, op->y))
1258 {
1259 op->destroy ();
1259 return 0; 1260 return 0;
1261 }
1262
1263 if (object *more = op->more)
1264 if (!insert_ob_in_map (more, m, originator, flag))
1265 return 0;
1266
1267 CLEAR_FLAG (op, FLAG_REMOVED);
1260 1268
1261 op->map = m; 1269 op->map = m;
1262 mapspace &ms = op->ms (); 1270 mapspace &ms = op->ms ();
1263 1271
1264 /* this has to be done after we translate the coordinates. 1272 /* this has to be done after we translate the coordinates.
… …
1299 else 1307 else
1300 { 1308 {
1301 top = ms.bot; 1309 top = ms.bot;
1302 1310
1303 /* If there are other objects, then */ 1311 /* If there are other objects, then */
1304 if ((!(flag & INS_MAP_LOAD)) && top) 1312 if (top)
1305 { 1313 {
1306 object *last = 0; 1314 object *last = 0;
1307 1315
1308 /* 1316 /*
1309 * If there are multiple objects on this space, we do some trickier handling. 1317 * If there are multiple objects on this space, we do some trickier handling.
… …
1361 */ 1369 */
1362 if (last && last->below && last != floor) 1370 if (last && last->below && last != floor)
1363 top = last->below; 1371 top = last->below;
1364 } 1372 }
1365 } /* If objects on this space */ 1373 } /* If objects on this space */
1366 if (flag & INS_MAP_LOAD)
1367 top = ms.top;
1368 1374
1369 if (flag & INS_ABOVE_FLOOR_ONLY) 1375 if (flag & INS_ABOVE_FLOOR_ONLY)
1370 top = floor; 1376 top = floor;
1371 1377
1372 /* Top is the object that our object (op) is going to get inserted above. 1378 /* Top is the object that our object (op) is going to get inserted above.
… …
1405 op->map->touch (); 1411 op->map->touch ();
1406 } 1412 }
1407 1413
1408 op->map->dirty = true; 1414 op->map->dirty = true;
1409 1415
1410 if (!(flag & INS_MAP_LOAD))
1411 if (object *pl = ms.player ()) 1416 if (object *pl = ms.player ())
1412 pl->contr->ns->floorbox_update (); 1417 pl->contr->ns->floorbox_update ();
1413 1418
1414 /* If this object glows, it may affect lighting conditions that are 1419 /* If this object glows, it may affect lighting conditions that are
1415 * visible to others on this map. But update_all_los is really 1420 * visible to others on this map. But update_all_los is really
1416 * an inefficient way to do this, as it means los for all players 1421 * an inefficient way to do this, as it means los for all players
1417 * on the map will get recalculated. The players could very well 1422 * on the map will get recalculated. The players could very well
… …
1954 * activate recursively a flag on an object inventory 1959 * activate recursively a flag on an object inventory
1955 */ 1960 */
1956void 1961void
1957flag_inv (object *op, int flag) 1962flag_inv (object *op, int flag)
1958{ 1963{
1959 if (op->inv)
1960 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1964 for (object *tmp = op->inv; tmp; tmp = tmp->below)
1961 { 1965 {
1962 SET_FLAG (tmp, flag); 1966 SET_FLAG (tmp, flag);
1963 flag_inv (tmp, flag); 1967 flag_inv (tmp, flag);
1964 } 1968 }
1965} 1969}
1966 1970
1967/* 1971/*
1968 * deactivate recursively a flag on an object inventory 1972 * deactivate recursively a flag on an object inventory
1969 */ 1973 */
1970void 1974void
1971unflag_inv (object *op, int flag) 1975unflag_inv (object *op, int flag)
1972{ 1976{
1973 if (op->inv)
1974 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1977 for (object *tmp = op->inv; tmp; tmp = tmp->below)
1975 { 1978 {
1976 CLEAR_FLAG (tmp, flag); 1979 CLEAR_FLAG (tmp, flag);
1977 unflag_inv (tmp, flag); 1980 unflag_inv (tmp, flag);
1978 } 1981 }
1979} 1982}
1980 1983
1981/* 1984/*
1982 * find_free_spot(object, map, x, y, start, stop) will search for 1985 * find_free_spot(object, map, x, y, start, stop) will search for
1983 * a spot at the given map and coordinates which will be able to contain 1986 * a spot at the given map and coordinates which will be able to contain
… …
1985 * to search (see the freearr_x/y[] definition). 1988 * to search (see the freearr_x/y[] definition).
1986 * It returns a random choice among the alternatives found. 1989 * It returns a random choice among the alternatives found.
1987 * start and stop are where to start relative to the free_arr array (1,9 1990 * start and stop are where to start relative to the free_arr array (1,9
1988 * does all 4 immediate directions). This returns the index into the 1991 * does all 4 immediate directions). This returns the index into the
1989 * array of the free spot, -1 if no spot available (dir 0 = x,y) 1992 * array of the free spot, -1 if no spot available (dir 0 = x,y)
1990 * Note - this only checks to see if there is space for the head of the
1991 * object - if it is a multispace object, this should be called for all
1992 * pieces.
1993 * Note2: This function does correctly handle tiled maps, but does not 1993 * Note: This function does correctly handle tiled maps, but does not
1994 * inform the caller. However, insert_ob_in_map will update as 1994 * inform the caller. However, insert_ob_in_map will update as
1995 * necessary, so the caller shouldn't need to do any special work. 1995 * necessary, so the caller shouldn't need to do any special work.
1996 * Note - updated to take an object instead of archetype - this is necessary 1996 * Note - updated to take an object instead of archetype - this is necessary
1997 * because arch_blocked (now ob_blocked) needs to know the movement type 1997 * because arch_blocked (now ob_blocked) needs to know the movement type
1998 * to know if the space in question will block the object. We can't use 1998 * to know if the space in question will block the object. We can't use
… …
2000 * customized, changed states, etc. 2000 * customized, changed states, etc.
2001 */ 2001 */
2002int 2002int
2003find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) 2003find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2004{ 2004{
2005 int altern[SIZEOFFREE];
2005 int index = 0, flag; 2006 int index = 0, flag;
2006 int altern[SIZEOFFREE];
2007 2007
2008 for (int i = start; i < stop; i++) 2008 for (int i = start; i < stop; i++)
2009 { 2009 {
2010 flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); 2010 mapxy pos (m, x, y); pos.move (i);
2011 if (!flag) 2011
2012 if (!pos.normalise ())
2013 continue;
2014
2015 mapspace &ms = *pos;
2016
2017 if (ms.flags () & P_IS_ALIVE)
2018 continue;
2019
2020 /* However, often
2021 * ob doesn't have any move type (when used to place exits)
2022 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
2023 */
2024 if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
2025 {
2012 altern [index++] = i; 2026 altern [index++] = i;
2027 continue;
2028 }
2013 2029
2014 /* Basically, if we find a wall on a space, we cut down the search size. 2030 /* Basically, if we find a wall on a space, we cut down the search size.
2015 * In this way, we won't return spaces that are on another side of a wall. 2031 * In this way, we won't return spaces that are on another side of a wall.
2016 * This mostly work, but it cuts down the search size in all directions - 2032 * This mostly work, but it cuts down the search size in all directions -
2017 * if the space being examined only has a wall to the north and empty 2033 * if the space being examined only has a wall to the north and empty
2018 * spaces in all the other directions, this will reduce the search space 2034 * spaces in all the other directions, this will reduce the search space
2019 * to only the spaces immediately surrounding the target area, and 2035 * to only the spaces immediately surrounding the target area, and
2020 * won't look 2 spaces south of the target space. 2036 * won't look 2 spaces south of the target space.
2021 */ 2037 */
2022 else if ((flag & P_NO_PASS) && maxfree[i] < stop) 2038 if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
2039 {
2023 stop = maxfree[i]; 2040 stop = maxfree[i];
2041 continue;
2042 }
2043
2044 /* Note it is intentional that we check ob - the movement type of the
2045 * head of the object should correspond for the entire object.
2046 */
2047 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
2048 continue;
2049
2050 if (ob->blocked (m, pos.x, pos.y))
2051 continue;
2052
2053 altern [index++] = i;
2024 } 2054 }
2025 2055
2026 if (!index) 2056 if (!index)
2027 return -1; 2057 return -1;
2028 2058
… …
2037 */ 2067 */
2038int 2068int
2039find_first_free_spot (const object *ob, maptile *m, int x, int y) 2069find_first_free_spot (const object *ob, maptile *m, int x, int y)
2040{ 2070{
2041 for (int i = 0; i < SIZEOFFREE; i++) 2071 for (int i = 0; i < SIZEOFFREE; i++)
2042 if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) 2072 if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2043 return i; 2073 return i;
2044 2074
2045 return -1; 2075 return -1;
2046} 2076}
2047 2077

Diff Legend

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