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

Comparing deliantra/server/socket/loop.C (file contents):
Revision 1.38 by root, Sun Jan 14 21:20:51 2007 UTC vs.
Revision 1.78 by root, Sat Dec 27 01:25:00 2008 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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	Copyright (C) 2002-2003 Mark Wedel & The Crossfire Development Team	5	* Copyright (©) 2002-2003,2007 Mark Wedel & The Crossfire Development Team
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
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.	20	*
21		21	* The authors can be reached via e-mail to <support@deliantra.net>
22	The author can be reached via e-mail to <crossfire@schmorp.de>
23	*/	22	*/
24		23
25	/**	24	/**
26	* \file	25	* \file
27	* Main client/server loops.	26	* Main client/server loops.
28	*	27	*
30	*	29	*
31	* loop.c mainly deals with initialization and higher level socket	30	* loop.c mainly deals with initialization and higher level socket
32	* maintanance (checking for lost connections and if data has arrived.)	31	* maintanance (checking for lost connections and if data has arrived.)
33	*/	32	*/
34		33
35
36	#include <global.h>	34	#include <global.h>
37	#include <sproto.h>	35	#include <sproto.h>
38	#include <sockproto.h>	36	#include <sockproto.h>
39		37
40	#include <sys/types.h>	38	#include <sys/types.h>
…		…
46	#include <unistd.h>	44	#include <unistd.h>
47	#include <arpa/inet.h>	45	#include <arpa/inet.h>
48		46
49	#include <loader.h>	47	#include <loader.h>
50		48
		49	#define BG_SCRUB_RATE 4 // how often to send a face in the background
		50
51	#define MAX_QUEUE_DEPTH 500 //TODO	51	#define MAX_QUEUE_DEPTH 50
52	#define MAX_QUEUE_BACKLOG 3. //TODO	52	#define MAX_QUEUE_BACKLOG 3.
		53
		54	// disconnect a socket after this many seconds without an ack
		55	#define SOCKET_TIMEOUT 16.
53		56
54	void	57	void
55	client::reset_state ()	58	client::reset_state ()
56	{	59	{
57	if (!pl)	60	if (!pl)
…		…
62	}	65	}
63		66
64	void	67	void
65	client::queue_command (packet_type handler, char data, int datalen)	68	client::queue_command (packet_type handler, char data, int datalen)
66	{	69	{
67	tstamp stamp = now ();	70	tstamp stamp = NOW;
68		71
69	if (cmd_queue.size () >= MAX_QUEUE_DEPTH)	72	if (cmd_queue.size () >= MAX_QUEUE_DEPTH)
70	{	73	{
71	//TODO: just disconnect here?	74	//TODO: just disconnect here?
72	reset_state ();	75	reset_state ();
73	send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED);	76	send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED);
74	}	77	}
75	else	78	else
76	{	79	{
77	cmd_queue.push_back (command ());	80	cmd_queue.resize (cmd_queue.size () + 1);
78	command &cmd = cmd_queue.back ();	81	command &cmd = cmd_queue.back ();
79	cmd.stamp = stamp;	82	cmd.stamp = stamp;
80	cmd.handler = handler;	83	cmd.handler = handler;
81	cmd.data = salloc<char> (datalen + 1, data);	84	cmd.data = salloc<char> (datalen + 1, data);
82	cmd.datalen = datalen;	85	cmd.datalen = datalen;
…		…
84	}	87	}
85		88
86	bool	89	bool
87	client::handle_command ()	90	client::handle_command ()
88	{	91	{
89	bool skipping = false;
90
91	while (!cmd_queue.empty ()	92	if (!cmd_queue.empty ()
92	&& !(state == ST_PLAYING && pl->ob && pl->ob->speed_left <= 0))	93	&& state == ST_PLAYING
		94	&& pl->ob->speed_left > 0.f)
93	{	95	{
94	command &cmd = cmd_queue.front ();	96	command &cmd = cmd_queue.front ();
95		97
96	if (cmd.stamp + MAX_QUEUE_BACKLOG < now ())	98	if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW)
97	{	99	{
98	if (!skipping)
99	{
100	skipping = true;
101	reset_state ();	100	reset_state ();
102	send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED);	101	send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED);
103	}
104
105	cmd_queue.pop_front ();
106	}	102	}
107	else	103	else
		104	execute (cmd.handler, cmd.data, cmd.datalen);
		105
		106	sfree<char> (cmd.data, cmd.datalen + 1);
		107	cmd_queue.pop_front ();
		108	return true;
		109	}
		110	else
		111	return false;
		112	}
		113
		114	void
		115	client::tick ()
		116	{
		117	if (!pl \|\| destroyed ())
		118	return;
		119
		120	pl->dirty = true;
		121
		122	/* Update the players stats once per tick. More efficient than
		123	* sending them whenever they change, and probably just as useful
		124	*/
		125	esrv_update_stats (pl);
		126
		127	sint32 weight = pl->ob->client_weight ();
		128
		129	if (last_weight != weight)
		130	{
		131	pl->ob->update_stats ();
		132	esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
		133	}
		134
		135	draw_client_map (pl);
		136
		137	if (update_look)
		138	esrv_draw_look (pl);
		139
		140	mapinfo_queue_run ();
		141
		142	#if HAVE_TCP_INFO
		143	// check time of last ack, and, if too old, kill connection
		144	socklen_t len = sizeof (tcpi);
		145
		146	if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi))
		147	{
		148	if (tcpi.tcpi_snd_mss)
		149	mss = tcpi.tcpi_snd_mss;
		150
		151	#if 0
		152	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",
		153	tcpi.tcpi_unacked,
		154	tcpi.tcpi_sacked,
		155	tcpi.tcpi_lost,
		156	tcpi.tcpi_retrans,
		157	tcpi.tcpi_fackets,
		158	tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss,
		159
		160	tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked));
		161	#endif
		162
		163	// fast-time-out a player by checking for missign acks
		164	// do this only when player is active
		165	if (pl && pl->active
		166	&& tcpi.tcpi_last_ack_recv > int (SOCKET_TIMEOUT * 1000))
108	{	167	{
109	execute (cmd.handler, cmd.data, cmd.datalen);	168	send_msg (NDI_RED \| NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)");
110	cmd_queue.pop_front ();	169	write_outputbuffer ();
111	return true;	170
		171	LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd,
		172	(unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked);
		173	destroy ();
112	}	174	}
113	}	175	}
		176	#endif
114		177
115	return false;	178	rate_avail = min (max_rate + mss, rate_avail + max_rate);
116	}
117		179
		180	int max_send = rate_avail;
		181
		182	#if HAVE_TCP_INFO
		183	// further restrict the available bandwidth by the excess bandwidth available
		184	max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss);
		185	#endif
		186
		187	// round to next-lowest mss
		188	max_send -= max_send % mss;
		189
		190	if (ixface.empty ())
		191	{
		192	// regularly send a new face when queue is empty
		193	if (bg_scrub && !--bg_scrub)
		194	while (scrub_idx < faces.size () - 1)
		195	{
		196	++scrub_idx;
		197
		198	if (!faces_sent [scrub_idx])
		199	if (faceinfo *f = face_info (scrub_idx))
		200	if (f->type == FT_FACE \|\| f->type == FT_SOUND) // only scrub faces and sounds for now
		201	{
		202	send_face (scrub_idx, -120);
		203	flush_fx ();
		204
		205	bg_scrub = 1; // send up to one fx per tick, unless an image was requested
		206	break;
		207	}
		208	}
		209	}
		210	else
		211	{
		212	bg_scrub = BG_SCRUB_RATE;
		213
		214	for (;;)
		215	{
		216	int avail = max_send - outputbuffer_len ();
		217
		218	if (avail <= 0)
		219	break;
		220
		221	ixsend &ix = ixface.back ();
		222
		223	if (facedata *d = face_data (ix.idx, faceset))
		224	{
		225	// estimate the packet header overhead "ix " + idx + (new)ofs
		226	int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs);
		227	int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen;
		228
		229	// only transfer something if the amount of data transferred
		230	// has a healthy relation to the header overhead
		231	if (chunk < 64)
		232	break;
		233
		234	chunk = min (chunk, (int)ix.ofs);
		235
		236	ix.ofs -= chunk;
		237
		238	//fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D
		239
		240	packet sl ("ix");
		241
		242	sl << ber32 (ix.idx)
		243	<< ber32 (ix.ofs)
		244	<< data (d->data.data () + ix.ofs, chunk);
		245
		246	send_packet (sl);
		247	}
		248	else
		249	ix.ofs = 0;
		250
		251	if (!ix.ofs)
		252	{
		253	ixface.pop_back ();
		254
		255	if (ixface.empty ())
		256	break;
		257	}
		258	}
		259	}
		260
		261	rate_avail -= outputbuffer_len ();
		262	}
		263
118	void	264	void
119	flush_sockets (void)	265	client::flush_sockets (void)
120	{	266	{
121	for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)	267	for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
122	(*i)->flush ();	268	(*i)->flush ();
123	}	269	}
124		270
125	/**
126	* This checks the sockets for input, does the right thing.
127	*
128	* A bit of this code is grabbed out of socket.c
129	* There are 2 lists we need to look through - init_sockets is a list
130	*
131	*/
132	void	271	void
133	doeric_server (void)	272	client::clock (void)
134	{	273	{
135	#ifdef CS_LOGSTATS	274	for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
136	if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME)	275	(*i)->tick ();
137	write_cs_stats ();	276
138	#endif	277	// give them all the same chances
		278	flush_sockets ();
139		279
140	//TODO: should not be done here, either	280	//TODO: should not be done here, either
141	for (int i = 0; i < clients.size (); ++i)	281	for (unsigned i = 0; i < clients.size (); ++i)
142	{
143	client *s = clients [i];
144	player *pl = s->pl;
145
146	if (pl && pl->ns && !pl->ns->destroyed ())
147	{
148	client *ns = pl->ns;
149
150	/* Update the players stats once per tick. More efficient than
151	* sending them whenever they change, and probably just as useful
152	*/
153	esrv_update_stats (pl);
154
155	if (ns->last_weight != -1 && ns->last_weight != WEIGHT (pl->ob))
156	{
157	esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
158	if (ns->last_weight != WEIGHT (pl->ob))
159	LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n",
160	(unsigned long) ns->last_weight, WEIGHT (pl->ob));
161	}
162
163	draw_client_map (pl->ob);
164
165	if (s->update_look)
166	esrv_draw_look (pl->ob);
167	}
168
169	s->refcnt_chk ();	282	clients[i]->refcnt_chk ();
170	}
171	}	283	}
172		284

Diff Legend

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

Comparing deliantra/server/socket/loop.C (file contents): Revision 1.38 by root, Sun Jan 14 21:20:51 2007 UTC vs. Revision 1.78 by root, Sat Dec 27 01:25:00 2008 UTC

Diff Legend

Comparing deliantra/server/socket/loop.C (file contents):
Revision 1.38 by root, Sun Jan 14 21:20:51 2007 UTC vs.
Revision 1.78 by root, Sat Dec 27 01:25:00 2008 UTC