[ViewVC] Diff of: cvs/deliantra/server/socket/image.C

Comparing deliantra/server/socket/image.C (file contents):
Revision 1.45 by root, Thu Jul 5 10:34:08 2007 UTC vs.
Revision 1.67 by root, Tue Jan 3 11:25:37 2012 UTC

…		…
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,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	* Crossfire TRT 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 <crossfire@schmorp.de>	22	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	23	*/
23		24
24	/** \file	25	/** \file
25	* Image related communication	26	* Image related communication
26	*	27	*
35	#include <global.h>	36	#include <global.h>
36	#include <sproto.h>	37	#include <sproto.h>
37		38
38	#include "crc.h"	39	#include "crc.h"
39		40
40	#define MAX_FACE_SETS 20 /*< Maximum number of image sets the program will handle /
41
42	/** Information about one image */
43	typedef struct FaceInfo
44	{
45	uint8 data; /< image data /
46	uint16 datalen; /*< length of the xpm data /
47	uint32 checksum; /*< Checksum of face data /
48	} FaceInfo;
49
50	/** Information about one face set */
51	typedef struct
52	{
53	char prefix; /< /
54	char *fullname;
55
56	uint8 fallback; /*< faceset to use when an image is not found in this faceset /
57	char *size;
58	char *extension;
59	char *comment;
60
61	FaceInfo faces; /< images in this faceset /
62	} FaceSets;
63
64	static FaceSets facesets[MAX_FACE_SETS]; /*< All facesets /
65
66	/**
67	* Checks specified faceset is valid
68	* \param fsn faceset number
69	*/
70	int
71	is_valid_faceset (int fsn)
72	{
73	if (fsn >= 0 && fsn < MAX_FACE_SETS && facesets[fsn].prefix)
74	return TRUE;
75	return FALSE;
76	}
77
78	/**
79	* Frees all faceset information
80	*/
81	void
82	free_socket_images (void)
83	{
84	int num, q;
85
86	for (num = 0; num < MAX_FACE_SETS; num++)
87	{
88	if (facesets[num].prefix)
89	{
90	for (q = 0; q < faces.size (); q++)
91	if (facesets[num].faces[q].data)
92	free (facesets[num].faces[q].data);
93
94	free (facesets[num].prefix);
95	free (facesets[num].fullname);
96	free (facesets[num].size);
97	free (facesets[num].extension);
98	free (facesets[num].comment);
99	free (facesets[num].faces);
100	}
101	}
102	}
103
104	/**
105	* This returns the set we will actually use when sending
106	* a face. This is used because the image files may be sparse.
107	* This function is recursive. imageno is the face number we are
108	* trying to send
109	*
110	* If face is not found in specified faceset, tries with 'fallback' faceset.
111	*
112	* \param faceset faceset to check
113	* \param imageno image number
114	*
115	*/
116	static int
117	get_face_fallback (int faceset, int imageno)
118	{
119	/* faceset 0 is supposed to have every image, so just return. Doing
120	* so also prevents infinite loops in the case if it not having
121	* the face, but in that case, we are likely to crash when we try
122	* to access the data, but that is probably preferable to an infinite
123	* loop.
124	*/
125	if (faceset == 0)
126	return 0;
127
128	if (!facesets[faceset].prefix)
129	{
130	LOG (llevError, "get_face_fallback called with unused set (%d)?\n", faceset);
131	return 0; /* use default set */
132	}
133
134	if (facesets[faceset].faces[imageno].data)
135	return faceset;
136
137	return get_face_fallback (facesets[faceset].fallback, imageno);
138	}
139
140	/**
141	* Checks fallback are correctly defined.
142	* This is a simple recursive function that makes sure the fallbacks
143	* are all proper (eg, the fall back to defined sets, and also
144	* eventually fall back to 0). At the top level, togo is set to MAX_FACE_SETS,
145	* if togo gets to zero, it means we have a loop.
146	* This is only run when we first load the facesets.
147	*/
148	static void
149	check_faceset_fallback (int faceset, int togo)
150	{
151	int fallback = facesets[faceset].fallback;
152
153	/* proper case - falls back to base set */
154	if (fallback == 0)
155	return;
156
157	if (!facesets[fallback].prefix)
158	{
159	LOG (llevError, "Face set %d falls to non set faceset %d\n", faceset, fallback);
160	abort ();
161	}
162
163	togo--;
164	if (togo == 0)
165	{
166	LOG (llevError, "Infinite loop found in facesets. aborting.\n");
167	abort ();
168	}
169
170	check_faceset_fallback (fallback, togo);
171	}
172
173	#define MAX_IMAGE_SIZE 10000	41	#define MAX_IMAGE_SIZE 10000
174
175	/**
176	* Client tells us what type of faces it wants. Also sets
177	* the caching attribute.
178	*
179	*/
180	void
181	SetFaceMode (char buf, int len, client ns)
182	{
183	int mask = (atoi (buf) & CF_FACE_CACHE), mode = (atoi (buf) & ~CF_FACE_CACHE);
184
185	if (mode == CF_FACE_NONE)
186	ns->facecache = 1;
187	else if (mode != CF_FACE_PNG)
188	ns->send_packet_printf ("drawinfo %d %s", NDI_RED, "Warning - send unsupported face mode. Will use Png");
189
190	if (mask)
191	ns->facecache = 1;
192	}
193		42
194	/**	43	/**
195	* client requested an image. send it rate-limited	44	* client requested an image. send it rate-limited
196	* before flushing.	45	* before flushing.
197	*/	46	*/
…		…
200	{	49	{
201	int idx = 0, pri = 0;	50	int idx = 0, pri = 0;
202		51
203	sscanf (buf, "%d %d", &idx, &pri);	52	sscanf (buf, "%d %d", &idx, &pri);
204		53
		54	//TODO: somehow fetch default priority from send_fx here
		55
205	const facedata *d = face_data (idx, ns->faceset);	56	const facedata *d = face_data (idx, ns->faceset);
206		57
207	if (!d)	58	if (!d)
208	return; // doh	59	return; // doh
209		60
…		…
211		62
212	ix.pri = pri;	63	ix.pri = pri;
213	ix.idx = idx;	64	ix.idx = idx;
214	ix.ofs = d->data.size ();	65	ix.ofs = d->data.size ();
215		66
216	// this is (hopefully) a temporary fix around older cfplus versions not	67	auto (pos, ns->ixface.end ());
217	// supporting interleaved transfers	68
218	ns->ixface.insert (ns->ixface.begin (), ix);	69	// the by far most common case will be to insert
		70	// near the end, so little looping.
		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)))
		77	{
		78	++pos;
		79	break;
		80	}
		81	}
		82
		83	ns->ixface.insert (pos, ix);
219		84
220	#if 0	85	#if 0
221	// the by far most common case will be to insert	86	for (auto (i, ns->ixface.begin ()); i != ns->ixface.end (); ++i)
222	// right at the end, so no looping.	87	fprintf (stderr, "<%d,%d> ", i->pri, i->ofs);
223	auto (i, ns->ixface.end ());	88	fprintf (stderr, "\n");
224	for (; i != ns->ixface.begin (); )
225	if (pri >= (--i)->pri)
226	break;
227
228	ns->ixface.insert (i, ix);
229	#endif	89	#endif
230	}
231
232	/**
233	* Tells client the picture it has to use
234	* to smooth a picture number given as argument.
235	*/
236	void
237	AskSmooth (char buf, int len, client ns)
238	{
239	ns->send_face (atoi (buf));
240	ns->flush_fx ();
241	}
242
243	// how lame
244	static void print_facename (packet &sl, const facedata &d)
245	{
246	for (int i = 0; i < CHKSUM_SIZE; ++i)
247	sl.printf ("%02x", d.chksum [i]);
248	}
249
250	// gcfclient uses the server-provided checksum for comparison, but always
251	// writes a broken checksum to its cache file, so we have to provide
252	// gcfclient with the same broken (and useless) checksum just to have it
253	// cache the image despite its bugs.
254	static uint32 gcfclient_checksum (const facedata *d)
255	{
256	uint32 csum = 0;
257
258	for (std::string::const_iterator i = d->data.begin ();
259	i != d->data.end ();
260	++i)
261	{
262	csum = rotate_right (csum);
263	csum += (uint8 )&*i;
264	}
265
266	return csum;
267	}	90	}
268		91
269	/**	92	/**
270	* 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
271	* nothing gets sent in bitmap mode.	94	* nothing gets sent in bitmap mode.
…		…
273	* 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
274	* 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,
275	* 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.
276	*/	99	*/
277	void	100	void
278	client::send_face (faceidx facenum)	101	client::send_face (faceidx facenum, int pri)
279	{	102	{
280	// never send face 0. ever. it does not exist.	103	// never send face 0. ever. it does not exist.
281	if (!facenum)	104	if (!facenum)
282	return;	105	return;
283		106
284	const facedata *d = face_data (facenum, faceset);	107	faceinfo *f = face_info (facenum);
285		108
286	if (!d)	109	if (!f)
287	{	110	{
288	LOG (llevError, "client::send_face (%d) out of bounds??\n", facenum);	111	LOG (llevError \| logBacktrace, "client::send_face (%d) out of bounds??\n", facenum);
289	return;	112	return;
290	}	113	}
291		114
292	if (faces_sent[facenum])	115	// refuse to send non-image faces
		116	if (!fx_want [f->type])
293	return;	117	return;
294		118
		119	if (faces_sent [facenum])
		120	return;
		121
295	faces_sent[facenum] = true;	122	faces_sent[facenum] = true;
296		123
297	// if for some reason we let a client without face caching connect,
298	// we better support that decision here and implement it.
299	if (!facecache)
300	return send_image (facenum);
301
302	if (fxix)
303	{
304	fxface.push_back (facenum);	124	fxface.push_back (facenum);
305	return;
306	}
307
308	packet sl;
309
310	if (force_face0)
311	sl << "face " << uint16 (facenum);
312	else if (image2)
313	sl << "face2 " << uint16 (facenum) << uint8 (0) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0);
314	else
315	sl << "face1 " << uint16 (facenum) << uint32 (force_bad_checksum ? gcfclient_checksum (d) : 0);
316
317	// how lame
318	print_facename (sl, *d);
319	send_packet (sl);
320
321	if (EMI_smooth)
322	{
323	faceinfo *f = face_info (facenum);
324
325	if (f->smooth)
326	{
327	send_face (f->smooth);
328
329	packet sl ("smooth");
330
331	sl << uint16 (facenum)
332	<< uint16 (f->smooth);
333
334	send_packet (sl);
335	}
336	}
337	}	125	}
338		126
339	void client::flush_fx ()	127	void client::flush_fx ()
340	{	128	{
341	while (!fxface.empty ())	129	while (!fxface.empty ())
342	{	130	{
343	packet fx ("fx");	131	packet fx ("fx");
344	packet sx ("sx");	132	packet sx ("sx");
		133	int type = 0;
345		134
346	do	135	do
347	{	136	{
348	faceidx facenum = fxface.back (); fxface.pop_back ();	137	faceidx facenum = fxface.back (); fxface.pop_back ();
349		138
350	const facedata *d = face_data (facenum, faceset);	139	if (const faceinfo *f = face_info (facenum))
351
352	if (d)
353	{	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
354	fx << ber32 (facenum)	151	fx << ber32 (facenum)
355	<< data8 (d->chksum, CHKSUM_SIZE);	152	<< data8 (d->chksum, d->chksum_len);
356		153
357	if (smoothing)	154	if (smoothing)
358	{	155	{
359	faceinfo *f = face_info (facenum);	156	faceinfo *f = face_info (facenum);
360		157
361	if (f->smooth)	158	if (f->smooth)
362	{	159	{
363	send_face (f->smooth);	160	send_face (f->smooth, -110);
		161
364	sx << ber32 (facenum)	162	sx << ber32 (facenum)
365	<< ber32 (f->smooth)	163	<< ber32 (f->smooth)
366	<< ber32 (f->smoothlevel);	164	<< ber32 (f->smoothlevel);
367	}	165	}
368	}	166	}
369	}	167	}
370	}	168	}
371	while (!fxface.empty ()	169	while (!fxface.empty ()
372	&& fx.room () > ber32::size + CHKSUM_SIZE + 1	170	&& fx.room () > ber32::size + CHKSUM_MAXLEN + 1 + 3 /* type switch */
373	&& sx.room () > ber32::size * 3);	171	&& sx.room () > ber32::size * 3);
374		172
375	send_packet (fx);	173	send_packet (fx);
376	if (sx.length () > 3) send_packet (sx);	174	if (sx.length () > 3) send_packet (sx);
377	}	175	}
378	}
379
380	void
381	client::send_image (faceidx facenum)
382	{
383	// never send face 0. ever. it does not exist.
384	if (!facenum)
385	return;
386
387	const facedata *d = face_data (facenum, faceset);
388
389	faces_sent[facenum] = true;
390
391	if (!d)
392	{
393	LOG (llevError, "client::send_image (%d) out of bounds??\n", facenum);
394	return;
395	}
396
397	//TODO: check type here?
398
399	if (force_image_newmap)
400	force_newmap = true;
401
402	packet sl;
403
404	sl << (image2 ? "image2 " : "image ")
405	<< uint32 (facenum);
406
407	if (image2)
408	sl << uint8 (0);
409
410	sl << uint32 (d->data.size ())
411	<< data (d->data.data (), d->data.size ());
412
413	send_packet (sl);
414	}	176	}
415		177
416	// send all faces of this object to the client	178	// send all faces of this object to the client
417	// this uses more bandwidth initially, but makes	179	// this uses more bandwidth initially, but makes
418	// animations look much smoother, and every client	180	// animations look much smoother, and every client
419	// is supposed to do client-side caching anyways.	181	// is supposed to do client-side caching anyways.
420	void	182	void
421	client::send_faces (object *ob)	183	client::send_faces (object *ob)
422	{	184	{
423	send_face (ob->face);	185	send_face (ob->face, 10);
424		186
425	if (ob->animation_id)	187	if (ob->animation_id)
426	{	188	{
427	animation &anim = animations [ob->animation_id];	189	const animation &anim = ob->anim ();
428		190
429	for (int i = 0; i < anim.num_animations; i++)	191	for (int i = 0; i < anim.num_animations; i++)
430	send_face (anim.faces [i]);	192	send_face (anim.faces [i], -10);
431	}	193	}
432	}	194	}
433		195
434	/**	196	/**
435	* Need to send an animation sequence to the client.	197	* Need to send an animation sequence to the client.
…		…
440	*/	202	*/
441	void	203	void
442	client::send_animation (short anim_num)	204	client::send_animation (short anim_num)
443	{	205	{
444	/* 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
445	* 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
446	* range, it must be a valid animation.	208	* range, it must be a valid animation.
447	*/	209	*/
448	if (anim_num < 0 \|\| anim_num >= animations.size ())	210	if (anim_num < 0 \|\| anim_num >= animations.size ())
449	{	211	{
450	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);
…		…
459	/* Build up the list of faces. Also, send any information (ie, the	221	/* Build up the list of faces. Also, send any information (ie, the
460	* the face itself) down to the client.	222	* the face itself) down to the client.
461	*/	223	*/
462	for (int i = 0; i < animations[anim_num].num_animations; i++)	224	for (int i = 0; i < animations[anim_num].num_animations; i++)
463	{	225	{
464	send_face (animations[anim_num].faces[i]);	226	send_face (animations[anim_num].faces[i], -20);
465	sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */	227	sl << uint16 (animations[anim_num].faces[i]);
466	}	228	}
467		229
468	send_packet (sl);	230	send_packet (sl);
469		231
470	anims_sent[anim_num] = 1;	232	anims_sent[anim_num] = 1;
471	}	233	}
472		234
473	/**
474	* Sends the number of images, checksum of the face file,
475	* and the image_info file information. See the doc/Developers/protocol
476	* if you want further detail.
477	*/
478	void	235	void
479	send_image_info (client ns, char params)	236	client::invalidate_face (faceidx idx)
480	{	237	{
481	packet sl;	238	faces_sent [idx] = false;
482		239	force_newmap = true;
483	//TODO: second parameter is a checksum, but it makes no sense in this current framework
484	sl.printf ("replyinfo image_info\n%d\n%u\n", MAX_FACES, 0);
485
486	sl << "0:base:standard:0:32x32:none:The old 32x32 faceset.\n";
487
488	ns->send_packet (sl);
489	}	240	}
490		241
491	/**
492	* Sends requested face information.
493	* \param ns socket to send to
494	* \param params contains first and last index of face
495	*
496	* For each image in [start..stop] sends
497	* - checksum
498	* - name
499	*/
500	void	242	void
501	send_image_sums (client ns, char params)	243	client::invalidate_all_faces ()
502	{	244	{
503	int start, stop;	245	faces_sent.reset ();
504	char *cp;	246	force_newmap = true;
505
506	packet sl;
507
508	start = atoi (params);
509	for (cp = params; *cp != '\0'; cp++)
510	if (*cp == ' ')
511	break;
512
513	stop = atoi (cp);
514	if (stop < start \|\| *cp == '\0' \|\| (stop - start) > 1000 \|\| stop >= MAX_FACES)
515	{
516	sl.printf ("replyinfo image_sums %d %d", start, stop);
517	ns->send_packet (sl);
518	sl.reset ();
519	return;
520	}
521
522	sl.printf ("replyinfo image_sums %d %d ", start, stop);
523
524	for (int i = start; i <= stop && i < faces.size (); i++)
525	{
526	ns->faces_sent[i] = true;
527
528	const facedata *d = face_data (i, ns->faceset);
529
530	if (sl.room () < 2 + 4 + 1 + d->data.size () + 1)
531	break;
532
533	sl << uint16 (i)
534	<< uint32 (0) // checksum
535	<< uint8 (ns->faceset);
536
537	print_facename (sl, *d); sl << uint8 (0);
538	}
539
540	/* It would make more sense to catch this pre-emptively in the code above.
541	* however, if this really happens, we probably just want to cut down the
542	* size to less than 1000, since that is what we claim the protocol would
543	* support.
544	*/
545	//TODO: taken care of above, should simply abort or make sure the above code is correct
546	if (sl.length () >= MAXSOCKBUF)
547	{
548	LOG (llevError, "send_image_send: buffer overrun, %d > %d\n", sl.length (), MAXSOCKBUF);
549	abort ();
550	}
551
552	ns->send_packet (sl);
553	}	247	}
554		248

Diff Legend

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

Comparing deliantra/server/socket/image.C (file contents): Revision 1.45 by root, Thu Jul 5 10:34:08 2007 UTC vs. Revision 1.67 by root, Tue Jan 3 11:25:37 2012 UTC

Diff Legend

Comparing deliantra/server/socket/image.C (file contents):
Revision 1.45 by root, Thu Jul 5 10:34:08 2007 UTC vs.
Revision 1.67 by root, Tue Jan 3 11:25:37 2012 UTC