| 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 (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team |
| 5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
|
|
| 7 | * |
6 | * |
| 8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
7 | * 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 |
8 | * 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 |
9 | * Free Software Foundation, either version 3 of the License, or (at your |
| 11 | * (at your option) any later version. |
10 | * option) any later version. |
| 12 | * |
11 | * |
| 13 | * This program is distributed in the hope that it will be useful, |
12 | * This program is distributed in the hope that it will be useful, |
| 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 16 | * GNU General Public License for more details. |
15 | * GNU General Public License for more details. |
| 17 | * |
16 | * |
| 18 | * You should have received a copy of the GNU General Public License |
17 | * 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/>. |
18 | * and the GNU General Public License along with this program. If not, see |
|
|
19 | * <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 | /** |
| … | |
… | |
| 32 | |
32 | |
| 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 <flat_hash_map.hpp> |
| 38 | |
38 | |
| 39 | // the hashtable |
39 | // the hashtable |
| 40 | typedef std::tr1::unordered_map |
40 | typedef ska::flat_hash_map |
| 41 | < |
41 | < |
| 42 | const char *, |
42 | const char *, |
| 43 | faceidx, |
43 | faceidx, |
| 44 | str_hash, |
44 | str_hash, |
| 45 | str_equal, |
45 | str_equal, |
| … | |
… | |
| 49 | static HT ht; |
49 | static HT ht; |
| 50 | |
50 | |
| 51 | faceidx |
51 | faceidx |
| 52 | sound_find (const char *str) |
52 | sound_find (const char *str) |
| 53 | { |
53 | { |
| 54 | auto (i, ht.find (str)); |
54 | auto i = ht.find (str); |
| 55 | |
55 | |
| 56 | if (i != ht.end ()) |
56 | if (i != ht.end ()) |
| 57 | return i->second; |
57 | return i->second; |
| 58 | |
58 | |
| 59 | //TODO: really fall back to face name? |
59 | if (strncmp (str, "sound/", sizeof ("sound/") - 1)) |
| 60 | char face[128]; |
60 | str = format ("sound/%s", str); |
| 61 | snprintf (face, 128, "sound/%s", str); |
61 | |
| 62 | return face_find (face); |
62 | return face_find (str); |
| 63 | } |
63 | } |
| 64 | |
64 | |
| 65 | void |
65 | void |
| 66 | sound_set (const char *str, faceidx face) |
66 | sound_set (const char *str, faceidx face) |
| 67 | { |
67 | { |
| 68 | auto (i, ht.find (str)); |
68 | auto i = ht.find (str); |
| 69 | |
69 | |
| 70 | if (i != ht.end ()) |
70 | if (i != ht.end ()) |
| 71 | i->second = face; |
71 | i->second = face; |
| 72 | else |
72 | else |
| 73 | ht.insert (std::make_pair (strdup (str), face)); |
73 | ht.insert (std::make_pair (strdup (str), face)); |
| … | |
… | |
| 100 | |
100 | |
| 101 | packet sl ("sc"); |
101 | packet sl ("sc"); |
| 102 | |
102 | |
| 103 | uint8 *len = sl.cur; |
103 | uint8 *len = sl.cur; |
| 104 | |
104 | |
| 105 | sl << uint8 (0) // group length |
105 | sl << uint8 (0) // group length, decoded as BER in clients |
| 106 | << uint8 (0) // type == one-time effect |
106 | << uint8 (0) // type == one-time effect |
| 107 | << ber32 (sound) |
107 | << ber32 (sound) |
| 108 | << sint8 (dx) |
108 | << sint8 (dx) |
| 109 | << sint8 (dy) |
109 | << sint8 (dy) |
| 110 | << uint8 (vol); // 0 == silent, 255 max |
110 | << uint8 (vol); // 0 == silent, 255 max |
| 111 | |
111 | |
| 112 | *len = sl.cur - len; // patch in group length |
112 | *len = sl.cur - len - 1; // patch in group length |
| 113 | |
113 | |
| 114 | send_packet (sl); |
114 | send_packet (sl); |
| 115 | } |
115 | } |
| 116 | else if (this->sound) |
116 | else if (this->sound) |
| 117 | { |
117 | { |
