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.32 by root, Wed Mar 14 15:44:47 2007 UTC vs.
Revision 1.48 by root, Thu Jul 12 18:48:20 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 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{
203 ns->send_image (atoi (buf)); 258 ns->send_face (atoi (buf));
259 ns->flush_fx ();
204} 260}
205 261
206// how lame 262// how lame
207static void print_facename (packet &sl, const facedata &d) 263static void print_facename (packet &sl, const facedata &d)
208{ 264{
238 * 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.
239 */ 295 */
240void 296void
241client::send_face (faceidx facenum) 297client::send_face (faceidx facenum)
242{ 298{
243 if (!facecache)
244 {
245 send_drawinfo (
246 "*** Please enable face caching or use a client that supports it.\n",
247 NDI_RED
248 );
249 return send_image (facenum);
250 }
251
252 // never send face 0. ever. it does not exist. 299 // never send face 0. ever. it does not exist.
253 if (!facenum) 300 if (!facenum)
254 return; 301 return;
255 302
256 const facedata *d = face_data (facenum, faceset); 303 const facedata *d = face_data (facenum, faceset);
259 { 306 {
260 LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum); 307 LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum);
261 return; 308 return;
262 } 309 }
263 310
264 if (faces_sent[facenum]) 311 // refuse tos end non-image faces
312 if (d->type)
265 return; 313 return;
266 314
267 faces_sent[facenum] = true; 315 if (!must_send_face (facenum))
316 return;
317
318 // if for some reason we let a client without face caching connect,
319 // we better support that decision here and implement it.
320 if (!facecache)
321 return send_image (facenum);
322
323 if (fxix)
324 {
325 fxface.push_back (facenum);
326 return;
327 }
268 328
269 packet sl; 329 packet sl;
270 330
271 if (force_face0) 331 if (force_face0)
272 sl << "face " << uint16 (facenum); 332 sl << "face " << uint16 (facenum);
277 337
278 // how lame 338 // how lame
279 print_facename (sl, *d); 339 print_facename (sl, *d);
280 send_packet (sl); 340 send_packet (sl);
281 341
342 if (EMI_smooth)
343 {
282 faceinfo *f = face_info (facenum); 344 faceinfo *f = face_info (facenum);
283 if (f->smooth && EMI_smooth) 345
284 { 346 if (f->smooth)
347 {
285 send_face (f->smooth); 348 send_face (f->smooth);
286 349
287 packet sl ("smooth"); 350 packet sl ("smooth");
288 351
289 sl << uint16 (facenum) 352 sl << uint16 (facenum)
290 << uint16 (f->smooth); 353 << uint16 (f->smooth);
291 354
292 send_packet (sl); 355 send_packet (sl);
356 }
357 }
358}
359
360void client::flush_fx ()
361{
362 while (!fxface.empty ())
363 {
364 packet fx ("fx");
365 packet sx ("sx");
366
367 do
368 {
369 faceidx facenum = fxface.back (); fxface.pop_back ();
370
371 const facedata *d = face_data (facenum, faceset);
372
373 if (d)
374 {
375 fx << ber32 (facenum)
376 << data8 (d->chksum, CHKSUM_SIZE);
377
378 if (smoothing)
379 {
380 faceinfo *f = face_info (facenum);
381
382 if (f->smooth)
383 {
384 send_face (f->smooth);
385 sx << ber32 (facenum)
386 << ber32 (f->smooth)
387 << ber32 (f->smoothlevel);
388 }
389 }
390 }
391 }
392 while (!fxface.empty ()
393 && fx.room () > ber32::size + CHKSUM_SIZE + 1
394 && sx.room () > ber32::size * 3);
395
396 send_packet (fx);
397 if (sx.length () > 3) send_packet (sx);
293 } 398 }
294} 399}
295 400
296void 401void
297client::send_image (faceidx facenum) 402client::send_image (faceidx facenum)
300 if (!facenum) 405 if (!facenum)
301 return; 406 return;
302 407
303 const facedata *d = face_data (facenum, faceset); 408 const facedata *d = face_data (facenum, faceset);
304 409
410 faces_sent[facenum] = true;
411
305 if (!d) 412 if (!d)
306 { 413 {
307 LOG (llevError, "client::send_image (%d) out of bounds??\n", facenum); 414 LOG (llevError, "client::send_image (%d) out of bounds??\n", facenum);
308 return; 415 return;
309 } 416 }
417
418 //TODO: check type here?
419
420 if (force_image_newmap)
421 force_newmap = true;
310 422
311 packet sl; 423 packet sl;
312 424
313 sl << (image2 ? "image2 " : "image ") 425 sl << (image2 ? "image2 " : "image ")
314 << uint32 (facenum); 426 << uint32 (facenum);
352{ 464{
353 /* Do some checking on the anim_num we got. Note that the animations 465 /* Do some checking on the anim_num we got. Note that the animations
354 * are added in contigous order, so if the number is in the valid 466 * are added in contigous order, so if the number is in the valid
355 * range, it must be a valid animation. 467 * range, it must be a valid animation.
356 */ 468 */
357 if (anim_num < 0 || anim_num > num_animations) 469 if (anim_num < 0 || anim_num >= animations.size ())
358 { 470 {
359 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); 471 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
360 return; 472 return;
361 } 473 }
362 474

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines