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.43 by root, Sun Jul 1 04:08:14 2007 UTC vs.
Revision 1.51 by root, Tue Jul 24 04:58:25 2007 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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 it 8 * Crossfire TRT is free software: you can redistribute it and/or modify
9 * under the terms of the GNU General Public License as published by the Free 9 * it under the terms of the GNU General Public License as published by
10 * Software Foundation; either version 2 of the License, or (at your option) 10 * the Free Software Foundation, either version 3 of the License, or
11 * 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, but 13 * This program is distributed in the hope that it will be useful,
14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * 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 along 18 * You should have received a copy of the GNU General Public License
19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 * 20 *
22 * The authors 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
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.
201{ 67{
202 int idx = 0, pri = 0; 68 int idx = 0, pri = 0;
203 69
204 sscanf (buf, "%d %d", &idx, &pri); 70 sscanf (buf, "%d %d", &idx, &pri);
205 71
72 //TODO: somehow fetch default priority from send_fx here
73
206 const facedata *d = face_data (idx, ns->faceset); 74 const facedata *d = face_data (idx, ns->faceset);
207 75
208 if (!d) 76 if (!d)
209 return; // doh 77 return; // doh
210 78
212 80
213 ix.pri = pri; 81 ix.pri = pri;
214 ix.idx = idx; 82 ix.idx = idx;
215 ix.ofs = d->data.size (); 83 ix.ofs = d->data.size ();
216 84
85 auto (pos, ns->ixface.end ());
86
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 {
217 // the by far most common case will be to insert 96 // the by far most common case will be to insert
218 // right at the end, so no looping. 97 // near the end, so little looping.
219 auto (i, ns->ixface.end ()); 98 while (pos != ns->ixface.begin ())
220 for (; i != ns->ixface.begin (); ) 99 {
221 if (pri >= (--i)->pri) 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;
222 break; 106 break;
107 }
108 }
109 }
223 110
224 ns->ixface.insert (i, ix); 111 ns->ixface.insert (pos, ix);
112
113#if 0
114 for (auto (i, ns->ixface.begin ()); i != ns->ixface.end (); ++i)
115 fprintf (stderr, "<%d,%d> ", i->pri, i->ofs);
116 fprintf (stderr, "\n");
117#endif
225} 118}
226 119
227/** 120/**
228 * Tells client the picture it has to use 121 * Tells client the picture it has to use
229 * to smooth a picture number given as argument. 122 * to smooth a picture number given as argument.
230 */ 123 */
231void 124void
232AskSmooth (char *buf, int len, client *ns) 125AskSmooth (char *buf, int len, client *ns)
233{ 126{
234 ns->send_face (atoi (buf)); 127 ns->send_face (atoi (buf), -100);
235 ns->flush_fx (); 128 ns->flush_fx ();
236} 129}
237 130
238// how lame 131// how lame
239static void print_facename (packet &sl, const facedata &d) 132static void print_facename (packet &sl, const facedata &d)
268 * this is needed for the askface, in which we really do want to send the 161 * this is needed for the askface, in which we really do want to send the
269 * face (and askface is the only place that should be setting it). Otherwise, 162 * face (and askface is the only place that should be setting it). Otherwise,
270 * we look at the facecache, and if set, send the image name. 163 * we look at the facecache, and if set, send the image name.
271 */ 164 */
272void 165void
273client::send_face (faceidx facenum) 166client::send_face (faceidx facenum, int pri)
274{ 167{
275 // never send face 0. ever. it does not exist. 168 // never send face 0. ever. it does not exist.
276 if (!facenum) 169 if (!facenum)
277 return; 170 return;
278 171
279 const facedata *d = face_data (facenum, faceset); 172 faceinfo *f = face_info (facenum);
280 173
281 if (!d) 174 if (!f)
282 { 175 {
283 LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum); 176 LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum);
284 return; 177 return;
285 } 178 }
286 179
180 // refuse to send non-image faces
181 if (!fx_want [f->type])
182 return;
183
287 if (faces_sent[facenum]) 184 if (faces_sent [facenum])
288 return; 185 return;
289 186
290 faces_sent[facenum] = true; 187 faces_sent[facenum] = true;
291 188
292 // if for some reason we let a client without face caching connect, 189 // if for some reason we let a client without face caching connect,
297 if (fxix) 194 if (fxix)
298 { 195 {
299 fxface.push_back (facenum); 196 fxface.push_back (facenum);
300 return; 197 return;
301 } 198 }
199
200 const facedata *d = f->data (faceset);
302 201
303 packet sl; 202 packet sl;
304 203
305 if (force_face0) 204 if (force_face0)
306 sl << "face " << uint16 (facenum); 205 sl << "face " << uint16 (facenum);
313 print_facename (sl, *d); 212 print_facename (sl, *d);
314 send_packet (sl); 213 send_packet (sl);
315 214
316 if (EMI_smooth) 215 if (EMI_smooth)
317 { 216 {
318 faceinfo *f = face_info (facenum);
319
320 if (f->smooth) 217 if (f->smooth)
321 { 218 {
322 send_face (f->smooth); 219 send_face (f->smooth);
323 220
324 packet sl ("smooth"); 221 packet sl ("smooth");
335{ 232{
336 while (!fxface.empty ()) 233 while (!fxface.empty ())
337 { 234 {
338 packet fx ("fx"); 235 packet fx ("fx");
339 packet sx ("sx"); 236 packet sx ("sx");
237 int type = 0;
340 238
341 do 239 do
342 { 240 {
343 faceidx facenum = fxface.back (); fxface.pop_back (); 241 faceidx facenum = fxface.back (); fxface.pop_back ();
344 242
345 const facedata *d = face_data (facenum, faceset); 243 if (const faceinfo *f = face_info (facenum))
346
347 if (d)
348 { 244 {
245 if (f->type != type)
246 {
247 type = f->type;
248
249 fx << ber32 (0)
250 << uint8 (1) << uint8 (type);
251 }
252
253 const facedata *d = f->data (faceset);
254
349 fx << ber32 (facenum) 255 fx << ber32 (facenum)
350 << data8 (d->chksum, CHKSUM_SIZE); 256 << data8 (d->chksum, CHKSUM_SIZE);
351 257
352 if (smoothing) 258 if (smoothing)
353 { 259 {
354 faceinfo *f = face_info (facenum); 260 faceinfo *f = face_info (facenum);
355 261
356 if (f->smooth) 262 if (f->smooth)
357 { 263 {
358 send_face (f->smooth); 264 send_face (f->smooth, -110);
265
359 sx << ber32 (facenum) 266 sx << ber32 (facenum)
360 << ber32 (f->smooth) 267 << ber32 (f->smooth)
361 << ber32 (f->smoothlevel); 268 << ber32 (f->smoothlevel);
362 } 269 }
363 } 270 }
364 } 271 }
365 } 272 }
366 while (!fxface.empty () 273 while (!fxface.empty ()
367 && fx.room () > ber32::size + CHKSUM_SIZE + 1 274 && fx.room () > ber32::size + CHKSUM_SIZE + 1 + 3 /* type switch */
368 && sx.room () > ber32::size * 3); 275 && sx.room () > ber32::size * 3);
369 276
370 send_packet (fx); 277 send_packet (fx);
371 if (sx.length () > 3) send_packet (sx); 278 if (sx.length () > 3) send_packet (sx);
372 } 279 }
387 { 294 {
388 LOG (llevError, "client::send_image (%d) out of bounds??\n", facenum); 295 LOG (llevError, "client::send_image (%d) out of bounds??\n", facenum);
389 return; 296 return;
390 } 297 }
391 298
392 //TODO: check type here?
393
394 if (force_image_newmap) 299 if (force_image_newmap)
395 force_newmap = true; 300 force_newmap = true;
396 301
397 packet sl; 302 packet sl;
398 303
413// animations look much smoother, and every client 318// animations look much smoother, and every client
414// is supposed to do client-side caching anyways. 319// is supposed to do client-side caching anyways.
415void 320void
416client::send_faces (object *ob) 321client::send_faces (object *ob)
417{ 322{
418 send_face (ob->face); 323 send_face (ob->face, 10);
419 324
420 if (ob->animation_id) 325 if (ob->animation_id)
421 { 326 {
422 animation &anim = animations [ob->animation_id]; 327 animation &anim = animations [ob->animation_id];
423 328
424 for (int i = 0; i < anim.num_animations; i++) 329 for (int i = 0; i < anim.num_animations; i++)
425 send_face (anim.faces [i]); 330 send_face (anim.faces [i], -10);
426 } 331 }
427} 332}
428 333
429/** 334/**
430 * Need to send an animation sequence to the client. 335 * Need to send an animation sequence to the client.
454 /* 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
455 * the face itself) down to the client. 360 * the face itself) down to the client.
456 */ 361 */
457 for (int i = 0; i < animations[anim_num].num_animations; i++) 362 for (int i = 0; i < animations[anim_num].num_animations; i++)
458 { 363 {
459 send_face (animations[anim_num].faces[i]); 364 send_face (animations[anim_num].faces[i], -20);
460 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 */
461 } 366 }
462 367
463 send_packet (sl); 368 send_packet (sl);
464 369

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines