… | |
… | |
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 */ |
|
|
43 | typedef 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 */ |
|
|
51 | typedef 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 | |
|
|
64 | static FaceSets facesets[MAX_FACE_SETS]; /**< All facesets */ |
|
|
65 | |
|
|
66 | /** |
|
|
67 | * Checks specified faceset is valid |
|
|
68 | * \param fsn faceset number |
|
|
69 | */ |
|
|
70 | int |
|
|
71 | is_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 | */ |
|
|
81 | void |
|
|
82 | free_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 | */ |
|
|
116 | static int |
|
|
117 | get_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 | */ |
|
|
148 | static void |
|
|
149 | check_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. |
… | |
… | |
211 | |
78 | |
212 | ix.pri = pri; |
79 | ix.pri = pri; |
213 | ix.idx = idx; |
80 | ix.idx = idx; |
214 | ix.ofs = d->data.size (); |
81 | ix.ofs = d->data.size (); |
215 | |
82 | |
216 | // this is (hopefully) a temporary fix around older cfplus versions not |
83 | auto (pos, ns->ixface.end ()); |
|
|
84 | |
|
|
85 | if (ns->fxix < 2) |
|
|
86 | { |
|
|
87 | // gcfclient does not support prioritising, older cfplus versions |
217 | // supporting interleaved transfers |
88 | // do not support interleaved transfers. |
218 | ns->ixface.insert (ns->ixface.begin (), ix); |
89 | if (!ns->ixface.empty ()) |
|
|
90 | pos = ns->ixface.end () - 1; |
|
|
91 | } |
|
|
92 | else |
|
|
93 | { |
|
|
94 | // the by far most common case will be to insert |
|
|
95 | // near the end, so little looping. |
|
|
96 | while (pos != ns->ixface.begin ()) |
|
|
97 | { |
|
|
98 | --pos; |
|
|
99 | |
|
|
100 | // sort within 2k bins, to slightly prefer smaller images |
|
|
101 | if (pri > pos->pri || (pri == pos->pri && (ix.ofs >> 11) <= (pos->ofs >> 11))) |
|
|
102 | { |
|
|
103 | ++pos; |
|
|
104 | break; |
|
|
105 | } |
|
|
106 | } |
|
|
107 | } |
|
|
108 | |
|
|
109 | ns->ixface.insert (pos, ix); |
219 | |
110 | |
220 | #if 0 |
111 | #if 0 |
221 | // the by far most common case will be to insert |
112 | for (auto (i, ns->ixface.begin ()); i != ns->ixface.end (); ++i) |
222 | // right at the end, so no looping. |
113 | fprintf (stderr, "<%d,%d> ", i->pri, i->ofs); |
223 | auto (i, ns->ixface.end ()); |
114 | fprintf (stderr, "\n"); |
224 | for (; i != ns->ixface.begin (); ) |
|
|
225 | if (pri >= (--i)->pri) |
|
|
226 | break; |
|
|
227 | |
|
|
228 | ns->ixface.insert (i, ix); |
|
|
229 | #endif |
115 | #endif |
230 | } |
116 | } |
231 | |
117 | |
232 | /** |
118 | /** |
233 | * Tells client the picture it has to use |
119 | * Tells client the picture it has to use |
234 | * to smooth a picture number given as argument. |
120 | * to smooth a picture number given as argument. |
235 | */ |
121 | */ |
236 | void |
122 | void |
237 | AskSmooth (char *buf, int len, client *ns) |
123 | AskSmooth (char *buf, int len, client *ns) |
238 | { |
124 | { |
239 | ns->send_face (atoi (buf)); |
125 | ns->send_face (atoi (buf), -100); |
240 | ns->flush_fx (); |
126 | ns->flush_fx (); |
241 | } |
127 | } |
242 | |
128 | |
243 | // how lame |
129 | // how lame |
244 | static void print_facename (packet &sl, const facedata &d) |
130 | static void print_facename (packet &sl, const facedata &d) |
… | |
… | |
273 | * 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 |
274 | * 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, |
275 | * 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. |
276 | */ |
162 | */ |
277 | void |
163 | void |
278 | client::send_face (faceidx facenum) |
164 | client::send_face (faceidx facenum, int pri) |
279 | { |
165 | { |
280 | // never send face 0. ever. it does not exist. |
166 | // never send face 0. ever. it does not exist. |
281 | if (!facenum) |
167 | if (!facenum) |
282 | return; |
168 | return; |
283 | |
169 | |
284 | const facedata *d = face_data (facenum, faceset); |
170 | faceinfo *f = face_info (facenum); |
285 | |
171 | |
286 | if (!d) |
172 | if (!f) |
287 | { |
173 | { |
288 | LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum); |
174 | LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum); |
289 | return; |
175 | return; |
290 | } |
176 | } |
291 | |
177 | |
|
|
178 | // refuse to send non-image faces |
|
|
179 | if (!fx_want [f->type]) |
|
|
180 | return; |
|
|
181 | |
292 | if (faces_sent[facenum]) |
182 | if (faces_sent [facenum]) |
293 | return; |
183 | return; |
294 | |
184 | |
295 | faces_sent[facenum] = true; |
185 | faces_sent[facenum] = true; |
296 | |
186 | |
297 | // 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, |
… | |
… | |
302 | if (fxix) |
192 | if (fxix) |
303 | { |
193 | { |
304 | fxface.push_back (facenum); |
194 | fxface.push_back (facenum); |
305 | return; |
195 | return; |
306 | } |
196 | } |
|
|
197 | |
|
|
198 | const facedata *d = f->data (faceset); |
307 | |
199 | |
308 | packet sl; |
200 | packet sl; |
309 | |
201 | |
310 | if (force_face0) |
202 | if (force_face0) |
311 | sl << "face " << uint16 (facenum); |
203 | sl << "face " << uint16 (facenum); |
… | |
… | |
318 | print_facename (sl, *d); |
210 | print_facename (sl, *d); |
319 | send_packet (sl); |
211 | send_packet (sl); |
320 | |
212 | |
321 | if (EMI_smooth) |
213 | if (EMI_smooth) |
322 | { |
214 | { |
323 | faceinfo *f = face_info (facenum); |
|
|
324 | |
|
|
325 | if (f->smooth) |
215 | if (f->smooth) |
326 | { |
216 | { |
327 | send_face (f->smooth); |
217 | send_face (f->smooth); |
328 | |
218 | |
329 | packet sl ("smooth"); |
219 | packet sl ("smooth"); |
… | |
… | |
340 | { |
230 | { |
341 | while (!fxface.empty ()) |
231 | while (!fxface.empty ()) |
342 | { |
232 | { |
343 | packet fx ("fx"); |
233 | packet fx ("fx"); |
344 | packet sx ("sx"); |
234 | packet sx ("sx"); |
|
|
235 | int type = 0; |
345 | |
236 | |
346 | do |
237 | do |
347 | { |
238 | { |
348 | faceidx facenum = fxface.back (); fxface.pop_back (); |
239 | faceidx facenum = fxface.back (); fxface.pop_back (); |
349 | |
240 | |
350 | const facedata *d = face_data (facenum, faceset); |
241 | if (const faceinfo *f = face_info (facenum)) |
351 | |
|
|
352 | if (d) |
|
|
353 | { |
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 | |
354 | fx << ber32 (facenum) |
253 | fx << ber32 (facenum) |
355 | << data8 (d->chksum, CHKSUM_SIZE); |
254 | << data8 (d->chksum, CHKSUM_SIZE); |
356 | |
255 | |
357 | if (smoothing) |
256 | if (smoothing) |
358 | { |
257 | { |
359 | faceinfo *f = face_info (facenum); |
258 | faceinfo *f = face_info (facenum); |
360 | |
259 | |
361 | if (f->smooth) |
260 | if (f->smooth) |
362 | { |
261 | { |
363 | send_face (f->smooth); |
262 | send_face (f->smooth, -110); |
|
|
263 | |
364 | sx << ber32 (facenum) |
264 | sx << ber32 (facenum) |
365 | << ber32 (f->smooth) |
265 | << ber32 (f->smooth) |
366 | << ber32 (f->smoothlevel); |
266 | << ber32 (f->smoothlevel); |
367 | } |
267 | } |
368 | } |
268 | } |
369 | } |
269 | } |
370 | } |
270 | } |
371 | while (!fxface.empty () |
271 | while (!fxface.empty () |
372 | && fx.room () > ber32::size + CHKSUM_SIZE + 1 |
272 | && fx.room () > ber32::size + CHKSUM_SIZE + 1 + 3 /* type switch */ |
373 | && sx.room () > ber32::size * 3); |
273 | && sx.room () > ber32::size * 3); |
374 | |
274 | |
375 | send_packet (fx); |
275 | send_packet (fx); |
376 | if (sx.length () > 3) send_packet (sx); |
276 | if (sx.length () > 3) send_packet (sx); |
377 | } |
277 | } |
… | |
… | |
418 | // animations look much smoother, and every client |
318 | // animations look much smoother, and every client |
419 | // is supposed to do client-side caching anyways. |
319 | // is supposed to do client-side caching anyways. |
420 | void |
320 | void |
421 | client::send_faces (object *ob) |
321 | client::send_faces (object *ob) |
422 | { |
322 | { |
423 | send_face (ob->face); |
323 | send_face (ob->face, 10); |
424 | |
324 | |
425 | if (ob->animation_id) |
325 | if (ob->animation_id) |
426 | { |
326 | { |
427 | animation &anim = animations [ob->animation_id]; |
327 | animation &anim = animations [ob->animation_id]; |
428 | |
328 | |
429 | for (int i = 0; i < anim.num_animations; i++) |
329 | for (int i = 0; i < anim.num_animations; i++) |
430 | send_face (anim.faces [i]); |
330 | send_face (anim.faces [i], -10); |
431 | } |
331 | } |
432 | } |
332 | } |
433 | |
333 | |
434 | /** |
334 | /** |
435 | * Need to send an animation sequence to the client. |
335 | * Need to send an animation sequence to the client. |
… | |
… | |
459 | /* 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 |
460 | * the face itself) down to the client. |
360 | * the face itself) down to the client. |
461 | */ |
361 | */ |
462 | for (int i = 0; i < animations[anim_num].num_animations; i++) |
362 | for (int i = 0; i < animations[anim_num].num_animations; i++) |
463 | { |
363 | { |
464 | send_face (animations[anim_num].faces[i]); |
364 | send_face (animations[anim_num].faces[i], -20); |
465 | 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 */ |
466 | } |
366 | } |
467 | |
367 | |
468 | send_packet (sl); |
368 | send_packet (sl); |
469 | |
369 | |