| … | |
… | |
| 33 | #define FLOORBOX_PAGESIZE 50 |
33 | #define FLOORBOX_PAGESIZE 50 |
| 34 | |
34 | |
| 35 | struct MapCell |
35 | struct MapCell |
| 36 | { |
36 | { |
| 37 | UUID player; // this is, unfortunately, very wasteful of memory space, but pretty bandwidth-efficient |
37 | UUID player; // this is, unfortunately, very wasteful of memory space, but pretty bandwidth-efficient |
| 38 | int count; /* This is really darkness in the map1 command */ |
|
|
| 39 | faceidx faces[MAP_LAYERS]; |
38 | faceidx faces[MAP_LAYERS]; |
| 40 | uint16 smooth[MAP_LAYERS]; |
39 | faceidx smooth[MAP_LAYERS]; |
|
|
40 | int count; /* This is really darkness in the map1 command */ |
| 41 | unsigned char stat_hp; // health of something in this space, or 0 |
41 | unsigned char stat_hp; // health of something in this space, or 0 |
| 42 | unsigned char flags; |
42 | unsigned char flags; |
| 43 | }; |
43 | }; |
| 44 | |
44 | |
| 45 | #define MAX_CLIENT_X MAP_CLIENT_X |
45 | #define MAX_CLIENT_X MAP_CLIENT_X |
| 46 | #define MAX_CLIENT_Y MAP_CLIENT_Y |
46 | #define MAX_CLIENT_Y MAP_CLIENT_Y |
| … | |
… | |
| 235 | std::deque< command, slice_allocator<command> > cmd_queue; |
235 | std::deque< command, slice_allocator<command> > cmd_queue; |
| 236 | |
236 | |
| 237 | // large structures at the end please |
237 | // large structures at the end please |
| 238 | struct Map lastmap; |
238 | struct Map lastmap; |
| 239 | std::bitset<MAXANIMNUM> anims_sent; |
239 | std::bitset<MAXANIMNUM> anims_sent; |
| 240 | uint8 ACC (RW, faces_sent[MAX_FACES]); // This is a bitmap on sent face status |
240 | std::bitset<MAX_FACES> faces_sent; |
|
|
241 | |
| 241 | // if we get an incomplete packet, this is used to hold the data. |
242 | // if we get an incomplete packet, this is used to hold the data. |
| 242 | // we add 2 byte for the header, one for the trailing 0 byte |
243 | // we add 2 byte for the header, one for the trailing 0 byte |
| 243 | uint8 inbuf[MAXSOCKBUF + 2 + 1]; |
244 | uint8 inbuf[MAXSOCKBUF + 2 + 1]; |
| 244 | |
245 | |
| 245 | bool may_execute (const packet_type *pkt) const; |
246 | bool may_execute (const packet_type *pkt) const; |
| … | |
… | |
| 266 | void send_packet (packet &sl); |
267 | void send_packet (packet &sl); |
| 267 | |
268 | |
| 268 | void send_drawinfo (const char *msg, int flags = NDI_BLACK); |
269 | void send_drawinfo (const char *msg, int flags = NDI_BLACK); |
| 269 | MTH void send_face (faceidx facenum, bool nocache = false); |
270 | MTH void send_face (faceidx facenum, bool nocache = false); |
| 270 | MTH void send_faces (object *ob); |
271 | MTH void send_faces (object *ob); |
| 271 | MTH void send_smooth (faceidx facenum); |
|
|
| 272 | MTH void send_animation (short anim_num); |
272 | MTH void send_animation (short anim_num); |
| 273 | |
273 | |
| 274 | // called when something under the player changes |
274 | // called when something under the player changes |
| 275 | MTH void floorbox_update () { update_look = 1; } |
275 | MTH void floorbox_update () { update_look = 1; } |
| 276 | // called when the player has been moved |
276 | // called when the player has been moved |
| … | |
… | |
| 285 | |
285 | |
| 286 | #define CLIENT_SUPPORT_READABLES(__sockPtr,__type)\ |
286 | #define CLIENT_SUPPORT_READABLES(__sockPtr,__type)\ |
| 287 | ( ((__type)>0) &&\ |
287 | ( ((__type)>0) &&\ |
| 288 | ((__sockPtr)->has_readable_type) && \ |
288 | ((__sockPtr)->has_readable_type) && \ |
| 289 | ((__sockPtr)->supported_readables & (1<<(__type))) ) |
289 | ((__sockPtr)->supported_readables & (1<<(__type))) ) |
| 290 | |
|
|
| 291 | /* Bitmask for the faces_sent[] array - what |
|
|
| 292 | * portion of the face have we sent? |
|
|
| 293 | */ |
|
|
| 294 | #define NS_FACESENT_FACE 0x1 |
|
|
| 295 | #define NS_FACESENT_SMOOTH 0x2 |
|
|
| 296 | |
290 | |
| 297 | /* Constants in the form EMI_ is for extended map infos. |
291 | /* Constants in the form EMI_ is for extended map infos. |
| 298 | * Even if the client select the additionnal infos it wants |
292 | * Even if the client select the additionnal infos it wants |
| 299 | * on the map, there may exist cases where this whole info |
293 | * on the map, there may exist cases where this whole info |
| 300 | * is not given in one buch but in separate bunches. This |
294 | * is not given in one buch but in separate bunches. This |
