1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
8 | * Deliantra 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 3 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, |
… | |
… | |
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, see <http://www.gnu.org/licenses/>. |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * |
20 | * |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
22 | */ |
23 | |
23 | |
24 | #include <unistd.h> |
24 | #include <unistd.h> |
25 | |
25 | |
26 | #include "global.h" |
26 | #include "global.h" |
27 | #include "funcpoint.h" |
|
|
28 | |
27 | |
29 | #include "loader.h" |
28 | #include "loader.h" |
30 | |
29 | |
31 | #include "path.h" |
30 | #include "path.h" |
32 | |
31 | |
… | |
… | |
245 | |
244 | |
246 | insert_ob_in_ob (tmp, container); |
245 | insert_ob_in_ob (tmp, container); |
247 | tmp = next; |
246 | tmp = next; |
248 | } |
247 | } |
249 | |
248 | |
250 | /* sum_weight will go through and calculate what all the containers are |
249 | // go through and calculate what all the containers are carrying. |
251 | * carrying. |
250 | //TODO: remove |
252 | */ |
251 | container->update_weight (); |
253 | sum_weight (container); |
|
|
254 | } |
252 | } |
255 | |
253 | |
256 | void |
254 | void |
257 | maptile::set_object_flag (int flag, int value) |
255 | maptile::set_object_flag (int flag, int value) |
258 | { |
256 | { |
… | |
… | |
307 | bool |
305 | bool |
308 | maptile::_load_objects (object_thawer &f) |
306 | maptile::_load_objects (object_thawer &f) |
309 | { |
307 | { |
310 | for (;;) |
308 | for (;;) |
311 | { |
309 | { |
312 | coroapi::cede_to_tick_every (100); // cede once in a while |
310 | coroapi::cede_to_tick (); // cede once in a while |
313 | |
311 | |
314 | switch (f.kw) |
312 | switch (f.kw) |
315 | { |
313 | { |
316 | case KW_arch: |
314 | case KW_arch: |
317 | if (object *op = object::read (f, this)) |
315 | if (object *op = object::read (f, this)) |
318 | { |
316 | { |
|
|
317 | // TODO: why? |
319 | if (op->inv) |
318 | if (op->inv) |
320 | sum_weight (op); |
319 | op->update_weight (); |
321 | |
320 | |
322 | insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); |
321 | if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) |
|
|
322 | { |
|
|
323 | // we insert manually because |
|
|
324 | // a) its way faster |
|
|
325 | // b) we remove manually, too, and there are good reasons for that |
|
|
326 | // c) its correct |
|
|
327 | mapspace &ms = at (op->x, op->y); |
|
|
328 | |
|
|
329 | op->flag [FLAG_REMOVED] = false; |
|
|
330 | |
|
|
331 | op->above = 0; |
|
|
332 | op->below = ms.top; |
|
|
333 | |
|
|
334 | if (ms.top) |
|
|
335 | ms.top->above = op; |
|
|
336 | else |
|
|
337 | ms.bot = op; |
|
|
338 | |
|
|
339 | ms.top = op; |
|
|
340 | ms.flags_ = 0; |
|
|
341 | } |
|
|
342 | else |
|
|
343 | { |
|
|
344 | f.parse_warn (format ("object %s out of range", op->debug_desc ())); |
|
|
345 | op->destroy (); |
|
|
346 | } |
323 | } |
347 | } |
324 | |
348 | |
325 | continue; |
349 | continue; |
326 | |
350 | |
327 | case KW_EOF: |
351 | case KW_EOF: |
… | |
… | |
617 | case KW_sky: thawer.get (sky); break; |
641 | case KW_sky: thawer.get (sky); break; |
618 | |
642 | |
619 | case KW_per_player: thawer.get (per_player); break; |
643 | case KW_per_player: thawer.get (per_player); break; |
620 | case KW_per_party: thawer.get (per_party); break; |
644 | case KW_per_party: thawer.get (per_party); break; |
621 | case KW_no_reset: thawer.get (no_reset); break; |
645 | case KW_no_reset: thawer.get (no_reset); break; |
|
|
646 | case KW_no_drop: thawer.get (no_drop); break; |
622 | |
647 | |
623 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
648 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
624 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
649 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
625 | |
650 | |
626 | // old names new names |
651 | // old names new names |
… | |
… | |
700 | MAP_OUT (swap_time); |
725 | MAP_OUT (swap_time); |
701 | MAP_OUT (reset_time); |
726 | MAP_OUT (reset_time); |
702 | MAP_OUT (reset_timeout); |
727 | MAP_OUT (reset_timeout); |
703 | MAP_OUT (fixed_resettime); |
728 | MAP_OUT (fixed_resettime); |
704 | MAP_OUT (no_reset); |
729 | MAP_OUT (no_reset); |
|
|
730 | MAP_OUT (no_drop); |
705 | MAP_OUT (difficulty); |
731 | MAP_OUT (difficulty); |
706 | |
732 | |
707 | if (default_region) MAP_OUT2 (region, default_region->name); |
733 | if (default_region) MAP_OUT2 (region, default_region->name); |
708 | |
734 | |
709 | if (shopitems) |
735 | if (shopitems) |
… | |
… | |
787 | LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ()); |
813 | LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ()); |
788 | head->destroy (); |
814 | head->destroy (); |
789 | } |
815 | } |
790 | } |
816 | } |
791 | |
817 | |
792 | sfree (spaces, size ()), spaces = 0; |
818 | sfree0 (spaces, size ()); |
793 | } |
819 | } |
794 | |
820 | |
795 | if (buttons) |
821 | if (buttons) |
796 | free_objectlinkpt (buttons), buttons = 0; |
822 | free_objectlinkpt (buttons), buttons = 0; |
797 | |
823 | |
798 | sfree (regions, size ()); regions = 0; |
824 | sfree0 (regions, size ()); |
799 | delete [] regionmap; regionmap = 0; |
825 | delete [] regionmap; regionmap = 0; |
800 | } |
826 | } |
801 | |
827 | |
802 | void |
828 | void |
803 | maptile::clear_header () |
829 | maptile::clear_header () |
… | |
… | |
957 | |
983 | |
958 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
984 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
959 | { |
985 | { |
960 | total_exp += op->stats.exp; |
986 | total_exp += op->stats.exp; |
961 | |
987 | |
962 | if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) |
988 | if (archetype *at = op->other_arch) |
|
|
989 | { |
963 | total_exp += at->stats.exp * 8; |
990 | total_exp += at->stats.exp * 8; |
964 | |
|
|
965 | monster_cnt++; |
991 | monster_cnt++; |
|
|
992 | } |
|
|
993 | |
|
|
994 | for (object *inv = op->inv; inv; inv = inv->below) |
|
|
995 | { |
|
|
996 | total_exp += op->stats.exp * 8; |
|
|
997 | monster_cnt++; |
|
|
998 | } |
966 | } |
999 | } |
967 | } |
1000 | } |
968 | |
1001 | |
969 | avgexp = (double) total_exp / monster_cnt; |
1002 | avgexp = (double) total_exp / monster_cnt; |
970 | |
1003 | |
… | |
… | |
1009 | else |
1042 | else |
1010 | darkness = new_level; |
1043 | darkness = new_level; |
1011 | |
1044 | |
1012 | /* All clients need to get re-updated for the change */ |
1045 | /* All clients need to get re-updated for the change */ |
1013 | update_all_map_los (this); |
1046 | update_all_map_los (this); |
|
|
1047 | |
1014 | return 1; |
1048 | return 1; |
1015 | } |
1049 | } |
1016 | |
1050 | |
1017 | /* |
1051 | /* |
1018 | * This function updates various attributes about a specific space |
1052 | * This function updates various attributes about a specific space |
… | |
… | |
1021 | * through, etc) |
1055 | * through, etc) |
1022 | */ |
1056 | */ |
1023 | void |
1057 | void |
1024 | mapspace::update_ () |
1058 | mapspace::update_ () |
1025 | { |
1059 | { |
1026 | object *tmp, *last = 0; |
1060 | object *last = 0; |
1027 | uint8 flags = P_UPTODATE, light = 0, anywhere = 0; |
1061 | uint8 flags = P_UPTODATE, light = 0, anywhere = 0; |
1028 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1062 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1029 | |
1063 | |
1030 | //object *middle = 0; |
1064 | //object *middle = 0; |
1031 | //object *top = 0; |
1065 | //object *top = 0; |
… | |
… | |
1033 | // this seems to generate better code than using locals, above |
1067 | // this seems to generate better code than using locals, above |
1034 | object *&top = faces_obj[0] = 0; |
1068 | object *&top = faces_obj[0] = 0; |
1035 | object *&middle = faces_obj[1] = 0; |
1069 | object *&middle = faces_obj[1] = 0; |
1036 | object *&floor = faces_obj[2] = 0; |
1070 | object *&floor = faces_obj[2] = 0; |
1037 | |
1071 | |
1038 | for (tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1072 | for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1039 | { |
1073 | { |
1040 | /* This could be made additive I guess (two lights better than |
1074 | /* This could be made additive I guess (two lights better than |
1041 | * one). But if so, it shouldn't be a simple additive - 2 |
1075 | * one). But if so, it shouldn't be a simple additive - 2 |
1042 | * light bulbs do not illuminate twice as far as once since |
1076 | * light bulbs do not illuminate twice as far as once since |
1043 | * it is a dissapation factor that is cubed. |
1077 | * it is a dissapation factor that is cubed. |
1044 | */ |
1078 | */ |
1045 | if (tmp->glow_radius > light) |
|
|
1046 | light = tmp->glow_radius; |
1079 | light = max (light, tmp->glow_radius); |
1047 | |
1080 | |
1048 | /* This call is needed in order to update objects the player |
1081 | /* This call is needed in order to update objects the player |
1049 | * is standing in that have animations (ie, grass, fire, etc). |
1082 | * is standing in that have animations (ie, grass, fire, etc). |
1050 | * However, it also causes the look window to be re-drawn |
1083 | * However, it also causes the look window to be re-drawn |
1051 | * 3 times each time the player moves, because many of the |
1084 | * 3 times each time the player moves, because many of the |
… | |
… | |
1128 | * 1) top face is set, need middle to be set. |
1161 | * 1) top face is set, need middle to be set. |
1129 | * 2) middle is set, need to set top. |
1162 | * 2) middle is set, need to set top. |
1130 | * 3) neither middle or top is set - need to set both. |
1163 | * 3) neither middle or top is set - need to set both. |
1131 | */ |
1164 | */ |
1132 | |
1165 | |
1133 | for (tmp = last; tmp; tmp = tmp->below) |
1166 | for (object *tmp = last; tmp; tmp = tmp->below) |
1134 | { |
1167 | { |
1135 | /* Once we get to a floor, stop, since we already have a floor object */ |
1168 | /* Once we get to a floor, stop, since we already have a floor object */ |
1136 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1169 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1137 | break; |
1170 | break; |
1138 | |
1171 | |
… | |
… | |
1196 | maptile::tile_available (int dir, bool load) |
1229 | maptile::tile_available (int dir, bool load) |
1197 | { |
1230 | { |
1198 | if (!tile_path[dir]) |
1231 | if (!tile_path[dir]) |
1199 | return 0; |
1232 | return 0; |
1200 | |
1233 | |
1201 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY)) |
1234 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
1202 | return 1; |
1235 | return 1; |
1203 | |
1236 | |
1204 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1237 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1205 | return 1; |
1238 | return 1; |
1206 | |
1239 | |
… | |
… | |
1541 | } |
1574 | } |
1542 | |
1575 | |
1543 | object * |
1576 | object * |
1544 | maptile::insert (object *op, int x, int y, object *originator, int flags) |
1577 | maptile::insert (object *op, int x, int y, object *originator, int flags) |
1545 | { |
1578 | { |
1546 | if (!op->flag [FLAG_REMOVED]) |
|
|
1547 | op->remove (); |
|
|
1548 | |
|
|
1549 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1579 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1550 | } |
1580 | } |
1551 | |
1581 | |
1552 | region * |
1582 | region * |
1553 | maptile::region (int x, int y) const |
1583 | maptile::region (int x, int y) const |
… | |
… | |
1563 | |
1593 | |
1564 | return ::region::default_region (); |
1594 | return ::region::default_region (); |
1565 | } |
1595 | } |
1566 | |
1596 | |
1567 | /* picks a random object from a style map. |
1597 | /* picks a random object from a style map. |
1568 | * Redone by MSW so it should be faster and not use static |
|
|
1569 | * variables to generate tables. |
|
|
1570 | */ |
1598 | */ |
1571 | object * |
1599 | object * |
1572 | maptile::pick_random_object () const |
1600 | maptile::pick_random_object (rand_gen &gen) const |
1573 | { |
1601 | { |
1574 | /* while returning a null object will result in a crash, that |
1602 | /* while returning a null object will result in a crash, that |
1575 | * is actually preferable to an infinite loop. That is because |
1603 | * is actually preferable to an infinite loop. That is because |
1576 | * most servers will automatically restart in case of crash. |
1604 | * most servers will automatically restart in case of crash. |
1577 | * Change the logic on getting the random space - shouldn't make |
1605 | * Change the logic on getting the random space - shouldn't make |
1578 | * any difference, but this seems clearer to me. |
1606 | * any difference, but this seems clearer to me. |
1579 | */ |
1607 | */ |
1580 | for (int i = 1000; --i;) |
1608 | for (int i = 1000; --i;) |
1581 | { |
1609 | { |
1582 | object *pick = at (rndm (width), rndm (height)).bot; |
1610 | object *pick = at (gen (width), gen (height)).bot; |
1583 | |
1611 | |
1584 | // do not prefer big monsters just because they are big. |
1612 | // do not prefer big monsters just because they are big. |
1585 | if (pick && pick->head_ () == pick) |
1613 | if (pick && pick->is_head ()) |
1586 | return pick->head_ (); |
1614 | return pick->head_ (); |
1587 | } |
1615 | } |
1588 | |
1616 | |
1589 | // instead of crashing in the unlikely(?) case, try to return *something* |
1617 | // instead of crashing in the unlikely(?) case, try to return *something* |
1590 | return get_archetype ("blocked"); |
1618 | return archetype::find ("bug"); |
1591 | } |
1619 | } |
1592 | |
1620 | |
1593 | void |
1621 | void |
1594 | maptile::play_sound (faceidx sound, int x, int y) const |
1622 | maptile::play_sound (faceidx sound, int x, int y) const |
1595 | { |
1623 | { |
1596 | if (!sound) |
1624 | if (!sound) |
1597 | return; |
1625 | return; |
1598 | |
1626 | |
1599 | for_all_players (pl) |
1627 | for_all_players (pl) |
1600 | if (pl->observe->map == this) |
1628 | if (pl->ob->map == this) |
1601 | if (client *ns = pl->ns) |
1629 | if (client *ns = pl->ns) |
1602 | { |
1630 | { |
1603 | int dx = x - pl->observe->x; |
1631 | int dx = x - pl->ob->x; |
1604 | int dy = y - pl->observe->y; |
1632 | int dy = y - pl->ob->y; |
1605 | |
1633 | |
1606 | int distance = idistance (dx, dy); |
1634 | int distance = idistance (dx, dy); |
1607 | |
1635 | |
1608 | if (distance <= MAX_SOUND_DISTANCE) |
1636 | if (distance <= MAX_SOUND_DISTANCE) |
1609 | ns->play_sound (sound, dx, dy); |
1637 | ns->play_sound (sound, dx, dy); |