1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel |
5 | * Copyright (©) 2001,2007 Mark Wedel |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
9 | * it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * (at your option) any later version. |
11 | * (at your 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, |
… | |
… | |
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 GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * |
20 | * |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
22 | */ |
23 | |
23 | |
24 | /** \file |
24 | /** \file |
25 | * Image related communication |
25 | * Image related communication |
26 | * |
26 | * |
… | |
… | |
38 | #include "crc.h" |
38 | #include "crc.h" |
39 | |
39 | |
40 | #define MAX_IMAGE_SIZE 10000 |
40 | #define MAX_IMAGE_SIZE 10000 |
41 | |
41 | |
42 | /** |
42 | /** |
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 |
43 | * client requested an image. send it rate-limited |
63 | * before flushing. |
44 | * before flushing. |
64 | */ |
45 | */ |
65 | void |
46 | void |
66 | AskFaceCmd (char *buf, int len, client *ns) |
47 | AskFaceCmd (char *buf, int len, client *ns) |
67 | { |
48 | { |
68 | int idx = 0, pri = 0; |
49 | int idx = 0, pri = 0; |
69 | |
50 | |
70 | sscanf (buf, "%d %d", &idx, &pri); |
51 | sscanf (buf, "%d %d", &idx, &pri); |
|
|
52 | |
|
|
53 | //TODO: somehow fetch default priority from send_fx here |
71 | |
54 | |
72 | const facedata *d = face_data (idx, ns->faceset); |
55 | const facedata *d = face_data (idx, ns->faceset); |
73 | |
56 | |
74 | if (!d) |
57 | if (!d) |
75 | return; // doh |
58 | return; // doh |
… | |
… | |
80 | ix.idx = idx; |
63 | ix.idx = idx; |
81 | ix.ofs = d->data.size (); |
64 | ix.ofs = d->data.size (); |
82 | |
65 | |
83 | auto (pos, ns->ixface.end ()); |
66 | auto (pos, ns->ixface.end ()); |
84 | |
67 | |
85 | if (ns->fxix < 2) |
|
|
86 | { |
|
|
87 | // gcfclient does not support prioritising, older cfplus versions |
|
|
88 | // do not support interleaved transfers. |
|
|
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 |
68 | // the by far most common case will be to insert |
95 | // near the end, so little looping. |
69 | // near the end, so little looping. |
96 | while (pos != ns->ixface.begin ()) |
70 | while (pos != ns->ixface.begin ()) |
|
|
71 | { |
|
|
72 | --pos; |
|
|
73 | |
|
|
74 | // sort within 2k bins, to slightly prefer smaller images |
|
|
75 | if (pri > pos->pri || (pri == pos->pri && (ix.ofs >> 11) <= (pos->ofs >> 11))) |
97 | { |
76 | { |
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; |
77 | ++pos; |
104 | break; |
78 | break; |
105 | } |
|
|
106 | } |
79 | } |
107 | } |
80 | } |
108 | |
81 | |
109 | ns->ixface.insert (pos, ix); |
82 | ns->ixface.insert (pos, ix); |
110 | |
83 | |
111 | #if 0 |
84 | #if 0 |
112 | for (auto (i, ns->ixface.begin ()); i != ns->ixface.end (); ++i) |
85 | for (auto (i, ns->ixface.begin ()); i != ns->ixface.end (); ++i) |
113 | fprintf (stderr, "<%d,%d> ", i->pri, i->ofs); |
86 | fprintf (stderr, "<%d,%d> ", i->pri, i->ofs); |
114 | fprintf (stderr, "\n"); |
87 | fprintf (stderr, "\n"); |
115 | #endif |
88 | #endif |
116 | } |
|
|
117 | |
|
|
118 | /** |
|
|
119 | * Tells client the picture it has to use |
|
|
120 | * to smooth a picture number given as argument. |
|
|
121 | */ |
|
|
122 | void |
|
|
123 | AskSmooth (char *buf, int len, client *ns) |
|
|
124 | { |
|
|
125 | ns->send_face (atoi (buf), -100); |
|
|
126 | ns->flush_fx (); |
|
|
127 | } |
|
|
128 | |
|
|
129 | // how lame |
|
|
130 | static void print_facename (packet &sl, const facedata &d) |
|
|
131 | { |
|
|
132 | for (int i = 0; i < CHKSUM_SIZE; ++i) |
|
|
133 | sl.printf ("%02x", d.chksum [i]); |
|
|
134 | } |
|
|
135 | |
|
|
136 | // gcfclient uses the server-provided checksum for comparison, but always |
|
|
137 | // writes a broken checksum to its cache file, so we have to provide |
|
|
138 | // gcfclient with the same broken (and useless) checksum just to have it |
|
|
139 | // cache the image despite its bugs. |
|
|
140 | static uint32 gcfclient_checksum (const facedata *d) |
|
|
141 | { |
|
|
142 | uint32 csum = 0; |
|
|
143 | |
|
|
144 | for (std::string::const_iterator i = d->data.begin (); |
|
|
145 | i != d->data.end (); |
|
|
146 | ++i) |
|
|
147 | { |
|
|
148 | csum = rotate_right (csum); |
|
|
149 | csum += *(uint8 *)&*i; |
|
|
150 | } |
|
|
151 | |
|
|
152 | return csum; |
|
|
153 | } |
89 | } |
154 | |
90 | |
155 | /** |
91 | /** |
156 | * Sends a face to a client if they are in pixmap mode |
92 | * Sends a face to a client if they are in pixmap mode |
157 | * nothing gets sent in bitmap mode. |
93 | * nothing gets sent in bitmap mode. |
… | |
… | |
169 | |
105 | |
170 | faceinfo *f = face_info (facenum); |
106 | faceinfo *f = face_info (facenum); |
171 | |
107 | |
172 | if (!f) |
108 | if (!f) |
173 | { |
109 | { |
174 | LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum); |
110 | LOG (llevError | logBacktrace, "client::send_face (%d) out of bounds??\n", facenum); |
175 | return; |
111 | return; |
176 | } |
112 | } |
177 | |
113 | |
178 | // refuse to send non-image faces |
114 | // refuse to send non-image faces |
179 | if (!fx_want [f->type]) |
115 | if (!fx_want [f->type]) |
… | |
… | |
182 | if (faces_sent [facenum]) |
118 | if (faces_sent [facenum]) |
183 | return; |
119 | return; |
184 | |
120 | |
185 | faces_sent[facenum] = true; |
121 | faces_sent[facenum] = true; |
186 | |
122 | |
187 | // if for some reason we let a client without face caching connect, |
|
|
188 | // we better support that decision here and implement it. |
|
|
189 | if (!facecache) |
|
|
190 | return send_image (facenum); |
|
|
191 | |
|
|
192 | if (fxix) |
|
|
193 | { |
|
|
194 | fxface.push_back (facenum); |
123 | fxface.push_back (facenum); |
195 | return; |
|
|
196 | } |
|
|
197 | |
|
|
198 | const facedata *d = f->data (faceset); |
|
|
199 | |
|
|
200 | packet sl; |
|
|
201 | |
|
|
202 | if (force_face0) |
|
|
203 | sl << "face " << uint16 (facenum); |
|
|
204 | else if (image2) |
|
|
205 | sl << "face2 " << uint16 (facenum) << uint8 (0) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0); |
|
|
206 | else |
|
|
207 | sl << "face1 " << uint16 (facenum) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0); |
|
|
208 | |
|
|
209 | // how lame |
|
|
210 | print_facename (sl, *d); |
|
|
211 | send_packet (sl); |
|
|
212 | |
|
|
213 | if (EMI_smooth) |
|
|
214 | { |
|
|
215 | if (f->smooth) |
|
|
216 | { |
|
|
217 | send_face (f->smooth); |
|
|
218 | |
|
|
219 | packet sl ("smooth"); |
|
|
220 | |
|
|
221 | sl << uint16 (facenum) |
|
|
222 | << uint16 (f->smooth); |
|
|
223 | |
|
|
224 | send_packet (sl); |
|
|
225 | } |
|
|
226 | } |
|
|
227 | } |
124 | } |
228 | |
125 | |
229 | void client::flush_fx () |
126 | void client::flush_fx () |
230 | { |
127 | { |
231 | while (!fxface.empty ()) |
128 | while (!fxface.empty ()) |
… | |
… | |
275 | send_packet (fx); |
172 | send_packet (fx); |
276 | if (sx.length () > 3) send_packet (sx); |
173 | if (sx.length () > 3) send_packet (sx); |
277 | } |
174 | } |
278 | } |
175 | } |
279 | |
176 | |
280 | void |
|
|
281 | client::send_image (faceidx facenum) |
|
|
282 | { |
|
|
283 | // never send face 0. ever. it does not exist. |
|
|
284 | if (!facenum) |
|
|
285 | return; |
|
|
286 | |
|
|
287 | const facedata *d = face_data (facenum, faceset); |
|
|
288 | |
|
|
289 | faces_sent[facenum] = true; |
|
|
290 | |
|
|
291 | if (!d) |
|
|
292 | { |
|
|
293 | LOG (llevError, "client::send_image (%d) out of bounds??\n", facenum); |
|
|
294 | return; |
|
|
295 | } |
|
|
296 | |
|
|
297 | //TODO: check type here? |
|
|
298 | |
|
|
299 | if (force_image_newmap) |
|
|
300 | force_newmap = true; |
|
|
301 | |
|
|
302 | packet sl; |
|
|
303 | |
|
|
304 | sl << (image2 ? "image2 " : "image ") |
|
|
305 | << uint32 (facenum); |
|
|
306 | |
|
|
307 | if (image2) |
|
|
308 | sl << uint8 (0); |
|
|
309 | |
|
|
310 | sl << uint32 (d->data.size ()) |
|
|
311 | << data (d->data.data (), d->data.size ()); |
|
|
312 | |
|
|
313 | send_packet (sl); |
|
|
314 | } |
|
|
315 | |
|
|
316 | // send all faces of this object to the client |
177 | // send all faces of this object to the client |
317 | // this uses more bandwidth initially, but makes |
178 | // this uses more bandwidth initially, but makes |
318 | // animations look much smoother, and every client |
179 | // animations look much smoother, and every client |
319 | // is supposed to do client-side caching anyways. |
180 | // is supposed to do client-side caching anyways. |
320 | void |
181 | void |
… | |
… | |
420 | } |
281 | } |
421 | |
282 | |
422 | sl.printf ("replyinfo image_sums %d %d ", start, stop); |
283 | sl.printf ("replyinfo image_sums %d %d ", start, stop); |
423 | |
284 | |
424 | for (int i = start; i <= stop && i < faces.size (); i++) |
285 | for (int i = start; i <= stop && i < faces.size (); i++) |
425 | { |
286 | if (const faceinfo *f = face_info (i)) |
|
|
287 | if (ns->fx_want [f->type]) |
|
|
288 | { |
426 | ns->faces_sent[i] = true; |
289 | ns->faces_sent[i] = true; |
427 | |
290 | |
428 | const facedata *d = face_data (i, ns->faceset); |
291 | const facedata *d = f->data (ns->faceset); |
429 | |
292 | |
430 | if (sl.room () < 2 + 4 + 1 + d->data.size () + 1) |
293 | if (sl.room () < 2 + 4 + 1 + d->data.size () + 1) |
431 | break; |
294 | break; |
432 | |
295 | |
433 | sl << uint16 (i) |
296 | sl << uint16 (i) |
434 | << uint32 (0) // checksum |
297 | << uint32 (0) // checksum |
435 | << uint8 (ns->faceset); |
298 | << uint8 (ns->faceset); |
436 | |
299 | |
437 | print_facename (sl, *d); sl << uint8 (0); |
300 | for (int i = 0; i < CHKSUM_SIZE; ++i) |
438 | } |
301 | sl.printf ("%02x", d->chksum [i]); |
|
|
302 | |
|
|
303 | sl << uint8 (0); |
|
|
304 | } |
439 | |
305 | |
440 | /* It would make more sense to catch this pre-emptively in the code above. |
306 | /* It would make more sense to catch this pre-emptively in the code above. |
441 | * however, if this really happens, we probably just want to cut down the |
307 | * however, if this really happens, we probably just want to cut down the |
442 | * size to less than 1000, since that is what we claim the protocol would |
308 | * size to less than 1000, since that is what we claim the protocol would |
443 | * support. |
309 | * support. |
444 | */ |
310 | */ |
445 | //TODO: taken care of above, should simply abort or make sure the above code is correct |
311 | //TODO: taken care of above, should simply abort or make sure the above code is correct |
446 | if (sl.length () >= MAXSOCKBUF) |
312 | if (sl.length () > MAXSOCKBUF) |
447 | { |
313 | { |
448 | LOG (llevError, "send_image_send: buffer overrun, %d > %d\n", sl.length (), MAXSOCKBUF); |
314 | LOG (llevError, "send_image_send: buffer overrun, %d > %d\n", sl.length (), MAXSOCKBUF); |
449 | abort (); |
315 | abort (); |
450 | } |
316 | } |
451 | |
317 | |