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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines