1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
11 | * 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 Affero GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * and the GNU General Public License along with this program. If not, see |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * <http://www.gnu.org/licenses/>. |
20 | * <http://www.gnu.org/licenses/>. |
21 | * |
21 | * |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | //+GPL |
25 | //+GPL |
26 | |
26 | |
… | |
… | |
233 | disconnect (); |
233 | disconnect (); |
234 | |
234 | |
235 | attachable::do_destroy (); |
235 | attachable::do_destroy (); |
236 | |
236 | |
237 | if (ob) |
237 | if (ob) |
|
|
238 | { |
|
|
239 | ob->contr = 0; |
238 | ob->destroy (); |
240 | ob->destroy (); |
|
|
241 | } |
239 | |
242 | |
240 | ob = observe = viewpoint = 0; |
243 | ob = observe = viewpoint = 0; |
241 | } |
244 | } |
242 | |
245 | |
243 | player::~player () |
246 | player::~player () |
… | |
… | |
327 | #endif |
330 | #endif |
328 | return op; |
331 | return op; |
329 | } |
332 | } |
330 | |
333 | |
331 | /* I believe this can safely go to 2, 3 is questionable, 4 will likely |
334 | /* I believe this can safely go to 2, 3 is questionable, 4 will likely |
332 | * result in a monster paths backtracking. It basically determines how large a |
335 | * result in a monster paths backtracking. It basically determines how large a |
333 | * detour a monster will take from the direction path when looking |
336 | * detour a monster will take from the direction path when looking |
334 | * for a path to the player. The values are in the amount of direction |
337 | * for a path to the player. The values are in the amount of direction |
335 | * the deviation is |
338 | * the deviation is |
336 | */ |
339 | */ |
337 | #define DETOUR_AMOUNT 2 |
340 | #define DETOUR_AMOUNT 2 |
… | |
… | |
373 | */ |
376 | */ |
374 | int |
377 | int |
375 | path_to_player (object *mon, object *pl, unsigned mindiff) |
378 | path_to_player (object *mon, object *pl, unsigned mindiff) |
376 | { |
379 | { |
377 | rv_vector rv; |
380 | rv_vector rv; |
378 | int dir, i, diff, firstdir = 0, lastdir, max = MAX_SPACES, mflags, blocked; |
381 | int dir, i, diff, firstdir = 0, lastdir, max = MAX_SPACES; |
379 | |
382 | |
380 | get_rangevector (mon, pl, &rv, 0); |
383 | get_rangevector (mon, pl, &rv, 0); |
381 | |
384 | |
382 | if (rv.distance < mindiff) |
385 | if (rv.distance < mindiff) |
383 | return 0; |
386 | return 0; |
… | |
… | |
416 | } |
419 | } |
417 | else |
420 | else |
418 | { |
421 | { |
419 | /* direct path is blocked - try taking a side step to |
422 | /* direct path is blocked - try taking a side step to |
420 | * either the left or right. |
423 | * either the left or right. |
421 | * Note increase the values in the loop below to be |
424 | * Note increase the values in the loop below to be |
422 | * more than -1/1 respectively will mean the monster takes |
425 | * more than -1/1 respectively will mean the monster takes |
423 | * bigger detour. Have to be careful about these values getting |
426 | * bigger detour. Have to be careful about these values getting |
424 | * too big (3 or maybe 4 or higher) as the monster may just try |
427 | * too big (3 or maybe 4 or higher) as the monster may just try |
425 | * stepping back and forth |
428 | * stepping back and forth |
426 | */ |
429 | */ |
… | |
… | |
511 | for (object *next, *op = pl->inv; op; op = next) |
514 | for (object *next, *op = pl->inv; op; op = next) |
512 | { |
515 | { |
513 | next = op->below; |
516 | next = op->below; |
514 | |
517 | |
515 | /* Forces get applied per default, unless they have the |
518 | /* Forces get applied per default, unless they have the |
516 | * flag "neutral" set. Sorry but I can't think of a better way |
519 | * flag "neutral" set. Sorry but I can't think of a better way |
517 | */ |
520 | */ |
518 | if (op->type == FORCE && !op->flag [FLAG_NEUTRAL]) |
521 | if (op->type == FORCE && !op->flag [FLAG_NEUTRAL]) |
519 | op->set_flag (FLAG_APPLIED); |
522 | op->set_flag (FLAG_APPLIED); |
520 | |
523 | |
521 | /* we never give weapons/armour if these cannot be used |
524 | /* we never give weapons/armour if these cannot be used |
522 | * by this player due to race restrictions |
525 | * by this player due to race restrictions |
523 | */ |
526 | */ |
524 | if (pl->type == PLAYER) |
527 | if (pl->type == PLAYER) |
525 | { |
528 | { |
526 | if ((!pl->flag [FLAG_USE_ARMOUR] |
529 | if ((!pl->flag [FLAG_USE_ARMOUR] |
527 | && |
530 | && |
… | |
… | |
732 | */ |
735 | */ |
733 | if (*first_map_ext_path) |
736 | if (*first_map_ext_path) |
734 | ob->player_goto (format ("%s/%s", &first_map_ext_path, &ob->arch->archname), ob->x, ob->y); |
737 | ob->player_goto (format ("%s/%s", &first_map_ext_path, &ob->arch->archname), ob->x, ob->y); |
735 | else |
738 | else |
736 | LOG (llevDebug, "first_map_ext_path not set\n"); |
739 | LOG (llevDebug, "first_map_ext_path not set\n"); |
|
|
740 | } |
|
|
741 | |
|
|
742 | /* |
|
|
743 | * Returns true if the given player is a legal class. |
|
|
744 | * The function to add and remove class-bonuses to the stats doesn't |
|
|
745 | * check if the stat becomes negative, thus this function |
|
|
746 | * merely checks that all stats are 1 or more, and returns |
|
|
747 | * false otherwise. |
|
|
748 | */ |
|
|
749 | static int |
|
|
750 | allowed_class (const object *op) |
|
|
751 | { |
|
|
752 | return op->stats.Dex > 0 |
|
|
753 | && op->stats.Str > 0 |
|
|
754 | && op->stats.Con > 0 |
|
|
755 | && op->stats.Int > 0 |
|
|
756 | && op->stats.Wis > 0 |
|
|
757 | && op->stats.Pow > 0 |
|
|
758 | && op->stats.Cha > 0; |
737 | } |
759 | } |
738 | |
760 | |
739 | void |
761 | void |
740 | player::chargen_race_next () |
762 | player::chargen_race_next () |
741 | { |
763 | { |
… | |
… | |
1130 | } |
1152 | } |
1131 | |
1153 | |
1132 | /* routine for both players and monsters. We call this when |
1154 | /* routine for both players and monsters. We call this when |
1133 | * there is a possibility for our action distrubing our hiding |
1155 | * there is a possibility for our action distrubing our hiding |
1134 | * place or invisiblity spell. Artefact invisiblity causes |
1156 | * place or invisiblity spell. Artefact invisiblity causes |
1135 | * "noise" instead. If we arent invisible to begin with, we |
1157 | * "noise" instead. If we arent invisible to begin with, we |
1136 | * return 0. |
1158 | * return 0. |
1137 | */ |
1159 | */ |
1138 | static int |
1160 | static int |
1139 | action_makes_visible (object *op) |
1161 | action_makes_visible (object *op) |
1140 | { |
1162 | { |
1141 | if (op->invisible && op->flag [FLAG_ALIVE]) |
1163 | if (op->invisible && op->flag [FLAG_ALIVE]) |
… | |
… | |
1164 | return 0; |
1186 | return 0; |
1165 | } |
1187 | } |
1166 | |
1188 | |
1167 | /* |
1189 | /* |
1168 | * Find an arrow in the inventory and after that |
1190 | * Find an arrow in the inventory and after that |
1169 | * in the right type container (quiver). Pointer to the |
1191 | * in the right type container (quiver). Pointer to the |
1170 | * found object is returned. |
1192 | * found object is returned. |
1171 | */ |
1193 | */ |
1172 | static object * |
1194 | static object * |
1173 | find_arrow (object *op, const char *type) |
1195 | find_arrow (object *op, const char *type) |
1174 | { |
1196 | { |
… | |
… | |
1327 | |
1349 | |
1328 | return find_better_arrow (op, tmp, type, &i); |
1350 | return find_better_arrow (op, tmp, type, &i); |
1329 | } |
1351 | } |
1330 | |
1352 | |
1331 | /* |
1353 | /* |
1332 | * Creature fires a bow - op can be monster or player. Returns |
1354 | * Creature fires a bow - op can be monster or player. Returns |
1333 | * 1 if bow was actually fired, 0 otherwise. |
1355 | * 1 if bow was actually fired, 0 otherwise. |
1334 | * op is the object firing the bow. |
1356 | * op is the object firing the bow. |
1335 | * part is for multipart creatures - the part firing the bow. |
1357 | * part is for multipart creatures - the part firing the bow. |
1336 | * dir is the direction of fire. |
1358 | * dir is the direction of fire. |
1337 | * wc_mod is any special modifier to give (used in special player fire modes) |
1359 | * wc_mod is any special modifier to give (used in special player fire modes) |
… | |
… | |
1445 | SET_ANIMATION (arrow, arrow->direction); |
1467 | SET_ANIMATION (arrow, arrow->direction); |
1446 | |
1468 | |
1447 | /* update the speed */ |
1469 | /* update the speed */ |
1448 | |
1470 | |
1449 | arrow->speed_left = 0; |
1471 | arrow->speed_left = 0; |
1450 | arrow->set_speed (max (2.f, |
1472 | arrow->set_speed (max (2.f, |
1451 | ((bow->flag [FLAG_NO_STRENGTH] ? 0 : dam_bonus[op->stats.Str]) + bow->magic + arrow->magic) / 5.f |
1473 | ((bow->flag [FLAG_NO_STRENGTH] ? 0 : dam_bonus[op->stats.Str]) + bow->magic + arrow->magic) / 5.f |
1452 | + bow->stats.dam / 7.f |
1474 | + bow->stats.dam / 7.f |
1453 | )); |
1475 | )); |
1454 | |
1476 | |
1455 | int wc = op->stats.wc + wc_mod - arrow->magic - arrow->stats.wc; |
1477 | int wc = op->stats.wc + wc_mod - arrow->magic - arrow->stats.wc; |
… | |
… | |
1479 | arrow->stats.dam = clamp (arrow->stats.dam + op->stats.dam + arrow->magic, MIN_DAM, MAX_DAM); |
1501 | arrow->stats.dam = clamp (arrow->stats.dam + op->stats.dam + arrow->magic, MIN_DAM, MAX_DAM); |
1480 | |
1502 | |
1481 | arrow->stats.wc = clamp (wc, MIN_WC, MAX_WC); |
1503 | arrow->stats.wc = clamp (wc, MIN_WC, MAX_WC); |
1482 | arrow->move_type = MOVE_FLY_LOW; |
1504 | arrow->move_type = MOVE_FLY_LOW; |
1483 | arrow->move_on = MOVE_FLY_LOW | MOVE_WALK; |
1505 | arrow->move_on = MOVE_FLY_LOW | MOVE_WALK; |
|
|
1506 | arrow->set_flag (FLAG_NO_PICK); |
1484 | |
1507 | |
1485 | op->play_sound (sound_find ("fire_arrow")); |
1508 | op->play_sound (sound_find ("fire_arrow")); |
1486 | m->insert (arrow, sx, sy, op); |
1509 | m->insert (arrow, sx, sy, op); |
1487 | |
1510 | |
1488 | if (!arrow->destroyed ()) |
1511 | if (!arrow->destroyed ()) |
… | |
… | |
1591 | |
1614 | |
1592 | if (item->type == WAND) |
1615 | if (item->type == WAND) |
1593 | { |
1616 | { |
1594 | if (!(--item->stats.food)) |
1617 | if (!(--item->stats.food)) |
1595 | { |
1618 | { |
1596 | object *tmp; |
|
|
1597 | |
|
|
1598 | if (item->arch) |
1619 | if (item->arch) |
1599 | { |
1620 | { |
1600 | item->clr_flag (FLAG_ANIMATE); |
1621 | item->clr_flag (FLAG_ANIMATE); |
1601 | item->face = item->arch->face; |
1622 | item->face = item->arch->face; |
1602 | item->set_speed (0); |
1623 | item->set_speed (0); |
… | |
… | |
1686 | for (tmp = container->inv; tmp; tmp = tmp->below) |
1707 | for (tmp = container->inv; tmp; tmp = tmp->below) |
1687 | { |
1708 | { |
1688 | if (door->type == DOOR && tmp->type == KEY) |
1709 | if (door->type == DOOR && tmp->type == KEY) |
1689 | break; |
1710 | break; |
1690 | |
1711 | |
1691 | /* For sanity, we should really check door type, but other stuff |
1712 | /* For sanity, we should really check door type, but other stuff |
1692 | * (like containers) can be locked with special keys |
1713 | * (like containers) can be locked with special keys |
1693 | */ |
1714 | */ |
1694 | if (tmp->slaying && tmp->type == SPECIAL_KEY && tmp->slaying == door->slaying) |
1715 | if (tmp->slaying && tmp->type == SPECIAL_KEY && tmp->slaying == door->slaying) |
1695 | break; |
1716 | break; |
1696 | } |
1717 | } |
… | |
… | |
1750 | /* find_key |
1771 | /* find_key |
1751 | * We try to find a key for the door as passed. If we find a key |
1772 | * We try to find a key for the door as passed. If we find a key |
1752 | * and successfully use it, we return the key, otherwise NULL |
1773 | * and successfully use it, we return the key, otherwise NULL |
1753 | * This function merges both normal and locked door, since the logic |
1774 | * This function merges both normal and locked door, since the logic |
1754 | * for both is the same - just the specific key is different. |
1775 | * for both is the same - just the specific key is different. |
1755 | * pl is the player, |
1776 | * pl is the player, |
1756 | * inv is the objects inventory to searched |
1777 | * inv is the objects inventory to searched |
1757 | * door is the door we are trying to match against. |
1778 | * door is the door we are trying to match against. |
1758 | * This function can be called recursively to search containers. |
1779 | * This function can be called recursively to search containers. |
1759 | */ |
1780 | */ |
1760 | object * |
1781 | object * |
1761 | find_key (object *pl, object *container, object *door) |
1782 | find_key (object *pl, object *container, object *door) |
… | |
… | |
2166 | void |
2187 | void |
2167 | do_some_living (object *op) |
2188 | do_some_living (object *op) |
2168 | { |
2189 | { |
2169 | int last_food = op->stats.food; |
2190 | int last_food = op->stats.food; |
2170 | int gen_hp, gen_sp, gen_grace; |
2191 | int gen_hp, gen_sp, gen_grace; |
2171 | int i; |
|
|
2172 | int rate_hp = 1200; |
2192 | int rate_hp = 1200; |
2173 | int rate_sp = 2500; |
2193 | int rate_sp = 2500; |
2174 | int rate_grace = 2000; |
2194 | int rate_grace = 2000; |
2175 | const int max_hp = 1; |
2195 | const int max_hp = 1; |
2176 | const int max_sp = 1; |
2196 | const int max_sp = 1; |
2177 | const int max_grace = 1; |
2197 | const int max_grace = 1; |
2178 | |
2198 | |
|
|
2199 | #if 0 |
2179 | if (op->contr->hidden) |
2200 | if (op->contr->hidden) |
2180 | { |
2201 | { |
2181 | op->invisible = 1000; |
2202 | op->invisible = 1000; |
2182 | /* the socket code flashes the player visible/invisible |
2203 | /* the socket code flashes the player visible/invisible |
2183 | * depending on the value of invisible, so we need to |
2204 | * depending on the value of invisible, so we need to |
2184 | * alternate it here for it to work correctly. |
2205 | * alternate it here for it to work correctly. |
2185 | */ |
2206 | */ |
2186 | if (server_tick & 2) |
2207 | if (server_tick & 2) |
2187 | op->invisible--; |
2208 | op->invisible--; |
2188 | } |
2209 | } |
|
|
2210 | else |
|
|
2211 | #endif |
2189 | else if (op->invisible && !(op->flag [FLAG_MAKE_INVIS])) |
2212 | if (op->invisible && !(op->flag [FLAG_MAKE_INVIS])) |
2190 | { |
2213 | { |
2191 | if (!op->invisible--) |
2214 | if (!op->invisible--) |
2192 | { |
2215 | { |
2193 | make_visible (op); |
2216 | make_visible (op); |
2194 | new_draw_info (NDI_UNIQUE, 0, op, "Your invisibility spell runs out."); |
2217 | new_draw_info (NDI_UNIQUE, 0, op, "Your invisibility spell runs out."); |
… | |
… | |
2577 | |
2600 | |
2578 | /* There is a maximum depletion total per level. */ |
2601 | /* There is a maximum depletion total per level. */ |
2579 | if (this_stat < -1 - op->level / BALSL_MAX_LOSS_RATIO) |
2602 | if (this_stat < -1 - op->level / BALSL_MAX_LOSS_RATIO) |
2580 | { |
2603 | { |
2581 | lose_this_stat = 0; |
2604 | lose_this_stat = 0; |
2582 | /* Take loss chance vs keep chance to see if we |
2605 | /* Take loss chance vs keep chance to see if we |
2583 | retain the stat. */ |
2606 | retain the stat. */ |
2584 | } |
2607 | } |
2585 | else |
2608 | else |
2586 | { |
2609 | { |
2587 | if (random_roll (0, loss_chance + keep_chance - 1, op, PREFER_LOW) < keep_chance) |
2610 | if (random_roll (0, loss_chance + keep_chance - 1, op, PREFER_LOW) < keep_chance) |
… | |
… | |
2700 | } |
2723 | } |
2701 | |
2724 | |
2702 | static void |
2725 | static void |
2703 | loot_object (object *op) |
2726 | loot_object (object *op) |
2704 | { /* Grab and destroy some treasure */ |
2727 | { /* Grab and destroy some treasure */ |
2705 | object *tmp, *tmp2, *next; |
2728 | object *tmp, *next; |
2706 | |
2729 | |
2707 | op->close_container (); /* close open sack first */ |
2730 | op->close_container (); /* close open sack first */ |
2708 | |
2731 | |
2709 | for (tmp = op->inv; tmp; tmp = next) |
2732 | for (tmp = op->inv; tmp; tmp = next) |
2710 | { |
2733 | { |
… | |
… | |
2742 | void |
2765 | void |
2743 | fix_weight () |
2766 | fix_weight () |
2744 | { |
2767 | { |
2745 | for_all_players (pl) |
2768 | for_all_players (pl) |
2746 | { |
2769 | { |
2747 | sint32 old = pl->ob->carrying; |
2770 | weight_t old = pl->ob->carrying; |
2748 | |
2771 | |
2749 | pl->ob->update_weight (); |
2772 | pl->ob->update_weight (); |
2750 | |
2773 | |
2751 | if (old != pl->ob->carrying) |
2774 | if (old != pl->ob->carrying) |
2752 | { |
2775 | { |
… | |
… | |
2947 | for (tmp = GET_MAP_OB (m, x, y); tmp; tmp = tmp->above) |
2970 | for (tmp = GET_MAP_OB (m, x, y); tmp; tmp = tmp->above) |
2948 | { |
2971 | { |
2949 | if ((player ||friendly) &&tmp->flag [FLAG_MONSTER] && !tmp->flag [FLAG_UNAGGRESSIVE]) |
2972 | if ((player ||friendly) &&tmp->flag [FLAG_MONSTER] && !tmp->flag [FLAG_UNAGGRESSIVE]) |
2950 | return 1; |
2973 | return 1; |
2951 | else if (tmp->type == PLAYER) |
2974 | else if (tmp->type == PLAYER) |
2952 | { |
|
|
2953 | /*don't let a hidden DM prevent you from hiding */ |
|
|
2954 | if (!tmp->flag [FLAG_WIZ] || tmp->contr->hidden == 0) |
|
|
2955 | return 1; |
2975 | return 1; |
2956 | } |
|
|
2957 | } |
2976 | } |
2958 | } |
2977 | } |
2959 | return 0; |
2978 | return 0; |
2960 | } |
2979 | } |
2961 | |
2980 | |
2962 | /* check the player los field for viewability of the |
2981 | /* check the player los field for viewability of the |
2963 | * object op. This function works fine for monsters, |
2982 | * object op. This function works fine for monsters, |
2964 | * but we dont worry if the object isnt the top one in |
2983 | * but we dont worry if the object isnt the top one in |
2965 | * a pile (say a coin under a table would return "viewable" |
2984 | * a pile (say a coin under a table would return "viewable" |
2966 | * by this routine). Another question, should we be |
2985 | * by this routine). Another question, should we be |
2967 | * concerned with the direction the player is looking |
2986 | * concerned with the direction the player is looking |
2968 | * in? Realistically, most of us can't see stuff behind |
2987 | * in? Realistically, most of us can't see stuff behind |
2969 | * our backs...on the other hand, does the "facing" direction |
2988 | * our backs...on the other hand, does the "facing" direction |
2970 | * imply the way your head, or body is facing? It's possible |
2989 | * imply the way your head, or body is facing? It's possible |
2971 | * for them to differ. Sigh, this fctn could get a bit more complex. |
2990 | * for them to differ. Sigh, this fctn could get a bit more complex. |
2972 | * -b.t. |
2991 | * -b.t. |
2973 | * This function is now map tiling safe. |
2992 | * This function is now map tiling safe. |
2974 | */ |
2993 | */ |
2975 | int |
2994 | int |
2976 | player_can_view (object *pl, object *op) |
2995 | player_can_view (object *pl, object *op) |
2977 | { |
2996 | { |
… | |
… | |
2991 | |
3010 | |
2992 | get_rangevector (pl, op, &rv, 0x1); |
3011 | get_rangevector (pl, op, &rv, 0x1); |
2993 | |
3012 | |
2994 | /* starting with the 'head' part, lets loop |
3013 | /* starting with the 'head' part, lets loop |
2995 | * through the object and find if it has any |
3014 | * through the object and find if it has any |
2996 | * part that is in the los array but isn't on |
3015 | * part that is in the los array but isn't on |
2997 | * a blocked los square. |
3016 | * a blocked los square. |
2998 | * we use the archetype to figure out offsets. |
3017 | * we use the archetype to figure out offsets. |
2999 | */ |
3018 | */ |
3000 | while (op) |
3019 | while (op) |
3001 | { |
3020 | { |