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