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.191 by root, Sun Sep 30 20:22:15 2007 UTC vs.
Revision 1.199 by root, Thu Nov 8 19:43:23 2007 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
1140merge_ob (object *op, object *top) 1156merge_ob (object *op, object *top)
1141{ 1157{
1142 if (!op->nrof) 1158 if (!op->nrof)
1143 return 0; 1159 return 0;
1144 1160
1145 if (top) 1161 if (!top)
1146 for (top = op; top && top->above; top = top->above) 1162 for (top = op; top && top->above; top = top->above)
1147 ; 1163 ;
1148 1164
1149 for (; top; top = top->below) 1165 for (; top; top = top->below)
1150 { 1166 {
1942 * activate recursively a flag on an object inventory 1958 * activate recursively a flag on an object inventory
1943 */ 1959 */
1944void 1960void
1945flag_inv (object *op, int flag) 1961flag_inv (object *op, int flag)
1946{ 1962{
1947 if (op->inv)
1948 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1963 for (object *tmp = op->inv; tmp; tmp = tmp->below)
1949 { 1964 {
1950 SET_FLAG (tmp, flag); 1965 SET_FLAG (tmp, flag);
1951 flag_inv (tmp, flag); 1966 flag_inv (tmp, flag);
1952 } 1967 }
1953} 1968}
1954 1969
1955/* 1970/*
1956 * deactivate recursively a flag on an object inventory 1971 * deactivate recursively a flag on an object inventory
1957 */ 1972 */
1958void 1973void
1959unflag_inv (object *op, int flag) 1974unflag_inv (object *op, int flag)
1960{ 1975{
1961 if (op->inv)
1962 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1976 for (object *tmp = op->inv; tmp; tmp = tmp->below)
1963 { 1977 {
1964 CLEAR_FLAG (tmp, flag); 1978 CLEAR_FLAG (tmp, flag);
1965 unflag_inv (tmp, flag); 1979 unflag_inv (tmp, flag);
1966 } 1980 }
1967} 1981}
1968 1982
1969/* 1983/*
1970 * find_free_spot(object, map, x, y, start, stop) will search for 1984 * find_free_spot(object, map, x, y, start, stop) will search for
1971 * a spot at the given map and coordinates which will be able to contain 1985 * a spot at the given map and coordinates which will be able to contain
1973 * to search (see the freearr_x/y[] definition). 1987 * to search (see the freearr_x/y[] definition).
1974 * It returns a random choice among the alternatives found. 1988 * It returns a random choice among the alternatives found.
1975 * start and stop are where to start relative to the free_arr array (1,9 1989 * start and stop are where to start relative to the free_arr array (1,9
1976 * does all 4 immediate directions). This returns the index into the 1990 * does all 4 immediate directions). This returns the index into the
1977 * array of the free spot, -1 if no spot available (dir 0 = x,y) 1991 * array of the free spot, -1 if no spot available (dir 0 = x,y)
1978 * Note - this only checks to see if there is space for the head of the
1979 * object - if it is a multispace object, this should be called for all
1980 * pieces.
1981 * Note2: This function does correctly handle tiled maps, but does not 1992 * Note: This function does correctly handle tiled maps, but does not
1982 * inform the caller. However, insert_ob_in_map will update as 1993 * inform the caller. However, insert_ob_in_map will update as
1983 * necessary, so the caller shouldn't need to do any special work. 1994 * necessary, so the caller shouldn't need to do any special work.
1984 * Note - updated to take an object instead of archetype - this is necessary 1995 * Note - updated to take an object instead of archetype - this is necessary
1985 * because arch_blocked (now ob_blocked) needs to know the movement type 1996 * because arch_blocked (now ob_blocked) needs to know the movement type
1986 * to know if the space in question will block the object. We can't use 1997 * to know if the space in question will block the object. We can't use
2031 2042
2032 /* Note it is intentional that we check ob - the movement type of the 2043 /* Note it is intentional that we check ob - the movement type of the
2033 * head of the object should correspond for the entire object. 2044 * head of the object should correspond for the entire object.
2034 */ 2045 */
2035 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 2046 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
2047 continue;
2048
2049 if (ob->blocked (m, pos.x, pos.y))
2036 continue; 2050 continue;
2037 2051
2038 altern [index++] = i; 2052 altern [index++] = i;
2039 } 2053 }
2040 2054

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines