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

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

Diff Legend

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

Comparing deliantra/server/socket/loop.C (file contents): Revision 1.29 by root, Tue Dec 19 04:58:05 2006 UTC vs. Revision 1.100 by root, Wed Nov 16 23:42:03 2016 UTC

Diff Legend

Comparing deliantra/server/socket/loop.C (file contents):
Revision 1.29 by root, Tue Dec 19 04:58:05 2006 UTC vs.
Revision 1.100 by root, Wed Nov 16 23:42:03 2016 UTC