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.44 by root, Sun Jul 1 05:00:20 2007 UTC vs.
Revision 1.56 by root, Tue May 6 16:55:26 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 41
175/** 42/**
176 * Client tells us what type of faces it wants. Also sets 43 * Client tells us what type of faces it wants. Also sets
177 * the caching attribute. 44 * the caching attribute.
200{ 67{
201 int idx = 0, pri = 0; 68 int idx = 0, pri = 0;
202 69
203 sscanf (buf, "%d %d", &idx, &pri); 70 sscanf (buf, "%d %d", &idx, &pri);
204 71
72 //TODO: somehow fetch default priority from send_fx here
73
205 const facedata *d = face_data (idx, ns->faceset); 74 const facedata *d = face_data (idx, ns->faceset);
206 75
207 if (!d) 76 if (!d)
208 return; // doh 77 return; // doh
209 78
211 80
212 ix.pri = pri; 81 ix.pri = pri;
213 ix.idx = idx; 82 ix.idx = idx;
214 ix.ofs = d->data.size (); 83 ix.ofs = d->data.size ();
215 84
85 auto (pos, ns->ixface.end ());
86
87 if (ns->fxix < 2)
88 {
89 // gcfclient does not support prioritising, older cfplus versions
90 // do not support interleaved transfers.
91 if (!ns->ixface.empty ())
92 pos = ns->ixface.end () - 1;
93 }
94 else
95 {
216 // the by far most common case will be to insert 96 // the by far most common case will be to insert
217 // right at the end, so no looping. 97 // near the end, so little looping.
218 auto (i, ns->ixface.end ()); 98 while (pos != ns->ixface.begin ())
219 for (; i != ns->ixface.begin (); ) 99 {
220 if (pri >= (--i)->pri) 100 --pos;
101
102 // sort within 2k bins, to slightly prefer smaller images
103 if (pri > pos->pri || (pri == pos->pri && (ix.ofs >> 11) <= (pos->ofs >> 11)))
104 {
105 ++pos;
221 break; 106 break;
107 }
108 }
109 }
222 110
223 ns->ixface.insert (i, ix); 111 ns->ixface.insert (pos, ix);
112
113#if 0
114 for (auto (i, ns->ixface.begin ()); i != ns->ixface.end (); ++i)
115 fprintf (stderr, "<%d,%d> ", i->pri, i->ofs);
116 fprintf (stderr, "\n");
117#endif
224} 118}
225 119
226/** 120/**
227 * Tells client the picture it has to use 121 * Tells client the picture it has to use
228 * to smooth a picture number given as argument. 122 * to smooth a picture number given as argument.
229 */ 123 */
230void 124void
231AskSmooth (char *buf, int len, client *ns) 125AskSmooth (char *buf, int len, client *ns)
232{ 126{
233 ns->send_face (atoi (buf)); 127 ns->send_face (atoi (buf), -100);
234 ns->flush_fx (); 128 ns->flush_fx ();
235} 129}
236 130
237// how lame 131// how lame
238static void print_facename (packet &sl, const facedata &d) 132static void print_facename (packet &sl, const facedata &d)
267 * this is needed for the askface, in which we really do want to send the 161 * this is needed for the askface, in which we really do want to send the
268 * face (and askface is the only place that should be setting it). Otherwise, 162 * face (and askface is the only place that should be setting it). Otherwise,
269 * we look at the facecache, and if set, send the image name. 163 * we look at the facecache, and if set, send the image name.
270 */ 164 */
271void 165void
272client::send_face (faceidx facenum) 166client::send_face (faceidx facenum, int pri)
273{ 167{
274 // never send face 0. ever. it does not exist. 168 // never send face 0. ever. it does not exist.
275 if (!facenum) 169 if (!facenum)
276 return; 170 return;
277 171
278 const facedata *d = face_data (facenum, faceset); 172 faceinfo *f = face_info (facenum);
279 173
280 if (!d) 174 if (!f)
281 { 175 {
282 LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum); 176 LOG (llevError | logBacktrace, "client::send_face (%d) out of bounds??\n", facenum);
283 return; 177 return;
284 } 178 }
285 179
180 // refuse to send non-image faces
181 if (!fx_want [f->type])
182 return;
183
286 if (faces_sent[facenum]) 184 if (faces_sent [facenum])
287 return; 185 return;
288 186
289 faces_sent[facenum] = true; 187 faces_sent[facenum] = true;
290 188
291 // if for some reason we let a client without face caching connect, 189 // if for some reason we let a client without face caching connect,
296 if (fxix) 194 if (fxix)
297 { 195 {
298 fxface.push_back (facenum); 196 fxface.push_back (facenum);
299 return; 197 return;
300 } 198 }
199
200 const facedata *d = f->data (faceset);
301 201
302 packet sl; 202 packet sl;
303 203
304 if (force_face0) 204 if (force_face0)
305 sl << "face " << uint16 (facenum); 205 sl << "face " << uint16 (facenum);
312 print_facename (sl, *d); 212 print_facename (sl, *d);
313 send_packet (sl); 213 send_packet (sl);
314 214
315 if (EMI_smooth) 215 if (EMI_smooth)
316 { 216 {
317 faceinfo *f = face_info (facenum);
318
319 if (f->smooth) 217 if (f->smooth)
320 { 218 {
321 send_face (f->smooth); 219 send_face (f->smooth);
322 220
323 packet sl ("smooth"); 221 packet sl ("smooth");
334{ 232{
335 while (!fxface.empty ()) 233 while (!fxface.empty ())
336 { 234 {
337 packet fx ("fx"); 235 packet fx ("fx");
338 packet sx ("sx"); 236 packet sx ("sx");
237 int type = 0;
339 238
340 do 239 do
341 { 240 {
342 faceidx facenum = fxface.back (); fxface.pop_back (); 241 faceidx facenum = fxface.back (); fxface.pop_back ();
343 242
344 const facedata *d = face_data (facenum, faceset); 243 if (const faceinfo *f = face_info (facenum))
345
346 if (d)
347 { 244 {
245 if (f->type != type)
246 {
247 type = f->type;
248
249 fx << ber32 (0)
250 << uint8 (1) << uint8 (type);
251 }
252
253 const facedata *d = f->data (faceset);
254
348 fx << ber32 (facenum) 255 fx << ber32 (facenum)
349 << data8 (d->chksum, CHKSUM_SIZE); 256 << data8 (d->chksum, CHKSUM_SIZE);
350 257
351 if (smoothing) 258 if (smoothing)
352 { 259 {
353 faceinfo *f = face_info (facenum); 260 faceinfo *f = face_info (facenum);
354 261
355 if (f->smooth) 262 if (f->smooth)
356 { 263 {
357 send_face (f->smooth); 264 send_face (f->smooth, -110);
265
358 sx << ber32 (facenum) 266 sx << ber32 (facenum)
359 << ber32 (f->smooth) 267 << ber32 (f->smooth)
360 << ber32 (f->smoothlevel); 268 << ber32 (f->smoothlevel);
361 } 269 }
362 } 270 }
363 } 271 }
364 } 272 }
365 while (!fxface.empty () 273 while (!fxface.empty ()
366 && fx.room () > ber32::size + CHKSUM_SIZE + 1 274 && fx.room () > ber32::size + CHKSUM_SIZE + 1 + 3 /* type switch */
367 && sx.room () > ber32::size * 3); 275 && sx.room () > ber32::size * 3);
368 276
369 send_packet (fx); 277 send_packet (fx);
370 if (sx.length () > 3) send_packet (sx); 278 if (sx.length () > 3) send_packet (sx);
371 } 279 }
386 { 294 {
387 LOG (llevError, "client::send_image (%d) out of bounds??\n", facenum); 295 LOG (llevError, "client::send_image (%d) out of bounds??\n", facenum);
388 return; 296 return;
389 } 297 }
390 298
391 //TODO: check type here?
392
393 if (force_image_newmap) 299 if (force_image_newmap)
394 force_newmap = true; 300 force_newmap = true;
395 301
396 packet sl; 302 packet sl;
397 303
412// animations look much smoother, and every client 318// animations look much smoother, and every client
413// is supposed to do client-side caching anyways. 319// is supposed to do client-side caching anyways.
414void 320void
415client::send_faces (object *ob) 321client::send_faces (object *ob)
416{ 322{
417 send_face (ob->face); 323 send_face (ob->face, 10);
418 324
419 if (ob->animation_id) 325 if (ob->animation_id)
420 { 326 {
421 animation &anim = animations [ob->animation_id]; 327 animation &anim = animations [ob->animation_id];
422 328
423 for (int i = 0; i < anim.num_animations; i++) 329 for (int i = 0; i < anim.num_animations; i++)
424 send_face (anim.faces [i]); 330 send_face (anim.faces [i], -10);
425 } 331 }
426} 332}
427 333
428/** 334/**
429 * Need to send an animation sequence to the client. 335 * Need to send an animation sequence to the client.
453 /* Build up the list of faces. Also, send any information (ie, the 359 /* Build up the list of faces. Also, send any information (ie, the
454 * the face itself) down to the client. 360 * the face itself) down to the client.
455 */ 361 */
456 for (int i = 0; i < animations[anim_num].num_animations; i++) 362 for (int i = 0; i < animations[anim_num].num_animations; i++)
457 { 363 {
458 send_face (animations[anim_num].faces[i]); 364 send_face (animations[anim_num].faces[i], -20);
459 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ 365 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
460 } 366 }
461 367
462 send_packet (sl); 368 send_packet (sl);
463 369
514 } 420 }
515 421
516 sl.printf ("replyinfo image_sums %d %d ", start, stop); 422 sl.printf ("replyinfo image_sums %d %d ", start, stop);
517 423
518 for (int i = start; i <= stop && i < faces.size (); i++) 424 for (int i = start; i <= stop && i < faces.size (); i++)
519 { 425 if (const faceinfo *f = face_info (i))
426 if (ns->fx_want [f->type])
427 {
520 ns->faces_sent[i] = true; 428 ns->faces_sent[i] = true;
521 429
522 const facedata *d = face_data (i, ns->faceset); 430 const facedata *d = f->data (ns->faceset);
523 431
524 if (sl.room () < 2 + 4 + 1 + d->data.size () + 1) 432 if (sl.room () < 2 + 4 + 1 + d->data.size () + 1)
525 break; 433 break;
526 434
527 sl << uint16 (i) 435 sl << uint16 (i)
528 << uint32 (0) // checksum 436 << uint32 (0) // checksum
529 << uint8 (ns->faceset); 437 << uint8 (ns->faceset);
530 438
531 print_facename (sl, *d); sl << uint8 (0); 439 print_facename (sl, *d); sl << uint8 (0);
532 } 440 }
533 441
534 /* It would make more sense to catch this pre-emptively in the code above. 442 /* It would make more sense to catch this pre-emptively in the code above.
535 * however, if this really happens, we probably just want to cut down the 443 * however, if this really happens, we probably just want to cut down the
536 * size to less than 1000, since that is what we claim the protocol would 444 * size to less than 1000, since that is what we claim the protocol would
537 * support. 445 * support.
538 */ 446 */
539 //TODO: taken care of above, should simply abort or make sure the above code is correct 447 //TODO: taken care of above, should simply abort or make sure the above code is correct
540 if (sl.length () >= MAXSOCKBUF) 448 if (sl.length () > MAXSOCKBUF)
541 { 449 {
542 LOG (llevError, "send_image_send: buffer overrun, %d > %d\n", sl.length (), MAXSOCKBUF); 450 LOG (llevError, "send_image_send: buffer overrun, %d > %d\n", sl.length (), MAXSOCKBUF);
543 abort (); 451 abort ();
544 } 452 }
545 453

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines