ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/image.C
(Generate patch)

Comparing deliantra/server/socket/image.C (file contents):
Revision 1.24 by root, Sun Mar 11 02:12:45 2007 UTC vs.
Revision 1.62 by root, Sun Nov 15 18:04:00 2009 UTC

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 */
44typedef 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 */
52typedef 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
65static 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 */
71int
72is_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 */
82void 47void
83free_socket_images (void) 48AskFaceCmd (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 */
117static int
118get_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 */
149static void
150check_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 */
181void
182SetFaceMode (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 */
200void
201SendFaceCmd (char *buf, int len, client *ns)
202{
203 uint16 facenum = atoi (buf);
204
205 if (facenum != 0)
206 esrv_send_face (ns, facenum, 1);
207}
208
209// how lame
210static void print_facename (packet &sl, const facedata &d)
211{
212 sl.printf ("%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x"
213 "%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x",
214 d.chksum [ 0], d.chksum [ 1], d.chksum [ 2], d.chksum [ 3],
215 d.chksum [ 4], d.chksum [ 5], d.chksum [ 6], d.chksum [ 7],
216 d.chksum [ 8], d.chksum [ 9], d.chksum [10], d.chksum [11],
217 d.chksum [12], d.chksum [13], d.chksum [14], d.chksum [15]);
218} 90}
219 91
220/** 92/**
221 * 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
222 * nothing gets sent in bitmap mode. 94 * nothing gets sent in bitmap mode.
… …
224 * 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
225 * 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,
226 * 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.
227 */ 99 */
228void 100void
229esrv_send_face (client *ns, short face_num, int nocache) 101client::send_face (faceidx facenum, int pri)
230{ 102{
231 if (face_num <= 0 || face_num >= faces.size ()) 103 // never send face 0. ever. it does not exist.
104 if (!facenum)
105 return;
106
107 faceinfo *f = face_info (facenum);
108
109 if (!f)
232 { 110 {
233 LOG (llevError, "esrv_send_face (%d) out of bounds??\n", face_num); 111 LOG (llevError | logBacktrace, "client::send_face (%d) out of bounds??\n", facenum);
234 return; 112 return;
235 } 113 }
236 114
237 const facedata *d = face_data (face_num, ns->faceset); 115 // refuse to send non-image faces
116 if (!fx_want [f->type])
117 return;
238 118
239 packet sl; 119 if (faces_sent [facenum])
120 return;
240 121
241 if (ns->facecache && !nocache) 122 faces_sent[facenum] = true;
242 {
243 sl << (ns->image2 ? "face2 " : "face1 ")
244 << uint16 (face_num);
245 123
246 if (ns->image2) 124 fxface.push_back (facenum);
247 sl << uint8 (0); 125}
248 126
249 sl << uint32 (0); 127void client::flush_fx ()
128{
129 while (!fxface.empty ())
130 {
131 packet fx ("fx");
132 packet sx ("sx");
133 int type = 0;
250 134
251 // how lame 135 do
252 print_facename (sl, *d); 136 {
137 faceidx facenum = fxface.back (); fxface.pop_back ();
253 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, d->chksum_len);
153
154 if (smoothing)
155 {
156 faceinfo *f = face_info (facenum);
157
158 if (f->smooth)
159 {
160 send_face (f->smooth, -110);
161
162 sx << ber32 (facenum)
163 << ber32 (f->smooth)
164 << ber32 (f->smoothlevel);
165 }
166 }
167 }
168 }
169 while (!fxface.empty ()
170 && fx.room () > ber32::size + CHKSUM_MAXLEN + 1 + 3 /* type switch */
171 && sx.room () > ber32::size * 3);
172
254 ns->send_packet (sl); 173 send_packet (fx);
255 } 174 if (sx.length () > 3) send_packet (sx);
256 else
257 { 175 }
258 sl << (ns->image2 ? "image2 " : "image ") 176}
259 << uint32 (face_num);
260 177
261 if (ns->image2) 178// send all faces of this object to the client
262 sl << uint8 (0); 179// this uses more bandwidth initially, but makes
180// animations look much smoother, and every client
181// is supposed to do client-side caching anyways.
182void
183client::send_faces (object *ob)
184{
185 send_face (ob->face, 10);
263 186
264 sl << uint32 (d->data.size ()) 187 if (ob->animation_id)
265 << data (d->data.data (), d->data.size ());
266
267 ns->send_packet (sl);
268 } 188 {
189 const animation &anim = ob->anim ();
269 190
270 ns->faces_sent[face_num] |= NS_FACESENT_FACE; 191 for (int i = 0; i < anim.num_animations; i++)
192 send_face (anim.faces [i], -10);
193 }
271} 194}
272 195
273/** 196/**
274 * Sends the number of images, checksum of the face file, 197 * Need to send an animation sequence to the client.
275 * and the image_info file information. See the doc/Developers/protocol 198 * We will send appropriate face commands to the client if we haven't
276 * if you want further detail. 199 * sent them the face yet (this can become quite costly in terms of
277 */ 200 * how much we are sending - on the other hand, this should only happen
278 201 * when the player logs in and picks stuff up.
279void
280send_image_info (client *ns, char *params)
281{
282 packet sl;
283
284 //TODO: second parameter is a checksum, but it makes no sense in this current framework
285 sl.printf ("replyinfo image_info\n%d\n%u\n", MAX_FACES, 0);
286
287 sl << "0:base:standard:0:32x32:none:The old 32x32 faceset.\n";
288
289 ns->send_packet (sl);
290}
291
292/**
293 * Sends requested face information.
294 * \param ns socket to send to
295 * \param params contains first and last index of face
296 * 202 */
297 * For each image in [start..stop] sends 203void
298 * - checksum 204client::send_animation (short anim_num)
299 * - name 205{
206 /* Do some checking on the anim_num we got. Note that the animations
207 * are added in contiguous order, so if the number is in the valid
208 * range, it must be a valid animation.
300 */ 209 */
301void 210 if (anim_num < 0 || anim_num >= animations.size ())
302send_image_sums (client *ns, char *params)
303{
304 int start, stop;
305 char *cp;
306
307 packet sl;
308
309 start = atoi (params);
310 for (cp = params; *cp != '\0'; cp++)
311 if (*cp == ' ')
312 break;
313
314 stop = atoi (cp);
315 if (stop < start || *cp == '\0' || (stop - start) > 1000 || stop >= MAX_FACES)
316 { 211 {
317 sl.printf ("replyinfo image_sums %d %d", start, stop); 212 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
318 ns->send_packet (sl);
319 sl.reset ();
320 return; 213 return;
321 } 214 }
322 215
323 sl.printf ("replyinfo image_sums %d %d ", start, stop); 216 packet sl ("anim");
324 217
325 for (int i = start; i <= stop && i < faces.size (); i++)
326 {
327 ns->faces_sent[i] |= NS_FACESENT_FACE;
328
329 const facedata *d = face_data (i, ns->faceset);
330
331 if (sl.room () < 2 + 4 + 1 + d->data.size () + 1)
332 break;
333
334 sl << uint16 (i) 218 sl << uint16 (anim_num)
335 << uint32 (0) // checksum 219 << uint16 (0); /* flags - not used right now */
336 << uint8 (ns->faceset);
337 220
338 print_facename (sl, *d); sl << uint8 (0); 221 /* Build up the list of faces. Also, send any information (ie, the
339 } 222 * the face itself) down to the client.
340
341 /* It would make more sense to catch this pre-emptively in the code above.
342 * however, if this really happens, we probably just want to cut down the
343 * size to less than 1000, since that is what we claim the protocol would
344 * support.
345 */ 223 */
346 //TODO: taken care of above, should simply abort or make sure the above code is correct 224 for (int i = 0; i < animations[anim_num].num_animations; i++)
347 if (sl.length () >= MAXSOCKBUF)
348 {
349 LOG (llevError, "send_image_send: buffer overrun, %d > %d\n", sl.length (), MAXSOCKBUF);
350 abort ();
351 } 225 {
226 send_face (animations[anim_num].faces[i], -20);
227 sl << uint16 (animations[anim_num].faces[i]);
228 }
352 229
353 ns->send_packet (sl); 230 send_packet (sl);
354}
355 231
232 anims_sent[anim_num] = 1;
233}
234

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines