server/socket/loop.C

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 * 
 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
 * Copyright (©) 2002-2003,2007 Mark Wedel & The Crossfire Development Team
 * Copyright (©) 1992,2007 Frank Tore Johansen
 * 
 * Deliantra is free software: you can redistribute it and/or modify
 * it under the terms of the 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 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>

#include <loader.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.

// disconnect a socket after this many seconds without an ack
#define SOCKET_TIMEOUT 16.

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)
    {
      //TODO: just disconnect here?
      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 ();
          send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED);
        }
      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 (!pl || destroyed ())
    return;

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

  if (last_weight != -1 && last_weight != WEIGHT (pl->ob))
    {
      esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
      if (last_weight != WEIGHT (pl->ob))
        LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n",
             (unsigned long) last_weight, WEIGHT (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 missign 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

  rate_avail = min (max_rate + mss, rate_avail + max_rate);

  int max_send = rate_avail;

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

  // if we can split images, round to next-lowest mss
  if (fxix) max_send -= max_send % mss;

  if (ixface.empty ())
    {
      // regularly send a new face when queue is empty
      if (bg_scrub && !--bg_scrub && enable_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 ();

          if (facedata *d = face_data (ix.idx, faceset))
            {
              if (fxix)
                {
                  // 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 (d->data.data () + ix.ofs, chunk);

                  send_packet (sl);
                }
              else
                {
                  send_image (ix.idx);
                  ix.ofs = 0;
                }
            }
          else
            ix.ofs = 0;

          if (!ix.ofs)
            {
              ixface.pop_back ();

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

  rate_avail -= outputbuffer_len ();
}

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

void
client::clock (void)
{
  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.72
Committed:	Thu Mar 13 12:20:52 2008 UTC (16 years, 2 months ago) by root
Content type:	text/plain
Branch:	MAIN
CVS Tags:	rel-2_5, rel-2_43, rel-2_42
Changes since 1.71:	+1 -1 lines
Log Message:	* empty log message *
#	Content
1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2002-2003,2007 Mark Wedel & The Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*
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
10	* the Free Software Foundation, either version 3 of the License, or
11	* (at your option) any later version.
12	*
13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.
17	*
18	* You should have received a copy of the GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	*
21	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/
23
24	/**
25	* \file
26	* Main client/server loops.
27	*
28	* \date 2003-12-02
29	*
30	* loop.c mainly deals with initialization and higher level socket
31	* maintanance (checking for lost connections and if data has arrived.)
32	*/
33
34	#include <global.h>
35	#include <sproto.h>
36	#include <sockproto.h>
37
38	#include <sys/types.h>
39	#include <sys/time.h>
40	#include <sys/socket.h>
41	#include <netinet/in.h>
42	#include <netdb.h>
43
44	#include <unistd.h>
45	#include <arpa/inet.h>
46
47	#include <loader.h>
48
49	#define BG_SCRUB_RATE 4 // how often to send a face in the background
50
51	#define MAX_QUEUE_DEPTH 50
52	#define MAX_QUEUE_BACKLOG 3.
53
54	// disconnect a socket after this many seconds without an ack
55	#define SOCKET_TIMEOUT 16.
56
57	void
58	client::reset_state ()
59	{
60	if (!pl)
61	return;
62
63	pl->run_on = 0;
64	pl->fire_on = 0;
65	}
66
67	void
68	client::queue_command (packet_type handler, char data, int datalen)
69	{
70	tstamp stamp = NOW;
71
72	if (cmd_queue.size () >= MAX_QUEUE_DEPTH)
73	{
74	//TODO: just disconnect here?
75	reset_state ();
76	send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED);
77	}
78	else
79	{
80	cmd_queue.resize (cmd_queue.size () + 1);
81	command &cmd = cmd_queue.back ();
82	cmd.stamp = stamp;
83	cmd.handler = handler;
84	cmd.data = salloc<char> (datalen + 1, data);
85	cmd.datalen = datalen;
86	}
87	}
88
89	bool
90	client::handle_command ()
91	{
92	if (!cmd_queue.empty ()
93	&& state == ST_PLAYING
94	&& pl->ob->speed_left > 0.f)
95	{
96	command &cmd = cmd_queue.front ();
97
98	if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW)
99	{
100	reset_state ();
101	send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED);
102	}
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	/* Update the players stats once per tick. More efficient than
121	* sending them whenever they change, and probably just as useful
122	*/
123	esrv_update_stats (pl);
124
125	if (last_weight != -1 && last_weight != WEIGHT (pl->ob))
126	{
127	esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
128	if (last_weight != WEIGHT (pl->ob))
129	LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n",
130	(unsigned long) last_weight, WEIGHT (pl->ob));
131	}
132
133	draw_client_map (pl);
134
135	if (update_look)
136	esrv_draw_look (pl);
137
138	mapinfo_queue_run ();
139
140	#if HAVE_TCP_INFO
141	// check time of last ack, and, if too old, kill connection
142	socklen_t len = sizeof (tcpi);
143
144	if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi))
145	{
146	if (tcpi.tcpi_snd_mss)
147	mss = tcpi.tcpi_snd_mss;
148
149	#if 0
150	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",
151	tcpi.tcpi_unacked,
152	tcpi.tcpi_sacked,
153	tcpi.tcpi_lost,
154	tcpi.tcpi_retrans,
155	tcpi.tcpi_fackets,
156	tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss,
157
158	tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked));
159	#endif
160
161	// fast-time-out a player by checking for missign acks
162	// do this only when player is active
163	if (pl && pl->active
164	&& tcpi.tcpi_last_ack_recv > int (SOCKET_TIMEOUT * 1000))
165	{
166	send_msg (NDI_RED \| NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)");
167	write_outputbuffer ();
168
169	LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd,
170	(unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked);
171	destroy ();
172	}
173	}
174	#endif
175
176	rate_avail = min (max_rate + mss, rate_avail + max_rate);
177
178	int max_send = rate_avail;
179
180	#if HAVE_TCP_INFO
181	// further restrict the available bandwidth by the excess bandwidth available
182	max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss);
183	#endif
184
185	// if we can split images, round to next-lowest mss
186	if (fxix) max_send -= max_send % mss;
187
188	if (ixface.empty ())
189	{
190	// regularly send a new face when queue is empty
191	if (bg_scrub && !--bg_scrub && enable_bg_scrub)
192	while (scrub_idx < faces.size () - 1)
193	{
194	++scrub_idx;
195
196	if (!faces_sent [scrub_idx])
197	if (faceinfo *f = face_info (scrub_idx))
198	if (f->type == FT_FACE \|\| f->type == FT_SOUND) // only scrub faces and sounds for now
199	{
200	send_face (scrub_idx, -120);
201	flush_fx ();
202
203	bg_scrub = 1; // send up to one fx per tick, unless an image was requested
204	break;
205	}
206	}
207	}
208	else
209	{
210	bg_scrub = BG_SCRUB_RATE;
211
212	for (;;)
213	{
214	int avail = max_send - outputbuffer_len ();
215
216	if (avail <= 0)
217	break;
218
219	ixsend &ix = ixface.back ();
220
221	if (facedata *d = face_data (ix.idx, faceset))
222	{
223	if (fxix)
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	{
250	send_image (ix.idx);
251	ix.ofs = 0;
252	}
253	}
254	else
255	ix.ofs = 0;
256
257	if (!ix.ofs)
258	{
259	ixface.pop_back ();
260
261	if (ixface.empty ())
262	break;
263	}
264	}
265	}
266
267	rate_avail -= outputbuffer_len ();
268	}
269
270	void
271	client::flush_sockets (void)
272	{
273	for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
274	(*i)->flush ();
275	}
276
277	void
278	client::clock (void)
279	{
280	for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
281	(*i)->tick ();
282
283	// give them all the same chances
284	flush_sockets ();
285
286	//TODO: should not be done here, either
287	for (unsigned i = 0; i < clients.size (); ++i)
288	clients[i]->refcnt_chk ();
289	}
290