| 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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 | * Copyright (C) 2001 Mark Wedel |
5 | * Copyright (©) 2001,2007 Mark Wedel |
| 6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 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_face (atoi (buf), 1); |
|
|
| 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, |
|
|
| 214 | // but always wrotes a broken checksum to its cache file, so we |
|
|
| 215 | // have to provide gcfclient with a useless checksum just to |
|
|
| 216 | // have to 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, bool forced) |
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 | packet sl; |
115 | // refuse to send non-image faces |
|
|
116 | if (!fx_want [f->type]) |
|
|
117 | return; |
| 256 | |
118 | |
| 257 | if (facecache && !forced) |
|
|
| 258 | { |
|
|
| 259 | if (faces_sent[facenum]) |
119 | if (faces_sent [facenum]) |
| 260 | return; |
120 | return; |
| 261 | |
121 | |
| 262 | faces_sent[facenum] = true; |
122 | faces_sent[facenum] = true; |
| 263 | |
123 | |
| 264 | if (force_face0) |
124 | fxface.push_back (facenum); |
| 265 | sl << "face " << uint16 (facenum); |
125 | } |
| 266 | else if (image2) |
|
|
| 267 | sl << "face2 " << uint16 (facenum) << uint8 (0) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0); |
|
|
| 268 | else |
|
|
| 269 | sl << "face1 " << uint16 (facenum) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0); |
|
|
| 270 | |
126 | |
| 271 | // how lame |
127 | void client::flush_fx () |
| 272 | print_facename (sl, *d); |
128 | { |
| 273 | send_packet (sl); |
129 | while (!fxface.empty ()) |
|
|
130 | { |
|
|
131 | packet fx ("fx"); |
|
|
132 | packet sx ("sx"); |
|
|
133 | int type = 0; |
| 274 | |
134 | |
| 275 | faceinfo *f = face_info (facenum); |
135 | do |
| 276 | if (f->smooth && EMI_smooth) |
|
|
| 277 | { |
136 | { |
|
|
137 | faceidx facenum = fxface.back (); fxface.pop_back (); |
|
|
138 | |
|
|
139 | if (const faceinfo *f = face_info (facenum)) |
|
|
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 | |
|
|
151 | fx << ber32 (facenum) |
|
|
152 | << data8 (d->chksum, CHKSUM_SIZE); |
|
|
153 | |
|
|
154 | if (smoothing) |
|
|
155 | { |
|
|
156 | faceinfo *f = face_info (facenum); |
|
|
157 | |
|
|
158 | if (f->smooth) |
|
|
159 | { |
| 278 | send_face (f->smooth); |
160 | send_face (f->smooth, -110); |
| 279 | |
161 | |
| 280 | packet sl ("smooth"); |
162 | sx << ber32 (facenum) |
| 281 | |
163 | << ber32 (f->smooth) |
| 282 | sl << uint16 (facenum) |
164 | << ber32 (f->smoothlevel); |
| 283 | << uint16 (f->smooth); |
165 | } |
| 284 | |
166 | } |
| 285 | send_packet (sl); |
167 | } |
| 286 | } |
168 | } |
| 287 | } |
169 | while (!fxface.empty () |
| 288 | else |
170 | && fx.room () > ber32::size + CHKSUM_SIZE + 1 + 3 /* type switch */ |
| 289 | { |
171 | && sx.room () > ber32::size * 3); |
| 290 | sl << (image2 ? "image2 " : "image ") |
|
|
| 291 | << uint32 (facenum); |
|
|
| 292 | |
172 | |
| 293 | if (image2) |
|
|
| 294 | sl << uint8 (0); |
|
|
| 295 | |
|
|
| 296 | sl << uint32 (d->data.size ()) |
|
|
| 297 | << data (d->data.data (), d->data.size ()); |
|
|
| 298 | |
|
|
| 299 | send_packet (sl); |
173 | send_packet (fx); |
|
|
174 | if (sx.length () > 3) send_packet (sx); |
| 300 | } |
175 | } |
| 301 | } |
176 | } |
| 302 | |
177 | |
| 303 | // send all faces of this object to the client |
178 | // send all faces of this object to the client |
| 304 | // this uses more bandwidth initially, but makes |
179 | // this uses more bandwidth initially, but makes |
| 305 | // animations look much smoother, and every client |
180 | // animations look much smoother, and every client |
| 306 | // is supposed to do client-side caching anyways. |
181 | // is supposed to do client-side caching anyways. |
| 307 | void |
182 | void |
| 308 | client::send_faces (object *ob) |
183 | client::send_faces (object *ob) |
| 309 | { |
184 | { |
| 310 | send_face (ob->face); |
185 | send_face (ob->face, 10); |
| 311 | |
186 | |
| 312 | if (ob->animation_id) |
187 | if (ob->animation_id) |
| 313 | { |
188 | { |
| 314 | animation &anim = animations [ob->animation_id]; |
189 | const animation &anim = ob->anim (); |
| 315 | |
190 | |
| 316 | for (int i = 0; i < anim.num_animations; i++) |
191 | for (int i = 0; i < anim.num_animations; i++) |
| 317 | send_face (anim.faces [i]); |
192 | send_face (anim.faces [i], -10); |
| 318 | } |
193 | } |
| 319 | } |
194 | } |
| 320 | |
195 | |
| 321 | /** |
196 | /** |
| 322 | * Need to send an animation sequence to the client. |
197 | * Need to send an animation sequence to the client. |
| … | |
… | |
| 327 | */ |
202 | */ |
| 328 | void |
203 | void |
| 329 | client::send_animation (short anim_num) |
204 | client::send_animation (short anim_num) |
| 330 | { |
205 | { |
| 331 | /* 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 |
| 332 | * 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 |
| 333 | * range, it must be a valid animation. |
208 | * range, it must be a valid animation. |
| 334 | */ |
209 | */ |
| 335 | if (anim_num < 0 || anim_num > num_animations) |
210 | if (anim_num < 0 || anim_num >= animations.size ()) |
| 336 | { |
211 | { |
| 337 | 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); |
| 338 | return; |
213 | return; |
| 339 | } |
214 | } |
| 340 | |
215 | |
| … | |
… | |
| 346 | /* 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 |
| 347 | * the face itself) down to the client. |
222 | * the face itself) down to the client. |
| 348 | */ |
223 | */ |
| 349 | for (int i = 0; i < animations[anim_num].num_animations; i++) |
224 | for (int i = 0; i < animations[anim_num].num_animations; i++) |
| 350 | { |
225 | { |
| 351 | send_face (animations[anim_num].faces[i]); |
226 | send_face (animations[anim_num].faces[i], -20); |
| 352 | sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ |
227 | sl << uint16 (animations[anim_num].faces[i]); |
| 353 | } |
228 | } |
| 354 | |
229 | |
| 355 | send_packet (sl); |
230 | send_packet (sl); |
| 356 | |
231 | |
| 357 | anims_sent[anim_num] = 1; |
232 | anims_sent[anim_num] = 1; |
| 358 | } |
233 | } |
| 359 | |
234 | |
| 360 | /** |
|
|
| 361 | * Sends the number of images, checksum of the face file, |
|
|
| 362 | * and the image_info file information. See the doc/Developers/protocol |
|
|
| 363 | * if you want further detail. |
|
|
| 364 | */ |
|
|
| 365 | void |
|
|
| 366 | send_image_info (client *ns, char *params) |
|
|
| 367 | { |
|
|
| 368 | packet sl; |
|
|
| 369 | |
|
|
| 370 | //TODO: second parameter is a checksum, but it makes no sense in this current framework |
|
|
| 371 | sl.printf ("replyinfo image_info\n%d\n%u\n", MAX_FACES, 0); |
|
|
| 372 | |
|
|
| 373 | sl << "0:base:standard:0:32x32:none:The old 32x32 faceset.\n"; |
|
|
| 374 | |
|
|
| 375 | ns->send_packet (sl); |
|
|
| 376 | } |
|
|
| 377 | |
|
|
| 378 | /** |
|
|
| 379 | * Sends requested face information. |
|
|
| 380 | * \param ns socket to send to |
|
|
| 381 | * \param params contains first and last index of face |
|
|
| 382 | * |
|
|
| 383 | * For each image in [start..stop] sends |
|
|
| 384 | * - checksum |
|
|
| 385 | * - name |
|
|
| 386 | */ |
|
|
| 387 | void |
|
|
| 388 | send_image_sums (client *ns, char *params) |
|
|
| 389 | { |
|
|
| 390 | int start, stop; |
|
|
| 391 | char *cp; |
|
|
| 392 | |
|
|
| 393 | packet sl; |
|
|
| 394 | |
|
|
| 395 | start = atoi (params); |
|
|
| 396 | for (cp = params; *cp != '\0'; cp++) |
|
|
| 397 | if (*cp == ' ') |
|
|
| 398 | break; |
|
|
| 399 | |
|
|
| 400 | stop = atoi (cp); |
|
|
| 401 | if (stop < start || *cp == '\0' || (stop - start) > 1000 || stop >= MAX_FACES) |
|
|
| 402 | { |
|
|
| 403 | sl.printf ("replyinfo image_sums %d %d", start, stop); |
|
|
| 404 | ns->send_packet (sl); |
|
|
| 405 | sl.reset (); |
|
|
| 406 | return; |
|
|
| 407 | } |
|
|
| 408 | |
|
|
| 409 | sl.printf ("replyinfo image_sums %d %d ", start, stop); |
|
|
| 410 | |
|
|
| 411 | for (int i = start; i <= stop && i < faces.size (); i++) |
|
|
| 412 | { |
|
|
| 413 | ns->faces_sent[i] = true; |
|
|
| 414 | |
|
|
| 415 | const facedata *d = face_data (i, ns->faceset); |
|
|
| 416 | |
|
|
| 417 | if (sl.room () < 2 + 4 + 1 + d->data.size () + 1) |
|
|
| 418 | break; |
|
|
| 419 | |
|
|
| 420 | sl << uint16 (i) |
|
|
| 421 | << uint32 (0) // checksum |
|
|
| 422 | << uint8 (ns->faceset); |
|
|
| 423 | |
|
|
| 424 | print_facename (sl, *d); sl << uint8 (0); |
|
|
| 425 | } |
|
|
| 426 | |
|
|
| 427 | /* It would make more sense to catch this pre-emptively in the code above. |
|
|
| 428 | * however, if this really happens, we probably just want to cut down the |
|
|
| 429 | * size to less than 1000, since that is what we claim the protocol would |
|
|
| 430 | * support. |
|
|
| 431 | */ |
|
|
| 432 | //TODO: taken care of above, should simply abort or make sure the above code is correct |
|
|
| 433 | if (sl.length () >= MAXSOCKBUF) |
|
|
| 434 | { |
|
|
| 435 | LOG (llevError, "send_image_send: buffer overrun, %d > %d\n", sl.length (), MAXSOCKBUF); |
|
|
| 436 | abort (); |
|
|
| 437 | } |
|
|
| 438 | |
|
|
| 439 | ns->send_packet (sl); |
|
|
| 440 | } |
|
|
| 441 | |
|
|
