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.27 by root, Mon Mar 12 23:45:37 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{
203 uint16 facenum = atoi (buf); 201 int idx = 0, pri = 0;
204 202
205 if (facenum != 0) 203 sscanf (buf, "%d %d", &idx, &pri);
206 esrv_send_face (ns, facenum, 1); 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{
239 ns->send_face (atoi (buf));
240 ns->flush_fx ();
207} 241}
208 242
209// how lame 243// how lame
210static void print_facename (packet &sl, const facedata &d) 244static void print_facename (packet &sl, const facedata &d)
211{ 245{
212 for (int i = 0; i < CHKSUM_SIZE; ++i) 246 for (int i = 0; i < CHKSUM_SIZE; ++i)
213 sl.printf ("%02x", d.chksum [i]); 247 sl.printf ("%02x", d.chksum [i]);
214} 248}
215 249
216// gcfclient uses the server-provided checksum for comparison, 250// gcfclient uses the server-provided checksum for comparison, but always
217// 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
218// have to provide gcfclient with a useless checksum just to 252// gcfclient with the same broken (and useless) checksum just to have it
219// have to cache the image despite its bugs. 253// cache the image despite its bugs.
220static uint32 gcfclient_checksum (const facedata *d) 254static uint32 gcfclient_checksum (const facedata *d)
221{ 255{
222 uint32 csum = 0; 256 uint32 csum = 0;
223 257
224 for (std::string::const_iterator i = d->data.begin (); 258 for (std::string::const_iterator i = d->data.begin ();
… …
239 * 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
240 * 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,
241 * 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.
242 */ 276 */
243void 277void
244esrv_send_face (client *ns, short face_num, int nocache) 278client::send_face (faceidx facenum)
245{ 279{
246 if (face_num <= 0 || face_num >= faces.size ()) 280 // never send face 0. ever. it does not exist.
281 if (!facenum)
282 return;
283
284 const facedata *d = face_data (facenum, faceset);
285
286 if (!d)
247 { 287 {
248 LOG (llevError, "esrv_send_face (%d) out of bounds??\n", face_num); 288 LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum);
249 return; 289 return;
250 } 290 }
251 291
252 const facedata *d = face_data (face_num, ns->faceset); 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 }
253 307
254 packet sl; 308 packet sl;
255 309
256 if (ns->facecache && !nocache)
257 {
258 if (ns->force_face0) 310 if (force_face0)
259 sl << "face " << uint16 (face_num); 311 sl << "face " << uint16 (facenum);
260 else if (ns->image2) 312 else if (image2)
261 sl << "face2 " << uint16 (face_num) << uint8 (0) << uint32 (ns->force_bad_checksum ? gcfclient_checksum (d) : 0); 313 sl << "face2 " << uint16 (facenum) << uint8 (0) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0);
262 else
263 sl << "face1 " << uint16 (face_num) << uint32 (ns->force_bad_checksum ? gcfclient_checksum (d) : 0);
264
265 // how lame
266 print_facename (sl, *d);
267
268 ns->send_packet (sl);
269 }
270 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 }
271 { 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
272 sl << (ns->image2 ? "image2 " : "image ") 404 sl << (image2 ? "image2 " : "image ")
273 << uint32 (face_num); 405 << uint32 (facenum);
274 406
275 if (ns->image2) 407 if (image2)
276 sl << uint8 (0); 408 sl << uint8 (0);
277 409
278 sl << uint32 (d->data.size ()) 410 sl << uint32 (d->data.size ())
279 << data (d->data.data (), d->data.size ()); 411 << data (d->data.data (), d->data.size ());
280 412
281 ns->send_packet (sl); 413 send_packet (sl);
414}
415
416// send all faces of this object to the client
417// this uses more bandwidth initially, but makes
418// animations look much smoother, and every client
419// is supposed to do client-side caching anyways.
420void
421client::send_faces (object *ob)
422{
423 send_face (ob->face);
424
425 if (ob->animation_id)
282 } 426 {
427 animation &anim = animations [ob->animation_id];
283 428
284 ns->faces_sent[face_num] |= NS_FACESENT_FACE; 429 for (int i = 0; i < anim.num_animations; i++)
430 send_face (anim.faces [i]);
431 }
432}
433
434/**
435 * Need to send an animation sequence to the client.
436 * We will send appropriate face commands to the client if we haven't
437 * sent them the face yet (this can become quite costly in terms of
438 * how much we are sending - on the other hand, this should only happen
439 * when the player logs in and picks stuff up.
440 */
441void
442client::send_animation (short anim_num)
443{
444 /* Do some checking on the anim_num we got. Note that the animations
445 * are added in contigous order, so if the number is in the valid
446 * range, it must be a valid animation.
447 */
448 if (anim_num < 0 || anim_num >= animations.size ())
449 {
450 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
451 return;
452 }
453
454 packet sl ("anim");
455
456 sl << uint16 (anim_num)
457 << uint16 (0); /* flags - not used right now */
458
459 /* Build up the list of faces. Also, send any information (ie, the
460 * the face itself) down to the client.
461 */
462 for (int i = 0; i < animations[anim_num].num_animations; i++)
463 {
464 send_face (animations[anim_num].faces[i]);
465 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
466 }
467
468 send_packet (sl);
469
470 anims_sent[anim_num] = 1;
285} 471}
286 472
287/** 473/**
288 * Sends the number of images, checksum of the face file, 474 * Sends the number of images, checksum of the face file,
289 * and the image_info file information. See the doc/Developers/protocol 475 * and the image_info file information. See the doc/Developers/protocol
290 * if you want further detail. 476 * if you want further detail.
291 */ 477 */
292
293void 478void
294send_image_info (client *ns, char *params) 479send_image_info (client *ns, char *params)
295{ 480{
296 packet sl; 481 packet sl;
297 482
… …
336 521
337 sl.printf ("replyinfo image_sums %d %d ", start, stop); 522 sl.printf ("replyinfo image_sums %d %d ", start, stop);
338 523
339 for (int i = start; i <= stop && i < faces.size (); i++) 524 for (int i = start; i <= stop && i < faces.size (); i++)
340 { 525 {
341 ns->faces_sent[i] |= NS_FACESENT_FACE; 526 ns->faces_sent[i] = true;
342 527
343 const facedata *d = face_data (i, ns->faceset); 528 const facedata *d = face_data (i, ns->faceset);
344 529
345 if (sl.room () < 2 + 4 + 1 + d->data.size () + 1) 530 if (sl.room () < 2 + 4 + 1 + d->data.size () + 1)
346 break; 531 break;

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines