1 |
/* |
2 |
CrossFire, A Multiplayer game for X-windows |
3 |
|
4 |
Copyright (C) 2001 Mark Wedel |
5 |
Copyright (C) 1992 Frank Tore Johansen |
6 |
|
7 |
This program is free software; you can redistribute it and/or modify |
8 |
it under the terms of the GNU General Public License as published by |
9 |
the Free Software Foundation; either version 2 of the License, or |
10 |
(at your option) any later version. |
11 |
|
12 |
This program is distributed in the hope that it will be useful, |
13 |
but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 |
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 |
GNU General Public License for more details. |
16 |
|
17 |
You should have received a copy of the GNU General Public License |
18 |
along with this program; if not, write to the Free Software |
19 |
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 |
|
21 |
The author can be reached via e-mail to <crossfire@schmorp.de> |
22 |
*/ |
23 |
|
24 |
/** |
25 |
* \file |
26 |
* Client handling. |
27 |
* |
28 |
* \date 2003-12-02 |
29 |
* |
30 |
* This file implements all of the goo on the server side for handling |
31 |
* clients. It's got a bunch of global variables for keeping track of |
32 |
* each of the clients. |
33 |
* |
34 |
* Note: All functions that are used to process data from the client |
35 |
* have the prototype of (char *data, int datalen, int client_num). This |
36 |
* way, we can use one dispatch table. |
37 |
* |
38 |
* esrv_map_new starts updating the map |
39 |
* |
40 |
* esrv_map_setbelow allows filling in all of the faces for the map. |
41 |
* if a face has not already been sent to the client, it is sent now. |
42 |
* |
43 |
*/ |
44 |
|
45 |
#include <global.h> |
46 |
#include <sproto.h> |
47 |
|
48 |
#include <living.h> |
49 |
#include <commands.h> |
50 |
|
51 |
/* This block is basically taken from socket.c - I assume if it works there, |
52 |
* it should work here. |
53 |
*/ |
54 |
#include <sys/types.h> |
55 |
#include <sys/time.h> |
56 |
#include <sys/socket.h> |
57 |
#include <netinet/in.h> |
58 |
#include <netdb.h> |
59 |
|
60 |
#include <unistd.h> |
61 |
#include <sys/time.h> |
62 |
|
63 |
#include "sounds.h" |
64 |
|
65 |
/** |
66 |
* This table translates the attack numbers as used within the |
67 |
* program to the value we use when sending STATS command to the |
68 |
* client. If a value is -1, then we don't send that to the |
69 |
* client. |
70 |
*/ |
71 |
short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS, |
72 |
CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC, |
73 |
CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID, |
74 |
CS_STAT_RES_DRAIN, -1 /* weaponmagic */ , |
75 |
CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON, |
76 |
CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD, |
77 |
CS_STAT_RES_FEAR, -1 /* Cancellation */ , |
78 |
CS_STAT_RES_DEPLETE, CS_STAT_RES_DEATH, |
79 |
-1 /* Chaos */ , -1 /* Counterspell */ , |
80 |
-1 /* Godpower */ , CS_STAT_RES_HOLYWORD, |
81 |
CS_STAT_RES_BLIND, |
82 |
-1, /* Internal */ |
83 |
-1, /* life stealing */ |
84 |
-1 /* Disease - not fully done yet */ |
85 |
}; |
86 |
|
87 |
static void |
88 |
socket_map_scroll (client *ns, int dx, int dy) |
89 |
{ |
90 |
struct Map newmap; |
91 |
int x, y, mx, my; |
92 |
|
93 |
ns->send_packet_printf ("map_scroll %d %d", dx, dy); |
94 |
|
95 |
/* If we are using the Map1aCmd, we may in fact send |
96 |
* head information that is outside the viewable map. |
97 |
* So set the mx,my to the max value we want to |
98 |
* look for. Removed code to do so - it caused extra |
99 |
* complexities for the client, and probably doesn't make |
100 |
* that much difference in bandwidth. |
101 |
*/ |
102 |
mx = ns->mapx; |
103 |
my = ns->mapy; |
104 |
|
105 |
if (ns->mapmode == Map1aCmd) |
106 |
{ |
107 |
mx += MAX_HEAD_OFFSET; |
108 |
my += MAX_HEAD_OFFSET; |
109 |
} |
110 |
|
111 |
/* the x and y here are coordinates for the new map, i.e. if we moved |
112 |
* (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, |
113 |
* if the destination x or y coordinate is outside the viewable |
114 |
* area, we clear the values - otherwise, the old values |
115 |
* are preserved, and the check_head thinks it needs to clear them. |
116 |
*/ |
117 |
for (x = 0; x < mx; x++) |
118 |
{ |
119 |
for (y = 0; y < my; y++) |
120 |
{ |
121 |
if (x >= ns->mapx || y >= ns->mapy) |
122 |
/* clear cells outside the viewable area */ |
123 |
memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); |
124 |
else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy) |
125 |
/* clear newly visible tiles within the viewable area */ |
126 |
memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); |
127 |
else |
128 |
memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell)); |
129 |
} |
130 |
} |
131 |
|
132 |
memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); |
133 |
|
134 |
/* Make sure that the next "map1" command will be sent (even if it is |
135 |
* empty). |
136 |
*/ |
137 |
ns->sent_scroll = 1; |
138 |
} |
139 |
|
140 |
static void |
141 |
clear_map (player *pl) |
142 |
{ |
143 |
memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
144 |
|
145 |
if (pl->ns->newmapcmd == 1) |
146 |
pl->ns->send_packet ("newmap"); |
147 |
|
148 |
pl->ns->floorbox_reset (); |
149 |
} |
150 |
|
151 |
/** check for map change and send new map data */ |
152 |
static void |
153 |
check_map_change (player *pl) |
154 |
{ |
155 |
client &socket = *pl->ns; |
156 |
object *ob = pl->ob; |
157 |
char buf[MAX_BUF]; /* eauugggh */ |
158 |
|
159 |
if (socket.current_map != ob->map) |
160 |
{ |
161 |
socket.current_map = ob->map; |
162 |
|
163 |
clear_map (pl); |
164 |
|
165 |
if (socket.mapinfocmd) |
166 |
{ |
167 |
if (ob->map && ob->map->path[0]) |
168 |
{ |
169 |
int flags = 0; |
170 |
|
171 |
if (ob->map->tile_path[0]) |
172 |
flags |= 1; |
173 |
if (ob->map->tile_path[1]) |
174 |
flags |= 2; |
175 |
if (ob->map->tile_path[2]) |
176 |
flags |= 4; |
177 |
if (ob->map->tile_path[3]) |
178 |
flags |= 8; |
179 |
|
180 |
snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s", |
181 |
flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, ob->map->path); |
182 |
} |
183 |
else |
184 |
snprintf (buf, MAX_BUF, "mapinfo current"); |
185 |
|
186 |
socket.send_packet (buf); |
187 |
} |
188 |
} |
189 |
else if (socket.current_x != ob->x || socket.current_y != ob->y) |
190 |
{ |
191 |
int dx = ob->x - socket.current_x; |
192 |
int dy = ob->y - socket.current_y; |
193 |
|
194 |
if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) |
195 |
clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows |
196 |
else |
197 |
{ |
198 |
socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
199 |
socket.floorbox_reset (); |
200 |
} |
201 |
} |
202 |
|
203 |
socket.current_x = ob->x; |
204 |
socket.current_y = ob->y; |
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 = get_map_from_coord (map, &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 = get_map_from_coord (map, &dx, &dy); |
306 |
break; |
307 |
case '3': |
308 |
mapy += map->height; |
309 |
dx = 0; |
310 |
dy = map->height; |
311 |
map = get_map_from_coord (map, &dx, &dy); |
312 |
break; |
313 |
case '4': |
314 |
dx = -1; |
315 |
dy = 0; |
316 |
map = get_map_from_coord (map, &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 - easy first implementation */ |
351 |
void |
352 |
SetUp (char *buf, int len, client * ns) |
353 |
{ |
354 |
int s, slen; |
355 |
char *cmd, *param, cmdback[HUGE_BUF]; |
356 |
|
357 |
/* run through the cmds of setup |
358 |
* syntax is setup <cmdname1> <parameter> <cmdname2> <parameter> ... |
359 |
* |
360 |
* we send the status of the cmd back, or a FALSE is the cmd is the server unknown |
361 |
* The client then must sort this out |
362 |
*/ |
363 |
|
364 |
//LOG (llevInfo, "Get SetupCmd:: %s\n", buf); |
365 |
|
366 |
strcpy (cmdback, "setup"); |
367 |
for (s = 0; s < len; ) |
368 |
{ |
369 |
cmd = &buf[s]; |
370 |
|
371 |
/* find the next space, and put a null there */ |
372 |
for (; buf[s] && buf[s] != ' '; s++) |
373 |
; |
374 |
|
375 |
buf[s++] = 0; |
376 |
|
377 |
while (buf[s] == ' ') |
378 |
s++; |
379 |
|
380 |
if (s >= len) |
381 |
break; |
382 |
|
383 |
param = &buf[s]; |
384 |
|
385 |
for (; buf[s] && buf[s] != ' '; s++) |
386 |
; |
387 |
|
388 |
buf[s++] = 0; |
389 |
|
390 |
while (buf[s] == ' ') |
391 |
s++; |
392 |
|
393 |
slen = strlen (cmdback); |
394 |
safe_strcat (cmdback, " ", &slen, HUGE_BUF); |
395 |
safe_strcat (cmdback, cmd, &slen, HUGE_BUF); |
396 |
safe_strcat (cmdback, " ", &slen, HUGE_BUF); |
397 |
|
398 |
if (!strcmp (cmd, "sound")) |
399 |
{ |
400 |
ns->sound = atoi (param); |
401 |
safe_strcat (cmdback, param, &slen, HUGE_BUF); |
402 |
} |
403 |
else if (!strcmp (cmd, "exp64")) |
404 |
{ |
405 |
ns->exp64 = atoi (param); |
406 |
safe_strcat (cmdback, param, &slen, HUGE_BUF); |
407 |
} |
408 |
else if (!strcmp (cmd, "spellmon")) |
409 |
{ |
410 |
ns->monitor_spells = atoi (param); |
411 |
safe_strcat (cmdback, param, &slen, HUGE_BUF); |
412 |
} |
413 |
else if (!strcmp (cmd, "darkness")) |
414 |
{ |
415 |
ns->darkness = atoi (param); |
416 |
safe_strcat (cmdback, param, &slen, HUGE_BUF); |
417 |
} |
418 |
else if (!strcmp (cmd, "map1cmd")) |
419 |
{ |
420 |
if (atoi (param)) |
421 |
ns->mapmode = Map1Cmd; |
422 |
/* if beyond this size, need to use map1cmd no matter what */ |
423 |
if (ns->mapx > 11 || ns->mapy > 11) |
424 |
ns->mapmode = Map1Cmd; |
425 |
safe_strcat (cmdback, ns->mapmode == Map1Cmd ? "1" : "0", &slen, HUGE_BUF); |
426 |
} |
427 |
else if (!strcmp (cmd, "map1acmd")) |
428 |
{ |
429 |
if (atoi (param)) |
430 |
ns->mapmode = Map1aCmd; |
431 |
/* if beyond this size, need to use map1acmd no matter what */ |
432 |
if (ns->mapx > 11 || ns->mapy > 11) |
433 |
ns->mapmode = Map1aCmd; |
434 |
safe_strcat (cmdback, ns->mapmode == Map1aCmd ? "1" : "0", &slen, HUGE_BUF); |
435 |
} |
436 |
else if (!strcmp (cmd, "newmapcmd")) |
437 |
{ |
438 |
ns->newmapcmd = atoi (param); |
439 |
safe_strcat (cmdback, param, &slen, HUGE_BUF); |
440 |
// } else if (!strcmp(cmd,"plugincmd")) { |
441 |
// ns->plugincmd = atoi(param); |
442 |
// safe_strcat(cmdback, param, &slen, HUGE_BUF); |
443 |
} |
444 |
else if (!strcmp (cmd, "mapinfocmd")) |
445 |
{ |
446 |
ns->mapinfocmd = atoi (param); |
447 |
safe_strcat (cmdback, "1", &slen, HUGE_BUF); |
448 |
} |
449 |
else if (!strcmp (cmd, "extcmd")) |
450 |
{ |
451 |
ns->extcmd = atoi (param); |
452 |
safe_strcat (cmdback, "1", &slen, HUGE_BUF); |
453 |
} |
454 |
else if (!strcmp (cmd, "extmap")) |
455 |
{ |
456 |
ns->extmap = atoi (param); |
457 |
safe_strcat (cmdback, "1", &slen, HUGE_BUF); |
458 |
} |
459 |
else if (!strcmp (cmd, "facecache")) |
460 |
{ |
461 |
ns->facecache = atoi (param); |
462 |
safe_strcat (cmdback, param, &slen, HUGE_BUF); |
463 |
} |
464 |
else if (!strcmp (cmd, "faceset")) |
465 |
{ |
466 |
char tmpbuf[20]; |
467 |
int q = atoi (param); |
468 |
|
469 |
if (is_valid_faceset (q)) |
470 |
ns->faceset = q; |
471 |
sprintf (tmpbuf, "%d", ns->faceset); |
472 |
safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
473 |
/* if the client is using faceset, it knows about image2 command */ |
474 |
ns->image2 = 1; |
475 |
} |
476 |
else if (!strcmp (cmd, "itemcmd")) |
477 |
{ |
478 |
/* Version of the item protocol command to use. Currently, |
479 |
* only supported versions are 1 and 2. Using a numeric |
480 |
* value will make it very easy to extend this in the future. |
481 |
*/ |
482 |
char tmpbuf[20]; |
483 |
int q = atoi (param); |
484 |
|
485 |
if (q < 1 || q > 2) |
486 |
{ |
487 |
strcpy (tmpbuf, "FALSE"); |
488 |
} |
489 |
else |
490 |
{ |
491 |
ns->itemcmd = q; |
492 |
sprintf (tmpbuf, "%d", ns->itemcmd); |
493 |
} |
494 |
safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
495 |
} |
496 |
else if (!strcmp (cmd, "mapsize")) |
497 |
{ |
498 |
int x, y = 0; |
499 |
char tmpbuf[MAX_BUF], *cp; |
500 |
|
501 |
x = atoi (param); |
502 |
for (cp = param; *cp != 0; cp++) |
503 |
if (*cp == 'x' || *cp == 'X') |
504 |
{ |
505 |
y = atoi (cp + 1); |
506 |
break; |
507 |
} |
508 |
if (x < 9 || y < 9 || x > MAP_CLIENT_X || y > MAP_CLIENT_Y) |
509 |
{ |
510 |
sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y); |
511 |
safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
512 |
} |
513 |
else |
514 |
{ |
515 |
ns->mapx = x; |
516 |
ns->mapy = y; |
517 |
/* better to send back what we are really using and not the |
518 |
* param as given to us in case it gets parsed differently. |
519 |
*/ |
520 |
sprintf (tmpbuf, "%dx%d", x, y); |
521 |
safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
522 |
/* If beyond this size and still using orig map command, need to |
523 |
* go to map1cmd. |
524 |
*/ |
525 |
if ((x > 11 || y > 11) && ns->mapmode == Map0Cmd) |
526 |
ns->mapmode = Map1Cmd; |
527 |
} |
528 |
} |
529 |
else if (!strcmp (cmd, "extendedMapInfos")) |
530 |
{ |
531 |
/* Added by tchize |
532 |
* prepare to use the mapextended command |
533 |
*/ |
534 |
char tmpbuf[20]; |
535 |
|
536 |
ns->ext_mapinfos = (atoi (param)); |
537 |
sprintf (tmpbuf, "%d", ns->ext_mapinfos); |
538 |
safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
539 |
} |
540 |
else if (!strcmp (cmd, "extendedTextInfos")) |
541 |
{ |
542 |
/* Added by tchize |
543 |
* prepare to use the extended text commands |
544 |
* Client toggle this to non zero to get exttext |
545 |
*/ |
546 |
char tmpbuf[20]; |
547 |
|
548 |
ns->has_readable_type = (atoi (param)); |
549 |
sprintf (tmpbuf, "%d", ns->has_readable_type); |
550 |
safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
551 |
} |
552 |
else |
553 |
{ |
554 |
/* Didn't get a setup command we understood - |
555 |
* report a failure to the client. |
556 |
*/ |
557 |
safe_strcat (cmdback, "FALSE", &slen, HUGE_BUF); |
558 |
} |
559 |
} /* for processing all the setup commands */ |
560 |
|
561 |
LOG (llevInfo, "SendBack SetupCmd:: %s\n", cmdback); |
562 |
ns->send_packet (cmdback); |
563 |
} |
564 |
|
565 |
/** |
566 |
* The client has requested to be added to the game. |
567 |
* This is what takes care of it. We tell the client how things worked out. |
568 |
* I am not sure if this file is the best place for this function. however, |
569 |
* it either has to be here or init_sockets needs to be exported. |
570 |
*/ |
571 |
void |
572 |
AddMeCmd (char *buf, int len, client * ns) |
573 |
{ |
574 |
if (INVOKE_CLIENT (ADDME, ns)) |
575 |
return; |
576 |
|
577 |
if (ns->pl || add_player (ns)) |
578 |
ns->send_packet ("addme_failed"); |
579 |
else |
580 |
ns->send_packet ("addme_success"); |
581 |
} |
582 |
|
583 |
/** Reply to ExtendedInfos command */ |
584 |
void |
585 |
ToggleExtendedInfos (char *buf, int len, client * ns) |
586 |
{ |
587 |
char cmdback[MAX_BUF]; |
588 |
char command[50]; |
589 |
int info, nextinfo; |
590 |
|
591 |
cmdback[0] = '\0'; |
592 |
nextinfo = 0; |
593 |
|
594 |
while (1) |
595 |
{ |
596 |
/* 1. Extract an info */ |
597 |
info = nextinfo; |
598 |
|
599 |
while ((info < len) && (buf[info] == ' ')) |
600 |
info++; |
601 |
|
602 |
if (info >= len) |
603 |
break; |
604 |
|
605 |
nextinfo = info + 1; |
606 |
|
607 |
while ((nextinfo < len) && (buf[nextinfo] != ' ')) |
608 |
nextinfo++; |
609 |
|
610 |
if (nextinfo - info >= 49) /*Erroneous info asked */ |
611 |
continue; |
612 |
|
613 |
strncpy (command, &(buf[info]), nextinfo - info); |
614 |
|
615 |
/* 2. Interpret info */ |
616 |
if (!strcmp ("smooth", command)) |
617 |
/* Toggle smoothing */ |
618 |
ns->EMI_smooth = !ns->EMI_smooth; |
619 |
else |
620 |
/*bad value */; |
621 |
|
622 |
/*3. Next info */ |
623 |
} |
624 |
|
625 |
strcpy (cmdback, "ExtendedInfoSet"); |
626 |
|
627 |
if (ns->EMI_smooth) |
628 |
{ |
629 |
strcat (cmdback, " "); |
630 |
strcat (cmdback, "smoothing"); |
631 |
} |
632 |
|
633 |
ns->send_packet (cmdback); |
634 |
} |
635 |
|
636 |
/* |
637 |
#define MSG_TYPE_BOOK 1 |
638 |
#define MSG_TYPE_CARD 2 |
639 |
#define MSG_TYPE_PAPER 3 |
640 |
#define MSG_TYPE_SIGN 4 |
641 |
#define MSG_TYPE_MONUMENT 5 |
642 |
#define MSG_TYPE_SCRIPTED_DIALOG 6*/ |
643 |
|
644 |
/** Reply to ExtendedInfos command */ |
645 |
void |
646 |
ToggleExtendedText (char *buf, int len, client * ns) |
647 |
{ |
648 |
char cmdback[MAX_BUF]; |
649 |
char temp[10]; |
650 |
char command[50]; |
651 |
int info, nextinfo, i, flag; |
652 |
|
653 |
cmdback[0] = '\0'; |
654 |
|
655 |
nextinfo = 0; |
656 |
while (1) |
657 |
{ |
658 |
/* 1. Extract an info */ |
659 |
info = nextinfo; |
660 |
|
661 |
while ((info < len) && (buf[info] == ' ')) |
662 |
info++; |
663 |
|
664 |
if (info >= len) |
665 |
break; |
666 |
|
667 |
nextinfo = info + 1; |
668 |
|
669 |
while ((nextinfo < len) && (buf[nextinfo] != ' ')) |
670 |
nextinfo++; |
671 |
|
672 |
if (nextinfo - info >= 49) /*Erroneous info asked */ |
673 |
continue; |
674 |
|
675 |
strncpy (command, &(buf[info]), nextinfo - info); |
676 |
command[nextinfo - info] = '\0'; |
677 |
/* 2. Interpret info */ |
678 |
i = sscanf (command, "%d", &flag); |
679 |
|
680 |
if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST)) |
681 |
ns->supported_readables |= (1 << flag); |
682 |
/*3. Next info */ |
683 |
} |
684 |
|
685 |
/* Send resulting state */ |
686 |
strcpy (cmdback, "ExtendedTextSet"); |
687 |
|
688 |
for (i = 0; i <= MSG_TYPE_LAST; i++) |
689 |
if (ns->supported_readables & (1 << i)) |
690 |
{ |
691 |
strcat (cmdback, " "); |
692 |
snprintf (temp, sizeof (temp), "%d", i); |
693 |
strcat (cmdback, temp); |
694 |
} |
695 |
|
696 |
ns->send_packet (cmdback); |
697 |
} |
698 |
|
699 |
/** |
700 |
* A lot like the old AskSmooth (in fact, now called by AskSmooth). |
701 |
* Basically, it makes no sense to wait for the client to request a |
702 |
* a piece of data from us that we know the client wants. So |
703 |
* if we know the client wants it, might as well push it to the |
704 |
* client. |
705 |
*/ |
706 |
static void |
707 |
SendSmooth (client *ns, uint16 face) |
708 |
{ |
709 |
uint16 smoothface; |
710 |
|
711 |
/* If we can't find a face, return and set it so we won't try to send this |
712 |
* again. |
713 |
*/ |
714 |
if ((!FindSmooth (face, &smoothface)) && (!FindSmooth (smooth_face->number, &smoothface))) |
715 |
{ |
716 |
|
717 |
LOG (llevError, "could not findsmooth for %d. Neither default (%s)\n", face, &smooth_face->name); |
718 |
ns->faces_sent[face] |= NS_FACESENT_SMOOTH; |
719 |
return; |
720 |
} |
721 |
|
722 |
if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE)) |
723 |
esrv_send_face (ns, smoothface, 0); |
724 |
|
725 |
ns->faces_sent[face] |= NS_FACESENT_SMOOTH; |
726 |
|
727 |
packet sl ("smooth"); |
728 |
|
729 |
sl << uint16 (face) |
730 |
<< uint16 (smoothface); |
731 |
|
732 |
ns->send_packet (sl); |
733 |
} |
734 |
|
735 |
/** |
736 |
* Tells client the picture it has to use |
737 |
* to smooth a picture number given as argument. |
738 |
*/ |
739 |
void |
740 |
AskSmooth (char *buf, int len, client *ns) |
741 |
{ |
742 |
SendSmooth (ns, atoi (buf)); |
743 |
} |
744 |
|
745 |
/** |
746 |
* This handles the general commands from the client (ie, north, fire, cast, |
747 |
* etc.) |
748 |
*/ |
749 |
void |
750 |
PlayerCmd (char *buf, int len, player *pl) |
751 |
{ |
752 |
/* Check if there is a count. In theory, a zero count could also be |
753 |
* sent, so check for that also. |
754 |
*/ |
755 |
if (atoi (buf) || buf[0] == '0') |
756 |
{ |
757 |
pl->count = atoi ((char *) buf); |
758 |
|
759 |
buf = strchr (buf, ' '); /* advance beyond the numbers */ |
760 |
if (!buf) |
761 |
return; |
762 |
|
763 |
buf++; |
764 |
} |
765 |
|
766 |
execute_newserver_command (pl->ob, (char *) buf); |
767 |
|
768 |
/* Perhaps something better should be done with a left over count. |
769 |
* Cleaning up the input should probably be done first - all actions |
770 |
* for the command that issued the count should be done before any other |
771 |
* commands. |
772 |
*/ |
773 |
pl->count = 0; |
774 |
} |
775 |
|
776 |
|
777 |
/** |
778 |
* This handles the general commands from the client (ie, north, fire, cast, |
779 |
* etc.). It is a lot like PlayerCmd above, but is called with the |
780 |
* 'ncom' method which gives more information back to the client so it |
781 |
* can throttle. |
782 |
*/ |
783 |
void |
784 |
NewPlayerCmd (char *buf, int len, player *pl) |
785 |
{ |
786 |
if (len <= 6) |
787 |
{ |
788 |
LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); |
789 |
return; |
790 |
} |
791 |
|
792 |
uint16 cmdid = net_uint16 ((uint8 *)buf); |
793 |
sint32 repeat = net_sint32 ((uint8 *)buf + 2); |
794 |
|
795 |
/* -1 is special - no repeat, but don't update */ |
796 |
if (repeat != -1) |
797 |
pl->count = repeat; |
798 |
|
799 |
buf += 6; //len -= 6; |
800 |
|
801 |
execute_newserver_command (pl->ob, buf); |
802 |
|
803 |
/* Perhaps something better should be done with a left over count. |
804 |
* Cleaning up the input should probably be done first - all actions |
805 |
* for the command that issued the count should be done before any other |
806 |
* commands. |
807 |
*/ |
808 |
pl->count = 0; |
809 |
|
810 |
//TODO: schmorp thinks whatever this calculates, it makes no sense at all |
811 |
int time = FABS (pl->ob->speed) < 0.001 |
812 |
? time = MAX_TIME * 100 |
813 |
: time = (int) (MAX_TIME / FABS (pl->ob->speed)); |
814 |
|
815 |
/* Send confirmation of command execution now */ |
816 |
packet sl ("comc"); |
817 |
sl << uint16 (cmdid) << uint32 (time); |
818 |
pl->ns->send_packet (sl); |
819 |
} |
820 |
|
821 |
/** This is a reply to a previous query. */ |
822 |
void |
823 |
ReplyCmd (char *buf, int len, client *ns) |
824 |
{ |
825 |
if (ns->state == ST_CUSTOM) |
826 |
{ |
827 |
INVOKE_CLIENT (REPLY, ns, ARG_DATA (buf, len)); |
828 |
return; |
829 |
} |
830 |
|
831 |
if (!ns->pl) |
832 |
return; //TODO: depends on the exact reply we are after |
833 |
//TODO: but right now, we always have a ns->pl |
834 |
|
835 |
player *pl = ns->pl; |
836 |
|
837 |
/* This is to synthesize how the data would be stored if it |
838 |
* was normally entered. A bit of a hack, and should be cleaned up |
839 |
* once all the X11 code is removed from the server. |
840 |
* |
841 |
* We pass 13 to many of the functions because this way they |
842 |
* think it was the carriage return that was entered, and the |
843 |
* function then does not try to do additional input. |
844 |
*/ |
845 |
snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); |
846 |
|
847 |
/* this avoids any hacking here */ |
848 |
|
849 |
switch (ns->state) |
850 |
{ |
851 |
case ST_PLAYING: |
852 |
LOG (llevError, "Got reply message with ST_PLAYING input state\n"); |
853 |
break; |
854 |
|
855 |
case ST_PLAY_AGAIN: |
856 |
/* We can check this for return value (2==quit). Maybe we |
857 |
* should, and do something appropriate? |
858 |
*/ |
859 |
receive_play_again (pl->ob, buf[0]); |
860 |
break; |
861 |
|
862 |
case ST_ROLL_STAT: |
863 |
key_roll_stat (pl->ob, buf[0]); |
864 |
break; |
865 |
|
866 |
case ST_CHANGE_CLASS: |
867 |
key_change_class (pl->ob, buf[0]); |
868 |
break; |
869 |
|
870 |
case ST_CONFIRM_QUIT: |
871 |
key_confirm_quit (pl->ob, buf[0]); |
872 |
break; |
873 |
|
874 |
case ST_CONFIGURE: |
875 |
LOG (llevError, "In client input handling, but into configure state\n"); |
876 |
ns->state = ST_PLAYING; |
877 |
break; |
878 |
|
879 |
case ST_GET_NAME: |
880 |
receive_player_name (pl->ob, 13); |
881 |
break; |
882 |
|
883 |
case ST_GET_PASSWORD: |
884 |
case ST_CONFIRM_PASSWORD: |
885 |
receive_player_password (pl->ob, 13); |
886 |
break; |
887 |
|
888 |
case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
889 |
receive_party_password (pl->ob, 13); |
890 |
break; |
891 |
|
892 |
default: |
893 |
LOG (llevError, "Unknown input state: %d\n", ns->state); |
894 |
} |
895 |
} |
896 |
|
897 |
/** |
898 |
* Client tells its version. If there is a mismatch, we close the |
899 |
* socket. In real life, all we should care about is the client having |
900 |
* something older than the server. If we assume the client will be |
901 |
* backwards compatible, having it be a later version should not be a |
902 |
* problem. |
903 |
*/ |
904 |
void |
905 |
VersionCmd (char *buf, int len, client * ns) |
906 |
{ |
907 |
if (!buf) |
908 |
{ |
909 |
LOG (llevError, "CS: received corrupted version command\n"); |
910 |
return; |
911 |
} |
912 |
|
913 |
ns->cs_version = atoi (buf); |
914 |
ns->sc_version = ns->cs_version; |
915 |
|
916 |
LOG (llevDebug, "connection from client <%s>\n", buf); |
917 |
|
918 |
|
919 |
//TODO: should log here just for statistics |
920 |
|
921 |
//if (VERSION_CS != ns->cs_version) |
922 |
// unchecked; |
923 |
|
924 |
char *cp = strchr (buf + 1, ' '); |
925 |
if (!cp) |
926 |
return; |
927 |
|
928 |
ns->sc_version = atoi (cp); |
929 |
|
930 |
//if (VERSION_SC != ns->sc_version) |
931 |
// unchecked; |
932 |
|
933 |
cp = strchr (cp + 1, ' '); |
934 |
|
935 |
if (cp) |
936 |
{ |
937 |
assign (ns->version, cp + 1); |
938 |
|
939 |
if (ns->sc_version < 1026) |
940 |
ns->send_packet_printf ("drawinfo %d %s", NDI_RED, |
941 |
"**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); |
942 |
} |
943 |
} |
944 |
|
945 |
/** sound related functions. */ |
946 |
void |
947 |
SetSound (char *buf, int len, client * ns) |
948 |
{ |
949 |
ns->sound = atoi (buf); |
950 |
} |
951 |
|
952 |
/** client wants the map resent */ |
953 |
|
954 |
void |
955 |
MapRedrawCmd (char *buf, int len, player *pl) |
956 |
{ |
957 |
/* This function is currently disabled; just clearing the map state results in |
958 |
* display errors. It should clear the cache and send a newmap command. |
959 |
* Unfortunately this solution does not work because some client versions send |
960 |
* a mapredraw command after receiving a newmap command. |
961 |
*/ |
962 |
} |
963 |
|
964 |
/** |
965 |
* Moves an object (typically, container to inventory). |
966 |
* syntax is: move (to) (tag) (nrof) |
967 |
*/ |
968 |
void |
969 |
MoveCmd (char *buf, int len, player *pl) |
970 |
{ |
971 |
int vals[3], i; |
972 |
|
973 |
/* A little funky here. We only cycle for 2 records, because |
974 |
* we obviously are not going to find a space after the third |
975 |
* record. Perhaps we should just replace this with a |
976 |
* sscanf? |
977 |
*/ |
978 |
for (i = 0; i < 2; i++) |
979 |
{ |
980 |
vals[i] = atoi (buf); |
981 |
|
982 |
if (!(buf = strchr (buf, ' '))) |
983 |
{ |
984 |
LOG (llevError, "Incomplete move command: %s\n", buf); |
985 |
return; |
986 |
} |
987 |
|
988 |
buf++; |
989 |
} |
990 |
|
991 |
vals[2] = atoi (buf); |
992 |
|
993 |
/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ |
994 |
esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); |
995 |
} |
996 |
|
997 |
/****************************************************************************** |
998 |
* |
999 |
* Start of commands the server sends to the client. |
1000 |
* |
1001 |
******************************************************************************/ |
1002 |
|
1003 |
/** |
1004 |
* Asks the client to query the user. This way, the client knows |
1005 |
* it needs to send something back (vs just printing out a message) |
1006 |
*/ |
1007 |
void |
1008 |
send_query (client *ns, uint8 flags, char *text) |
1009 |
{ |
1010 |
ns->send_packet_printf ("query %d %s", flags, text ? text : ""); |
1011 |
} |
1012 |
|
1013 |
#define AddIfInt64(Old,New,Type) if (Old != New) {\ |
1014 |
Old = New; \ |
1015 |
sl << uint8 (Type) << uint64 (New); \ |
1016 |
} |
1017 |
|
1018 |
#define AddIfInt(Old,New,Type) if (Old != New) {\ |
1019 |
Old = New; \ |
1020 |
sl << uint8 (Type) << uint32 (New); \ |
1021 |
} |
1022 |
|
1023 |
#define AddIfShort(Old,New,Type) if (Old != New) {\ |
1024 |
Old = New; \ |
1025 |
sl << uint8 (Type) << uint16 (New); \ |
1026 |
} |
1027 |
|
1028 |
#define AddIfFloat(Old,New,Type) if (Old != New) {\ |
1029 |
Old = New; \ |
1030 |
sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \ |
1031 |
} |
1032 |
|
1033 |
#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ |
1034 |
free(Old); Old = strdup (New);\ |
1035 |
sl << uint8 (Type) << data8 (New); \ |
1036 |
} |
1037 |
|
1038 |
/** |
1039 |
* Sends a statistics update. We look at the old values, |
1040 |
* and only send what has changed. Stat mapping values are in newclient.h |
1041 |
* Since this gets sent a lot, this is actually one of the few binary |
1042 |
* commands for now. |
1043 |
*/ |
1044 |
void |
1045 |
esrv_update_stats (player *pl) |
1046 |
{ |
1047 |
char buf[MAX_BUF]; |
1048 |
uint16 flags; |
1049 |
|
1050 |
packet sl ("stats"); |
1051 |
|
1052 |
if (pl->ob) |
1053 |
{ |
1054 |
AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); |
1055 |
AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); |
1056 |
AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); |
1057 |
AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); |
1058 |
AddIfShort (pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE); |
1059 |
AddIfShort (pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE); |
1060 |
AddIfShort (pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR); |
1061 |
AddIfShort (pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT); |
1062 |
AddIfShort (pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW); |
1063 |
AddIfShort (pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS); |
1064 |
AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); |
1065 |
AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); |
1066 |
AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); |
1067 |
} |
1068 |
|
1069 |
if (pl->ns->exp64) |
1070 |
for (int s = 0; s < NUM_SKILLS; s++) |
1071 |
if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) |
1072 |
{ |
1073 |
/* Always send along the level if exp changes. This is only |
1074 |
* 1 extra byte, but keeps processing simpler. |
1075 |
*/ |
1076 |
sl << uint8 (s + CS_STAT_SKILLINFO) |
1077 |
<< uint8 (pl->last_skill_ob[s]->level) |
1078 |
<< uint64 (pl->last_skill_ob[s]->stats.exp); |
1079 |
|
1080 |
pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; |
1081 |
} |
1082 |
|
1083 |
if (pl->ns->exp64) |
1084 |
{ AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } |
1085 |
else |
1086 |
{ AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) } |
1087 |
|
1088 |
AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); |
1089 |
AddIfShort (pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC); |
1090 |
AddIfShort (pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC); |
1091 |
AddIfShort (pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM); |
1092 |
AddIfFloat (pl->last_speed, pl->ob->speed, CS_STAT_SPEED); |
1093 |
AddIfShort (pl->last_stats.food, pl->ob->stats.food, CS_STAT_FOOD); |
1094 |
AddIfFloat (pl->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); |
1095 |
AddIfInt (pl->last_weight_limit, (sint32) weight_limit[pl->ob->stats.Str], CS_STAT_WEIGHT_LIM); |
1096 |
flags = 0; |
1097 |
|
1098 |
if (pl->fire_on) |
1099 |
flags |= SF_FIREON; |
1100 |
|
1101 |
if (pl->run_on) |
1102 |
flags |= SF_RUNON; |
1103 |
|
1104 |
AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); |
1105 |
|
1106 |
if (pl->ns->sc_version < 1025) |
1107 |
{ AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } |
1108 |
else |
1109 |
for (int i = 0; i < NROFATTACKS; i++) |
1110 |
{ |
1111 |
/* Skip ones we won't send */ |
1112 |
if (atnr_cs_stat[i] == -1) |
1113 |
continue; |
1114 |
|
1115 |
AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); |
1116 |
} |
1117 |
|
1118 |
if (pl->ns->monitor_spells) |
1119 |
{ |
1120 |
AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
1121 |
AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); |
1122 |
AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); |
1123 |
} |
1124 |
|
1125 |
rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */ |
1126 |
AddIfString (pl->ns->stats.range, buf, CS_STAT_RANGE); |
1127 |
set_title (pl->ob, buf); |
1128 |
AddIfString (pl->ns->stats.title, buf, CS_STAT_TITLE); |
1129 |
|
1130 |
/* Only send it away if we have some actual data */ |
1131 |
if (sl.length () > 6) |
1132 |
pl->ns->send_packet (sl); |
1133 |
} |
1134 |
|
1135 |
/** |
1136 |
* Tells the client that here is a player it should start using. |
1137 |
*/ |
1138 |
void |
1139 |
esrv_new_player (player *pl, uint32 weight) |
1140 |
{ |
1141 |
pl->last_weight = weight; |
1142 |
|
1143 |
packet sl ("player"); |
1144 |
|
1145 |
sl << uint32 (pl->ob->count) |
1146 |
<< uint32 (weight) |
1147 |
<< uint32 (pl->ob->face->number) |
1148 |
<< data8 (pl->ob->name); |
1149 |
|
1150 |
pl->ns->send_packet (sl); |
1151 |
SET_FLAG (pl->ob, FLAG_CLIENT_SENT); |
1152 |
} |
1153 |
|
1154 |
/** |
1155 |
* Need to send an animation sequence to the client. |
1156 |
* We will send appropriate face commands to the client if we haven't |
1157 |
* sent them the face yet (this can become quite costly in terms of |
1158 |
* how much we are sending - on the other hand, this should only happen |
1159 |
* when the player logs in and picks stuff up. |
1160 |
*/ |
1161 |
void |
1162 |
esrv_send_animation (client * ns, short anim_num) |
1163 |
{ |
1164 |
/* Do some checking on the anim_num we got. Note that the animations |
1165 |
* are added in contigous order, so if the number is in the valid |
1166 |
* range, it must be a valid animation. |
1167 |
*/ |
1168 |
if (anim_num < 0 || anim_num > num_animations) |
1169 |
{ |
1170 |
LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); |
1171 |
return; |
1172 |
} |
1173 |
|
1174 |
packet sl ("anim"); |
1175 |
|
1176 |
sl << uint16 (anim_num) |
1177 |
<< uint16 (0); /* flags - not used right now */ |
1178 |
|
1179 |
/* Build up the list of faces. Also, send any information (ie, the |
1180 |
* the face itself) down to the client. |
1181 |
*/ |
1182 |
for (int i = 0; i < animations[anim_num].num_animations; i++) |
1183 |
{ |
1184 |
if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) |
1185 |
esrv_send_face (ns, animations[anim_num].faces[i], 0); |
1186 |
|
1187 |
sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ |
1188 |
} |
1189 |
|
1190 |
ns->send_packet (sl); |
1191 |
|
1192 |
ns->anims_sent[anim_num] = 1; |
1193 |
} |
1194 |
|
1195 |
|
1196 |
/****************************************************************************** |
1197 |
* |
1198 |
* Start of map related commands. |
1199 |
* |
1200 |
******************************************************************************/ |
1201 |
|
1202 |
/** |
1203 |
* This adds face_num to a map cell at x,y. If the client doesn't have |
1204 |
* the face yet, we will also send it. |
1205 |
*/ |
1206 |
static void |
1207 |
esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap) |
1208 |
{ |
1209 |
if (newmap->cells[x][y].count >= MAP_LAYERS) |
1210 |
{ |
1211 |
//TODO: one or the other, can't both have abort and return, verify and act |
1212 |
LOG (llevError, "Too many faces in map cell %d %d\n", x, y); |
1213 |
return; |
1214 |
abort (); |
1215 |
} |
1216 |
|
1217 |
newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num; |
1218 |
newmap->cells[x][y].count++; |
1219 |
|
1220 |
if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) |
1221 |
esrv_send_face (ns, face_num, 0); |
1222 |
} |
1223 |
|
1224 |
/** Clears a map cell */ |
1225 |
static void |
1226 |
map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) |
1227 |
{ |
1228 |
cell->faces[0] = face0; |
1229 |
cell->faces[1] = face1; |
1230 |
cell->faces[2] = face2; |
1231 |
cell->count = count; |
1232 |
cell->stat_hp = 0; |
1233 |
cell->flags = 0; |
1234 |
cell->player = 0; |
1235 |
} |
1236 |
|
1237 |
#define MAX_HEAD_POS MAX(MAX_CLIENT_X, MAX_CLIENT_Y) |
1238 |
#define MAX_LAYERS 3 |
1239 |
|
1240 |
/* Using a global really isn't a good approach, but saves the over head of |
1241 |
* allocating and deallocating such a block of data each time run through, |
1242 |
* and saves the space of allocating this in the socket object when we only |
1243 |
* need it for this cycle. If the server is ever threaded, this needs to be |
1244 |
* re-examined. |
1245 |
*/ |
1246 |
static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; |
1247 |
|
1248 |
/** |
1249 |
* Returns true if any of the heads for this |
1250 |
* space is set. Returns false if all are blank - this is used |
1251 |
* for empty space checking. |
1252 |
*/ |
1253 |
static inline int |
1254 |
have_head (int ax, int ay) |
1255 |
{ |
1256 |
if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || |
1257 |
heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2]) |
1258 |
return 1; |
1259 |
|
1260 |
return 0; |
1261 |
} |
1262 |
|
1263 |
/** |
1264 |
* check_head is a bit simplistic version of update_space below. |
1265 |
* basically, it only checks the that the head on space ax,ay at layer |
1266 |
* needs to get sent - if so, it adds the data, sending the head |
1267 |
* if needed, and returning 1. If this no data needs to get |
1268 |
* sent, it returns zero. |
1269 |
*/ |
1270 |
static int |
1271 |
check_head (packet &sl, client &ns, int ax, int ay, int layer) |
1272 |
{ |
1273 |
short face_num; |
1274 |
|
1275 |
if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) |
1276 |
face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number; |
1277 |
else |
1278 |
face_num = 0; |
1279 |
|
1280 |
if (face_num != ns.lastmap.cells[ax][ay].faces[layer]) |
1281 |
{ |
1282 |
sl << uint16 (face_num); |
1283 |
if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE)) |
1284 |
esrv_send_face (&ns, face_num, 0); |
1285 |
|
1286 |
heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL; |
1287 |
ns.lastmap.cells[ax][ay].faces[layer] = face_num; |
1288 |
return 1; |
1289 |
} |
1290 |
|
1291 |
return 0; /* No change */ |
1292 |
} |
1293 |
|
1294 |
/** |
1295 |
* Removes the need to replicate the same code for each layer. |
1296 |
* this returns true if this space is now in fact different than |
1297 |
* it was. |
1298 |
* sl is the socklist this data is going into. |
1299 |
* ns is the socket we are working on - all the info we care |
1300 |
* about is in this socket structure, so now need not pass the |
1301 |
* entire player object. |
1302 |
* mx and my are map coordinate offsets for map mp |
1303 |
* sx and sy are the offsets into the socket structure that |
1304 |
* holds the old values. |
1305 |
* layer is the layer to update, with 2 being the floor and 0 the |
1306 |
* top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ) |
1307 |
* take. Interesting to note that before this function, the map1 function |
1308 |
* numbers the spaces differently - I think this was a leftover from |
1309 |
* the map command, where the faces stack up. Sinces that is no longer |
1310 |
* the case, it seems to make more sense to have these layer values |
1311 |
* actually match. |
1312 |
*/ |
1313 |
static int |
1314 |
update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) |
1315 |
{ |
1316 |
object *ob, *head; |
1317 |
uint16 face_num; |
1318 |
int bx, by, i; |
1319 |
|
1320 |
/* If there is a multipart object stored away, treat that as more important. |
1321 |
* If not, then do the normal processing. |
1322 |
*/ |
1323 |
head = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer]; |
1324 |
|
1325 |
/* Check to see if this head is part of the set of objects |
1326 |
* we would normally send for this space. If so, then |
1327 |
* don't use the head value. We need to do the check |
1328 |
* here and not when setting up the heads[] value for two reasons - |
1329 |
* 1) the heads[] values will get used even if the space is not visible. |
1330 |
* 2) its possible the head is not on the same map as a part, and I'd |
1331 |
* rather not need to do the map translation overhead. |
1332 |
* 3) We need to do some extra checking to make sure that we will |
1333 |
* otherwise send the image as this layer, eg, either it matches |
1334 |
* the head value, or is not multipart. |
1335 |
*/ |
1336 |
if (head && !head->more) |
1337 |
{ |
1338 |
for (i = 0; i < MAP_LAYERS; i++) |
1339 |
{ |
1340 |
ob = GET_MAP_FACE_OBJ (mp, mx, my, i); |
1341 |
if (!ob) |
1342 |
continue; |
1343 |
|
1344 |
if (ob->head) |
1345 |
ob = ob->head; |
1346 |
|
1347 |
if (ob == head) |
1348 |
{ |
1349 |
heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer] = NULL; |
1350 |
head = NULL; |
1351 |
break; |
1352 |
} |
1353 |
} |
1354 |
} |
1355 |
|
1356 |
ob = head; |
1357 |
if (!ob) |
1358 |
ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); |
1359 |
|
1360 |
/* If there is no object for this space, or if the face for the object |
1361 |
* is the blank face, set the face number to zero. |
1362 |
* else if we have the stored head object for this space, that takes |
1363 |
* precedence over the other object for this space. |
1364 |
* otherwise, we do special head processing |
1365 |
*/ |
1366 |
if (!ob || ob->face == blank_face) |
1367 |
face_num = 0; |
1368 |
else if (head) |
1369 |
{ |
1370 |
/* if this is a head that had previously been stored */ |
1371 |
face_num = ob->face->number; |
1372 |
} |
1373 |
else |
1374 |
{ |
1375 |
/* if the faces for the different parts of a multipart object |
1376 |
* are the same, we only want to send the bottom right most |
1377 |
* portion of the object. That info is in the tail_.. values |
1378 |
* of the head. Note that for the head itself, ob->head will |
1379 |
* be null, so we only do this block if we are working on |
1380 |
* a tail piece. |
1381 |
*/ |
1382 |
|
1383 |
/* tail_x and tail_y will only be set in the head object. If |
1384 |
* this is the head object and these are set, we proceed |
1385 |
* with logic to only send bottom right. Similarly, if |
1386 |
* this is one of the more parts but the head has those values |
1387 |
* set, we want to do the processing. There can be cases where |
1388 |
* the head is not visible but one of its parts is, so we just |
1389 |
* can always expect that ob->arch->tail_x will be true for all |
1390 |
* object we may want to display. |
1391 |
*/ |
1392 |
if ((ob->arch->tail_x || ob->arch->tail_y) || (ob->head && (ob->head->arch->tail_x || ob->head->arch->tail_y))) |
1393 |
{ |
1394 |
|
1395 |
if (ob->head) |
1396 |
head = ob->head; |
1397 |
else |
1398 |
head = ob; |
1399 |
|
1400 |
/* Basically figure out where the offset is from where we are right |
1401 |
* now. the ob->arch->clone.{x,y} values hold the offset that this current |
1402 |
* piece is from the head, and the tail is where the tail is from the |
1403 |
* head. Note that bx and by will equal sx and sy if we are already working |
1404 |
* on the bottom right corner. If ob is the head, the clone values |
1405 |
* will be zero, so the right thing will still happen. |
1406 |
*/ |
1407 |
bx = sx + head->arch->tail_x - ob->arch->clone.x; |
1408 |
by = sy + head->arch->tail_y - ob->arch->clone.y; |
1409 |
|
1410 |
/* I don't think this can ever happen, but better to check for it just |
1411 |
* in case. |
1412 |
*/ |
1413 |
if (bx < sx || by < sy) |
1414 |
{ |
1415 |
LOG (llevError, "update_space: bx (%d) or by (%d) is less than sx (%d) or sy (%d)\n", bx, by, sx, sy); |
1416 |
face_num = 0; |
1417 |
} |
1418 |
/* single part object, multipart object with non merged faces, |
1419 |
* of multipart object already at lower right. |
1420 |
*/ |
1421 |
else if (bx == sx && by == sy) |
1422 |
{ |
1423 |
face_num = ob->face->number; |
1424 |
|
1425 |
/* if this face matches one stored away, clear that one away. |
1426 |
* this code relies on the fact that the map1 commands |
1427 |
* goes from 2 down to 0. |
1428 |
*/ |
1429 |
for (i = 0; i < MAP_LAYERS; i++) |
1430 |
if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] && |
1431 |
heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i]->face->number == face_num) |
1432 |
heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] = NULL; |
1433 |
} |
1434 |
else |
1435 |
{ |
1436 |
/* If this head is stored away, clear it - otherwise, |
1437 |
* there can be cases where a object is on multiple layers - |
1438 |
* we only want to send it once. |
1439 |
*/ |
1440 |
face_num = head->face->number; |
1441 |
for (i = 0; i < MAP_LAYERS; i++) |
1442 |
if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] && |
1443 |
heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i]->face->number == face_num) |
1444 |
heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = NULL; |
1445 |
|
1446 |
/* First, try to put the new head on the same layer. If that is used up, |
1447 |
* then find another layer. |
1448 |
*/ |
1449 |
if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] == NULL) |
1450 |
{ |
1451 |
heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] = head; |
1452 |
} |
1453 |
else |
1454 |
for (i = 0; i < MAX_LAYERS; i++) |
1455 |
{ |
1456 |
if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == NULL || |
1457 |
heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == head) |
1458 |
{ |
1459 |
heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = head; |
1460 |
} |
1461 |
} |
1462 |
face_num = 0; /* Don't send this object - we'll send the head later */ |
1463 |
} |
1464 |
} |
1465 |
else |
1466 |
{ |
1467 |
/* In this case, we are already at the lower right or single part object, |
1468 |
* so nothing special |
1469 |
*/ |
1470 |
face_num = ob->face->number; |
1471 |
|
1472 |
/* clear out any head entries that have the same face as this one */ |
1473 |
for (bx = 0; bx < layer; bx++) |
1474 |
if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] && |
1475 |
heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx]->face->number == face_num) |
1476 |
heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] = NULL; |
1477 |
} |
1478 |
} /* else not already head object or blank face */ |
1479 |
|
1480 |
/* This is a real hack. Basically, if we have nothing to send for this layer, |
1481 |
* but there is a head on the next layer, send that instead. |
1482 |
* Without this, what happens is you can get the case where the player stands |
1483 |
* on the same space as the head. However, if you have overlapping big objects |
1484 |
* of the same type, what happens then is it doesn't think it needs to send |
1485 |
* This tends to make stacking also work/look better. |
1486 |
*/ |
1487 |
if (!face_num && layer > 0 && heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1]) |
1488 |
{ |
1489 |
face_num = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1]->face->number; |
1490 |
heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1] = NULL; |
1491 |
} |
1492 |
|
1493 |
/* Another hack - because of heads and whatnot, this face may match one |
1494 |
* we already sent for a lower layer. In that case, don't send |
1495 |
* this one. |
1496 |
*/ |
1497 |
if (face_num && layer + 1 < MAP_LAYERS && ns.lastmap.cells[sx][sy].faces[layer + 1] == face_num) |
1498 |
face_num = 0; |
1499 |
|
1500 |
/* We've gotten what face we want to use for the object. Now see if |
1501 |
* if it has changed since we last sent it to the client. |
1502 |
*/ |
1503 |
if (ns.lastmap.cells[sx][sy].faces[layer] != face_num) |
1504 |
{ |
1505 |
ns.lastmap.cells[sx][sy].faces[layer] = face_num; |
1506 |
if (!(ns.faces_sent[face_num] & NS_FACESENT_FACE)) |
1507 |
esrv_send_face (&ns, face_num, 0); |
1508 |
|
1509 |
sl << uint16 (face_num); |
1510 |
return 1; |
1511 |
} |
1512 |
|
1513 |
/* Nothing changed */ |
1514 |
return 0; |
1515 |
} |
1516 |
|
1517 |
/** |
1518 |
* This function is mainly a copy of update_space, |
1519 |
* except it handles update of the smoothing updates, |
1520 |
* not the face updates. |
1521 |
* Removes the need to replicate the same code for each layer. |
1522 |
* this returns true if this smooth is now in fact different |
1523 |
* than it was. |
1524 |
* sl is the socklist this data is going into. |
1525 |
* ns is the socket we are working on - all the info we care |
1526 |
* about is in this socket structure, so know need to pass the |
1527 |
* entire player object. |
1528 |
* mx and my are map coordinate offsets for map mp |
1529 |
* sx and sy are the offsets into the socket structure that |
1530 |
* holds the old values. |
1531 |
* layer is the layer to update, with 2 being the floor and 0 the |
1532 |
* top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ |
1533 |
* take. |
1534 |
*/ |
1535 |
|
1536 |
static inline int |
1537 |
update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) |
1538 |
{ |
1539 |
object *ob; |
1540 |
int smoothlevel; /* old face_num; */ |
1541 |
|
1542 |
ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); |
1543 |
|
1544 |
/* If there is no object for this space, or if the face for the object |
1545 |
* is the blank face, set the smoothlevel to zero. |
1546 |
*/ |
1547 |
if (!ob || ob->face == blank_face || MAP_NOSMOOTH (mp)) |
1548 |
smoothlevel = 0; |
1549 |
else |
1550 |
{ |
1551 |
smoothlevel = ob->smoothlevel; |
1552 |
if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH)) |
1553 |
SendSmooth (&ns, ob->face->number); |
1554 |
} /* else not already head object or blank face */ |
1555 |
|
1556 |
/* We've gotten what face we want to use for the object. Now see if |
1557 |
* if it has changed since we last sent it to the client. |
1558 |
*/ |
1559 |
if (smoothlevel > 255) |
1560 |
smoothlevel = 255; |
1561 |
else if (smoothlevel < 0) |
1562 |
smoothlevel = 0; |
1563 |
|
1564 |
if (ns.lastmap.cells[sx][sy].smooth[layer] != smoothlevel) |
1565 |
{ |
1566 |
ns.lastmap.cells[sx][sy].smooth[layer] = smoothlevel; |
1567 |
sl << uint8 (smoothlevel); |
1568 |
return 1; |
1569 |
} |
1570 |
|
1571 |
/* Nothing changed */ |
1572 |
return 0; |
1573 |
} |
1574 |
|
1575 |
/** |
1576 |
* Returns the size of a data for a map square as returned by |
1577 |
* mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries |
1578 |
* available. |
1579 |
*/ |
1580 |
int |
1581 |
getExtendedMapInfoSize (client * ns) |
1582 |
{ |
1583 |
int result = 0; |
1584 |
|
1585 |
if (ns->ext_mapinfos) |
1586 |
{ |
1587 |
if (ns->EMI_smooth) |
1588 |
result += 1; /*One byte for smoothlevel */ |
1589 |
} |
1590 |
|
1591 |
return result; |
1592 |
} |
1593 |
|
1594 |
/** |
1595 |
* This function uses the new map1 protocol command to send the map |
1596 |
* to the client. It is necessary because the old map command supports |
1597 |
* a maximum map size of 15x15. |
1598 |
* This function is much simpler than the old one. This is because |
1599 |
* the old function optimized to send as few face identifiers as possible, |
1600 |
* at the expense of sending more coordinate location (coordinates were |
1601 |
* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since |
1602 |
* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
1603 |
* maps no sense. Instead, we actually really only use 12 bits for coordinates, |
1604 |
* and use the other 4 bits for other informatiion. For full documentation |
1605 |
* of what we send, see the doc/Protocol file. |
1606 |
* I will describe internally what we do: |
1607 |
* the ns->lastmap shows how the map last looked when sent to the client. |
1608 |
* in the lastmap structure, there is a cells array, which is set to the |
1609 |
* maximum viewable size (As set in config.h). |
1610 |
* in the cells, there are faces and a count value. |
1611 |
* we use the count value to hold the darkness value. If -1, then this space |
1612 |
* is not viewable. |
1613 |
* we use faces[0] faces[1] faces[2] to hold what the three layers |
1614 |
* look like. |
1615 |
*/ |
1616 |
void |
1617 |
draw_client_map1 (object *pl) |
1618 |
{ |
1619 |
int x, y, ax, ay, d, startlen, max_x, max_y, oldlen; |
1620 |
sint16 nx, ny; |
1621 |
int estartlen, eoldlen; |
1622 |
uint16 mask, emask; |
1623 |
uint8 eentrysize; |
1624 |
uint16 ewhatstart, ewhatflag; |
1625 |
uint8 extendedinfos; |
1626 |
maptile *m; |
1627 |
|
1628 |
client &socket = *pl->contr->ns; |
1629 |
|
1630 |
check_map_change (pl->contr); |
1631 |
|
1632 |
packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
1633 |
packet esl; |
1634 |
|
1635 |
startlen = sl.length (); |
1636 |
|
1637 |
/*Extendedmapinfo structure initialisation */ |
1638 |
if (socket.ext_mapinfos) |
1639 |
{ |
1640 |
extendedinfos = EMI_NOREDRAW; |
1641 |
|
1642 |
if (socket.EMI_smooth) |
1643 |
extendedinfos |= EMI_SMOOTH; |
1644 |
|
1645 |
ewhatstart = esl.length (); |
1646 |
ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit |
1647 |
could need to be taken away */ |
1648 |
eentrysize = getExtendedMapInfoSize (&socket); |
1649 |
esl << "mapextended " |
1650 |
<< uint8 (extendedinfos) |
1651 |
<< uint8 (eentrysize); |
1652 |
|
1653 |
estartlen = esl.length (); |
1654 |
} |
1655 |
else |
1656 |
{ |
1657 |
/* suppress compiler warnings */ |
1658 |
ewhatstart = 0; |
1659 |
ewhatflag = 0; |
1660 |
estartlen = 0; |
1661 |
} |
1662 |
|
1663 |
/* Init data to zero */ |
1664 |
memset (heads, 0, sizeof (object *) * MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS); |
1665 |
|
1666 |
/* x,y are the real map locations. ax, ay are viewport relative |
1667 |
* locations. |
1668 |
*/ |
1669 |
ay = 0; |
1670 |
|
1671 |
/* We could do this logic as conditionals in the if statement, |
1672 |
* but that started to get a bit messy to look at. |
1673 |
*/ |
1674 |
max_x = pl->x + (socket.mapx + 1) / 2; |
1675 |
max_y = pl->y + (socket.mapy + 1) / 2; |
1676 |
|
1677 |
if (socket.mapmode == Map1aCmd) |
1678 |
{ |
1679 |
max_x += MAX_HEAD_OFFSET; |
1680 |
max_y += MAX_HEAD_OFFSET; |
1681 |
} |
1682 |
|
1683 |
for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) |
1684 |
{ |
1685 |
ax = 0; |
1686 |
for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) |
1687 |
{ |
1688 |
emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1689 |
|
1690 |
/* If this space is out of the normal viewable area, we only check |
1691 |
* the heads value ax or ay will only be greater than what |
1692 |
* the client wants if using the map1a command - this is because |
1693 |
* if the map1a command is not used, max_x and max_y will be |
1694 |
* set to lower values. |
1695 |
*/ |
1696 |
if (ax >= socket.mapx || ay >= socket.mapy) |
1697 |
{ |
1698 |
int i, got_one; |
1699 |
|
1700 |
oldlen = sl.length (); |
1701 |
|
1702 |
sl << uint16 (mask); |
1703 |
|
1704 |
if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4; |
1705 |
if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2; |
1706 |
if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1; |
1707 |
|
1708 |
/* If all we are doing is sending 0 (blank) faces, we don't |
1709 |
* actually need to send that - just the coordinates |
1710 |
* with no faces tells the client to blank out the |
1711 |
* space. |
1712 |
*/ |
1713 |
got_one = 0; |
1714 |
for (i = oldlen + 2; i < sl.length (); i++) |
1715 |
if (sl[i]) |
1716 |
got_one = 1; |
1717 |
|
1718 |
if (got_one && (mask & 0xf)) |
1719 |
sl[oldlen + 1] = mask & 0xff; |
1720 |
else |
1721 |
{ /*either all faces blank, either no face at all */ |
1722 |
if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */ |
1723 |
sl.reset (oldlen + 2); |
1724 |
else |
1725 |
sl.reset (oldlen); |
1726 |
} |
1727 |
|
1728 |
/*What concerns extendinfos, nothing to be done for now |
1729 |
* (perhaps effects layer later) |
1730 |
*/ |
1731 |
continue; /* don't do processing below */ |
1732 |
} |
1733 |
|
1734 |
MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1735 |
|
1736 |
d = pl->contr->blocked_los[ax][ay]; |
1737 |
|
1738 |
/* If the coordinates are not valid, or it is too dark to see, |
1739 |
* we tell the client as such |
1740 |
*/ |
1741 |
nx = x; |
1742 |
ny = y; |
1743 |
m = get_map_from_coord (pl->map, &nx, &ny); |
1744 |
|
1745 |
if (!m) |
1746 |
{ |
1747 |
/* space is out of map. Update space and clear values |
1748 |
* if this hasn't already been done. If the space is out |
1749 |
* of the map, it shouldn't have a head |
1750 |
*/ |
1751 |
if (lastcell.count != -1) |
1752 |
{ |
1753 |
sl << uint16 (mask); |
1754 |
map_clearcell (&lastcell, 0, 0, 0, -1); |
1755 |
} |
1756 |
} |
1757 |
else if (d > 3) |
1758 |
{ |
1759 |
int need_send = 0, count; |
1760 |
|
1761 |
/* This block deals with spaces that are not visible for whatever |
1762 |
* reason. Still may need to send the head for this space. |
1763 |
*/ |
1764 |
|
1765 |
oldlen = sl.length (); |
1766 |
|
1767 |
sl << uint16 (mask); |
1768 |
|
1769 |
if (lastcell.count != -1) |
1770 |
need_send = 1; |
1771 |
|
1772 |
count = -1; |
1773 |
|
1774 |
if (socket.mapmode == Map1aCmd && have_head (ax, ay)) |
1775 |
{ |
1776 |
/* Now check to see if any heads need to be sent */ |
1777 |
|
1778 |
if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4; |
1779 |
if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2; |
1780 |
if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1; |
1781 |
|
1782 |
lastcell.count = count; |
1783 |
} |
1784 |
else |
1785 |
{ |
1786 |
/* properly clear a previously sent big face */ |
1787 |
if (lastcell.faces[0] != 0 || lastcell.faces[1] != 0 || lastcell.faces[2] != 0 |
1788 |
|| lastcell.stat_hp || lastcell.flags || lastcell.player) |
1789 |
need_send = 1; |
1790 |
|
1791 |
map_clearcell (&lastcell, 0, 0, 0, count); |
1792 |
} |
1793 |
|
1794 |
if ((mask & 0xf) || need_send) |
1795 |
sl[oldlen + 1] = mask & 0xff; |
1796 |
else |
1797 |
sl.reset (oldlen); |
1798 |
} |
1799 |
else |
1800 |
{ |
1801 |
/* In this block, the space is visible or there are head objects |
1802 |
* we need to send. |
1803 |
*/ |
1804 |
|
1805 |
/* Rather than try to figure out what everything that we might |
1806 |
* need to send is, then form the packet after that, |
1807 |
* we presume that we will in fact form a packet, and update |
1808 |
* the bits by what we do actually send. If we send nothing, |
1809 |
* we just back out sl.length () to the old value, and no harm |
1810 |
* is done. |
1811 |
* I think this is simpler than doing a bunch of checks to see |
1812 |
* what if anything we need to send, setting the bits, then |
1813 |
* doing those checks again to add the real data. |
1814 |
*/ |
1815 |
oldlen = sl.length (); |
1816 |
mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1817 |
eoldlen = esl.length (); |
1818 |
emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1819 |
sl << uint16 (mask); |
1820 |
|
1821 |
if (socket.ext_mapinfos) |
1822 |
esl << uint16 (emask); |
1823 |
|
1824 |
unsigned char dummy; |
1825 |
unsigned char *last_ext = &dummy; |
1826 |
|
1827 |
/* Darkness changed */ |
1828 |
if (lastcell.count != d && socket.darkness) |
1829 |
{ |
1830 |
mask |= 0x8; |
1831 |
|
1832 |
if (socket.extmap) |
1833 |
{ |
1834 |
*last_ext |= 0x80; |
1835 |
last_ext = &sl[sl.length ()]; |
1836 |
sl << uint8 (d); |
1837 |
} |
1838 |
else |
1839 |
sl << uint8 (255 - 64 * d); |
1840 |
} |
1841 |
|
1842 |
lastcell.count = d; |
1843 |
|
1844 |
if (socket.extmap) |
1845 |
{ |
1846 |
uint8 stat_hp = 0; |
1847 |
uint8 stat_width = 0; |
1848 |
uint8 flags = 0; |
1849 |
UUID player = 0; |
1850 |
|
1851 |
// send hp information, if applicable |
1852 |
if (object *op = GET_MAP_FACE_OBJ (m, nx, ny, 0)) |
1853 |
{ |
1854 |
if (op->head || op->invisible) |
1855 |
; // do not show |
1856 |
else if (op->type == PLAYER |
1857 |
|| QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)) |
1858 |
{ |
1859 |
if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp) |
1860 |
{ |
1861 |
stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
1862 |
stat_width = op->arch->tail_x; |
1863 |
} |
1864 |
} |
1865 |
|
1866 |
if (op->msg && op->msg[0] == '@') |
1867 |
flags |= 1; |
1868 |
|
1869 |
if (op->type == PLAYER && op != pl) |
1870 |
player = op->count; |
1871 |
} |
1872 |
|
1873 |
if (lastcell.stat_hp != stat_hp) |
1874 |
{ |
1875 |
lastcell.stat_hp = stat_hp; |
1876 |
|
1877 |
mask |= 0x8; |
1878 |
*last_ext |= 0x80; |
1879 |
last_ext = &sl[sl.length ()]; |
1880 |
|
1881 |
sl << uint8 (5) << uint8 (stat_hp); |
1882 |
|
1883 |
if (stat_width > 1) |
1884 |
{ |
1885 |
*last_ext |= 0x80; |
1886 |
last_ext = &sl[sl.length ()]; |
1887 |
|
1888 |
sl << uint8 (6) << uint8 (stat_width); |
1889 |
} |
1890 |
} |
1891 |
|
1892 |
if (lastcell.player != player) |
1893 |
{ |
1894 |
lastcell.player = player; |
1895 |
|
1896 |
mask |= 0x8; |
1897 |
*last_ext |= 0x80; |
1898 |
last_ext = &sl[sl.length ()]; |
1899 |
|
1900 |
sl << uint8 (0x47) << uint8 (8) << (uint64)player; |
1901 |
} |
1902 |
|
1903 |
if (lastcell.flags != flags) |
1904 |
{ |
1905 |
lastcell.flags = flags; |
1906 |
|
1907 |
mask |= 0x8; |
1908 |
*last_ext |= 0x80; |
1909 |
last_ext = &sl[sl.length ()]; |
1910 |
|
1911 |
sl << uint8 (8) << uint8 (flags); |
1912 |
} |
1913 |
} |
1914 |
|
1915 |
/* Floor face */ |
1916 |
if (update_space (sl, socket, m, nx, ny, ax, ay, 2)) |
1917 |
mask |= 0x4; |
1918 |
|
1919 |
if (socket.EMI_smooth) |
1920 |
if (update_smooth (esl, socket, m, nx, ny, ax, ay, 2)) |
1921 |
emask |= 0x4; |
1922 |
|
1923 |
/* Middle face */ |
1924 |
if (update_space (sl, socket, m, nx, ny, ax, ay, 1)) |
1925 |
mask |= 0x2; |
1926 |
|
1927 |
if (socket.EMI_smooth) |
1928 |
if (update_smooth (esl, socket, m, nx, ny, ax, ay, 1)) |
1929 |
emask |= 0x2; |
1930 |
|
1931 |
if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1)) |
1932 |
{ |
1933 |
if (lastcell.faces[0] != pl->face->number) |
1934 |
{ |
1935 |
lastcell.faces[0] = pl->face->number; |
1936 |
mask |= 0x1; |
1937 |
|
1938 |
if (!(socket.faces_sent[pl->face->number] & NS_FACESENT_FACE)) |
1939 |
esrv_send_face (&socket, pl->face->number, 0); |
1940 |
|
1941 |
sl << uint16 (pl->face->number); |
1942 |
} |
1943 |
} |
1944 |
else |
1945 |
{ |
1946 |
/* Top face */ |
1947 |
if (update_space (sl, socket, m, nx, ny, ax, ay, 0)) |
1948 |
mask |= 0x1; |
1949 |
|
1950 |
if (socket.EMI_smooth) |
1951 |
if (update_smooth (esl, socket, m, nx, ny, ax, ay, 0)) |
1952 |
emask |= 0x1; |
1953 |
} |
1954 |
|
1955 |
/* Check to see if we are in fact sending anything for this |
1956 |
* space by checking the mask. If so, update the mask. |
1957 |
* if not, reset the len to that from before adding the mask |
1958 |
* value, so we don't send those bits. |
1959 |
*/ |
1960 |
if (mask & 0xf) |
1961 |
sl[oldlen + 1] = mask & 0xff; |
1962 |
else |
1963 |
sl.reset (oldlen); |
1964 |
|
1965 |
if (emask & 0xf) |
1966 |
esl[eoldlen + 1] = emask & 0xff; |
1967 |
else |
1968 |
esl.reset (eoldlen); |
1969 |
} /* else this is a viewable space */ |
1970 |
} /* for x loop */ |
1971 |
} /* for y loop */ |
1972 |
|
1973 |
/* Verify that we in fact do need to send this */ |
1974 |
if (socket.ext_mapinfos) |
1975 |
{ |
1976 |
if (!(sl.length () > startlen || socket.sent_scroll)) |
1977 |
{ |
1978 |
/* No map data will follow, so don't say the client |
1979 |
* it doesn't need draw! |
1980 |
*/ |
1981 |
ewhatflag &= (~EMI_NOREDRAW); |
1982 |
esl[ewhatstart + 1] = ewhatflag & 0xff; |
1983 |
} |
1984 |
|
1985 |
if (esl.length () > estartlen) |
1986 |
socket.send_packet (esl); |
1987 |
} |
1988 |
|
1989 |
if (sl.length () > startlen || socket.sent_scroll) |
1990 |
{ |
1991 |
socket.send_packet (sl); |
1992 |
socket.sent_scroll = 0; |
1993 |
} |
1994 |
} |
1995 |
|
1996 |
/** |
1997 |
* Draws client map. |
1998 |
*/ |
1999 |
void |
2000 |
draw_client_map (object *pl) |
2001 |
{ |
2002 |
int i, j; |
2003 |
sint16 ax, ay, nx, ny; /* ax and ay goes from 0 to max-size of arrays */ |
2004 |
New_Face *face, *floor; |
2005 |
New_Face *floor2; |
2006 |
int d, mflags; |
2007 |
struct Map newmap; |
2008 |
maptile *m, *pm; |
2009 |
|
2010 |
if (pl->type != PLAYER) |
2011 |
{ |
2012 |
LOG (llevError, "draw_client_map called with non player/non eric-server\n"); |
2013 |
return; |
2014 |
} |
2015 |
|
2016 |
pm = pl->map; |
2017 |
|
2018 |
/* If player is just joining the game, he isn't here yet, so the map |
2019 |
* can get swapped out. If so, don't try to send them a map. All will |
2020 |
* be OK once they really log in. |
2021 |
*/ |
2022 |
if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) |
2023 |
return; |
2024 |
|
2025 |
memset (&newmap, 0, sizeof (struct Map)); |
2026 |
|
2027 |
for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++) |
2028 |
for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++) |
2029 |
{ |
2030 |
ax = i; |
2031 |
ay = j; |
2032 |
m = pm; |
2033 |
mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); |
2034 |
|
2035 |
if (mflags & P_OUT_OF_MAP) |
2036 |
continue; |
2037 |
|
2038 |
/* If a map is visible to the player, we don't want to swap it out |
2039 |
* just to reload it. This should really call something like |
2040 |
* swap_map, but this is much more efficient and 'good enough' |
2041 |
*/ |
2042 |
if (mflags & P_NEW_MAP) |
2043 |
m->timeout = 50; |
2044 |
} |
2045 |
|
2046 |
/* do LOS after calls to update_position */ |
2047 |
if (pl->contr->do_los) |
2048 |
{ |
2049 |
update_los (pl); |
2050 |
pl->contr->do_los = 0; |
2051 |
} |
2052 |
|
2053 |
/* Big maps need a different drawing mechanism to work */ |
2054 |
draw_client_map1 (pl); |
2055 |
} |
2056 |
|
2057 |
|
2058 |
/*****************************************************************************/ |
2059 |
|
2060 |
/* GROS: The following one is used to allow a plugin to send a generic cmd to*/ |
2061 |
|
2062 |
/* a player. Of course, the client need to know the command to be able to */ |
2063 |
|
2064 |
/* manage it ! */ |
2065 |
|
2066 |
/*****************************************************************************/ |
2067 |
void |
2068 |
send_plugin_custom_message (object *pl, char *buf) |
2069 |
{ |
2070 |
pl->contr->ns->send_packet (buf); |
2071 |
} |
2072 |
|
2073 |
/** |
2074 |
* This sends the skill number to name mapping. We ignore |
2075 |
* the params - we always send the same info no matter what. |
2076 |
*/ |
2077 |
void |
2078 |
send_skill_info (client *ns, char *params) |
2079 |
{ |
2080 |
packet sl; |
2081 |
sl << "replyinfo skill_info\n"; |
2082 |
|
2083 |
for (int i = 1; i < NUM_SKILLS; i++) |
2084 |
sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); |
2085 |
|
2086 |
if (sl.length () >= MAXSOCKBUF) |
2087 |
{ |
2088 |
LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
2089 |
fatal (0); |
2090 |
} |
2091 |
|
2092 |
ns->send_packet (sl); |
2093 |
} |
2094 |
|
2095 |
/** |
2096 |
* This sends the spell path to name mapping. We ignore |
2097 |
* the params - we always send the same info no matter what. |
2098 |
*/ |
2099 |
void |
2100 |
send_spell_paths (client * ns, char *params) |
2101 |
{ |
2102 |
packet sl; |
2103 |
|
2104 |
sl << "replyinfo spell_paths\n"; |
2105 |
|
2106 |
for (int i = 0; i < NRSPELLPATHS; i++) |
2107 |
sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
2108 |
|
2109 |
if (sl.length () >= MAXSOCKBUF) |
2110 |
{ |
2111 |
LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
2112 |
fatal (0); |
2113 |
} |
2114 |
|
2115 |
ns->send_packet (sl); |
2116 |
} |
2117 |
|
2118 |
/** |
2119 |
* This looks for any spells the player may have that have changed their stats. |
2120 |
* it then sends an updspell packet for each spell that has changed in this way |
2121 |
*/ |
2122 |
void |
2123 |
esrv_update_spells (player *pl) |
2124 |
{ |
2125 |
if (!pl->ns->monitor_spells) |
2126 |
return; |
2127 |
|
2128 |
for (object *spell = pl->ob->inv; spell; spell = spell->below) |
2129 |
{ |
2130 |
if (spell->type == SPELL) |
2131 |
{ |
2132 |
int flags = 0; |
2133 |
|
2134 |
/* check if we need to update it */ |
2135 |
if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) |
2136 |
{ |
2137 |
spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
2138 |
flags |= UPD_SP_MANA; |
2139 |
} |
2140 |
|
2141 |
if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) |
2142 |
{ |
2143 |
spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
2144 |
flags |= UPD_SP_GRACE; |
2145 |
} |
2146 |
|
2147 |
if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) |
2148 |
{ |
2149 |
spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
2150 |
flags |= UPD_SP_DAMAGE; |
2151 |
} |
2152 |
|
2153 |
if (flags) |
2154 |
{ |
2155 |
packet sl; |
2156 |
|
2157 |
sl << "updspell " |
2158 |
<< uint8 (flags) |
2159 |
<< uint32 (spell->count); |
2160 |
|
2161 |
if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); |
2162 |
if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); |
2163 |
if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); |
2164 |
|
2165 |
pl->ns->send_packet (sl); |
2166 |
} |
2167 |
} |
2168 |
} |
2169 |
} |
2170 |
|
2171 |
void |
2172 |
esrv_remove_spell (player *pl, object *spell) |
2173 |
{ |
2174 |
if (!pl->ns->monitor_spells) |
2175 |
return; |
2176 |
|
2177 |
if (!pl || !spell || spell->env != pl->ob) |
2178 |
{ |
2179 |
LOG (llevError, "Invalid call to esrv_remove_spell"); |
2180 |
return; |
2181 |
} |
2182 |
|
2183 |
packet sl ("delspell"); |
2184 |
|
2185 |
sl << uint32 (spell->count); |
2186 |
|
2187 |
pl->ns->send_packet (sl); |
2188 |
} |
2189 |
|
2190 |
/* appends the spell *spell to the Socklist we will send the data to. */ |
2191 |
static void |
2192 |
append_spell (player *pl, packet &sl, object *spell) |
2193 |
{ |
2194 |
int len, i, skill = 0; |
2195 |
|
2196 |
if (!(spell->name)) |
2197 |
{ |
2198 |
LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
2199 |
return; |
2200 |
} |
2201 |
|
2202 |
/* store costs and damage in the object struct, to compare to later */ |
2203 |
spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
2204 |
spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
2205 |
spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
2206 |
|
2207 |
/* figure out which skill it uses, if it uses one */ |
2208 |
if (spell->skill) |
2209 |
{ |
2210 |
for (i = 1; i < NUM_SKILLS; i++) |
2211 |
if (!strcmp (spell->skill, skill_names[i])) |
2212 |
{ |
2213 |
skill = i + CS_STAT_SKILLINFO; |
2214 |
break; |
2215 |
} |
2216 |
} |
2217 |
|
2218 |
/* send the current values */ |
2219 |
sl << uint32 (spell->count) |
2220 |
<< uint16 (spell->level) |
2221 |
<< uint16 (spell->casting_time) |
2222 |
<< uint16 (spell->last_sp) |
2223 |
<< uint16 (spell->last_grace) |
2224 |
<< uint16 (spell->last_eat) |
2225 |
<< uint8 (skill) |
2226 |
<< uint32 (spell->path_attuned) |
2227 |
<< uint32 (spell->face ? spell->face->number : 0) |
2228 |
<< data8 (spell->name) |
2229 |
<< data16 (spell->msg); |
2230 |
} |
2231 |
|
2232 |
/** |
2233 |
* This tells the client to add the spell *ob, if *ob is NULL, then add |
2234 |
* all spells in the player's inventory. |
2235 |
*/ |
2236 |
void |
2237 |
esrv_add_spells (player *pl, object *spell) |
2238 |
{ |
2239 |
if (!pl) |
2240 |
{ |
2241 |
LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); |
2242 |
return; |
2243 |
} |
2244 |
|
2245 |
if (!pl->ns->monitor_spells) |
2246 |
return; |
2247 |
|
2248 |
packet sl ("addspell"); |
2249 |
|
2250 |
if (!spell) |
2251 |
{ |
2252 |
for (spell = pl->ob->inv; spell != NULL; spell = spell->below) |
2253 |
{ |
2254 |
/* were we to simply keep appending data here, we could exceed |
2255 |
* MAXSOCKBUF if the player has enough spells to add, we know that |
2256 |
* append_spells will always append 19 data bytes, plus 4 length |
2257 |
* bytes and 3 strings (because that is the spec) so we need to |
2258 |
* check that the length of those 3 strings, plus the 23 bytes, |
2259 |
* won't take us over the length limit for the socket, if it does, |
2260 |
* we need to send what we already have, and restart packet formation |
2261 |
*/ |
2262 |
/* Seeing crashes by overflowed buffers. Quick arithemetic seems |
2263 |
* to show add_spell is 26 bytes + 2 strings. However, the overun |
2264 |
* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
2265 |
* like it will fix this |
2266 |
*/ |
2267 |
if (spell->type != SPELL) |
2268 |
continue; |
2269 |
|
2270 |
if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
2271 |
{ |
2272 |
pl->ns->send_packet (sl); |
2273 |
|
2274 |
sl.reset (); |
2275 |
sl << "addspell "; |
2276 |
} |
2277 |
|
2278 |
append_spell (pl, sl, spell); |
2279 |
} |
2280 |
} |
2281 |
else if (spell->type != SPELL) |
2282 |
{ |
2283 |
LOG (llevError, "Asked to send a non-spell object as a spell"); |
2284 |
return; |
2285 |
} |
2286 |
else |
2287 |
append_spell (pl, sl, spell); |
2288 |
|
2289 |
if (sl.length () >= MAXSOCKBUF) |
2290 |
{ |
2291 |
LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
2292 |
fatal (0); |
2293 |
} |
2294 |
|
2295 |
/* finally, we can send the packet */ |
2296 |
pl->ns->send_packet (sl); |
2297 |
} |
2298 |
|