1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
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 it |
9 | * it under the terms of the GNU General Public License as published by |
9 | * under the terms of the GNU General Public License as published by the Free |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
11 | * (at your option) any later version. |
11 | * 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, but |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
16 | * GNU General Public License for more details. |
16 | * 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 along |
19 | * along with this program; if not, write to the Free Software |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
21 | * |
21 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
25 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
26 | sub/add_weight will transcend the environment updating the carrying |
26 | sub/add_weight will transcend the environment updating the carrying |
27 | variable. */ |
27 | variable. */ |
… | |
… | |
29 | #include <stdio.h> |
29 | #include <stdio.h> |
30 | #include <sys/types.h> |
30 | #include <sys/types.h> |
31 | #include <sys/uio.h> |
31 | #include <sys/uio.h> |
32 | #include <object.h> |
32 | #include <object.h> |
33 | #include <funcpoint.h> |
33 | #include <funcpoint.h> |
|
|
34 | #include <sproto.h> |
34 | #include <loader.h> |
35 | #include <loader.h> |
35 | |
36 | |
36 | #include <bitset> |
37 | #include <bitset> |
37 | |
38 | |
38 | int nrofallocobjects = 0; |
39 | int nrofallocobjects = 0; |
… | |
… | |
324 | sum_weight (object *op) |
325 | sum_weight (object *op) |
325 | { |
326 | { |
326 | long sum; |
327 | long sum; |
327 | object *inv; |
328 | object *inv; |
328 | |
329 | |
329 | for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) |
330 | for (sum = 0, inv = op->inv; inv; inv = inv->below) |
330 | { |
331 | { |
331 | if (inv->inv) |
332 | if (inv->inv) |
332 | sum_weight (inv); |
333 | sum_weight (inv); |
|
|
334 | |
333 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
335 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
334 | } |
336 | } |
335 | |
337 | |
336 | if (op->type == CONTAINER && op->stats.Str) |
338 | if (op->type == CONTAINER && op->stats.Str) |
337 | sum = (sum * (100 - op->stats.Str)) / 100; |
339 | sum = (sum * (100 - op->stats.Str)) / 100; |
… | |
… | |
446 | */ |
448 | */ |
447 | while (owner->owner) |
449 | while (owner->owner) |
448 | owner = owner->owner; |
450 | owner = owner->owner; |
449 | |
451 | |
450 | this->owner = owner; |
452 | this->owner = owner; |
|
|
453 | } |
|
|
454 | |
|
|
455 | int |
|
|
456 | object::slottype () const |
|
|
457 | { |
|
|
458 | if (type == SKILL) |
|
|
459 | { |
|
|
460 | if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
|
|
461 | if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
|
|
462 | } |
|
|
463 | else |
|
|
464 | { |
|
|
465 | if (slot [body_combat].info) return slot_combat; |
|
|
466 | if (slot [body_range ].info) return slot_ranged; |
|
|
467 | } |
|
|
468 | |
|
|
469 | return slot_none; |
|
|
470 | } |
|
|
471 | |
|
|
472 | bool |
|
|
473 | object::change_weapon (object *ob) |
|
|
474 | { |
|
|
475 | if (current_weapon == ob) |
|
|
476 | return true; |
|
|
477 | |
|
|
478 | if (chosen_skill) |
|
|
479 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
480 | |
|
|
481 | current_weapon = ob; |
|
|
482 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
483 | |
|
|
484 | if (chosen_skill) |
|
|
485 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
486 | |
|
|
487 | update_stats (); |
|
|
488 | |
|
|
489 | if (ob) |
|
|
490 | { |
|
|
491 | // now check wether any body locations became invalid, in which case |
|
|
492 | // we cannot apply the weapon at the moment. |
|
|
493 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
494 | if (slot[i].used < 0) |
|
|
495 | { |
|
|
496 | current_weapon = chosen_skill = 0; |
|
|
497 | update_stats (); |
|
|
498 | |
|
|
499 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
500 | "You try to balance all your items at once, " |
|
|
501 | "but the %s is just too much for your body. " |
|
|
502 | "[You need to unapply some items first.]", &ob->name); |
|
|
503 | return false; |
|
|
504 | } |
|
|
505 | |
|
|
506 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
507 | } |
|
|
508 | else |
|
|
509 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
510 | |
|
|
511 | if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
|
|
512 | { |
|
|
513 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
514 | &name, ob->debug_desc ()); |
|
|
515 | return false; |
|
|
516 | } |
|
|
517 | |
|
|
518 | return true; |
451 | } |
519 | } |
452 | |
520 | |
453 | /* Zero the key_values on op, decrementing the shared-string |
521 | /* Zero the key_values on op, decrementing the shared-string |
454 | * refcounts and freeing the links. |
522 | * refcounts and freeing the links. |
455 | */ |
523 | */ |
… | |
… | |
537 | * need for monsters, but doesn't hurt to do it for everything. |
605 | * 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 |
606 | * by doing so, when a monster is created, it has good starting |
539 | * values for the body_used info, so when items are created |
607 | * values for the body_used info, so when items are created |
540 | * for it, they can be properly equipped. |
608 | * for it, they can be properly equipped. |
541 | */ |
609 | */ |
542 | memcpy (body_used, body_info, sizeof (body_used)); |
610 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
611 | slot[i].used = slot[i].info; |
543 | |
612 | |
544 | attachable::instantiate (); |
613 | attachable::instantiate (); |
545 | } |
614 | } |
546 | |
615 | |
547 | object * |
616 | object * |
… | |
… | |
1168 | object * |
1237 | object * |
1169 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1238 | insert_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 | } |
… | |
… | |
1398 | * blocked() and wall() work properly), and these flags are updated by |
1460 | * blocked() and wall() work properly), and these flags are updated by |
1399 | * update_object(). |
1461 | * update_object(). |
1400 | */ |
1462 | */ |
1401 | |
1463 | |
1402 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1464 | /* 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) |
1465 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1404 | { |
1466 | { |
1405 | if (check_move_on (op, originator)) |
1467 | if (check_move_on (op, originator)) |
1406 | return 0; |
1468 | return 0; |
1407 | |
1469 | |
1408 | /* If we are a multi part object, lets work our way through the check |
1470 | /* If we are a multi part object, lets work our way through the check |
1409 | * walk on's. |
1471 | * walk on's. |
1410 | */ |
1472 | */ |
1411 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1473 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1412 | if (check_move_on (tmp, originator)) |
1474 | if (check_move_on (tmp, originator)) |
1413 | return 0; |
1475 | return 0; |
1414 | } |
1476 | } |
1415 | |
1477 | |
1416 | return op; |
1478 | return op; |
… | |
… | |
1597 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1659 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1598 | free (dump); |
1660 | free (dump); |
1599 | return op; |
1661 | return op; |
1600 | } |
1662 | } |
1601 | |
1663 | |
1602 | if (where->head) |
1664 | if (where->head_ () != where) |
1603 | { |
1665 | { |
1604 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1666 | LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1605 | where = where->head; |
1667 | where = where->head; |
1606 | } |
1668 | } |
1607 | |
1669 | |
1608 | return where->insert (op); |
1670 | return where->insert (op); |
1609 | } |
1671 | } |
… | |
… | |
1937 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1999 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1938 | { |
2000 | { |
1939 | CLEAR_FLAG (tmp, flag); |
2001 | CLEAR_FLAG (tmp, flag); |
1940 | unflag_inv (tmp, flag); |
2002 | unflag_inv (tmp, flag); |
1941 | } |
2003 | } |
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 | */ |
|
|
1950 | void |
|
|
1951 | set_cheat (object *op) |
|
|
1952 | { |
|
|
1953 | SET_FLAG (op, FLAG_WAS_WIZ); |
|
|
1954 | flag_inv (op, FLAG_WAS_WIZ); |
|
|
1955 | } |
2004 | } |
1956 | |
2005 | |
1957 | /* |
2006 | /* |
1958 | * find_free_spot(object, map, x, y, start, stop) will search for |
2007 | * 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 |
2008 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
2077 | object *tmp; |
2126 | object *tmp; |
2078 | maptile *mp; |
2127 | maptile *mp; |
2079 | |
2128 | |
2080 | MoveType blocked, move_type; |
2129 | MoveType blocked, move_type; |
2081 | |
2130 | |
2082 | if (exclude && exclude->head) |
2131 | if (exclude && exclude->head_ () != exclude) |
2083 | { |
2132 | { |
2084 | exclude = exclude->head; |
2133 | exclude = exclude->head; |
2085 | move_type = exclude->move_type; |
2134 | move_type = exclude->move_type; |
2086 | } |
2135 | } |
2087 | else |
2136 | else |
… | |
… | |
2110 | max = maxfree[i]; |
2159 | max = maxfree[i]; |
2111 | else if (mflags & P_IS_ALIVE) |
2160 | else if (mflags & P_IS_ALIVE) |
2112 | { |
2161 | { |
2113 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2162 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2114 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2163 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2115 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2164 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2116 | break; |
2165 | break; |
2117 | |
2166 | |
2118 | if (tmp) |
2167 | if (tmp) |
2119 | return freedir[i]; |
2168 | return freedir[i]; |
2120 | } |
2169 | } |
… | |
… | |
2315 | * create clone from object to another |
2364 | * create clone from object to another |
2316 | */ |
2365 | */ |
2317 | object * |
2366 | object * |
2318 | object_create_clone (object *asrc) |
2367 | object_create_clone (object *asrc) |
2319 | { |
2368 | { |
2320 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2369 | object *dst = 0, *tmp, *src, *prev, *item; |
2321 | |
2370 | |
2322 | if (!asrc) |
2371 | if (!asrc) |
2323 | return 0; |
2372 | return 0; |
2324 | |
2373 | |
2325 | src = asrc; |
|
|
2326 | if (src->head) |
|
|
2327 | src = src->head; |
2374 | src = asrc->head_ (); |
2328 | |
2375 | |
2329 | prev = 0; |
2376 | prev = 0; |
2330 | for (part = src; part; part = part->more) |
2377 | for (object *part = src; part; part = part->more) |
2331 | { |
2378 | { |
2332 | tmp = part->clone (); |
2379 | tmp = part->clone (); |
2333 | tmp->x -= src->x; |
2380 | tmp->x -= src->x; |
2334 | tmp->y -= src->y; |
2381 | tmp->y -= src->y; |
2335 | |
2382 | |
… | |
… | |
2583 | } |
2630 | } |
2584 | |
2631 | |
2585 | const char * |
2632 | const char * |
2586 | object::debug_desc () const |
2633 | object::debug_desc () const |
2587 | { |
2634 | { |
2588 | static char info[256 * 4]; |
2635 | static char info[3][256 * 4]; |
|
|
2636 | static int info_idx; |
|
|
2637 | |
2589 | return debug_desc (info); |
2638 | return debug_desc (info [++info_idx % 3]); |
2590 | } |
|
|
2591 | |
|
|
2592 | const char * |
|
|
2593 | object::debug_desc2 () const |
|
|
2594 | { |
|
|
2595 | static char info[256 * 4]; |
|
|
2596 | return debug_desc (info); |
|
|
2597 | } |
2639 | } |
2598 | |
2640 | |
2599 | struct region * |
2641 | struct region * |
2600 | object::region () const |
2642 | object::region () const |
2601 | { |
2643 | { |