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.47 by root, Thu Jul 12 08:40:14 2007 UTC vs.
Revision 1.58 by root, Sat Dec 27 01:25:00 2008 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001,2007 Mark Wedel 5 * Copyright (©) 2001,2007 Mark Wedel
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software: you can redistribute it and/or modify 8 * Deliantra 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 3 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,
… …
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, see <http://www.gnu.org/licenses/>. 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * 20 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 22 */
23 23
24/** \file 24/** \file
25 * Image related communication 25 * Image related communication
26 * 26 *
… …
35#include <global.h> 35#include <global.h>
36#include <sproto.h> 36#include <sproto.h>
37 37
38#include "crc.h" 38#include "crc.h"
39 39
40#define MAX_FACE_SETS 20 /**< Maximum number of image sets the program will handle */
41
42/** Information about one image */
43typedef struct FaceInfo
44{
45 uint8 *data; /**< image data */
46 uint16 datalen; /**< length of the xpm data */
47 uint32 checksum; /**< Checksum of face data */
48} FaceInfo;
49
50/** Information about one face set */
51typedef struct
52{
53 char *prefix; /**< */
54 char *fullname;
55
56 uint8 fallback; /**< faceset to use when an image is not found in this faceset */
57 char *size;
58 char *extension;
59 char *comment;
60
61 FaceInfo *faces; /**< images in this faceset */
62} FaceSets;
63
64static FaceSets facesets[MAX_FACE_SETS]; /**< All facesets */
65
66/**
67 * Checks specified faceset is valid
68 * \param fsn faceset number
69 */
70int
71is_valid_faceset (int fsn)
72{
73 if (fsn >= 0 && fsn < MAX_FACE_SETS && facesets[fsn].prefix)
74 return TRUE;
75 return FALSE;
76}
77
78/**
79 * Frees all faceset information
80 */
81void
82free_socket_images (void)
83{
84 int num, q;
85
86 for (num = 0; num < MAX_FACE_SETS; num++)
87 {
88 if (facesets[num].prefix)
89 {
90 for (q = 0; q < faces.size (); q++)
91 if (facesets[num].faces[q].data)
92 free (facesets[num].faces[q].data);
93
94 free (facesets[num].prefix);
95 free (facesets[num].fullname);
96 free (facesets[num].size);
97 free (facesets[num].extension);
98 free (facesets[num].comment);
99 free (facesets[num].faces);
100 }
101 }
102}
103
104/**
105 * This returns the set we will actually use when sending
106 * a face. This is used because the image files may be sparse.
107 * This function is recursive. imageno is the face number we are
108 * trying to send
109 *
110 * If face is not found in specified faceset, tries with 'fallback' faceset.
111 *
112 * \param faceset faceset to check
113 * \param imageno image number
114 *
115 */
116static int
117get_face_fallback (int faceset, int imageno)
118{
119 /* faceset 0 is supposed to have every image, so just return. Doing
120 * so also prevents infinite loops in the case if it not having
121 * the face, but in that case, we are likely to crash when we try
122 * to access the data, but that is probably preferable to an infinite
123 * loop.
124 */
125 if (faceset == 0)
126 return 0;
127
128 if (!facesets[faceset].prefix)
129 {
130 LOG (llevError, "get_face_fallback called with unused set (%d)?\n", faceset);
131 return 0; /* use default set */
132 }
133
134 if (facesets[faceset].faces[imageno].data)
135 return faceset;
136
137 return get_face_fallback (facesets[faceset].fallback, imageno);
138}
139
140/**
141 * Checks fallback are correctly defined.
142 * This is a simple recursive function that makes sure the fallbacks
143 * are all proper (eg, the fall back to defined sets, and also
144 * eventually fall back to 0). At the top level, togo is set to MAX_FACE_SETS,
145 * if togo gets to zero, it means we have a loop.
146 * This is only run when we first load the facesets.
147 */
148static void
149check_faceset_fallback (int faceset, int togo)
150{
151 int fallback = facesets[faceset].fallback;
152
153 /* proper case - falls back to base set */
154 if (fallback == 0)
155 return;
156
157 if (!facesets[fallback].prefix)
158 {
159 LOG (llevError, "Face set %d falls to non set faceset %d\n", faceset, fallback);
160 abort ();
161 }
162
163 togo--;
164 if (togo == 0)
165 {
166 LOG (llevError, "Infinite loop found in facesets. aborting.\n");
167 abort ();
168 }
169
170 check_faceset_fallback (fallback, togo);
171}
172
173#define MAX_IMAGE_SIZE 10000 40#define MAX_IMAGE_SIZE 10000
174
175/**
176 * Client tells us what type of faces it wants. Also sets
177 * the caching attribute.
178 *
179 */
180void
181SetFaceMode (char *buf, int len, client *ns)
182{
183 int mask = (atoi (buf) & CF_FACE_CACHE), mode = (atoi (buf) & ~CF_FACE_CACHE);
184
185 if (mode == CF_FACE_NONE)
186 ns->facecache = 1;
187 else if (mode != CF_FACE_PNG)
188 ns->send_packet_printf ("drawinfo %d %s", NDI_RED, "Warning - send unsupported face mode. Will use Png");
189
190 if (mask)
191 ns->facecache = 1;
192}
193 41
194/** 42/**
195 * client requested an image. send it rate-limited 43 * client requested an image. send it rate-limited
196 * before flushing. 44 * before flushing.
197 */ 45 */
… …
199AskFaceCmd (char *buf, int len, client *ns) 47AskFaceCmd (char *buf, int len, client *ns)
200{ 48{
201 int idx = 0, pri = 0; 49 int idx = 0, pri = 0;
202 50
203 sscanf (buf, "%d %d", &idx, &pri); 51 sscanf (buf, "%d %d", &idx, &pri);
52
53 //TODO: somehow fetch default priority from send_fx here
204 54
205 const facedata *d = face_data (idx, ns->faceset); 55 const facedata *d = face_data (idx, ns->faceset);
206 56
207 if (!d) 57 if (!d)
208 return; // doh 58 return; // doh
… …
213 ix.idx = idx; 63 ix.idx = idx;
214 ix.ofs = d->data.size (); 64 ix.ofs = d->data.size ();
215 65
216 auto (pos, ns->ixface.end ()); 66 auto (pos, ns->ixface.end ());
217 67
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 68 // the by far most common case will be to insert
228 // near the end, so little looping. 69 // near the end, so little looping.
229 while (pos != ns->ixface.begin ()) 70 while (pos != ns->ixface.begin ())
71 {
72 --pos;
73
74 // sort within 2k bins, to slightly prefer smaller images
75 if (pri > pos->pri || (pri == pos->pri && (ix.ofs >> 11) <= (pos->ofs >> 11)))
230 { 76 {
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; 77 ++pos;
237 break; 78 break;
238 }
239 } 79 }
240 } 80 }
241 81
242 ns->ixface.insert (pos, ix); 82 ns->ixface.insert (pos, ix);
243 83
244#if 0 84#if 0
245 for (auto (i, ns->ixface.begin ()); i != ns->ixface.end (); ++i) 85 for (auto (i, ns->ixface.begin ()); i != ns->ixface.end (); ++i)
246 fprintf (stderr, "<%d,%d> ", i->pri, i->ofs); 86 fprintf (stderr, "<%d,%d> ", i->pri, i->ofs);
247 fprintf (stderr, "\n"); 87 fprintf (stderr, "\n");
248#endif 88#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 ();
260}
261
262// how lame
263static void print_facename (packet &sl, const facedata &d)
264{
265 for (int i = 0; i < CHKSUM_SIZE; ++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;
286} 89}
287 90
288/** 91/**
289 * Sends a face to a client if they are in pixmap mode 92 * Sends a face to a client if they are in pixmap mode
290 * nothing gets sent in bitmap mode. 93 * nothing gets sent in bitmap mode.
… …
292 * this is needed for the askface, in which we really do want to send the 95 * this is needed for the askface, in which we really do want to send the
293 * face (and askface is the only place that should be setting it). Otherwise, 96 * face (and askface is the only place that should be setting it). Otherwise,
294 * we look at the facecache, and if set, send the image name. 97 * we look at the facecache, and if set, send the image name.
295 */ 98 */
296void 99void
297client::send_face (faceidx facenum) 100client::send_face (faceidx facenum, int pri)
298{ 101{
299 // never send face 0. ever. it does not exist. 102 // never send face 0. ever. it does not exist.
300 if (!facenum) 103 if (!facenum)
301 return; 104 return;
302 105
303 const facedata *d = face_data (facenum, faceset); 106 faceinfo *f = face_info (facenum);
304 107
305 if (!d) 108 if (!f)
306 { 109 {
307 LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum); 110 LOG (llevError | logBacktrace, "client::send_face (%d) out of bounds??\n", facenum);
308 return; 111 return;
309 } 112 }
310 113
311 if (!must_send_face (facenum)) 114 // refuse to send non-image faces
115 if (!fx_want [f->type])
312 return; 116 return;
313 117
314 // if for some reason we let a client without face caching connect, 118 if (faces_sent [facenum])
315 // we better support that decision here and implement it. 119 return;
316 if (!facecache)
317 return send_image (facenum);
318 120
319 if (fxix) 121 faces_sent[facenum] = true;
320 { 122
321 fxface.push_back (facenum); 123 fxface.push_back (facenum);
322 return;
323 }
324
325 packet sl;
326
327 if (force_face0)
328 sl << "face " << uint16 (facenum);
329 else if (image2)
330 sl << "face2 " << uint16 (facenum) << uint8 (0) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0);
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 }
353 }
354} 124}
355 125
356void client::flush_fx () 126void client::flush_fx ()
357{ 127{
358 while (!fxface.empty ()) 128 while (!fxface.empty ())
359 { 129 {
360 packet fx ("fx"); 130 packet fx ("fx");
361 packet sx ("sx"); 131 packet sx ("sx");
132 int type = 0;
362 133
363 do 134 do
364 { 135 {
365 faceidx facenum = fxface.back (); fxface.pop_back (); 136 faceidx facenum = fxface.back (); fxface.pop_back ();
366 137
367 const facedata *d = face_data (facenum, faceset); 138 if (const faceinfo *f = face_info (facenum))
368
369 if (d)
370 { 139 {
140 if (f->type != type)
141 {
142 type = f->type;
143
144 fx << ber32 (0)
145 << uint8 (1) << uint8 (type);
146 }
147
148 const facedata *d = f->data (faceset);
149
371 fx << ber32 (facenum) 150 fx << ber32 (facenum)
372 << data8 (d->chksum, CHKSUM_SIZE); 151 << data8 (d->chksum, CHKSUM_SIZE);
373 152
374 if (smoothing) 153 if (smoothing)
375 { 154 {
376 faceinfo *f = face_info (facenum); 155 faceinfo *f = face_info (facenum);
377 156
378 if (f->smooth) 157 if (f->smooth)
379 { 158 {
380 send_face (f->smooth); 159 send_face (f->smooth, -110);
160
381 sx << ber32 (facenum) 161 sx << ber32 (facenum)
382 << ber32 (f->smooth) 162 << ber32 (f->smooth)
383 << ber32 (f->smoothlevel); 163 << ber32 (f->smoothlevel);
384 } 164 }
385 } 165 }
386 } 166 }
387 } 167 }
388 while (!fxface.empty () 168 while (!fxface.empty ()
389 && fx.room () > ber32::size + CHKSUM_SIZE + 1 169 && fx.room () > ber32::size + CHKSUM_SIZE + 1 + 3 /* type switch */
390 && sx.room () > ber32::size * 3); 170 && sx.room () > ber32::size * 3);
391 171
392 send_packet (fx); 172 send_packet (fx);
393 if (sx.length () > 3) send_packet (sx); 173 if (sx.length () > 3) send_packet (sx);
394 } 174 }
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
421 sl << (image2 ? "image2 " : "image ")
422 << uint32 (facenum);
423
424 if (image2)
425 sl << uint8 (0);
426
427 sl << uint32 (d->data.size ())
428 << data (d->data.data (), d->data.size ());
429
430 send_packet (sl);
431} 175}
432 176
433// send all faces of this object to the client 177// send all faces of this object to the client
434// this uses more bandwidth initially, but makes 178// this uses more bandwidth initially, but makes
435// animations look much smoother, and every client 179// animations look much smoother, and every client
436// is supposed to do client-side caching anyways. 180// is supposed to do client-side caching anyways.
437void 181void
438client::send_faces (object *ob) 182client::send_faces (object *ob)
439{ 183{
440 send_face (ob->face); 184 send_face (ob->face, 10);
441 185
442 if (ob->animation_id) 186 if (ob->animation_id)
443 { 187 {
444 animation &anim = animations [ob->animation_id]; 188 animation &anim = animations [ob->animation_id];
445 189
446 for (int i = 0; i < anim.num_animations; i++) 190 for (int i = 0; i < anim.num_animations; i++)
447 send_face (anim.faces [i]); 191 send_face (anim.faces [i], -10);
448 } 192 }
449} 193}
450 194
451/** 195/**
452 * Need to send an animation sequence to the client. 196 * Need to send an animation sequence to the client.
… …
476 /* Build up the list of faces. Also, send any information (ie, the 220 /* Build up the list of faces. Also, send any information (ie, the
477 * the face itself) down to the client. 221 * the face itself) down to the client.
478 */ 222 */
479 for (int i = 0; i < animations[anim_num].num_animations; i++) 223 for (int i = 0; i < animations[anim_num].num_animations; i++)
480 { 224 {
481 send_face (animations[anim_num].faces[i]); 225 send_face (animations[anim_num].faces[i], -20);
482 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ 226 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
483 } 227 }
484 228
485 send_packet (sl); 229 send_packet (sl);
486 230
… …
537 } 281 }
538 282
539 sl.printf ("replyinfo image_sums %d %d ", start, stop); 283 sl.printf ("replyinfo image_sums %d %d ", start, stop);
540 284
541 for (int i = start; i <= stop && i < faces.size (); i++) 285 for (int i = start; i <= stop && i < faces.size (); i++)
542 { 286 if (const faceinfo *f = face_info (i))
287 if (ns->fx_want [f->type])
288 {
543 ns->faces_sent[i] = true; 289 ns->faces_sent[i] = true;
544 290
545 const facedata *d = face_data (i, ns->faceset); 291 const facedata *d = f->data (ns->faceset);
546 292
547 if (sl.room () < 2 + 4 + 1 + d->data.size () + 1) 293 if (sl.room () < 2 + 4 + 1 + d->data.size () + 1)
548 break; 294 break;
549 295
550 sl << uint16 (i) 296 sl << uint16 (i)
551 << uint32 (0) // checksum 297 << uint32 (0) // checksum
552 << uint8 (ns->faceset); 298 << uint8 (ns->faceset);
553 299
554 print_facename (sl, *d); sl << uint8 (0); 300 for (int i = 0; i < CHKSUM_SIZE; ++i)
555 } 301 sl.printf ("%02x", d->chksum [i]);
302
303 sl << uint8 (0);
304 }
556 305
557 /* It would make more sense to catch this pre-emptively in the code above. 306 /* It would make more sense to catch this pre-emptively in the code above.
558 * however, if this really happens, we probably just want to cut down the 307 * however, if this really happens, we probably just want to cut down the
559 * size to less than 1000, since that is what we claim the protocol would 308 * size to less than 1000, since that is what we claim the protocol would
560 * support. 309 * support.
561 */ 310 */
562 //TODO: taken care of above, should simply abort or make sure the above code is correct 311 //TODO: taken care of above, should simply abort or make sure the above code is correct
563 if (sl.length () >= MAXSOCKBUF) 312 if (sl.length () > MAXSOCKBUF)
564 { 313 {
565 LOG (llevError, "send_image_send: buffer overrun, %d > %d\n", sl.length (), MAXSOCKBUF); 314 LOG (llevError, "send_image_send: buffer overrun, %d > %d\n", sl.length (), MAXSOCKBUF);
566 abort (); 315 abort ();
567 } 316 }
568 317

Diff Legend

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