| 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 (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 | * |
5 | * |
| 6 | * Deliantra is free software: you can redistribute it and/or modify it under |
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 |
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 |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
| 9 | * option) any later version. |
9 | * option) any later version. |
| … | |
… | |
| 53 | // write a nop to the socket at least every IDLE_NOP seconds. |
53 | // write a nop to the socket at least every IDLE_NOP seconds. |
| 54 | if (!outputbuffer.len) |
54 | if (!outputbuffer.len) |
| 55 | { |
55 | { |
| 56 | if (last_send + IDLE_PING <= NOW && pl && pl->active) |
56 | if (last_send + IDLE_PING <= NOW && pl && pl->active) |
| 57 | { |
57 | { |
| 58 | // this is a bit ugly, but map1/map1a seem to be the only |
58 | // this is a bit ugly, but map1a seems to be the only |
| 59 | // nop'able commands and they are quite small. |
59 | // nop'able command and it is quite small. |
| 60 | packet sl (mapmode == Map1Cmd ? "map1" : "map1a"); |
60 | packet sl ("map1a"); |
| 61 | send_packet (sl); |
61 | send_packet (sl); |
| 62 | } |
62 | } |
| 63 | else |
63 | else |
| 64 | return; |
64 | return; |
| 65 | } |
65 | } |
| … | |
… | |
| 286 | { |
286 | { |
| 287 | data = (char *)inbuf + 2; // better read garbage than segfault |
287 | data = (char *)inbuf + 2; // better read garbage than segfault |
| 288 | datalen = 0; |
288 | datalen = 0; |
| 289 | } |
289 | } |
| 290 | |
290 | |
| 291 | for (packet_type *pkt = packets; pkt < packets + (sizeof (packets) / sizeof (packets[0])); ++pkt) |
291 | for (packet_type *pkt = packets; pkt < packets + array_length (packets); ++pkt) |
| 292 | if (!strcmp ((char *)inbuf + 2, pkt->name)) |
292 | if (!strcmp ((char *)inbuf + 2, pkt->name)) |
| 293 | { |
293 | { |
| 294 | if (pkt->flags & PF_PLAYER && !always_immediate (this, pkt, data, datalen)) |
294 | if (pkt->flags & PF_PLAYER && !always_immediate (this, pkt, data, datalen)) |
| 295 | queue_command (pkt, data, datalen); |
295 | queue_command (pkt, data, datalen); |
| 296 | else |
296 | else |
| … | |
… | |
| 528 | *cur++ = ' '; |
528 | *cur++ = ' '; |
| 529 | } |
529 | } |
| 530 | |
530 | |
| 531 | packet &packet::operator <<(const ber32 v) |
531 | packet &packet::operator <<(const ber32 v) |
| 532 | { |
532 | { |
| 533 | enum { maxlen = 32 / 7 + 1}; |
533 | enum { maxlen = 32 / 7 + 1 }; |
| 534 | uint8 buf[maxlen]; |
534 | uint8 buf[maxlen]; |
| 535 | uint8 *p = buf + maxlen; |
535 | uint8 *p = buf + maxlen; |
| 536 | uint32 val = v.val; |
536 | uint32 val = v.val; |
| 537 | |
537 | |
| 538 | *--p = val & 0x7F; |
538 | *--p = val & 0x7F; |
