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.46 by root, Thu Sep 14 21:16:11 2006 UTC vs.
Revision 1.52 by root, Wed Sep 27 00:36:08 2006 UTC

1
2/* 1/*
3 CrossFire, A Multiplayer game for X-windows 2 CrossFire, A Multiplayer game for X-windows
4 3
5 Copyright (C) 2001 Mark Wedel & Crossfire Development Team 4 Copyright (C) 2001 Mark Wedel & Crossfire Development Team
6 Copyright (C) 1992 Frank Tore Johansen 5 Copyright (C) 1992 Frank Tore Johansen
17 16
18 You should have received a copy of the GNU General Public License 17 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software 18 along with this program; if not, write to the Free Software
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 20
22 The authors can be reached via e-mail at crossfire-devel@real-time.com 21 The authors can be reached via e-mail at <crossfire@schmorp.de>
23*/ 22*/
24 23
25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. 24/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26 sub/add_weight will transcend the environment updating the carrying 25 sub/add_weight will transcend the environment updating the carrying
27 variable. */ 26 variable. */
449 object *op; 448 object *op;
450 449
451 for (op = object::first; op != NULL; op = op->next) 450 for (op = object::first; op != NULL; op = op->next)
452 { 451 {
453 dump_object (op); 452 dump_object (op);
454 fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg); 453 fprintf (logfile, "Object %s\n", errmsg);
455 } 454 }
456} 455}
457 456
458/* 457/*
459 * get_nearest_part(multi-object, object 2) returns the part of the 458 * get_nearest_part(multi-object, object 2) returns the part of the
485 object *op; 484 object *op;
486 485
487 for (op = object::first; op != NULL; op = op->next) 486 for (op = object::first; op != NULL; op = op->next)
488 if (op->count == i) 487 if (op->count == i)
489 break; 488 break;
489
490 return op; 490 return op;
491} 491}
492 492
493/* 493/*
494 * Returns the first object which has a name equal to the argument. 494 * Returns the first object which has a name equal to the argument.
911 mortals.erase (i); 911 mortals.erase (i);
912 } 912 }
913 913
914 static int lastmortals = 0;//D 914 static int lastmortals = 0;//D
915 915
916 if (mortals.size() != lastmortals)//D 916 if (mortals.size() != lastmortals && lastmortals > 100)//D
917 { 917 {
918 lastmortals = mortals.size ();//D 918 lastmortals = mortals.size ();//D
919 LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D 919 LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D
920 } 920 }
921} 921}
947 object::first = this; 947 object::first = this;
948} 948}
949 949
950void object::unlink () 950void object::unlink ()
951{ 951{
952 //count = 0;//D
953 if (!prev && !next) return;//D
954
955 if (this == object::first) 952 if (this == object::first)
956 object::first = next; 953 object::first = next;
957 954
958 /* Remove this object from the list of used objects */ 955 /* Remove this object from the list of used objects */
959 if (prev) prev->next = next; 956 if (prev) prev->next = next;
975 * it from the list of used objects, and puts it on the list of 972 * it from the list of used objects, and puts it on the list of
976 * free objects. The IS_FREED() flag is set in the object. 973 * free objects. The IS_FREED() flag is set in the object.
977 * The object must have been removed by remove_ob() first for 974 * The object must have been removed by remove_ob() first for
978 * this function to succeed. 975 * this function to succeed.
979 * 976 *
980 * If free_inventory is set, free inventory as well. Else drop items in 977 * If destroy_inventory is set, free inventory as well. Else drop items in
981 * inventory to the ground. 978 * inventory to the ground.
982 */ 979 */
983void object::free (bool free_inventory) 980void object::destroy (bool destroy_inventory)
984{ 981{
985 if (QUERY_FLAG (this, FLAG_FREED)) 982 if (QUERY_FLAG (this, FLAG_FREED))
986 return; 983 return;
987 984
988 if (QUERY_FLAG (this, FLAG_FRIENDLY)) 985 if (QUERY_FLAG (this, FLAG_FRIENDLY))
993 990
994 SET_FLAG (this, FLAG_FREED); 991 SET_FLAG (this, FLAG_FREED);
995 992
996 if (more) 993 if (more)
997 { 994 {
998 more->free (free_inventory); 995 more->destroy (destroy_inventory);
999 more = 0; 996 more = 0;
1000 } 997 }
1001 998
1002 if (inv) 999 if (inv)
1003 { 1000 {
1004 /* Only if the space blocks everything do we not process - 1001 /* Only if the space blocks everything do we not process -
1005 * if some form of movement is allowed, let objects 1002 * if some form of movement is allowed, let objects
1006 * drop on that space. 1003 * drop on that space.
1007 */ 1004 */
1008 if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) 1005 if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
1009 { 1006 {
1010 object *op = inv; 1007 object *op = inv;
1011 1008
1012 while (op) 1009 while (op)
1013 { 1010 {
1014 object *tmp = op->below; 1011 object *tmp = op->below;
1015 op->free (free_inventory); 1012 op->destroy (destroy_inventory);
1016 op = tmp; 1013 op = tmp;
1017 } 1014 }
1018 } 1015 }
1019 else 1016 else
1020 { /* Put objects in inventory onto this space */ 1017 { /* Put objects in inventory onto this space */
1044 // clear those pointers that likely might have circular references to us 1041 // clear those pointers that likely might have circular references to us
1045 owner = 0; 1042 owner = 0;
1046 enemy = 0; 1043 enemy = 0;
1047 attacked_by = 0; 1044 attacked_by = 0;
1048 1045
1046 // only relevant for players(?), but make sure of it anyways
1047 contr = 0;
1048
1049 /* Remove object from the active list */ 1049 /* Remove object from the active list */
1050 speed = 0; 1050 speed = 0;
1051 update_ob_speed (this); 1051 update_ob_speed (this);
1052 1052
1053 unlink (); 1053 unlink ();
1086remove_ob (object *op) 1086remove_ob (object *op)
1087{ 1087{
1088 object *tmp, *last = 0; 1088 object *tmp, *last = 0;
1089 object *otmp; 1089 object *otmp;
1090 1090
1091 tag_t tag;
1092 int check_walk_off; 1091 int check_walk_off;
1093 mapstruct *m; 1092 maptile *m;
1094 1093
1095 sint16 x, y; 1094 sint16 x, y;
1096 1095
1097 if (QUERY_FLAG (op, FLAG_REMOVED)) 1096 if (QUERY_FLAG (op, FLAG_REMOVED))
1098 return; 1097 return;
1193 op->below = 0; 1192 op->below = 0;
1194 1193
1195 if (op->map->in_memory == MAP_SAVING) 1194 if (op->map->in_memory == MAP_SAVING)
1196 return; 1195 return;
1197 1196
1198 tag = op->count;
1199 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); 1197 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1200 1198
1201 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1199 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1202 { 1200 {
1203 /* No point updating the players look faces if he is the object 1201 /* No point updating the players look faces if he is the object
1218 1216
1219 tmp->contr->socket.update_look = 1; 1217 tmp->contr->socket.update_look = 1;
1220 } 1218 }
1221 1219
1222 /* See if player moving off should effect something */ 1220 /* See if player moving off should effect something */
1223 if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1221 if (check_walk_off
1222 && ((op->move_type & tmp->move_off)
1223 && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1224 { 1224 {
1225 move_apply (tmp, op, NULL); 1225 move_apply (tmp, op, NULL);
1226 1226
1227 if (was_destroyed (op, tag)) 1227 if (op->destroyed ())
1228 {
1229 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name); 1228 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1230 }
1231 } 1229 }
1232 1230
1233 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ 1231 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1234 1232
1235 if (tmp->above == tmp) 1233 if (tmp->above == tmp)
1296/* 1294/*
1297 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1295 * same as insert_ob_in_map except it handle separate coordinates and do a clean
1298 * job preparing multi-part monsters 1296 * job preparing multi-part monsters
1299 */ 1297 */
1300object * 1298object *
1301insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y) 1299insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1302{ 1300{
1303 object *tmp; 1301 object *tmp;
1304 1302
1305 if (op->head) 1303 if (op->head)
1306 op = op->head; 1304 op = op->head;
1334 * NULL if 'op' was destroyed 1332 * NULL if 'op' was destroyed
1335 * just 'op' otherwise 1333 * just 'op' otherwise
1336 */ 1334 */
1337 1335
1338object * 1336object *
1339insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag) 1337insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1340{ 1338{
1341 object *tmp, *top, *floor = NULL; 1339 object *tmp, *top, *floor = NULL;
1342 sint16 x, y; 1340 sint16 x, y;
1343 1341
1344 if (QUERY_FLAG (op, FLAG_FREED)) 1342 if (QUERY_FLAG (op, FLAG_FREED))
1934 */ 1932 */
1935 1933
1936int 1934int
1937check_move_on (object *op, object *originator) 1935check_move_on (object *op, object *originator)
1938{ 1936{
1939 object * 1937 object *tmp;
1940 tmp; 1938 maptile *m = op->map;
1941 tag_t
1942 tag;
1943 mapstruct *
1944 m = op->map;
1945 int
1946 x = op->x, y = op->y; 1939 int x = op->x, y = op->y;
1947 1940
1948 MoveType 1941 MoveType move_on, move_slow, move_block;
1949 move_on,
1950 move_slow,
1951 move_block;
1952 1942
1953 if (QUERY_FLAG (op, FLAG_NO_APPLY)) 1943 if (QUERY_FLAG (op, FLAG_NO_APPLY))
1954 return 0; 1944 return 0;
1955
1956 tag = op->count;
1957 1945
1958 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); 1946 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
1959 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); 1947 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
1960 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); 1948 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
1961 1949
2022 if ((!op->move_type && tmp->move_on & MOVE_WALK) || 2010 if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
2023 ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) 2011 ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
2024 { 2012 {
2025 move_apply (tmp, op, originator); 2013 move_apply (tmp, op, originator);
2026 2014
2027 if (was_destroyed (op, tag)) 2015 if (op->destroyed ())
2028 return 1; 2016 return 1;
2029 2017
2030 /* what the person/creature stepped onto has moved the object 2018 /* what the person/creature stepped onto has moved the object
2031 * someplace new. Don't process any further - if we did, 2019 * someplace new. Don't process any further - if we did,
2032 * have a feeling strange problems would result. 2020 * have a feeling strange problems would result.
2044 * a matching archetype at the given map and coordinates. 2032 * a matching archetype at the given map and coordinates.
2045 * The first matching object is returned, or NULL if none. 2033 * The first matching object is returned, or NULL if none.
2046 */ 2034 */
2047 2035
2048object * 2036object *
2049present_arch (const archetype *at, mapstruct *m, int x, int y) 2037present_arch (const archetype *at, maptile *m, int x, int y)
2050{ 2038{
2051 object * 2039 object *
2052 tmp; 2040 tmp;
2053 2041
2054 if (m == NULL || out_of_map (m, x, y)) 2042 if (m == NULL || out_of_map (m, x, y))
2067 * a matching type variable at the given map and coordinates. 2055 * a matching type variable at the given map and coordinates.
2068 * The first matching object is returned, or NULL if none. 2056 * The first matching object is returned, or NULL if none.
2069 */ 2057 */
2070 2058
2071object * 2059object *
2072present (unsigned char type, mapstruct *m, int x, int y) 2060present (unsigned char type, maptile *m, int x, int y)
2073{ 2061{
2074 object * 2062 object *
2075 tmp; 2063 tmp;
2076 2064
2077 if (out_of_map (m, x, y)) 2065 if (out_of_map (m, x, y))
2217 * the archetype because that isn't correct if the monster has been 2205 * the archetype because that isn't correct if the monster has been
2218 * customized, changed states, etc. 2206 * customized, changed states, etc.
2219 */ 2207 */
2220 2208
2221int 2209int
2222find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop) 2210find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2223{ 2211{
2224 int 2212 int
2225 i, 2213 i,
2226 index = 0, flag; 2214 index = 0, flag;
2227 static int 2215 static int
2248 return -1; 2236 return -1;
2249 return altern[RANDOM () % index]; 2237 return altern[RANDOM () % index];
2250} 2238}
2251 2239
2252/* 2240/*
2253 * find_first_free_spot(archetype, mapstruct, x, y) works like 2241 * find_first_free_spot(archetype, maptile, x, y) works like
2254 * find_free_spot(), but it will search max number of squares. 2242 * find_free_spot(), but it will search max number of squares.
2255 * But it will return the first available spot, not a random choice. 2243 * But it will return the first available spot, not a random choice.
2256 * Changed 0.93.2: Have it return -1 if there is no free spot available. 2244 * Changed 0.93.2: Have it return -1 if there is no free spot available.
2257 */ 2245 */
2258 2246
2259int 2247int
2260find_first_free_spot (const object *ob, mapstruct *m, int x, int y) 2248find_first_free_spot (const object *ob, maptile *m, int x, int y)
2261{ 2249{
2262 int 2250 int
2263 i; 2251 i;
2264 2252
2265 for (i = 0; i < SIZEOFFREE; i++) 2253 for (i = 0; i < SIZEOFFREE; i++)
2329 * because we have to know what movement the thing looking to move 2317 * because we have to know what movement the thing looking to move
2330 * there is capable of. 2318 * there is capable of.
2331 */ 2319 */
2332 2320
2333int 2321int
2334find_dir (mapstruct *m, int x, int y, object *exclude) 2322find_dir (maptile *m, int x, int y, object *exclude)
2335{ 2323{
2336 int 2324 int
2337 i, 2325 i,
2338 max = SIZEOFFREE, mflags; 2326 max = SIZEOFFREE, mflags;
2339 2327
2340 sint16 nx, ny; 2328 sint16 nx, ny;
2341 object * 2329 object *
2342 tmp; 2330 tmp;
2343 mapstruct * 2331 maptile *
2344 mp; 2332 mp;
2345 2333
2346 MoveType blocked, move_type; 2334 MoveType blocked, move_type;
2347 2335
2348 if (exclude && exclude->head) 2336 if (exclude && exclude->head)
2556 * Modified to be map tile aware -.MSW 2544 * Modified to be map tile aware -.MSW
2557 */ 2545 */
2558 2546
2559 2547
2560int 2548int
2561can_see_monsterP (mapstruct *m, int x, int y, int dir) 2549can_see_monsterP (maptile *m, int x, int y, int dir)
2562{ 2550{
2563 sint16 dx, dy; 2551 sint16 dx, dy;
2564 int 2552 int
2565 mflags; 2553 mflags;
2566 2554
2646 if (prev) 2634 if (prev)
2647 prev->more = tmp; 2635 prev->more = tmp;
2648 prev = tmp; 2636 prev = tmp;
2649 } 2637 }
2650 2638
2651 /*** copy inventory ***/
2652 for (item = src->inv; item; item = item->below) 2639 for (item = src->inv; item; item = item->below)
2653 {
2654 (void) insert_ob_in_ob (object_create_clone (item), dst); 2640 insert_ob_in_ob (object_create_clone (item), dst);
2655 }
2656 2641
2657 return dst; 2642 return dst;
2658} 2643}
2659 2644
2660/* return true if the object was destroyed, 0 otherwise */
2661int
2662was_destroyed (const object *op, tag_t old_tag)
2663{
2664 /* checking for FLAG_FREED isn't necessary, but makes this function more
2665 * robust */
2666 return op->count != old_tag || QUERY_FLAG (op, FLAG_FREED);
2667}
2668
2669/* GROS - Creates an object using a string representing its content. */ 2645/* GROS - Creates an object using a string representing its content. */
2670
2671/* Basically, we save the content of the string to a temp file, then call */ 2646/* Basically, we save the content of the string to a temp file, then call */
2672
2673/* load_object on it. I admit it is a highly inefficient way to make things, */ 2647/* load_object on it. I admit it is a highly inefficient way to make things, */
2674
2675/* but it was simple to make and allows reusing the load_object function. */ 2648/* but it was simple to make and allows reusing the load_object function. */
2676
2677/* Remember not to use load_object_str in a time-critical situation. */ 2649/* Remember not to use load_object_str in a time-critical situation. */
2678
2679/* Also remember that multiparts objects are not supported for now. */ 2650/* Also remember that multiparts objects are not supported for now. */
2680 2651
2681object * 2652object *
2682load_object_str (const char *obstr) 2653load_object_str (const char *obstr)
2683{ 2654{
2684 object * 2655 object *op;
2685 op;
2686 char
2687 filename[MAX_BUF]; 2656 char filename[MAX_BUF];
2688 2657
2689 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); 2658 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2690 2659
2691 FILE *
2692 tempfile = fopen (filename, "w"); 2660 FILE *tempfile = fopen (filename, "w");
2693 2661
2694 if (tempfile == NULL) 2662 if (tempfile == NULL)
2695 { 2663 {
2696 LOG (llevError, "Error - Unable to access load object temp file\n"); 2664 LOG (llevError, "Error - Unable to access load object temp file\n");
2697 return NULL; 2665 return NULL;
2718 * returns NULL if no match. 2686 * returns NULL if no match.
2719 */ 2687 */
2720object * 2688object *
2721find_obj_by_type_subtype (const object *who, int type, int subtype) 2689find_obj_by_type_subtype (const object *who, int type, int subtype)
2722{ 2690{
2723 object * 2691 object *tmp;
2724 tmp;
2725 2692
2726 for (tmp = who->inv; tmp; tmp = tmp->below) 2693 for (tmp = who->inv; tmp; tmp = tmp->below)
2727 if (tmp->type == type && tmp->subtype == subtype) 2694 if (tmp->type == type && tmp->subtype == subtype)
2728 return tmp; 2695 return tmp;
2729 2696
2737 * do the desired thing. 2704 * do the desired thing.
2738 */ 2705 */
2739key_value * 2706key_value *
2740get_ob_key_link (const object *ob, const char *key) 2707get_ob_key_link (const object *ob, const char *key)
2741{ 2708{
2742 key_value * 2709 key_value *link;
2743 link;
2744 2710
2745 for (link = ob->key_values; link != NULL; link = link->next) 2711 for (link = ob->key_values; link != NULL; link = link->next)
2746 {
2747 if (link->key == key) 2712 if (link->key == key)
2748 {
2749 return link; 2713 return link;
2750 }
2751 }
2752 2714
2753 return NULL; 2715 return NULL;
2754} 2716}
2755 2717
2756/* 2718/*

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines