| 1 | /* |
1 | /* |
| 2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
| 3 | * |
3 | * |
| 4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 | * Copyright (©) 2001,2007 Mark Wedel |
5 | * Copyright (©) 2001 Mark Wedel |
| 6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
| 7 | * |
7 | * |
| 8 | * Deliantra 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 3 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, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
| 20 | * |
21 | * |
| 21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
| 22 | */ |
23 | */ |
| 23 | |
24 | |
| 24 | /** \file |
25 | /** \file |
| … | |
… | |
| 38 | #include "crc.h" |
39 | #include "crc.h" |
| 39 | |
40 | |
| 40 | #define MAX_IMAGE_SIZE 10000 |
41 | #define MAX_IMAGE_SIZE 10000 |
| 41 | |
42 | |
| 42 | /** |
43 | /** |
| 43 | * Client tells us what type of faces it wants. Also sets |
|
|
| 44 | * the caching attribute. |
|
|
| 45 | * |
|
|
| 46 | */ |
|
|
| 47 | void |
|
|
| 48 | SetFaceMode (char *buf, int len, client *ns) |
|
|
| 49 | { |
|
|
| 50 | int mask = (atoi (buf) & CF_FACE_CACHE), mode = (atoi (buf) & ~CF_FACE_CACHE); |
|
|
| 51 | |
|
|
| 52 | if (mode == CF_FACE_NONE) |
|
|
| 53 | ns->facecache = 1; |
|
|
| 54 | else if (mode != CF_FACE_PNG) |
|
|
| 55 | ns->send_packet_printf ("drawinfo %d %s", NDI_RED, "Warning - send unsupported face mode. Will use Png"); |
|
|
| 56 | |
|
|
| 57 | if (mask) |
|
|
| 58 | ns->facecache = 1; |
|
|
| 59 | } |
|
|
| 60 | |
|
|
| 61 | /** |
|
|
| 62 | * client requested an image. send it rate-limited |
44 | * client requested an image. send it rate-limited |
| 63 | * before flushing. |
45 | * before flushing. |
| 64 | */ |
46 | */ |
| 65 | void |
47 | void |
| 66 | AskFaceCmd (char *buf, int len, client *ns) |
48 | AskFaceCmd (char *buf, int len, client *ns) |
| … | |
… | |
| 82 | ix.idx = idx; |
64 | ix.idx = idx; |
| 83 | ix.ofs = d->data.size (); |
65 | ix.ofs = d->data.size (); |
| 84 | |
66 | |
| 85 | auto (pos, ns->ixface.end ()); |
67 | auto (pos, ns->ixface.end ()); |
| 86 | |
68 | |
| 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 | { |
|
|
| 96 | // the by far most common case will be to insert |
69 | // the by far most common case will be to insert |
| 97 | // near the end, so little looping. |
70 | // near the end, so little looping. |
| 98 | while (pos != ns->ixface.begin ()) |
71 | while (pos != ns->ixface.begin ()) |
|
|
72 | { |
|
|
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))) |
| 99 | { |
77 | { |
| 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; |
78 | ++pos; |
| 106 | break; |
79 | break; |
| 107 | } |
|
|
| 108 | } |
80 | } |
| 109 | } |
81 | } |
| 110 | |
82 | |
| 111 | ns->ixface.insert (pos, ix); |
83 | ns->ixface.insert (pos, ix); |
| 112 | |
84 | |
| 113 | #if 0 |
85 | #if 0 |
| 114 | for (auto (i, ns->ixface.begin ()); i != ns->ixface.end (); ++i) |
86 | for (auto (i, ns->ixface.begin ()); i != ns->ixface.end (); ++i) |
| 115 | fprintf (stderr, "<%d,%d> ", i->pri, i->ofs); |
87 | fprintf (stderr, "<%d,%d> ", i->pri, i->ofs); |
| 116 | fprintf (stderr, "\n"); |
88 | fprintf (stderr, "\n"); |
| 117 | #endif |
89 | #endif |
| 118 | } |
|
|
| 119 | |
|
|
| 120 | /** |
|
|
| 121 | * Tells client the picture it has to use |
|
|
| 122 | * to smooth a picture number given as argument. |
|
|
| 123 | */ |
|
|
| 124 | void |
|
|
| 125 | AskSmooth (char *buf, int len, client *ns) |
|
|
| 126 | { |
|
|
| 127 | ns->send_face (atoi (buf), -100); |
|
|
| 128 | ns->flush_fx (); |
|
|
| 129 | } |
|
|
| 130 | |
|
|
| 131 | // how lame |
|
|
| 132 | static void print_facename (packet &sl, const facedata &d) |
|
|
| 133 | { |
|
|
| 134 | for (int i = 0; i < CHKSUM_SIZE; ++i) |
|
|
| 135 | sl.printf ("%02x", d.chksum [i]); |
|
|
| 136 | } |
|
|
| 137 | |
|
|
| 138 | // gcfclient uses the server-provided checksum for comparison, but always |
|
|
| 139 | // writes a broken checksum to its cache file, so we have to provide |
|
|
| 140 | // gcfclient with the same broken (and useless) checksum just to have it |
|
|
| 141 | // cache the image despite its bugs. |
|
|
| 142 | static uint32 gcfclient_checksum (const facedata *d) |
|
|
| 143 | { |
|
|
| 144 | uint32 csum = 0; |
|
|
| 145 | |
|
|
| 146 | for (std::string::const_iterator i = d->data.begin (); |
|
|
| 147 | i != d->data.end (); |
|
|
| 148 | ++i) |
|
|
| 149 | { |
|
|
| 150 | csum = rotate_right (csum); |
|
|
| 151 | csum += *(uint8 *)&*i; |
|
|
| 152 | } |
|
|
| 153 | |
|
|
| 154 | return csum; |
|
|
| 155 | } |
90 | } |
| 156 | |
91 | |
| 157 | /** |
92 | /** |
| 158 | * 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 |
| 159 | * nothing gets sent in bitmap mode. |
94 | * nothing gets sent in bitmap mode. |
| … | |
… | |
| 184 | if (faces_sent [facenum]) |
119 | if (faces_sent [facenum]) |
| 185 | return; |
120 | return; |
| 186 | |
121 | |
| 187 | faces_sent[facenum] = true; |
122 | faces_sent[facenum] = true; |
| 188 | |
123 | |
| 189 | // if for some reason we let a client without face caching connect, |
|
|
| 190 | // we better support that decision here and implement it. |
|
|
| 191 | if (!facecache) |
|
|
| 192 | return send_image (facenum); |
|
|
| 193 | |
|
|
| 194 | if (fxix) |
|
|
| 195 | { |
|
|
| 196 | fxface.push_back (facenum); |
124 | fxface.push_back (facenum); |
| 197 | return; |
|
|
| 198 | } |
|
|
| 199 | |
|
|
| 200 | const facedata *d = f->data (faceset); |
|
|
| 201 | |
|
|
| 202 | packet sl; |
|
|
| 203 | |
|
|
| 204 | if (force_face0) |
|
|
| 205 | sl << "face " << uint16 (facenum); |
|
|
| 206 | else if (image2) |
|
|
| 207 | sl << "face2 " << uint16 (facenum) << uint8 (0) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0); |
|
|
| 208 | else |
|
|
| 209 | sl << "face1 " << uint16 (facenum) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0); |
|
|
| 210 | |
|
|
| 211 | // how lame |
|
|
| 212 | print_facename (sl, *d); |
|
|
| 213 | send_packet (sl); |
|
|
| 214 | } |
125 | } |
| 215 | |
126 | |
| 216 | void client::flush_fx () |
127 | void client::flush_fx () |
| 217 | { |
128 | { |
| 218 | while (!fxface.empty ()) |
129 | while (!fxface.empty ()) |
| … | |
… | |
| 236 | } |
147 | } |
| 237 | |
148 | |
| 238 | const facedata *d = f->data (faceset); |
149 | const facedata *d = f->data (faceset); |
| 239 | |
150 | |
| 240 | fx << ber32 (facenum) |
151 | fx << ber32 (facenum) |
| 241 | << data8 (d->chksum, CHKSUM_SIZE); |
152 | << data8 (d->chksum, d->chksum_len); |
| 242 | |
153 | |
| 243 | if (smoothing) |
154 | if (smoothing) |
| 244 | { |
155 | { |
| 245 | faceinfo *f = face_info (facenum); |
156 | faceinfo *f = face_info (facenum); |
| 246 | |
157 | |
| … | |
… | |
| 254 | } |
165 | } |
| 255 | } |
166 | } |
| 256 | } |
167 | } |
| 257 | } |
168 | } |
| 258 | while (!fxface.empty () |
169 | while (!fxface.empty () |
| 259 | && fx.room () > ber32::size + CHKSUM_SIZE + 1 + 3 /* type switch */ |
170 | && fx.room () > ber32::size + CHKSUM_MAXLEN + 1 + 3 /* type switch */ |
| 260 | && sx.room () > ber32::size * 3); |
171 | && sx.room () > ber32::size * 3); |
| 261 | |
172 | |
| 262 | send_packet (fx); |
173 | send_packet (fx); |
| 263 | if (sx.length () > 3) send_packet (sx); |
174 | if (sx.length () > 3) send_packet (sx); |
| 264 | } |
175 | } |
| 265 | } |
|
|
| 266 | |
|
|
| 267 | void |
|
|
| 268 | client::send_image (faceidx facenum) |
|
|
| 269 | { |
|
|
| 270 | // never send face 0. ever. it does not exist. |
|
|
| 271 | if (!facenum) |
|
|
| 272 | return; |
|
|
| 273 | |
|
|
| 274 | const facedata *d = face_data (facenum, faceset); |
|
|
| 275 | |
|
|
| 276 | faces_sent[facenum] = true; |
|
|
| 277 | |
|
|
| 278 | if (!d) |
|
|
| 279 | { |
|
|
| 280 | LOG (llevError, "client::send_image (%d) out of bounds??\n", facenum); |
|
|
| 281 | return; |
|
|
| 282 | } |
|
|
| 283 | |
|
|
| 284 | if (force_image_newmap) |
|
|
| 285 | force_newmap = true; |
|
|
| 286 | |
|
|
| 287 | packet sl; |
|
|
| 288 | |
|
|
| 289 | sl << (image2 ? "image2 " : "image ") |
|
|
| 290 | << uint32 (facenum); |
|
|
| 291 | |
|
|
| 292 | if (image2) |
|
|
| 293 | sl << uint8 (0); |
|
|
| 294 | |
|
|
| 295 | sl << uint32 (d->data.size ()) |
|
|
| 296 | << data (d->data.data (), d->data.size ()); |
|
|
| 297 | |
|
|
| 298 | send_packet (sl); |
|
|
| 299 | } |
176 | } |
| 300 | |
177 | |
| 301 | // send all faces of this object to the client |
178 | // send all faces of this object to the client |
| 302 | // this uses more bandwidth initially, but makes |
179 | // this uses more bandwidth initially, but makes |
| 303 | // animations look much smoother, and every client |
180 | // animations look much smoother, and every client |
| … | |
… | |
| 307 | { |
184 | { |
| 308 | send_face (ob->face, 10); |
185 | send_face (ob->face, 10); |
| 309 | |
186 | |
| 310 | if (ob->animation_id) |
187 | if (ob->animation_id) |
| 311 | { |
188 | { |
| 312 | animation &anim = animations [ob->animation_id]; |
189 | const animation &anim = ob->anim (); |
| 313 | |
190 | |
| 314 | for (int i = 0; i < anim.num_animations; i++) |
191 | for (int i = 0; i < anim.num_animations; i++) |
| 315 | send_face (anim.faces [i], -10); |
192 | send_face (anim.faces [i], -10); |
| 316 | } |
193 | } |
| 317 | } |
194 | } |
| … | |
… | |
| 325 | */ |
202 | */ |
| 326 | void |
203 | void |
| 327 | client::send_animation (short anim_num) |
204 | client::send_animation (short anim_num) |
| 328 | { |
205 | { |
| 329 | /* 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 |
| 330 | * 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 |
| 331 | * range, it must be a valid animation. |
208 | * range, it must be a valid animation. |
| 332 | */ |
209 | */ |
| 333 | if (anim_num < 0 || anim_num >= animations.size ()) |
210 | if (anim_num < 0 || anim_num >= animations.size ()) |
| 334 | { |
211 | { |
| 335 | 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); |
| … | |
… | |
| 345 | * the face itself) down to the client. |
222 | * the face itself) down to the client. |
| 346 | */ |
223 | */ |
| 347 | for (int i = 0; i < animations[anim_num].num_animations; i++) |
224 | for (int i = 0; i < animations[anim_num].num_animations; i++) |
| 348 | { |
225 | { |
| 349 | send_face (animations[anim_num].faces[i], -20); |
226 | send_face (animations[anim_num].faces[i], -20); |
| 350 | sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ |
227 | sl << uint16 (animations[anim_num].faces[i]); |
| 351 | } |
228 | } |
| 352 | |
229 | |
| 353 | send_packet (sl); |
230 | send_packet (sl); |
| 354 | |
231 | |
| 355 | anims_sent[anim_num] = 1; |
232 | anims_sent[anim_num] = 1; |
| 356 | } |
233 | } |
| 357 | |
234 | |
| 358 | /** |
|
|
| 359 | * Sends the number of images, checksum of the face file, |
|
|
| 360 | * and the image_info file information. See the doc/Developers/protocol |
|
|
| 361 | * if you want further detail. |
|
|
| 362 | */ |
|
|
| 363 | void |
235 | void |
| 364 | send_image_info (client *ns, char *params) |
236 | client::invalidate_face (faceidx idx) |
| 365 | { |
237 | { |
| 366 | packet sl; |
238 | faces_sent [idx] = false; |
| 367 | |
239 | force_newmap = true; |
| 368 | //TODO: second parameter is a checksum, but it makes no sense in this current framework |
|
|
| 369 | sl.printf ("replyinfo image_info\n%d\n%u\n", MAX_FACES, 0); |
|
|
| 370 | |
|
|
| 371 | sl << "0:base:standard:0:32x32:none:The old 32x32 faceset.\n"; |
|
|
| 372 | |
|
|
| 373 | ns->send_packet (sl); |
|
|
| 374 | } |
240 | } |
| 375 | |
241 | |
| 376 | /** |
|
|
| 377 | * Sends requested face information. |
|
|
| 378 | * \param ns socket to send to |
|
|
| 379 | * \param params contains first and last index of face |
|
|
| 380 | * |
|
|
| 381 | * For each image in [start..stop] sends |
|
|
| 382 | * - checksum |
|
|
| 383 | * - name |
|
|
| 384 | */ |
|
|
| 385 | void |
242 | void |
| 386 | send_image_sums (client *ns, char *params) |
243 | client::invalidate_all_faces () |
| 387 | { |
244 | { |
| 388 | int start, stop; |
245 | faces_sent.reset (); |
| 389 | char *cp; |
246 | force_newmap = true; |
| 390 | |
|
|
| 391 | packet sl; |
|
|
| 392 | |
|
|
| 393 | start = atoi (params); |
|
|
| 394 | for (cp = params; *cp != '\0'; cp++) |
|
|
| 395 | if (*cp == ' ') |
|
|
| 396 | break; |
|
|
| 397 | |
|
|
| 398 | stop = atoi (cp); |
|
|
| 399 | if (stop < start || *cp == '\0' || (stop - start) > 1000 || stop >= MAX_FACES) |
|
|
| 400 | { |
|
|
| 401 | sl.printf ("replyinfo image_sums %d %d", start, stop); |
|
|
| 402 | ns->send_packet (sl); |
|
|
| 403 | sl.reset (); |
|
|
| 404 | return; |
|
|
| 405 | } |
|
|
| 406 | |
|
|
| 407 | sl.printf ("replyinfo image_sums %d %d ", start, stop); |
|
|
| 408 | |
|
|
| 409 | for (int i = start; i <= stop && i < faces.size (); i++) |
|
|
| 410 | if (const faceinfo *f = face_info (i)) |
|
|
| 411 | if (ns->fx_want [f->type]) |
|
|
| 412 | { |
|
|
| 413 | ns->faces_sent[i] = true; |
|
|
| 414 | |
|
|
| 415 | const facedata *d = f->data (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 | } |
247 | } |
| 441 | |
248 | |
