| 1 |
/* |
| 2 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
| 3 |
* |
| 4 |
* Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 |
* Copyright (©) 2001 Mark Wedel |
| 6 |
* Copyright (©) 1992 Frank Tore Johansen |
| 7 |
* |
| 8 |
* Deliantra is free software: you can redistribute it and/or modify it under |
| 9 |
* the terms of the Affero GNU General Public License as published by the |
| 10 |
* Free Software Foundation, either version 3 of the License, or (at your |
| 11 |
* option) any later version. |
| 12 |
* |
| 13 |
* This program is distributed in the hope that it will be useful, |
| 14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 16 |
* GNU General Public License for more details. |
| 17 |
* |
| 18 |
* You should have received a copy of the Affero GNU General Public License |
| 19 |
* and the GNU General Public License along with this program. If not, see |
| 20 |
* <http://www.gnu.org/licenses/>. |
| 21 |
* |
| 22 |
* The authors can be reached via e-mail to <support@deliantra.net> |
| 23 |
*/ |
| 24 |
|
| 25 |
/** \file |
| 26 |
* Image related communication |
| 27 |
* |
| 28 |
* \date 2003-12-02 |
| 29 |
* |
| 30 |
* This file deals with the image related communication to the |
| 31 |
* client. I've located all the functions in this file - this |
| 32 |
* localizes it more, and means that we don't need to declare |
| 33 |
* things like all the structures as globals. |
| 34 |
*/ |
| 35 |
|
| 36 |
#include <global.h> |
| 37 |
#include <sproto.h> |
| 38 |
|
| 39 |
#include "crc.h" |
| 40 |
|
| 41 |
#define MAX_IMAGE_SIZE 10000 |
| 42 |
|
| 43 |
/** |
| 44 |
* client requested an image. send it rate-limited |
| 45 |
* before flushing. |
| 46 |
*/ |
| 47 |
void |
| 48 |
AskFaceCmd (char *buf, int len, client *ns) |
| 49 |
{ |
| 50 |
int idx = 0, pri = 0; |
| 51 |
|
| 52 |
sscanf (buf, "%d %d", &idx, &pri); |
| 53 |
|
| 54 |
//TODO: somehow fetch default priority from send_fx here |
| 55 |
|
| 56 |
const facedata *d = face_data (idx, ns->faceset); |
| 57 |
|
| 58 |
if (!d) |
| 59 |
return; // doh |
| 60 |
|
| 61 |
client::ixsend ix; |
| 62 |
|
| 63 |
ix.pri = pri; |
| 64 |
ix.idx = idx; |
| 65 |
ix.ofs = d->data.size (); |
| 66 |
|
| 67 |
auto (pos, ns->ixface.end ()); |
| 68 |
|
| 69 |
// the by far most common case will be to insert |
| 70 |
// near the end, so little looping. |
| 71 |
while (pos != ns->ixface.begin ()) |
| 72 |
{ |
| 73 |
--pos; |
| 74 |
|
| 75 |
// sort within 2k bins, to slightly prefer smaller images |
| 76 |
if (pri > pos->pri || (pri == pos->pri && (ix.ofs >> 11) <= (pos->ofs >> 11))) |
| 77 |
{ |
| 78 |
++pos; |
| 79 |
break; |
| 80 |
} |
| 81 |
} |
| 82 |
|
| 83 |
ns->ixface.insert (pos, ix); |
| 84 |
|
| 85 |
#if 0 |
| 86 |
for (auto (i, ns->ixface.begin ()); i != ns->ixface.end (); ++i) |
| 87 |
fprintf (stderr, "<%d,%d> ", i->pri, i->ofs); |
| 88 |
fprintf (stderr, "\n"); |
| 89 |
#endif |
| 90 |
} |
| 91 |
|
| 92 |
/** |
| 93 |
* Sends a face offer (fx) to a client. |
| 94 |
* If nocache is true (nonzero), ignore the cache setting from the client - |
| 95 |
* this is needed for the askface, in which we really do want to send the |
| 96 |
* face (and askface is the only place that should be setting it). Otherwise, |
| 97 |
* we look at the facecache, and if set, send the image name. |
| 98 |
*/ |
| 99 |
void |
| 100 |
client::send_face (faceidx facenum, int pri) |
| 101 |
{ |
| 102 |
// never send face 0. ever. it does not exist. |
| 103 |
if (!facenum) |
| 104 |
return; |
| 105 |
|
| 106 |
faceinfo *f = face_info (facenum); |
| 107 |
|
| 108 |
if (!f) |
| 109 |
{ |
| 110 |
LOG (llevError | logBacktrace, "client::send_face (%d) out of bounds??\n", facenum); |
| 111 |
return; |
| 112 |
} |
| 113 |
|
| 114 |
// refuse to send non-image faces unless requested |
| 115 |
if (!fx_want [f->type]) |
| 116 |
return; |
| 117 |
|
| 118 |
if (faces_sent [facenum]) |
| 119 |
return; |
| 120 |
|
| 121 |
faces_sent [facenum] = true; |
| 122 |
|
| 123 |
fxface.push_back (facenum); |
| 124 |
} |
| 125 |
|
| 126 |
void client::flush_fx () |
| 127 |
{ |
| 128 |
while (!fxface.empty ()) |
| 129 |
{ |
| 130 |
packet fx ("fx"); |
| 131 |
packet sx ("sx"); |
| 132 |
int type = 0; |
| 133 |
|
| 134 |
do |
| 135 |
{ |
| 136 |
faceidx facenum = fxface.back (); fxface.pop_back (); |
| 137 |
|
| 138 |
if (const faceinfo *f = face_info (facenum)) |
| 139 |
{ |
| 140 |
if (f->type != type) |
| 141 |
{ |
| 142 |
type = f->type; |
| 143 |
|
| 144 |
fx << ber32 (0) |
| 145 |
<< uint8 (1) << uint8 (type); |
| 146 |
} |
| 147 |
|
| 148 |
const facedata *d = f->data (faceset); |
| 149 |
|
| 150 |
fx << ber32 (facenum) |
| 151 |
<< data8 (d->chksum, d->chksum_len); |
| 152 |
|
| 153 |
if (smoothing) |
| 154 |
{ |
| 155 |
faceinfo *f = face_info (facenum); |
| 156 |
|
| 157 |
if (f->smooth) |
| 158 |
{ |
| 159 |
send_face (f->smooth, -110); |
| 160 |
|
| 161 |
sx << ber32 (facenum) |
| 162 |
<< ber32 (f->smooth) |
| 163 |
<< ber32 (f->smoothlevel); |
| 164 |
} |
| 165 |
} |
| 166 |
} |
| 167 |
} |
| 168 |
while (!fxface.empty () |
| 169 |
&& fx.room () > ber32::size + CHKSUM_MAXLEN + 1 + 3 /* type switch */ |
| 170 |
&& sx.room () > ber32::size * 3); |
| 171 |
|
| 172 |
send_packet (fx); |
| 173 |
if (sx.length () > 3) send_packet (sx); |
| 174 |
} |
| 175 |
} |
| 176 |
|
| 177 |
// send all faces of this object to the client |
| 178 |
// this uses more bandwidth initially, but makes |
| 179 |
// animations look much smoother, and every client |
| 180 |
// is supposed to do client-side caching anyways. |
| 181 |
void |
| 182 |
client::send_faces (object *ob) |
| 183 |
{ |
| 184 |
send_face (ob->face, 10); |
| 185 |
|
| 186 |
if (ob->animation_id) |
| 187 |
{ |
| 188 |
const animation &anim = ob->anim (); |
| 189 |
|
| 190 |
for (int i = 0; i < anim.num_animations; i++) |
| 191 |
send_face (anim.faces [i], -10); |
| 192 |
} |
| 193 |
} |
| 194 |
|
| 195 |
/** |
| 196 |
* Need to send an animation sequence to the client. |
| 197 |
* We will send appropriate face commands to the client if we haven't |
| 198 |
* sent them the face yet (this can become quite costly in terms of |
| 199 |
* how much we are sending - on the other hand, this should only happen |
| 200 |
* when the player logs in and picks stuff up. |
| 201 |
*/ |
| 202 |
void |
| 203 |
client::send_animation (short anim_num) |
| 204 |
{ |
| 205 |
/* Do some checking on the anim_num we got. Note that the animations |
| 206 |
* are added in contiguous order, so if the number is in the valid |
| 207 |
* range, it must be a valid animation. |
| 208 |
*/ |
| 209 |
if (anim_num < 0 || anim_num >= animations.size ()) |
| 210 |
{ |
| 211 |
LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); |
| 212 |
return; |
| 213 |
} |
| 214 |
|
| 215 |
packet sl ("anim"); |
| 216 |
|
| 217 |
sl << uint16 (anim_num) |
| 218 |
<< uint16 (0); /* flags - not used right now */ |
| 219 |
|
| 220 |
/* Build up the list of faces. Also, send any information (ie, the |
| 221 |
* the face itself) down to the client. |
| 222 |
*/ |
| 223 |
for (int i = 0; i < animations[anim_num].num_animations; i++) |
| 224 |
{ |
| 225 |
send_face (animations[anim_num].faces[i], -20); |
| 226 |
sl << uint16 (animations[anim_num].faces[i]); |
| 227 |
} |
| 228 |
|
| 229 |
send_packet (sl); |
| 230 |
|
| 231 |
anims_sent[anim_num] = 1; |
| 232 |
} |
| 233 |
|
| 234 |
void |
| 235 |
client::invalidate_face (faceidx idx) |
| 236 |
{ |
| 237 |
faces_sent [idx] = false; |
| 238 |
force_newmap = true; |
| 239 |
} |
| 240 |
|
| 241 |
void |
| 242 |
client::invalidate_all_faces () |
| 243 |
{ |
| 244 |
faces_sent.reset (); |
| 245 |
force_newmap = true; |
| 246 |
} |
| 247 |
|
