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

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.102 by root, Sun Nov 18 00:37:11 2018 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.102 by root, Sun Nov 18 00:37:11 2018 UTC