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.140 by root, Tue Apr 24 12:32:14 2007 UTC vs.
Revision 1.172 by root, Wed Aug 1 20:44:11 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Crossfire TRT 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 2 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,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
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, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <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. */
29#include <stdio.h> 28#include <stdio.h>
30#include <sys/types.h> 29#include <sys/types.h>
31#include <sys/uio.h> 30#include <sys/uio.h>
32#include <object.h> 31#include <object.h>
33#include <funcpoint.h> 32#include <funcpoint.h>
33#include <sproto.h>
34#include <loader.h> 34#include <loader.h>
35 35
36#include <bitset> 36#include <bitset>
37 37
38int nrofallocobjects = 0; 38int nrofallocobjects = 0;
299 return 0; 299 return 0;
300 else if (!compare_ob_value_lists (ob1, ob2)) 300 else if (!compare_ob_value_lists (ob1, ob2))
301 return 0; 301 return 0;
302 } 302 }
303 303
304 //TODO: generate an event or call into perl for additional checks
305 if (ob1->self || ob2->self) 304 if (ob1->self || ob2->self)
306 { 305 {
307 ob1->optimise (); 306 ob1->optimise ();
308 ob2->optimise (); 307 ob2->optimise ();
309 308
310 if (ob1->self || ob2->self) 309 if (ob1->self || ob2->self)
310 if (!cfperl_can_merge (ob1, ob2))
311 return 0; 311 return 0;
312 } 312 }
313 313
314 /* Everything passes, must be OK. */ 314 /* Everything passes, must be OK. */
315 return 1; 315 return 1;
316} 316}
324sum_weight (object *op) 324sum_weight (object *op)
325{ 325{
326 long sum; 326 long sum;
327 object *inv; 327 object *inv;
328 328
329 for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) 329 for (sum = 0, inv = op->inv; inv; inv = inv->below)
330 { 330 {
331 if (inv->inv) 331 if (inv->inv)
332 sum_weight (inv); 332 sum_weight (inv);
333
333 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); 334 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
334 } 335 }
335 336
336 if (op->type == CONTAINER && op->stats.Str) 337 if (op->type == CONTAINER && op->stats.Str)
337 sum = (sum * (100 - op->stats.Str)) / 100; 338 sum = (sum * (100 - op->stats.Str)) / 100;
446 */ 447 */
447 while (owner->owner) 448 while (owner->owner)
448 owner = owner->owner; 449 owner = owner->owner;
449 450
450 this->owner = owner; 451 this->owner = owner;
452}
453
454int
455object::slottype () const
456{
457 if (type == SKILL)
458 {
459 if (IS_COMBAT_SKILL (subtype)) return slot_combat;
460 if (IS_RANGED_SKILL (subtype)) return slot_ranged;
461 }
462 else
463 {
464 if (slot [body_combat].info) return slot_combat;
465 if (slot [body_range ].info) return slot_ranged;
466 }
467
468 return slot_none;
469}
470
471bool
472object::change_weapon (object *ob)
473{
474 if (current_weapon == ob)
475 return true;
476
477 if (chosen_skill)
478 chosen_skill->flag [FLAG_APPLIED] = false;
479
480 current_weapon = ob;
481 chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
482
483 if (chosen_skill)
484 chosen_skill->flag [FLAG_APPLIED] = true;
485
486 update_stats ();
487
488 if (ob)
489 {
490 // now check wether any body locations became invalid, in which case
491 // we cannot apply the weapon at the moment.
492 for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
493 if (slot[i].used < 0)
494 {
495 current_weapon = chosen_skill = 0;
496 update_stats ();
497
498 new_draw_info_format (NDI_UNIQUE, 0, this,
499 "You try to balance all your items at once, "
500 "but the %s is just too much for your body. "
501 "[You need to unapply some items first.]", &ob->name);
502 return false;
503 }
504
505 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
506 }
507 else
508 ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
509
510 if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
511 {
512 LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
513 &name, ob->debug_desc ());
514 return false;
515 }
516
517 return true;
451} 518}
452 519
453/* Zero the key_values on op, decrementing the shared-string 520/* Zero the key_values on op, decrementing the shared-string
454 * refcounts and freeing the links. 521 * refcounts and freeing the links.
455 */ 522 */
537 * need for monsters, but doesn't hurt to do it for everything. 604 * need for monsters, but doesn't hurt to do it for everything.
538 * by doing so, when a monster is created, it has good starting 605 * by doing so, when a monster is created, it has good starting
539 * values for the body_used info, so when items are created 606 * values for the body_used info, so when items are created
540 * for it, they can be properly equipped. 607 * for it, they can be properly equipped.
541 */ 608 */
542 memcpy (body_used, body_info, sizeof (body_used)); 609 for (int i = NUM_BODY_LOCATIONS; i--; )
610 slot[i].used = slot[i].info;
543 611
544 attachable::instantiate (); 612 attachable::instantiate ();
545} 613}
546 614
547object * 615object *
868 map = freed_map; 936 map = freed_map;
869 x = 1; 937 x = 1;
870 y = 1; 938 y = 1;
871 } 939 }
872 940
873 head = 0;
874
875 if (more) 941 if (more)
876 { 942 {
877 more->destroy (); 943 more->destroy ();
878 more = 0; 944 more = 0;
879 } 945 }
880 946
947 head = 0;
948
881 // clear those pointers that likely might have circular references to us 949 // clear those pointers that likely might cause circular references
882 owner = 0; 950 owner = 0;
883 enemy = 0; 951 enemy = 0;
884 attacked_by = 0; 952 attacked_by = 0;
953 current_weapon = 0;
885} 954}
886 955
887void 956void
888object::destroy (bool destroy_inventory) 957object::destroy (bool destroy_inventory)
889{ 958{
890 if (destroyed ()) 959 if (destroyed ())
891 return; 960 return;
892 961
893 if (destroy_inventory) 962 if (destroy_inventory)
894 destroy_inv (false); 963 destroy_inv (false);
964
965 if (sound_destroy)
966 play_sound (sound_destroy);
967 else if (flag [FLAG_MONSTER])
968 play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
895 969
896 attachable::destroy (); 970 attachable::destroy ();
897} 971}
898 972
899/* 973/*
1047 1121
1048 if (destroyed ()) 1122 if (destroyed ())
1049 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); 1123 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1050 } 1124 }
1051 1125
1052 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1053 //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1054 if (tmp->above == tmp)
1055 tmp->above = 0;
1056
1057 last = tmp; 1126 last = tmp;
1058 } 1127 }
1059 1128
1060 /* last == NULL if there are no objects on this space */ 1129 /* last == NULL if there are no objects on this space */
1061 //TODO: this makes little sense, why only update the topmost object? 1130 //TODO: this makes little sense, why only update the topmost object?
1112 if (more) 1181 if (more)
1113 return; 1182 return;
1114 1183
1115 object *prev = this; 1184 object *prev = this;
1116 1185
1117 for (archetype *at = arch->more; at; at = at->more) 1186 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1118 { 1187 {
1119 object *op = arch_to_object (at); 1188 object *op = arch_to_object (at);
1120 1189
1121 op->name = name; 1190 op->name = name;
1122 op->name_pl = name_pl; 1191 op->name_pl = name_pl;
1136object * 1205object *
1137insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1206insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1138{ 1207{
1139 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1208 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1140 { 1209 {
1141 tmp->x = x + tmp->arch->clone.x; 1210 tmp->x = x + tmp->arch->x;
1142 tmp->y = y + tmp->arch->clone.y; 1211 tmp->y = y + tmp->arch->y;
1143 } 1212 }
1144 1213
1145 return insert_ob_in_map (op, m, originator, flag); 1214 return insert_ob_in_map (op, m, originator, flag);
1146} 1215}
1147 1216
1168object * 1237object *
1169insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1238insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1170{ 1239{
1171 assert (!op->flag [FLAG_FREED]); 1240 assert (!op->flag [FLAG_FREED]);
1172 1241
1173 object *tmp, *top, *floor = NULL; 1242 object *top, *floor = NULL;
1174 1243
1175 op->remove (); 1244 op->remove ();
1176 1245
1177#if 0 1246#if 0
1178 if (!m->active != !op->active) 1247 if (!m->active != !op->active)
1194#endif 1263#endif
1195 return op; 1264 return op;
1196 } 1265 }
1197 1266
1198 if (object *more = op->more) 1267 if (object *more = op->more)
1199 {
1200 if (!insert_ob_in_map (more, m, originator, flag)) 1268 if (!insert_ob_in_map (more, m, originator, flag))
1201 {
1202 if (!op->head)
1203 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1204
1205 return 0; 1269 return 0;
1206 }
1207 }
1208 1270
1209 CLEAR_FLAG (op, FLAG_REMOVED); 1271 CLEAR_FLAG (op, FLAG_REMOVED);
1210 1272
1211 /* Ideally, the caller figures this out. However, it complicates a lot 1273 /* Ideally, the caller figures this out. However, it complicates a lot
1212 * of areas of callers (eg, anything that uses find_free_spot would now 1274 * of areas of callers (eg, anything that uses find_free_spot would now
1219 mapspace &ms = op->ms (); 1281 mapspace &ms = op->ms ();
1220 1282
1221 /* this has to be done after we translate the coordinates. 1283 /* this has to be done after we translate the coordinates.
1222 */ 1284 */
1223 if (op->nrof && !(flag & INS_NO_MERGE)) 1285 if (op->nrof && !(flag & INS_NO_MERGE))
1224 for (tmp = ms.bot; tmp; tmp = tmp->above) 1286 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1225 if (object::can_merge (op, tmp)) 1287 if (object::can_merge (op, tmp))
1226 { 1288 {
1227 op->nrof += tmp->nrof; 1289 op->nrof += tmp->nrof;
1228 tmp->destroy (); 1290 tmp->destroy ();
1229 } 1291 }
1318 */ 1380 */
1319 if (last && last->below && last != floor) 1381 if (last && last->below && last != floor)
1320 top = last->below; 1382 top = last->below;
1321 } 1383 }
1322 } /* If objects on this space */ 1384 } /* If objects on this space */
1323
1324 if (flag & INS_MAP_LOAD) 1385 if (flag & INS_MAP_LOAD)
1325 top = ms.top; 1386 top = ms.top;
1326 1387
1327 if (flag & INS_ABOVE_FLOOR_ONLY) 1388 if (flag & INS_ABOVE_FLOOR_ONLY)
1328 top = floor; 1389 top = floor;
1398 * blocked() and wall() work properly), and these flags are updated by 1459 * blocked() and wall() work properly), and these flags are updated by
1399 * update_object(). 1460 * update_object().
1400 */ 1461 */
1401 1462
1402 /* if this is not the head or flag has been passed, don't check walk on status */ 1463 /* if this is not the head or flag has been passed, don't check walk on status */
1403 if (!(flag & INS_NO_WALK_ON) && !op->head) 1464 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1404 { 1465 {
1405 if (check_move_on (op, originator)) 1466 if (check_move_on (op, originator))
1406 return 0; 1467 return 0;
1407 1468
1408 /* If we are a multi part object, lets work our way through the check 1469 /* If we are a multi part object, lets work our way through the check
1409 * walk on's. 1470 * walk on's.
1410 */ 1471 */
1411 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1472 for (object *tmp = op->more; tmp; tmp = tmp->more)
1412 if (check_move_on (tmp, originator)) 1473 if (check_move_on (tmp, originator))
1413 return 0; 1474 return 0;
1414 } 1475 }
1415 1476
1416 return op; 1477 return op;
1426 object *tmp, *tmp1; 1487 object *tmp, *tmp1;
1427 1488
1428 /* first search for itself and remove any old instances */ 1489 /* first search for itself and remove any old instances */
1429 1490
1430 for (tmp = op->ms ().bot; tmp; tmp = tmp->above) 1491 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1431 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1492 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1432 tmp->destroy (); 1493 tmp->destroy ();
1433 1494
1434 tmp1 = arch_to_object (archetype::find (arch_string)); 1495 tmp1 = arch_to_object (archetype::find (arch_string));
1435 1496
1436 tmp1->x = op->x; 1497 tmp1->x = op->x;
1597 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); 1658 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1598 free (dump); 1659 free (dump);
1599 return op; 1660 return op;
1600 } 1661 }
1601 1662
1602 if (where->head) 1663 if (where->head_ () != where)
1603 { 1664 {
1604 LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); 1665 LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1605 where = where->head; 1666 where = where->head;
1606 } 1667 }
1607 1668
1608 return where->insert (op); 1669 return where->insert (op);
1609} 1670}
1937 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1998 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1938 { 1999 {
1939 CLEAR_FLAG (tmp, flag); 2000 CLEAR_FLAG (tmp, flag);
1940 unflag_inv (tmp, flag); 2001 unflag_inv (tmp, flag);
1941 } 2002 }
1942}
1943
1944/*
1945 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1946 * all it's inventory (recursively).
1947 * If checksums are used, a player will get set_cheat called for
1948 * him/her-self and all object carried by a call to this function.
1949 */
1950void
1951set_cheat (object *op)
1952{
1953 SET_FLAG (op, FLAG_WAS_WIZ);
1954 flag_inv (op, FLAG_WAS_WIZ);
1955} 2003}
1956 2004
1957/* 2005/*
1958 * find_free_spot(object, map, x, y, start, stop) will search for 2006 * find_free_spot(object, map, x, y, start, stop) will search for
1959 * a spot at the given map and coordinates which will be able to contain 2007 * a spot at the given map and coordinates which will be able to contain
2077 object *tmp; 2125 object *tmp;
2078 maptile *mp; 2126 maptile *mp;
2079 2127
2080 MoveType blocked, move_type; 2128 MoveType blocked, move_type;
2081 2129
2082 if (exclude && exclude->head) 2130 if (exclude && exclude->head_ () != exclude)
2083 { 2131 {
2084 exclude = exclude->head; 2132 exclude = exclude->head;
2085 move_type = exclude->move_type; 2133 move_type = exclude->move_type;
2086 } 2134 }
2087 else 2135 else
2110 max = maxfree[i]; 2158 max = maxfree[i];
2111 else if (mflags & P_IS_ALIVE) 2159 else if (mflags & P_IS_ALIVE)
2112 { 2160 {
2113 for (tmp = ms.bot; tmp; tmp = tmp->above) 2161 for (tmp = ms.bot; tmp; tmp = tmp->above)
2114 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2162 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2115 && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2163 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2116 break; 2164 break;
2117 2165
2118 if (tmp) 2166 if (tmp)
2119 return freedir[i]; 2167 return freedir[i];
2120 } 2168 }
2315 * create clone from object to another 2363 * create clone from object to another
2316 */ 2364 */
2317object * 2365object *
2318object_create_clone (object *asrc) 2366object_create_clone (object *asrc)
2319{ 2367{
2320 object *dst = 0, *tmp, *src, *part, *prev, *item; 2368 object *dst = 0, *tmp, *src, *prev, *item;
2321 2369
2322 if (!asrc) 2370 if (!asrc)
2323 return 0; 2371 return 0;
2324 2372
2325 src = asrc;
2326 if (src->head)
2327 src = src->head; 2373 src = asrc->head_ ();
2328 2374
2329 prev = 0; 2375 prev = 0;
2330 for (part = src; part; part = part->more) 2376 for (object *part = src; part; part = part->more)
2331 { 2377 {
2332 tmp = part->clone (); 2378 tmp = part->clone ();
2333 tmp->x -= src->x; 2379 tmp->x -= src->x;
2334 tmp->y -= src->y; 2380 tmp->y -= src->y;
2335 2381
2448 /* Basically, if the archetype has this key set, 2494 /* Basically, if the archetype has this key set,
2449 * we need to store the null value so when we save 2495 * we need to store the null value so when we save
2450 * it, we save the empty value so that when we load, 2496 * it, we save the empty value so that when we load,
2451 * we get this value back again. 2497 * we get this value back again.
2452 */ 2498 */
2453 if (get_ob_key_link (&op->arch->clone, canonical_key)) 2499 if (get_ob_key_link (op->arch, canonical_key))
2454 field->value = 0; 2500 field->value = 0;
2455 else 2501 else
2456 { 2502 {
2457 if (last) 2503 if (last)
2458 last->next = field->next; 2504 last->next = field->next;
2527 } 2573 }
2528 else 2574 else
2529 item = item->env; 2575 item = item->env;
2530} 2576}
2531 2577
2532
2533const char * 2578const char *
2534object::flag_desc (char *desc, int len) const 2579object::flag_desc (char *desc, int len) const
2535{ 2580{
2536 char *p = desc; 2581 char *p = desc;
2537 bool first = true; 2582 bool first = true;
2583} 2628}
2584 2629
2585const char * 2630const char *
2586object::debug_desc () const 2631object::debug_desc () const
2587{ 2632{
2588 static char info[256 * 4]; 2633 static char info[3][256 * 4];
2634 static int info_idx;
2635
2589 return debug_desc (info); 2636 return debug_desc (info [++info_idx % 3]);
2590}
2591
2592const char *
2593object::debug_desc2 () const
2594{
2595 static char info[256 * 4];
2596 return debug_desc (info);
2597} 2637}
2598 2638
2599struct region * 2639struct region *
2600object::region () const 2640object::region () const
2601{ 2641{
2604} 2644}
2605 2645
2606const materialtype_t * 2646const materialtype_t *
2607object::dominant_material () const 2647object::dominant_material () const
2608{ 2648{
2609 if (materialtype_t *mat = name_to_material (materialname)) 2649 if (materialtype_t *mt = name_to_material (materialname))
2610 return mat; 2650 return mt;
2611 2651
2612 // omfg this is slow, this has to be temporary :)
2613 shstr unknown ("unknown");
2614
2615 return name_to_material (unknown); 2652 return name_to_material (shstr_unknown);
2616} 2653}
2617 2654
2618void 2655void
2619object::open_container (object *new_container) 2656object::open_container (object *new_container)
2620{ 2657{
2664 esrv_update_item (UPD_FLAGS, this, new_container); 2701 esrv_update_item (UPD_FLAGS, this, new_container);
2665 esrv_send_inventory (this, new_container); 2702 esrv_send_inventory (this, new_container);
2666 } 2703 }
2667} 2704}
2668 2705
2706object *
2707object::force_find (const shstr name)
2708{
2709 /* cycle through his inventory to look for the MARK we want to
2710 * place
2711 */
2712 for (object *tmp = inv; tmp; tmp = tmp->below)
2713 if (tmp->type == FORCE && tmp->slaying == name)
2714 return splay (tmp);
2669 2715
2716 return 0;
2717}
2718
2719void
2720object::force_add (const shstr name, int duration)
2721{
2722 if (object *force = force_find (name))
2723 force->destroy ();
2724
2725 object *force = get_archetype (FORCE_NAME);
2726
2727 force->slaying = name;
2728 force->stats.food = 1;
2729 force->speed_left = -1.f;
2730
2731 force->set_speed (duration ? 1.f / duration : 0.f);
2732 force->flag [FLAG_IS_USED_UP] = true;
2733 force->flag [FLAG_APPLIED] = true;
2734
2735 insert (force);
2736}
2737

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines