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

Comparing deliantra/server/socket/loop.C (file contents):
Revision 1.47 by root, Sat May 12 22:04:20 2007 UTC vs.
Revision 1.83 by root, Tue Nov 3 23:44:21 2009 UTC

…		…
1	/*	1	/*
2	* CrossFire, A Multiplayer game for X-windows	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,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2002-2003 Mark Wedel & The Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen
7	*	5	*
8	* This program is free software; you can redistribute it and/or modify	6	* 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	7	* 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	8	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	9	* option) any later version.
12	*	10	*
13	* This program is distributed in the hope that it will be useful,	11	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	12	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	13	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	14	* GNU General Public License for more details.
17	*	15	*
18	* You should have received a copy of the GNU General Public License	16	* 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	17	* and the GNU General Public License along with this program. If not, see
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	18	* <http://www.gnu.org/licenses/>.
21	*	19	*
22	* The author can be reached via e-mail to <crossfire@schmorp.de>	20	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	21	*/
24		22
25	/**	23	/**
26	* \file	24	* \file
27	* Main client/server loops.	25	* Main client/server loops.
30	*	28	*
31	* loop.c mainly deals with initialization and higher level socket	29	* loop.c mainly deals with initialization and higher level socket
32	* maintanance (checking for lost connections and if data has arrived.)	30	* maintanance (checking for lost connections and if data has arrived.)
33	*/	31	*/
34		32
35	#define BG_SCRUB_RATE 4 // how often to send a face in the background
36
37	#include <global.h>	33	#include <global.h>
38	#include <sproto.h>	34	#include <sproto.h>
39	#include <sockproto.h>	35	#include <sockproto.h>
40		36
41	#include <sys/types.h>	37	#include <sys/types.h>
…		…
47	#include <unistd.h>	43	#include <unistd.h>
48	#include <arpa/inet.h>	44	#include <arpa/inet.h>
49		45
50	#include <loader.h>	46	#include <loader.h>
51		47
		48	#define BG_SCRUB_RATE 4 // how often to send a face in the background
		49
52	#define MAX_QUEUE_DEPTH 500 //TODO	50	#define MAX_QUEUE_DEPTH 50
53	#define MAX_QUEUE_BACKLOG 3. //TODO	51	#define MAX_QUEUE_BACKLOG 3.
54		52
55	void	53	void
56	client::reset_state ()	54	client::reset_state ()
57	{	55	{
58	if (!pl)	56	if (!pl)
…		…
63	}	61	}
64		62
65	void	63	void
66	client::queue_command (packet_type handler, char data, int datalen)	64	client::queue_command (packet_type handler, char data, int datalen)
67	{	65	{
68	tstamp stamp = now ();	66	tstamp stamp = NOW;
69		67
70	if (cmd_queue.size () >= MAX_QUEUE_DEPTH)	68	if (cmd_queue.size () >= MAX_QUEUE_DEPTH)
71	{	69	{
72	//TODO: just disconnect here?	70	//TODO: just disconnect here?
73	reset_state ();	71	reset_state ();
74	send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED);	72	send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED);
75	}	73	}
76	else	74	else
77	{	75	{
78	cmd_queue.push_back (command ());	76	cmd_queue.resize (cmd_queue.size () + 1);
79	command &cmd = cmd_queue.back ();	77	command &cmd = cmd_queue.back ();
80	cmd.stamp = stamp;	78	cmd.stamp = stamp;
81	cmd.handler = handler;	79	cmd.handler = handler;
82	cmd.data = salloc<char> (datalen + 1, data);	80	cmd.data = salloc<char> (datalen + 1, data);
83	cmd.datalen = datalen;	81	cmd.datalen = datalen;
…		…
85	}	83	}
86		84
87	bool	85	bool
88	client::handle_command ()	86	client::handle_command ()
89	{	87	{
90	bool skipping = false;
91
92	while (!cmd_queue.empty ()	88	if (!cmd_queue.empty ()
93	&& !(state == ST_PLAYING && pl->ob && pl->ob->speed_left <= 0.f))	89	&& state == ST_PLAYING
		90	&& pl->ob->speed_left > 0.f)
94	{	91	{
95	command &cmd = cmd_queue.front ();	92	command &cmd = cmd_queue.front ();
96		93
97	if (cmd.stamp + MAX_QUEUE_BACKLOG < now ())	94	if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW)
98	{	95	{
		96	reset_state (); // the command might actually reset some movement state etc.
		97
99	if (!skipping)	98	if (pl)
		99	pl->failmsg (
		100	"Cannot keep up with your commands, ignoring them! "
		101	"H<Your character cannot keep up with the instructions you give G<him\|her>. "
		102	"Try issuing commands slower, or, if G<he\|she> is incapacitated (paralyzed and so on), "
		103	"wait till your character can act again.\n\nIf G<he\|she> is permanently stuck, then "
		104	"try the B<suicide> command (or use B<chat> to ask somebody to B<invite> you out).>"
100	{	105	);
101	skipping = true;
102	reset_state ();
103	send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED);
104	}
105
106	cmd_queue.pop_front ();
107	}	106	}
108	else	107	else
109	{
110	execute (cmd.handler, cmd.data, cmd.datalen);	108	execute (cmd.handler, cmd.data, cmd.datalen);
		109
		110	sfree<char> (cmd.data, cmd.datalen + 1);
111	cmd_queue.pop_front ();	111	cmd_queue.pop_front ();
112	return true;	112	return true;
113	}
114	}	113	}
115		114	else
116	return false;	115	return false;
117	}
118
119	void
120	flush_sockets (void)
121	{
122	for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
123	(*i)->flush ();
124	}
125
126	/**
127	* This checks the sockets for input, does the right thing.
128	*
129	* A bit of this code is grabbed out of socket.c
130	* There are 2 lists we need to look through - init_sockets is a list
131	*
132	*/
133	void
134	doeric_server (void)
135	{
136	#ifdef CS_LOGSTATS
137	if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME)
138	write_cs_stats ();
139	#endif
140
141	//TODO: should not be done here, either
142	for (unsigned i = 0; i < clients.size (); ++i)
143	{
144	client *ns = clients [i];
145
146	ns->tick ();
147	ns->refcnt_chk ();
148	}
149	}	116	}
150		117
151	void	118	void
152	client::tick ()	119	client::tick ()
153	{	120	{
154	if (!pl \|\| destroyed ())	121	if (!pl \|\| destroyed ())
155	return;	122	return;
		123
		124	pl->dirty = true;
156		125
157	/* Update the players stats once per tick. More efficient than	126	/* Update the players stats once per tick. More efficient than
158	* sending them whenever they change, and probably just as useful	127	* sending them whenever they change, and probably just as useful
159	*/	128	*/
160	esrv_update_stats (pl);	129	esrv_update_stats (pl);
161		130
162	if (last_weight != -1 && last_weight != WEIGHT (pl->ob))	131	sint32 weight = pl->ob->client_weight ();
		132
		133	if (last_weight != weight)
163	{	134	{
		135	pl->ob->update_stats ();
164	esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);	136	esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
165	if (last_weight != WEIGHT (pl->ob))
166	LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n",
167	(unsigned long) last_weight, WEIGHT (pl->ob));
168	}	137	}
169		138
170	draw_client_map (pl->ob);	139	draw_client_map (pl);
171		140
172	if (update_look)	141	if (update_look)
173	esrv_draw_look (pl->ob);	142	esrv_draw_look (pl);
174		143
175	if (askface.empty () && !partial_face_ofs)	144	mapinfo_queue_run ();
		145
		146	#if HAVE_TCP_INFO
		147	// check time of last ack, and, if too old, kill connection
		148	socklen_t len = sizeof (tcpi);
		149
		150	if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi))
		151	{
		152	if (tcpi.tcpi_snd_mss)
		153	mss = tcpi.tcpi_snd_mss;
		154
		155	#if 0
		156	fprintf (stderr, "uack %d ack %d lost %d ret %d fack %d sst %d cwnd %d mss %d pmtu %d advmss %d EXC %d\n",
		157	tcpi.tcpi_unacked,
		158	tcpi.tcpi_sacked,
		159	tcpi.tcpi_lost,
		160	tcpi.tcpi_retrans,
		161	tcpi.tcpi_fackets,
		162	tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss,
		163
		164	tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked));
		165	#endif
		166
		167	// fast-time-out a player by checking for missing acks
		168	// do this only when player is active
		169	if (pl && pl->active
		170	&& tcpi.tcpi_last_ack_recv > int (socket_timeout * 1000))
		171	{
		172	send_msg (NDI_RED \| NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)");
		173	write_outputbuffer ();
		174
		175	LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd,
		176	(unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked);
		177	destroy ();
		178	}
		179	}
		180	#endif
		181
		182	rate_avail = min (max_rate + mss, rate_avail + max_rate);
		183
		184	int max_send = rate_avail;
		185
		186	#if HAVE_TCP_INFO
		187	// further restrict the available bandwidth by the excess bandwidth available
		188	max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss);
		189	#endif
		190
		191	// round to next-lowest mss
		192	max_send -= max_send % mss;
		193
		194	if (ixface.empty ())
176	{	195	{
177	// regularly send a new face when queue is empty	196	// regularly send a new face when queue is empty
178	if (bg_scrub && !--bg_scrub && enable_bg_scrub)	197	if (bg_scrub && !--bg_scrub)
179	while (scrub_idx < faces.size () - 1)	198	while (scrub_idx < faces.size () - 1)
180	{	199	{
181	++scrub_idx;	200	++scrub_idx;
		201
182	if (!faces_sent [scrub_idx])	202	if (!faces_sent [scrub_idx])
		203	if (faceinfo *f = face_info (scrub_idx))
		204	if (f->type == FT_FACE \|\| f->type == FT_SOUND) // only scrub faces and sounds for now
183	{	205	{
184	send_face (scrub_idx);	206	send_face (scrub_idx, -120);
185	flush_fx ();	207	flush_fx ();
186		208
187	bg_scrub = 1; // send up to one face per tick, unless an image was requested	209	bg_scrub = 1; // send up to one fx per tick, unless an image was requested
		210	break;
		211	}
		212	}
		213	}
		214	else
		215	{
		216	bg_scrub = BG_SCRUB_RATE;
		217
		218	for (;;)
		219	{
		220	int avail = max_send - outputbuffer_len ();
		221
		222	if (avail <= 0)
		223	break;
		224
		225	ixsend &ix = ixface.back ();
		226
		227	if (facedata *d = face_data (ix.idx, faceset))
		228	{
		229	// estimate the packet header overhead "ix " + idx + (new)ofs
		230	int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs);
		231	int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen;
		232
		233	// only transfer something if the amount of data transferred
		234	// has a healthy relation to the header overhead
		235	if (chunk < 64)
188	break;	236	break;
189	}
190	}
191		237
192	rate_avail = max_rate - outputbuffer_len ();	238	chunk = min (chunk, (int)ix.ofs);
193	}
194	else
195	{
196	int ol = outputbuffer_len ();
197		239
198	rate_avail = min (max_rate, rate_avail + max_rate);
199	rate_avail -= ol;
200
201	int avail = rate_avail;
202
203	// if we can split images, transfer up to mss packets if possible
204	// but never more 768 bytes more.
205	if (fxix) avail += min (768, mss - (ol % mss));
206
207	bg_scrub = BG_SCRUB_RATE;
208
209	while (avail > 0)
210	{
211	if (partial_face_ofs)
212	{
213	if (facedata *d = face_data (partial_face, faceset))
214	{
215	// 9 bytes is enough for fx_FFFOOO, 40 leaves some room
216	int chunk = min (min (avail - 40, MAXSOCKBUF - 9), partial_face_ofs);
217
218	if (chunk <= 0)
219	break;
220
221	partial_face_ofs -= chunk;	240	ix.ofs -= chunk;
222		241
		242	//fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D
		243
223	packet sl ("ix");	244	packet sl ("ix");
224		245
225	sl << ber32 (partial_face)	246	sl << ber32 (ix.idx)
226	<< ber32 (partial_face_ofs)	247	<< ber32 (ix.ofs)
227	<< data (d->data.data () + partial_face_ofs, chunk);	248	<< data (d->data.data () + ix.ofs, chunk);
228		249
229	send_packet (sl);	250	send_packet (sl);
230	}
231	else
232	partial_face_ofs = 0;
233	}
234	else if (!askface.empty ())
235	{
236	// use a lifo to send most recently requested images
237	faceidx facenum = askface.back ();
238	askface.pop_back ();
239
240	if (fxix)
241	{
242	if (facedata *d = face_data (facenum, faceset))
243	{
244	partial_face = facenum;
245	partial_face_ofs = d->data.size ();
246	}
247	}
248	else
249	send_image (facenum);
250	}	251	}
251	else	252	else
		253	ix.ofs = 0;
		254
		255	if (!ix.ofs)
		256	{
		257	ixface.pop_back ();
		258
		259	if (ixface.empty ())
252	break;	260	break;
253		261	}
254	int consumed = ol - outputbuffer_len ();
255	avail -= consumed;
256	rate_avail -= consumed;
257	}	262	}
258	}	263	}
259	}
260		264
		265	rate_avail -= outputbuffer_len ();
		266	}
		267
		268	void
		269	client::flush_sockets (void)
		270	{
		271	for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
		272	(*i)->flush ();
		273	}
		274
		275	void
		276	client::clock (void)
		277	{
		278	for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
		279	(*i)->tick ();
		280
		281	// give them all the same chances
		282	flush_sockets ();
		283
		284	//TODO: should not be done here, either
		285	for (unsigned i = 0; i < clients.size (); ++i)
		286	clients[i]->refcnt_chk ();
		287	}
		288

Diff Legend

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

Comparing deliantra/server/socket/loop.C (file contents): Revision 1.47 by root, Sat May 12 22:04:20 2007 UTC vs. Revision 1.83 by root, Tue Nov 3 23:44:21 2009 UTC

Diff Legend

Comparing deliantra/server/socket/loop.C (file contents):
Revision 1.47 by root, Sat May 12 22:04:20 2007 UTC vs.
Revision 1.83 by root, Tue Nov 3 23:44:21 2009 UTC