server/socket/loop.C

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 *
 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
 *
 * Deliantra is free software: you can redistribute it and/or modify it under
 * the terms of the Affero GNU General Public License as published by the
 * Free Software Foundation, either version 3 of the License, or (at your
 * option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the Affero GNU General Public License
 * and the GNU General Public License along with this program. If not, see
 * <http://www.gnu.org/licenses/>.
 *
 * The authors can be reached via e-mail to <support@deliantra.net>
 */

/**
 * \file
 * Main client/server loops.
 *
 * \date 2003-12-02
 *
 * loop.c mainly deals with initialization and higher level socket
 * maintanance (checking for lost connections and if data has arrived.)
 */

#include <global.h>
#include <sproto.h>
#include <sockproto.h>

#include <sys/types.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netdb.h>

#include <unistd.h>
#include <arpa/inet.h>

#define BG_SCRUB_RATE 4 // how often to send a face in the background

#define MAX_QUEUE_DEPTH   50
#define MAX_QUEUE_BACKLOG 3.

void
client::reset_state ()
{
  if (!pl)
    return;

  pl->run_on  = 0;
  pl->fire_on = 0;
}

void
client::queue_command (packet_type *handler, char *data, int datalen)
{
  tstamp stamp = NOW;

  if (cmd_queue.size () >= MAX_QUEUE_DEPTH)
    {
      reset_state ();
      send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED);
    }
  else
    {
      cmd_queue.resize (cmd_queue.size () + 1);
      command &cmd = cmd_queue.back ();
      cmd.stamp   = stamp;
      cmd.handler = handler;
      cmd.data    = salloc<char> (datalen + 1, data);
      cmd.datalen = datalen;
    }
}

bool
client::handle_command ()
{
  if (!cmd_queue.empty ()
      && state == ST_PLAYING
      && pl->ob->speed_left > 0.f)
    {
      command &cmd = cmd_queue.front ();

      if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW)
        {
          reset_state (); // the command might actually reset some movement state etc.

          if (pl)
            pl->failmsg (
               "Cannot keep up with your commands, ignoring them! "
               "H<Your character cannot keep up with the instructions you give G<him|her>. "
               "Try issuing commands slower, or, if G<he|she> is incapacitated (paralyzed and so on), "
               "wait till your character can act again.\n\nIf G<he|she> is permanently stuck, then "
               "try the B<suicide> command (or use B<chat> to ask somebody to B<invite> you out).>"
            );
        }
      else
        execute (cmd.handler, cmd.data, cmd.datalen);

      sfree<char> (cmd.data, cmd.datalen + 1);
      cmd_queue.pop_front ();
      return true;
    }
  else
    return false;
}

void
client::tick ()
{
  if (destroyed ())
    return;

  if (pl)
    {
      pl->dirty = true;

      /* Update the players stats once per tick.  More efficient than
       * sending them whenever they change, and probably just as useful
       */
      pl->need_updated_stats ();
      esrv_update_stats (pl);

      if (pl->ns->update_spells)
        esrv_update_spells (pl);

      sint32 weight = pl->ob->client_weight ();

      if (last_weight != weight)
        {
          pl->ob->update_stats ();
          esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
        }

      draw_client_map (pl);

      if (update_look)
        esrv_draw_look (pl);

      mapinfo_queue_run ();
    }

#if HAVE_TCP_INFO
  // check time of last ack, and, if too old, kill connection
  socklen_t len = sizeof (tcpi);

  if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi))
    {
      if (tcpi.tcpi_snd_mss)
        mss = tcpi.tcpi_snd_mss;

#if 0
      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",
               tcpi.tcpi_unacked,
               tcpi.tcpi_sacked,
               tcpi.tcpi_lost,
               tcpi.tcpi_retrans,
               tcpi.tcpi_fackets,
               tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss,
               
               tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked));
#endif

      // fast-time-out a player by checking for missing acks
      // do this only when player is active
      if (pl && pl->active
          && tcpi.tcpi_last_ack_recv > int (socket_timeout * 1000))
        {
          send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)");
          write_outputbuffer ();

          LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd,
               (unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked);
          destroy ();
        }
    }
#endif

  // limit budget surplus/deficit by one mss, add per-tick budget
  rate_avail = min (rate_avail, mss) + max_rate;

  int max_send = rate_avail;

#if HAVE_TCP_INFO
  // further restrict the available bandwidth by the excess bandwidth available
  min_it (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss);
#endif

  // round to next-lowest mss
  max_send -= max_send % mss;

  if (ixface.empty ())
    {
      // regularly send a new face when queue is empty
      if (bg_scrub && !--bg_scrub)
        while (scrub_idx < faces.size () - 1)
          {
            ++scrub_idx;

            if (!faces_sent [scrub_idx])
              if (faceinfo *f = face_info (scrub_idx))
                if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now
                  {
                    send_face (scrub_idx, -120);
                    flush_fx ();

                    bg_scrub = 1; // send up to one fx per tick, unless an image was requested
                    break;
                  }
          }
    }
  else
    {
      bg_scrub = BG_SCRUB_RATE;

      for (;;)
        {
          int avail = max_send - outputbuffer_len ();

          if (avail <= 0)
            break;

          ixsend &ix = ixface.back ();

          // estimate the packet header overhead "ix " + idx + (new)ofs
          int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs);
          int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen;

          // only transfer something if the amount of data transferred
          // has a healthy relation to the header overhead
          if (chunk < 64)
            break;

          chunk = min (chunk, (int)ix.ofs);

          ix.ofs -= chunk;

          //fprintf (stderr, "i%dx %6d: %5d+%4d   (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D

          packet sl ("ix");

          sl << ber32 (ix.idx)
             << ber32 (ix.ofs)
             << data (ix.data + ix.ofs, chunk);

          send_packet (sl);

          if (!ix.ofs)
            {
              ix_pop ();

              if (ixface.empty ())
                break;
            }
        }
    }

  rate_avail -= outputbuffer_len ();
}

void
client::flush_sockets ()
{
  for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
    (*i)->flush ();
}

void
client::clock ()
{
  for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
    (*i)->tick ();

  // give them all the same chances
  flush_sockets ();

  //TODO: should not be done here, either
  for (unsigned i = 0; i < clients.size (); ++i)
    clients[i]->refcnt_chk ();
}

Revision:	1.96
Committed:	Sun Nov 11 04:29:11 2012 UTC (11 years, 6 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.95:	+2 -2 lines
Log Message:	* empty log message *
#	User	Rev	Content
1	elmex	1.1	/*
2	root	1.70	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	root	1.93	*
4	root	1.92	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	root	1.93	*
6	root	1.82	* Deliantra is free software: you can redistribute it and/or modify it under
7			* the terms of the Affero GNU General Public License as published by the
8			* Free Software Foundation, either version 3 of the License, or (at your
9			* option) any later version.
10	root	1.93	*
11	root	1.55	* This program is distributed in the hope that it will be useful,
12			* but WITHOUT ANY WARRANTY; without even the implied warranty of
13			* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14			* GNU General Public License for more details.
15	root	1.93	*
16	root	1.82	* You should have received a copy of the Affero GNU General Public License
17			* and the GNU General Public License along with this program. If not, see
18			* <http://www.gnu.org/licenses/>.
19	root	1.93	*
20	root	1.70	* The authors can be reached via e-mail to <support@deliantra.net>
21	pippijn	1.39	*/
22	elmex	1.1
23			/**
24			* \file
25			* Main client/server loops.
26			*
27			* \date 2003-12-02
28			*
29			* loop.c mainly deals with initialization and higher level socket
30	root	1.26	* maintanance (checking for lost connections and if data has arrived.)
31	elmex	1.1	*/
32
33			#include <global.h>
34	root	1.10	#include <sproto.h>
35			#include <sockproto.h>
36	elmex	1.1
37	pippijn	1.8	#include <sys/types.h>
38			#include <sys/time.h>
39			#include <sys/socket.h>
40			#include <netinet/in.h>
41			#include <netdb.h>
42	elmex	1.1
43	root	1.16	#include <unistd.h>
44			#include <arpa/inet.h>
45	elmex	1.1
46	root	1.51	#define BG_SCRUB_RATE 4 // how often to send a face in the background
47
48	root	1.65	#define MAX_QUEUE_DEPTH 50
49	root	1.51	#define MAX_QUEUE_BACKLOG 3.
50	elmex	1.1
51	root	1.21	void
52			client::reset_state ()
53			{
54			if (!pl)
55			return;
56
57			pl->run_on = 0;
58			pl->fire_on = 0;
59			}
60	elmex	1.1
61	root	1.20	void
62			client::queue_command (packet_type handler, char data, int datalen)
63	root	1.6	{
64	root	1.51	tstamp stamp = NOW;
65	elmex	1.1
66	root	1.20	if (cmd_queue.size () >= MAX_QUEUE_DEPTH)
67	root	1.21	{
68			reset_state ();
69			send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED);
70			}
71	root	1.20	else
72	root	1.24	{
73	root	1.71	cmd_queue.resize (cmd_queue.size () + 1);
74	root	1.24	command &cmd = cmd_queue.back ();
75			cmd.stamp = stamp;
76			cmd.handler = handler;
77	root	1.25	cmd.data = salloc<char> (datalen + 1, data);
78	root	1.24	cmd.datalen = datalen;
79			}
80	root	1.20	}
81	elmex	1.1
82	root	1.20	bool
83			client::handle_command ()
84	elmex	1.1	{
85	root	1.48	if (!cmd_queue.empty ()
86			&& state == ST_PLAYING
87			&& pl->ob->speed_left > 0.f)
88	root	1.26	{
89			command &cmd = cmd_queue.front ();
90	root	1.6
91	root	1.51	if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW)
92	root	1.26	{
93	root	1.79	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	root	1.26	}
104			else
105	root	1.48	execute (cmd.handler, cmd.data, cmd.datalen);
106
107	root	1.71	sfree<char> (cmd.data, cmd.datalen + 1);
108	root	1.48	cmd_queue.pop_front ();
109			return true;
110	root	1.21	}
111	root	1.48	else
112			return false;
113	elmex	1.1	}
114
115	root	1.6	void
116	root	1.42	client::tick ()
117			{
118	root	1.94	if (destroyed ())
119	root	1.42	return;
120	root	1.37
121	root	1.94	if (pl)
122			{
123			pl->dirty = true;
124	root	1.75
125	root	1.94	/* 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	root	1.85
131	root	1.94	if (pl->ns->update_spells)
132			esrv_update_spells (pl);
133	root	1.20
134	root	1.94	sint32 weight = pl->ob->client_weight ();
135	root	1.74
136	root	1.94	if (last_weight != weight)
137			{
138			pl->ob->update_stats ();
139			esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
140			}
141	root	1.6
142	root	1.94	draw_client_map (pl);
143	root	1.20
144	root	1.94	if (update_look)
145			esrv_draw_look (pl);
146	root	1.41
147	root	1.94	mapinfo_queue_run ();
148			}
149	root	1.69
150	root	1.66	#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	root	1.80	// fast-time-out a player by checking for missing acks
172	root	1.66	// do this only when player is active
173			if (pl && pl->active
174	root	1.81	&& tcpi.tcpi_last_ack_recv > int (socket_timeout * 1000))
175	root	1.66	{
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	root	1.90	// limit budget surplus/deficit by one mss, add per-tick budget
187			rate_avail = min (rate_avail, mss) + max_rate;
188	root	1.66
189			int max_send = rate_avail;
190
191			#if HAVE_TCP_INFO
192			// further restrict the available bandwidth by the excess bandwidth available
193	root	1.90	min_it (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss);
194	root	1.66	#endif
195
196	root	1.78	// round to next-lowest mss
197			max_send -= max_send % mss;
198	root	1.66
199	root	1.65	if (ixface.empty ())
200			{
201			// regularly send a new face when queue is empty
202	root	1.78	if (bg_scrub && !--bg_scrub)
203	root	1.65	while (scrub_idx < faces.size () - 1)
204			{
205			++scrub_idx;
206
207			if (!faces_sent [scrub_idx])
208			if (faceinfo *f = face_info (scrub_idx))
209	root	1.67	if (f->type == FT_FACE \|\| f->type == FT_SOUND) // only scrub faces and sounds for now
210	root	1.65	{
211			send_face (scrub_idx, -120);
212			flush_fx ();
213
214	root	1.66	bg_scrub = 1; // send up to one fx per tick, unless an image was requested
215	root	1.65	break;
216			}
217			}
218			}
219			else
220			{
221	root	1.66	bg_scrub = BG_SCRUB_RATE;
222	root	1.65
223	root	1.66	for (;;)
224			{
225			int avail = max_send - outputbuffer_len ();
226	root	1.64
227	root	1.66	if (avail <= 0)
228			break;
229	root	1.65
230			ixsend &ix = ixface.back ();
231	root	1.44
232	root	1.95	// 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	root	1.46
241	root	1.95	chunk = min (chunk, (int)ix.ofs);
242	root	1.46
243	root	1.95	ix.ofs -= chunk;
244	root	1.46
245	root	1.95	//fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D
246	root	1.59
247	root	1.95	packet sl ("ix");
248	root	1.46
249	root	1.95	sl << ber32 (ix.idx)
250			<< ber32 (ix.ofs)
251	root	1.96	<< data (ix.data + ix.ofs, chunk);
252	root	1.46
253	root	1.95	send_packet (sl);
254	root	1.44
255	root	1.65	if (!ix.ofs)
256			{
257	root	1.96	ix_pop ();
258	root	1.56
259	root	1.65	if (ixface.empty ())
260			break;
261	root	1.54	}
262	root	1.44	}
263			}
264	root	1.66
265			rate_avail -= outputbuffer_len ();
266			}
267
268			void
269	root	1.86	client::flush_sockets ()
270	root	1.66	{
271			for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
272			(*i)->flush ();
273			}
274
275			void
276	root	1.86	client::clock ()
277	root	1.66	{
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	elmex	1.1	}
288	root	1.43