1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | |
3 | * |
4 | Copyright (C) 1992 Frank Tore Johansen |
4 | * Copyright (©) 2018 Marc Alexander Lehmann / the Deliantra team |
5 | |
5 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
6 | This program is free software; you can redistribute it and/or modify |
6 | * |
|
|
7 | * Deliantra is free software: you can redistribute it and/or modify it under |
7 | it under the terms of the GNU General Public License as published by |
8 | * the terms of the Affero GNU General Public License as published by the |
8 | the Free Software Foundation; either version 2 of the License, or |
9 | * Free Software Foundation, either version 3 of the License, or (at your |
9 | (at your option) any later version. |
10 | * option) any later version. |
10 | |
11 | * |
11 | This program is distributed in the hope that it will be useful, |
12 | * This program is distributed in the hope that it will be useful, |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | GNU General Public License for more details. |
15 | * GNU General Public License for more details. |
15 | |
16 | * |
16 | You should have received a copy of the GNU General Public License |
17 | * You should have received a copy of the Affero GNU General Public License |
17 | along with this program; if not, write to the Free Software |
18 | * and the GNU General Public License along with this program. If not, see |
18 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
19 | * <http://www.gnu.org/licenses/>. |
19 | |
|
|
20 | The author can be reached via e-mail to mark@pyramid.com |
|
|
21 | */ |
|
|
22 | |
|
|
23 | /** |
|
|
24 | * \file |
|
|
25 | * Low-level socket-related functions. |
|
|
26 | * |
20 | * |
27 | * \date 2003-12-02 |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
28 | * |
|
|
29 | * Contains some base functions that both the client and server |
|
|
30 | * can use. As such, depending what we are being compiled for will |
|
|
31 | * determine what we can include. the client is designed have |
|
|
32 | * CFCLIENT defined as part of its compile flags. |
|
|
33 | */ |
22 | */ |
34 | |
23 | |
35 | using namespace std; |
24 | using namespace std; |
36 | |
25 | |
37 | #include <global.h> |
26 | #include <global.h> |
38 | #include <newclient.h> |
|
|
39 | #include <sproto.h> |
27 | #include <sproto.h> |
40 | #include <cstdarg> |
28 | #include <cstdarg> |
41 | |
29 | |
42 | #ifdef __linux__ |
30 | #if HAVE_TCP_INFO |
43 | # include <sys/types.h> |
31 | # include <sys/types.h> |
44 | # include <sys/socket.h> |
32 | # include <sys/socket.h> |
45 | # include <netinet/in.h> |
33 | # include <netinet/in.h> |
46 | # define TCP_HZ 1000 // sorry... |
|
|
47 | # include <netinet/tcp.h> |
34 | # include <netinet/tcp.h> |
48 | #endif |
35 | #endif |
49 | |
36 | |
50 | // use a really low timeout, as it doesn't cost any bandwidth, and you can |
37 | // force a packet when idle for more than this many seconds, |
51 | // easily die in 20 seconds... |
38 | // forcing an ack regularly. |
52 | #define SOCKET_TIMEOUT1 10 |
39 | #define IDLE_PING 2. |
53 | #define SOCKET_TIMEOUT2 20 |
|
|
54 | |
40 | |
55 | void |
41 | void |
56 | Socket_Flush (NewSocket * ns) |
42 | client::flush () |
57 | { |
43 | { |
58 | #ifdef __linux__ |
44 | if (destroyed ()) |
59 | // check time of last ack, and, if too old, kill connection |
45 | return; |
60 | struct tcp_info tcpi; |
|
|
61 | socklen_t len = sizeof (tcpi); |
|
|
62 | |
46 | |
63 | if (!getsockopt (ns->fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi)) |
47 | /** |
64 | { |
48 | * Writes data to socket. |
65 | unsigned int diff = tcpi.tcpi_last_ack_recv - tcpi.tcpi_last_data_sent; |
49 | * |
|
|
50 | * When the socket is clear to write, and we have backlogged data, this |
|
|
51 | * is called to write it out. |
|
|
52 | */ |
66 | |
53 | |
67 | if (tcpi.tcpi_unacked && SOCKET_TIMEOUT1 * TCP_HZ < diff && diff < 0x80000000UL // ack delayed for 20s |
54 | // write a nop to the socket at least every IDLE_PING seconds. |
68 | && SOCKET_TIMEOUT2 * TCP_HZ < tcpi.tcpi_last_data_sent) // no data sent for 10s |
55 | if (!outputbuffer.len) |
69 | { |
56 | { |
70 | LOG (llevDebug, "Connection on fd %d closed due to ack timeout (%u/%u/%u)\n", ns->fd, |
57 | if (last_send + IDLE_PING <= NOW && pl && pl->active) |
71 | (unsigned) tcpi.tcpi_last_ack_recv, (unsigned) tcpi.tcpi_last_data_sent, (unsigned) tcpi.tcpi_unacked); |
|
|
72 | ns->status = Ns_Dead; |
|
|
73 | } |
58 | { |
|
|
59 | // this is a bit ugly, but map1a seems to be the only |
|
|
60 | // nop'able command and it is quite small. |
|
|
61 | packet sl ("map1a"); |
|
|
62 | send_packet (sl); |
|
|
63 | } |
|
|
64 | else |
|
|
65 | return; |
|
|
66 | } |
|
|
67 | |
|
|
68 | if (socket_ev.poll () & EV_WRITE) |
|
|
69 | return; |
|
|
70 | |
|
|
71 | last_send = NOW; |
|
|
72 | write_outputbuffer (); |
|
|
73 | } |
|
|
74 | |
|
|
75 | void |
|
|
76 | client::write_outputbuffer () |
|
|
77 | { |
|
|
78 | while (outputbuffer.len) |
74 | } |
79 | { |
|
|
80 | int res = write (fd, outputbuffer.data + outputbuffer.start, |
|
|
81 | min (outputbuffer.len, SOCKETBUFSIZE - outputbuffer.start)); |
75 | |
82 | |
76 | int val; |
83 | if (res > 0) |
|
|
84 | { |
|
|
85 | outputbuffer.start += res; |
|
|
86 | /* wrap back to start of buffer */ |
|
|
87 | if (outputbuffer.start == SOCKETBUFSIZE) |
|
|
88 | outputbuffer.start = 0; |
77 | |
89 | |
78 | val = 0; setsockopt (ns->fd, IPPROTO_TCP, TCP_CORK, &val, sizeof (val)); |
90 | outputbuffer.len -= res; |
79 | val = 1; setsockopt (ns->fd, IPPROTO_TCP, TCP_CORK, &val, sizeof (val)); |
91 | } |
80 | #endif |
92 | else if (res == 0) |
81 | } |
93 | { |
|
|
94 | LOG (llevError, "socket write failed, connection closed.\n"); |
|
|
95 | destroy (); |
|
|
96 | return; |
|
|
97 | } |
|
|
98 | else if (errno == EINTR) |
|
|
99 | { |
|
|
100 | // just retry |
|
|
101 | } |
|
|
102 | else if (errno == EAGAIN) |
|
|
103 | { |
|
|
104 | // delay till ready |
|
|
105 | socket_ev.poll (socket_ev.poll () | EV_WRITE); |
|
|
106 | socket_ev.start (); |
|
|
107 | return; |
|
|
108 | } |
|
|
109 | else |
|
|
110 | { |
|
|
111 | LOG (llevError, "socket write failed: %s\n", strerror (errno)); |
|
|
112 | destroy (); |
|
|
113 | return; |
|
|
114 | } |
|
|
115 | } |
82 | |
116 | |
|
|
117 | socket_ev.poll (socket_ev.poll () & ~EV_WRITE); |
|
|
118 | } |
|
|
119 | |
|
|
120 | /****************************************************************************** |
|
|
121 | * |
|
|
122 | * Start of read routines. |
|
|
123 | * |
|
|
124 | ******************************************************************************/ |
|
|
125 | |
|
|
126 | int |
|
|
127 | client::next_packet () |
|
|
128 | { |
|
|
129 | if (inbuf_len >= 2) |
|
|
130 | { |
|
|
131 | int pkt_len = (inbuf [0] << 8) | inbuf [1]; |
|
|
132 | |
|
|
133 | if (inbuf_len >= 2 + pkt_len) |
|
|
134 | return 2 + pkt_len; |
|
|
135 | |
|
|
136 | if (inbuf_len == sizeof (inbuf)) |
|
|
137 | { |
|
|
138 | send_packet_printf ("msg %d log input buffer overflow - closing connection.", NDI_RED | NDI_REPLY); |
|
|
139 | destroy (); |
|
|
140 | return -1; |
|
|
141 | } |
|
|
142 | } |
|
|
143 | |
|
|
144 | return 0; |
|
|
145 | } |
|
|
146 | |
|
|
147 | void |
|
|
148 | client::skip_packet (int len) |
|
|
149 | { |
|
|
150 | inbuf_len -= len; |
|
|
151 | memmove (inbuf, inbuf + len, inbuf_len); |
|
|
152 | } |
|
|
153 | |
83 | /*********************************************************************** |
154 | /***************************************************************************** |
84 | * |
155 | * Start of command dispatch area. |
85 | * packet functions/utilities |
156 | * The commands here are protocol commands. |
86 | * |
|
|
87 | **********************************************************************/ |
157 | ****************************************************************************/ |
88 | |
158 | |
89 | packet &packet::operator <<(const data &v) |
159 | // SocketCommand, PlayingCommand, should not exist with those ugly casts |
|
|
160 | #define SC(cb) (void *)static_cast<void (*)(char *, int, client *)>(cb), |
|
|
161 | #define PC(cb) (void *)static_cast<void (*)(char *, int, player *)>(cb), PF_PLAYER | |
|
|
162 | |
|
|
163 | static void |
|
|
164 | NopCmd (char *, int, client *) |
90 | { |
165 | { |
91 | if (room () < v.len) |
166 | // do nothing |
92 | reset (); |
167 | } |
|
|
168 | |
|
|
169 | /** |
|
|
170 | * Dispatch table for the server. |
|
|
171 | */ |
|
|
172 | static struct packet_type packets[] = { |
|
|
173 | {"command", PC(PlayerCmd) PF_PLAYING | PF_COMMAND }, |
|
|
174 | |
|
|
175 | {"examine", PC(ExamineCmd) PF_PLAYING }, |
|
|
176 | {"ex", PC(ExCmd) PF_PLAYING }, |
|
|
177 | {"apply", PC(ApplyCmd) PF_PLAYING }, |
|
|
178 | {"lookat", PC(LookAt) PF_PLAYING }, |
|
|
179 | {"lock", PC(LockItem) PF_PLAYING }, |
|
|
180 | {"mark", PC(MarkItem) PF_PLAYING }, |
|
|
181 | {"move", PC(MoveCmd) PF_PLAYING }, |
|
|
182 | {"ext", PC(ExtCmd) 0 }, // CF+/Deliantra |
|
|
183 | {"mapredraw", PC(MapRedrawCmd) 0 }, |
|
|
184 | {"mapinfo", PC(MapInfoCmd) 0 }, // CF+/Deliantra |
|
|
185 | |
|
|
186 | {"reply", SC(ReplyCmd) 0 }, |
|
|
187 | {"exti", SC(ExtiCmd) 0 }, // CF+/Deliantra |
|
|
188 | {"addme", SC(AddMeCmd) 0 }, |
|
|
189 | {"askface", SC(AskFaceCmd) 0 }, |
|
|
190 | {"requestinfo", SC(RequestInfo) 0 }, |
|
|
191 | {"setsound", SC(SetSound) 0 }, |
|
|
192 | {"setup", SC(SetUp) 0 }, |
|
|
193 | {"version", SC(VersionCmd) 0 }, |
|
|
194 | |
|
|
195 | {"toggleextendedtext", SC(NopCmd) 0 }, // deliantra: disabled |
|
|
196 | }; |
|
|
197 | |
|
|
198 | bool |
|
|
199 | client::may_execute (const packet_type *pkt) const |
|
|
200 | { |
|
|
201 | return (!(pkt->flags & PF_PLAYER) || pl) |
|
|
202 | && (!(pkt->flags & PF_PLAYING) || state == ST_PLAYING); |
|
|
203 | } |
|
|
204 | |
|
|
205 | // HACK: some commands currently should be executed |
|
|
206 | // even when the player is frozen. this hack detects |
|
|
207 | // those commands. it should be folded into may_execute, |
|
|
208 | // but kept seperate to emphasise the hack aspect, i.e. |
|
|
209 | // do it better, then remove. |
|
|
210 | static bool |
|
|
211 | always_immediate (const client *ns, const packet_type *pkt, const char *data, int len) |
|
|
212 | { |
|
|
213 | if (!(pkt->flags & PF_COMMAND)) |
|
|
214 | return false; |
|
|
215 | |
|
|
216 | if (!ns->pl || !ns->pl->ob || !ns->pl->ob->map) |
|
|
217 | return false; |
|
|
218 | |
|
|
219 | if (len > 4 && data [ 3] == ' ' && !strncmp (data, "say " , 4)) return true; |
|
|
220 | if (len > 5 && data [ 4] == ' ' && !strncmp (data, "chat " , 5)) return true; |
|
|
221 | if (len > 6 && data [ 5] == ' ' && !strncmp (data, "shout " , 6)) return true; |
|
|
222 | if (len > 8 && data [ 7] == ' ' && !strncmp (data, "suicide " , 8)) return true; |
|
|
223 | if (len > 18 && data [17] == ' ' && !strncmp (data, "accept-invitation ", 18)) return true; |
|
|
224 | |
|
|
225 | if (len == 7 && !strcmp (data, "suicide")) return true; |
|
|
226 | |
|
|
227 | return false; |
|
|
228 | } |
|
|
229 | |
|
|
230 | void |
|
|
231 | client::execute (const packet_type *pkt, char *data, int datalen) |
|
|
232 | { |
|
|
233 | if (may_execute (pkt) || always_immediate (this, pkt, data, datalen)) |
|
|
234 | { |
|
|
235 | //TODO: only one format |
|
|
236 | if (pkt->flags & PF_PLAYER) |
|
|
237 | { |
|
|
238 | ((void (*)(char *, int, player *))pkt->cb)((char *)data, datalen, pl); |
|
|
239 | pl->need_updated_stats (); |
|
|
240 | } |
|
|
241 | else |
|
|
242 | ((void (*)(char *, int, client *))pkt->cb)((char *)data, datalen, this); |
|
|
243 | } |
93 | else |
244 | else |
|
|
245 | send_packet_printf ("msg %d log ERROR: you cannot execute '%s' now.", NDI_RED | NDI_REPLY, pkt->name); |
|
|
246 | } |
|
|
247 | |
|
|
248 | bool |
|
|
249 | client::handle_packet () |
|
|
250 | { |
|
|
251 | int pkt_len = next_packet (); |
|
|
252 | |
|
|
253 | if (!pkt_len) |
|
|
254 | return false; |
|
|
255 | else if (pkt_len < 0) |
|
|
256 | { |
|
|
257 | LOG (llevError, "read error on player %s\n", |
|
|
258 | pl && pl->ob ? &pl->ob->name : "[anonymous]"); |
|
|
259 | destroy (); |
|
|
260 | return false; |
94 | { |
261 | } |
95 | if (v.len) |
262 | |
|
|
263 | uint8_t save_byte = inbuf [pkt_len]; // rather ugly |
|
|
264 | inbuf [pkt_len] = 0; /* temporarily terminate buffer - useful for string data */ |
|
|
265 | |
|
|
266 | /* First, break out beginning word. There are at least |
|
|
267 | * a few commands that do not have any paremeters. If |
|
|
268 | * we get such a command, don't worry about trying |
|
|
269 | * to break it up. |
|
|
270 | */ |
|
|
271 | int datalen; |
|
|
272 | char *data = strchr ((char *)inbuf + 2, ' '); |
|
|
273 | |
|
|
274 | if (data) |
|
|
275 | { |
|
|
276 | *data++ = 0; |
|
|
277 | datalen = pkt_len - (data - (char *)inbuf); |
|
|
278 | } |
|
|
279 | else |
|
|
280 | { |
|
|
281 | data = (char *)inbuf + 2; // better read garbage than segfault |
|
|
282 | datalen = 0; |
|
|
283 | } |
|
|
284 | |
|
|
285 | for (packet_type *pkt = packets; pkt < packets + ecb_array_length (packets); ++pkt) |
|
|
286 | if (!strcmp ((char *)inbuf + 2, pkt->name)) |
96 | { |
287 | { |
97 | memcpy (cur, v.ptr, v.len); |
288 | if (pkt->flags & PF_PLAYER && !always_immediate (this, pkt, data, datalen)) |
98 | cur += v.len; |
289 | queue_command (pkt, data, datalen); |
|
|
290 | else |
|
|
291 | execute (pkt, data, datalen); |
|
|
292 | |
|
|
293 | goto next_packet; |
|
|
294 | } |
|
|
295 | |
|
|
296 | // If we get here, we didn't find a valid command. |
|
|
297 | send_packet_printf ("msg %d log ERROR: command '%s' not supported.", NDI_RED | NDI_REPLY, (char *)inbuf + 2); |
|
|
298 | |
|
|
299 | next_packet: |
|
|
300 | inbuf [pkt_len] = save_byte; // rather ugly |
|
|
301 | skip_packet (pkt_len); |
|
|
302 | |
|
|
303 | // input buffer has space again |
|
|
304 | socket_ev.poll (socket_ev.poll () | EV_READ); |
|
|
305 | |
|
|
306 | return true; |
|
|
307 | } |
|
|
308 | |
|
|
309 | void |
|
|
310 | client::inbuf_handle () |
|
|
311 | { |
|
|
312 | if (!handle_packet ()) |
|
|
313 | return; |
|
|
314 | |
|
|
315 | while (handle_packet ()) |
|
|
316 | ; |
|
|
317 | |
|
|
318 | flush (); |
|
|
319 | } |
|
|
320 | |
|
|
321 | // callback called when socket is either readable or writable |
|
|
322 | void |
|
|
323 | client::socket_cb (iow &w, int revents) |
|
|
324 | { |
|
|
325 | //TODO remove when we have better socket cleanup logic |
|
|
326 | if (destroyed ()) |
|
|
327 | { |
|
|
328 | socket_ev.poll (0); |
|
|
329 | return; |
|
|
330 | } |
|
|
331 | |
|
|
332 | if (revents & EV_WRITE) |
|
|
333 | { |
|
|
334 | write_outputbuffer (); |
|
|
335 | |
|
|
336 | if (!outputbuffer.len) |
|
|
337 | socket_ev.poll (socket_ev.poll () & ~EV_WRITE); |
|
|
338 | } |
|
|
339 | |
|
|
340 | if (revents & EV_READ) |
|
|
341 | { |
|
|
342 | int amount; |
|
|
343 | uint8 *rbuf; |
|
|
344 | |
|
|
345 | if (ws_version) |
99 | } |
346 | { |
100 | } |
347 | if (ws_inbuf_len + 2048 > ws_inbuf_alloc) |
|
|
348 | ws_inbuf = (uint8 *)realloc (ws_inbuf, ws_inbuf_alloc += 4096); |
101 | |
349 | |
102 | return *this; |
350 | rbuf = ws_inbuf + ws_inbuf_len; |
103 | } |
351 | amount = ws_inbuf_alloc - ws_inbuf_len; |
104 | |
|
|
105 | packet &packet::operator <<(const data8 &v) |
|
|
106 | { |
|
|
107 | unsigned int len = min (v.len, 0x00FF); |
|
|
108 | return *this << uint8 (len) << data (v.ptr, len); |
|
|
109 | } |
|
|
110 | |
|
|
111 | packet &packet::operator <<(const data16 &v) |
|
|
112 | { |
|
|
113 | unsigned int len = min (v.len, 0xFFFF); |
|
|
114 | return *this << uint16 (len) << data (v.ptr, len); |
|
|
115 | } |
|
|
116 | |
|
|
117 | packet &packet::operator <<(const char *v) |
|
|
118 | { |
|
|
119 | return *this << data (v, strlen (v ? v : 0)); |
|
|
120 | } |
|
|
121 | |
|
|
122 | void |
|
|
123 | packet::printf (const char *format, ...) |
|
|
124 | { |
|
|
125 | int size = room (); |
|
|
126 | |
|
|
127 | va_list ap; |
|
|
128 | va_start (ap, format); |
|
|
129 | int len = vsnprintf ((char *)cur, size, format, ap); |
|
|
130 | va_end (ap); |
|
|
131 | |
|
|
132 | if (len >= size) |
|
|
133 | return reset (); |
|
|
134 | |
|
|
135 | cur += len; |
|
|
136 | } |
|
|
137 | |
|
|
138 | /****************************************************************************** |
|
|
139 | * |
|
|
140 | * Start of read routines. |
|
|
141 | * |
|
|
142 | ******************************************************************************/ |
|
|
143 | |
|
|
144 | int |
|
|
145 | NewSocket::read_packet () |
|
|
146 | { |
|
|
147 | for (;;) |
|
|
148 | { |
|
|
149 | if (inbuf_len >= 2) |
|
|
150 | { |
352 | } |
151 | unsigned int pkt_len = (inbuf [0] << 8) | inbuf [1]; |
353 | else |
152 | |
|
|
153 | if (inbuf_len >= 2 + pkt_len) |
|
|
154 | return pkt_len + 2; |
|
|
155 | } |
354 | { |
156 | |
355 | rbuf = inbuf + inbuf_len; |
157 | int amount = sizeof (inbuf) - inbuf_len; |
356 | amount = sizeof (inbuf) - inbuf_len; |
158 | |
|
|
159 | if (amount <= 0) |
|
|
160 | { |
357 | } |
161 | LOG (llevError, "packet too large");//TODO |
|
|
162 | return -1; |
|
|
163 | } |
|
|
164 | |
|
|
165 | amount = read (fd, inbuf + inbuf_len, amount); |
|
|
166 | |
358 | |
167 | if (!amount) |
359 | if (!amount) |
168 | { |
360 | { |
169 | status = Ns_Dead; |
361 | // input buffer full |
|
|
362 | LOG (llevError, "input buffer overflow."); |
|
|
363 | destroy (); |
170 | return -1; |
364 | return; |
|
|
365 | } |
|
|
366 | |
|
|
367 | amount = read (fd, rbuf, amount); |
|
|
368 | |
|
|
369 | if (!amount) |
|
|
370 | { |
|
|
371 | destroy (); |
|
|
372 | return; |
171 | } |
373 | } |
172 | else if (amount < 0) |
374 | else if (amount < 0) |
173 | { |
375 | { |
174 | if (errno != EAGAIN && errno != EINTR) |
376 | if (errno != EAGAIN && errno != EINTR) |
175 | { |
377 | { |
176 | LOG (llevError, "read error: %s", strerror (errno)); |
378 | LOG (llevError, "read error: %s\n", strerror (errno)); |
|
|
379 | destroy (); |
177 | return -1; |
380 | return; |
178 | } |
381 | } |
179 | |
382 | |
180 | return 0; |
383 | // should not be here, normally |
|
|
384 | } |
|
|
385 | |
|
|
386 | if (ws_version) |
181 | } |
387 | { |
|
|
388 | ws_inbuf_len += amount; |
182 | |
389 | |
|
|
390 | while (ws_inbuf_len) |
|
|
391 | { |
|
|
392 | if (ws_inbuf_len < 2 + 4) // 6 is minimum length: op, len, mask |
|
|
393 | break; |
|
|
394 | |
|
|
395 | int d = 2; |
|
|
396 | int fin = ws_inbuf [0] & 0x80; |
|
|
397 | int op = ws_inbuf [0] & 0x0f; |
|
|
398 | int len = ws_inbuf [1] & 0x7f; |
|
|
399 | |
|
|
400 | if (len == 126) |
|
|
401 | { |
|
|
402 | len = (ws_inbuf [2] << 8) | ws_inbuf [3]; |
|
|
403 | d += 2; |
|
|
404 | } |
|
|
405 | else if (len == 127) |
|
|
406 | { |
|
|
407 | if (ws_inbuf_len < 2 + 8) |
|
|
408 | return; |
|
|
409 | |
|
|
410 | // we don't do extra long frames, if a browser wants to send >2**32 bytes, |
|
|
411 | // there are bigger issues to fix. |
|
|
412 | len = (ws_inbuf [8] << 8) | ws_inbuf [9]; |
|
|
413 | d += 8; |
|
|
414 | } |
|
|
415 | |
|
|
416 | // we only continue if we have a complete frame |
|
|
417 | if (ws_inbuf_len < d + 4 + len) |
|
|
418 | return; |
|
|
419 | |
|
|
420 | switch (op) |
|
|
421 | { |
|
|
422 | case 0: op = ws_inbuf_type; break; // continuation |
|
|
423 | case 1: ws_inbuf_type = 1; break; // utf-8 |
|
|
424 | case 2: ws_inbuf_type = 2; break; // binary |
|
|
425 | } |
|
|
426 | |
|
|
427 | if (len > sizeof (inbuf) - inbuf_len) |
|
|
428 | { |
|
|
429 | // input buffer full |
|
|
430 | LOG (llevError, "input buffer overflow (ws)."); |
|
|
431 | destroy (); |
|
|
432 | return; |
|
|
433 | } |
|
|
434 | |
|
|
435 | uint8 *buf = inbuf + inbuf_len + 2; |
|
|
436 | |
|
|
437 | for (int i = 0; i < len; ++i) |
|
|
438 | buf [i] = ws_inbuf [d + 4 + i] ^ ws_inbuf [d + (i & 3)]; |
|
|
439 | |
|
|
440 | // remove frame |
|
|
441 | ws_inbuf_len -= d + 4 + len; |
|
|
442 | memmove (ws_inbuf, ws_inbuf + d + 4 + len, ws_inbuf_len); |
|
|
443 | |
|
|
444 | switch (op) |
|
|
445 | { |
|
|
446 | case 1: // utf-8 |
|
|
447 | // utf-8 encoded frames cannot have full length (MAXSOCKBUF) in all cases |
|
|
448 | // but we assume that these extra-long packets will be rare. |
|
|
449 | { |
|
|
450 | uint8 *a = buf; |
|
|
451 | uint8 *b = a; |
|
|
452 | uint8 *c = a + len; |
|
|
453 | |
|
|
454 | for (; a < c; ++a, ++b) |
|
|
455 | { |
|
|
456 | *b = *a; |
|
|
457 | |
|
|
458 | if (*a >= 0x80) |
|
|
459 | *b = (a [0] & 0x1f) << 6 | (a [1] & 0x3f), ++a; |
|
|
460 | } |
|
|
461 | |
|
|
462 | len -= a - b; |
|
|
463 | } |
|
|
464 | /* FALLTHROUGH */ |
|
|
465 | case 2: // binary |
|
|
466 | inbuf_len += len; |
|
|
467 | |
|
|
468 | if (fin) |
|
|
469 | { |
|
|
470 | inbuf [0] = inbuf_len >> 8; |
|
|
471 | inbuf [1] = inbuf_len; |
|
|
472 | |
|
|
473 | inbuf_len += 2; |
|
|
474 | |
|
|
475 | inbuf_handle (); |
|
|
476 | } |
|
|
477 | break; |
|
|
478 | |
|
|
479 | case 9: // ping |
|
|
480 | { |
|
|
481 | // send pong - we assume ping messages are <64k |
|
|
482 | // as we can't handle >10k at the moment anyway. |
|
|
483 | uint8 hdr [] = { 0x8a, 126, len >> 8, len }; |
|
|
484 | send (hdr, sizeof (hdr)); |
|
|
485 | send (inbuf + inbuf_len, len); |
|
|
486 | } |
|
|
487 | break; |
|
|
488 | |
|
|
489 | case 10: // pong |
|
|
490 | break; |
|
|
491 | |
|
|
492 | case 8: // close |
|
|
493 | default: |
|
|
494 | destroy (); |
|
|
495 | return; |
|
|
496 | } |
|
|
497 | } |
|
|
498 | } |
|
|
499 | else |
|
|
500 | { |
183 | inbuf_len += amount; |
501 | inbuf_len += amount; |
184 | |
502 | inbuf_handle (); |
185 | cst_tot.ibytes += amount; |
503 | } |
186 | cst_lst.ibytes += amount; |
|
|
187 | } |
504 | } |
188 | } |
|
|
189 | |
|
|
190 | void |
|
|
191 | NewSocket::skip_packet (int len) |
|
|
192 | { |
|
|
193 | inbuf_len -= len; |
|
|
194 | memmove (inbuf, inbuf + len, inbuf_len); |
|
|
195 | } |
505 | } |
196 | |
506 | |
197 | /******************************************************************************* |
507 | /******************************************************************************* |
198 | * |
508 | * |
199 | * Start of write related routines. |
509 | * Start of write related routines. |
… | |
… | |
204 | * Adds data to a socket buffer for whatever reason. |
514 | * Adds data to a socket buffer for whatever reason. |
205 | * |
515 | * |
206 | * ns is the socket we are adding the data to, buf is the start of the |
516 | * ns is the socket we are adding the data to, buf is the start of the |
207 | * data, and len is the number of bytes to add. |
517 | * data, and len is the number of bytes to add. |
208 | */ |
518 | */ |
209 | |
519 | void |
210 | static void |
520 | client::send (void *buf_, int len) |
211 | add_to_buffer (NewSocket *ns, char *buf, int len) |
|
|
212 | { |
521 | { |
|
|
522 | char *buf = (char *)buf_; |
|
|
523 | |
|
|
524 | if (destroyed () || !buf) |
|
|
525 | return; |
|
|
526 | |
|
|
527 | if (len + outputbuffer.len > SOCKETBUFSIZE) |
|
|
528 | { |
|
|
529 | LOG (llevDebug, "socket on fd %d has overrun internal buffer - marking as dead\n", fd); |
|
|
530 | // shutdown the socket, this is safer than destroying it immediately |
|
|
531 | // as lots of code in the callchain might still access the map etc. |
|
|
532 | shutdown (fd, SHUT_RDWR); |
|
|
533 | return; |
|
|
534 | } |
|
|
535 | |
213 | int avail, end; |
536 | int avail, end; |
214 | |
|
|
215 | if ((len + ns->outputbuffer.len) > SOCKETBUFSIZE) |
|
|
216 | { |
|
|
217 | LOG (llevDebug, "Socket on fd %d has overrun internal buffer - marking as dead\n", ns->fd); |
|
|
218 | ns->status = Ns_Dead; |
|
|
219 | return; |
|
|
220 | } |
|
|
221 | |
537 | |
222 | /* data + end is where we start putting the new data. The last byte |
538 | /* data + end is where we start putting the new data. The last byte |
223 | * currently in use is actually data + end -1 |
539 | * currently in use is actually data + end -1 |
224 | */ |
540 | */ |
225 | |
|
|
226 | end = ns->outputbuffer.start + ns->outputbuffer.len; |
541 | end = outputbuffer.start + outputbuffer.len; |
227 | /* The buffer is already in a wrapped state, so adjust end */ |
542 | /* The buffer is already in a wrapped state, so adjust end */ |
228 | if (end >= SOCKETBUFSIZE) |
543 | if (end >= SOCKETBUFSIZE) |
229 | end -= SOCKETBUFSIZE; |
544 | end -= SOCKETBUFSIZE; |
230 | |
545 | |
231 | avail = SOCKETBUFSIZE - end; |
546 | avail = SOCKETBUFSIZE - end; |
232 | |
547 | |
233 | /* We can all fit it behind the current data without wrapping */ |
548 | /* We can all fit it behind the current data without wrapping */ |
234 | if (avail >= len) |
549 | if (avail >= len) |
235 | memcpy (ns->outputbuffer.data + end, buf, len); |
550 | memcpy (outputbuffer.data + end, buf, len); |
236 | else |
551 | else |
237 | { |
552 | { |
238 | memcpy (ns->outputbuffer.data + end, buf, avail); |
553 | memcpy (outputbuffer.data + end, buf, avail); |
239 | memcpy (ns->outputbuffer.data, buf + avail, len - avail); |
554 | memcpy (outputbuffer.data, buf + avail, len - avail); |
240 | } |
555 | } |
241 | |
556 | |
242 | ns->outputbuffer.len += len; |
557 | outputbuffer.len += len; |
243 | #if 0 |
|
|
244 | LOG (llevDebug, "Added %d to output buffer, total length now %d, start=%d\n", len, ns->outputbuffer.len, ns->outputbuffer.start); |
|
|
245 | #endif |
|
|
246 | } |
|
|
247 | |
|
|
248 | /** |
|
|
249 | * Writes data to socket. |
|
|
250 | * |
|
|
251 | * When the socket is clear to write, and we have backlogged data, this |
|
|
252 | * is called to write it out. |
|
|
253 | */ |
|
|
254 | void |
|
|
255 | write_socket_buffer (NewSocket * ns) |
|
|
256 | { |
|
|
257 | int amt, max; |
|
|
258 | |
|
|
259 | if (ns->outputbuffer.len == 0) |
|
|
260 | { |
|
|
261 | LOG (llevDebug, "write_socket_buffer called when there is no data, fd=%d\n", ns->fd); |
|
|
262 | return; |
|
|
263 | } |
|
|
264 | |
|
|
265 | do |
|
|
266 | { |
|
|
267 | max = SOCKETBUFSIZE - ns->outputbuffer.start; |
|
|
268 | if (ns->outputbuffer.len < max) |
|
|
269 | max = ns->outputbuffer.len; |
|
|
270 | |
|
|
271 | do |
|
|
272 | { |
|
|
273 | amt = write (ns->fd, ns->outputbuffer.data + ns->outputbuffer.start, max); |
|
|
274 | } |
|
|
275 | while ((amt < 0) && (errno == EINTR)); |
|
|
276 | |
|
|
277 | if (amt < 0) |
|
|
278 | { /* We got an error */ |
|
|
279 | |
|
|
280 | if (errno != EWOULDBLOCK) |
|
|
281 | { |
|
|
282 | LOG (llevError, "New socket write failed (wsb) (%d: %s).\n", errno, strerror (errno)); |
|
|
283 | ns->status = Ns_Dead; |
|
|
284 | return; |
|
|
285 | } |
|
|
286 | else |
|
|
287 | { /* EWOULDBLOCK */ |
|
|
288 | /* can't write it, so store it away. */ |
|
|
289 | ns->can_write = 0; |
|
|
290 | return; |
|
|
291 | } |
|
|
292 | } |
|
|
293 | ns->outputbuffer.start += amt; |
|
|
294 | /* wrap back to start of buffer */ |
|
|
295 | if (ns->outputbuffer.start == SOCKETBUFSIZE) |
|
|
296 | ns->outputbuffer.start = 0; |
|
|
297 | ns->outputbuffer.len -= amt; |
|
|
298 | #ifdef CS_LOGSTATS |
|
|
299 | cst_tot.obytes += amt; |
|
|
300 | cst_lst.obytes += amt; |
|
|
301 | #endif |
|
|
302 | } |
|
|
303 | while (ns->outputbuffer.len > 0); |
|
|
304 | } |
|
|
305 | |
|
|
306 | /** |
|
|
307 | * This writes data to the socket. - It is very low level - |
|
|
308 | * all we try and do is write out the data to the socket |
|
|
309 | * provided (ns). buf is the data to write, len is the number |
|
|
310 | * of bytes to write. IT doesn't return anything - rather, it |
|
|
311 | * updates the ns structure if we get an error. |
|
|
312 | */ |
|
|
313 | void |
|
|
314 | NewSocket::send (void *buf_, int len) |
|
|
315 | { |
|
|
316 | char *buf = (char *)buf_; |
|
|
317 | char *pos = buf; |
|
|
318 | int amt = 0; |
|
|
319 | |
|
|
320 | if (status == Ns_Dead || !buf) |
|
|
321 | { |
|
|
322 | LOG (llevDebug, "Write_To_Socket called with dead socket\n"); |
|
|
323 | return; |
|
|
324 | } |
|
|
325 | |
|
|
326 | #ifndef __GNU__ /* This caused problems on Hurd */ |
|
|
327 | if (!can_write) |
|
|
328 | { |
|
|
329 | add_to_buffer (this, buf, len); |
|
|
330 | return; |
|
|
331 | } |
|
|
332 | #endif |
|
|
333 | |
|
|
334 | /* If we manage to write more than we wanted, take it as a bonus */ |
|
|
335 | while (len > 0) |
|
|
336 | { |
|
|
337 | do |
|
|
338 | { |
|
|
339 | amt = write (fd, pos, len); |
|
|
340 | } |
|
|
341 | while ((amt < 0) && (errno == EINTR)); |
|
|
342 | |
|
|
343 | if (amt < 0) |
|
|
344 | { /* We got an error */ |
|
|
345 | if (errno != EWOULDBLOCK) |
|
|
346 | { |
|
|
347 | LOG (llevError, "New socket write failed WTS (%d: %s).\n", /* ---WIN32 */ |
|
|
348 | errno, strerror (errno)); |
|
|
349 | status = Ns_Dead; |
|
|
350 | return; |
|
|
351 | } |
|
|
352 | else |
|
|
353 | { /* EWOULDBLOCK */ |
|
|
354 | /* can't write it, so store it away. */ |
|
|
355 | add_to_buffer (this, pos, len); |
|
|
356 | can_write = 0; |
|
|
357 | return; |
|
|
358 | } |
|
|
359 | } |
|
|
360 | /* amt gets set to 0 above in blocking code, so we do this as |
|
|
361 | * an else if to make sure we don't reprocess it. |
|
|
362 | */ |
|
|
363 | else if (amt == 0) |
|
|
364 | LOG (llevError, "Write_To_Socket: No data written out.\n"); |
|
|
365 | |
|
|
366 | len -= amt; |
|
|
367 | pos += amt; |
|
|
368 | #ifdef CS_LOGSTATS |
|
|
369 | cst_tot.obytes += amt; |
|
|
370 | cst_lst.obytes += amt; |
|
|
371 | #endif |
|
|
372 | } |
|
|
373 | } |
558 | } |
374 | |
559 | |
375 | /** |
560 | /** |
376 | * Takes a string of data, and writes it out to the socket. A very handy |
561 | * Takes a string of data, and writes it out to the socket. A very handy |
377 | * shortcut function. |
562 | * shortcut function. |
378 | */ |
563 | */ |
379 | |
|
|
380 | void |
564 | void |
381 | NewSocket::send_packet (packet &sl) |
565 | client::send_packet (packet &sl) |
382 | { |
566 | { |
383 | Send_With_Handling (this, &sl); |
567 | if (destroyed ()) |
384 | } |
|
|
385 | |
|
|
386 | void |
|
|
387 | NewSocket::send_packet (const char *buf, int len) |
|
|
388 | { |
|
|
389 | packet sl; |
|
|
390 | |
|
|
391 | sl << data (buf, len); |
|
|
392 | send_packet (sl); |
|
|
393 | } |
|
|
394 | |
|
|
395 | void |
|
|
396 | NewSocket::send_packet (const char *buf) |
|
|
397 | { |
|
|
398 | send_packet (buf, strlen (buf)); |
|
|
399 | } |
|
|
400 | |
|
|
401 | /** |
|
|
402 | * Calls Write_To_Socket to send data to the client. |
|
|
403 | * |
|
|
404 | * The only difference in this function is that we take a packet |
|
|
405 | *, and we prepend the length information. |
|
|
406 | */ |
|
|
407 | void |
|
|
408 | Send_With_Handling (NewSocket *ns, packet *msg) |
|
|
409 | { |
|
|
410 | unsigned char sbuf[4]; |
|
|
411 | |
|
|
412 | if (ns->status == Ns_Dead || !msg) |
|
|
413 | return; |
568 | return; |
414 | |
569 | |
415 | if (msg->length () >= MAXSOCKBUF) |
570 | if (sl.length () > MAXSOCKBUF) |
416 | { |
571 | { |
417 | LOG (llevError, "Trying to send a buffer beyond properly size, len =%d\n", msg->length ()); |
572 | LOG (llevError, "Trying to send a buffer beyond properly size, len =%d\n", sl.length ()); |
418 | /* Almost certainly we've overflowed a buffer, so quite now to make |
573 | /* Almost certainly we've overflowed a buffer, so quit now to make |
419 | * it easier to debug. |
574 | * it easier to debug. |
420 | */ |
575 | */ |
421 | abort (); |
576 | abort (); |
422 | } |
577 | } |
423 | |
578 | |
424 | sbuf[0] = ((uint32) (msg->length ()) >> 8); |
579 | if (!sl.length ()) |
425 | sbuf[1] = ((uint32) (msg->length ()) ); |
|
|
426 | |
|
|
427 | if (ns->status != Ns_Old) |
|
|
428 | ns->send (sbuf, 2); |
|
|
429 | |
|
|
430 | ns->send (msg->buf, msg->length ()); |
|
|
431 | } |
|
|
432 | |
|
|
433 | /****************************************************************************** |
|
|
434 | * |
|
|
435 | * statistics logging functions. |
|
|
436 | * |
|
|
437 | ******************************************************************************/ |
|
|
438 | |
|
|
439 | #ifdef CS_LOGSTATS |
|
|
440 | |
|
|
441 | /* cst_tot is for the life of the server, cst_last is for the last series of |
|
|
442 | * stats |
|
|
443 | */ |
|
|
444 | CS_Stats cst_tot, cst_lst; |
|
|
445 | |
|
|
446 | /** |
|
|
447 | * Writes out the gathered stats. We clear cst_lst. |
|
|
448 | */ |
|
|
449 | void |
|
|
450 | write_cs_stats (void) |
|
|
451 | { |
|
|
452 | time_t now = time (NULL); |
|
|
453 | |
|
|
454 | /* If no connections recently, don't both to log anything */ |
|
|
455 | if (cst_lst.ibytes == 0 && cst_lst.obytes == 0) |
|
|
456 | return; |
580 | return; |
457 | |
581 | |
458 | /* CSSTAT is put in so scripts can easily find the line */ |
582 | if (ws_version == 8) |
459 | LOG (llevInfo, "CSSTAT: %.16s tot %d %d %d %d inc %d %d %d %d\n", |
583 | { |
460 | ctime (&now), cst_tot.ibytes, cst_tot.obytes, cst_tot.max_conn, |
584 | static uint8 buf [MAXSOCKBUF * 2 + 4]; |
461 | now - cst_tot.time_start, cst_lst.ibytes, cst_lst.obytes, cst_lst.max_conn, now - cst_lst.time_start); |
|
|
462 | cst_lst.ibytes = 0; |
|
|
463 | cst_lst.obytes = 0; |
|
|
464 | cst_lst.max_conn = socket_info.nconns; |
|
|
465 | cst_lst.time_start = now; |
|
|
466 | } |
|
|
467 | #endif |
|
|
468 | |
585 | |
|
|
586 | uint8 *b = buf + 4; |
|
|
587 | for (uint8 *a = sl.buf_ + sl.hdrlen; a < sl.cur; ++a) |
|
|
588 | { |
|
|
589 | if (*a < 0x80) |
|
|
590 | *b++ = *a; |
|
|
591 | else |
|
|
592 | { |
|
|
593 | *b++ = 0xc0 | ((*a >> 6) & 0x1f); |
|
|
594 | *b++ = 0x80 | ( *a & 0x3f); |
|
|
595 | } |
|
|
596 | } |
|
|
597 | |
|
|
598 | assert (b - buf < sizeof (buf)); |
|
|
599 | |
|
|
600 | int len = b - (buf + 4); |
|
|
601 | |
|
|
602 | if (len < 126) |
|
|
603 | { |
|
|
604 | buf [2] = 0x81; |
|
|
605 | buf [3] = len; |
|
|
606 | |
|
|
607 | send (buf + 2, len + 2); |
|
|
608 | } |
|
|
609 | else |
|
|
610 | { |
|
|
611 | buf [0] = 0x81; |
|
|
612 | buf [1] = 126; |
|
|
613 | buf [2] = len >> 8; |
|
|
614 | buf [3] = len; |
|
|
615 | |
|
|
616 | send (buf, len + 4); |
|
|
617 | } |
|
|
618 | } |
|
|
619 | else if (ws_version == 13) |
|
|
620 | { |
|
|
621 | int len = sl.length (); |
|
|
622 | |
|
|
623 | if (len < 126) |
|
|
624 | { |
|
|
625 | uint8 hdr [] = { 0x82, len }; |
|
|
626 | send (hdr, sizeof (hdr)); |
|
|
627 | } |
|
|
628 | else |
|
|
629 | { |
|
|
630 | uint8 hdr [] = { 0x82, 126, len >> 8, len }; |
|
|
631 | send (hdr, sizeof (hdr)); |
|
|
632 | } |
|
|
633 | |
|
|
634 | send (sl.buf_ + sl.hdrlen, len); |
|
|
635 | } |
|
|
636 | else |
|
|
637 | { |
|
|
638 | assert (sl.hdrlen == 2); |
|
|
639 | |
|
|
640 | sl.buf_ [0] = sl.length () >> 8; |
|
|
641 | sl.buf_ [1] = sl.length () ; |
|
|
642 | |
|
|
643 | send (sl.buf_, sl.length () + sl.hdrlen); |
|
|
644 | } |
|
|
645 | } |
|
|
646 | |
|
|
647 | void |
|
|
648 | client::send_packet (const char *buf, int len) |
|
|
649 | { |
|
|
650 | packet sl; |
|
|
651 | |
|
|
652 | sl << data_n (buf, len); |
|
|
653 | send_packet (sl); |
|
|
654 | } |
|
|
655 | |
|
|
656 | void |
|
|
657 | client::send_packet (const char *buf) |
|
|
658 | { |
|
|
659 | send_packet (buf, strlen (buf)); |
|
|
660 | } |
|
|
661 | |
|
|
662 | void |
|
|
663 | client::send_packet_printf (const char *format, ...) |
|
|
664 | { |
|
|
665 | packet sl; |
|
|
666 | |
|
|
667 | va_list ap; |
|
|
668 | va_start (ap, format); |
|
|
669 | sl.vprintf (format, ap); |
|
|
670 | va_end (ap); |
|
|
671 | |
|
|
672 | send_packet (sl); |
|
|
673 | } |
|
|
674 | |
|
|
675 | void |
|
|
676 | client::send_msg (int color, const char *type, const char *msg) |
|
|
677 | { |
|
|
678 | if (!msg || !type) // it can happen (for example, missing attack messages cause this) |
|
|
679 | { |
|
|
680 | LOG (logBacktrace | llevError, "send_msg(%d,%p,%p) called with NULL msg or type.\n", color, type, msg); |
|
|
681 | return; |
|
|
682 | } |
|
|
683 | |
|
|
684 | int len = strlen (msg); |
|
|
685 | |
|
|
686 | if (!(color & NDI_VERBATIM) |
|
|
687 | && (msg_is_special (msg) |
|
|
688 | || (type [0] == 'c' && type [1] == '/') || len > (MAXSOCKBUF - 128))) |
|
|
689 | cfperl_send_msg (this, color, type, msg); |
|
|
690 | else |
|
|
691 | send_packet_printf ("msg %d %s %s", color & NDI_CLIENT_MASK, type, msg); |
|
|
692 | } |
|
|
693 | |
|
|
694 | /*********************************************************************** |
|
|
695 | * |
|
|
696 | * packet functions/utilities |
|
|
697 | * |
|
|
698 | **********************************************************************/ |
|
|
699 | |
|
|
700 | packet::packet (const char *name) |
|
|
701 | { |
|
|
702 | reset (); |
|
|
703 | |
|
|
704 | int len = strlen (name); |
|
|
705 | memcpy (cur, name, len); cur += len; |
|
|
706 | *cur++ = ' '; |
|
|
707 | } |
|
|
708 | |
|
|
709 | packet &packet::operator <<(const ber32 v) |
|
|
710 | { |
|
|
711 | enum { maxlen = 32 / 7 + 1 }; |
|
|
712 | uint8 buf[maxlen]; |
|
|
713 | uint8 *p = buf + maxlen; |
|
|
714 | uint32 val = v.val; |
|
|
715 | |
|
|
716 | *--p = val & 0x7F; |
|
|
717 | |
|
|
718 | while (val > 0x7F) |
|
|
719 | { |
|
|
720 | val >>= 7; |
|
|
721 | *--p = (val & 0x7F) | 0x80; |
|
|
722 | } |
|
|
723 | |
|
|
724 | return *this << data_n (p, buf + maxlen - p); |
|
|
725 | } |
|
|
726 | |
|
|
727 | packet &packet::operator <<(const data_n &v) |
|
|
728 | { |
|
|
729 | if (room () < v.len) |
|
|
730 | reset (); |
|
|
731 | else |
|
|
732 | { |
|
|
733 | if (v.len) |
|
|
734 | { |
|
|
735 | memcpy (cur, v.ptr, v.len); |
|
|
736 | cur += v.len; |
|
|
737 | } |
|
|
738 | } |
|
|
739 | |
|
|
740 | return *this; |
|
|
741 | } |
|
|
742 | |
|
|
743 | packet &packet::operator <<(const data8 &v) |
|
|
744 | { |
|
|
745 | unsigned int len = min (v.len, 0x00FF); |
|
|
746 | return *this << uint8 (len) << data_n (v.ptr, len); |
|
|
747 | } |
|
|
748 | |
|
|
749 | packet &packet::operator <<(const data16 &v) |
|
|
750 | { |
|
|
751 | unsigned int len = min (v.len, 0xFFFF); |
|
|
752 | return *this << uint16 (len) << data_n (v.ptr, len); |
|
|
753 | } |
|
|
754 | |
|
|
755 | packet &packet::operator <<(const char *v) |
|
|
756 | { |
|
|
757 | return *this << data_n (v, v ? strlen (v) : 0); |
|
|
758 | } |
|
|
759 | |
|
|
760 | void |
|
|
761 | packet::vprintf (const char *format, va_list ap) |
|
|
762 | { |
|
|
763 | int size = room (); |
|
|
764 | |
|
|
765 | int len = vsnprintf ((char *)cur, size, format, ap); |
|
|
766 | |
|
|
767 | if (len >= size) |
|
|
768 | return reset (); |
|
|
769 | |
|
|
770 | cur += len; |
|
|
771 | } |
|
|
772 | |