ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/loop.C
(Generate patch)

Comparing deliantra/server/socket/loop.C (file contents):
Revision 1.29 by root, Tue Dec 19 04:58:05 2006 UTC vs.
Revision 1.53 by root, Sun Jul 1 03:16:56 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
3 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
4 Copyright (C) 2002-2003 Mark Wedel & The Crossfire Development Team 5 * Copyright (©) 2002-2003,2007 Mark Wedel & The Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * Crossfire TRT is free software; you can redistribute it and/or modify it
8 it under the terms of the GNU General Public License as published by 9 * under the terms of the GNU General Public License as published by the Free
9 the Free Software Foundation; either version 2 of the License, or 10 * Software Foundation; either version 2 of the License, or (at your option)
10 (at your option) any later version. 11 * any later version.
11 12 *
12 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful, but
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15 GNU General Public License for more details. 16 * for more details.
16 17 *
17 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License along
18 along with this program; if not, write to the Free Software 19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 21 *
21 The author can be reached via e-mail to <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <crossfire@schmorp.de>
22*/ 23 */
23 24
24/** 25/**
25 * \file 26 * \file
26 * Main client/server loops. 27 * Main client/server loops.
27 * 28 *
… …
29 * 30 *
30 * loop.c mainly deals with initialization and higher level socket 31 * loop.c mainly deals with initialization and higher level socket
31 * maintanance (checking for lost connections and if data has arrived.) 32 * maintanance (checking for lost connections and if data has arrived.)
32 */ 33 */
33 34
34
35#include <global.h> 35#include <global.h>
36#include <sproto.h> 36#include <sproto.h>
37#include <sockproto.h> 37#include <sockproto.h>
38 38
39#include <sys/types.h> 39#include <sys/types.h>
… …
45#include <unistd.h> 45#include <unistd.h>
46#include <arpa/inet.h> 46#include <arpa/inet.h>
47 47
48#include <loader.h> 48#include <loader.h>
49 49
50#define BG_SCRUB_RATE 4 // how often to send a face in the background
51
50#define MAX_QUEUE_DEPTH 500 //TODO 52#define MAX_QUEUE_DEPTH 500
51#define MAX_QUEUE_BACKLOG 5. //TODO 53#define MAX_QUEUE_BACKLOG 3.
52 54
53void 55void
54client::reset_state () 56client::reset_state ()
55{ 57{
56 if (!pl) 58 if (!pl)
… …
61} 63}
62 64
63void 65void
64client::queue_command (packet_type *handler, char *data, int datalen) 66client::queue_command (packet_type *handler, char *data, int datalen)
65{ 67{
66 tstamp stamp = now (); 68 tstamp stamp = NOW;
67 69
68 if (cmd_queue.size () >= MAX_QUEUE_DEPTH) 70 if (cmd_queue.size () >= MAX_QUEUE_DEPTH)
69 { 71 {
70 //TODO: just disconnect here? 72 //TODO: just disconnect here?
71 reset_state (); 73 reset_state ();
… …
83} 85}
84 86
85bool 87bool
86client::handle_command () 88client::handle_command ()
87{ 89{
88 bool skipping = false;
89
90 while (!cmd_queue.empty () 90 if (!cmd_queue.empty ()
91 && !(pl && pl->state == ST_PLAYING && pl->ob && pl->ob->speed_left < 0)) 91 && state == ST_PLAYING
92 && pl->ob->speed_left > 0.f)
92 { 93 {
93 command &cmd = cmd_queue.front (); 94 command &cmd = cmd_queue.front ();
94 95
95 if (cmd.stamp + MAX_QUEUE_BACKLOG < now ()) 96 if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW)
96 { 97 {
97 if (!skipping)
98 {
99 skipping = true;
100 reset_state (); 98 reset_state ();
101 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); 99 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED);
102 }
103
104 cmd_queue.pop_front ();
105 } 100 }
106 else 101 else
107 {
108 execute (cmd.handler, cmd.data, cmd.datalen); 102 execute (cmd.handler, cmd.data, cmd.datalen);
103
109 cmd_queue.pop_front (); 104 cmd_queue.pop_front ();
110 return true; 105 return true;
111 }
112 } 106 }
113 107 else
114 return false; 108 return false;
115} 109}
116 110
117void 111void
118flush_sockets (void) 112flush_sockets (void)
119{ 113{
120 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) 114 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
121 if ((*i)->status != Ns_Dead)
122 (*i)->flush (); 115 (*i)->flush ();
123} 116}
124 117
125/** 118/**
126 * This checks the sockets for input, does the right thing. 119 * This checks the sockets for input, does the right thing.
127 * 120 *
… …
130 * 123 *
131 */ 124 */
132void 125void
133doeric_server (void) 126doeric_server (void)
134{ 127{
135#ifdef CS_LOGSTATS 128 //TODO: should not be done here, either
136 if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME) 129 for (unsigned i = 0; i < clients.size (); ++i)
137 write_cs_stats (); 130 {
138#endif 131 client *ns = clients [i];
139 132
140 /* Go through the players. Let the loop set the next pl value, 133 ns->tick ();
141 * since we may remove some 134 ns->refcnt_chk ();
135 }
136}
137
138void
139client::tick ()
140{
141 if (!pl || destroyed ())
142 return;
143
144 /* Update the players stats once per tick. More efficient than
145 * sending them whenever they change, and probably just as useful
142 */ 146 */
143 //TODO: must be handled cleanly elsewhere 147 esrv_update_stats (pl);
144 for (player *pl = first_player; pl; ) 148
149 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));
145 { 155 }
146 player *npl = pl->next;
147 156
148 //TODO: must be handled cleanly elsewhere 157 draw_client_map (pl);
149 if (!pl->socket || pl->socket->status == Ns_Dead) 158
159 if (update_look)
160 esrv_draw_look (pl);
161
162 if (ixface.empty () && !partial_face_ofs)
163 {
164 // regularly send a new face when queue is empty
165 if (bg_scrub && !--bg_scrub && enable_bg_scrub)
166 while (scrub_idx < faces.size () - 1)
167 {
168 ++scrub_idx;
169 if (!faces_sent [scrub_idx])
170 {
171 send_face (scrub_idx);
172 flush_fx ();
173
174 bg_scrub = 1; // send up to one face per tick, unless an image was requested
175 break;
176 }
177 }
178
179 rate_avail = max_rate - outputbuffer_len ();
180 }
181 else
182 {
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
190 // if we can split images, transfer up to mss-sized packets if possible
191 // but never 768 bytes more.
192 if (fxix) avail += min (768, mss - (ol % mss));
193
194 bg_scrub = BG_SCRUB_RATE;
195
196 while (avail > 0)
150 { 197 {
151 save_player (pl->ob, 0); 198 if (partial_face_ofs)
152
153 if (!QUERY_FLAG (pl->ob, FLAG_REMOVED))
154 { 199 {
155 terminate_all_pets (pl->ob); 200 if (facedata *d = face_data (partial_face, faceset))
156 pl->ob->remove (); 201 {
202 // 9 bytes is enough for fx_FFFOOO, 40 leaves some room for image data
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;
157 } 220 }
221 else if (!ixface.empty ())
222 {
223 // use a lifo to send most recently requested images
224 faceidx facenum = ixface.back ();
225 ixface.pop_back ();
158 226
159 leave (pl, 1); 227 if (fxix)
160 final_free_player (pl); 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 }
238 else
239 break;
240
241 int consumed = ol - outputbuffer_len ();
242 avail -= consumed;
243 rate_avail -= consumed;
161 } 244 }
162
163 pl = npl;
164 }
165
166 for (sockvec::iterator i = clients.begin (); i != clients.end (); )
167 { 245 }
168 client *s = *i;
169
170 if (s->status == Ns_Dead)
171 {
172 clients.erase (i);
173 delete s;
174 }
175 else
176 ++i;
177 }
178
179 /* We need to do some of the processing below regardless */
180
181 /* Check for any input on the sockets */
182 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
183 {
184 client *s = *i;
185 player *pl = s->pl;
186
187 //TODO: should not be done here, either
188 if (s->status != Ns_Dead && pl)
189 {
190 /* Update the players stats once per tick. More efficient than
191 * sending them whenever they change, and probably just as useful
192 */
193 esrv_update_stats (pl);
194
195 if (pl->last_weight != -1 && pl->last_weight != WEIGHT (pl->ob))
196 {
197 esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
198 if (pl->last_weight != WEIGHT (pl->ob))
199 LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n",
200 (unsigned long) pl->last_weight, WEIGHT (pl->ob));
201 }
202
203 draw_client_map (pl->ob);
204
205 if (s->update_look)
206 esrv_draw_look (pl->ob);
207 }
208 }
209} 246}
210 247

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines