| 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,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
|
|
| 6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
|
|
| 7 | * |
5 | * |
| 8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
| 9 | * it under the terms of the GNU General Public License as published by |
7 | * the terms of the Affero GNU General Public License as published by the |
| 10 | * the Free Software Foundation, either version 3 of the License, or |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
| 11 | * (at your option) any later version. |
9 | * option) any later version. |
| 12 | * |
10 | * |
| 13 | * This program is distributed in the hope that it will be useful, |
11 | * This program is distributed in the hope that it will be useful, |
| 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 16 | * GNU General Public License for more details. |
14 | * GNU General Public License for more details. |
| 17 | * |
15 | * |
| 18 | * You should have received a copy of the GNU General Public License |
16 | * You should have received a copy of the Affero GNU General Public License |
| 19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
17 | * and the GNU General Public License along with this program. If not, see |
|
|
18 | * <http://www.gnu.org/licenses/>. |
| 20 | * |
19 | * |
| 21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
| 22 | */ |
21 | */ |
| 23 | |
22 | |
| 24 | /* Send bug reports to Raphael Quinet (quinet@montefiore.ulg.ac.be) */ |
23 | /* Send bug reports to Raphael Quinet (quinet@montefiore.ulg.ac.be) */ |
| 25 | |
24 | |
| 26 | /** |
25 | /** |
| … | |
… | |
| 32 | |
31 | |
| 33 | #include <global.h> |
32 | #include <global.h> |
| 34 | #include <sproto.h> |
33 | #include <sproto.h> |
| 35 | #include <sounds.h> |
34 | #include <sounds.h> |
| 36 | |
35 | |
| 37 | #include <tr1/unordered_map> |
36 | #include <flat_hash_map.hpp> |
| 38 | |
|
|
| 39 | /** |
|
|
| 40 | * Maximum distance a player may hear a sound from. |
|
|
| 41 | * This is only used for new client/server sound. If the sound source |
|
|
| 42 | * on the map is farther away than this, we don't sent it to the client. |
|
|
| 43 | */ |
|
|
| 44 | #define MAX_SOUND_DISTANCE 10 |
|
|
| 45 | |
37 | |
| 46 | // the hashtable |
38 | // the hashtable |
| 47 | typedef std::tr1::unordered_map |
39 | typedef ska::flat_hash_map |
| 48 | < |
40 | < |
| 49 | const char *, |
41 | const char *, |
| 50 | faceidx, |
42 | faceidx, |
| 51 | str_hash, |
43 | str_hash, |
| 52 | str_equal, |
44 | str_equal, |
| … | |
… | |
| 58 | faceidx |
50 | faceidx |
| 59 | sound_find (const char *str) |
51 | sound_find (const char *str) |
| 60 | { |
52 | { |
| 61 | auto (i, ht.find (str)); |
53 | auto (i, ht.find (str)); |
| 62 | |
54 | |
| 63 | return i == ht.end () |
55 | if (i != ht.end ()) |
| 64 | ? 0 |
|
|
| 65 | : i->second; |
56 | return i->second; |
|
|
57 | |
|
|
58 | if (strncmp (str, "sound/", sizeof ("sound/") - 1)) |
|
|
59 | str = format ("sound/%s", str); |
|
|
60 | |
|
|
61 | return face_find (str); |
| 66 | } |
62 | } |
| 67 | |
63 | |
| 68 | void |
64 | void |
| 69 | sound_set (const char *str, faceidx face) |
65 | sound_set (const char *str, faceidx face) |
| 70 | { |
66 | { |
| … | |
… | |
| 87 | client::play_sound (faceidx sound, int dx, int dy) |
83 | client::play_sound (faceidx sound, int dx, int dy) |
| 88 | { |
84 | { |
| 89 | if (!sound) |
85 | if (!sound) |
| 90 | return; |
86 | return; |
| 91 | |
87 | |
| 92 | if (dx < -10 || dx > 10) return; |
88 | uint8 vol = 255 - idistance (dx, dy) * 255 / MAX_SOUND_DISTANCE; |
| 93 | if (dy < -10 || dy > 10) return; |
89 | |
|
|
90 | // cut off volume here |
|
|
91 | if (vol <= 0) |
|
|
92 | return; |
| 94 | |
93 | |
| 95 | if (fx_want [FT_SOUND]) |
94 | if (fx_want [FT_SOUND]) |
| 96 | { |
95 | { |
| 97 | // cfplus |
96 | // cfplus |
| 98 | send_face (sound); |
97 | send_face (sound); |
| 99 | flush_fx (); |
98 | flush_fx (); |
| 100 | |
99 | |
| 101 | uint8 vol = clamp (255 - idistance (dx, dy) * 255 / 10, 0, 255); |
|
|
| 102 | |
|
|
| 103 | // cut off volume here |
|
|
| 104 | if (vol < 16) |
|
|
| 105 | return; |
|
|
| 106 | |
|
|
| 107 | packet sl ("sc"); |
100 | packet sl ("sc"); |
| 108 | |
101 | |
| 109 | uint8 *len = sl.cur; |
102 | uint8 *len = sl.cur; |
| 110 | |
103 | |
| 111 | sl << uint8 (0) // group length |
104 | sl << uint8 (0) // group length, decoded as BER in clients |
| 112 | << uint8 (0) // type == one-time effect |
105 | << uint8 (0) // type == one-time effect |
| 113 | << ber32 (sound) |
106 | << ber32 (sound) |
| 114 | << sint8 (dx) |
107 | << sint8 (dx) |
| 115 | << sint8 (dy) |
108 | << sint8 (dy) |
| 116 | << uint8 (vol); // 0 == silent, 255 max |
109 | << uint8 (vol); // 0 == silent, 255 max |
| 117 | |
110 | |
| 118 | *len = sl.cur - len; // patch in group length |
111 | *len = sl.cur - len - 1; // patch in group length |
| 119 | |
112 | |
| 120 | send_packet (sl); |
113 | send_packet (sl); |
| 121 | } |
114 | } |
| 122 | else if (this->sound) |
115 | else if (this->sound) |
| 123 | { |
116 | { |
