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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,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 | /* Send bug reports to Raphael Quinet (quinet@montefiore.ulg.ac.be) */ |
24 | /* Send bug reports to Raphael Quinet (quinet@montefiore.ulg.ac.be) */ |
25 | |
25 | |
26 | /** |
26 | /** |
… | |
… | |
33 | #include <global.h> |
33 | #include <global.h> |
34 | #include <sproto.h> |
34 | #include <sproto.h> |
35 | #include <sounds.h> |
35 | #include <sounds.h> |
36 | |
36 | |
37 | #include <tr1/unordered_map> |
37 | #include <tr1/unordered_map> |
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 | |
38 | |
46 | // the hashtable |
39 | // the hashtable |
47 | typedef std::tr1::unordered_map |
40 | typedef std::tr1::unordered_map |
48 | < |
41 | < |
49 | const char *, |
42 | const char *, |
… | |
… | |
58 | faceidx |
51 | faceidx |
59 | sound_find (const char *str) |
52 | sound_find (const char *str) |
60 | { |
53 | { |
61 | auto (i, ht.find (str)); |
54 | auto (i, ht.find (str)); |
62 | |
55 | |
63 | return i == ht.end () |
56 | if (i != ht.end ()) |
64 | ? 0 |
|
|
65 | : i->second; |
57 | return i->second; |
|
|
58 | |
|
|
59 | if (strncmp (str, "sound/", sizeof ("sound/") - 1)) |
|
|
60 | str = format ("sound/%s", str); |
|
|
61 | |
|
|
62 | return face_find (str); |
66 | } |
63 | } |
67 | |
64 | |
68 | void |
65 | void |
69 | sound_set (const char *str, faceidx face) |
66 | sound_set (const char *str, faceidx face) |
70 | { |
67 | { |
… | |
… | |
74 | i->second = face; |
71 | i->second = face; |
75 | else |
72 | else |
76 | ht.insert (std::make_pair (strdup (str), face)); |
73 | ht.insert (std::make_pair (strdup (str), face)); |
77 | } |
74 | } |
78 | |
75 | |
|
|
76 | //TODO: remove |
|
|
77 | // for gcfclient-compatibility, to vanish at some point |
|
|
78 | faceidx old_sound_index [SOUND_CAST_SPELL_0]; |
|
|
79 | |
79 | /* |
80 | /* |
80 | * Plays a sound for specified player only |
81 | * Plays a sound for specified player only |
81 | */ |
82 | */ |
82 | void |
83 | void |
83 | client::play_sound (faceidx sound, int dx, int dy) |
84 | client::play_sound (faceidx sound, int dx, int dy) |
84 | { |
85 | { |
85 | if (!sound) |
86 | if (!sound) |
|
|
87 | return; |
|
|
88 | |
|
|
89 | uint8 vol = 255 - idistance (dx, dy) * 255 / MAX_SOUND_DISTANCE; |
|
|
90 | |
|
|
91 | // cut off volume here |
|
|
92 | if (vol <= 0) |
86 | return; |
93 | return; |
87 | |
94 | |
88 | if (fx_want [FT_SOUND]) |
95 | if (fx_want [FT_SOUND]) |
89 | { |
96 | { |
90 | // cfplus |
97 | // cfplus |
… | |
… | |
97 | |
104 | |
98 | sl << uint8 (0) // group length |
105 | sl << uint8 (0) // group length |
99 | << uint8 (0) // type == one-time effect |
106 | << uint8 (0) // type == one-time effect |
100 | << ber32 (sound) |
107 | << ber32 (sound) |
101 | << sint8 (dx) |
108 | << sint8 (dx) |
102 | << sint8 (dy); |
109 | << sint8 (dy) |
|
|
110 | << uint8 (vol); // 0 == silent, 255 max |
103 | |
111 | |
104 | *len = sl.cur - len; // patch in group length |
112 | *len = sl.cur - len; // patch in group length |
105 | |
113 | |
106 | send_packet (sl); |
114 | send_packet (sl); |
107 | } |
115 | } |
108 | else if (this->sound) |
116 | else if (this->sound) |
109 | { |
117 | { |
|
|
118 | //TODO: remove, or make bearable |
110 | // gcfclient compatibility |
119 | // gcfclient compatibility |
111 | // fetch compatibility sound index first |
|
|
112 | |
120 | |
|
|
121 | int gcfclient_sound; |
|
|
122 | for (gcfclient_sound = SOUND_CAST_SPELL_0; gcfclient_sound--; ) |
|
|
123 | if (old_sound_index [gcfclient_sound] == sound) |
|
|
124 | { |
113 | packet sl ("sound"); |
125 | packet sl ("sound"); |
114 | |
126 | |
115 | sl << uint8 (dx) |
127 | sl << uint8 (dx) |
116 | << uint8 (dy) |
128 | << uint8 (dy) |
117 | << uint16 (sound) |
129 | << uint16 (gcfclient_sound) |
118 | << uint8 (SOUND_NORMAL); |
130 | << uint8 (SOUND_NORMAL); |
119 | |
131 | |
120 | send_packet (sl); |
132 | send_packet (sl); |
|
|
133 | |
|
|
134 | break; |
|
|
135 | } |
121 | } |
136 | } |
122 | } |
137 | } |
123 | |
138 | |