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 (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * |
6 | * |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
7 | * Deliantra is free software: you can redistribute it and/or modify it under |
7 | * the terms of the Affero GNU General Public License as published by the |
8 | * the terms of the Affero GNU General Public License as published by the |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
9 | * Free Software Foundation, either version 3 of the License, or (at your |
9 | * option) any later version. |
10 | * option) any later version. |
… | |
… | |
31 | |
32 | |
32 | #include <global.h> |
33 | #include <global.h> |
33 | #include <sproto.h> |
34 | #include <sproto.h> |
34 | #include <sounds.h> |
35 | #include <sounds.h> |
35 | |
36 | |
36 | #include <tr1/unordered_map> |
37 | #include <flat_hash_map.hpp> |
37 | |
38 | |
38 | // the hashtable |
39 | // the hashtable |
39 | typedef std::tr1::unordered_map |
40 | typedef ska::flat_hash_map |
40 | < |
41 | < |
41 | const char *, |
42 | const char *, |
42 | faceidx, |
43 | faceidx, |
43 | str_hash, |
44 | str_hash, |
44 | str_equal, |
45 | str_equal, |
… | |
… | |
48 | static HT ht; |
49 | static HT ht; |
49 | |
50 | |
50 | faceidx |
51 | faceidx |
51 | sound_find (const char *str) |
52 | sound_find (const char *str) |
52 | { |
53 | { |
53 | auto (i, ht.find (str)); |
54 | auto i = ht.find (str); |
54 | |
55 | |
55 | if (i != ht.end ()) |
56 | if (i != ht.end ()) |
56 | return i->second; |
57 | return i->second; |
57 | |
58 | |
58 | if (strncmp (str, "sound/", sizeof ("sound/") - 1)) |
59 | if (strncmp (str, "sound/", sizeof ("sound/") - 1)) |
… | |
… | |
62 | } |
63 | } |
63 | |
64 | |
64 | void |
65 | void |
65 | sound_set (const char *str, faceidx face) |
66 | sound_set (const char *str, faceidx face) |
66 | { |
67 | { |
67 | auto (i, ht.find (str)); |
68 | auto i = ht.find (str); |
68 | |
69 | |
69 | if (i != ht.end ()) |
70 | if (i != ht.end ()) |
70 | i->second = face; |
71 | i->second = face; |
71 | else |
72 | else |
72 | ht.insert (std::make_pair (strdup (str), face)); |
73 | ht.insert (std::make_pair (strdup (str), face)); |
… | |
… | |
99 | |
100 | |
100 | packet sl ("sc"); |
101 | packet sl ("sc"); |
101 | |
102 | |
102 | uint8 *len = sl.cur; |
103 | uint8 *len = sl.cur; |
103 | |
104 | |
104 | sl << uint8 (0) // group length |
105 | sl << uint8 (0) // group length, decoded as BER in clients |
105 | << uint8 (0) // type == one-time effect |
106 | << uint8 (0) // type == one-time effect |
106 | << ber32 (sound) |
107 | << ber32 (sound) |
107 | << sint8 (dx) |
108 | << sint8 (dx) |
108 | << sint8 (dy) |
109 | << sint8 (dy) |
109 | << uint8 (vol); // 0 == silent, 255 max |
110 | << uint8 (vol); // 0 == silent, 255 max |
110 | |
111 | |
111 | *len = sl.cur - len; // patch in group length |
112 | *len = sl.cur - len - 1; // patch in group length |
112 | |
113 | |
113 | send_packet (sl); |
114 | send_packet (sl); |
114 | } |
115 | } |
115 | else if (this->sound) |
116 | else if (this->sound) |
116 | { |
117 | { |