| 1 |
/* |
| 2 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
| 3 |
* |
| 4 |
* Copyright (©) 2017,2018 Marc Alexander Lehmann / 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 |
| 6 |
* |
| 7 |
* Deliantra is free software: you can redistribute it and/or modify it under |
| 8 |
* the terms of the Affero GNU General Public License as published by the |
| 9 |
* Free Software Foundation, either version 3 of the License, or (at your |
| 10 |
* option) any later version. |
| 11 |
* |
| 12 |
* This program is distributed in the hope that it will be useful, |
| 13 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 14 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 15 |
* GNU General Public License for more details. |
| 16 |
* |
| 17 |
* You should have received a copy of the Affero GNU General Public License |
| 18 |
* and the GNU General Public License along with this program. If not, see |
| 19 |
* <http://www.gnu.org/licenses/>. |
| 20 |
* |
| 21 |
* The authors can be reached via e-mail to <support@deliantra.net> |
| 22 |
*/ |
| 23 |
|
| 24 |
/* Send bug reports to Raphael Quinet (quinet@montefiore.ulg.ac.be) */ |
| 25 |
|
| 26 |
/** |
| 27 |
* \file |
| 28 |
* Sound-related functions. |
| 29 |
* |
| 30 |
* \date 2003-12-02 |
| 31 |
*/ |
| 32 |
|
| 33 |
#include <global.h> |
| 34 |
#include <sproto.h> |
| 35 |
#include <sounds.h> |
| 36 |
|
| 37 |
#include <flat_hash_map.hpp> |
| 38 |
|
| 39 |
// the hashtable |
| 40 |
typedef ska::flat_hash_map |
| 41 |
< |
| 42 |
const char *, |
| 43 |
faceidx, |
| 44 |
str_hash, |
| 45 |
str_equal, |
| 46 |
slice_allocator< std::pair<const char *const, faceidx> > |
| 47 |
> HT; |
| 48 |
|
| 49 |
static HT ht; |
| 50 |
|
| 51 |
faceidx |
| 52 |
sound_find (const char *str) |
| 53 |
{ |
| 54 |
auto i = ht.find (str); |
| 55 |
|
| 56 |
if (i != ht.end ()) |
| 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); |
| 63 |
} |
| 64 |
|
| 65 |
void |
| 66 |
sound_set (const char *str, faceidx face) |
| 67 |
{ |
| 68 |
auto i = ht.find (str); |
| 69 |
|
| 70 |
if (i != ht.end ()) |
| 71 |
i->second = face; |
| 72 |
else |
| 73 |
ht.insert (std::make_pair (strdup (str), face)); |
| 74 |
} |
| 75 |
|
| 76 |
//TODO: remove |
| 77 |
// for gcfclient-compatibility, to vanish at some point |
| 78 |
faceidx old_sound_index [SOUND_CAST_SPELL_0]; |
| 79 |
|
| 80 |
/* |
| 81 |
* Plays a sound for specified player only |
| 82 |
*/ |
| 83 |
void |
| 84 |
client::play_sound (faceidx sound, int dx, int dy) |
| 85 |
{ |
| 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) |
| 93 |
return; |
| 94 |
|
| 95 |
if (fx_want [FT_SOUND]) |
| 96 |
{ |
| 97 |
// cfplus |
| 98 |
send_face (sound); |
| 99 |
flush_fx (); |
| 100 |
|
| 101 |
packet sl ("sc"); |
| 102 |
|
| 103 |
uint8 *len = sl.cur; |
| 104 |
|
| 105 |
sl << uint8 (0) // group length, decoded as BER in clients |
| 106 |
<< uint8 (0) // type == one-time effect |
| 107 |
<< ber32 (sound) |
| 108 |
<< sint8 (dx) |
| 109 |
<< sint8 (dy) |
| 110 |
<< uint8 (vol); // 0 == silent, 255 max |
| 111 |
|
| 112 |
*len = sl.cur - len - 1; // patch in group length |
| 113 |
|
| 114 |
send_packet (sl); |
| 115 |
} |
| 116 |
else if (this->sound) |
| 117 |
{ |
| 118 |
//TODO: remove, or make bearable |
| 119 |
// gcfclient compatibility |
| 120 |
|
| 121 |
int gcfclient_sound; |
| 122 |
for (gcfclient_sound = SOUND_CAST_SPELL_0; gcfclient_sound--; ) |
| 123 |
if (old_sound_index [gcfclient_sound] == sound) |
| 124 |
{ |
| 125 |
packet sl ("sound"); |
| 126 |
|
| 127 |
sl << uint8 (dx) |
| 128 |
<< uint8 (dy) |
| 129 |
<< uint16 (gcfclient_sound) |
| 130 |
<< uint8 (SOUND_NORMAL); |
| 131 |
|
| 132 |
send_packet (sl); |
| 133 |
|
| 134 |
break; |
| 135 |
} |
| 136 |
} |
| 137 |
} |
| 138 |
|
