1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
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 |
8 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) 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, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License 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 |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
20 | |
|
|
21 | The author can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
22 | */ |
22 | */ |
23 | |
23 | |
24 | /** |
24 | /** |
25 | * \file |
25 | * \file |
26 | * Main client/server loops. |
26 | * Main client/server loops. |
27 | * |
27 | * |
28 | * \date 2003-12-02 |
28 | * \date 2003-12-02 |
29 | * |
29 | * |
30 | * loop.c mainly deals with initialization and higher level socket |
30 | * loop.c mainly deals with initialization and higher level socket |
31 | * maintenance (checking for lost connections and if data has arrived.) |
31 | * maintanance (checking for lost connections and if data has arrived.) |
32 | * The reading of data is handled in ericserver.c |
|
|
33 | */ |
32 | */ |
34 | |
|
|
35 | |
33 | |
36 | #include <global.h> |
34 | #include <global.h> |
37 | #include <sproto.h> |
35 | #include <sproto.h> |
38 | #include <sockproto.h> |
36 | #include <sockproto.h> |
39 | |
37 | |
… | |
… | |
45 | |
43 | |
46 | #include <unistd.h> |
44 | #include <unistd.h> |
47 | #include <arpa/inet.h> |
45 | #include <arpa/inet.h> |
48 | |
46 | |
49 | #include <loader.h> |
47 | #include <loader.h> |
50 | #include <newserver.h> |
|
|
51 | |
48 | |
52 | /***************************************************************************** |
49 | #define BG_SCRUB_RATE 4 // how often to send a face in the background |
53 | * Start of command dispatch area. |
|
|
54 | * The commands here are protocol commands. |
|
|
55 | ****************************************************************************/ |
|
|
56 | |
50 | |
57 | /* Either keep this near the start or end of the file so it is |
51 | #define MAX_QUEUE_DEPTH 50 |
58 | * at least reasonablye easy to find. |
52 | #define MAX_QUEUE_BACKLOG 3. |
59 | * There are really 2 commands - those which are sent/received |
|
|
60 | * before player joins, and those happen after the player has joined. |
|
|
61 | * As such, we have function types that might be called, so |
|
|
62 | * we end up having 2 tables. |
|
|
63 | */ |
|
|
64 | |
53 | |
65 | enum { |
54 | // disconnect a socket after this many seconds without an ack |
66 | PF_PLAYER = 0x01, // must have valid player |
55 | #define SOCKET_TIMEOUT 8. |
67 | PF_IMMEDIATE = 0x02, // TODO: hack, can be executed immediately |
|
|
68 | PF_PLAYING = 0x04, // must be in playing state |
|
|
69 | }; |
|
|
70 | |
56 | |
71 | struct pkt_type |
|
|
72 | { |
|
|
73 | const char *name; |
|
|
74 | void *cb; |
|
|
75 | int flags; |
|
|
76 | |
|
|
77 | bool may_execute (client_socket *ns) |
|
|
78 | { |
|
|
79 | return (!(flags & PF_PLAYER) || ns->pl) |
|
|
80 | && (!(flags & PF_PLAYING) || (ns->pl && ns->pl->state == ST_PLAYING)); |
|
|
81 | } |
|
|
82 | |
|
|
83 | void execute (client_socket *ns, char *data, int datalen) |
|
|
84 | { |
|
|
85 | //TODO: only one format |
|
|
86 | if (flags & PF_PLAYER) |
|
|
87 | ((void (*)(char *, int, player * ))cb)((char *)data, datalen, ns->pl); |
|
|
88 | else |
|
|
89 | ((void (*)(char *, int, client_socket *))cb)((char *)data, datalen, ns); |
|
|
90 | } |
|
|
91 | }; |
|
|
92 | |
|
|
93 | // SocketCommand, PlayingCommand, should not exist with those ugly casts |
|
|
94 | #define SC(cb) (void *)static_cast<void (*)(char *, int, client_socket *)>(cb), |
|
|
95 | #define PC(cb) (void *)static_cast<void (*)(char *, int, player *)>(cb), PF_PLAYER | |
|
|
96 | |
|
|
97 | /** |
|
|
98 | * Dispatch table for the server. |
|
|
99 | */ |
|
|
100 | static struct pkt_type packets[] = { |
|
|
101 | {"ncom", PC(NewPlayerCmd) PF_PLAYING }, |
|
|
102 | {"command", PC(PlayerCmd) PF_PLAYING }, |
|
|
103 | |
|
|
104 | {"examine", PC(ExamineCmd) PF_PLAYING | PF_IMMEDIATE }, |
|
|
105 | {"apply", PC(ApplyCmd) PF_PLAYING | PF_IMMEDIATE }, |
|
|
106 | {"reply", PC(ReplyCmd) PF_IMMEDIATE }, |
|
|
107 | {"lookat", PC(LookAt) PF_PLAYING | PF_IMMEDIATE }, |
|
|
108 | {"lock", PC(LockItem) PF_PLAYING | PF_IMMEDIATE }, |
|
|
109 | {"mark", PC(MarkItem) PF_PLAYING | PF_IMMEDIATE }, |
|
|
110 | {"move", PC(MoveCmd) PF_PLAYING | PF_IMMEDIATE }, |
|
|
111 | {"ext", PC(ExtCmd) PF_IMMEDIATE }, /* CF+ */ |
|
|
112 | {"mapredraw", PC(MapRedrawCmd) PF_IMMEDIATE }, /* Added: phil */ |
|
|
113 | {"mapinfo", PC(MapInfoCmd) PF_IMMEDIATE }, /* CF+ */ |
|
|
114 | |
|
|
115 | {"addme", SC(AddMeCmd) PF_IMMEDIATE }, |
|
|
116 | {"askface", SC(SendFaceCmd) 0 }, /* Added: phil */ |
|
|
117 | {"requestinfo", SC(RequestInfo) 0 }, |
|
|
118 | {"setfacemode", SC(SetFaceMode) PF_IMMEDIATE }, |
|
|
119 | {"setsound", SC(SetSound) PF_IMMEDIATE }, |
|
|
120 | {"setup", SC(SetUp) PF_IMMEDIATE }, |
|
|
121 | {"version", SC(VersionCmd) PF_IMMEDIATE }, |
|
|
122 | {"toggleextendedinfos", SC(ToggleExtendedInfos) PF_IMMEDIATE }, /*Added: tchize */ |
|
|
123 | {"toggleextendedtext", SC(ToggleExtendedText) PF_IMMEDIATE }, /*Added: tchize */ |
|
|
124 | {"asksmooth", SC(AskSmooth) 0 }, /*Added: tchize (smoothing technologies) */ |
|
|
125 | }; |
|
|
126 | |
|
|
127 | /** |
|
|
128 | * RequestInfo is sort of a meta command. There is some specific |
|
|
129 | * request of information, but we call other functions to provide |
|
|
130 | * that information. |
|
|
131 | */ |
|
|
132 | void |
57 | void |
133 | RequestInfo (char *buf, int len, client_socket * ns) |
58 | client::reset_state () |
134 | { |
59 | { |
135 | char *params = NULL, *cp; |
60 | if (!pl) |
|
|
61 | return; |
136 | |
62 | |
137 | /* No match */ |
63 | pl->run_on = 0; |
138 | char bigbuf[MAX_BUF]; |
64 | pl->fire_on = 0; |
139 | int slen; |
65 | } |
140 | |
66 | |
141 | /* Set up replyinfo before we modify any of the buffers - this is used |
67 | void |
142 | * if we don't find a match. |
68 | client::queue_command (packet_type *handler, char *data, int datalen) |
143 | */ |
69 | { |
144 | strcpy (bigbuf, "replyinfo "); |
70 | tstamp stamp = NOW; |
145 | slen = strlen (bigbuf); |
|
|
146 | safe_strcat (bigbuf, buf, &slen, MAX_BUF); |
|
|
147 | |
71 | |
148 | /* find the first space, make it null, and update the |
72 | if (cmd_queue.size () >= MAX_QUEUE_DEPTH) |
149 | * params pointer. |
|
|
150 | */ |
|
|
151 | for (cp = buf; *cp != '\0'; cp++) |
|
|
152 | if (*cp == ' ') |
|
|
153 | { |
73 | { |
154 | *cp = '\0'; |
74 | //TODO: just disconnect here? |
155 | params = cp + 1; |
75 | reset_state (); |
156 | break; |
76 | send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); |
157 | } |
77 | } |
158 | |
|
|
159 | if (!strcmp (buf, "image_info")) |
|
|
160 | send_image_info (ns, params); |
|
|
161 | else if (!strcmp (buf, "image_sums")) |
|
|
162 | send_image_sums (ns, params); |
|
|
163 | else if (!strcmp (buf, "skill_info")) |
|
|
164 | send_skill_info (ns, params); |
|
|
165 | else if (!strcmp (buf, "spell_paths")) |
|
|
166 | send_spell_paths (ns, params); |
|
|
167 | else |
78 | else |
168 | ns->send_packet (bigbuf, len); |
79 | { |
169 | } |
80 | cmd_queue.push_back (command ()); |
170 | |
81 | command &cmd = cmd_queue.back (); |
171 | /** |
82 | cmd.stamp = stamp; |
172 | * Handle client input. |
83 | cmd.handler = handler; |
173 | * |
84 | cmd.data = salloc<char> (datalen + 1, data); |
174 | * HandleClient is actually not named really well - we only get here once |
85 | cmd.datalen = datalen; |
175 | * there is input, so we don't do exception or other stuff here. |
|
|
176 | * sock is the output socket information. pl is the player associated |
|
|
177 | * with this socket, null if no player (one of the init_sockets for just |
|
|
178 | * starting a connection) |
|
|
179 | */ |
|
|
180 | |
|
|
181 | void |
|
|
182 | HandleClient (client_socket *ns, player *pl) |
|
|
183 | { |
|
|
184 | /* Loop through this - maybe we have several complete packets here. */ |
|
|
185 | // limit to a few commands only, though, as to not monopolise the server |
|
|
186 | for (int repeat = 16; repeat--;) |
|
|
187 | { |
86 | } |
188 | /* If it is a player, and they don't have any speed left, we |
87 | } |
189 | * return, and will read in the data when they do have time. |
|
|
190 | */ |
|
|
191 | if (pl && pl->state == ST_PLAYING && pl->ob && pl->ob->speed_left < 0) |
|
|
192 | return; |
|
|
193 | |
88 | |
194 | int pkt_len = ns->read_packet (); |
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 (); |
195 | |
97 | |
196 | if (pkt_len < 0) |
98 | if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW) |
197 | { |
99 | { |
198 | LOG (llevError, "read error on player %s\n", &pl->ob->name); |
100 | reset_state (); |
199 | /* Caller will take care of cleaning this up */ |
101 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
200 | ns->status = Ns_Dead; |
|
|
201 | return; |
|
|
202 | } |
|
|
203 | else if (pkt_len == 0) |
|
|
204 | /* Still dont have a full packet */ |
|
|
205 | return; |
|
|
206 | |
|
|
207 | /* First, break out beginning word. There are at least |
|
|
208 | * a few commands that do not have any paremeters. If |
|
|
209 | * we get such a command, don't worry about trying |
|
|
210 | * to break it up. |
|
|
211 | */ |
|
|
212 | int datalen; |
|
|
213 | char *data = strchr ((char *)ns->inbuf + 2, ' '); |
|
|
214 | |
|
|
215 | if (data) |
|
|
216 | { |
|
|
217 | *data++ = 0; |
|
|
218 | datalen = pkt_len - (data - (char *)ns->inbuf); |
|
|
219 | } |
102 | } |
220 | else |
103 | else |
|
|
104 | execute (cmd.handler, cmd.data, cmd.datalen); |
|
|
105 | |
|
|
106 | cmd_queue.pop_front (); |
|
|
107 | return true; |
|
|
108 | } |
|
|
109 | else |
|
|
110 | return false; |
|
|
111 | } |
|
|
112 | |
|
|
113 | void |
|
|
114 | client::tick () |
|
|
115 | { |
|
|
116 | if (!pl || destroyed ()) |
|
|
117 | return; |
|
|
118 | |
|
|
119 | /* Update the players stats once per tick. More efficient than |
|
|
120 | * sending them whenever they change, and probably just as useful |
|
|
121 | */ |
|
|
122 | esrv_update_stats (pl); |
|
|
123 | |
|
|
124 | if (last_weight != -1 && last_weight != WEIGHT (pl->ob)) |
|
|
125 | { |
|
|
126 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
|
|
127 | if (last_weight != WEIGHT (pl->ob)) |
|
|
128 | LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", |
|
|
129 | (unsigned long) last_weight, WEIGHT (pl->ob)); |
|
|
130 | } |
|
|
131 | |
|
|
132 | draw_client_map (pl); |
|
|
133 | |
|
|
134 | if (update_look) |
|
|
135 | esrv_draw_look (pl); |
|
|
136 | |
|
|
137 | #if HAVE_TCP_INFO |
|
|
138 | // check time of last ack, and, if too old, kill connection |
|
|
139 | socklen_t len = sizeof (tcpi); |
|
|
140 | |
|
|
141 | if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi)) |
|
|
142 | { |
|
|
143 | if (tcpi.tcpi_snd_mss) |
|
|
144 | mss = tcpi.tcpi_snd_mss; |
|
|
145 | |
|
|
146 | #if 0 |
|
|
147 | 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", |
|
|
148 | tcpi.tcpi_unacked, |
|
|
149 | tcpi.tcpi_sacked, |
|
|
150 | tcpi.tcpi_lost, |
|
|
151 | tcpi.tcpi_retrans, |
|
|
152 | tcpi.tcpi_fackets, |
|
|
153 | tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss, |
|
|
154 | |
|
|
155 | tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked)); |
|
|
156 | #endif |
|
|
157 | |
|
|
158 | // fast-time-out a player by checking for missign acks |
|
|
159 | // do this only when player is active |
|
|
160 | if (pl && pl->active |
|
|
161 | && tcpi.tcpi_last_ack_recv > int (SOCKET_TIMEOUT * 1000)) |
221 | { |
162 | { |
222 | data = (char *)ns->inbuf + 2; // better read garbage than segfault |
163 | send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)"); |
223 | datalen = 0; |
164 | write_outputbuffer (); |
|
|
165 | |
|
|
166 | LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd, |
|
|
167 | (unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked); |
|
|
168 | destroy (); |
224 | } |
169 | } |
|
|
170 | } |
|
|
171 | #endif |
225 | |
172 | |
226 | ns->inbuf [pkt_len] = 0; /* Terminate buffer - useful for string data */ |
173 | rate_avail = min (max_rate + mss, rate_avail + max_rate); |
227 | |
174 | |
228 | for (pkt_type *pkt = packets; pkt < packets + (sizeof (packets) / sizeof (packets[0])); ++pkt) |
175 | int max_send = rate_avail; |
229 | if (!strcmp ((char *)ns->inbuf + 2, pkt->name)) |
176 | |
|
|
177 | #if HAVE_TCP_INFO |
|
|
178 | // further restrict the available bandwidth by the excess bandwidth available |
|
|
179 | max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss); |
|
|
180 | #endif |
|
|
181 | |
|
|
182 | // if we can split images, round to next-lowest mss |
|
|
183 | if (fxix) max_send -= max_send % mss; |
|
|
184 | |
|
|
185 | if (ixface.empty ()) |
|
|
186 | { |
|
|
187 | // regularly send a new face when queue is empty |
|
|
188 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
|
|
189 | while (scrub_idx < faces.size () - 1) |
230 | { |
190 | { |
231 | if (pkt->may_execute (ns)) |
191 | ++scrub_idx; |
|
|
192 | |
|
|
193 | if (!faces_sent [scrub_idx]) |
|
|
194 | if (faceinfo *f = face_info (scrub_idx)) |
|
|
195 | if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now |
232 | { |
196 | { |
233 | pkt->execute (ns, data, datalen); |
197 | send_face (scrub_idx, -120); |
234 | ns->skip_packet (pkt_len); |
198 | flush_fx (); |
235 | //D//TODO not doing this causes random memory corruption |
199 | |
236 | if (pkt->flags & PF_IMMEDIATE) |
200 | bg_scrub = 1; // send up to one fx per tick, unless an image was requested |
237 | goto next_packet; |
|
|
238 | return; |
201 | break; |
239 | } |
202 | } |
240 | } |
203 | } |
241 | |
|
|
242 | /* If we get here, we didn't find a valid command. Logging |
|
|
243 | * this might be questionable, because a broken client/malicious |
|
|
244 | * user could certainly send a whole bunch of invalid commands. |
|
|
245 | */ |
|
|
246 | LOG (llevDebug, "Bad command from client (%s)\n", ns->inbuf + 2); |
|
|
247 | ns->skip_packet (pkt_len); |
|
|
248 | next_packet: |
|
|
249 | ; |
|
|
250 | } |
|
|
251 | } |
|
|
252 | |
|
|
253 | void |
|
|
254 | flush_sockets (void) |
|
|
255 | { |
|
|
256 | for (sockvec::iterator i = client_sockets.begin (); i != client_sockets.end (); ++i) |
|
|
257 | if ((*i)->status != Ns_Dead) |
|
|
258 | (*i)->flush (); |
|
|
259 | } |
|
|
260 | |
|
|
261 | /** |
|
|
262 | * This checks the sockets for input, does the right thing. |
|
|
263 | * |
|
|
264 | * A bit of this code is grabbed out of socket.c |
|
|
265 | * There are 2 lists we need to look through - init_sockets is a list |
|
|
266 | * |
|
|
267 | */ |
|
|
268 | void |
|
|
269 | doeric_server (void) |
|
|
270 | { |
|
|
271 | int i, pollret; |
|
|
272 | fd_set tmp_read; |
|
|
273 | struct sockaddr_in addr; |
|
|
274 | socklen_t addrlen = sizeof (struct sockaddr); |
|
|
275 | player *pl, *next; |
|
|
276 | int maxfd = 0; |
|
|
277 | |
|
|
278 | #ifdef CS_LOGSTATS |
|
|
279 | if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME) |
|
|
280 | write_cs_stats (); |
|
|
281 | #endif |
|
|
282 | |
|
|
283 | /* Go through the players. Let the loop set the next pl value, |
|
|
284 | * since we may remove some |
|
|
285 | */ |
|
|
286 | //TODO: must be handled cleanly elsewhere |
|
|
287 | for (pl = first_player; pl; ) |
|
|
288 | { |
204 | } |
289 | player *npl = pl->next; |
205 | else |
|
|
206 | { |
|
|
207 | bg_scrub = BG_SCRUB_RATE; |
290 | |
208 | |
291 | //TODO: must be handled cleanly elsewhere |
209 | for (;;) |
292 | if (pl->socket->status == Ns_Dead) |
|
|
293 | { |
210 | { |
294 | save_player (pl->ob, 0); |
211 | int avail = max_send - outputbuffer_len (); |
295 | |
212 | |
296 | if (!QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
213 | if (avail <= 0) |
|
|
214 | break; |
|
|
215 | |
|
|
216 | ixsend &ix = ixface.back (); |
|
|
217 | |
|
|
218 | if (facedata *d = face_data (ix.idx, faceset)) |
297 | { |
219 | { |
298 | terminate_all_pets (pl->ob); |
220 | if (fxix) |
299 | pl->ob->remove (); |
221 | { |
|
|
222 | // estimate the packet header overhead "ix " + idx + (new)ofs |
|
|
223 | int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs); |
|
|
224 | int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen; |
|
|
225 | |
|
|
226 | // only transfer something if the amount of data transferred |
|
|
227 | // has a healthy relation to the header overhead |
|
|
228 | if (chunk < 64) |
|
|
229 | break; |
|
|
230 | |
|
|
231 | chunk = min (chunk, (int)ix.ofs); |
|
|
232 | |
|
|
233 | ix.ofs -= chunk; |
|
|
234 | |
|
|
235 | //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D |
|
|
236 | |
|
|
237 | packet sl ("ix"); |
|
|
238 | |
|
|
239 | sl << ber32 (ix.idx) |
|
|
240 | << ber32 (ix.ofs) |
|
|
241 | << data (d->data.data () + ix.ofs, chunk); |
|
|
242 | |
|
|
243 | send_packet (sl); |
|
|
244 | } |
|
|
245 | else |
|
|
246 | { |
|
|
247 | send_image (ix.idx); |
|
|
248 | ix.ofs = 0; |
|
|
249 | } |
300 | } |
250 | } |
|
|
251 | else |
|
|
252 | ix.ofs = 0; |
301 | |
253 | |
302 | leave (pl, 1); |
254 | if (!ix.ofs) |
303 | final_free_player (pl); |
255 | { |
|
|
256 | ixface.pop_back (); |
|
|
257 | |
|
|
258 | if (ixface.empty ()) |
|
|
259 | break; |
|
|
260 | } |
304 | } |
261 | } |
305 | |
|
|
306 | pl = npl; |
|
|
307 | } |
|
|
308 | |
|
|
309 | FD_ZERO (&tmp_read); |
|
|
310 | |
|
|
311 | for (sockvec::iterator i = client_sockets.begin (); i != client_sockets.end (); ) |
|
|
312 | { |
262 | } |
313 | client_socket *s = *i; |
|
|
314 | |
263 | |
315 | if (s->status == Ns_Dead) |
264 | rate_avail -= outputbuffer_len (); |
316 | { |
265 | } |
317 | client_sockets.erase (i); |
|
|
318 | delete s; |
|
|
319 | } |
|
|
320 | else |
|
|
321 | { |
|
|
322 | if (s->fd > maxfd) maxfd = s->fd; |
|
|
323 | |
266 | |
324 | FD_SET (s->fd, &tmp_read); |
267 | void |
325 | |
268 | client::flush_sockets (void) |
326 | ++i; |
269 | { |
327 | } |
|
|
328 | } |
|
|
329 | |
|
|
330 | struct timeval timeout; |
|
|
331 | |
|
|
332 | timeout.tv_sec = 0; |
|
|
333 | timeout.tv_usec = 0; |
|
|
334 | |
|
|
335 | pollret = select (maxfd + 1, |
|
|
336 | &tmp_read, 0, 0, |
|
|
337 | &timeout); |
|
|
338 | |
|
|
339 | if (pollret == -1) |
|
|
340 | { |
|
|
341 | LOG (llevError, "select failed: %s\n", strerror (errno)); |
|
|
342 | return; |
|
|
343 | } |
|
|
344 | |
|
|
345 | /* We need to do some of the processing below regardless */ |
|
|
346 | |
|
|
347 | /* Check for any input on the sockets */ |
|
|
348 | for (sockvec::iterator i = client_sockets.begin (); i != client_sockets.end (); ++i) |
270 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
349 | { |
271 | (*i)->flush (); |
350 | client_socket *s = *i; |
272 | } |
351 | player *pl = s->pl; |
|
|
352 | |
273 | |
353 | //TODO: disassociate handleclient from socket readin |
274 | void |
354 | if (s->inbuf_len || FD_ISSET (s->fd, &tmp_read)) |
275 | client::clock (void) |
355 | HandleClient (s, pl); |
276 | { |
|
|
277 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
|
|
278 | (*i)->tick (); |
356 | |
279 | |
|
|
280 | // give them all the same chances |
|
|
281 | flush_sockets (); |
|
|
282 | |
357 | //TODO: should not be done here, either |
283 | //TODO: should not be done here, either |
358 | if (s->status != Ns_Dead && pl) |
284 | for (unsigned i = 0; i < clients.size (); ++i) |
359 | { |
285 | clients[i]->refcnt_chk (); |
360 | /* Update the players stats once per tick. More efficient than |
|
|
361 | * sending them whenever they change, and probably just as useful |
|
|
362 | */ |
|
|
363 | esrv_update_stats (pl); |
|
|
364 | if (pl->last_weight != -1 && pl->last_weight != WEIGHT (pl->ob)) |
|
|
365 | { |
|
|
366 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
|
|
367 | if (pl->last_weight != WEIGHT (pl->ob)) |
|
|
368 | LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", |
|
|
369 | (unsigned long) pl->last_weight, WEIGHT (pl->ob)); |
|
|
370 | } |
|
|
371 | |
|
|
372 | /* draw_client_map does sanity checking that map is |
|
|
373 | * valid, so don't do it here. |
|
|
374 | */ |
|
|
375 | draw_client_map (pl->ob); |
|
|
376 | if (s->update_look) |
|
|
377 | esrv_draw_look (pl->ob); |
|
|
378 | } |
|
|
379 | } |
|
|
380 | } |
286 | } |
381 | |
287 | |