server/socket/loop.C

/*
 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
 * 
 * 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 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 Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
 * 
 * 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);

  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 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.52
Committed:	Sun Jun 24 04:09:29 2007 UTC (16 years, 11 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.51:	+1 -1 lines
Log Message:	first rough cut of msg rewriting, introducing cfpod, a haxored pod variant for crossfire messgaes. where will it end?
#	User	Rev	Content
1	elmex	1.1	/*
2	root	1.49	* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
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			* Crossfire TRT is free software; you can redistribute it and/or modify it
9			* under the terms of the GNU General Public License as published by the Free
10			* Software Foundation; either version 2 of the License, or (at your option)
11			* any later version.
12			*
13			* This program is distributed in the hope that it will be useful, but
14			* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
15			* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16			* for more details.
17			*
18			* You should have received a copy of the GNU General Public License along
19			* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
20			* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21			*
22			* The authors can be reached via e-mail to <crossfire@schmorp.de>
23	pippijn	1.39	*/
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			#include <global.h>
36	root	1.10	#include <sproto.h>
37			#include <sockproto.h>
38	elmex	1.1
39	pippijn	1.8	#include <sys/types.h>
40			#include <sys/time.h>
41			#include <sys/socket.h>
42			#include <netinet/in.h>
43			#include <netdb.h>
44	elmex	1.1
45	root	1.16	#include <unistd.h>
46			#include <arpa/inet.h>
47	elmex	1.1
48			#include <loader.h>
49
50	root	1.51	#define BG_SCRUB_RATE 4 // how often to send a face in the background
51
52			#define MAX_QUEUE_DEPTH 500
53			#define MAX_QUEUE_BACKLOG 3.
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.51	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.51	if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW)
97	root	1.26	{
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	root	1.33	//TODO: should not be done here, either
129	pippijn	1.40	for (unsigned i = 0; i < clients.size (); ++i)
130	root	1.6	{
131	root	1.42	client *ns = clients [i];
132	elmex	1.1
133	root	1.42	ns->tick ();
134			ns->refcnt_chk ();
135			}
136			}
137
138			void
139			client::tick ()
140			{
141			if (!pl \|\| destroyed ())
142			return;
143	root	1.37
144	root	1.42	/* Update the players stats once per tick. More efficient than
145			* sending them whenever they change, and probably just as useful
146			*/
147			esrv_update_stats (pl);
148	root	1.20
149	root	1.42	if (last_weight != -1 && last_weight != WEIGHT (pl->ob))
150			{
151			esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
152			if (last_weight != WEIGHT (pl->ob))
153			LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n",
154			(unsigned long) last_weight, WEIGHT (pl->ob));
155			}
156	root	1.6
157	root	1.50	draw_client_map (pl);
158	root	1.20
159	root	1.42	if (update_look)
160	root	1.50	esrv_draw_look (pl);
161	root	1.41
162	root	1.46	if (askface.empty () && !partial_face_ofs)
163	root	1.42	{
164	root	1.44	// regularly send a new face when queue is empty
165	root	1.43	if (bg_scrub && !--bg_scrub && enable_bg_scrub)
166	root	1.42	while (scrub_idx < faces.size () - 1)
167			{
168			++scrub_idx;
169			if (!faces_sent [scrub_idx])
170			{
171			send_face (scrub_idx);
172	root	1.45	flush_fx ();
173
174	root	1.42	bg_scrub = 1; // send up to one face per tick, unless an image was requested
175			break;
176			}
177			}
178	root	1.44
179			rate_avail = max_rate - outputbuffer_len ();
180	root	1.42	}
181			else
182	root	1.44	{
183			int ol = outputbuffer_len ();
184
185			rate_avail = min (max_rate, rate_avail + max_rate);
186			rate_avail -= ol;
187
188			int avail = rate_avail;
189	root	1.46
190	root	1.44	// if we can split images, transfer up to mss packets if possible
191	root	1.52	// but never 768 bytes more.
192	root	1.46	if (fxix) avail += min (768, mss - (ol % mss));
193	root	1.44
194	root	1.46	bg_scrub = BG_SCRUB_RATE;
195
196			while (avail > 0)
197	root	1.44	{
198	root	1.46	if (partial_face_ofs)
199			{
200			if (facedata *d = face_data (partial_face, faceset))
201			{
202			// 9 bytes is enough for fx_FFFOOO, 40 leaves some room
203			int chunk = min (min (avail - 40, MAXSOCKBUF - 9), partial_face_ofs);
204
205			if (chunk <= 0)
206			break;
207
208			partial_face_ofs -= chunk;
209
210			packet sl ("ix");
211
212			sl << ber32 (partial_face)
213			<< ber32 (partial_face_ofs)
214			<< data (d->data.data () + partial_face_ofs, chunk);
215
216			send_packet (sl);
217			}
218			else
219			partial_face_ofs = 0;
220			}
221			else if (!askface.empty ())
222	root	1.45	{
223	root	1.46	// use a lifo to send most recently requested images
224			faceidx facenum = askface.back ();
225			askface.pop_back ();
226
227			if (fxix)
228			{
229			if (facedata *d = face_data (facenum, faceset))
230			{
231			partial_face = facenum;
232			partial_face_ofs = d->data.size ();
233			}
234			}
235			else
236			send_image (facenum);
237	root	1.45	}
238			else
239	root	1.46	break;
240	root	1.44
241			int consumed = ol - outputbuffer_len ();
242			avail -= consumed;
243			rate_avail -= consumed;
244			}
245			}
246	elmex	1.1	}
247	root	1.43