1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
|
|
4 | * Copyright (©) 2018 Marc Alexander Lehmann / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * |
6 | * |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
7 | * 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 | * 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 | * Free Software Foundation, either version 3 of the License, or (at your |
9 | * option) any later version. |
10 | * option) any later version. |
… | |
… | |
17 | * and the GNU General Public License along with this program. If not, see |
18 | * and the GNU General Public License along with this program. If not, see |
18 | * <http://www.gnu.org/licenses/>. |
19 | * <http://www.gnu.org/licenses/>. |
19 | * |
20 | * |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | */ |
22 | */ |
22 | |
|
|
23 | using namespace std; |
|
|
24 | |
23 | |
25 | #include <global.h> |
24 | #include <global.h> |
26 | #include <sproto.h> |
25 | #include <sproto.h> |
27 | #include <cstdarg> |
26 | #include <cstdarg> |
28 | |
27 | |
… | |
… | |
31 | # include <sys/socket.h> |
30 | # include <sys/socket.h> |
32 | # include <netinet/in.h> |
31 | # include <netinet/in.h> |
33 | # include <netinet/tcp.h> |
32 | # include <netinet/tcp.h> |
34 | #endif |
33 | #endif |
35 | |
34 | |
|
|
35 | using namespace std; |
|
|
36 | |
36 | // force a packet when idle for more than this many seconds, |
37 | // force a packet when idle for more than this many seconds, |
37 | // forcing an ack regularly. |
38 | // forcing an ack regularly. |
38 | #define IDLE_PING 2. |
39 | #define IDLE_PING 2. |
39 | |
40 | |
40 | void |
41 | void |
… | |
… | |
48 | * |
49 | * |
49 | * When the socket is clear to write, and we have backlogged data, this |
50 | * When the socket is clear to write, and we have backlogged data, this |
50 | * is called to write it out. |
51 | * is called to write it out. |
51 | */ |
52 | */ |
52 | |
53 | |
53 | // write a nop to the socket at least every IDLE_NOP seconds. |
54 | // write a nop to the socket at least every IDLE_PING seconds. |
54 | if (!outputbuffer.len) |
55 | if (!outputbuffer.len) |
55 | { |
56 | { |
56 | if (last_send + IDLE_PING <= NOW && pl && pl->active) |
57 | if (last_send + IDLE_PING <= NOW && pl && pl->active) |
57 | { |
58 | { |
58 | // this is a bit ugly, but map1a seems to be the only |
59 | // this is a bit ugly, but map1a seems to be the only |
… | |
… | |
132 | if (inbuf_len >= 2 + pkt_len) |
133 | if (inbuf_len >= 2 + pkt_len) |
133 | return 2 + pkt_len; |
134 | return 2 + pkt_len; |
134 | |
135 | |
135 | if (inbuf_len == sizeof (inbuf)) |
136 | if (inbuf_len == sizeof (inbuf)) |
136 | { |
137 | { |
137 | send_packet_printf ("drawinfo %d input buffer overflow - closing connection.", NDI_RED | NDI_REPLY); |
138 | send_packet_printf ("msg %d log input buffer overflow - closing connection.", NDI_RED | NDI_REPLY); |
138 | destroy (); |
139 | destroy (); |
139 | return -1; |
140 | return -1; |
140 | } |
141 | } |
141 | } |
142 | } |
142 | |
143 | |
… | |
… | |
150 | memmove (inbuf, inbuf + len, inbuf_len); |
151 | memmove (inbuf, inbuf + len, inbuf_len); |
151 | } |
152 | } |
152 | |
153 | |
153 | /***************************************************************************** |
154 | /***************************************************************************** |
154 | * Start of command dispatch area. |
155 | * Start of command dispatch area. |
155 | * The commands here are protocol commands. |
156 | * The commands here are protocol commands. |
156 | ****************************************************************************/ |
157 | ****************************************************************************/ |
157 | |
158 | |
158 | // SocketCommand, PlayingCommand, should not exist with those ugly casts |
159 | // SocketCommand, PlayingCommand, should not exist with those ugly casts |
159 | #define SC(cb) (void *)static_cast<void (*)(char *, int, client *)>(cb), |
160 | #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 | #define PC(cb) (void *)static_cast<void (*)(char *, int, player *)>(cb), PF_PLAYER | |
… | |
… | |
167 | |
168 | |
168 | /** |
169 | /** |
169 | * Dispatch table for the server. |
170 | * Dispatch table for the server. |
170 | */ |
171 | */ |
171 | static struct packet_type packets[] = { |
172 | static struct packet_type packets[] = { |
172 | {"ncom", PC(NewPlayerCmd) PF_PLAYING | PF_COMMAND6 }, |
|
|
173 | {"command", PC(PlayerCmd) PF_PLAYING | PF_COMMAND0 }, |
173 | {"command", PC(PlayerCmd) PF_PLAYING | PF_COMMAND }, |
174 | |
174 | |
175 | {"examine", PC(ExamineCmd) PF_PLAYING }, |
175 | {"examine", PC(ExamineCmd) PF_PLAYING }, |
176 | {"ex", PC(ExCmd) PF_PLAYING }, |
176 | {"ex", PC(ExCmd) PF_PLAYING }, |
177 | {"apply", PC(ApplyCmd) PF_PLAYING }, |
177 | {"apply", PC(ApplyCmd) PF_PLAYING }, |
178 | {"lookat", PC(LookAt) PF_PLAYING }, |
178 | {"lookat", PC(LookAt) PF_PLAYING }, |
… | |
… | |
208 | // but kept seperate to emphasise the hack aspect, i.e. |
208 | // but kept seperate to emphasise the hack aspect, i.e. |
209 | // do it better, then remove. |
209 | // do it better, then remove. |
210 | static bool |
210 | static bool |
211 | always_immediate (const client *ns, const packet_type *pkt, const char *data, int len) |
211 | always_immediate (const client *ns, const packet_type *pkt, const char *data, int len) |
212 | { |
212 | { |
213 | if (!(pkt->flags & (PF_COMMAND0 | PF_COMMAND6))) |
213 | if (!(pkt->flags & PF_COMMAND)) |
214 | return false; |
214 | return false; |
215 | |
215 | |
216 | if (!ns->pl || !ns->pl->ob || !ns->pl->ob->map) |
216 | if (!ns->pl || !ns->pl->ob || !ns->pl->ob->map) |
217 | return false; |
217 | return false; |
218 | |
|
|
219 | if (pkt->flags & PF_COMMAND6) |
|
|
220 | { |
|
|
221 | data += 6; |
|
|
222 | len -= 6; |
|
|
223 | } |
|
|
224 | |
218 | |
225 | if (len > 4 && data [ 3] == ' ' && !strncmp (data, "say " , 4)) return true; |
219 | if (len > 4 && data [ 3] == ' ' && !strncmp (data, "say " , 4)) return true; |
226 | if (len > 5 && data [ 4] == ' ' && !strncmp (data, "chat " , 5)) return true; |
220 | if (len > 5 && data [ 4] == ' ' && !strncmp (data, "chat " , 5)) return true; |
227 | if (len > 6 && data [ 5] == ' ' && !strncmp (data, "shout " , 6)) return true; |
221 | if (len > 6 && data [ 5] == ' ' && !strncmp (data, "shout " , 6)) return true; |
228 | if (len > 8 && data [ 7] == ' ' && !strncmp (data, "suicide " , 8)) return true; |
222 | if (len > 8 && data [ 7] == ' ' && !strncmp (data, "suicide " , 8)) return true; |
… | |
… | |
246 | } |
240 | } |
247 | else |
241 | else |
248 | ((void (*)(char *, int, client *))pkt->cb)((char *)data, datalen, this); |
242 | ((void (*)(char *, int, client *))pkt->cb)((char *)data, datalen, this); |
249 | } |
243 | } |
250 | else |
244 | else |
251 | send_packet_printf ("drawinfo %d ERROR: you cannot execute '%s' now.", NDI_RED | NDI_REPLY, pkt->name); |
245 | send_packet_printf ("msg %d log ERROR: you cannot execute '%s' now.", NDI_RED | NDI_REPLY, pkt->name); |
252 | } |
246 | } |
253 | |
247 | |
254 | bool |
248 | bool |
255 | client::handle_packet () |
249 | client::handle_packet () |
256 | { |
250 | { |
… | |
… | |
286 | { |
280 | { |
287 | data = (char *)inbuf + 2; // better read garbage than segfault |
281 | data = (char *)inbuf + 2; // better read garbage than segfault |
288 | datalen = 0; |
282 | datalen = 0; |
289 | } |
283 | } |
290 | |
284 | |
291 | for (packet_type *pkt = packets; pkt < packets + array_length (packets); ++pkt) |
285 | for (packet_type *pkt = packets; pkt < packets + ecb_array_length (packets); ++pkt) |
292 | if (!strcmp ((char *)inbuf + 2, pkt->name)) |
286 | if (!strcmp ((char *)inbuf + 2, pkt->name)) |
293 | { |
287 | { |
294 | if (pkt->flags & PF_PLAYER && !always_immediate (this, pkt, data, datalen)) |
288 | if (pkt->flags & PF_PLAYER && !always_immediate (this, pkt, data, datalen)) |
295 | queue_command (pkt, data, datalen); |
289 | queue_command (pkt, data, datalen); |
296 | else |
290 | else |
… | |
… | |
298 | |
292 | |
299 | goto next_packet; |
293 | goto next_packet; |
300 | } |
294 | } |
301 | |
295 | |
302 | // If we get here, we didn't find a valid command. |
296 | // If we get here, we didn't find a valid command. |
303 | send_packet_printf ("drawinfo %d ERROR: command '%s' not supported.", NDI_RED | NDI_REPLY, (char *)inbuf + 2); |
297 | send_packet_printf ("msg %d log ERROR: command '%s' not supported.", NDI_RED | NDI_REPLY, (char *)inbuf + 2); |
304 | |
298 | |
305 | next_packet: |
299 | next_packet: |
306 | inbuf [pkt_len] = save_byte; // rather ugly |
300 | inbuf [pkt_len] = save_byte; // rather ugly |
307 | skip_packet (pkt_len); |
301 | skip_packet (pkt_len); |
308 | |
302 | |
… | |
… | |
343 | socket_ev.poll (socket_ev.poll () & ~EV_WRITE); |
337 | socket_ev.poll (socket_ev.poll () & ~EV_WRITE); |
344 | } |
338 | } |
345 | |
339 | |
346 | if (revents & EV_READ) |
340 | if (revents & EV_READ) |
347 | { |
341 | { |
348 | //TODO: rate-limit tcp connection in better ways, important |
342 | int amount; |
|
|
343 | uint8 *rbuf; |
349 | |
344 | |
|
|
345 | if (ws_version) |
|
|
346 | { |
|
|
347 | if (ws_inbuf_len + 2048 > ws_inbuf_alloc) |
|
|
348 | ws_inbuf = (uint8 *)realloc (ws_inbuf, ws_inbuf_alloc += 4096); |
|
|
349 | |
|
|
350 | rbuf = ws_inbuf + ws_inbuf_len; |
|
|
351 | amount = ws_inbuf_alloc - ws_inbuf_len; |
|
|
352 | } |
|
|
353 | else |
|
|
354 | { |
|
|
355 | rbuf = inbuf + inbuf_len; |
350 | int amount = sizeof (inbuf) - inbuf_len; |
356 | amount = sizeof (inbuf) - inbuf_len; |
|
|
357 | } |
351 | |
358 | |
352 | if (!amount) |
359 | if (!amount) |
353 | { |
360 | { |
354 | // input buffer full |
361 | // input buffer full |
355 | LOG (llevError, "input buffer overflow."); |
362 | LOG (llevError, "input buffer overflow."); |
356 | destroy (); |
363 | destroy (); |
357 | return; |
364 | return; |
358 | } |
365 | } |
359 | |
366 | |
|
|
367 | amount = read (fd, rbuf, amount); |
|
|
368 | |
|
|
369 | if (!amount) |
|
|
370 | { |
|
|
371 | destroy (); |
|
|
372 | return; |
|
|
373 | } |
|
|
374 | else if (amount < 0) |
|
|
375 | { |
|
|
376 | if (errno != EAGAIN && errno != EINTR) |
|
|
377 | { |
|
|
378 | LOG (llevError, "read error: %s\n", strerror (errno)); |
|
|
379 | destroy (); |
|
|
380 | return; |
|
|
381 | } |
|
|
382 | |
|
|
383 | // should not be here, normally |
|
|
384 | } |
|
|
385 | |
360 | if (ws_version) |
386 | if (ws_version) |
361 | { |
387 | { |
362 | if (ws_inbuf_len + 2048 > ws_inbuf_alloc) |
388 | ws_inbuf_len += amount; |
363 | ws_inbuf = (uint8 *)realloc (ws_inbuf, ws_inbuf_alloc += 4096); |
|
|
364 | |
389 | |
365 | int len = read (fd, ws_inbuf + ws_inbuf_len, ws_inbuf_alloc - ws_inbuf_len); |
390 | while (ws_inbuf_len) |
366 | |
|
|
367 | if (len > 0) |
|
|
368 | { |
391 | { |
369 | ws_inbuf_len += len; |
|
|
370 | |
|
|
371 | if (ws_inbuf_len < 2 + 4) // 6 is minimum length: op, len, mask |
392 | if (ws_inbuf_len < 2 + 4) // 6 is minimum length: op, len, mask |
372 | return; |
393 | break; |
373 | |
394 | |
374 | int d = 2; |
395 | int d = 2; |
|
|
396 | int fin = ws_inbuf [0] & 0x80; |
375 | int o = ws_inbuf [0] & 15; |
397 | int op = ws_inbuf [0] & 0x0f; |
376 | int l = ws_inbuf [1] & 127; |
398 | int len = ws_inbuf [1] & 0x7f; |
377 | |
399 | |
378 | if (l == 126) |
400 | if (len == 126) |
379 | { |
401 | { |
380 | l = (ws_inbuf [2] << 8) | ws_inbuf [3]; |
402 | len = (ws_inbuf [2] << 8) | ws_inbuf [3]; |
381 | d += 2; |
403 | d += 2; |
382 | } |
404 | } |
383 | else if (l == 127) |
405 | else if (len == 127) |
384 | { |
406 | { |
385 | if (ws_inbuf_len < 2 + 8) |
407 | if (ws_inbuf_len < 2 + 8) |
386 | return; |
408 | return; |
387 | |
409 | |
388 | // we don't do extra long frames, if a browser wants to send >2**32 bytes, |
410 | // we don't do extra long frames, if a browser wants to send >2**32 bytes, |
389 | // there are bigger issues to fix. |
411 | // there are bigger issues to fix. |
390 | l = (ws_inbuf [6] << 24) |
412 | len = (ws_inbuf [8] << 8) | ws_inbuf [9]; |
391 | | (ws_inbuf [7] << 16) |
|
|
392 | | (ws_inbuf [8] << 8) |
|
|
393 | | ws_inbuf [9]; |
|
|
394 | d += 8; |
413 | d += 8; |
395 | } |
414 | } |
396 | |
415 | |
397 | // we only continue if we have a complete frame |
416 | // we only continue if we have a complete frame |
398 | if (ws_inbuf_len < d + 4 + l) |
417 | if (ws_inbuf_len < d + 4 + len) |
399 | return; |
418 | return; |
400 | |
419 | |
401 | switch (o) |
420 | switch (op) |
402 | { |
421 | { |
403 | case 0: o = ws_inbuf_type; break; // continuation |
422 | case 0: op = ws_inbuf_type; break; // continuation |
404 | case 1: ws_inbuf_type = 1; break; // utf-8 |
423 | case 1: ws_inbuf_type = 1; break; // utf-8 |
405 | case 2: ws_inbuf_type = 2; break; // binary |
424 | case 2: ws_inbuf_type = 2; break; // binary |
406 | } |
425 | } |
407 | |
426 | |
408 | if (l > amount) |
427 | if (len > sizeof (inbuf) - inbuf_len) |
409 | { |
428 | { |
410 | // input buffer full |
429 | // input buffer full |
411 | LOG (llevError, "input buffer overflow (ws)."); |
430 | LOG (llevError, "input buffer overflow (ws)."); |
412 | destroy (); |
431 | destroy (); |
413 | return; |
432 | return; |
414 | } |
433 | } |
415 | |
434 | |
|
|
435 | uint8 *buf = inbuf + inbuf_len + 2; |
|
|
436 | |
416 | for (int i = 0; i < l; ++i) |
437 | for (int i = 0; i < len; ++i) |
417 | inbuf [inbuf_len + i] = ws_inbuf [d + 4 + i] ^ ws_inbuf [d + (i & 3)]; |
438 | buf [i] = ws_inbuf [d + 4 + i] ^ ws_inbuf [d + (i & 3)]; |
418 | |
439 | |
419 | // remove frame |
440 | // remove frame |
420 | ws_inbuf_len -= d + 4 + l; |
441 | ws_inbuf_len -= d + 4 + len; |
421 | memmove (ws_inbuf, ws_inbuf + d + 4 + l, ws_inbuf_len); |
442 | memmove (ws_inbuf, ws_inbuf + d + 4 + len, ws_inbuf_len); |
422 | |
443 | |
423 | switch (o) |
444 | switch (op) |
424 | { |
445 | { |
425 | case 1: // utf-8 |
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. |
426 | { |
449 | { |
427 | uint8 *a = inbuf + inbuf_len; |
450 | uint8 *a = buf; |
428 | uint8 *b = a; |
451 | uint8 *b = a; |
429 | uint8 *c = a + l; |
452 | uint8 *c = a + len; |
430 | |
453 | |
431 | for (; a < c; ++a, ++b) |
454 | for (; a < c; ++a, ++b) |
432 | { |
455 | { |
433 | *b = *a; |
456 | *b = *a; |
434 | |
457 | |
435 | if (*a >= 0x80) |
458 | if (*a >= 0x80) |
436 | *b = (a [0] & 0x1f) << 6 | (a [1] & 0x3f), ++a; |
459 | *b = (a [0] & 0x1f) << 6 | (a [1] & 0x3f), ++a; |
437 | } |
460 | } |
438 | |
461 | |
439 | l -= a - b; |
462 | len -= a - b; |
440 | } |
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 | } |
441 | break; |
477 | break; |
442 | case 2: // binary |
|
|
443 | break; |
|
|
444 | |
478 | |
445 | case 9: // ping |
479 | case 9: // ping |
446 | { |
480 | { |
447 | // send pong - we assume ping messages are <64k |
481 | // send pong - we assume ping messages are <64k |
448 | // as we can't handle >10k at the moment anyway. |
482 | // as we can't handle >10k at the moment anyway. |
449 | uint8 hdr [] = { 0x8a, 126, l >> 8, l }; |
483 | uint8 hdr [] = { 0x8a, 126, len >> 8, len }; |
450 | send (hdr, sizeof (hdr)); |
484 | send (hdr, sizeof (hdr)); |
451 | send (inbuf + inbuf_len, l); |
485 | send (inbuf + inbuf_len, len); |
452 | } |
486 | } |
453 | return; |
487 | break; |
454 | |
488 | |
455 | case 10: // pong |
489 | case 10: // pong |
456 | return; |
490 | break; |
457 | |
491 | |
458 | case 8: // close |
492 | case 8: // close |
459 | default: |
493 | default: |
460 | destroy (); |
494 | destroy (); |
461 | return; |
495 | return; |
462 | } |
496 | } |
463 | |
|
|
464 | amount = l; |
|
|
465 | } |
497 | } |
466 | else |
|
|
467 | amount = -1; |
|
|
468 | } |
|
|
469 | else |
|
|
470 | amount = read (fd, inbuf + inbuf_len, amount); |
|
|
471 | |
|
|
472 | if (!amount) |
|
|
473 | { |
|
|
474 | destroy (); |
|
|
475 | return; |
|
|
476 | } |
|
|
477 | else if (amount < 0) |
|
|
478 | { |
|
|
479 | if (errno != EAGAIN && errno != EINTR) |
|
|
480 | { |
|
|
481 | LOG (llevError, "read error: %s\n", strerror (errno)); |
|
|
482 | destroy (); |
|
|
483 | return; |
|
|
484 | } |
|
|
485 | |
|
|
486 | // should not be here, normally |
|
|
487 | } |
498 | } |
488 | else |
499 | else |
489 | { |
500 | { |
490 | inbuf_len += amount; |
501 | inbuf_len += amount; |
491 | inbuf_handle (); |
502 | inbuf_handle (); |
… | |
… | |
584 | } |
595 | } |
585 | } |
596 | } |
586 | |
597 | |
587 | assert (b - buf < sizeof (buf)); |
598 | assert (b - buf < sizeof (buf)); |
588 | |
599 | |
589 | int l = b - (buf + 4); |
600 | int len = b - (buf + 4); |
590 | |
601 | |
591 | if (l < 126) |
602 | if (len < 126) |
592 | { |
603 | { |
593 | buf [2] = 0x81; |
604 | buf [2] = 0x81; |
594 | buf [3] = l; |
605 | buf [3] = len; |
595 | |
606 | |
596 | send (buf + 2, l + 2); |
607 | send (buf + 2, len + 2); |
597 | } |
608 | } |
598 | else |
609 | else |
599 | { |
610 | { |
600 | buf [0] = 0x81; |
611 | buf [0] = 0x81; |
601 | buf [1] = 126; |
612 | buf [1] = 126; |
602 | buf [2] = l >> 8; |
613 | buf [2] = len >> 8; |
603 | buf [3] = l; |
614 | buf [3] = len; |
604 | |
615 | |
605 | send (buf, l + 4); |
616 | send (buf, len + 4); |
606 | } |
617 | } |
607 | } |
618 | } |
608 | else if (ws_version == 13) |
619 | else if (ws_version == 13) |
609 | { |
620 | { |
610 | int l = sl.length (); |
621 | int len = sl.length (); |
611 | |
622 | |
612 | if (l < 126) |
623 | if (len < 126) |
613 | { |
624 | { |
614 | uint8 hdr [] = { 0x82, 126, l >> 8, l }; |
625 | uint8 hdr [] = { 0x82, len }; |
615 | send (hdr, sizeof (hdr)); |
626 | send (hdr, sizeof (hdr)); |
616 | } |
627 | } |
617 | else |
628 | else |
618 | { |
629 | { |
619 | uint8 hdr [] = { 0x82, l }; |
630 | uint8 hdr [] = { 0x82, 126, len >> 8, len }; |
620 | send (hdr, sizeof (hdr)); |
631 | send (hdr, sizeof (hdr)); |
621 | } |
632 | } |
622 | |
633 | |
623 | send (sl.buf_ + sl.hdrlen, l); |
634 | send (sl.buf_ + sl.hdrlen, len); |
624 | } |
635 | } |
625 | else |
636 | else |
626 | { |
637 | { |
627 | assert (sl.hdrlen == 2); |
638 | assert (sl.hdrlen == 2); |
628 | |
639 | |
… | |
… | |
636 | void |
647 | void |
637 | client::send_packet (const char *buf, int len) |
648 | client::send_packet (const char *buf, int len) |
638 | { |
649 | { |
639 | packet sl; |
650 | packet sl; |
640 | |
651 | |
641 | sl << data (buf, len); |
652 | sl << data_n (buf, len); |
642 | send_packet (sl); |
653 | send_packet (sl); |
643 | } |
654 | } |
644 | |
655 | |
645 | void |
656 | void |
646 | client::send_packet (const char *buf) |
657 | client::send_packet (const char *buf) |
… | |
… | |
678 | cfperl_send_msg (this, color, type, msg); |
689 | cfperl_send_msg (this, color, type, msg); |
679 | else |
690 | else |
680 | send_packet_printf ("msg %d %s %s", color & NDI_CLIENT_MASK, type, msg); |
691 | send_packet_printf ("msg %d %s %s", color & NDI_CLIENT_MASK, type, msg); |
681 | } |
692 | } |
682 | |
693 | |
683 | void |
|
|
684 | client::send_drawinfo (const char *msg, int flags) |
|
|
685 | { |
|
|
686 | send_msg (flags, "log", msg); |
|
|
687 | } |
|
|
688 | |
|
|
689 | /*********************************************************************** |
694 | /*********************************************************************** |
690 | * |
695 | * |
691 | * packet functions/utilities |
696 | * packet functions/utilities |
692 | * |
697 | * |
693 | **********************************************************************/ |
698 | **********************************************************************/ |
… | |
… | |
714 | { |
719 | { |
715 | val >>= 7; |
720 | val >>= 7; |
716 | *--p = (val & 0x7F) | 0x80; |
721 | *--p = (val & 0x7F) | 0x80; |
717 | } |
722 | } |
718 | |
723 | |
719 | return *this << data (p, buf + maxlen - p); |
724 | return *this << data_n (p, buf + maxlen - p); |
720 | } |
725 | } |
721 | |
726 | |
722 | packet &packet::operator <<(const data &v) |
727 | packet &packet::operator <<(const data_n &v) |
723 | { |
728 | { |
724 | if (room () < v.len) |
729 | if (room () < v.len) |
725 | reset (); |
730 | reset (); |
726 | else |
731 | else |
727 | { |
732 | { |
… | |
… | |
736 | } |
741 | } |
737 | |
742 | |
738 | packet &packet::operator <<(const data8 &v) |
743 | packet &packet::operator <<(const data8 &v) |
739 | { |
744 | { |
740 | unsigned int len = min (v.len, 0x00FF); |
745 | unsigned int len = min (v.len, 0x00FF); |
741 | return *this << uint8 (len) << data (v.ptr, len); |
746 | return *this << uint8 (len) << data_n (v.ptr, len); |
742 | } |
747 | } |
743 | |
748 | |
744 | packet &packet::operator <<(const data16 &v) |
749 | packet &packet::operator <<(const data16 &v) |
745 | { |
750 | { |
746 | unsigned int len = min (v.len, 0xFFFF); |
751 | unsigned int len = min (v.len, 0xFFFF); |
747 | return *this << uint16 (len) << data (v.ptr, len); |
752 | return *this << uint16 (len) << data_n (v.ptr, len); |
748 | } |
753 | } |
749 | |
754 | |
750 | packet &packet::operator <<(const char *v) |
755 | packet &packet::operator <<(const char *v) |
751 | { |
756 | { |
752 | return *this << data (v, strlen (v ? v : 0)); |
757 | return *this << data_n (v, v ? strlen (v) : 0); |
753 | } |
758 | } |
754 | |
759 | |
755 | void |
760 | void |
756 | packet::vprintf (const char *format, va_list ap) |
761 | packet::vprintf (const char *format, va_list ap) |
757 | { |
762 | { |