1 |
/* |
2 |
* CrossFire, A Multiplayer game for X-windows |
3 |
* |
4 |
* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
5 |
* Copyright (C) 2001 Mark Wedel |
6 |
* Copyright (C) 1992 Frank Tore Johansen |
7 |
* |
8 |
* This program is free software; you can redistribute it and/or modify |
9 |
* it under the terms of the GNU General Public License as published by |
10 |
* the Free Software Foundation; either version 2 of the License, or |
11 |
* (at your option) any later version. |
12 |
* |
13 |
* This program is distributed in the hope that it will be useful, |
14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 |
* GNU General Public License for more details. |
17 |
* |
18 |
* You should have received a copy of the GNU General Public License |
19 |
* along with this program; if not, write to the Free Software |
20 |
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
21 |
* |
22 |
* The author can be reached via e-mail to <crossfire@schmorp.de> |
23 |
*/ |
24 |
|
25 |
/** |
26 |
* \file |
27 |
* Client handling. |
28 |
* |
29 |
* \date 2003-12-02 |
30 |
* |
31 |
* This file implements all of the goo on the server side for handling |
32 |
* clients. It's got a bunch of global variables for keeping track of |
33 |
* each of the clients. |
34 |
* |
35 |
* Note: All functions that are used to process data from the client |
36 |
* have the prototype of (char *data, int datalen, int client_num). This |
37 |
* way, we can use one dispatch table. |
38 |
* |
39 |
* esrv_map_new starts updating the map |
40 |
* |
41 |
*/ |
42 |
|
43 |
#include <global.h> |
44 |
#include <sproto.h> |
45 |
|
46 |
#include <living.h> |
47 |
#include <commands.h> |
48 |
|
49 |
/* This block is basically taken from socket.c - I assume if it works there, |
50 |
* it should work here. |
51 |
*/ |
52 |
#include <sys/types.h> |
53 |
#include <sys/time.h> |
54 |
#include <sys/socket.h> |
55 |
#include <netinet/in.h> |
56 |
#include <netdb.h> |
57 |
|
58 |
#include <unistd.h> |
59 |
#include <sys/time.h> |
60 |
|
61 |
#include "sounds.h" |
62 |
|
63 |
/** |
64 |
* This table translates the attack numbers as used within the |
65 |
* program to the value we use when sending STATS command to the |
66 |
* client. If a value is -1, then we don't send that to the |
67 |
* client. |
68 |
*/ |
69 |
short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS, |
70 |
CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC, |
71 |
CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID, |
72 |
CS_STAT_RES_DRAIN, -1 /* weaponmagic */ , |
73 |
CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON, |
74 |
CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD, |
75 |
CS_STAT_RES_FEAR, -1 /* Cancellation */ , |
76 |
CS_STAT_RES_DEPLETE, CS_STAT_RES_DEATH, |
77 |
-1 /* Chaos */ , -1 /* Counterspell */ , |
78 |
-1 /* Godpower */ , CS_STAT_RES_HOLYWORD, |
79 |
CS_STAT_RES_BLIND, |
80 |
-1, /* Internal */ |
81 |
-1, /* life stealing */ |
82 |
-1 /* Disease - not fully done yet */ |
83 |
}; |
84 |
|
85 |
static void |
86 |
socket_map_scroll (client *ns, int dx, int dy) |
87 |
{ |
88 |
struct Map newmap; |
89 |
int x, y, mx, my; |
90 |
|
91 |
ns->send_packet_printf ("map_scroll %d %d", dx, dy); |
92 |
|
93 |
/* If we are using the Map1aCmd, we may in fact send |
94 |
* head information that is outside the viewable map. |
95 |
* So set the mx,my to the max value we want to |
96 |
* look for. Removed code to do so - it caused extra |
97 |
* complexities for the client, and probably doesn't make |
98 |
* that much difference in bandwidth. |
99 |
*/ |
100 |
mx = ns->mapx; |
101 |
my = ns->mapy; |
102 |
|
103 |
/* the x and y here are coordinates for the new map, i.e. if we moved |
104 |
* (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, |
105 |
* if the destination x or y coordinate is outside the viewable |
106 |
* area, we clear the values - otherwise, the old values |
107 |
* are preserved, and the check_head thinks it needs to clear them. |
108 |
*/ |
109 |
for (x = 0; x < mx; x++) |
110 |
{ |
111 |
for (y = 0; y < my; y++) |
112 |
{ |
113 |
if (x >= ns->mapx || y >= ns->mapy) |
114 |
/* clear cells outside the viewable area */ |
115 |
memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); |
116 |
else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy) |
117 |
/* clear newly visible tiles within the viewable area */ |
118 |
memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); |
119 |
else |
120 |
memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell)); |
121 |
} |
122 |
} |
123 |
|
124 |
memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); |
125 |
|
126 |
/* Make sure that the next "map1" command will be sent (even if it is |
127 |
* empty). |
128 |
*/ |
129 |
ns->sent_scroll = 1; |
130 |
} |
131 |
|
132 |
static void |
133 |
clear_map (player *pl) |
134 |
{ |
135 |
memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
136 |
|
137 |
pl->ns->force_newmap = false; |
138 |
|
139 |
if (pl->ns->newmapcmd == 1) |
140 |
pl->ns->send_packet ("newmap"); |
141 |
|
142 |
pl->ns->floorbox_reset (); |
143 |
} |
144 |
|
145 |
/** check for map/region change and send new map data */ |
146 |
static void |
147 |
check_map_change (player *pl) |
148 |
{ |
149 |
client &socket = *pl->ns; |
150 |
object *ob = pl->ob; |
151 |
char buf[MAX_BUF]; /* eauugggh */ |
152 |
|
153 |
if (socket.current_map != ob->map || socket.force_newmap) |
154 |
{ |
155 |
clear_map (pl); |
156 |
socket.current_map = ob->map; |
157 |
|
158 |
if (socket.mapinfocmd) |
159 |
{ |
160 |
if (ob->map && ob->map->path[0]) |
161 |
{ |
162 |
int flags = 0; |
163 |
|
164 |
if (ob->map->tile_path[0]) |
165 |
flags |= 1; |
166 |
if (ob->map->tile_path[1]) |
167 |
flags |= 2; |
168 |
if (ob->map->tile_path[2]) |
169 |
flags |= 4; |
170 |
if (ob->map->tile_path[3]) |
171 |
flags |= 8; |
172 |
|
173 |
snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s", |
174 |
flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path); |
175 |
} |
176 |
else |
177 |
snprintf (buf, MAX_BUF, "mapinfo current"); |
178 |
|
179 |
socket.send_packet (buf); |
180 |
} |
181 |
} |
182 |
else if (socket.current_x != ob->x || socket.current_y != ob->y) |
183 |
{ |
184 |
int dx = ob->x - socket.current_x; |
185 |
int dy = ob->y - socket.current_y; |
186 |
|
187 |
if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) |
188 |
clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows |
189 |
else |
190 |
{ |
191 |
socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
192 |
socket.floorbox_reset (); |
193 |
} |
194 |
} |
195 |
|
196 |
socket.current_x = ob->x; |
197 |
socket.current_y = ob->y; |
198 |
|
199 |
region *reg = ob->region (); |
200 |
if (socket.current_region != reg) |
201 |
{ |
202 |
socket.current_region = reg; |
203 |
socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", ®->longname); |
204 |
} |
205 |
} |
206 |
|
207 |
/** |
208 |
* RequestInfo is sort of a meta command. There is some specific |
209 |
* request of information, but we call other functions to provide |
210 |
* that information. |
211 |
*/ |
212 |
void |
213 |
RequestInfo (char *buf, int len, client * ns) |
214 |
{ |
215 |
char *params = NULL, *cp; |
216 |
|
217 |
/* No match */ |
218 |
char bigbuf[MAX_BUF]; |
219 |
int slen; |
220 |
|
221 |
/* Set up replyinfo before we modify any of the buffers - this is used |
222 |
* if we don't find a match. |
223 |
*/ |
224 |
strcpy (bigbuf, "replyinfo "); |
225 |
slen = strlen (bigbuf); |
226 |
safe_strcat (bigbuf, buf, &slen, MAX_BUF); |
227 |
|
228 |
/* find the first space, make it null, and update the |
229 |
* params pointer. |
230 |
*/ |
231 |
for (cp = buf; *cp != '\0'; cp++) |
232 |
if (*cp == ' ') |
233 |
{ |
234 |
*cp = '\0'; |
235 |
params = cp + 1; |
236 |
break; |
237 |
} |
238 |
|
239 |
if (!strcmp (buf, "image_info")) |
240 |
send_image_info (ns, params); |
241 |
else if (!strcmp (buf, "image_sums")) |
242 |
send_image_sums (ns, params); |
243 |
else if (!strcmp (buf, "skill_info")) |
244 |
send_skill_info (ns, params); |
245 |
else if (!strcmp (buf, "spell_paths")) |
246 |
send_spell_paths (ns, params); |
247 |
else |
248 |
ns->send_packet (bigbuf, len); |
249 |
} |
250 |
|
251 |
void |
252 |
ExtCmd (char *buf, int len, player *pl) |
253 |
{ |
254 |
INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); |
255 |
} |
256 |
|
257 |
void |
258 |
ExtiCmd (char *buf, int len, client *ns) |
259 |
{ |
260 |
INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
261 |
} |
262 |
|
263 |
void |
264 |
MapInfoCmd (char *buf, int len, player *pl) |
265 |
{ |
266 |
// <mapinfo tag spatial tile-path |
267 |
// >mapinfo tag spatial flags x y w h hash |
268 |
|
269 |
char bigbuf[MAX_BUF], *token; |
270 |
|
271 |
token = buf; |
272 |
// copy token |
273 |
if (!(buf = strchr (buf, ' '))) |
274 |
return; |
275 |
|
276 |
*buf++ = 0; |
277 |
|
278 |
if (!strncmp (buf, "spatial ", 8)) |
279 |
{ |
280 |
buf += 8; |
281 |
|
282 |
// initial map and its origin |
283 |
maptile *map = pl->ob->map; |
284 |
sint16 dx, dy; |
285 |
int mapx = pl->ns->mapx / 2 - pl->ob->x; |
286 |
int mapy = pl->ns->mapy / 2 - pl->ob->y; |
287 |
int max_distance = 8; // limit maximum path length to something generous |
288 |
|
289 |
while (*buf && map && max_distance) |
290 |
{ |
291 |
int dir = *buf++; |
292 |
|
293 |
switch (dir) |
294 |
{ |
295 |
case '1': |
296 |
dx = 0; |
297 |
dy = -1; |
298 |
map = map->xy_find (dx, dy); |
299 |
map && (mapy -= map->height); |
300 |
break; |
301 |
case '2': |
302 |
mapx += map->width; |
303 |
dx = map->width; |
304 |
dy = 0; |
305 |
map = map->xy_find (dx, dy); |
306 |
break; |
307 |
case '3': |
308 |
mapy += map->height; |
309 |
dx = 0; |
310 |
dy = map->height; |
311 |
map = map->xy_find (dx, dy); |
312 |
break; |
313 |
case '4': |
314 |
dx = -1; |
315 |
dy = 0; |
316 |
map = map->xy_find (dx, dy); |
317 |
map && (mapx -= map->width); |
318 |
break; |
319 |
} |
320 |
|
321 |
--max_distance; |
322 |
} |
323 |
|
324 |
if (!max_distance) |
325 |
snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token); |
326 |
else if (map && map->path[0]) |
327 |
{ |
328 |
int flags = 0; |
329 |
|
330 |
if (map->tile_path[0]) |
331 |
flags |= 1; |
332 |
if (map->tile_path[1]) |
333 |
flags |= 2; |
334 |
if (map->tile_path[2]) |
335 |
flags |= 4; |
336 |
if (map->tile_path[3]) |
337 |
flags |= 8; |
338 |
|
339 |
snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
340 |
} |
341 |
else |
342 |
snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); |
343 |
} |
344 |
else |
345 |
snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); |
346 |
|
347 |
pl->ns->send_packet (bigbuf); |
348 |
} |
349 |
|
350 |
/** This is the Setup cmd */ |
351 |
void |
352 |
SetUp (char *buf, int len, client * ns) |
353 |
{ |
354 |
INVOKE_CLIENT (SETUP, ns, ARG_DATA (buf, len)); |
355 |
} |
356 |
|
357 |
/** |
358 |
* The client has requested to be added to the game. |
359 |
* This is what takes care of it. We tell the client how things worked out. |
360 |
* I am not sure if this file is the best place for this function. however, |
361 |
* it either has to be here or init_sockets needs to be exported. |
362 |
*/ |
363 |
void |
364 |
AddMeCmd (char *buf, int len, client *ns) |
365 |
{ |
366 |
INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); |
367 |
} |
368 |
|
369 |
/** Reply to ExtendedInfos command */ |
370 |
void |
371 |
ToggleExtendedInfos (char *buf, int len, client * ns) |
372 |
{ |
373 |
char cmdback[MAX_BUF]; |
374 |
char command[50]; |
375 |
int info, nextinfo; |
376 |
|
377 |
cmdback[0] = '\0'; |
378 |
nextinfo = 0; |
379 |
|
380 |
while (1) |
381 |
{ |
382 |
/* 1. Extract an info */ |
383 |
info = nextinfo; |
384 |
|
385 |
while ((info < len) && (buf[info] == ' ')) |
386 |
info++; |
387 |
|
388 |
if (info >= len) |
389 |
break; |
390 |
|
391 |
nextinfo = info + 1; |
392 |
|
393 |
while ((nextinfo < len) && (buf[nextinfo] != ' ')) |
394 |
nextinfo++; |
395 |
|
396 |
if (nextinfo - info >= 49) /*Erroneous info asked */ |
397 |
continue; |
398 |
|
399 |
strncpy (command, &(buf[info]), nextinfo - info); |
400 |
|
401 |
/* 2. Interpret info */ |
402 |
if (!strcmp ("smooth", command)) |
403 |
/* Toggle smoothing */ |
404 |
ns->EMI_smooth = !ns->EMI_smooth; |
405 |
else |
406 |
/*bad value */; |
407 |
|
408 |
/*3. Next info */ |
409 |
} |
410 |
|
411 |
strcpy (cmdback, "ExtendedInfoSet"); |
412 |
|
413 |
if (ns->EMI_smooth) |
414 |
{ |
415 |
strcat (cmdback, " "); |
416 |
strcat (cmdback, "smoothing"); |
417 |
} |
418 |
|
419 |
ns->send_packet (cmdback); |
420 |
} |
421 |
|
422 |
/* |
423 |
#define MSG_TYPE_BOOK 1 |
424 |
#define MSG_TYPE_CARD 2 |
425 |
#define MSG_TYPE_PAPER 3 |
426 |
#define MSG_TYPE_SIGN 4 |
427 |
#define MSG_TYPE_MONUMENT 5 |
428 |
#define MSG_TYPE_SCRIPTED_DIALOG 6*/ |
429 |
|
430 |
/** Reply to ExtendedInfos command */ |
431 |
void |
432 |
ToggleExtendedText (char *buf, int len, client * ns) |
433 |
{ |
434 |
char cmdback[MAX_BUF]; |
435 |
char temp[10]; |
436 |
char command[50]; |
437 |
int info, nextinfo, i, flag; |
438 |
|
439 |
cmdback[0] = '\0'; |
440 |
|
441 |
nextinfo = 0; |
442 |
while (1) |
443 |
{ |
444 |
/* 1. Extract an info */ |
445 |
info = nextinfo; |
446 |
|
447 |
while ((info < len) && (buf[info] == ' ')) |
448 |
info++; |
449 |
|
450 |
if (info >= len) |
451 |
break; |
452 |
|
453 |
nextinfo = info + 1; |
454 |
|
455 |
while ((nextinfo < len) && (buf[nextinfo] != ' ')) |
456 |
nextinfo++; |
457 |
|
458 |
if (nextinfo - info >= 49) /*Erroneous info asked */ |
459 |
continue; |
460 |
|
461 |
strncpy (command, &(buf[info]), nextinfo - info); |
462 |
command[nextinfo - info] = '\0'; |
463 |
/* 2. Interpret info */ |
464 |
i = sscanf (command, "%d", &flag); |
465 |
|
466 |
if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST)) |
467 |
ns->supported_readables |= (1 << flag); |
468 |
/*3. Next info */ |
469 |
} |
470 |
|
471 |
/* Send resulting state */ |
472 |
strcpy (cmdback, "ExtendedTextSet"); |
473 |
|
474 |
for (i = 0; i <= MSG_TYPE_LAST; i++) |
475 |
if (ns->supported_readables & (1 << i)) |
476 |
{ |
477 |
strcat (cmdback, " "); |
478 |
snprintf (temp, sizeof (temp), "%d", i); |
479 |
strcat (cmdback, temp); |
480 |
} |
481 |
|
482 |
ns->send_packet (cmdback); |
483 |
} |
484 |
|
485 |
/** |
486 |
* client requested an image. send it rate-limited |
487 |
* before flushing. |
488 |
*/ |
489 |
void |
490 |
AskFaceCmd (char *buf, int len, client *ns) |
491 |
{ |
492 |
ns->askface.push_back (atoi (buf)); |
493 |
} |
494 |
|
495 |
/** |
496 |
* Tells client the picture it has to use |
497 |
* to smooth a picture number given as argument. |
498 |
*/ |
499 |
void |
500 |
AskSmooth (char *buf, int len, client *ns) |
501 |
{ |
502 |
ns->send_face (atoi (buf)); |
503 |
ns->flush_fx (); |
504 |
} |
505 |
|
506 |
/** |
507 |
* This handles the general commands from the client (ie, north, fire, cast, |
508 |
* etc.) |
509 |
*/ |
510 |
void |
511 |
PlayerCmd (char *buf, int len, player *pl) |
512 |
{ |
513 |
/* Check if there is a count. In theory, a zero count could also be |
514 |
* sent, so check for that also. |
515 |
*/ |
516 |
if (atoi (buf) || buf[0] == '0') |
517 |
{ |
518 |
pl->count = atoi ((char *) buf); |
519 |
|
520 |
buf = strchr (buf, ' '); /* advance beyond the numbers */ |
521 |
if (!buf) |
522 |
return; |
523 |
|
524 |
buf++; |
525 |
} |
526 |
|
527 |
execute_newserver_command (pl->ob, (char *) buf); |
528 |
|
529 |
/* Perhaps something better should be done with a left over count. |
530 |
* Cleaning up the input should probably be done first - all actions |
531 |
* for the command that issued the count should be done before any other |
532 |
* commands. |
533 |
*/ |
534 |
pl->count = 0; |
535 |
} |
536 |
|
537 |
|
538 |
/** |
539 |
* This handles the general commands from the client (ie, north, fire, cast, |
540 |
* etc.). It is a lot like PlayerCmd above, but is called with the |
541 |
* 'ncom' method which gives more information back to the client so it |
542 |
* can throttle. |
543 |
*/ |
544 |
void |
545 |
NewPlayerCmd (char *buf, int len, player *pl) |
546 |
{ |
547 |
if (len <= 6) |
548 |
{ |
549 |
LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); |
550 |
return; |
551 |
} |
552 |
|
553 |
uint16 cmdid = net_uint16 ((uint8 *)buf); |
554 |
sint32 repeat = net_sint32 ((uint8 *)buf + 2); |
555 |
|
556 |
/* -1 is special - no repeat, but don't update */ |
557 |
if (repeat != -1) |
558 |
pl->count = repeat; |
559 |
|
560 |
buf += 6; //len -= 6; |
561 |
|
562 |
execute_newserver_command (pl->ob, buf); |
563 |
|
564 |
/* Perhaps something better should be done with a left over count. |
565 |
* Cleaning up the input should probably be done first - all actions |
566 |
* for the command that issued the count should be done before any other |
567 |
* commands. |
568 |
*/ |
569 |
pl->count = 0; |
570 |
|
571 |
//TODO: schmorp thinks whatever this calculates, it makes no sense at all |
572 |
int time = fabs (pl->ob->speed) < 0.001 |
573 |
? time = MAX_TIME * 100 |
574 |
: time = (int) (MAX_TIME / fabs (pl->ob->speed)); |
575 |
|
576 |
/* Send confirmation of command execution now */ |
577 |
packet sl ("comc"); |
578 |
sl << uint16 (cmdid) << uint32 (time); |
579 |
pl->ns->send_packet (sl); |
580 |
} |
581 |
|
582 |
/** This is a reply to a previous query. */ |
583 |
void |
584 |
ReplyCmd (char *buf, int len, client *ns) |
585 |
{ |
586 |
if (ns->state == ST_CUSTOM) |
587 |
{ |
588 |
INVOKE_CLIENT (REPLY, ns, ARG_DATA (buf, len)); |
589 |
return; |
590 |
} |
591 |
|
592 |
if (!ns->pl) |
593 |
return; //TODO: depends on the exact reply we are after |
594 |
//TODO: but right now, we always have a ns->pl |
595 |
|
596 |
player *pl = ns->pl; |
597 |
|
598 |
/* This is to synthesize how the data would be stored if it |
599 |
* was normally entered. A bit of a hack, and should be cleaned up |
600 |
* once all the X11 code is removed from the server. |
601 |
* |
602 |
* We pass 13 to many of the functions because this way they |
603 |
* think it was the carriage return that was entered, and the |
604 |
* function then does not try to do additional input. |
605 |
*/ |
606 |
snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); |
607 |
|
608 |
/* this avoids any hacking here */ |
609 |
|
610 |
switch (ns->state) |
611 |
{ |
612 |
case ST_PLAYING: |
613 |
LOG (llevError, "Got reply message with ST_PLAYING input state\n"); |
614 |
break; |
615 |
|
616 |
case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
617 |
receive_party_password (pl->ob, 13); |
618 |
break; |
619 |
|
620 |
default: |
621 |
LOG (llevError, "Unknown input state: %d\n", ns->state); |
622 |
} |
623 |
} |
624 |
|
625 |
/** |
626 |
* Client tells its version. If there is a mismatch, we close the |
627 |
* socket. In real life, all we should care about is the client having |
628 |
* something older than the server. If we assume the client will be |
629 |
* backwards compatible, having it be a later version should not be a |
630 |
* problem. |
631 |
*/ |
632 |
void |
633 |
VersionCmd (char *buf, int len, client * ns) |
634 |
{ |
635 |
if (!buf) |
636 |
{ |
637 |
LOG (llevError, "CS: received corrupted version command\n"); |
638 |
return; |
639 |
} |
640 |
|
641 |
ns->cs_version = atoi (buf); |
642 |
ns->sc_version = ns->cs_version; |
643 |
|
644 |
LOG (llevDebug, "connection from client <%s>\n", buf); |
645 |
|
646 |
//TODO: should log here just for statistics |
647 |
|
648 |
//if (VERSION_CS != ns->cs_version) |
649 |
// unchecked; |
650 |
|
651 |
char *cp = strchr (buf + 1, ' '); |
652 |
if (!cp) |
653 |
return; |
654 |
|
655 |
ns->sc_version = atoi (cp); |
656 |
|
657 |
//if (VERSION_SC != ns->sc_version) |
658 |
// unchecked; |
659 |
|
660 |
cp = strchr (cp + 1, ' '); |
661 |
|
662 |
if (cp) |
663 |
{ |
664 |
assign (ns->version, cp + 1); |
665 |
|
666 |
if (ns->sc_version < 1026) |
667 |
ns->send_packet_printf ("drawinfo %d %s", NDI_RED, |
668 |
"**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); |
669 |
} |
670 |
} |
671 |
|
672 |
/** sound related functions. */ |
673 |
void |
674 |
SetSound (char *buf, int len, client * ns) |
675 |
{ |
676 |
ns->sound = atoi (buf); |
677 |
} |
678 |
|
679 |
/** client wants the map resent */ |
680 |
void |
681 |
MapRedrawCmd (char *buf, int len, player *pl) |
682 |
{ |
683 |
/* This function is currently disabled; just clearing the map state results in |
684 |
* display errors. It should clear the cache and send a newmap command. |
685 |
* Unfortunately this solution does not work because some client versions send |
686 |
* a mapredraw command after receiving a newmap command. |
687 |
*/ |
688 |
} |
689 |
|
690 |
/** |
691 |
* Moves an object (typically, container to inventory). |
692 |
* syntax is: move (to) (tag) (nrof) |
693 |
*/ |
694 |
void |
695 |
MoveCmd (char *buf, int len, player *pl) |
696 |
{ |
697 |
int vals[3], i; |
698 |
|
699 |
/* A little funky here. We only cycle for 2 records, because |
700 |
* we obviously are not going to find a space after the third |
701 |
* record. Perhaps we should just replace this with a |
702 |
* sscanf? |
703 |
*/ |
704 |
for (i = 0; i < 2; i++) |
705 |
{ |
706 |
vals[i] = atoi (buf); |
707 |
|
708 |
if (!(buf = strchr (buf, ' '))) |
709 |
{ |
710 |
LOG (llevError, "Incomplete move command: %s\n", buf); |
711 |
return; |
712 |
} |
713 |
|
714 |
buf++; |
715 |
} |
716 |
|
717 |
vals[2] = atoi (buf); |
718 |
|
719 |
/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ |
720 |
esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); |
721 |
} |
722 |
|
723 |
/****************************************************************************** |
724 |
* |
725 |
* Start of commands the server sends to the client. |
726 |
* |
727 |
******************************************************************************/ |
728 |
|
729 |
/** |
730 |
* Asks the client to query the user. This way, the client knows |
731 |
* it needs to send something back (vs just printing out a message) |
732 |
*/ |
733 |
void |
734 |
send_query (client *ns, uint8 flags, const char *text) |
735 |
{ |
736 |
ns->send_packet_printf ("query %d %s", flags, text ? text : ""); |
737 |
} |
738 |
|
739 |
#define AddIfInt64(Old,New,Type) if (Old != New) {\ |
740 |
Old = New; \ |
741 |
sl << uint8 (Type) << uint64 (New); \ |
742 |
} |
743 |
|
744 |
#define AddIfInt(Old,New,Type) if (Old != New) {\ |
745 |
Old = New; \ |
746 |
sl << uint8 (Type) << uint32 (New); \ |
747 |
} |
748 |
|
749 |
#define AddIfShort(Old,New,Type) if (Old != New) {\ |
750 |
Old = New; \ |
751 |
sl << uint8 (Type) << uint16 (New); \ |
752 |
} |
753 |
|
754 |
#define AddIfFloat(Old,New,Type) if (Old != New) {\ |
755 |
Old = New; \ |
756 |
sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \ |
757 |
} |
758 |
|
759 |
#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ |
760 |
free(Old); Old = strdup (New);\ |
761 |
sl << uint8 (Type) << data8 (New); \ |
762 |
} |
763 |
|
764 |
/** |
765 |
* Sends a statistics update. We look at the old values, |
766 |
* and only send what has changed. Stat mapping values are in newclient.h |
767 |
* Since this gets sent a lot, this is actually one of the few binary |
768 |
* commands for now. |
769 |
*/ |
770 |
void |
771 |
esrv_update_stats (player *pl) |
772 |
{ |
773 |
char buf[MAX_BUF]; |
774 |
uint16 flags; |
775 |
|
776 |
client *ns = pl->ns; |
777 |
if (!ns) |
778 |
return; |
779 |
|
780 |
object *ob = pl->ob; |
781 |
if (!ob) |
782 |
return; |
783 |
|
784 |
packet sl ("stats"); |
785 |
|
786 |
AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); |
787 |
AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); |
788 |
AddIfShort (ns->last_stats.sp, ob->stats.sp, CS_STAT_SP); |
789 |
AddIfShort (ns->last_stats.maxsp, ob->stats.maxsp, CS_STAT_MAXSP); |
790 |
AddIfShort (ns->last_stats.grace, ob->stats.grace, CS_STAT_GRACE); |
791 |
AddIfShort (ns->last_stats.maxgrace, ob->stats.maxgrace, CS_STAT_MAXGRACE); |
792 |
AddIfShort (ns->last_stats.Str, ob->stats.Str, CS_STAT_STR); |
793 |
AddIfShort (ns->last_stats.Dex, ob->stats.Dex, CS_STAT_DEX); |
794 |
AddIfShort (ns->last_stats.Con, ob->stats.Con, CS_STAT_CON); |
795 |
AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT); |
796 |
AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
797 |
AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
798 |
AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
799 |
|
800 |
for (int s = 0; s < NUM_SKILLS; s++) |
801 |
if (object *skill = pl->last_skill_ob[s]) |
802 |
if (skill->stats.exp != ns->last_skill_exp [s]) |
803 |
{ |
804 |
ns->last_skill_exp [s] = skill->stats.exp; |
805 |
|
806 |
/* Always send along the level if exp changes. This is only |
807 |
* 1 extra byte, but keeps processing simpler. |
808 |
*/ |
809 |
sl << uint8 (s + CS_STAT_SKILLINFO) |
810 |
<< uint8 (skill->level) |
811 |
<< uint64 (skill->stats.exp); |
812 |
} |
813 |
|
814 |
AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); |
815 |
AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); |
816 |
AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); |
817 |
AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); |
818 |
AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); |
819 |
AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED); |
820 |
AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); |
821 |
AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); |
822 |
AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); |
823 |
|
824 |
flags = 0; |
825 |
|
826 |
if (pl->fire_on) |
827 |
flags |= SF_FIREON; |
828 |
|
829 |
if (pl->run_on) |
830 |
flags |= SF_RUNON; |
831 |
|
832 |
AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); |
833 |
|
834 |
if (ns->sc_version < 1025) |
835 |
{ AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } |
836 |
else |
837 |
for (int i = 0; i < NROFATTACKS; i++) |
838 |
{ |
839 |
/* Skip ones we won't send */ |
840 |
if (atnr_cs_stat[i] == -1) |
841 |
continue; |
842 |
|
843 |
AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]); |
844 |
} |
845 |
|
846 |
if (pl->ns->monitor_spells) |
847 |
{ |
848 |
AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
849 |
AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); |
850 |
AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); |
851 |
} |
852 |
|
853 |
rangetostring (ob, buf); /* we want use the new fire & run system in new client */ |
854 |
AddIfString (ns->stats.range, buf, CS_STAT_RANGE); |
855 |
set_title (ob, buf); |
856 |
AddIfString (ns->stats.title, buf, CS_STAT_TITLE); |
857 |
|
858 |
/* Only send it away if we have some actual data */ |
859 |
if (sl.length () > 6) |
860 |
ns->send_packet (sl); |
861 |
} |
862 |
|
863 |
/** |
864 |
* Tells the client that here is a player it should start using. |
865 |
*/ |
866 |
void |
867 |
esrv_new_player (player *pl, uint32 weight) |
868 |
{ |
869 |
packet sl ("player"); |
870 |
|
871 |
sl << uint32 (pl->ob->count) |
872 |
<< uint32 (weight) |
873 |
<< uint32 (pl->ob->face) |
874 |
<< data8 (pl->ob->name); |
875 |
|
876 |
pl->ns->last_weight = weight; |
877 |
pl->ns->send_packet (sl); |
878 |
SET_FLAG (pl->ob, FLAG_CLIENT_SENT); |
879 |
} |
880 |
|
881 |
/****************************************************************************** |
882 |
* |
883 |
* Start of map related commands. |
884 |
* |
885 |
******************************************************************************/ |
886 |
|
887 |
/** Clears a map cell */ |
888 |
static void |
889 |
map_clearcell (struct MapCell *cell, int count) |
890 |
{ |
891 |
cell->faces[0] = 0; |
892 |
cell->faces[1] = 0; |
893 |
cell->faces[2] = 0; |
894 |
cell->smooth[0] = 0; |
895 |
cell->smooth[1] = 0; |
896 |
cell->smooth[2] = 0; |
897 |
cell->count = count; |
898 |
cell->stat_hp = 0; |
899 |
cell->flags = 0; |
900 |
cell->player = 0; |
901 |
} |
902 |
|
903 |
#define MAX_LAYERS 3 |
904 |
|
905 |
/** |
906 |
* Removes the need to replicate the same code for each layer. |
907 |
* this returns true if this space is now in fact different than |
908 |
* it was. |
909 |
* sl is the socklist this data is going into. |
910 |
* ns is the socket we are working on - all the info we care |
911 |
* about is in this socket structure, so now need not pass the |
912 |
* entire player object. |
913 |
* layer is the layer to update, with 2 being the floor and 0 the |
914 |
* top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ) |
915 |
* take. Interesting to note that before this function, the map1 function |
916 |
* numbers the spaces differently - I think this was a leftover from |
917 |
* the map command, where the faces stack up. Sinces that is no longer |
918 |
* the case, it seems to make more sense to have these layer values |
919 |
* actually match. |
920 |
*/ |
921 |
static int |
922 |
update_space (packet &sl, client &ns, mapspace &ms, MapCell &lastcell, int layer) |
923 |
{ |
924 |
object *ob = ms.faces_obj [layer]; |
925 |
|
926 |
/* If there is no object for this space, or if the face for the object |
927 |
* is the blank face, set the face number to zero. |
928 |
* else if we have the stored head object for this space, that takes |
929 |
* precedence over the other object for this space. |
930 |
* otherwise, we do special head processing |
931 |
*/ |
932 |
uint16 face_num = ob && ob->face != blank_face ? ob->face : 0; |
933 |
|
934 |
/* We've gotten what face we want to use for the object. Now see if |
935 |
* if it has changed since we last sent it to the client. |
936 |
*/ |
937 |
if (lastcell.faces[layer] != face_num) |
938 |
{ |
939 |
lastcell.faces[layer] = face_num; |
940 |
|
941 |
if (!ns.faces_sent[face_num]) |
942 |
if (ob) |
943 |
ns.send_faces (ob); |
944 |
else |
945 |
ns.send_face (face_num); |
946 |
|
947 |
sl << uint16 (face_num); |
948 |
return 1; |
949 |
} |
950 |
|
951 |
/* Nothing changed */ |
952 |
return 0; |
953 |
} |
954 |
|
955 |
/** |
956 |
* Returns the size of a data for a map square as returned by |
957 |
* mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries |
958 |
* available. |
959 |
*/ |
960 |
int |
961 |
getExtendedMapInfoSize (client * ns) |
962 |
{ |
963 |
int result = 0; |
964 |
|
965 |
if (ns->ext_mapinfos) |
966 |
{ |
967 |
if (ns->EMI_smooth) |
968 |
result += 1; /*One byte for smoothlevel */ |
969 |
} |
970 |
|
971 |
return result; |
972 |
} |
973 |
|
974 |
// prefetch (and touch) all maps within a specific distancd |
975 |
static void |
976 |
prefetch_surrounding_maps (maptile *map, int distance) |
977 |
{ |
978 |
map->last_access = runtime; |
979 |
|
980 |
if (--distance) |
981 |
for (int dir = 4; --dir; ) |
982 |
if (const shstr &path = map->tile_path [dir]) |
983 |
if (maptile *&neigh = map->tile_map [dir]) |
984 |
prefetch_surrounding_maps (neigh, distance); |
985 |
else |
986 |
neigh = maptile::find_async (path, map); |
987 |
} |
988 |
|
989 |
// prefetch a generous area around the player |
990 |
static void |
991 |
prefetch_surrounding_maps (object *op) |
992 |
{ |
993 |
prefetch_surrounding_maps (op->map, 3); |
994 |
} |
995 |
|
996 |
/** |
997 |
* This function uses the new map1 protocol command to send the map |
998 |
* to the client. It is necessary because the old map command supports |
999 |
* a maximum map size of 15x15. |
1000 |
* This function is much simpler than the old one. This is because |
1001 |
* the old function optimized to send as few face identifiers as possible, |
1002 |
* at the expense of sending more coordinate location (coordinates were |
1003 |
* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since |
1004 |
* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
1005 |
* maps no sense. Instead, we actually really only use 12 bits for coordinates, |
1006 |
* and use the other 4 bits for other informatiion. For full documentation |
1007 |
* of what we send, see the doc/Protocol file. |
1008 |
* I will describe internally what we do: |
1009 |
* the ns->lastmap shows how the map last looked when sent to the client. |
1010 |
* in the lastmap structure, there is a cells array, which is set to the |
1011 |
* maximum viewable size (As set in config.h). |
1012 |
* in the cells, there are faces and a count value. |
1013 |
* we use the count value to hold the darkness value. If -1, then this space |
1014 |
* is not viewable. |
1015 |
* we use faces[0] faces[1] faces[2] to hold what the three layers |
1016 |
* look like. |
1017 |
*/ |
1018 |
void |
1019 |
draw_client_map1 (object *pl) |
1020 |
{ |
1021 |
int x, y, ax, ay, startlen, max_x, max_y, oldlen; |
1022 |
sint16 nx, ny; |
1023 |
int estartlen, eoldlen; |
1024 |
uint8 eentrysize; |
1025 |
uint16 ewhatstart, ewhatflag; |
1026 |
uint8 extendedinfos; |
1027 |
maptile *m; |
1028 |
|
1029 |
client &socket = *pl->contr->ns; |
1030 |
|
1031 |
if (!pl->active) |
1032 |
return; |
1033 |
|
1034 |
check_map_change (pl->contr); |
1035 |
prefetch_surrounding_maps (pl); |
1036 |
|
1037 |
packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
1038 |
packet esl; |
1039 |
|
1040 |
startlen = sl.length (); |
1041 |
|
1042 |
/*Extendedmapinfo structure initialisation */ |
1043 |
if (socket.ext_mapinfos) |
1044 |
{ |
1045 |
extendedinfos = EMI_NOREDRAW; |
1046 |
|
1047 |
if (socket.EMI_smooth) |
1048 |
extendedinfos |= EMI_SMOOTH; |
1049 |
|
1050 |
ewhatstart = esl.length (); |
1051 |
ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit |
1052 |
could need to be taken away */ |
1053 |
eentrysize = getExtendedMapInfoSize (&socket); |
1054 |
esl << "mapextended " |
1055 |
<< uint8 (extendedinfos) |
1056 |
<< uint8 (eentrysize); |
1057 |
|
1058 |
estartlen = esl.length (); |
1059 |
} |
1060 |
|
1061 |
/* x,y are the real map locations. ax, ay are viewport relative |
1062 |
* locations. |
1063 |
*/ |
1064 |
ay = 0; |
1065 |
|
1066 |
/* We could do this logic as conditionals in the if statement, |
1067 |
* but that started to get a bit messy to look at. |
1068 |
*/ |
1069 |
max_x = pl->x + (socket.mapx + 1) / 2; |
1070 |
max_y = pl->y + (socket.mapy + 1) / 2; |
1071 |
|
1072 |
maptile *plmap = pl->map; |
1073 |
|
1074 |
for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) |
1075 |
{ |
1076 |
ax = 0; |
1077 |
for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) |
1078 |
{ |
1079 |
int emask, mask; |
1080 |
emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1081 |
|
1082 |
MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1083 |
|
1084 |
/* If the coordinates are not valid, or it is too dark to see, |
1085 |
* we tell the client as such |
1086 |
*/ |
1087 |
nx = x; |
1088 |
ny = y; |
1089 |
m = get_map_from_coord (plmap, &nx, &ny); |
1090 |
|
1091 |
if (!m) |
1092 |
{ |
1093 |
/* space is out of map. Update space and clear values |
1094 |
* if this hasn't already been done. If the space is out |
1095 |
* of the map, it shouldn't have a head |
1096 |
*/ |
1097 |
if (lastcell.count != -1) |
1098 |
{ |
1099 |
sl << uint16 (mask); |
1100 |
map_clearcell (&lastcell, -1); |
1101 |
} |
1102 |
|
1103 |
continue; |
1104 |
} |
1105 |
|
1106 |
m->touch (); |
1107 |
|
1108 |
int d = pl->contr->blocked_los[ax][ay]; |
1109 |
|
1110 |
if (d > 3) |
1111 |
{ |
1112 |
|
1113 |
int need_send = 0, count; |
1114 |
|
1115 |
/* This block deals with spaces that are not visible for whatever |
1116 |
* reason. Still may need to send the head for this space. |
1117 |
*/ |
1118 |
|
1119 |
oldlen = sl.length (); |
1120 |
|
1121 |
sl << uint16 (mask); |
1122 |
|
1123 |
if (lastcell.count != -1) |
1124 |
need_send = 1; |
1125 |
|
1126 |
count = -1; |
1127 |
|
1128 |
/* properly clear a previously sent big face */ |
1129 |
if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2] |
1130 |
|| lastcell.stat_hp || lastcell.flags || lastcell.player) |
1131 |
need_send = 1; |
1132 |
|
1133 |
map_clearcell (&lastcell, count); |
1134 |
|
1135 |
if ((mask & 0xf) || need_send) |
1136 |
sl[oldlen + 1] = mask & 0xff; |
1137 |
else |
1138 |
sl.reset (oldlen); |
1139 |
} |
1140 |
else |
1141 |
{ |
1142 |
/* In this block, the space is visible. |
1143 |
*/ |
1144 |
|
1145 |
/* Rather than try to figure out what everything that we might |
1146 |
* need to send is, then form the packet after that, |
1147 |
* we presume that we will in fact form a packet, and update |
1148 |
* the bits by what we do actually send. If we send nothing, |
1149 |
* we just back out sl.length () to the old value, and no harm |
1150 |
* is done. |
1151 |
* I think this is simpler than doing a bunch of checks to see |
1152 |
* what if anything we need to send, setting the bits, then |
1153 |
* doing those checks again to add the real data. |
1154 |
*/ |
1155 |
oldlen = sl.length (); |
1156 |
eoldlen = esl.length (); |
1157 |
|
1158 |
sl << uint16 (mask); |
1159 |
|
1160 |
unsigned char dummy; |
1161 |
unsigned char *last_ext = &dummy; |
1162 |
|
1163 |
/* Darkness changed */ |
1164 |
if (lastcell.count != d && socket.darkness) |
1165 |
{ |
1166 |
mask |= 0x8; |
1167 |
|
1168 |
if (socket.extmap) |
1169 |
{ |
1170 |
*last_ext |= 0x80; |
1171 |
last_ext = &sl[sl.length ()]; |
1172 |
sl << uint8 (d); |
1173 |
} |
1174 |
else |
1175 |
sl << uint8 (255 - 64 * d); |
1176 |
} |
1177 |
|
1178 |
lastcell.count = d; |
1179 |
|
1180 |
mapspace &ms = m->at (nx, ny); |
1181 |
|
1182 |
if (socket.extmap) |
1183 |
{ |
1184 |
uint8 stat_hp = 0; |
1185 |
uint8 stat_width = 0; |
1186 |
uint8 flags = 0; |
1187 |
tag_t player = 0; |
1188 |
|
1189 |
// send hp information, if applicable |
1190 |
if (object *op = ms.faces_obj [0]) |
1191 |
{ |
1192 |
if (op->head || op->invisible) |
1193 |
; // do not show |
1194 |
else if (op->type == PLAYER |
1195 |
|| QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)) |
1196 |
{ |
1197 |
if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp) |
1198 |
{ |
1199 |
stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
1200 |
stat_width = op->arch->tail_x; |
1201 |
} |
1202 |
} |
1203 |
|
1204 |
if (op->msg && op->msg[0] == '@') |
1205 |
flags |= 1; |
1206 |
|
1207 |
if (op->type == PLAYER && op != pl) |
1208 |
player = op->count; |
1209 |
} |
1210 |
|
1211 |
if (lastcell.stat_hp != stat_hp) |
1212 |
{ |
1213 |
lastcell.stat_hp = stat_hp; |
1214 |
|
1215 |
mask |= 0x8; |
1216 |
*last_ext |= 0x80; |
1217 |
last_ext = &sl[sl.length ()]; |
1218 |
|
1219 |
sl << uint8 (5) << uint8 (stat_hp); |
1220 |
|
1221 |
if (stat_width > 1) |
1222 |
{ |
1223 |
*last_ext |= 0x80; |
1224 |
last_ext = &sl[sl.length ()]; |
1225 |
|
1226 |
sl << uint8 (6) << uint8 (stat_width); |
1227 |
} |
1228 |
} |
1229 |
|
1230 |
if (lastcell.player != player) |
1231 |
{ |
1232 |
lastcell.player = player; |
1233 |
|
1234 |
mask |= 0x8; |
1235 |
*last_ext |= 0x80; |
1236 |
last_ext = &sl[sl.length ()]; |
1237 |
|
1238 |
sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
1239 |
} |
1240 |
|
1241 |
if (lastcell.flags != flags) |
1242 |
{ |
1243 |
lastcell.flags = flags; |
1244 |
|
1245 |
mask |= 0x8; |
1246 |
*last_ext |= 0x80; |
1247 |
last_ext = &sl[sl.length ()]; |
1248 |
|
1249 |
sl << uint8 (8) << uint8 (flags); |
1250 |
} |
1251 |
} |
1252 |
|
1253 |
/* Floor face */ |
1254 |
if (update_space (sl, socket, ms, lastcell, 2)) |
1255 |
mask |= 0x4; |
1256 |
|
1257 |
/* Middle face */ |
1258 |
if (update_space (sl, socket, ms, lastcell, 1)) |
1259 |
mask |= 0x2; |
1260 |
|
1261 |
if (ms.player () == pl |
1262 |
&& (pl->invisible & (pl->invisible < 50 ? 1 : 7))) |
1263 |
{ |
1264 |
// force player to be visible to himself if invisible |
1265 |
if (lastcell.faces[0] != pl->face) |
1266 |
{ |
1267 |
lastcell.faces[0] = pl->face; |
1268 |
|
1269 |
mask |= 0x1; |
1270 |
sl << uint16 (pl->face); |
1271 |
|
1272 |
socket.send_faces (pl); |
1273 |
} |
1274 |
} |
1275 |
/* Top face */ |
1276 |
else if (update_space (sl, socket, ms, lastcell, 0)) |
1277 |
mask |= 0x1; |
1278 |
|
1279 |
|
1280 |
/* Check to see if we are in fact sending anything for this |
1281 |
* space by checking the mask. If so, update the mask. |
1282 |
* if not, reset the len to that from before adding the mask |
1283 |
* value, so we don't send those bits. |
1284 |
*/ |
1285 |
if (mask & 0xf) |
1286 |
sl[oldlen + 1] = mask & 0xff; |
1287 |
else |
1288 |
sl.reset (oldlen); |
1289 |
|
1290 |
if (socket.ext_mapinfos) |
1291 |
esl << uint16 (emask); |
1292 |
|
1293 |
if (socket.EMI_smooth) |
1294 |
{ |
1295 |
for (int layer = 2+1; layer--; ) |
1296 |
{ |
1297 |
object *ob = ms.faces_obj [layer]; |
1298 |
|
1299 |
// If there is no object for this space, or if the face for the object |
1300 |
// is the blank face, set the smoothlevel to zero. |
1301 |
int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0; |
1302 |
|
1303 |
// We've gotten what face we want to use for the object. Now see if |
1304 |
// if it has changed since we last sent it to the client. |
1305 |
if (lastcell.smooth[layer] != smoothlevel) |
1306 |
{ |
1307 |
lastcell.smooth[layer] = smoothlevel; |
1308 |
esl << uint8 (smoothlevel); |
1309 |
emask |= 1 << layer; |
1310 |
} |
1311 |
} |
1312 |
|
1313 |
if (emask & 0xf) |
1314 |
esl[eoldlen + 1] = emask & 0xff; |
1315 |
else |
1316 |
esl.reset (eoldlen); |
1317 |
} |
1318 |
} /* else this is a viewable space */ |
1319 |
} /* for x loop */ |
1320 |
} /* for y loop */ |
1321 |
|
1322 |
socket.flush_fx (); |
1323 |
|
1324 |
/* Verify that we in fact do need to send this */ |
1325 |
if (socket.ext_mapinfos) |
1326 |
{ |
1327 |
if (!(sl.length () > startlen || socket.sent_scroll)) |
1328 |
{ |
1329 |
/* No map data will follow, so don't say the client |
1330 |
* it doesn't need draw! |
1331 |
*/ |
1332 |
ewhatflag &= ~EMI_NOREDRAW; |
1333 |
esl[ewhatstart + 1] = ewhatflag & 0xff; |
1334 |
} |
1335 |
|
1336 |
if (esl.length () > estartlen) |
1337 |
socket.send_packet (esl); |
1338 |
} |
1339 |
|
1340 |
if (sl.length () > startlen || socket.sent_scroll) |
1341 |
{ |
1342 |
socket.send_packet (sl); |
1343 |
socket.sent_scroll = 0; |
1344 |
} |
1345 |
} |
1346 |
|
1347 |
/** |
1348 |
* Draws client map. |
1349 |
*/ |
1350 |
void |
1351 |
draw_client_map (object *pl) |
1352 |
{ |
1353 |
int i, j; |
1354 |
sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */ |
1355 |
int mflags; |
1356 |
struct Map newmap; |
1357 |
maptile *m, *pm; |
1358 |
|
1359 |
if (pl->type != PLAYER) |
1360 |
{ |
1361 |
LOG (llevError, "draw_client_map called with non player/non eric-server\n"); |
1362 |
return; |
1363 |
} |
1364 |
|
1365 |
pm = pl->map; |
1366 |
|
1367 |
/* If player is just joining the game, he isn't here yet, so the map |
1368 |
* can get swapped out. If so, don't try to send them a map. All will |
1369 |
* be OK once they really log in. |
1370 |
*/ |
1371 |
if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) |
1372 |
return; |
1373 |
|
1374 |
memset (&newmap, 0, sizeof (struct Map)); |
1375 |
|
1376 |
for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++) |
1377 |
for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++) |
1378 |
{ |
1379 |
ax = i; |
1380 |
ay = j; |
1381 |
m = pm; |
1382 |
mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); |
1383 |
|
1384 |
if (mflags & P_OUT_OF_MAP) |
1385 |
continue; |
1386 |
|
1387 |
/* If a map is visible to the player, we don't want to swap it out |
1388 |
* just to reload it. This should really call something like |
1389 |
* swap_map, but this is much more efficient and 'good enough' |
1390 |
*/ |
1391 |
if (mflags & P_NEW_MAP) |
1392 |
m->timeout = 50; |
1393 |
} |
1394 |
|
1395 |
/* do LOS after calls to update_position */ |
1396 |
if (pl->contr->do_los) |
1397 |
{ |
1398 |
update_los (pl); |
1399 |
pl->contr->do_los = 0; |
1400 |
} |
1401 |
|
1402 |
/* Big maps need a different drawing mechanism to work */ |
1403 |
draw_client_map1 (pl); |
1404 |
} |
1405 |
|
1406 |
|
1407 |
/*****************************************************************************/ |
1408 |
|
1409 |
/* GROS: The following one is used to allow a plugin to send a generic cmd to*/ |
1410 |
|
1411 |
/* a player. Of course, the client need to know the command to be able to */ |
1412 |
|
1413 |
/* manage it ! */ |
1414 |
|
1415 |
/*****************************************************************************/ |
1416 |
void |
1417 |
send_plugin_custom_message (object *pl, char *buf) |
1418 |
{ |
1419 |
pl->contr->ns->send_packet (buf); |
1420 |
} |
1421 |
|
1422 |
/** |
1423 |
* This sends the skill number to name mapping. We ignore |
1424 |
* the params - we always send the same info no matter what. |
1425 |
*/ |
1426 |
void |
1427 |
send_skill_info (client *ns, char *params) |
1428 |
{ |
1429 |
packet sl; |
1430 |
sl << "replyinfo skill_info\n"; |
1431 |
|
1432 |
for (int i = 1; i < NUM_SKILLS; i++) |
1433 |
sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); |
1434 |
|
1435 |
if (sl.length () >= MAXSOCKBUF) |
1436 |
{ |
1437 |
LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
1438 |
fatal (0); |
1439 |
} |
1440 |
|
1441 |
ns->send_packet (sl); |
1442 |
} |
1443 |
|
1444 |
/** |
1445 |
* This sends the spell path to name mapping. We ignore |
1446 |
* the params - we always send the same info no matter what. |
1447 |
*/ |
1448 |
void |
1449 |
send_spell_paths (client * ns, char *params) |
1450 |
{ |
1451 |
packet sl; |
1452 |
|
1453 |
sl << "replyinfo spell_paths\n"; |
1454 |
|
1455 |
for (int i = 0; i < NRSPELLPATHS; i++) |
1456 |
sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
1457 |
|
1458 |
if (sl.length () >= MAXSOCKBUF) |
1459 |
{ |
1460 |
LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
1461 |
fatal (0); |
1462 |
} |
1463 |
|
1464 |
ns->send_packet (sl); |
1465 |
} |
1466 |
|
1467 |
/** |
1468 |
* This looks for any spells the player may have that have changed their stats. |
1469 |
* it then sends an updspell packet for each spell that has changed in this way |
1470 |
*/ |
1471 |
void |
1472 |
esrv_update_spells (player *pl) |
1473 |
{ |
1474 |
if (!pl->ns) |
1475 |
return; |
1476 |
|
1477 |
if (!pl->ns->monitor_spells) |
1478 |
return; |
1479 |
|
1480 |
for (object *spell = pl->ob->inv; spell; spell = spell->below) |
1481 |
{ |
1482 |
if (spell->type == SPELL) |
1483 |
{ |
1484 |
int flags = 0; |
1485 |
|
1486 |
/* check if we need to update it */ |
1487 |
if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) |
1488 |
{ |
1489 |
spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1490 |
flags |= UPD_SP_MANA; |
1491 |
} |
1492 |
|
1493 |
if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) |
1494 |
{ |
1495 |
spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1496 |
flags |= UPD_SP_GRACE; |
1497 |
} |
1498 |
|
1499 |
if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) |
1500 |
{ |
1501 |
spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1502 |
flags |= UPD_SP_DAMAGE; |
1503 |
} |
1504 |
|
1505 |
if (flags) |
1506 |
{ |
1507 |
packet sl; |
1508 |
|
1509 |
sl << "updspell " |
1510 |
<< uint8 (flags) |
1511 |
<< uint32 (spell->count); |
1512 |
|
1513 |
if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); |
1514 |
if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); |
1515 |
if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); |
1516 |
|
1517 |
pl->ns->send_packet (sl); |
1518 |
} |
1519 |
} |
1520 |
} |
1521 |
} |
1522 |
|
1523 |
void |
1524 |
esrv_remove_spell (player *pl, object *spell) |
1525 |
{ |
1526 |
if (!pl->ns->monitor_spells) |
1527 |
return; |
1528 |
|
1529 |
if (!pl || !spell || spell->env != pl->ob) |
1530 |
{ |
1531 |
LOG (llevError, "Invalid call to esrv_remove_spell"); |
1532 |
return; |
1533 |
} |
1534 |
|
1535 |
packet sl ("delspell"); |
1536 |
|
1537 |
sl << uint32 (spell->count); |
1538 |
|
1539 |
pl->ns->send_packet (sl); |
1540 |
} |
1541 |
|
1542 |
/* appends the spell *spell to the Socklist we will send the data to. */ |
1543 |
static void |
1544 |
append_spell (player *pl, packet &sl, object *spell) |
1545 |
{ |
1546 |
int i, skill = 0; |
1547 |
|
1548 |
if (!(spell->name)) |
1549 |
{ |
1550 |
LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
1551 |
return; |
1552 |
} |
1553 |
|
1554 |
/* store costs and damage in the object struct, to compare to later */ |
1555 |
spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1556 |
spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1557 |
spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1558 |
|
1559 |
/* figure out which skill it uses, if it uses one */ |
1560 |
if (spell->skill) |
1561 |
{ |
1562 |
for (i = 1; i < NUM_SKILLS; i++) |
1563 |
if (!strcmp (spell->skill, skill_names[i])) |
1564 |
{ |
1565 |
skill = i + CS_STAT_SKILLINFO; |
1566 |
break; |
1567 |
} |
1568 |
} |
1569 |
|
1570 |
// spells better have a face |
1571 |
if (!spell->face) |
1572 |
{ |
1573 |
LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1574 |
spell->face = face_find ("burnout.x11", blank_face); |
1575 |
} |
1576 |
|
1577 |
/* send the current values */ |
1578 |
sl << uint32 (spell->count) |
1579 |
<< uint16 (spell->level) |
1580 |
<< uint16 (spell->casting_time) |
1581 |
<< uint16 (spell->last_sp) |
1582 |
<< uint16 (spell->last_grace) |
1583 |
<< uint16 (spell->last_eat) |
1584 |
<< uint8 (skill) |
1585 |
<< uint32 (spell->path_attuned) |
1586 |
<< uint32 (spell->face) |
1587 |
<< data8 (spell->name) |
1588 |
<< data16 (spell->msg); |
1589 |
} |
1590 |
|
1591 |
/** |
1592 |
* This tells the client to add the spell *ob, if *ob is NULL, then add |
1593 |
* all spells in the player's inventory. |
1594 |
*/ |
1595 |
void |
1596 |
esrv_add_spells (player *pl, object *spell) |
1597 |
{ |
1598 |
if (!pl) |
1599 |
{ |
1600 |
LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); |
1601 |
return; |
1602 |
} |
1603 |
|
1604 |
if (!pl->ns->monitor_spells) |
1605 |
return; |
1606 |
|
1607 |
packet sl ("addspell"); |
1608 |
|
1609 |
if (!spell) |
1610 |
{ |
1611 |
for (spell = pl->ob->inv; spell; spell = spell->below) |
1612 |
{ |
1613 |
/* were we to simply keep appending data here, we could exceed |
1614 |
* MAXSOCKBUF if the player has enough spells to add, we know that |
1615 |
* append_spells will always append 19 data bytes, plus 4 length |
1616 |
* bytes and 3 strings (because that is the spec) so we need to |
1617 |
* check that the length of those 3 strings, plus the 23 bytes, |
1618 |
* won't take us over the length limit for the socket, if it does, |
1619 |
* we need to send what we already have, and restart packet formation |
1620 |
*/ |
1621 |
/* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1622 |
* to show add_spell is 26 bytes + 2 strings. However, the overun |
1623 |
* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
1624 |
* like it will fix this |
1625 |
*/ |
1626 |
if (spell->type != SPELL) |
1627 |
continue; |
1628 |
|
1629 |
if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
1630 |
{ |
1631 |
pl->ns->send_packet (sl); |
1632 |
|
1633 |
sl.reset (); |
1634 |
sl << "addspell "; |
1635 |
} |
1636 |
|
1637 |
append_spell (pl, sl, spell); |
1638 |
} |
1639 |
} |
1640 |
else if (spell->type != SPELL) |
1641 |
{ |
1642 |
LOG (llevError, "Asked to send a non-spell object as a spell"); |
1643 |
return; |
1644 |
} |
1645 |
else |
1646 |
append_spell (pl, sl, spell); |
1647 |
|
1648 |
if (sl.length () >= MAXSOCKBUF) |
1649 |
{ |
1650 |
LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
1651 |
fatal (0); |
1652 |
} |
1653 |
|
1654 |
/* finally, we can send the packet */ |
1655 |
pl->ns->send_packet (sl); |
1656 |
} |
1657 |
|