1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | * Copyright (C) 2001 Mark Wedel |
5 | * Copyright (©) 2001,2007 Mark Wedel |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
9 | * it under the terms of the GNU General Public License as published by |
9 | * under the terms of the GNU General Public License as published by the Free |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
11 | * (at your option) any later version. |
11 | * 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, but |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
16 | * GNU General Public License for more details. |
16 | * 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 along |
19 | * along with this program; if not, write to the Free Software |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
21 | * |
21 | * |
22 | * The author can be reached via e-mail to <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | /** \file |
25 | /** \file |
26 | * Image related communication |
26 | * Image related communication |
27 | * |
27 | * |
… | |
… | |
191 | if (mask) |
191 | if (mask) |
192 | ns->facecache = 1; |
192 | ns->facecache = 1; |
193 | } |
193 | } |
194 | |
194 | |
195 | /** |
195 | /** |
196 | * Client has requested pixmap that it somehow missed getting. |
196 | * client requested an image. send it rate-limited |
197 | * This will be called often if the client is |
197 | * before flushing. |
198 | * caching images. |
|
|
199 | */ |
198 | */ |
200 | void |
199 | void |
201 | SendFaceCmd (char *buf, int len, client *ns) |
200 | AskFaceCmd (char *buf, int len, client *ns) |
202 | { |
201 | { |
|
|
202 | int idx = 0, pri = 0; |
|
|
203 | |
|
|
204 | sscanf (buf, "%d %d", &idx, &pri); |
|
|
205 | |
|
|
206 | const facedata *d = face_data (idx, ns->faceset); |
|
|
207 | |
|
|
208 | if (!d) |
|
|
209 | return; // doh |
|
|
210 | |
|
|
211 | client::ixsend ix; |
|
|
212 | |
|
|
213 | ix.pri = pri; |
|
|
214 | ix.idx = idx; |
|
|
215 | ix.ofs = d->data.size (); |
|
|
216 | |
|
|
217 | // the by far most common case will be to insert |
|
|
218 | // right at the end, so no looping. |
|
|
219 | auto (i, ns->ixface.end ()); |
|
|
220 | for (; i != ns->ixface.begin (); ) |
|
|
221 | if (pri >= (--i)->pri) |
|
|
222 | break; |
|
|
223 | |
|
|
224 | ns->ixface.insert (i, ix); |
|
|
225 | } |
|
|
226 | |
|
|
227 | /** |
|
|
228 | * Tells client the picture it has to use |
|
|
229 | * to smooth a picture number given as argument. |
|
|
230 | */ |
|
|
231 | void |
|
|
232 | AskSmooth (char *buf, int len, client *ns) |
|
|
233 | { |
203 | ns->send_face (atoi (buf), 1); |
234 | ns->send_face (atoi (buf)); |
|
|
235 | ns->flush_fx (); |
204 | } |
236 | } |
205 | |
237 | |
206 | // how lame |
238 | // how lame |
207 | static void print_facename (packet &sl, const facedata &d) |
239 | static void print_facename (packet &sl, const facedata &d) |
208 | { |
240 | { |
209 | for (int i = 0; i < CHKSUM_SIZE; ++i) |
241 | for (int i = 0; i < CHKSUM_SIZE; ++i) |
210 | sl.printf ("%02x", d.chksum [i]); |
242 | sl.printf ("%02x", d.chksum [i]); |
211 | } |
243 | } |
212 | |
244 | |
213 | // gcfclient uses the server-provided checksum for comparison, |
245 | // gcfclient uses the server-provided checksum for comparison, but always |
214 | // but always wrotes a broken checksum to its cache file, so we |
246 | // writes a broken checksum to its cache file, so we have to provide |
215 | // have to provide gcfclient with a useless checksum just to |
247 | // gcfclient with the same broken (and useless) checksum just to have it |
216 | // have to cache the image despite its bugs. |
248 | // cache the image despite its bugs. |
217 | static uint32 gcfclient_checksum (const facedata *d) |
249 | static uint32 gcfclient_checksum (const facedata *d) |
218 | { |
250 | { |
219 | uint32 csum = 0; |
251 | uint32 csum = 0; |
220 | |
252 | |
221 | for (std::string::const_iterator i = d->data.begin (); |
253 | for (std::string::const_iterator i = d->data.begin (); |
… | |
… | |
236 | * this is needed for the askface, in which we really do want to send the |
268 | * this is needed for the askface, in which we really do want to send the |
237 | * face (and askface is the only place that should be setting it). Otherwise, |
269 | * face (and askface is the only place that should be setting it). Otherwise, |
238 | * we look at the facecache, and if set, send the image name. |
270 | * we look at the facecache, and if set, send the image name. |
239 | */ |
271 | */ |
240 | void |
272 | void |
241 | client::send_face (faceidx facenum, bool forced) |
273 | client::send_face (faceidx facenum) |
242 | { |
274 | { |
243 | // never send face 0. ever. it does not exist. |
275 | // never send face 0. ever. it does not exist. |
244 | if (!facenum) |
276 | if (!facenum) |
245 | return; |
277 | return; |
246 | |
278 | |
… | |
… | |
250 | { |
282 | { |
251 | LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum); |
283 | LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum); |
252 | return; |
284 | return; |
253 | } |
285 | } |
254 | |
286 | |
|
|
287 | if (faces_sent[facenum]) |
|
|
288 | return; |
|
|
289 | |
|
|
290 | faces_sent[facenum] = true; |
|
|
291 | |
|
|
292 | // if for some reason we let a client without face caching connect, |
|
|
293 | // we better support that decision here and implement it. |
|
|
294 | if (!facecache) |
|
|
295 | return send_image (facenum); |
|
|
296 | |
|
|
297 | if (fxix) |
|
|
298 | { |
|
|
299 | fxface.push_back (facenum); |
|
|
300 | return; |
|
|
301 | } |
|
|
302 | |
255 | packet sl; |
303 | packet sl; |
256 | |
304 | |
257 | if (facecache && !forced) |
305 | if (force_face0) |
258 | { |
306 | sl << "face " << uint16 (facenum); |
259 | if (faces_sent[facenum]) |
307 | else if (image2) |
260 | return; |
308 | sl << "face2 " << uint16 (facenum) << uint8 (0) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0); |
|
|
309 | else |
|
|
310 | sl << "face1 " << uint16 (facenum) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0); |
261 | |
311 | |
262 | faces_sent[facenum] = true; |
312 | // how lame |
|
|
313 | print_facename (sl, *d); |
|
|
314 | send_packet (sl); |
263 | |
315 | |
|
|
316 | if (EMI_smooth) |
|
|
317 | { |
264 | faceinfo *f = face_info (facenum); |
318 | faceinfo *f = face_info (facenum); |
265 | if (f->smooth && EMI_smooth) |
319 | |
|
|
320 | if (f->smooth) |
266 | { |
321 | { |
267 | send_face (f->smooth); |
322 | send_face (f->smooth); |
268 | |
323 | |
269 | packet sl ("smooth"); |
324 | packet sl ("smooth"); |
270 | |
325 | |
271 | sl << uint16 (facenum) |
326 | sl << uint16 (facenum) |
272 | << uint16 (f->smooth); |
327 | << uint16 (f->smooth); |
273 | |
328 | |
274 | send_packet (sl); |
329 | send_packet (sl); |
275 | } |
330 | } |
276 | |
|
|
277 | if (force_face0) |
|
|
278 | sl << "face " << uint16 (facenum); |
|
|
279 | else if (image2) |
|
|
280 | sl << "face2 " << uint16 (facenum) << uint8 (0) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0); |
|
|
281 | else |
|
|
282 | sl << "face1 " << uint16 (facenum) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0); |
|
|
283 | |
|
|
284 | // how lame |
|
|
285 | print_facename (sl, *d); |
|
|
286 | } |
|
|
287 | else |
|
|
288 | { |
331 | } |
|
|
332 | } |
|
|
333 | |
|
|
334 | void client::flush_fx () |
|
|
335 | { |
|
|
336 | while (!fxface.empty ()) |
|
|
337 | { |
|
|
338 | packet fx ("fx"); |
|
|
339 | packet sx ("sx"); |
|
|
340 | |
|
|
341 | do |
|
|
342 | { |
|
|
343 | faceidx facenum = fxface.back (); fxface.pop_back (); |
|
|
344 | |
|
|
345 | const facedata *d = face_data (facenum, faceset); |
|
|
346 | |
|
|
347 | if (d) |
|
|
348 | { |
|
|
349 | fx << ber32 (facenum) |
|
|
350 | << data8 (d->chksum, CHKSUM_SIZE); |
|
|
351 | |
|
|
352 | if (smoothing) |
|
|
353 | { |
|
|
354 | faceinfo *f = face_info (facenum); |
|
|
355 | |
|
|
356 | if (f->smooth) |
|
|
357 | { |
|
|
358 | send_face (f->smooth); |
|
|
359 | sx << ber32 (facenum) |
|
|
360 | << ber32 (f->smooth) |
|
|
361 | << ber32 (f->smoothlevel); |
|
|
362 | } |
|
|
363 | } |
|
|
364 | } |
|
|
365 | } |
|
|
366 | while (!fxface.empty () |
|
|
367 | && fx.room () > ber32::size + CHKSUM_SIZE + 1 |
|
|
368 | && sx.room () > ber32::size * 3); |
|
|
369 | |
|
|
370 | send_packet (fx); |
|
|
371 | if (sx.length () > 3) send_packet (sx); |
|
|
372 | } |
|
|
373 | } |
|
|
374 | |
|
|
375 | void |
|
|
376 | client::send_image (faceidx facenum) |
|
|
377 | { |
|
|
378 | // never send face 0. ever. it does not exist. |
|
|
379 | if (!facenum) |
|
|
380 | return; |
|
|
381 | |
|
|
382 | const facedata *d = face_data (facenum, faceset); |
|
|
383 | |
|
|
384 | faces_sent[facenum] = true; |
|
|
385 | |
|
|
386 | if (!d) |
|
|
387 | { |
|
|
388 | LOG (llevError, "client::send_image (%d) out of bounds??\n", facenum); |
|
|
389 | return; |
|
|
390 | } |
|
|
391 | |
|
|
392 | //TODO: check type here? |
|
|
393 | |
|
|
394 | if (force_image_newmap) |
|
|
395 | force_newmap = true; |
|
|
396 | |
|
|
397 | packet sl; |
|
|
398 | |
289 | sl << (image2 ? "image2 " : "image ") |
399 | sl << (image2 ? "image2 " : "image ") |
290 | << uint32 (facenum); |
400 | << uint32 (facenum); |
291 | |
401 | |
292 | if (image2) |
402 | if (image2) |
293 | sl << uint8 (0); |
403 | sl << uint8 (0); |
294 | |
404 | |
295 | sl << uint32 (d->data.size ()) |
405 | sl << uint32 (d->data.size ()) |
296 | << data (d->data.data (), d->data.size ()); |
406 | << data (d->data.data (), d->data.size ()); |
297 | } |
|
|
298 | |
407 | |
299 | send_packet (sl); |
408 | send_packet (sl); |
300 | } |
409 | } |
301 | |
410 | |
302 | // send all faces of this object to the client |
411 | // send all faces of this object to the client |
… | |
… | |
329 | { |
438 | { |
330 | /* Do some checking on the anim_num we got. Note that the animations |
439 | /* Do some checking on the anim_num we got. Note that the animations |
331 | * are added in contigous order, so if the number is in the valid |
440 | * are added in contigous order, so if the number is in the valid |
332 | * range, it must be a valid animation. |
441 | * range, it must be a valid animation. |
333 | */ |
442 | */ |
334 | if (anim_num < 0 || anim_num > num_animations) |
443 | if (anim_num < 0 || anim_num >= animations.size ()) |
335 | { |
444 | { |
336 | LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); |
445 | LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); |
337 | return; |
446 | return; |
338 | } |
447 | } |
339 | |
448 | |