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.43 by root, Sun Jul 1 04:08: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 Multiplayer Online Role Playing Game. 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 it 8 * Deliantra is free software: you can redistribute it and/or modify
9 * under the terms of the GNU General Public License as published by the Free 9 * it under the terms of the GNU General Public License as published by
10 * Software Foundation; either version 2 of the License, or (at your option) 10 * the Free Software Foundation, either version 3 of the License, or
11 * 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, but 13 * This program is distributed in the hope that it will be useful,
14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * 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 along 18 * You should have received a copy of the GNU General Public License
19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 * 20 *
22 * 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>
23 */ 22 */
24 23
25/** \file 24/** \file
26 * Image related communication 25 * Image related communication
27 * 26 *
… …
36#include <global.h> 35#include <global.h>
37#include <sproto.h> 36#include <sproto.h>
38 37
39#include "crc.h" 38#include "crc.h"
40 39
41#define MAX_FACE_SETS 20 /**< Maximum number of image sets the program will handle */
42
43/** Information about one image */
44typedef struct FaceInfo
45{
46 uint8 *data; /**< image data */
47 uint16 datalen; /**< length of the xpm data */
48 uint32 checksum; /**< Checksum of face data */
49} FaceInfo;
50
51/** Information about one face set */
52typedef struct
53{
54 char *prefix; /**< */
55 char *fullname;
56
57 uint8 fallback; /**< faceset to use when an image is not found in this faceset */
58 char *size;
59 char *extension;
60 char *comment;
61
62 FaceInfo *faces; /**< images in this faceset */
63} FaceSets;
64
65static FaceSets facesets[MAX_FACE_SETS]; /**< All facesets */
66
67/**
68 * Checks specified faceset is valid
69 * \param fsn faceset number
70 */
71int
72is_valid_faceset (int fsn)
73{
74 if (fsn >= 0 && fsn < MAX_FACE_SETS && facesets[fsn].prefix)
75 return TRUE;
76 return FALSE;
77}
78
79/**
80 * Frees all faceset information
81 */
82void
83free_socket_images (void)
84{
85 int num, q;
86
87 for (num = 0; num < MAX_FACE_SETS; num++)
88 {
89 if (facesets[num].prefix)
90 {
91 for (q = 0; q < faces.size (); q++)
92 if (facesets[num].faces[q].data)
93 free (facesets[num].faces[q].data);
94
95 free (facesets[num].prefix);
96 free (facesets[num].fullname);
97 free (facesets[num].size);
98 free (facesets[num].extension);
99 free (facesets[num].comment);
100 free (facesets[num].faces);
101 }
102 }
103}
104
105/**
106 * This returns the set we will actually use when sending
107 * a face. This is used because the image files may be sparse.
108 * This function is recursive. imageno is the face number we are
109 * trying to send
110 *
111 * If face is not found in specified faceset, tries with 'fallback' faceset.
112 *
113 * \param faceset faceset to check
114 * \param imageno image number
115 *
116 */
117static int
118get_face_fallback (int faceset, int imageno)
119{
120 /* faceset 0 is supposed to have every image, so just return. Doing
121 * so also prevents infinite loops in the case if it not having
122 * the face, but in that case, we are likely to crash when we try
123 * to access the data, but that is probably preferable to an infinite
124 * loop.
125 */
126 if (faceset == 0)
127 return 0;
128
129 if (!facesets[faceset].prefix)
130 {
131 LOG (llevError, "get_face_fallback called with unused set (%d)?\n", faceset);
132 return 0; /* use default set */
133 }
134
135 if (facesets[faceset].faces[imageno].data)
136 return faceset;
137
138 return get_face_fallback (facesets[faceset].fallback, imageno);
139}
140
141/**
142 * Checks fallback are correctly defined.
143 * This is a simple recursive function that makes sure the fallbacks
144 * are all proper (eg, the fall back to defined sets, and also
145 * eventually fall back to 0). At the top level, togo is set to MAX_FACE_SETS,
146 * if togo gets to zero, it means we have a loop.
147 * This is only run when we first load the facesets.
148 */
149static void
150check_faceset_fallback (int faceset, int togo)
151{
152 int fallback = facesets[faceset].fallback;
153
154 /* proper case - falls back to base set */
155 if (fallback == 0)
156 return;
157
158 if (!facesets[fallback].prefix)
159 {
160 LOG (llevError, "Face set %d falls to non set faceset %d\n", faceset, fallback);
161 abort ();
162 }
163
164 togo--;
165 if (togo == 0)
166 {
167 LOG (llevError, "Infinite loop found in facesets. aborting.\n");
168 abort ();
169 }
170
171 check_faceset_fallback (fallback, togo);
172}
173
174#define MAX_IMAGE_SIZE 10000 40#define MAX_IMAGE_SIZE 10000
175
176/**
177 * Client tells us what type of faces it wants. Also sets
178 * the caching attribute.
179 *
180 */
181void
182SetFaceMode (char *buf, int len, client *ns)
183{
184 int mask = (atoi (buf) & CF_FACE_CACHE), mode = (atoi (buf) & ~CF_FACE_CACHE);
185
186 if (mode == CF_FACE_NONE)
187 ns->facecache = 1;
188 else if (mode != CF_FACE_PNG)
189 ns->send_packet_printf ("drawinfo %d %s", NDI_RED, "Warning - send unsupported face mode. Will use Png");
190
191 if (mask)
192 ns->facecache = 1;
193}
194 41
195/** 42/**
196 * client requested an image. send it rate-limited 43 * client requested an image. send it rate-limited
197 * before flushing. 44 * before flushing.
198 */ 45 */
… …
200AskFaceCmd (char *buf, int len, client *ns) 47AskFaceCmd (char *buf, int len, client *ns)
201{ 48{
202 int idx = 0, pri = 0; 49 int idx = 0, pri = 0;
203 50
204 sscanf (buf, "%d %d", &idx, &pri); 51 sscanf (buf, "%d %d", &idx, &pri);
52
53 //TODO: somehow fetch default priority from send_fx here
205 54
206 const facedata *d = face_data (idx, ns->faceset); 55 const facedata *d = face_data (idx, ns->faceset);
207 56
208 if (!d) 57 if (!d)
209 return; // doh 58 return; // doh
… …
212 61
213 ix.pri = pri; 62 ix.pri = pri;
214 ix.idx = idx; 63 ix.idx = idx;
215 ix.ofs = d->data.size (); 64 ix.ofs = d->data.size ();
216 65
66 auto (pos, ns->ixface.end ());
67
217 // the by far most common case will be to insert 68 // the by far most common case will be to insert
218 // right at the end, so no looping. 69 // near the end, so little looping.
219 auto (i, ns->ixface.end ());
220 for (; i != ns->ixface.begin (); ) 70 while (pos != ns->ixface.begin ())
221 if (pri >= (--i)->pri) 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)))
76 {
77 ++pos;
222 break; 78 break;
79 }
80 }
223 81
224 ns->ixface.insert (i, ix); 82 ns->ixface.insert (pos, ix);
225}
226 83
227/** 84#if 0
228 * Tells client the picture it has to use 85 for (auto (i, ns->ixface.begin ()); i != ns->ixface.end (); ++i)
229 * to smooth a picture number given as argument. 86 fprintf (stderr, "<%d,%d> ", i->pri, i->ofs);
230 */ 87 fprintf (stderr, "\n");
231void 88#endif
232AskSmooth (char *buf, int len, client *ns)
233{
234 ns->send_face (atoi (buf));
235 ns->flush_fx ();
236}
237
238// how lame
239static void print_facename (packet &sl, const facedata &d)
240{
241 for (int i = 0; i < CHKSUM_SIZE; ++i)
242 sl.printf ("%02x", d.chksum [i]);
243}
244
245// gcfclient uses the server-provided checksum for comparison, but always
246// writes a broken checksum to its cache file, so we have to provide
247// gcfclient with the same broken (and useless) checksum just to have it
248// cache the image despite its bugs.
249static uint32 gcfclient_checksum (const facedata *d)
250{
251 uint32 csum = 0;
252
253 for (std::string::const_iterator i = d->data.begin ();
254 i != d->data.end ();
255 ++i)
256 {
257 csum = rotate_right (csum);
258 csum += *(uint8 *)&*i;
259 }
260
261 return csum;
262} 89}
263 90
264/** 91/**
265 * 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
266 * nothing gets sent in bitmap mode. 93 * nothing gets sent in bitmap mode.
… …
268 * 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
269 * 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,
270 * 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.
271 */ 98 */
272void 99void
273client::send_face (faceidx facenum) 100client::send_face (faceidx facenum, int pri)
274{ 101{
275 // never send face 0. ever. it does not exist. 102 // never send face 0. ever. it does not exist.
276 if (!facenum) 103 if (!facenum)
277 return; 104 return;
278 105
279 const facedata *d = face_data (facenum, faceset); 106 faceinfo *f = face_info (facenum);
280 107
281 if (!d) 108 if (!f)
282 { 109 {
283 LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum); 110 LOG (llevError | logBacktrace, "client::send_face (%d) out of bounds??\n", facenum);
284 return; 111 return;
285 } 112 }
286 113
287 if (faces_sent[facenum]) 114 // refuse to send non-image faces
115 if (!fx_want [f->type])
288 return; 116 return;
289 117
118 if (faces_sent [facenum])
119 return;
120
290 faces_sent[facenum] = true; 121 faces_sent[facenum] = true;
291 122
292 // if for some reason we let a client without face caching connect,
293 // we better support that decision here and implement it.
294 if (!facecache)
295 return send_image (facenum);
296
297 if (fxix)
298 {
299 fxface.push_back (facenum); 123 fxface.push_back (facenum);
300 return;
301 }
302
303 packet sl;
304
305 if (force_face0)
306 sl << "face " << uint16 (facenum);
307 else if (image2)
308 sl << "face2 " << uint16 (facenum) << uint8 (0) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0);
309 else
310 sl << "face1 " << uint16 (facenum) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0);
311
312 // how lame
313 print_facename (sl, *d);
314 send_packet (sl);
315
316 if (EMI_smooth)
317 {
318 faceinfo *f = face_info (facenum);
319
320 if (f->smooth)
321 {
322 send_face (f->smooth);
323
324 packet sl ("smooth");
325
326 sl << uint16 (facenum)
327 << uint16 (f->smooth);
328
329 send_packet (sl);
330 }
331 }
332} 124}
333 125
334void client::flush_fx () 126void client::flush_fx ()
335{ 127{
336 while (!fxface.empty ()) 128 while (!fxface.empty ())
337 { 129 {
338 packet fx ("fx"); 130 packet fx ("fx");
339 packet sx ("sx"); 131 packet sx ("sx");
132 int type = 0;
340 133
341 do 134 do
342 { 135 {
343 faceidx facenum = fxface.back (); fxface.pop_back (); 136 faceidx facenum = fxface.back (); fxface.pop_back ();
344 137
345 const facedata *d = face_data (facenum, faceset); 138 if (const faceinfo *f = face_info (facenum))
346
347 if (d)
348 { 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
349 fx << ber32 (facenum) 150 fx << ber32 (facenum)
350 << data8 (d->chksum, CHKSUM_SIZE); 151 << data8 (d->chksum, CHKSUM_SIZE);
351 152
352 if (smoothing) 153 if (smoothing)
353 { 154 {
354 faceinfo *f = face_info (facenum); 155 faceinfo *f = face_info (facenum);
355 156
356 if (f->smooth) 157 if (f->smooth)
357 { 158 {
358 send_face (f->smooth); 159 send_face (f->smooth, -110);
160
359 sx << ber32 (facenum) 161 sx << ber32 (facenum)
360 << ber32 (f->smooth) 162 << ber32 (f->smooth)
361 << ber32 (f->smoothlevel); 163 << ber32 (f->smoothlevel);
362 } 164 }
363 } 165 }
364 } 166 }
365 } 167 }
366 while (!fxface.empty () 168 while (!fxface.empty ()
367 && fx.room () > ber32::size + CHKSUM_SIZE + 1 169 && fx.room () > ber32::size + CHKSUM_SIZE + 1 + 3 /* type switch */
368 && sx.room () > ber32::size * 3); 170 && sx.room () > ber32::size * 3);
369 171
370 send_packet (fx); 172 send_packet (fx);
371 if (sx.length () > 3) send_packet (sx); 173 if (sx.length () > 3) send_packet (sx);
372 } 174 }
373}
374
375void
376client::send_image (faceidx facenum)
377{
378 // never send face 0. ever. it does not exist.
379 if (!facenum)
380 return;
381
382 const facedata *d = face_data (facenum, faceset);
383
384 faces_sent[facenum] = true;
385
386 if (!d)
387 {
388 LOG (llevError, "client::send_image (%d) out of bounds??\n", facenum);
389 return;
390 }
391
392 //TODO: check type here?
393
394 if (force_image_newmap)
395 force_newmap = true;
396
397 packet sl;
398
399 sl << (image2 ? "image2 " : "image ")
400 << uint32 (facenum);
401
402 if (image2)
403 sl << uint8 (0);
404
405 sl << uint32 (d->data.size ())
406 << data (d->data.data (), d->data.size ());
407
408 send_packet (sl);
409} 175}
410 176
411// send all faces of this object to the client 177// send all faces of this object to the client
412// this uses more bandwidth initially, but makes 178// this uses more bandwidth initially, but makes
413// animations look much smoother, and every client 179// animations look much smoother, and every client
414// is supposed to do client-side caching anyways. 180// is supposed to do client-side caching anyways.
415void 181void
416client::send_faces (object *ob) 182client::send_faces (object *ob)
417{ 183{
418 send_face (ob->face); 184 send_face (ob->face, 10);
419 185
420 if (ob->animation_id) 186 if (ob->animation_id)
421 { 187 {
422 animation &anim = animations [ob->animation_id]; 188 animation &anim = animations [ob->animation_id];
423 189
424 for (int i = 0; i < anim.num_animations; i++) 190 for (int i = 0; i < anim.num_animations; i++)
425 send_face (anim.faces [i]); 191 send_face (anim.faces [i], -10);
426 } 192 }
427} 193}
428 194
429/** 195/**
430 * Need to send an animation sequence to the client. 196 * Need to send an animation sequence to the client.
… …
454 /* 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
455 * the face itself) down to the client. 221 * the face itself) down to the client.
456 */ 222 */
457 for (int i = 0; i < animations[anim_num].num_animations; i++) 223 for (int i = 0; i < animations[anim_num].num_animations; i++)
458 { 224 {
459 send_face (animations[anim_num].faces[i]); 225 send_face (animations[anim_num].faces[i], -20);
460 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 */
461 } 227 }
462 228
463 send_packet (sl); 229 send_packet (sl);
464 230
… …
515 } 281 }
516 282
517 sl.printf ("replyinfo image_sums %d %d ", start, stop); 283 sl.printf ("replyinfo image_sums %d %d ", start, stop);
518 284
519 for (int i = start; i <= stop && i < faces.size (); i++) 285 for (int i = start; i <= stop && i < faces.size (); i++)
520 { 286 if (const faceinfo *f = face_info (i))
287 if (ns->fx_want [f->type])
288 {
521 ns->faces_sent[i] = true; 289 ns->faces_sent[i] = true;
522 290
523 const facedata *d = face_data (i, ns->faceset); 291 const facedata *d = f->data (ns->faceset);
524 292
525 if (sl.room () < 2 + 4 + 1 + d->data.size () + 1) 293 if (sl.room () < 2 + 4 + 1 + d->data.size () + 1)
526 break; 294 break;
527 295
528 sl << uint16 (i) 296 sl << uint16 (i)
529 << uint32 (0) // checksum 297 << uint32 (0) // checksum
530 << uint8 (ns->faceset); 298 << uint8 (ns->faceset);
531 299
532 print_facename (sl, *d); sl << uint8 (0); 300 for (int i = 0; i < CHKSUM_SIZE; ++i)
533 } 301 sl.printf ("%02x", d->chksum [i]);
302
303 sl << uint8 (0);
304 }
534 305
535 /* 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.
536 * 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
537 * 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
538 * support. 309 * support.
539 */ 310 */
540 //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
541 if (sl.length () >= MAXSOCKBUF) 312 if (sl.length () > MAXSOCKBUF)
542 { 313 {
543 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);
544 abort (); 315 abort ();
545 } 316 }
546 317

Diff Legend

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