server/socket/loop.C

/*
 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
 * 
 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
 * Copyright (©) 2002-2003,2007 Mark Wedel & The Crossfire Development Team
 * Copyright (©) 1992,2007 Frank Tore Johansen
 * 
 * Crossfire TRT 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 <crossfire@schmorp.de>
 */

/**
 * \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   500
#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)
    {
      //TODO: just disconnect here?
      reset_state ();
      send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED);
    }
  else
    {
      cmd_queue.push_back (command ());
      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);

      cmd_queue.pop_front ();
      return true;
    }
  else
    return false;
}

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

/**
 * This checks the sockets for input, does the right thing.
 *
 * A bit of this code is grabbed out of socket.c
 * There are 2 lists we need to look through - init_sockets is a list
 * 
 */
void
doeric_server (void)
{
  //TODO: should not be done here, either
  for (unsigned i = 0; i < clients.size (); ++i)
    {
      client *ns = clients [i];

      ns->tick ();
      ns->refcnt_chk ();
    }
}

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);

  bool overload = false;

#if HAVE_TCP_INFO
  // do bandwidth checking
  if (tcpi.tcpi_unacked + 1 > max (4, tcpi.tcpi_snd_cwnd))
    {
      overload = true;
      if (next_rate_adjust <= NOW)
        {
          next_rate_adjust = NOW + 2;
          max_rate = max (max_rate >> 1, int (5000 * TICK));
          LOG (llevDebug, "tcp %s overloaded (%d + 1 > 4 | %d), rate now %d\n",
               host, (int)tcpi.tcpi_unacked, (int)tcpi.tcpi_snd_cwnd, int (max_rate / TICK));//D
          send_packet_printf ("drawinfo %d Due to possible network congestion, your output-rate has been reduced to %dbps.",
                              NDI_RED, int (max_rate / TICK));
        }
    }
#endif

  if (!overload)
    {
      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) // only scrub faces for now
                      {
                        send_face (scrub_idx, -120);
                        flush_fx ();

                        bg_scrub = 1; // send up to one face per tick, unless an image was requested
                        break;
                      }
              }

          rate_avail = max_rate - outputbuffer_len ();
        }
      else
        {
          int ol = outputbuffer_len ();

          rate_avail = min (max_rate, rate_avail + max_rate);
          rate_avail -= ol;

          int avail = rate_avail;

          // if we can split images, transfer up to mss-sized packets if possible
          // but never 768 bytes more.
          if (fxix) avail += min (768, mss - (ol % mss));

          bg_scrub = BG_SCRUB_RATE;

          while (avail > 0)
            {
              ixsend &ix = ixface.back ();

              if (facedata *d = face_data (ix.idx, faceset))
                {
                  if (fxix)
                    {
                      // only transfer something if the amount of data transferred
                      // has a healthy relation to the header overhead
                      if (avail <= 40)
                        break;

                      // 9 bytes is enough for fx_FFFOOO
                      int chunk = min (min (avail, MAXSOCKBUF - 9), (int)ix.ofs);

                      if (chunk <= 0)
                        break;

                      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;

              int consumed = outputbuffer_len () - ol;

              avail      -= consumed;
              rate_avail -= consumed;

              ol = outputbuffer_len ();

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

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

Revision:	1.64
Committed:	Sat Jul 28 00:45:05 2007 UTC (16 years, 9 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.63:	+37 -35 lines
Log Message:	added volume to sound effect packet, tuned overload management
#	User	Rev	Content
1	elmex	1.1	/*
2	root	1.55	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3	pippijn	1.39	*
4	root	1.49	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5			* Copyright (©) 2002-2003,2007 Mark Wedel & The Crossfire Development Team
6			* Copyright (©) 1992,2007 Frank Tore Johansen
7			*
8	root	1.55	* Crossfire TRT 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	root	1.49	*
21			* The authors can be reached via e-mail to <crossfire@schmorp.de>
22	pippijn	1.39	*/
23	elmex	1.1
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	root	1.26	* maintanance (checking for lost connections and if data has arrived.)
32	elmex	1.1	*/
33
34			#include <global.h>
35	root	1.10	#include <sproto.h>
36			#include <sockproto.h>
37	elmex	1.1
38	pippijn	1.8	#include <sys/types.h>
39			#include <sys/time.h>
40			#include <sys/socket.h>
41			#include <netinet/in.h>
42			#include <netdb.h>
43	elmex	1.1
44	root	1.16	#include <unistd.h>
45			#include <arpa/inet.h>
46	elmex	1.1
47			#include <loader.h>
48
49	root	1.51	#define BG_SCRUB_RATE 4 // how often to send a face in the background
50
51			#define MAX_QUEUE_DEPTH 500
52			#define MAX_QUEUE_BACKLOG 3.
53	elmex	1.1
54	root	1.21	void
55			client::reset_state ()
56			{
57			if (!pl)
58			return;
59
60			pl->run_on = 0;
61			pl->fire_on = 0;
62			}
63	elmex	1.1
64	root	1.20	void
65			client::queue_command (packet_type handler, char data, int datalen)
66	root	1.6	{
67	root	1.51	tstamp stamp = NOW;
68	elmex	1.1
69	root	1.20	if (cmd_queue.size () >= MAX_QUEUE_DEPTH)
70	root	1.21	{
71			//TODO: just disconnect here?
72			reset_state ();
73			send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED);
74			}
75	root	1.20	else
76	root	1.24	{
77			cmd_queue.push_back (command ());
78			command &cmd = cmd_queue.back ();
79			cmd.stamp = stamp;
80			cmd.handler = handler;
81	root	1.25	cmd.data = salloc<char> (datalen + 1, data);
82	root	1.24	cmd.datalen = datalen;
83			}
84	root	1.20	}
85	elmex	1.1
86	root	1.20	bool
87			client::handle_command ()
88	elmex	1.1	{
89	root	1.48	if (!cmd_queue.empty ()
90			&& state == ST_PLAYING
91			&& pl->ob->speed_left > 0.f)
92	root	1.26	{
93			command &cmd = cmd_queue.front ();
94	root	1.6
95	root	1.51	if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW)
96	root	1.26	{
97	root	1.48	reset_state ();
98			send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED);
99	root	1.26	}
100			else
101	root	1.48	execute (cmd.handler, cmd.data, cmd.datalen);
102
103			cmd_queue.pop_front ();
104			return true;
105	root	1.21	}
106	root	1.48	else
107			return false;
108	elmex	1.1	}
109
110	root	1.6	void
111			flush_sockets (void)
112	elmex	1.1	{
113	root	1.19	for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
114	root	1.31	(*i)->flush ();
115	elmex	1.1	}
116
117			/**
118	root	1.10	* This checks the sockets for input, does the right thing.
119	elmex	1.1	*
120			* A bit of this code is grabbed out of socket.c
121			* There are 2 lists we need to look through - init_sockets is a list
122			*
123			*/
124	root	1.6	void
125			doeric_server (void)
126	elmex	1.1	{
127	root	1.33	//TODO: should not be done here, either
128	pippijn	1.40	for (unsigned i = 0; i < clients.size (); ++i)
129	root	1.6	{
130	root	1.42	client *ns = clients [i];
131	elmex	1.1
132	root	1.42	ns->tick ();
133			ns->refcnt_chk ();
134			}
135			}
136
137			void
138			client::tick ()
139			{
140			if (!pl \|\| destroyed ())
141			return;
142	root	1.37
143	root	1.42	/* Update the players stats once per tick. More efficient than
144			* sending them whenever they change, and probably just as useful
145			*/
146			esrv_update_stats (pl);
147	root	1.20
148	root	1.42	if (last_weight != -1 && last_weight != WEIGHT (pl->ob))
149			{
150			esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
151			if (last_weight != WEIGHT (pl->ob))
152			LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n",
153			(unsigned long) last_weight, WEIGHT (pl->ob));
154			}
155	root	1.6
156	root	1.50	draw_client_map (pl);
157	root	1.20
158	root	1.42	if (update_look)
159	root	1.50	esrv_draw_look (pl);
160	root	1.41
161	root	1.64	bool overload = false;
162
163			#if HAVE_TCP_INFO
164			// do bandwidth checking
165			if (tcpi.tcpi_unacked + 1 > max (4, tcpi.tcpi_snd_cwnd))
166	root	1.42	{
167	root	1.64	overload = true;
168			if (next_rate_adjust <= NOW)
169			{
170			next_rate_adjust = NOW + 2;
171			max_rate = max (max_rate >> 1, int (5000 * TICK));
172			LOG (llevDebug, "tcp %s overloaded (%d + 1 > 4 \| %d), rate now %d\n",
173			host, (int)tcpi.tcpi_unacked, (int)tcpi.tcpi_snd_cwnd, int (max_rate / TICK));//D
174			send_packet_printf ("drawinfo %d Due to possible network congestion, your output-rate has been reduced to %dbps.",
175			NDI_RED, int (max_rate / TICK));
176			}
177			}
178			#endif
179	root	1.54
180	root	1.64	if (!overload)
181			{
182			if (ixface.empty ())
183			{
184			// regularly send a new face when queue is empty
185			if (bg_scrub && !--bg_scrub && enable_bg_scrub)
186			while (scrub_idx < faces.size () - 1)
187	root	1.42	{
188	root	1.64	++scrub_idx;
189	root	1.45
190	root	1.64	if (!faces_sent [scrub_idx])
191			if (faceinfo *f = face_info (scrub_idx))
192			if (f->type == FT_FACE) // only scrub faces for now
193			{
194			send_face (scrub_idx, -120);
195			flush_fx ();
196
197			bg_scrub = 1; // send up to one face per tick, unless an image was requested
198			break;
199			}
200	root	1.42	}
201	root	1.44
202	root	1.64	rate_avail = max_rate - outputbuffer_len ();
203	root	1.63	}
204	root	1.64	else
205	root	1.63	{
206			int ol = outputbuffer_len ();
207	root	1.46
208	root	1.63	rate_avail = min (max_rate, rate_avail + max_rate);
209			rate_avail -= ol;
210	root	1.46
211	root	1.63	int avail = rate_avail;
212	root	1.46
213	root	1.63	// if we can split images, transfer up to mss-sized packets if possible
214			// but never 768 bytes more.
215			if (fxix) avail += min (768, mss - (ol % mss));
216	root	1.59
217	root	1.63	bg_scrub = BG_SCRUB_RATE;
218	root	1.46
219	root	1.63	while (avail > 0)
220			{
221			ixsend &ix = ixface.back ();
222	root	1.46
223	root	1.63	if (facedata *d = face_data (ix.idx, faceset))
224			{
225			if (fxix)
226			{
227			// only transfer something if the amount of data transferred
228			// has a healthy relation to the header overhead
229			if (avail <= 40)
230			break;
231
232			// 9 bytes is enough for fx_FFFOOO
233			int chunk = min (min (avail, MAXSOCKBUF - 9), (int)ix.ofs);
234
235			if (chunk <= 0)
236			break;
237
238			ix.ofs -= chunk;
239
240			//fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D
241
242			packet sl ("ix");
243
244			sl << ber32 (ix.idx)
245			<< ber32 (ix.ofs)
246			<< data (d->data.data () + ix.ofs, chunk);
247
248			send_packet (sl);
249			}
250			else
251			{
252			send_image (ix.idx);
253			ix.ofs = 0;
254			}
255	root	1.46	}
256			else
257	root	1.63	ix.ofs = 0;
258	root	1.44
259	root	1.63	int consumed = outputbuffer_len () - ol;
260	root	1.54
261	root	1.63	avail -= consumed;
262			rate_avail -= consumed;
263	root	1.54
264	root	1.63	ol = outputbuffer_len ();
265	root	1.54
266	root	1.63	if (!ix.ofs)
267			{
268			ixface.pop_back ();
269	root	1.56
270	root	1.63	if (ixface.empty ())
271			break;
272			}
273	root	1.54	}
274	root	1.44	}
275			}
276	elmex	1.1	}
277	root	1.43