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.25 by root, Sun Mar 11 20:25:37 2007 UTC vs.
Revision 1.47 by root, Thu Jul 12 08:40:14 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 auto (pos, ns->ixface.end ());
217
218 if (ns->fxix < 2)
219 {
220 // gcfclient does not support prioritising, older cfplus versions
221 // do not support interleaved transfers.
222 if (!ns->ixface.empty ())
223 pos = ns->ixface.end () - 1;
224 }
225 else
226 {
227 // the by far most common case will be to insert
228 // near the end, so little looping.
229 while (pos != ns->ixface.begin ())
230 {
231 --pos;
232
233 // sort within 2k bins, to slightly prefer smaller images
234 if (pri > pos->pri || (pri == pos->pri && (ix.ofs >> 11) <= (pos->ofs >> 11)))
235 {
236 ++pos;
237 break;
238 }
239 }
240 }
241
242 ns->ixface.insert (pos, ix);
243
244#if 0
245 for (auto (i, ns->ixface.begin ()); i != ns->ixface.end (); ++i)
246 fprintf (stderr, "<%d,%d> ", i->pri, i->ofs);
247 fprintf (stderr, "\n");
248#endif
249}
250
251/**
252 * Tells client the picture it has to use
253 * to smooth a picture number given as argument.
254 */
255void
256AskSmooth (char *buf, int len, client *ns)
257{
258 ns->send_face (atoi (buf));
259 ns->flush_fx ();
207} 260}
208 261
209// how lame 262// how lame
210static void print_facename (packet &sl, const facedata &d) 263static void print_facename (packet &sl, const facedata &d)
211{ 264{
212 for (int i = 0; i < CHKSUM_SIZE; ++i) 265 for (int i = 0; i < CHKSUM_SIZE; ++i)
213 sl.printf ("%02x", d.chksum [i]); 266 sl.printf ("%02x", d.chksum [i]);
267}
268
269// gcfclient uses the server-provided checksum for comparison, but always
270// writes a broken checksum to its cache file, so we have to provide
271// gcfclient with the same broken (and useless) checksum just to have it
272// cache the image despite its bugs.
273static uint32 gcfclient_checksum (const facedata *d)
274{
275 uint32 csum = 0;
276
277 for (std::string::const_iterator i = d->data.begin ();
278 i != d->data.end ();
279 ++i)
280 {
281 csum = rotate_right (csum);
282 csum += *(uint8 *)&*i;
283 }
284
285 return csum;
214} 286}
215 287
216/** 288/**
217 * Sends a face to a client if they are in pixmap mode 289 * Sends a face to a client if they are in pixmap mode
218 * nothing gets sent in bitmap mode. 290 * nothing gets sent in bitmap mode.
… …
220 * this is needed for the askface, in which we really do want to send the 292 * this is needed for the askface, in which we really do want to send the
221 * face (and askface is the only place that should be setting it). Otherwise, 293 * face (and askface is the only place that should be setting it). Otherwise,
222 * we look at the facecache, and if set, send the image name. 294 * we look at the facecache, and if set, send the image name.
223 */ 295 */
224void 296void
225esrv_send_face (client *ns, short face_num, int nocache) 297client::send_face (faceidx facenum)
226{ 298{
227 if (face_num <= 0 || face_num >= faces.size ()) 299 // never send face 0. ever. it does not exist.
300 if (!facenum)
301 return;
302
303 const facedata *d = face_data (facenum, faceset);
304
305 if (!d)
228 { 306 {
229 LOG (llevError, "esrv_send_face (%d) out of bounds??\n", face_num); 307 LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum);
230 return; 308 return;
231 } 309 }
232 310
233 const facedata *d = face_data (face_num, ns->faceset); 311 if (!must_send_face (facenum))
312 return;
313
314 // if for some reason we let a client without face caching connect,
315 // we better support that decision here and implement it.
316 if (!facecache)
317 return send_image (facenum);
318
319 if (fxix)
320 {
321 fxface.push_back (facenum);
322 return;
323 }
234 324
235 packet sl; 325 packet sl;
236 326
237 if (ns->facecache && !nocache) 327 if (force_face0)
238 { 328 sl << "face " << uint16 (facenum);
239 sl << (ns->image2 ? "face2 " : "face1 ") 329 else if (image2)
240 << uint16 (face_num); 330 sl << "face2 " << uint16 (facenum) << uint8 (0) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0);
241
242 if (ns->image2)
243 sl << uint8 (0);
244
245 sl << uint32 (0);
246
247 // how lame
248 print_facename (sl, *d);
249
250 ns->send_packet (sl);
251 }
252 else 331 else
332 sl << "face1 " << uint16 (facenum) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0);
333
334 // how lame
335 print_facename (sl, *d);
336 send_packet (sl);
337
338 if (EMI_smooth)
339 {
340 faceinfo *f = face_info (facenum);
341
342 if (f->smooth)
343 {
344 send_face (f->smooth);
345
346 packet sl ("smooth");
347
348 sl << uint16 (facenum)
349 << uint16 (f->smooth);
350
351 send_packet (sl);
352 }
253 { 353 }
354}
355
356void client::flush_fx ()
357{
358 while (!fxface.empty ())
359 {
360 packet fx ("fx");
361 packet sx ("sx");
362
363 do
364 {
365 faceidx facenum = fxface.back (); fxface.pop_back ();
366
367 const facedata *d = face_data (facenum, faceset);
368
369 if (d)
370 {
371 fx << ber32 (facenum)
372 << data8 (d->chksum, CHKSUM_SIZE);
373
374 if (smoothing)
375 {
376 faceinfo *f = face_info (facenum);
377
378 if (f->smooth)
379 {
380 send_face (f->smooth);
381 sx << ber32 (facenum)
382 << ber32 (f->smooth)
383 << ber32 (f->smoothlevel);
384 }
385 }
386 }
387 }
388 while (!fxface.empty ()
389 && fx.room () > ber32::size + CHKSUM_SIZE + 1
390 && sx.room () > ber32::size * 3);
391
392 send_packet (fx);
393 if (sx.length () > 3) send_packet (sx);
394 }
395}
396
397void
398client::send_image (faceidx facenum)
399{
400 // never send face 0. ever. it does not exist.
401 if (!facenum)
402 return;
403
404 const facedata *d = face_data (facenum, faceset);
405
406 faces_sent[facenum] = true;
407
408 if (!d)
409 {
410 LOG (llevError, "client::send_image (%d) out of bounds??\n", facenum);
411 return;
412 }
413
414 //TODO: check type here?
415
416 if (force_image_newmap)
417 force_newmap = true;
418
419 packet sl;
420
254 sl << (ns->image2 ? "image2 " : "image ") 421 sl << (image2 ? "image2 " : "image ")
255 << uint32 (face_num); 422 << uint32 (facenum);
256 423
257 if (ns->image2) 424 if (image2)
258 sl << uint8 (0); 425 sl << uint8 (0);
259 426
260 sl << uint32 (d->data.size ()) 427 sl << uint32 (d->data.size ())
261 << data (d->data.data (), d->data.size ()); 428 << data (d->data.data (), d->data.size ());
262 429
263 ns->send_packet (sl); 430 send_packet (sl);
431}
432
433// send all faces of this object to the client
434// this uses more bandwidth initially, but makes
435// animations look much smoother, and every client
436// is supposed to do client-side caching anyways.
437void
438client::send_faces (object *ob)
439{
440 send_face (ob->face);
441
442 if (ob->animation_id)
264 } 443 {
444 animation &anim = animations [ob->animation_id];
265 445
266 ns->faces_sent[face_num] |= NS_FACESENT_FACE; 446 for (int i = 0; i < anim.num_animations; i++)
447 send_face (anim.faces [i]);
448 }
449}
450
451/**
452 * Need to send an animation sequence to the client.
453 * We will send appropriate face commands to the client if we haven't
454 * sent them the face yet (this can become quite costly in terms of
455 * how much we are sending - on the other hand, this should only happen
456 * when the player logs in and picks stuff up.
457 */
458void
459client::send_animation (short anim_num)
460{
461 /* Do some checking on the anim_num we got. Note that the animations
462 * are added in contigous order, so if the number is in the valid
463 * range, it must be a valid animation.
464 */
465 if (anim_num < 0 || anim_num >= animations.size ())
466 {
467 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
468 return;
469 }
470
471 packet sl ("anim");
472
473 sl << uint16 (anim_num)
474 << uint16 (0); /* flags - not used right now */
475
476 /* Build up the list of faces. Also, send any information (ie, the
477 * the face itself) down to the client.
478 */
479 for (int i = 0; i < animations[anim_num].num_animations; i++)
480 {
481 send_face (animations[anim_num].faces[i]);
482 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
483 }
484
485 send_packet (sl);
486
487 anims_sent[anim_num] = 1;
267} 488}
268 489
269/** 490/**
270 * Sends the number of images, checksum of the face file, 491 * Sends the number of images, checksum of the face file,
271 * and the image_info file information. See the doc/Developers/protocol 492 * and the image_info file information. See the doc/Developers/protocol
272 * if you want further detail. 493 * if you want further detail.
273 */ 494 */
274
275void 495void
276send_image_info (client *ns, char *params) 496send_image_info (client *ns, char *params)
277{ 497{
278 packet sl; 498 packet sl;
279 499
… …
318 538
319 sl.printf ("replyinfo image_sums %d %d ", start, stop); 539 sl.printf ("replyinfo image_sums %d %d ", start, stop);
320 540
321 for (int i = start; i <= stop && i < faces.size (); i++) 541 for (int i = start; i <= stop && i < faces.size (); i++)
322 { 542 {
323 ns->faces_sent[i] |= NS_FACESENT_FACE; 543 ns->faces_sent[i] = true;
324 544
325 const facedata *d = face_data (i, ns->faceset); 545 const facedata *d = face_data (i, ns->faceset);
326 546
327 if (sl.room () < 2 + 4 + 1 + d->data.size () + 1) 547 if (sl.room () < 2 + 4 + 1 + d->data.size () + 1)
328 break; 548 break;

Diff Legend

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