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.51 by root, Sun Sep 17 16:21:53 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;
1086remove_ob (object *op) 1083remove_ob (object *op)
1087{ 1084{
1088 object *tmp, *last = 0; 1085 object *tmp, *last = 0;
1089 object *otmp; 1086 object *otmp;
1090 1087
1091 tag_t tag;
1092 int check_walk_off; 1088 int check_walk_off;
1093 mapstruct *m; 1089 maptile *m;
1094 1090
1095 sint16 x, y; 1091 sint16 x, y;
1096 1092
1097 if (QUERY_FLAG (op, FLAG_REMOVED)) 1093 if (QUERY_FLAG (op, FLAG_REMOVED))
1098 return; 1094 return;
1193 op->below = 0; 1189 op->below = 0;
1194 1190
1195 if (op->map->in_memory == MAP_SAVING) 1191 if (op->map->in_memory == MAP_SAVING)
1196 return; 1192 return;
1197 1193
1198 tag = op->count;
1199 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); 1194 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1200 1195
1201 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1196 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1202 { 1197 {
1203 /* No point updating the players look faces if he is the object 1198 /* No point updating the players look faces if he is the object
1218 1213
1219 tmp->contr->socket.update_look = 1; 1214 tmp->contr->socket.update_look = 1;
1220 } 1215 }
1221 1216
1222 /* See if player moving off should effect something */ 1217 /* 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)) 1218 if (check_walk_off
1219 && ((op->move_type & tmp->move_off)
1220 && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1224 { 1221 {
1225 move_apply (tmp, op, NULL); 1222 move_apply (tmp, op, NULL);
1226 1223
1227 if (was_destroyed (op, tag)) 1224 if (op->destroyed ())
1228 {
1229 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name); 1225 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1230 }
1231 } 1226 }
1232 1227
1233 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ 1228 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1234 1229
1235 if (tmp->above == tmp) 1230 if (tmp->above == tmp)
1296/* 1291/*
1297 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1292 * same as insert_ob_in_map except it handle separate coordinates and do a clean
1298 * job preparing multi-part monsters 1293 * job preparing multi-part monsters
1299 */ 1294 */
1300object * 1295object *
1301insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y) 1296insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1302{ 1297{
1303 object *tmp; 1298 object *tmp;
1304 1299
1305 if (op->head) 1300 if (op->head)
1306 op = op->head; 1301 op = op->head;
1334 * NULL if 'op' was destroyed 1329 * NULL if 'op' was destroyed
1335 * just 'op' otherwise 1330 * just 'op' otherwise
1336 */ 1331 */
1337 1332
1338object * 1333object *
1339insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag) 1334insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1340{ 1335{
1341 object *tmp, *top, *floor = NULL; 1336 object *tmp, *top, *floor = NULL;
1342 sint16 x, y; 1337 sint16 x, y;
1343 1338
1344 if (QUERY_FLAG (op, FLAG_FREED)) 1339 if (QUERY_FLAG (op, FLAG_FREED))
1934 */ 1929 */
1935 1930
1936int 1931int
1937check_move_on (object *op, object *originator) 1932check_move_on (object *op, object *originator)
1938{ 1933{
1939 object * 1934 object *tmp;
1940 tmp; 1935 maptile *m = op->map;
1941 tag_t
1942 tag;
1943 mapstruct *
1944 m = op->map;
1945 int
1946 x = op->x, y = op->y; 1936 int x = op->x, y = op->y;
1947 1937
1948 MoveType 1938 MoveType move_on, move_slow, move_block;
1949 move_on,
1950 move_slow,
1951 move_block;
1952 1939
1953 if (QUERY_FLAG (op, FLAG_NO_APPLY)) 1940 if (QUERY_FLAG (op, FLAG_NO_APPLY))
1954 return 0; 1941 return 0;
1955
1956 tag = op->count;
1957 1942
1958 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); 1943 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); 1944 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); 1945 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
1961 1946
2022 if ((!op->move_type && tmp->move_on & MOVE_WALK) || 2007 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)) 2008 ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
2024 { 2009 {
2025 move_apply (tmp, op, originator); 2010 move_apply (tmp, op, originator);
2026 2011
2027 if (was_destroyed (op, tag)) 2012 if (op->destroyed ())
2028 return 1; 2013 return 1;
2029 2014
2030 /* what the person/creature stepped onto has moved the object 2015 /* what the person/creature stepped onto has moved the object
2031 * someplace new. Don't process any further - if we did, 2016 * someplace new. Don't process any further - if we did,
2032 * have a feeling strange problems would result. 2017 * have a feeling strange problems would result.
2044 * a matching archetype at the given map and coordinates. 2029 * a matching archetype at the given map and coordinates.
2045 * The first matching object is returned, or NULL if none. 2030 * The first matching object is returned, or NULL if none.
2046 */ 2031 */
2047 2032
2048object * 2033object *
2049present_arch (const archetype *at, mapstruct *m, int x, int y) 2034present_arch (const archetype *at, maptile *m, int x, int y)
2050{ 2035{
2051 object * 2036 object *
2052 tmp; 2037 tmp;
2053 2038
2054 if (m == NULL || out_of_map (m, x, y)) 2039 if (m == NULL || out_of_map (m, x, y))
2067 * a matching type variable at the given map and coordinates. 2052 * a matching type variable at the given map and coordinates.
2068 * The first matching object is returned, or NULL if none. 2053 * The first matching object is returned, or NULL if none.
2069 */ 2054 */
2070 2055
2071object * 2056object *
2072present (unsigned char type, mapstruct *m, int x, int y) 2057present (unsigned char type, maptile *m, int x, int y)
2073{ 2058{
2074 object * 2059 object *
2075 tmp; 2060 tmp;
2076 2061
2077 if (out_of_map (m, x, y)) 2062 if (out_of_map (m, x, y))
2217 * the archetype because that isn't correct if the monster has been 2202 * the archetype because that isn't correct if the monster has been
2218 * customized, changed states, etc. 2203 * customized, changed states, etc.
2219 */ 2204 */
2220 2205
2221int 2206int
2222find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop) 2207find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2223{ 2208{
2224 int 2209 int
2225 i, 2210 i,
2226 index = 0, flag; 2211 index = 0, flag;
2227 static int 2212 static int
2248 return -1; 2233 return -1;
2249 return altern[RANDOM () % index]; 2234 return altern[RANDOM () % index];
2250} 2235}
2251 2236
2252/* 2237/*
2253 * find_first_free_spot(archetype, mapstruct, x, y) works like 2238 * find_first_free_spot(archetype, maptile, x, y) works like
2254 * find_free_spot(), but it will search max number of squares. 2239 * find_free_spot(), but it will search max number of squares.
2255 * But it will return the first available spot, not a random choice. 2240 * 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. 2241 * Changed 0.93.2: Have it return -1 if there is no free spot available.
2257 */ 2242 */
2258 2243
2259int 2244int
2260find_first_free_spot (const object *ob, mapstruct *m, int x, int y) 2245find_first_free_spot (const object *ob, maptile *m, int x, int y)
2261{ 2246{
2262 int 2247 int
2263 i; 2248 i;
2264 2249
2265 for (i = 0; i < SIZEOFFREE; i++) 2250 for (i = 0; i < SIZEOFFREE; i++)
2329 * because we have to know what movement the thing looking to move 2314 * because we have to know what movement the thing looking to move
2330 * there is capable of. 2315 * there is capable of.
2331 */ 2316 */
2332 2317
2333int 2318int
2334find_dir (mapstruct *m, int x, int y, object *exclude) 2319find_dir (maptile *m, int x, int y, object *exclude)
2335{ 2320{
2336 int 2321 int
2337 i, 2322 i,
2338 max = SIZEOFFREE, mflags; 2323 max = SIZEOFFREE, mflags;
2339 2324
2340 sint16 nx, ny; 2325 sint16 nx, ny;
2341 object * 2326 object *
2342 tmp; 2327 tmp;
2343 mapstruct * 2328 maptile *
2344 mp; 2329 mp;
2345 2330
2346 MoveType blocked, move_type; 2331 MoveType blocked, move_type;
2347 2332
2348 if (exclude && exclude->head) 2333 if (exclude && exclude->head)
2556 * Modified to be map tile aware -.MSW 2541 * Modified to be map tile aware -.MSW
2557 */ 2542 */
2558 2543
2559 2544
2560int 2545int
2561can_see_monsterP (mapstruct *m, int x, int y, int dir) 2546can_see_monsterP (maptile *m, int x, int y, int dir)
2562{ 2547{
2563 sint16 dx, dy; 2548 sint16 dx, dy;
2564 int 2549 int
2565 mflags; 2550 mflags;
2566 2551
2646 if (prev) 2631 if (prev)
2647 prev->more = tmp; 2632 prev->more = tmp;
2648 prev = tmp; 2633 prev = tmp;
2649 } 2634 }
2650 2635
2651 /*** copy inventory ***/
2652 for (item = src->inv; item; item = item->below) 2636 for (item = src->inv; item; item = item->below)
2653 {
2654 (void) insert_ob_in_ob (object_create_clone (item), dst); 2637 insert_ob_in_ob (object_create_clone (item), dst);
2655 }
2656 2638
2657 return dst; 2639 return dst;
2658} 2640}
2659 2641
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. */ 2642/* 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 */ 2643/* 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, */ 2644/* 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. */ 2645/* 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. */ 2646/* Remember not to use load_object_str in a time-critical situation. */
2678
2679/* Also remember that multiparts objects are not supported for now. */ 2647/* Also remember that multiparts objects are not supported for now. */
2680 2648
2681object * 2649object *
2682load_object_str (const char *obstr) 2650load_object_str (const char *obstr)
2683{ 2651{
2684 object * 2652 object *op;
2685 op;
2686 char
2687 filename[MAX_BUF]; 2653 char filename[MAX_BUF];
2688 2654
2689 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); 2655 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2690 2656
2691 FILE *
2692 tempfile = fopen (filename, "w"); 2657 FILE *tempfile = fopen (filename, "w");
2693 2658
2694 if (tempfile == NULL) 2659 if (tempfile == NULL)
2695 { 2660 {
2696 LOG (llevError, "Error - Unable to access load object temp file\n"); 2661 LOG (llevError, "Error - Unable to access load object temp file\n");
2697 return NULL; 2662 return NULL;
2718 * returns NULL if no match. 2683 * returns NULL if no match.
2719 */ 2684 */
2720object * 2685object *
2721find_obj_by_type_subtype (const object *who, int type, int subtype) 2686find_obj_by_type_subtype (const object *who, int type, int subtype)
2722{ 2687{
2723 object * 2688 object *tmp;
2724 tmp;
2725 2689
2726 for (tmp = who->inv; tmp; tmp = tmp->below) 2690 for (tmp = who->inv; tmp; tmp = tmp->below)
2727 if (tmp->type == type && tmp->subtype == subtype) 2691 if (tmp->type == type && tmp->subtype == subtype)
2728 return tmp; 2692 return tmp;
2729 2693
2737 * do the desired thing. 2701 * do the desired thing.
2738 */ 2702 */
2739key_value * 2703key_value *
2740get_ob_key_link (const object *ob, const char *key) 2704get_ob_key_link (const object *ob, const char *key)
2741{ 2705{
2742 key_value * 2706 key_value *link;
2743 link;
2744 2707
2745 for (link = ob->key_values; link != NULL; link = link->next) 2708 for (link = ob->key_values; link != NULL; link = link->next)
2746 {
2747 if (link->key == key) 2709 if (link->key == key)
2748 {
2749 return link; 2710 return link;
2750 }
2751 }
2752 2711
2753 return NULL; 2712 return NULL;
2754} 2713}
2755 2714
2756/* 2715/*

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines