1 | |
|
|
2 | /* |
1 | /* |
3 | * static char *rcsid_loop_c = |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
4 | * "$Id: loop.C,v 1.5 2006/09/09 21:48:29 root Exp $"; |
3 | * |
|
|
4 | * 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 |
|
|
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 | * |
|
|
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
5 | */ |
22 | */ |
6 | |
|
|
7 | /* |
|
|
8 | CrossFire, A Multiplayer game for X-windows |
|
|
9 | |
|
|
10 | Copyright (C) 2002-2003 Mark Wedel & The Crossfire Development Team |
|
|
11 | Copyright (C) 1992 Frank Tore Johansen |
|
|
12 | |
|
|
13 | This program is free software; you can redistribute it and/or modify |
|
|
14 | it under the terms of the GNU General Public License as published by |
|
|
15 | the Free Software Foundation; either version 2 of the License, or |
|
|
16 | (at your option) any later version. |
|
|
17 | |
|
|
18 | This program is distributed in the hope that it will be useful, |
|
|
19 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
20 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
21 | GNU General Public License for more details. |
|
|
22 | |
|
|
23 | You should have received a copy of the GNU General Public License |
|
|
24 | along with this program; if not, write to the Free Software |
|
|
25 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
26 | |
|
|
27 | The author can be reached via e-mail to crossfire-devel@real-time.com |
|
|
28 | */ |
|
|
29 | |
23 | |
30 | /** |
24 | /** |
31 | * \file |
25 | * \file |
32 | * Main client/server loops. |
26 | * Main client/server loops. |
33 | * |
27 | * |
34 | * \date 2003-12-02 |
28 | * \date 2003-12-02 |
35 | * |
29 | * |
36 | * loop.c mainly deals with initialization and higher level socket |
30 | * loop.c mainly deals with initialization and higher level socket |
37 | * maintenance (checking for lost connections and if data has arrived.) |
31 | * maintanance (checking for lost connections and if data has arrived.) |
38 | * The reading of data is handled in ericserver.c |
|
|
39 | */ |
32 | */ |
40 | |
33 | |
41 | |
|
|
42 | #include <global.h> |
34 | #include <global.h> |
43 | #ifndef __CEXTRACT__ |
|
|
44 | #include <sproto.h> |
35 | #include <sproto.h> |
45 | #include <sockproto.h> |
36 | #include <sockproto.h> |
46 | #endif |
|
|
47 | |
37 | |
48 | #ifndef WIN32 /* ---win32 exclude unix headers */ |
|
|
49 | #include <sys/types.h> |
38 | #include <sys/types.h> |
50 | #include <sys/time.h> |
39 | #include <sys/time.h> |
51 | #include <sys/socket.h> |
40 | #include <sys/socket.h> |
52 | #include <netinet/in.h> |
41 | #include <netinet/in.h> |
53 | #include <netdb.h> |
42 | #include <netdb.h> |
54 | #endif /* end win32 */ |
|
|
55 | |
43 | |
56 | #ifdef HAVE_UNISTD_H |
|
|
57 | #include <unistd.h> |
44 | #include <unistd.h> |
58 | #endif |
|
|
59 | |
|
|
60 | #ifdef HAVE_ARPA_INET_H |
|
|
61 | #include <arpa/inet.h> |
45 | #include <arpa/inet.h> |
62 | #endif |
|
|
63 | |
46 | |
64 | #include <loader.h> |
47 | #include <loader.h> |
65 | #include <newserver.h> |
|
|
66 | |
48 | |
67 | /***************************************************************************** |
49 | #define BG_SCRUB_RATE 4 // how often to send a face in the background |
68 | * Start of command dispatch area. |
|
|
69 | * The commands here are protocol commands. |
|
|
70 | ****************************************************************************/ |
|
|
71 | |
50 | |
72 | /* Either keep this near the start or end of the file so it is |
51 | #define MAX_QUEUE_DEPTH 500 |
73 | * at least reasonablye easy to find. |
52 | #define MAX_QUEUE_BACKLOG 3. |
74 | * There are really 2 commands - those which are sent/received |
|
|
75 | * before player joins, and those happen after the player has joined. |
|
|
76 | * As such, we have function types that might be called, so |
|
|
77 | * we end up having 2 tables. |
|
|
78 | */ |
|
|
79 | |
53 | |
80 | typedef void (*func_uint8_int_ns) (char*, int, NewSocket *); |
54 | void |
|
|
55 | client::reset_state () |
|
|
56 | { |
|
|
57 | if (!pl) |
|
|
58 | return; |
81 | |
59 | |
82 | struct NsCmdMapping { |
60 | pl->run_on = 0; |
83 | const char *cmdname; |
61 | pl->fire_on = 0; |
84 | func_uint8_int_ns cmdproc; |
62 | } |
85 | }; |
|
|
86 | |
63 | |
87 | typedef void (*func_uint8_int_pl)(char*, int, player *); |
64 | void |
88 | struct PlCmdMapping { |
65 | client::queue_command (packet_type *handler, char *data, int datalen) |
89 | const char *cmdname; |
66 | { |
90 | func_uint8_int_pl cmdproc; |
67 | tstamp stamp = NOW; |
91 | uint8 flag; |
68 | |
92 | }; |
69 | if (cmd_queue.size () >= MAX_QUEUE_DEPTH) |
|
|
70 | { |
|
|
71 | //TODO: just disconnect here? |
|
|
72 | reset_state (); |
|
|
73 | send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); |
|
|
74 | } |
|
|
75 | else |
|
|
76 | { |
|
|
77 | cmd_queue.push_back (command ()); |
|
|
78 | command &cmd = cmd_queue.back (); |
|
|
79 | cmd.stamp = stamp; |
|
|
80 | cmd.handler = handler; |
|
|
81 | cmd.data = salloc<char> (datalen + 1, data); |
|
|
82 | cmd.datalen = datalen; |
|
|
83 | } |
|
|
84 | } |
|
|
85 | |
|
|
86 | bool |
|
|
87 | client::handle_command () |
|
|
88 | { |
|
|
89 | if (!cmd_queue.empty () |
|
|
90 | && state == ST_PLAYING |
|
|
91 | && pl->ob->speed_left > 0.f) |
|
|
92 | { |
|
|
93 | command &cmd = cmd_queue.front (); |
|
|
94 | |
|
|
95 | if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW) |
|
|
96 | { |
|
|
97 | reset_state (); |
|
|
98 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
|
|
99 | } |
|
|
100 | else |
|
|
101 | execute (cmd.handler, cmd.data, cmd.datalen); |
|
|
102 | |
|
|
103 | cmd_queue.pop_front (); |
|
|
104 | return true; |
|
|
105 | } |
|
|
106 | else |
|
|
107 | return false; |
|
|
108 | } |
|
|
109 | |
|
|
110 | void |
|
|
111 | flush_sockets (void) |
|
|
112 | { |
|
|
113 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
|
|
114 | (*i)->flush (); |
|
|
115 | } |
93 | |
116 | |
94 | /** |
117 | /** |
95 | * Dispatch table for the server. |
|
|
96 | * |
|
|
97 | * CmdMapping is the dispatch table for the server, used in HandleClient, |
|
|
98 | * which gets called when the client has input. All commands called here |
|
|
99 | * use the same parameter form (char* data, int len, int clientnum. |
|
|
100 | * We do implicit casts, because the data that is being passed is |
|
|
101 | * unsigned (pretty much needs to be for binary data), however, most |
|
|
102 | * of these treat it only as strings, so it makes things easier |
|
|
103 | * to cast it here instead of a bunch of times in the function itself. |
|
|
104 | * flag is 1 if the player must be in the playing state to issue the |
|
|
105 | * command, 0 if they can issue it at any time. |
|
|
106 | */ |
|
|
107 | static struct PlCmdMapping plcommands[] = { |
|
|
108 | { "examine", ExamineCmd, 1}, |
|
|
109 | { "apply", ApplyCmd, 1}, |
|
|
110 | { "move", MoveCmd, 1}, |
|
|
111 | { "reply", ReplyCmd, 0}, |
|
|
112 | { "command", PlayerCmd, 1}, |
|
|
113 | { "ncom", (func_uint8_int_pl)NewPlayerCmd, 1}, |
|
|
114 | { "lookat", LookAt, 1}, |
|
|
115 | { "lock", (func_uint8_int_pl)LockItem, 1}, |
|
|
116 | { "mark", (func_uint8_int_pl)MarkItem, 1}, |
|
|
117 | { "mapredraw", MapRedrawCmd, 0}, /* Added: phil */ |
|
|
118 | { "mapinfo", MapInfoCmd, 2}, /* CF+ */ |
|
|
119 | { "ext", ExtCmd, 2}, /* CF+ */ |
|
|
120 | { NULL, NULL, 0} /* terminator */ |
|
|
121 | }; |
|
|
122 | |
|
|
123 | /** Face-related commands */ |
|
|
124 | static struct NsCmdMapping nscommands[] = { |
|
|
125 | { "addme", AddMeCmd }, |
|
|
126 | { "askface", SendFaceCmd}, /* Added: phil */ |
|
|
127 | { "requestinfo", RequestInfo}, |
|
|
128 | { "setfacemode", SetFaceMode}, |
|
|
129 | { "setsound", SetSound}, |
|
|
130 | { "setup", SetUp}, |
|
|
131 | { "version", VersionCmd }, |
|
|
132 | { "toggleextendedinfos", ToggleExtendedInfos}, /*Added: tchize*/ |
|
|
133 | { "toggleextendedtext", ToggleExtendedText}, /*Added: tchize*/ |
|
|
134 | { "asksmooth", AskSmooth}, /*Added: tchize (smoothing technologies)*/ |
|
|
135 | { NULL, NULL} /* terminator (I, II & III)*/ |
|
|
136 | }; |
|
|
137 | |
|
|
138 | /** |
|
|
139 | * RequestInfo is sort of a meta command. There is some specific |
|
|
140 | * request of information, but we call other functions to provide |
|
|
141 | * that information. |
|
|
142 | */ |
|
|
143 | void RequestInfo(char *buf, int len, NewSocket *ns) |
|
|
144 | { |
|
|
145 | char *params=NULL, *cp; |
|
|
146 | /* No match */ |
|
|
147 | char bigbuf[MAX_BUF]; |
|
|
148 | int slen; |
|
|
149 | |
|
|
150 | /* Set up replyinfo before we modify any of the buffers - this is used |
|
|
151 | * if we don't find a match. |
|
|
152 | */ |
|
|
153 | strcpy(bigbuf,"replyinfo "); |
|
|
154 | slen = strlen(bigbuf); |
|
|
155 | safe_strcat(bigbuf, buf, &slen, MAX_BUF); |
|
|
156 | |
|
|
157 | /* find the first space, make it null, and update the |
|
|
158 | * params pointer. |
|
|
159 | */ |
|
|
160 | for (cp = buf; *cp != '\0'; cp++) |
|
|
161 | if (*cp==' ') { |
|
|
162 | *cp = '\0'; |
|
|
163 | params = cp + 1; |
|
|
164 | break; |
|
|
165 | } |
|
|
166 | if (!strcmp(buf, "image_info")) send_image_info(ns, params); |
|
|
167 | else if (!strcmp(buf,"image_sums")) send_image_sums(ns, params); |
|
|
168 | else if (!strcmp(buf,"skill_info")) send_skill_info(ns, params); |
|
|
169 | else if (!strcmp(buf,"spell_paths")) send_spell_paths(ns, params); |
|
|
170 | else Write_String_To_Socket(ns, bigbuf, len); |
|
|
171 | } |
|
|
172 | |
|
|
173 | /** |
|
|
174 | * Handle client input. |
|
|
175 | * |
|
|
176 | * HandleClient is actually not named really well - we only get here once |
|
|
177 | * there is input, so we don't do exception or other stuff here. |
|
|
178 | * sock is the output socket information. pl is the player associated |
|
|
179 | * with this socket, null if no player (one of the init_sockets for just |
|
|
180 | * starting a connection) |
|
|
181 | */ |
|
|
182 | |
|
|
183 | void HandleClient(NewSocket *ns, player *pl) |
|
|
184 | { |
|
|
185 | int len=0,i,cnt; |
|
|
186 | char *data; |
|
|
187 | |
|
|
188 | /* Loop through this - maybe we have several complete packets here. */ |
|
|
189 | // limit to a few commands only, though, as to not monopolise the server |
|
|
190 | for (cnt = 16; cnt--; ) { |
|
|
191 | /* If it is a player, and they don't have any speed left, we |
|
|
192 | * return, and will read in the data when they do have time. |
|
|
193 | */ |
|
|
194 | if (pl && pl->state==ST_PLAYING && pl->ob != NULL && pl->ob->speed_left < 0) { |
|
|
195 | return; |
|
|
196 | } |
|
|
197 | |
|
|
198 | i=SockList_ReadPacket(ns->fd, &ns->inbuf, MAXSOCKBUF-1); |
|
|
199 | |
|
|
200 | if (i<0) { |
|
|
201 | #ifdef ESRV_DEBUG |
|
|
202 | LOG(llevDebug,"HandleClient: Read error on connection player %s\n", (pl?pl->ob->name:"None")); |
|
|
203 | #endif |
|
|
204 | /* Caller will take care of cleaning this up */ |
|
|
205 | ns->status =Ns_Dead; |
|
|
206 | return; |
|
|
207 | } |
|
|
208 | /* Still dont have a full packet */ |
|
|
209 | if (i==0) return; |
|
|
210 | |
|
|
211 | // //D//TODO//temporarily log long commands |
|
|
212 | // if (ns->inbuf.len >= 40 && pl && pl->ob) |
|
|
213 | // LOG (llevDebug, "HandleClient: long comamnd from <%s,%s> %d<%s>\n", pl->ob->name, ns->host, ns->inbuf.len, ns->inbuf.buf + 2); |
|
|
214 | |
|
|
215 | /* First, break out beginning word. There are at least |
|
|
216 | * a few commands that do not have any paremeters. If |
|
|
217 | * we get such a command, don't worry about trying |
|
|
218 | * to break it up. |
|
|
219 | */ |
|
|
220 | data = (char *)strchr((char*)ns->inbuf.buf +2, ' '); |
|
|
221 | if (data) { |
|
|
222 | *data='\0'; |
|
|
223 | data++; |
|
|
224 | len = ns->inbuf.len - (data - (char*)ns->inbuf.buf); |
|
|
225 | } |
|
|
226 | else len=0; |
|
|
227 | |
|
|
228 | ns->inbuf.buf[ns->inbuf.len]='\0'; /* Terminate buffer - useful for string data */ |
|
|
229 | for (i=0; nscommands[i].cmdname !=NULL; i++) { |
|
|
230 | if (strcmp((char*)ns->inbuf.buf+2,nscommands[i].cmdname)==0) { |
|
|
231 | nscommands[i].cmdproc((char*)data,len,ns); |
|
|
232 | ns->inbuf.len=0; |
|
|
233 | return;//D// not doing this causes random memory corruption |
|
|
234 | goto next_packet; |
|
|
235 | } |
|
|
236 | } |
|
|
237 | /* Player must be in the playing state or the flag on the |
|
|
238 | * the command must be zero for the user to use the command - |
|
|
239 | * otherwise, a player cam save, be in the play_again state, and |
|
|
240 | * the map they were on gets swapped out, yet things that try to look |
|
|
241 | * at the map causes a crash. If the command is valid, but |
|
|
242 | * one they can't use, we still swallow it up. |
|
|
243 | */ |
|
|
244 | if (pl) for (i=0; plcommands[i].cmdname !=NULL; i++) { |
|
|
245 | if (strcmp((char*)ns->inbuf.buf+2,plcommands[i].cmdname)==0) { |
|
|
246 | if (pl->state == ST_PLAYING || !(plcommands[i].flag & 1)) |
|
|
247 | plcommands[i].cmdproc((char*)data,len,pl); |
|
|
248 | ns->inbuf.len=0; |
|
|
249 | //D// not doing this causes random memory corruption |
|
|
250 | if (plcommands[i].flag & 2) |
|
|
251 | goto next_packet; |
|
|
252 | return; |
|
|
253 | } |
|
|
254 | } |
|
|
255 | /* If we get here, we didn't find a valid command. Logging |
|
|
256 | * this might be questionable, because a broken client/malicious |
|
|
257 | * user could certainly send a whole bunch of invalid commands. |
|
|
258 | */ |
|
|
259 | LOG(llevDebug,"Bad command from client (%s)\n",ns->inbuf.buf+2); |
|
|
260 | next_packet: |
|
|
261 | ; |
|
|
262 | } |
|
|
263 | } |
|
|
264 | |
|
|
265 | |
|
|
266 | /***************************************************************************** |
|
|
267 | * |
|
|
268 | * Low level socket looping - select calls and watchdog udp packet |
|
|
269 | * sending. |
|
|
270 | * |
|
|
271 | ******************************************************************************/ |
|
|
272 | |
|
|
273 | #ifdef WATCHDOG |
|
|
274 | /** |
|
|
275 | * Tell watchdog that we are still alive |
|
|
276 | * |
|
|
277 | * I put the function here since we should hopefully already be getting |
|
|
278 | * all the needed include files for socket support |
|
|
279 | */ |
|
|
280 | |
|
|
281 | void watchdog(void) |
|
|
282 | { |
|
|
283 | static int fd=-1; |
|
|
284 | static struct sockaddr_in insock; |
|
|
285 | |
|
|
286 | if (fd==-1) |
|
|
287 | { |
|
|
288 | struct protoent *protoent; |
|
|
289 | |
|
|
290 | if ((protoent=getprotobyname("udp"))==NULL || |
|
|
291 | (fd=socket(PF_INET, SOCK_DGRAM, protoent->p_proto))==-1) |
|
|
292 | { |
|
|
293 | return; |
|
|
294 | } |
|
|
295 | insock.sin_family=AF_INET; |
|
|
296 | insock.sin_port=htons((unsigned short)13325); |
|
|
297 | insock.sin_addr.s_addr=inet_addr("127.0.0.1"); |
|
|
298 | } |
|
|
299 | sendto(fd,(void *)&fd,1,0,(struct sockaddr *)&insock,sizeof(insock)); |
|
|
300 | } |
|
|
301 | #endif |
|
|
302 | |
|
|
303 | void flush_sockets(void) |
|
|
304 | { |
|
|
305 | player *pl; |
|
|
306 | |
|
|
307 | for (pl = first_player; pl != NULL; pl = pl->next) |
|
|
308 | if (pl->socket.status != Ns_Dead) |
|
|
309 | Socket_Flush (&pl->socket); |
|
|
310 | } |
|
|
311 | |
|
|
312 | /** |
|
|
313 | * This checks the sockets for input and exceptions, does the right thing. |
118 | * This checks the sockets for input, does the right thing. |
314 | * |
119 | * |
315 | * A bit of this code is grabbed out of socket.c |
120 | * A bit of this code is grabbed out of socket.c |
316 | * There are 2 lists we need to look through - init_sockets is a list |
121 | * There are 2 lists we need to look through - init_sockets is a list |
317 | * |
122 | * |
318 | */ |
123 | */ |
|
|
124 | void |
319 | void doeric_server(void) |
125 | doeric_server (void) |
320 | { |
126 | { |
321 | int i, pollret; |
127 | //TODO: should not be done here, either |
322 | fd_set tmp_read, tmp_exceptions, tmp_write; |
128 | for (unsigned i = 0; i < clients.size (); ++i) |
323 | struct sockaddr_in addr; |
129 | { |
324 | socklen_t addrlen=sizeof(struct sockaddr); |
130 | client *ns = clients [i]; |
325 | player *pl, *next; |
|
|
326 | |
131 | |
327 | #ifdef CS_LOGSTATS |
132 | ns->tick (); |
328 | if ((time(NULL)-cst_lst.time_start)>=CS_LOGTIME) |
133 | ns->refcnt_chk (); |
329 | write_cs_stats(); |
134 | } |
|
|
135 | } |
|
|
136 | |
|
|
137 | void |
|
|
138 | client::tick () |
|
|
139 | { |
|
|
140 | if (!pl || destroyed ()) |
|
|
141 | return; |
|
|
142 | |
|
|
143 | /* 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 | |
|
|
148 | 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 | |
|
|
156 | draw_client_map (pl); |
|
|
157 | |
|
|
158 | if (update_look) |
|
|
159 | esrv_draw_look (pl); |
|
|
160 | |
|
|
161 | 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 | { |
|
|
167 | 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 | } |
330 | #endif |
178 | #endif |
331 | |
179 | |
332 | FD_ZERO(&tmp_read); |
180 | if (!overload) |
333 | FD_ZERO(&tmp_write); |
181 | { |
334 | FD_ZERO(&tmp_exceptions); |
182 | if (ixface.empty ()) |
335 | |
|
|
336 | for(i=0;i<socket_info.allocated_sockets;i++) { |
|
|
337 | if (init_sockets[i].status == Ns_Dead) { |
|
|
338 | free_newsocket(&init_sockets[i]); |
|
|
339 | init_sockets[i].status = Ns_Avail; |
|
|
340 | socket_info.nconns--; |
|
|
341 | } else if (init_sockets[i].status != Ns_Avail){ |
|
|
342 | FD_SET((uint32)init_sockets[i].fd, &tmp_read); |
|
|
343 | FD_SET((uint32)init_sockets[i].fd, &tmp_write); |
|
|
344 | FD_SET((uint32)init_sockets[i].fd, &tmp_exceptions); |
|
|
345 | } |
183 | { |
346 | } |
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 | { |
|
|
188 | ++scrub_idx; |
347 | |
189 | |
348 | /* Go through the players. Let the loop set the next pl value, |
190 | if (!faces_sent [scrub_idx]) |
349 | * since we may remove some |
191 | if (faceinfo *f = face_info (scrub_idx)) |
350 | */ |
192 | if (f->type == FT_FACE) // only scrub faces for now |
351 | for (pl=first_player; pl!=NULL; ) { |
193 | { |
352 | if (pl->socket.status == Ns_Dead) { |
194 | send_face (scrub_idx, -120); |
353 | player *npl=pl->next; |
195 | flush_fx (); |
354 | |
196 | |
355 | save_player(pl->ob, 0); |
197 | bg_scrub = 1; // send up to one face per tick, unless an image was requested |
356 | if(!QUERY_FLAG(pl->ob,FLAG_REMOVED)) { |
198 | break; |
357 | terminate_all_pets(pl->ob); |
199 | } |
358 | remove_ob(pl->ob); |
|
|
359 | } |
200 | } |
360 | leave(pl,1); |
201 | |
361 | final_free_player(pl); |
202 | rate_avail = max_rate - outputbuffer_len (); |
362 | pl=npl; |
203 | } |
|
|
204 | else |
363 | } |
205 | { |
364 | else { |
206 | int ol = outputbuffer_len (); |
365 | FD_SET((uint32)pl->socket.fd, &tmp_read); |
|
|
366 | FD_SET((uint32)pl->socket.fd, &tmp_write); |
|
|
367 | FD_SET((uint32)pl->socket.fd, &tmp_exceptions); |
|
|
368 | pl=pl->next; |
|
|
369 | } |
|
|
370 | } |
|
|
371 | |
207 | |
372 | /* Reset timeout each time, since some OS's will change the values on |
208 | rate_avail = min (max_rate, rate_avail + max_rate); |
373 | * the return from select. |
209 | rate_avail -= ol; |
374 | */ |
|
|
375 | socket_info.timeout.tv_sec = 0; |
|
|
376 | socket_info.timeout.tv_usec = 0; |
|
|
377 | |
210 | |
378 | pollret= select(socket_info.max_filedescriptor, &tmp_read, &tmp_write, |
211 | int avail = rate_avail; |
379 | &tmp_exceptions, &socket_info.timeout); |
|
|
380 | |
212 | |
381 | if (pollret==-1) { |
213 | // if we can split images, transfer up to mss-sized packets if possible |
382 | LOG(llevError, "select failed: %s\n", strerror(errno)); |
214 | // but never 768 bytes more. |
383 | return; |
215 | if (fxix) avail += min (768, mss - (ol % mss)); |
384 | } |
|
|
385 | |
216 | |
386 | /* We need to do some of the processing below regardless */ |
217 | bg_scrub = BG_SCRUB_RATE; |
387 | /* if (!pollret) return;*/ |
|
|
388 | |
218 | |
389 | /* Following adds a new connection */ |
219 | while (avail > 0) |
390 | if (pollret && FD_ISSET(init_sockets[0].fd, &tmp_read)) { |
|
|
391 | int newsocknum=0; |
|
|
392 | |
|
|
393 | #ifdef ESRV_DEBUG |
|
|
394 | LOG(llevDebug,"doeric_server: New Connection\n"); |
|
|
395 | #endif |
|
|
396 | /* If this is the case, all sockets currently in used */ |
|
|
397 | if (socket_info.allocated_sockets <= socket_info.nconns) { |
|
|
398 | init_sockets = (NewSocket *) realloc(init_sockets,sizeof(NewSocket)*(socket_info.nconns+1)); |
|
|
399 | if (!init_sockets) fatal(OUT_OF_MEMORY); |
|
|
400 | newsocknum = socket_info.allocated_sockets; |
|
|
401 | socket_info.allocated_sockets++; |
|
|
402 | init_sockets[newsocknum].faces_sent_len = nrofpixmaps; |
|
|
403 | init_sockets[newsocknum].faces_sent = (uint8*) malloc(nrofpixmaps*sizeof(*init_sockets[newsocknum].faces_sent)); |
|
|
404 | if (!init_sockets[newsocknum].faces_sent) fatal(OUT_OF_MEMORY); |
|
|
405 | init_sockets[newsocknum].status = Ns_Avail; |
|
|
406 | } |
|
|
407 | else { |
|
|
408 | int j; |
220 | { |
|
|
221 | ixsend &ix = ixface.back (); |
409 | |
222 | |
410 | for (j=1; j<socket_info.allocated_sockets; j++) |
223 | if (facedata *d = face_data (ix.idx, faceset)) |
411 | if (init_sockets[j].status == Ns_Avail) { |
224 | { |
412 | newsocknum=j; |
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 | } |
|
|
256 | else |
|
|
257 | ix.ofs = 0; |
|
|
258 | |
|
|
259 | int consumed = outputbuffer_len () - ol; |
|
|
260 | |
|
|
261 | avail -= consumed; |
|
|
262 | rate_avail -= consumed; |
|
|
263 | |
|
|
264 | ol = outputbuffer_len (); |
|
|
265 | |
|
|
266 | if (!ix.ofs) |
|
|
267 | { |
|
|
268 | ixface.pop_back (); |
|
|
269 | |
|
|
270 | if (ixface.empty ()) |
413 | break; |
271 | break; |
414 | } |
272 | } |
415 | } |
|
|
416 | init_sockets[newsocknum].fd=accept(init_sockets[0].fd, (struct sockaddr *)&addr, &addrlen); |
|
|
417 | if (init_sockets[newsocknum].fd==-1) { |
|
|
418 | LOG(llevError, "accept failed: %s\n", strerror(errno)); |
|
|
419 | } |
|
|
420 | else { |
|
|
421 | char buf[MAX_BUF]; |
|
|
422 | long ip; |
|
|
423 | NewSocket *ns; |
|
|
424 | |
|
|
425 | ns = &init_sockets[newsocknum]; |
|
|
426 | |
|
|
427 | ip = ntohl(addr.sin_addr.s_addr); |
|
|
428 | sprintf(buf, "%ld.%ld.%ld.%ld", (ip>>24)&255, (ip>>16)&255, (ip>>8)&255, ip&255); |
|
|
429 | |
|
|
430 | if (checkbanned(NULL, buf)) { |
|
|
431 | LOG(llevInfo, "Banned host tried to connect: [%s]\n", buf); |
|
|
432 | close(init_sockets[newsocknum].fd); |
|
|
433 | init_sockets[newsocknum].fd = -1; |
|
|
434 | } |
273 | } |
435 | else { |
|
|
436 | InitConnection(ns, buf); |
|
|
437 | socket_info.nconns++; |
|
|
438 | } |
274 | } |
439 | } |
|
|
440 | } |
275 | } |
441 | |
|
|
442 | /* Check for any exceptions/input on the sockets */ |
|
|
443 | if (pollret) for(i=1;i<socket_info.allocated_sockets;i++) { |
|
|
444 | if (init_sockets[i].status == Ns_Avail) continue; |
|
|
445 | if (FD_ISSET(init_sockets[i].fd,&tmp_exceptions)) { |
|
|
446 | free_newsocket(&init_sockets[i]); |
|
|
447 | init_sockets[i].status = Ns_Avail; |
|
|
448 | socket_info.nconns--; |
|
|
449 | continue; |
|
|
450 | } |
|
|
451 | if (FD_ISSET(init_sockets[i].fd, &tmp_read)) { |
|
|
452 | HandleClient(&init_sockets[i], NULL); |
|
|
453 | } |
|
|
454 | if (FD_ISSET(init_sockets[i].fd, &tmp_write)) { |
|
|
455 | init_sockets[i].can_write=1; |
|
|
456 | } |
|
|
457 | } |
|
|
458 | |
|
|
459 | /* This does roughly the same thing, but for the players now */ |
|
|
460 | for (pl=first_player; pl!=NULL; pl=next) { |
|
|
461 | |
|
|
462 | next=pl->next; |
|
|
463 | if (pl->socket.status==Ns_Dead) continue; |
|
|
464 | |
|
|
465 | if (FD_ISSET(pl->socket.fd,&tmp_write)) { |
|
|
466 | if (!pl->socket.can_write) { |
|
|
467 | #if 0 |
|
|
468 | LOG(llevDebug,"Player %s socket now write enabled\n", pl->ob->name); |
|
|
469 | #endif |
|
|
470 | pl->socket.can_write=1; |
|
|
471 | write_socket_buffer(&pl->socket); |
|
|
472 | } |
|
|
473 | /* if we get an error on the write_socket buffer, no reason to |
|
|
474 | * continue on this socket. |
|
|
475 | */ |
|
|
476 | if (pl->socket.status==Ns_Dead) continue; |
|
|
477 | } |
|
|
478 | else pl->socket.can_write=0; |
|
|
479 | |
|
|
480 | if (FD_ISSET(pl->socket.fd,&tmp_exceptions)) { |
|
|
481 | save_player(pl->ob, 0); |
|
|
482 | if(!QUERY_FLAG(pl->ob,FLAG_REMOVED)) { |
|
|
483 | terminate_all_pets(pl->ob); |
|
|
484 | remove_ob(pl->ob); |
|
|
485 | } |
|
|
486 | leave(pl,1); |
|
|
487 | final_free_player(pl); |
|
|
488 | } |
|
|
489 | else { |
|
|
490 | HandleClient(&pl->socket, pl); |
|
|
491 | /* If the player has left the game, then the socket status |
|
|
492 | * will be set to this be the leave function. We don't |
|
|
493 | * need to call leave again, as it has already been called |
|
|
494 | * once. |
|
|
495 | */ |
|
|
496 | if (pl->socket.status==Ns_Dead) { |
|
|
497 | save_player(pl->ob, 0); |
|
|
498 | if(!QUERY_FLAG(pl->ob,FLAG_REMOVED)) { |
|
|
499 | terminate_all_pets(pl->ob); |
|
|
500 | remove_ob(pl->ob); |
|
|
501 | } |
|
|
502 | leave(pl,1); |
|
|
503 | final_free_player(pl); |
|
|
504 | } else { |
|
|
505 | |
|
|
506 | /* Update the players stats once per tick. More efficient than |
|
|
507 | * sending them whenever they change, and probably just as useful |
|
|
508 | */ |
|
|
509 | esrv_update_stats(pl); |
|
|
510 | if (pl->last_weight != -1 && pl->last_weight != WEIGHT(pl->ob)) { |
|
|
511 | esrv_update_item(UPD_WEIGHT, pl->ob, pl->ob); |
|
|
512 | if(pl->last_weight != WEIGHT(pl->ob)) |
|
|
513 | LOG(llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", (unsigned long)pl->last_weight, WEIGHT(pl->ob)); |
|
|
514 | } |
|
|
515 | /* draw_client_map does sanity checking that map is |
|
|
516 | * valid, so don't do it here. |
|
|
517 | */ |
|
|
518 | draw_client_map(pl->ob); |
|
|
519 | if (pl->socket.update_look) esrv_draw_look(pl->ob); |
|
|
520 | } |
|
|
521 | } |
|
|
522 | } |
|
|
523 | } |
276 | } |
|
|
277 | |