server/socket/loop.C

/*
 * CrossFire, A Multiplayer game for X-windows
 * 
 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
 * Copyright (C) 2002-2003 Mark Wedel & The Crossfire Development Team
 * Copyright (C) 1992 Frank Tore Johansen
 * 
 * This program 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 2 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, write to the Free Software
 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 *
 * The author 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.)
 */

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

#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 MAX_QUEUE_DEPTH   500 //TODO
#define MAX_QUEUE_BACKLOG 3.  //TODO

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)
{
#ifdef CS_LOGSTATS
  if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME)
    write_cs_stats ();
#endif

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

  if (update_look)
    esrv_draw_look (pl->ob);

  if (askface.empty () && !partial_face_ofs)
    {
      // 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])
              {
                send_face (scrub_idx);
                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 packets if possible
      // but never more 768 bytes more.
      if (fxix) avail += min (768, mss - (ol % mss));

      bg_scrub = BG_SCRUB_RATE;

      while (avail > 0)
        {
          if (partial_face_ofs)
            {
              if (facedata *d = face_data (partial_face, faceset))
                {
                  // 9 bytes is enough for fx_FFFOOO, 40 leaves some room
                  int chunk = min (min (avail - 40, MAXSOCKBUF - 9), partial_face_ofs);

                  if (chunk <= 0)
                    break;

                  partial_face_ofs -= chunk;

                  packet sl ("ix");

                  sl << ber32 (partial_face)
                     << ber32 (partial_face_ofs)
                     << data (d->data.data () + partial_face_ofs, chunk);

                  send_packet (sl);
                }
              else
                partial_face_ofs = 0;
            }
          else if (!askface.empty ())
            {
              // use a lifo to send most recently requested images
              faceidx facenum = askface.back ();
              askface.pop_back ();

              if (fxix)
                {
                  if (facedata *d = face_data (facenum, faceset))
                    {
                      partial_face     = facenum;
                      partial_face_ofs = d->data.size ();
                    }
                }
              else
                send_image (facenum);
            }
          else
            break;

          int consumed = ol - outputbuffer_len ();
          avail      -= consumed;
          rate_avail -= consumed;
        }
    }
}

Revision:	1.48
Committed:	Fri May 18 19:46:22 2007 UTC (17 years ago) by root
Content type:	text/plain
Branch:	MAIN
CVS Tags:	rel-2_1
Changes since 1.47:	+11 -19 lines
Log Message:	new speed management: - weapon speed and object speed is now completekly decoupled for players. - both can be used at the same time, or indeepndent, when running or firing. - still only one command per object speed can be issued.
#	User	Rev	Content
1	elmex	1.1	/*
2	pippijn	1.39	* CrossFire, A Multiplayer game for X-windows
3			*
4			* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
5			* Copyright (C) 2002-2003 Mark Wedel & The Crossfire Development Team
6			* Copyright (C) 1992 Frank Tore Johansen
7			*
8			* This program 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 2 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, write to the Free Software
20			* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21			*
22			* The author can be reached via e-mail to <crossfire@schmorp.de>
23			*/
24	elmex	1.1
25			/**
26			* \file
27			* Main client/server loops.
28			*
29			* \date 2003-12-02
30			*
31			* loop.c mainly deals with initialization and higher level socket
32	root	1.26	* maintanance (checking for lost connections and if data has arrived.)
33	elmex	1.1	*/
34
35	root	1.42	#define BG_SCRUB_RATE 4 // how often to send a face in the background
36	elmex	1.1
37			#include <global.h>
38	root	1.10	#include <sproto.h>
39			#include <sockproto.h>
40	elmex	1.1
41	pippijn	1.8	#include <sys/types.h>
42			#include <sys/time.h>
43			#include <sys/socket.h>
44			#include <netinet/in.h>
45			#include <netdb.h>
46	elmex	1.1
47	root	1.16	#include <unistd.h>
48			#include <arpa/inet.h>
49	elmex	1.1
50			#include <loader.h>
51
52	root	1.20	#define MAX_QUEUE_DEPTH 500 //TODO
53	root	1.34	#define MAX_QUEUE_BACKLOG 3. //TODO
54	elmex	1.1
55	root	1.21	void
56			client::reset_state ()
57			{
58			if (!pl)
59			return;
60
61			pl->run_on = 0;
62			pl->fire_on = 0;
63			}
64	elmex	1.1
65	root	1.20	void
66			client::queue_command (packet_type handler, char data, int datalen)
67	root	1.6	{
68	root	1.20	tstamp stamp = now ();
69	elmex	1.1
70	root	1.20	if (cmd_queue.size () >= MAX_QUEUE_DEPTH)
71	root	1.21	{
72			//TODO: just disconnect here?
73			reset_state ();
74			send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED);
75			}
76	root	1.20	else
77	root	1.24	{
78			cmd_queue.push_back (command ());
79			command &cmd = cmd_queue.back ();
80			cmd.stamp = stamp;
81			cmd.handler = handler;
82	root	1.25	cmd.data = salloc<char> (datalen + 1, data);
83	root	1.24	cmd.datalen = datalen;
84			}
85	root	1.20	}
86	elmex	1.1
87	root	1.20	bool
88			client::handle_command ()
89	elmex	1.1	{
90	root	1.48	if (!cmd_queue.empty ()
91			&& state == ST_PLAYING
92			&& pl->ob->speed_left > 0.f)
93	root	1.26	{
94			command &cmd = cmd_queue.front ();
95	root	1.6
96	root	1.26	if (cmd.stamp + MAX_QUEUE_BACKLOG < now ())
97			{
98	root	1.48	reset_state ();
99			send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED);
100	root	1.26	}
101			else
102	root	1.48	execute (cmd.handler, cmd.data, cmd.datalen);
103
104			cmd_queue.pop_front ();
105			return true;
106	root	1.21	}
107	root	1.48	else
108			return false;
109	elmex	1.1	}
110
111	root	1.6	void
112			flush_sockets (void)
113	elmex	1.1	{
114	root	1.19	for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
115	root	1.31	(*i)->flush ();
116	elmex	1.1	}
117
118			/**
119	root	1.10	* This checks the sockets for input, does the right thing.
120	elmex	1.1	*
121			* A bit of this code is grabbed out of socket.c
122			* There are 2 lists we need to look through - init_sockets is a list
123			*
124			*/
125	root	1.6	void
126			doeric_server (void)
127	elmex	1.1	{
128			#ifdef CS_LOGSTATS
129	root	1.6	if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME)
130			write_cs_stats ();
131	elmex	1.1	#endif
132
133	root	1.33	//TODO: should not be done here, either
134	pippijn	1.40	for (unsigned i = 0; i < clients.size (); ++i)
135	root	1.6	{
136	root	1.42	client *ns = clients [i];
137	elmex	1.1
138	root	1.42	ns->tick ();
139			ns->refcnt_chk ();
140			}
141			}
142
143			void
144			client::tick ()
145			{
146			if (!pl \|\| destroyed ())
147			return;
148	root	1.37
149	root	1.42	/* Update the players stats once per tick. More efficient than
150			* sending them whenever they change, and probably just as useful
151			*/
152			esrv_update_stats (pl);
153	root	1.20
154	root	1.42	if (last_weight != -1 && last_weight != WEIGHT (pl->ob))
155			{
156			esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
157			if (last_weight != WEIGHT (pl->ob))
158			LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n",
159			(unsigned long) last_weight, WEIGHT (pl->ob));
160			}
161	root	1.6
162	root	1.42	draw_client_map (pl->ob);
163	root	1.20
164	root	1.42	if (update_look)
165			esrv_draw_look (pl->ob);
166	root	1.41
167	root	1.46	if (askface.empty () && !partial_face_ofs)
168	root	1.42	{
169	root	1.44	// regularly send a new face when queue is empty
170	root	1.43	if (bg_scrub && !--bg_scrub && enable_bg_scrub)
171	root	1.42	while (scrub_idx < faces.size () - 1)
172			{
173			++scrub_idx;
174			if (!faces_sent [scrub_idx])
175			{
176			send_face (scrub_idx);
177	root	1.45	flush_fx ();
178
179	root	1.42	bg_scrub = 1; // send up to one face per tick, unless an image was requested
180			break;
181			}
182			}
183	root	1.44
184			rate_avail = max_rate - outputbuffer_len ();
185	root	1.42	}
186			else
187	root	1.44	{
188			int ol = outputbuffer_len ();
189
190			rate_avail = min (max_rate, rate_avail + max_rate);
191			rate_avail -= ol;
192
193			int avail = rate_avail;
194	root	1.46
195	root	1.44	// if we can split images, transfer up to mss packets if possible
196	root	1.46	// but never more 768 bytes more.
197			if (fxix) avail += min (768, mss - (ol % mss));
198	root	1.44
199	root	1.46	bg_scrub = BG_SCRUB_RATE;
200
201			while (avail > 0)
202	root	1.44	{
203	root	1.46	if (partial_face_ofs)
204			{
205			if (facedata *d = face_data (partial_face, faceset))
206			{
207			// 9 bytes is enough for fx_FFFOOO, 40 leaves some room
208			int chunk = min (min (avail - 40, MAXSOCKBUF - 9), partial_face_ofs);
209
210			if (chunk <= 0)
211			break;
212
213			partial_face_ofs -= chunk;
214
215			packet sl ("ix");
216
217			sl << ber32 (partial_face)
218			<< ber32 (partial_face_ofs)
219			<< data (d->data.data () + partial_face_ofs, chunk);
220
221			send_packet (sl);
222			}
223			else
224			partial_face_ofs = 0;
225			}
226			else if (!askface.empty ())
227	root	1.45	{
228	root	1.46	// use a lifo to send most recently requested images
229			faceidx facenum = askface.back ();
230			askface.pop_back ();
231
232			if (fxix)
233			{
234			if (facedata *d = face_data (facenum, faceset))
235			{
236			partial_face = facenum;
237			partial_face_ofs = d->data.size ();
238			}
239			}
240			else
241			send_image (facenum);
242	root	1.45	}
243			else
244	root	1.46	break;
245	root	1.44
246			int consumed = ol - outputbuffer_len ();
247			avail -= consumed;
248			rate_avail -= consumed;
249			}
250			}
251	elmex	1.1	}
252	root	1.43