1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (C) 2001 Mark Wedel |
5 | * Copyright (©) 2001 Mark Wedel |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * 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, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
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 Affero GNU General Public License |
19 | * along with this program; if not, write to the Free Software |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * <http://www.gnu.org/licenses/>. |
21 | * |
21 | * |
22 | * The author can be reached via e-mail to <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | /** \file |
25 | /** \file |
26 | * Image related communication |
26 | * Image related communication |
27 | * |
27 | * |
… | |
… | |
36 | #include <global.h> |
36 | #include <global.h> |
37 | #include <sproto.h> |
37 | #include <sproto.h> |
38 | |
38 | |
39 | #include "crc.h" |
39 | #include "crc.h" |
40 | |
40 | |
41 | #define MAX_FACE_SETS 20 /**< Maximum number of image sets the program will handle */ |
41 | #define MAX_IMAGE_SIZE 10000 |
42 | |
|
|
43 | /** Information about one image */ |
|
|
44 | typedef 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 */ |
|
|
52 | typedef 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 | |
|
|
65 | static FaceSets facesets[MAX_FACE_SETS]; /**< All facesets */ |
|
|
66 | |
42 | |
67 | /** |
43 | /** |
68 | * Checks specified faceset is valid |
44 | * client requested an image. send it rate-limited |
69 | * \param fsn faceset number |
45 | * before flushing. |
70 | */ |
46 | */ |
71 | int |
|
|
72 | is_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 | */ |
|
|
82 | void |
47 | void |
83 | free_socket_images (void) |
48 | AskFaceCmd (char *buf, int len, client *ns) |
84 | { |
49 | { |
85 | int num, q; |
50 | int idx = 0, pri = 0; |
86 | |
51 | |
87 | for (num = 0; num < MAX_FACE_SETS; num++) |
52 | sscanf (buf, "%d %d", &idx, &pri); |
|
|
53 | |
|
|
54 | //TODO: somehow fetch default priority from send_fx here |
|
|
55 | |
|
|
56 | const facedata *d = face_data (idx, ns->faceset); |
|
|
57 | |
|
|
58 | if (!d) |
|
|
59 | return; // doh |
|
|
60 | |
|
|
61 | client::ixsend ix; |
|
|
62 | |
|
|
63 | ix.pri = pri; |
|
|
64 | ix.idx = idx; |
|
|
65 | ix.ofs = d->data.size (); |
|
|
66 | |
|
|
67 | auto (pos, ns->ixface.end ()); |
|
|
68 | |
|
|
69 | // the by far most common case will be to insert |
|
|
70 | // near the end, so little looping. |
|
|
71 | while (pos != ns->ixface.begin ()) |
88 | { |
72 | { |
89 | if (facesets[num].prefix) |
73 | --pos; |
|
|
74 | |
|
|
75 | // sort within 2k bins, to slightly prefer smaller images |
|
|
76 | if (pri > pos->pri || (pri == pos->pri && (ix.ofs >> 11) <= (pos->ofs >> 11))) |
90 | { |
77 | { |
91 | for (q = 0; q < faces.size (); q++) |
78 | ++pos; |
92 | if (facesets[num].faces[q].data) |
79 | break; |
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 | } |
80 | } |
102 | } |
81 | } |
103 | } |
|
|
104 | |
82 | |
105 | /** |
83 | ns->ixface.insert (pos, ix); |
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 | */ |
|
|
117 | static int |
|
|
118 | get_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 | |
84 | |
129 | if (!facesets[faceset].prefix) |
85 | #if 0 |
130 | { |
86 | for (auto (i, ns->ixface.begin ()); i != ns->ixface.end (); ++i) |
131 | LOG (llevError, "get_face_fallback called with unused set (%d)?\n", faceset); |
87 | fprintf (stderr, "<%d,%d> ", i->pri, i->ofs); |
132 | return 0; /* use default set */ |
88 | fprintf (stderr, "\n"); |
133 | } |
89 | #endif |
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 | */ |
|
|
149 | static void |
|
|
150 | check_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 |
|
|
175 | |
|
|
176 | /** |
|
|
177 | * Client tells us what type of faces it wants. Also sets |
|
|
178 | * the caching attribute. |
|
|
179 | * |
|
|
180 | */ |
|
|
181 | void |
|
|
182 | SetFaceMode (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 | |
|
|
195 | /** |
|
|
196 | * Client has requested pixmap that it somehow missed getting. |
|
|
197 | * This will be called often if the client is |
|
|
198 | * caching images. |
|
|
199 | */ |
|
|
200 | void |
|
|
201 | SendFaceCmd (char *buf, int len, client *ns) |
|
|
202 | { |
|
|
203 | ns->send_image (atoi (buf)); |
|
|
204 | } |
|
|
205 | |
|
|
206 | // how lame |
|
|
207 | static void print_facename (packet &sl, const facedata &d) |
|
|
208 | { |
|
|
209 | for (int i = 0; i < CHKSUM_SIZE; ++i) |
|
|
210 | sl.printf ("%02x", d.chksum [i]); |
|
|
211 | } |
|
|
212 | |
|
|
213 | // gcfclient uses the server-provided checksum for comparison, but always |
|
|
214 | // writes a broken checksum to its cache file, so we have to provide |
|
|
215 | // gcfclient with the same broken (and useless) checksum just to have it |
|
|
216 | // cache the image despite its bugs. |
|
|
217 | static uint32 gcfclient_checksum (const facedata *d) |
|
|
218 | { |
|
|
219 | uint32 csum = 0; |
|
|
220 | |
|
|
221 | for (std::string::const_iterator i = d->data.begin (); |
|
|
222 | i != d->data.end (); |
|
|
223 | ++i) |
|
|
224 | { |
|
|
225 | csum = rotate_right (csum); |
|
|
226 | csum += *(uint8 *)&*i; |
|
|
227 | } |
|
|
228 | |
|
|
229 | return csum; |
|
|
230 | } |
90 | } |
231 | |
91 | |
232 | /** |
92 | /** |
233 | * Sends a face to a client if they are in pixmap mode |
93 | * Sends a face to a client if they are in pixmap mode |
234 | * nothing gets sent in bitmap mode. |
94 | * nothing gets sent in bitmap mode. |
… | |
… | |
236 | * this is needed for the askface, in which we really do want to send the |
96 | * this is needed for the askface, in which we really do want to send the |
237 | * face (and askface is the only place that should be setting it). Otherwise, |
97 | * face (and askface is the only place that should be setting it). Otherwise, |
238 | * we look at the facecache, and if set, send the image name. |
98 | * we look at the facecache, and if set, send the image name. |
239 | */ |
99 | */ |
240 | void |
100 | void |
241 | client::send_face (faceidx facenum) |
101 | client::send_face (faceidx facenum, int pri) |
242 | { |
102 | { |
243 | // never send face 0. ever. it does not exist. |
103 | // never send face 0. ever. it does not exist. |
244 | if (!facenum) |
104 | if (!facenum) |
245 | return; |
105 | return; |
246 | |
106 | |
247 | const facedata *d = face_data (facenum, faceset); |
107 | faceinfo *f = face_info (facenum); |
248 | |
108 | |
249 | if (!d) |
109 | if (!f) |
250 | { |
110 | { |
251 | LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum); |
111 | LOG (llevError | logBacktrace, "client::send_face (%d) out of bounds??\n", facenum); |
252 | return; |
112 | return; |
253 | } |
113 | } |
254 | |
114 | |
255 | if (faces_sent[facenum]) |
115 | // refuse to send non-image faces |
|
|
116 | if (!fx_want [f->type]) |
256 | return; |
117 | return; |
257 | |
118 | |
|
|
119 | if (faces_sent [facenum]) |
|
|
120 | return; |
|
|
121 | |
258 | faces_sent[facenum] = true; |
122 | faces_sent[facenum] = true; |
259 | |
123 | |
260 | // if for some reason we let a client without face caching connect, |
|
|
261 | // we better support that decision here and implement it. |
|
|
262 | if (!facecache) |
|
|
263 | return send_image (facenum); |
|
|
264 | |
|
|
265 | if (fxix) |
|
|
266 | { |
|
|
267 | fxface.push_back (facenum); |
124 | fxface.push_back (facenum); |
268 | return; |
|
|
269 | } |
|
|
270 | |
|
|
271 | packet sl; |
|
|
272 | |
|
|
273 | if (force_face0) |
|
|
274 | sl << "face " << uint16 (facenum); |
|
|
275 | else if (image2) |
|
|
276 | sl << "face2 " << uint16 (facenum) << uint8 (0) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0); |
|
|
277 | else |
|
|
278 | sl << "face1 " << uint16 (facenum) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0); |
|
|
279 | |
|
|
280 | // how lame |
|
|
281 | print_facename (sl, *d); |
|
|
282 | send_packet (sl); |
|
|
283 | |
|
|
284 | if (EMI_smooth) |
|
|
285 | { |
|
|
286 | faceinfo *f = face_info (facenum); |
|
|
287 | |
|
|
288 | if (f->smooth) |
|
|
289 | { |
|
|
290 | send_face (f->smooth); |
|
|
291 | |
|
|
292 | packet sl ("smooth"); |
|
|
293 | |
|
|
294 | sl << uint16 (facenum) |
|
|
295 | << uint16 (f->smooth); |
|
|
296 | |
|
|
297 | send_packet (sl); |
|
|
298 | } |
|
|
299 | } |
|
|
300 | } |
125 | } |
301 | |
126 | |
302 | void client::flush_fx () |
127 | void client::flush_fx () |
303 | { |
128 | { |
304 | while (!fxface.empty ()) |
129 | while (!fxface.empty ()) |
305 | { |
130 | { |
306 | packet fx ("fx"); |
131 | packet fx ("fx"); |
307 | packet sx ("sx"); |
132 | packet sx ("sx"); |
|
|
133 | int type = 0; |
308 | |
134 | |
309 | do |
135 | do |
310 | { |
136 | { |
311 | faceidx facenum = fxface.back (); fxface.pop_back (); |
137 | faceidx facenum = fxface.back (); fxface.pop_back (); |
312 | |
138 | |
313 | const facedata *d = face_data (facenum, faceset); |
139 | if (const faceinfo *f = face_info (facenum)) |
314 | |
|
|
315 | if (d) |
|
|
316 | { |
140 | { |
|
|
141 | if (f->type != type) |
|
|
142 | { |
|
|
143 | type = f->type; |
|
|
144 | |
|
|
145 | fx << ber32 (0) |
|
|
146 | << uint8 (1) << uint8 (type); |
|
|
147 | } |
|
|
148 | |
|
|
149 | const facedata *d = f->data (faceset); |
|
|
150 | |
317 | fx << ber32 (facenum) |
151 | fx << ber32 (facenum) |
318 | << data8 (d->chksum, CHKSUM_SIZE); |
152 | << data8 (d->chksum, d->chksum_len); |
319 | |
153 | |
320 | if (smoothing) |
154 | if (smoothing) |
321 | { |
155 | { |
322 | faceinfo *f = face_info (facenum); |
156 | faceinfo *f = face_info (facenum); |
323 | |
157 | |
324 | if (f->smooth) |
158 | if (f->smooth) |
325 | { |
159 | { |
326 | send_face (f->smooth); |
160 | send_face (f->smooth, -110); |
|
|
161 | |
327 | sx << ber32 (facenum) |
162 | sx << ber32 (facenum) |
328 | << ber32 (f->smooth) |
163 | << ber32 (f->smooth) |
329 | << ber32 (f->smoothlevel); |
164 | << ber32 (f->smoothlevel); |
330 | } |
165 | } |
331 | } |
166 | } |
332 | } |
167 | } |
333 | } |
168 | } |
334 | while (!fxface.empty () |
169 | while (!fxface.empty () |
335 | && fx.room () > ber32::size + CHKSUM_SIZE + 1 |
170 | && fx.room () > ber32::size + CHKSUM_MAXLEN + 1 + 3 /* type switch */ |
336 | && sx.room () > ber32::size * 3); |
171 | && sx.room () > ber32::size * 3); |
337 | |
172 | |
338 | send_packet (fx); |
173 | send_packet (fx); |
339 | if (sx.length () > 3) send_packet (sx); |
174 | if (sx.length () > 3) send_packet (sx); |
340 | } |
175 | } |
341 | } |
|
|
342 | |
|
|
343 | void |
|
|
344 | client::send_image (faceidx facenum) |
|
|
345 | { |
|
|
346 | // never send face 0. ever. it does not exist. |
|
|
347 | if (!facenum) |
|
|
348 | return; |
|
|
349 | |
|
|
350 | const facedata *d = face_data (facenum, faceset); |
|
|
351 | |
|
|
352 | if (!d) |
|
|
353 | { |
|
|
354 | LOG (llevError, "client::send_image (%d) out of bounds??\n", facenum); |
|
|
355 | return; |
|
|
356 | } |
|
|
357 | |
|
|
358 | faces_sent[facenum] = true; |
|
|
359 | |
|
|
360 | if (force_image_newmap) |
|
|
361 | force_newmap = true; |
|
|
362 | |
|
|
363 | packet sl; |
|
|
364 | |
|
|
365 | sl << (image2 ? "image2 " : "image ") |
|
|
366 | << uint32 (facenum); |
|
|
367 | |
|
|
368 | if (image2) |
|
|
369 | sl << uint8 (0); |
|
|
370 | |
|
|
371 | sl << uint32 (d->data.size ()) |
|
|
372 | << data (d->data.data (), d->data.size ()); |
|
|
373 | |
|
|
374 | send_packet (sl); |
|
|
375 | } |
176 | } |
376 | |
177 | |
377 | // send all faces of this object to the client |
178 | // send all faces of this object to the client |
378 | // this uses more bandwidth initially, but makes |
179 | // this uses more bandwidth initially, but makes |
379 | // animations look much smoother, and every client |
180 | // animations look much smoother, and every client |
380 | // is supposed to do client-side caching anyways. |
181 | // is supposed to do client-side caching anyways. |
381 | void |
182 | void |
382 | client::send_faces (object *ob) |
183 | client::send_faces (object *ob) |
383 | { |
184 | { |
384 | send_face (ob->face); |
185 | send_face (ob->face, 10); |
385 | |
186 | |
386 | if (ob->animation_id) |
187 | if (ob->animation_id) |
387 | { |
188 | { |
388 | animation &anim = animations [ob->animation_id]; |
189 | const animation &anim = ob->anim (); |
389 | |
190 | |
390 | for (int i = 0; i < anim.num_animations; i++) |
191 | for (int i = 0; i < anim.num_animations; i++) |
391 | send_face (anim.faces [i]); |
192 | send_face (anim.faces [i], -10); |
392 | } |
193 | } |
393 | } |
194 | } |
394 | |
195 | |
395 | /** |
196 | /** |
396 | * Need to send an animation sequence to the client. |
197 | * Need to send an animation sequence to the client. |
… | |
… | |
401 | */ |
202 | */ |
402 | void |
203 | void |
403 | client::send_animation (short anim_num) |
204 | client::send_animation (short anim_num) |
404 | { |
205 | { |
405 | /* Do some checking on the anim_num we got. Note that the animations |
206 | /* Do some checking on the anim_num we got. Note that the animations |
406 | * are added in contigous order, so if the number is in the valid |
207 | * are added in contiguous order, so if the number is in the valid |
407 | * range, it must be a valid animation. |
208 | * range, it must be a valid animation. |
408 | */ |
209 | */ |
409 | if (anim_num < 0 || anim_num >= animations.size ()) |
210 | if (anim_num < 0 || anim_num >= animations.size ()) |
410 | { |
211 | { |
411 | LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); |
212 | LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); |
… | |
… | |
420 | /* Build up the list of faces. Also, send any information (ie, the |
221 | /* Build up the list of faces. Also, send any information (ie, the |
421 | * the face itself) down to the client. |
222 | * the face itself) down to the client. |
422 | */ |
223 | */ |
423 | for (int i = 0; i < animations[anim_num].num_animations; i++) |
224 | for (int i = 0; i < animations[anim_num].num_animations; i++) |
424 | { |
225 | { |
425 | send_face (animations[anim_num].faces[i]); |
226 | send_face (animations[anim_num].faces[i], -20); |
426 | sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ |
227 | sl << uint16 (animations[anim_num].faces[i]); |
427 | } |
228 | } |
428 | |
229 | |
429 | send_packet (sl); |
230 | send_packet (sl); |
430 | |
231 | |
431 | anims_sent[anim_num] = 1; |
232 | anims_sent[anim_num] = 1; |
432 | } |
233 | } |
433 | |
234 | |
434 | /** |
|
|
435 | * Sends the number of images, checksum of the face file, |
|
|
436 | * and the image_info file information. See the doc/Developers/protocol |
|
|
437 | * if you want further detail. |
|
|
438 | */ |
|
|
439 | void |
235 | void |
440 | send_image_info (client *ns, char *params) |
236 | client::invalidate_face (faceidx idx) |
441 | { |
237 | { |
442 | packet sl; |
238 | faces_sent [idx] = false; |
443 | |
239 | force_newmap = true; |
444 | //TODO: second parameter is a checksum, but it makes no sense in this current framework |
|
|
445 | sl.printf ("replyinfo image_info\n%d\n%u\n", MAX_FACES, 0); |
|
|
446 | |
|
|
447 | sl << "0:base:standard:0:32x32:none:The old 32x32 faceset.\n"; |
|
|
448 | |
|
|
449 | ns->send_packet (sl); |
|
|
450 | } |
240 | } |
451 | |
241 | |
452 | /** |
|
|
453 | * Sends requested face information. |
|
|
454 | * \param ns socket to send to |
|
|
455 | * \param params contains first and last index of face |
|
|
456 | * |
|
|
457 | * For each image in [start..stop] sends |
|
|
458 | * - checksum |
|
|
459 | * - name |
|
|
460 | */ |
|
|
461 | void |
242 | void |
462 | send_image_sums (client *ns, char *params) |
243 | client::invalidate_all_faces () |
463 | { |
244 | { |
464 | int start, stop; |
245 | faces_sent.reset (); |
465 | char *cp; |
246 | force_newmap = true; |
466 | |
|
|
467 | packet sl; |
|
|
468 | |
|
|
469 | start = atoi (params); |
|
|
470 | for (cp = params; *cp != '\0'; cp++) |
|
|
471 | if (*cp == ' ') |
|
|
472 | break; |
|
|
473 | |
|
|
474 | stop = atoi (cp); |
|
|
475 | if (stop < start || *cp == '\0' || (stop - start) > 1000 || stop >= MAX_FACES) |
|
|
476 | { |
|
|
477 | sl.printf ("replyinfo image_sums %d %d", start, stop); |
|
|
478 | ns->send_packet (sl); |
|
|
479 | sl.reset (); |
|
|
480 | return; |
|
|
481 | } |
|
|
482 | |
|
|
483 | sl.printf ("replyinfo image_sums %d %d ", start, stop); |
|
|
484 | |
|
|
485 | for (int i = start; i <= stop && i < faces.size (); i++) |
|
|
486 | { |
|
|
487 | ns->faces_sent[i] = true; |
|
|
488 | |
|
|
489 | const facedata *d = face_data (i, ns->faceset); |
|
|
490 | |
|
|
491 | if (sl.room () < 2 + 4 + 1 + d->data.size () + 1) |
|
|
492 | break; |
|
|
493 | |
|
|
494 | sl << uint16 (i) |
|
|
495 | << uint32 (0) // checksum |
|
|
496 | << uint8 (ns->faceset); |
|
|
497 | |
|
|
498 | print_facename (sl, *d); sl << uint8 (0); |
|
|
499 | } |
|
|
500 | |
|
|
501 | /* It would make more sense to catch this pre-emptively in the code above. |
|
|
502 | * however, if this really happens, we probably just want to cut down the |
|
|
503 | * size to less than 1000, since that is what we claim the protocol would |
|
|
504 | * support. |
|
|
505 | */ |
|
|
506 | //TODO: taken care of above, should simply abort or make sure the above code is correct |
|
|
507 | if (sl.length () >= MAXSOCKBUF) |
|
|
508 | { |
|
|
509 | LOG (llevError, "send_image_send: buffer overrun, %d > %d\n", sl.length (), MAXSOCKBUF); |
|
|
510 | abort (); |
|
|
511 | } |
|
|
512 | |
|
|
513 | ns->send_packet (sl); |
|
|
514 | } |
247 | } |
515 | |
248 | |