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.32 by root, Wed Mar 14 15:44:47 2007 UTC vs.
Revision 1.50 by root, Tue Jul 24 04:55:34 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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 * Crossfire TRT 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 2 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,
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 GNU General Public License
19 * along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The author can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 22 */
24 23
25/** \file 24/** \file
26 * Image related communication 25 * Image related communication
27 * 26 *
… …
36#include <global.h> 35#include <global.h>
37#include <sproto.h> 36#include <sproto.h>
38 37
39#include "crc.h" 38#include "crc.h"
40 39
41#define MAX_FACE_SETS 20 /**< Maximum number of image sets the program will handle */
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
67/**
68 * Checks specified faceset is valid
69 * \param fsn faceset number
70 */
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
83free_socket_images (void)
84{
85 int num, q;
86
87 for (num = 0; num < MAX_FACE_SETS; num++)
88 {
89 if (facesets[num].prefix)
90 {
91 for (q = 0; q < faces.size (); q++)
92 if (facesets[num].faces[q].data)
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 }
102 }
103}
104
105/**
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
129 if (!facesets[faceset].prefix)
130 {
131 LOG (llevError, "get_face_fallback called with unused set (%d)?\n", faceset);
132 return 0; /* use default set */
133 }
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 40#define MAX_IMAGE_SIZE 10000
175 41
176/** 42/**
177 * Client tells us what type of faces it wants. Also sets 43 * Client tells us what type of faces it wants. Also sets
178 * the caching attribute. 44 * the caching attribute.
… …
191 if (mask) 57 if (mask)
192 ns->facecache = 1; 58 ns->facecache = 1;
193} 59}
194 60
195/** 61/**
196 * Client has requested pixmap that it somehow missed getting. 62 * client requested an image. send it rate-limited
197 * This will be called often if the client is 63 * before flushing.
198 * caching images.
199 */ 64 */
200void 65void
201SendFaceCmd (char *buf, int len, client *ns) 66AskFaceCmd (char *buf, int len, client *ns)
202{ 67{
68 int idx = 0, pri = 0;
69
70 sscanf (buf, "%d %d", &idx, &pri);
71
72 const facedata *d = face_data (idx, ns->faceset);
73
74 if (!d)
75 return; // doh
76
77 client::ixsend ix;
78
79 ix.pri = pri;
80 ix.idx = idx;
81 ix.ofs = d->data.size ();
82
83 auto (pos, ns->ixface.end ());
84
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
95 // near the end, so little looping.
96 while (pos != ns->ixface.begin ())
97 {
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;
104 break;
105 }
106 }
107 }
108
109 ns->ixface.insert (pos, ix);
110
111#if 0
112 for (auto (i, ns->ixface.begin ()); i != ns->ixface.end (); ++i)
113 fprintf (stderr, "<%d,%d> ", i->pri, i->ofs);
114 fprintf (stderr, "\n");
115#endif
116}
117
118/**
119 * Tells client the picture it has to use
120 * to smooth a picture number given as argument.
121 */
122void
123AskSmooth (char *buf, int len, client *ns)
124{
203 ns->send_image (atoi (buf)); 125 ns->send_face (atoi (buf), -100);
126 ns->flush_fx ();
204} 127}
205 128
206// how lame 129// how lame
207static void print_facename (packet &sl, const facedata &d) 130static void print_facename (packet &sl, const facedata &d)
208{ 131{
… …
236 * this is needed for the askface, in which we really do want to send the 159 * 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, 160 * 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. 161 * we look at the facecache, and if set, send the image name.
239 */ 162 */
240void 163void
241client::send_face (faceidx facenum) 164client::send_face (faceidx facenum, int pri)
242{ 165{
243 if (!facecache)
244 {
245 send_drawinfo (
246 "*** Please enable face caching or use a client that supports it.\n",
247 NDI_RED
248 );
249 return send_image (facenum);
250 }
251
252 // never send face 0. ever. it does not exist. 166 // never send face 0. ever. it does not exist.
253 if (!facenum) 167 if (!facenum)
254 return; 168 return;
255 169
256 const facedata *d = face_data (facenum, faceset); 170 faceinfo *f = face_info (facenum);
257 171
258 if (!d) 172 if (!f)
259 { 173 {
260 LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum); 174 LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum);
261 return; 175 return;
262 } 176 }
263 177
264 if (faces_sent[facenum]) 178 // refuse to send non-image faces
179 if (!fx_want [f->type])
265 return; 180 return;
266 181
182 if (faces_sent [facenum])
183 return;
184
267 faces_sent[facenum] = true; 185 faces_sent[facenum] = true;
186
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);
195 return;
196 }
197
198 const facedata *d = f->data (faceset);
268 199
269 packet sl; 200 packet sl;
270 201
271 if (force_face0) 202 if (force_face0)
272 sl << "face " << uint16 (facenum); 203 sl << "face " << uint16 (facenum);
… …
277 208
278 // how lame 209 // how lame
279 print_facename (sl, *d); 210 print_facename (sl, *d);
280 send_packet (sl); 211 send_packet (sl);
281 212
282 faceinfo *f = face_info (facenum); 213 if (EMI_smooth)
283 if (f->smooth && EMI_smooth)
284 { 214 {
215 if (f->smooth)
216 {
285 send_face (f->smooth); 217 send_face (f->smooth);
286 218
287 packet sl ("smooth"); 219 packet sl ("smooth");
288 220
289 sl << uint16 (facenum) 221 sl << uint16 (facenum)
290 << uint16 (f->smooth); 222 << uint16 (f->smooth);
291 223
292 send_packet (sl); 224 send_packet (sl);
225 }
226 }
227}
228
229void client::flush_fx ()
230{
231 while (!fxface.empty ())
232 {
233 packet fx ("fx");
234 packet sx ("sx");
235 int type = 0;
236
237 do
238 {
239 faceidx facenum = fxface.back (); fxface.pop_back ();
240
241 if (const faceinfo *f = face_info (facenum))
242 {
243 if (f->type != type)
244 {
245 type = f->type;
246
247 fx << ber32 (0)
248 << uint8 (1) << uint8 (type);
249 }
250
251 const facedata *d = f->data (faceset);
252
253 fx << ber32 (facenum)
254 << data8 (d->chksum, CHKSUM_SIZE);
255
256 if (smoothing)
257 {
258 faceinfo *f = face_info (facenum);
259
260 if (f->smooth)
261 {
262 send_face (f->smooth, -110);
263
264 sx << ber32 (facenum)
265 << ber32 (f->smooth)
266 << ber32 (f->smoothlevel);
267 }
268 }
269 }
270 }
271 while (!fxface.empty ()
272 && fx.room () > ber32::size + CHKSUM_SIZE + 1 + 3 /* type switch */
273 && sx.room () > ber32::size * 3);
274
275 send_packet (fx);
276 if (sx.length () > 3) send_packet (sx);
293 } 277 }
294} 278}
295 279
296void 280void
297client::send_image (faceidx facenum) 281client::send_image (faceidx facenum)
… …
300 if (!facenum) 284 if (!facenum)
301 return; 285 return;
302 286
303 const facedata *d = face_data (facenum, faceset); 287 const facedata *d = face_data (facenum, faceset);
304 288
289 faces_sent[facenum] = true;
290
305 if (!d) 291 if (!d)
306 { 292 {
307 LOG (llevError, "client::send_image (%d) out of bounds??\n", facenum); 293 LOG (llevError, "client::send_image (%d) out of bounds??\n", facenum);
308 return; 294 return;
309 } 295 }
296
297 //TODO: check type here?
298
299 if (force_image_newmap)
300 force_newmap = true;
310 301
311 packet sl; 302 packet sl;
312 303
313 sl << (image2 ? "image2 " : "image ") 304 sl << (image2 ? "image2 " : "image ")
314 << uint32 (facenum); 305 << uint32 (facenum);
… …
327// animations look much smoother, and every client 318// animations look much smoother, and every client
328// is supposed to do client-side caching anyways. 319// is supposed to do client-side caching anyways.
329void 320void
330client::send_faces (object *ob) 321client::send_faces (object *ob)
331{ 322{
332 send_face (ob->face); 323 send_face (ob->face, 10);
333 324
334 if (ob->animation_id) 325 if (ob->animation_id)
335 { 326 {
336 animation &anim = animations [ob->animation_id]; 327 animation &anim = animations [ob->animation_id];
337 328
338 for (int i = 0; i < anim.num_animations; i++) 329 for (int i = 0; i < anim.num_animations; i++)
339 send_face (anim.faces [i]); 330 send_face (anim.faces [i], -10);
340 } 331 }
341} 332}
342 333
343/** 334/**
344 * Need to send an animation sequence to the client. 335 * Need to send an animation sequence to the client.
… …
352{ 343{
353 /* Do some checking on the anim_num we got. Note that the animations 344 /* Do some checking on the anim_num we got. Note that the animations
354 * are added in contigous order, so if the number is in the valid 345 * are added in contigous order, so if the number is in the valid
355 * range, it must be a valid animation. 346 * range, it must be a valid animation.
356 */ 347 */
357 if (anim_num < 0 || anim_num > num_animations) 348 if (anim_num < 0 || anim_num >= animations.size ())
358 { 349 {
359 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); 350 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
360 return; 351 return;
361 } 352 }
362 353
… …
368 /* Build up the list of faces. Also, send any information (ie, the 359 /* Build up the list of faces. Also, send any information (ie, the
369 * the face itself) down to the client. 360 * the face itself) down to the client.
370 */ 361 */
371 for (int i = 0; i < animations[anim_num].num_animations; i++) 362 for (int i = 0; i < animations[anim_num].num_animations; i++)
372 { 363 {
373 send_face (animations[anim_num].faces[i]); 364 send_face (animations[anim_num].faces[i], -20);
374 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ 365 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
375 } 366 }
376 367
377 send_packet (sl); 368 send_packet (sl);
378 369

Diff Legend

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