ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.44
Committed: Sat Dec 16 21:40:26 2006 UTC (17 years, 5 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.43: +112 -283 lines
Log Message:
- clean up some code
- fix some possible (minor) bugs
- use a bitset for anims_sent
- fix a memory leak
- removed dead code

File Contents

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