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.20 by root, Sat Dec 16 03:08:26 2006 UTC vs.
Revision 1.42 by root, Thu Mar 15 03:30:37 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
3 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4 Copyright (C) 2002-2003 Mark Wedel & The Crossfire Development Team 5 * Copyright (C) 2002-2003 Mark Wedel & The Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * This program 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 2 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, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 21 *
21 The author can be reached via e-mail to <crossfire@schmorp.de> 22 * The author 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 *
28 * \date 2003-12-02 29 * \date 2003-12-02
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 * maintenance (checking for lost connections and if data has arrived.) 32 * maintanance (checking for lost connections and if data has arrived.)
32 * The reading of data is handled in ericserver.c
33 */ 33 */
34 34
35#define BG_SCRUB_RATE 4 // how often to send a face in the background
35 36
36#include <global.h> 37#include <global.h>
37#include <sproto.h> 38#include <sproto.h>
38#include <sockproto.h> 39#include <sockproto.h>
39 40
… …
47#include <arpa/inet.h> 48#include <arpa/inet.h>
48 49
49#include <loader.h> 50#include <loader.h>
50 51
51#define MAX_QUEUE_DEPTH 500 //TODO 52#define MAX_QUEUE_DEPTH 500 //TODO
52
53//TODO: cannot use this, as it might ignore vital commands such as fire_stop
54#define MAX_QUEUE_BACKLOG 1e99 //TODO 53#define MAX_QUEUE_BACKLOG 3. //TODO
54
55void
56client::reset_state ()
57{
58 if (!pl)
59 return;
60
61 pl->run_on = 0;
62 pl->fire_on = 0;
63}
55 64
56void 65void
57client::queue_command (packet_type *handler, char *data, int datalen) 66client::queue_command (packet_type *handler, char *data, int datalen)
58{ 67{
59 tstamp stamp = now (); 68 tstamp stamp = now ();
60 69
61 if (cmd_queue.size () >= MAX_QUEUE_DEPTH) 70 if (cmd_queue.size () >= MAX_QUEUE_DEPTH)
71 {
62 //TODO: just disconnect here? 72 //TODO: just disconnect here?
73 reset_state ();
63 send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); 74 send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED);
64 else if (!cmd_queue.empty () && cmd_queue.front ().stamp + MAX_QUEUE_BACKLOG < stamp) 75 }
65 //TODO: do fire_stop and other things that might be necessary
66 send_packet_printf ("drawinfo %d too many commands in queue, ignoring.", NDI_RED);
67 else 76 else
77 {
68 cmd_queue.push_back (command ( 78 cmd_queue.push_back (command ());
69 stamp, handler, (char *)salloc (datalen, data), datalen 79 command &cmd = cmd_queue.back ();
70 )); 80 cmd.stamp = stamp;
81 cmd.handler = handler;
82 cmd.data = salloc<char> (datalen + 1, data);
83 cmd.datalen = datalen;
84 }
71} 85}
72 86
73bool 87bool
74client::handle_command () 88client::handle_command ()
75{ 89{
76 if (pl && pl->state == ST_PLAYING && pl->ob && pl->ob->speed_left < 0) 90 bool skipping = false;
77 return false;
78 91
79 if (cmd_queue.empty ()) 92 while (!cmd_queue.empty ()
80 return false; 93 && !(state == ST_PLAYING && pl->ob && pl->ob->speed_left <= 0))
81 94 {
82 command &cmd = cmd_queue.front (); 95 command &cmd = cmd_queue.front ();
83 96
84 if (cmd.stamp + MAX_QUEUE_BACKLOG < now ()) 97 if (cmd.stamp + MAX_QUEUE_BACKLOG < now ())
85 //TODO: do fire_stop and other things that might be necessary 98 {
99 if (!skipping)
100 {
101 skipping = true;
102 reset_state ();
86 send_packet_printf ("drawinfo %d ignoring delayed command.", NDI_RED); 103 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED);
104 }
105
106 cmd_queue.pop_front ();
107 }
87 else 108 else
109 {
88 execute (cmd.handler, cmd.data, cmd.datalen); 110 execute (cmd.handler, cmd.data, cmd.datalen);
89
90 sfree (cmd.data, cmd.datalen);
91 cmd_queue.pop_front (); 111 cmd_queue.pop_front ();
92
93 return true; 112 return true;
113 }
114 }
115
116 return false;
94} 117}
95 118
96void 119void
97flush_sockets (void) 120flush_sockets (void)
98{ 121{
99 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) 122 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
100 if ((*i)->status != Ns_Dead)
101 (*i)->flush (); 123 (*i)->flush ();
102} 124}
103 125
104/** 126/**
105 * This checks the sockets for input, does the right thing. 127 * This checks the sockets for input, does the right thing.
106 * 128 *
… …
114#ifdef CS_LOGSTATS 136#ifdef CS_LOGSTATS
115 if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME) 137 if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME)
116 write_cs_stats (); 138 write_cs_stats ();
117#endif 139#endif
118 140
119 /* Go through the players. Let the loop set the next pl value, 141 //TODO: should not be done here, either
120 * since we may remove some 142 for (unsigned i = 0; i < clients.size (); ++i)
143 {
144 client *ns = clients [i];
145
146 ns->tick ();
147 ns->refcnt_chk ();
148 }
149}
150
151void
152client::tick ()
153{
154 if (!pl || destroyed ())
155 return;
156
157 /* Update the players stats once per tick. More efficient than
158 * sending them whenever they change, and probably just as useful
121 */ 159 */
122 //TODO: must be handled cleanly elsewhere
123 for (player *pl = first_player; pl; )
124 {
125 player *npl = pl->next;
126
127 //TODO: must be handled cleanly elsewhere
128 if (!pl->socket || pl->socket->status == Ns_Dead)
129 {
130 save_player (pl->ob, 0);
131
132 if (!QUERY_FLAG (pl->ob, FLAG_REMOVED))
133 {
134 terminate_all_pets (pl->ob);
135 pl->ob->remove ();
136 }
137
138 leave (pl, 1);
139 final_free_player (pl);
140 }
141
142 pl = npl;
143 }
144
145 for (sockvec::iterator i = clients.begin (); i != clients.end (); )
146 {
147 client *s = *i;
148
149 if (s->status == Ns_Dead)
150 {
151 clients.erase (i);
152 delete s;
153 }
154 else
155 ++i;
156 }
157
158 /* We need to do some of the processing below regardless */
159
160 /* Check for any input on the sockets */
161 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
162 {
163 client *s = *i;
164 player *pl = s->pl;
165
166 s->handle_packet ();
167 s->handle_command ();
168
169 //TODO: should not be done here, either
170 if (s->status != Ns_Dead && pl)
171 {
172 /* Update the players stats once per tick. More efficient than
173 * sending them whenever they change, and probably just as useful
174 */
175 esrv_update_stats (pl); 160 esrv_update_stats (pl);
176 161
177 if (pl->last_weight != -1 && pl->last_weight != WEIGHT (pl->ob)) 162 if (last_weight != -1 && last_weight != WEIGHT (pl->ob))
178 { 163 {
179 esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); 164 esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
180 if (pl->last_weight != WEIGHT (pl->ob)) 165 if (last_weight != WEIGHT (pl->ob))
181 LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", 166 LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n",
182 (unsigned long) pl->last_weight, WEIGHT (pl->ob)); 167 (unsigned long) last_weight, WEIGHT (pl->ob));
168 }
169
170 draw_client_map (pl->ob);
171
172 if (update_look)
173 esrv_draw_look (pl->ob);
174
175 if (askface.empty ())
176 {
177 if (bg_scrub && !--bg_scrub)
178 while (scrub_idx < faces.size () - 1)
179 {
180 ++scrub_idx;
181 if (!faces_sent [scrub_idx])
182 {
183 send_face (scrub_idx);
184 bg_scrub = 1; // send up to one face per tick, unless an image was requested
185 break;
183 } 186 }
184
185 draw_client_map (pl->ob);
186
187 if (s->update_look)
188 esrv_draw_look (pl->ob);
189 } 187 }
188 }
189 else
190 while (!askface.empty () && outputbuffer_len () < max_rate)
191 {
192 // use a lifo to send most recently requested images
193 faceidx face = askface.back ();
194 askface.pop_back ();
195
196 send_image (face);
197
198 bg_scrub = BG_SCRUB_RATE;
190 } 199 }
191} 200}
192

Diff Legend

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