ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/image.C
(Generate patch)

Comparing deliantra/server/socket/image.C (file contents):
Revision 1.29 by root, Wed Mar 14 00:07:26 2007 UTC vs.
Revision 1.45 by root, Thu Jul 5 10:34:08 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
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
9 * it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version. 11 * (at your option) 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,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License 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
19 * along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The author can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 22 */
24 23
25/** \file 24/** \file
26 * Image related communication 25 * Image related communication
27 * 26 *
191 if (mask) 190 if (mask)
192 ns->facecache = 1; 191 ns->facecache = 1;
193} 192}
194 193
195/** 194/**
196 * Client has requested pixmap that it somehow missed getting. 195 * client requested an image. send it rate-limited
197 * This will be called often if the client is 196 * before flushing.
198 * caching images.
199 */ 197 */
200void 198void
201SendFaceCmd (char *buf, int len, client *ns) 199AskFaceCmd (char *buf, int len, client *ns)
202{ 200{
201 int idx = 0, pri = 0;
202
203 sscanf (buf, "%d %d", &idx, &pri);
204
205 const facedata *d = face_data (idx, ns->faceset);
206
207 if (!d)
208 return; // doh
209
210 client::ixsend ix;
211
212 ix.pri = pri;
213 ix.idx = idx;
214 ix.ofs = d->data.size ();
215
216 // this is (hopefully) a temporary fix around older cfplus versions not
217 // supporting interleaved transfers
218 ns->ixface.insert (ns->ixface.begin (), ix);
219
220#if 0
221 // the by far most common case will be to insert
222 // right at the end, so no looping.
223 auto (i, ns->ixface.end ());
224 for (; i != ns->ixface.begin (); )
225 if (pri >= (--i)->pri)
226 break;
227
228 ns->ixface.insert (i, ix);
229#endif
230}
231
232/**
233 * Tells client the picture it has to use
234 * to smooth a picture number given as argument.
235 */
236void
237AskSmooth (char *buf, int len, client *ns)
238{
203 ns->send_face (atoi (buf), 1); 239 ns->send_face (atoi (buf));
240 ns->flush_fx ();
204} 241}
205 242
206// how lame 243// how lame
207static void print_facename (packet &sl, const facedata &d) 244static void print_facename (packet &sl, const facedata &d)
208{ 245{
209 for (int i = 0; i < CHKSUM_SIZE; ++i) 246 for (int i = 0; i < CHKSUM_SIZE; ++i)
210 sl.printf ("%02x", d.chksum [i]); 247 sl.printf ("%02x", d.chksum [i]);
211} 248}
212 249
213// gcfclient uses the server-provided checksum for comparison, 250// gcfclient uses the server-provided checksum for comparison, but always
214// but always wrotes a broken checksum to its cache file, so we 251// writes a broken checksum to its cache file, so we have to provide
215// have to provide gcfclient with a useless checksum just to 252// gcfclient with the same broken (and useless) checksum just to have it
216// have to cache the image despite its bugs. 253// cache the image despite its bugs.
217static uint32 gcfclient_checksum (const facedata *d) 254static uint32 gcfclient_checksum (const facedata *d)
218{ 255{
219 uint32 csum = 0; 256 uint32 csum = 0;
220 257
221 for (std::string::const_iterator i = d->data.begin (); 258 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 273 * 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, 274 * 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. 275 * we look at the facecache, and if set, send the image name.
239 */ 276 */
240void 277void
241client::send_face (faceidx facenum, bool forced) 278client::send_face (faceidx facenum)
242{ 279{
243 // never send face 0. ever. it does not exist. 280 // never send face 0. ever. it does not exist.
244 if (!facenum) 281 if (!facenum)
245 return; 282 return;
246 283
250 { 287 {
251 LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum); 288 LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum);
252 return; 289 return;
253 } 290 }
254 291
292 if (faces_sent[facenum])
293 return;
294
295 faces_sent[facenum] = true;
296
297 // if for some reason we let a client without face caching connect,
298 // we better support that decision here and implement it.
299 if (!facecache)
300 return send_image (facenum);
301
302 if (fxix)
303 {
304 fxface.push_back (facenum);
305 return;
306 }
307
255 packet sl; 308 packet sl;
256 309
257 if (facecache && !forced)
258 {
259 if (faces_sent[facenum] & NS_FACESENT_FACE)
260 return;
261
262 faces_sent[facenum] |= NS_FACESENT_FACE;
263
264 if (force_face0) 310 if (force_face0)
265 sl << "face " << uint16 (facenum); 311 sl << "face " << uint16 (facenum);
266 else if (image2) 312 else if (image2)
267 sl << "face2 " << uint16 (facenum) << uint8 (0) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0); 313 sl << "face2 " << uint16 (facenum) << uint8 (0) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0);
268 else
269 sl << "face1 " << uint16 (facenum) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0);
270
271 // how lame
272 print_facename (sl, *d);
273 }
274 else 314 else
315 sl << "face1 " << uint16 (facenum) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0);
316
317 // how lame
318 print_facename (sl, *d);
319 send_packet (sl);
320
321 if (EMI_smooth)
322 {
323 faceinfo *f = face_info (facenum);
324
325 if (f->smooth)
326 {
327 send_face (f->smooth);
328
329 packet sl ("smooth");
330
331 sl << uint16 (facenum)
332 << uint16 (f->smooth);
333
334 send_packet (sl);
335 }
275 { 336 }
337}
338
339void client::flush_fx ()
340{
341 while (!fxface.empty ())
342 {
343 packet fx ("fx");
344 packet sx ("sx");
345
346 do
347 {
348 faceidx facenum = fxface.back (); fxface.pop_back ();
349
350 const facedata *d = face_data (facenum, faceset);
351
352 if (d)
353 {
354 fx << ber32 (facenum)
355 << data8 (d->chksum, CHKSUM_SIZE);
356
357 if (smoothing)
358 {
359 faceinfo *f = face_info (facenum);
360
361 if (f->smooth)
362 {
363 send_face (f->smooth);
364 sx << ber32 (facenum)
365 << ber32 (f->smooth)
366 << ber32 (f->smoothlevel);
367 }
368 }
369 }
370 }
371 while (!fxface.empty ()
372 && fx.room () > ber32::size + CHKSUM_SIZE + 1
373 && sx.room () > ber32::size * 3);
374
375 send_packet (fx);
376 if (sx.length () > 3) send_packet (sx);
377 }
378}
379
380void
381client::send_image (faceidx facenum)
382{
383 // never send face 0. ever. it does not exist.
384 if (!facenum)
385 return;
386
387 const facedata *d = face_data (facenum, faceset);
388
389 faces_sent[facenum] = true;
390
391 if (!d)
392 {
393 LOG (llevError, "client::send_image (%d) out of bounds??\n", facenum);
394 return;
395 }
396
397 //TODO: check type here?
398
399 if (force_image_newmap)
400 force_newmap = true;
401
402 packet sl;
403
276 sl << (image2 ? "image2 " : "image ") 404 sl << (image2 ? "image2 " : "image ")
277 << uint32 (facenum); 405 << uint32 (facenum);
278 406
279 if (image2) 407 if (image2)
280 sl << uint8 (0); 408 sl << uint8 (0);
281 409
282 sl << uint32 (d->data.size ()) 410 sl << uint32 (d->data.size ())
283 << data (d->data.data (), d->data.size ()); 411 << data (d->data.data (), d->data.size ());
284 }
285 412
286 send_packet (sl); 413 send_packet (sl);
287} 414}
288 415
289// send all faces of this object to the client 416// send all faces of this object to the client
300 animation &anim = animations [ob->animation_id]; 427 animation &anim = animations [ob->animation_id];
301 428
302 for (int i = 0; i < anim.num_animations; i++) 429 for (int i = 0; i < anim.num_animations; i++)
303 send_face (anim.faces [i]); 430 send_face (anim.faces [i]);
304 } 431 }
305}
306
307/**
308 * A lot like the old AskSmooth (in fact, now called by AskSmooth).
309 * Basically, it makes no sense to wait for the client to request a
310 * a piece of data from us that we know the client wants. So
311 * if we know the client wants it, might as well push it to the
312 * client.
313 */
314void
315client::send_smooth (faceidx face)
316{
317 faceinfo *f = face_info (face);
318
319 if (!f)
320 return;
321
322 if (faces_sent[face] & NS_FACESENT_SMOOTH)
323 return;
324
325 faces_sent[face] |= NS_FACESENT_SMOOTH;
326
327 /* If we can't find a face, return and set it so we won't try to send this
328 * again.
329 */
330 if (!f->smooth)
331 {
332 LOG (llevError, "could not findsmooth for %d.\n", face);
333 return;
334 }
335
336 send_face (f->smooth);
337
338 packet sl ("smooth");
339
340 sl << uint16 (face)
341 << uint16 (f->smooth);
342
343 send_packet (sl);
344} 432}
345 433
346/** 434/**
347 * Need to send an animation sequence to the client. 435 * Need to send an animation sequence to the client.
348 * We will send appropriate face commands to the client if we haven't 436 * We will send appropriate face commands to the client if we haven't
355{ 443{
356 /* Do some checking on the anim_num we got. Note that the animations 444 /* Do some checking on the anim_num we got. Note that the animations
357 * are added in contigous order, so if the number is in the valid 445 * are added in contigous order, so if the number is in the valid
358 * range, it must be a valid animation. 446 * range, it must be a valid animation.
359 */ 447 */
360 if (anim_num < 0 || anim_num > num_animations) 448 if (anim_num < 0 || anim_num >= animations.size ())
361 { 449 {
362 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); 450 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
363 return; 451 return;
364 } 452 }
365 453
433 521
434 sl.printf ("replyinfo image_sums %d %d ", start, stop); 522 sl.printf ("replyinfo image_sums %d %d ", start, stop);
435 523
436 for (int i = start; i <= stop && i < faces.size (); i++) 524 for (int i = start; i <= stop && i < faces.size (); i++)
437 { 525 {
438 ns->faces_sent[i] |= NS_FACESENT_FACE; 526 ns->faces_sent[i] = true;
439 527
440 const facedata *d = face_data (i, ns->faceset); 528 const facedata *d = face_data (i, ns->faceset);
441 529
442 if (sl.room () < 2 + 4 + 1 + d->data.size () + 1) 530 if (sl.room () < 2 + 4 + 1 + d->data.size () + 1)
443 break; 531 break;

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines