--- deliantra/server/socket/loop.C 2006/12/21 23:37:06 1.31 +++ deliantra/server/socket/loop.C 2007/01/02 11:08:36 1.35 @@ -48,7 +48,7 @@ #include #define MAX_QUEUE_DEPTH 500 //TODO -#define MAX_QUEUE_BACKLOG 5. //TODO +#define MAX_QUEUE_BACKLOG 3. //TODO void client::reset_state () @@ -136,55 +136,13 @@ write_cs_stats (); #endif - /* Go through the players. Let the loop set the next pl value, - * since we may remove some - */ - //TODO: must be handled cleanly elsewhere - for (player *pl = first_player; pl; ) + //TODO: should not be done here, either + for (int i = 0; i < clients.size (); ++i) { - player *npl = pl->next; - - //TODO: must be handled cleanly elsewhere - if (!pl->ns || pl->ns->destroyed ()) - { - save_player (pl->ob, 0); - - if (!QUERY_FLAG (pl->ob, FLAG_REMOVED)) - { - terminate_all_pets (pl->ob); - pl->ob->remove (); - } - - leave (pl, 1); - final_free_player (pl); - } - - pl = npl; - } - - for (sockvec::iterator i = clients.begin (); i != clients.end (); ) - { - client *s = *i; - - if (s->destroyed ()) - { - clients.erase (i); - delete s; - } - else - ++i; - } - - /* We need to do some of the processing below regardless */ - - /* Check for any input on the sockets */ - for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) - { - client *s = *i; + client *s = clients [i]; player *pl = s->pl; - //TODO: should not be done here, either - if (!s->destroyed () && pl) + if (pl && pl->ns && !pl->ns->destroyed ()) { /* Update the players stats once per tick. More efficient than * sending them whenever they change, and probably just as useful @@ -204,6 +162,8 @@ if (s->update_look) esrv_draw_look (pl->ob); } + + s->refcnt_chk (); } }