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.49 by root, Thu Jul 12 18:48:54 2007 UTC vs.
Revision 1.50 by root, Tue Jul 24 04:55:34 2007 UTC

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.
253 * to smooth a picture number given as argument. 120 * to smooth a picture number given as argument.
254 */ 121 */
255void 122void
256AskSmooth (char *buf, int len, client *ns) 123AskSmooth (char *buf, int len, client *ns)
257{ 124{
258 ns->send_face (atoi (buf)); 125 ns->send_face (atoi (buf), -100);
259 ns->flush_fx (); 126 ns->flush_fx ();
260} 127}
261 128
262// how lame 129// how lame
263static void print_facename (packet &sl, const facedata &d) 130static void print_facename (packet &sl, const facedata &d)
292 * this is needed for the askface, in which we really do want to send the 159 * 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, 160 * 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. 161 * we look at the facecache, and if set, send the image name.
295 */ 162 */
296void 163void
297client::send_face (faceidx facenum) 164client::send_face (faceidx facenum, int pri)
298{ 165{
299 // never send face 0. ever. it does not exist. 166 // never send face 0. ever. it does not exist.
300 if (!facenum) 167 if (!facenum)
301 return; 168 return;
302 169
303 const facedata *d = face_data (facenum, faceset); 170 faceinfo *f = face_info (facenum);
304 171
305 if (!d) 172 if (!f)
306 { 173 {
307 LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum); 174 LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum);
308 return; 175 return;
309 } 176 }
310 177
311 faceinfo *f = face_info (facenum);
312
313 // refuse tos end non-image faces 178 // refuse to send non-image faces
314 if (f->type) 179 if (!fx_want [f->type])
315 return; 180 return;
316 181
317 if (!must_send_face (facenum)) 182 if (faces_sent [facenum])
318 return; 183 return;
184
185 faces_sent[facenum] = true;
319 186
320 // if for some reason we let a client without face caching connect, 187 // if for some reason we let a client without face caching connect,
321 // we better support that decision here and implement it. 188 // we better support that decision here and implement it.
322 if (!facecache) 189 if (!facecache)
323 return send_image (facenum); 190 return send_image (facenum);
325 if (fxix) 192 if (fxix)
326 { 193 {
327 fxface.push_back (facenum); 194 fxface.push_back (facenum);
328 return; 195 return;
329 } 196 }
197
198 const facedata *d = f->data (faceset);
330 199
331 packet sl; 200 packet sl;
332 201
333 if (force_face0) 202 if (force_face0)
334 sl << "face " << uint16 (facenum); 203 sl << "face " << uint16 (facenum);
361{ 230{
362 while (!fxface.empty ()) 231 while (!fxface.empty ())
363 { 232 {
364 packet fx ("fx"); 233 packet fx ("fx");
365 packet sx ("sx"); 234 packet sx ("sx");
235 int type = 0;
366 236
367 do 237 do
368 { 238 {
369 faceidx facenum = fxface.back (); fxface.pop_back (); 239 faceidx facenum = fxface.back (); fxface.pop_back ();
370 240
371 const facedata *d = face_data (facenum, faceset); 241 if (const faceinfo *f = face_info (facenum))
372
373 if (d)
374 { 242 {
243 if (f->type != type)
244 {
245 type = f->type;
246
247 fx << ber32 (0)
248 << uint8 (1) << uint8 (type);
249 }
250
251 const facedata *d = f->data (faceset);
252
375 fx << ber32 (facenum) 253 fx << ber32 (facenum)
376 << data8 (d->chksum, CHKSUM_SIZE); 254 << data8 (d->chksum, CHKSUM_SIZE);
377 255
378 if (smoothing) 256 if (smoothing)
379 { 257 {
380 faceinfo *f = face_info (facenum); 258 faceinfo *f = face_info (facenum);
381 259
382 if (f->smooth) 260 if (f->smooth)
383 { 261 {
384 send_face (f->smooth); 262 send_face (f->smooth, -110);
263
385 sx << ber32 (facenum) 264 sx << ber32 (facenum)
386 << ber32 (f->smooth) 265 << ber32 (f->smooth)
387 << ber32 (f->smoothlevel); 266 << ber32 (f->smoothlevel);
388 } 267 }
389 } 268 }
390 } 269 }
391 } 270 }
392 while (!fxface.empty () 271 while (!fxface.empty ()
393 && fx.room () > ber32::size + CHKSUM_SIZE + 1 272 && fx.room () > ber32::size + CHKSUM_SIZE + 1 + 3 /* type switch */
394 && sx.room () > ber32::size * 3); 273 && sx.room () > ber32::size * 3);
395 274
396 send_packet (fx); 275 send_packet (fx);
397 if (sx.length () > 3) send_packet (sx); 276 if (sx.length () > 3) send_packet (sx);
398 } 277 }
439// animations look much smoother, and every client 318// animations look much smoother, and every client
440// is supposed to do client-side caching anyways. 319// is supposed to do client-side caching anyways.
441void 320void
442client::send_faces (object *ob) 321client::send_faces (object *ob)
443{ 322{
444 send_face (ob->face); 323 send_face (ob->face, 10);
445 324
446 if (ob->animation_id) 325 if (ob->animation_id)
447 { 326 {
448 animation &anim = animations [ob->animation_id]; 327 animation &anim = animations [ob->animation_id];
449 328
450 for (int i = 0; i < anim.num_animations; i++) 329 for (int i = 0; i < anim.num_animations; i++)
451 send_face (anim.faces [i]); 330 send_face (anim.faces [i], -10);
452 } 331 }
453} 332}
454 333
455/** 334/**
456 * Need to send an animation sequence to the client. 335 * Need to send an animation sequence to the client.
480 /* 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
481 * the face itself) down to the client. 360 * the face itself) down to the client.
482 */ 361 */
483 for (int i = 0; i < animations[anim_num].num_animations; i++) 362 for (int i = 0; i < animations[anim_num].num_animations; i++)
484 { 363 {
485 send_face (animations[anim_num].faces[i]); 364 send_face (animations[anim_num].faces[i], -20);
486 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 */
487 } 366 }
488 367
489 send_packet (sl); 368 send_packet (sl);
490 369

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines