--- deliantra/server/socket/loop.C 2007/03/16 02:37:54 1.43 +++ deliantra/server/socket/loop.C 2007/07/01 05:00:20 1.55 @@ -1,25 +1,24 @@ /* - * CrossFire, A Multiplayer game for X-windows + * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. * - * 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 + * 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 * - * This program is free software; you can redistribute it and/or modify + * 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 + * the Free Software Foundation, either version 3 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 + * 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 + * along with this program. If not, see . + * + * The authors can be reached via e-mail to */ /** @@ -32,8 +31,6 @@ * 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 #include #include @@ -49,8 +46,10 @@ #include -#define MAX_QUEUE_DEPTH 500 //TODO -#define MAX_QUEUE_BACKLOG 3. //TODO +#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 () @@ -65,7 +64,7 @@ void client::queue_command (packet_type *handler, char *data, int datalen) { - tstamp stamp = now (); + tstamp stamp = NOW; if (cmd_queue.size () >= MAX_QUEUE_DEPTH) { @@ -87,33 +86,25 @@ bool client::handle_command () { - bool skipping = false; - - while (!cmd_queue.empty () - && !(state == ST_PLAYING && pl->ob && pl->ob->speed_left <= 0)) + 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 ()) + if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW) { - if (!skipping) - { - skipping = true; - reset_state (); - send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); - } - - cmd_queue.pop_front (); + 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; - } - } + execute (cmd.handler, cmd.data, cmd.datalen); - return false; + cmd_queue.pop_front (); + return true; + } + else + return false; } void @@ -133,11 +124,6 @@ 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) { @@ -167,35 +153,93 @@ (unsigned long) last_weight, WEIGHT (pl->ob)); } - draw_client_map (pl->ob); + draw_client_map (pl); if (update_look) - esrv_draw_look (pl->ob); + esrv_draw_look (pl); - if (askface.empty ()) + if (ixface.empty ()) { + // 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 - while (!askface.empty () && outputbuffer_len () < max_rate) - { - // use a lifo to send most recently requested images - faceidx face = askface.back (); - askface.pop_back (); + { + 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-sized packets if possible + // but never 768 bytes more. + if (fxix) avail += min (768, mss - (ol % mss)); + + bg_scrub = BG_SCRUB_RATE; + + while (avail > 0) + { + ixsend &ix = ixface.back (); + + if (facedata *d = face_data (ix.idx, faceset)) + { + if (fxix) + { + // 9 bytes is enough for fx_FFFOOO, 40 leaves some room for image data + int chunk = min (min (avail - 40, MAXSOCKBUF - 9), ix.ofs); + + if (chunk <= 0) + break; + + ix.ofs -= chunk; + + packet sl ("ix"); + + sl << ber32 (ix.idx) + << ber32 (ix.ofs) + << data (d->data.data () + ix.ofs, chunk); + + send_packet (sl); + } + else + { + send_image (ix.idx); + ix.ofs = 0; + } + } + else + ix.ofs = 0; + + int consumed = ol - outputbuffer_len (); - send_image (face); + avail -= consumed; + rate_avail -= consumed; - bg_scrub = BG_SCRUB_RATE; - } + ol = outputbuffer_len (); + + if (!ix.ofs) + { + ixface.pop_back (); + if (ixface.empty ()) + break; + } + } + } }