ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.49
Committed: Thu Dec 21 06:12:37 2006 UTC (17 years, 5 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.48: +11 -4 lines
Log Message:
- made client a first-class crossfire-perl object
  (its attachable), but perl support is missing.
- added some client events
- fixed reply not working after logout

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 memset (&pl->socket->lastmap, 0, sizeof (pl->socket->lastmap));
144
145 if (pl->socket->newmapcmd == 1)
146 pl->socket->send_packet ("newmap");
147
148 pl->socket->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->socket;
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->socket->mapx / 2 - pl->ob->x;
286 int mapy = pl->socket->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->socket->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->socket->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->pl)
826 return; //TODO: depends on the exact reply we are after
827 //TODO: but right now, we always have a ns->pl
828
829 player *pl = ns->pl;
830
831 /* This is to synthesize how the data would be stored if it
832 * was normally entered. A bit of a hack, and should be cleaned up
833 * once all the X11 code is removed from the server.
834 *
835 * We pass 13 to many of the functions because this way they
836 * think it was the carriage return that was entered, and the
837 * function then does not try to do additional input.
838 */
839 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf);
840
841 /* this avoids any hacking here */
842
843 switch (pl->state)
844 {
845 case ST_PLAYING:
846 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
847 break;
848
849 case ST_PLAY_AGAIN:
850 /* We can check this for return value (2==quit). Maybe we
851 * should, and do something appropriate?
852 */
853 receive_play_again (pl->ob, buf[0]);
854 break;
855
856 case ST_ROLL_STAT:
857 key_roll_stat (pl->ob, buf[0]);
858 break;
859
860 case ST_CHANGE_CLASS:
861 key_change_class (pl->ob, buf[0]);
862 break;
863
864 case ST_CONFIRM_QUIT:
865 key_confirm_quit (pl->ob, buf[0]);
866 break;
867
868 case ST_CONFIGURE:
869 LOG (llevError, "In client input handling, but into configure state\n");
870 pl->state = ST_PLAYING;
871 break;
872
873 case ST_GET_NAME:
874 receive_player_name (pl->ob, 13);
875 break;
876
877 case ST_GET_PASSWORD:
878 case ST_CONFIRM_PASSWORD:
879 receive_player_password (pl->ob, 13);
880 break;
881
882 case ST_GET_PARTY_PASSWORD: /* Get password for party */
883 receive_party_password (pl->ob, 13);
884 break;
885
886 default:
887 LOG (llevError, "Unknown input state: %d\n", pl->state);
888 }
889 }
890
891 /**
892 * Client tells its version. If there is a mismatch, we close the
893 * socket. In real life, all we should care about is the client having
894 * something older than the server. If we assume the client will be
895 * backwards compatible, having it be a later version should not be a
896 * problem.
897 */
898 void
899 VersionCmd (char *buf, int len, client * ns)
900 {
901 if (!buf)
902 {
903 LOG (llevError, "CS: received corrupted version command\n");
904 return;
905 }
906
907 ns->cs_version = atoi (buf);
908 ns->sc_version = ns->cs_version;
909
910 LOG (llevDebug, "connection from client <%s>\n", buf);
911
912
913 //TODO: should log here just for statistics
914
915 //if (VERSION_CS != ns->cs_version)
916 // unchecked;
917
918 char *cp = strchr (buf + 1, ' ');
919 if (!cp)
920 return;
921
922 ns->sc_version = atoi (cp);
923
924 //if (VERSION_SC != ns->sc_version)
925 // unchecked;
926
927 cp = strchr (cp + 1, ' ');
928
929 if (cp)
930 {
931 assign (ns->version, cp + 1);
932
933 if (ns->sc_version < 1026)
934 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
935 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
936 }
937 }
938
939 /** sound related functions. */
940 void
941 SetSound (char *buf, int len, client * ns)
942 {
943 ns->sound = atoi (buf);
944 }
945
946 /** client wants the map resent */
947
948 void
949 MapRedrawCmd (char *buf, int len, player *pl)
950 {
951 /* This function is currently disabled; just clearing the map state results in
952 * display errors. It should clear the cache and send a newmap command.
953 * Unfortunately this solution does not work because some client versions send
954 * a mapredraw command after receiving a newmap command.
955 */
956 }
957
958 /**
959 * Moves an object (typically, container to inventory).
960 * syntax is: move (to) (tag) (nrof)
961 */
962 void
963 MoveCmd (char *buf, int len, player *pl)
964 {
965 int vals[3], i;
966
967 /* A little funky here. We only cycle for 2 records, because
968 * we obviously are not going to find a space after the third
969 * record. Perhaps we should just replace this with a
970 * sscanf?
971 */
972 for (i = 0; i < 2; i++)
973 {
974 vals[i] = atoi (buf);
975
976 if (!(buf = strchr (buf, ' ')))
977 {
978 LOG (llevError, "Incomplete move command: %s\n", buf);
979 return;
980 }
981
982 buf++;
983 }
984
985 vals[2] = atoi (buf);
986
987 /* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
988 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
989 }
990
991 /******************************************************************************
992 *
993 * Start of commands the server sends to the client.
994 *
995 ******************************************************************************/
996
997 /**
998 * Asks the client to query the user. This way, the client knows
999 * it needs to send something back (vs just printing out a message)
1000 */
1001 void
1002 send_query (client *ns, uint8 flags, char *text)
1003 {
1004 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1005 }
1006
1007 #define AddIfInt64(Old,New,Type) if (Old != New) {\
1008 Old = New; \
1009 sl << uint8 (Type) << uint64 (New); \
1010 }
1011
1012 #define AddIfInt(Old,New,Type) if (Old != New) {\
1013 Old = New; \
1014 sl << uint8 (Type) << uint32 (New); \
1015 }
1016
1017 #define AddIfShort(Old,New,Type) if (Old != New) {\
1018 Old = New; \
1019 sl << uint8 (Type) << uint16 (New); \
1020 }
1021
1022 #define AddIfFloat(Old,New,Type) if (Old != New) {\
1023 Old = New; \
1024 sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \
1025 }
1026
1027 #define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\
1028 free(Old); Old = strdup (New);\
1029 sl << uint8 (Type) << data8 (New); \
1030 }
1031
1032 /**
1033 * Sends a statistics update. We look at the old values,
1034 * and only send what has changed. Stat mapping values are in newclient.h
1035 * Since this gets sent a lot, this is actually one of the few binary
1036 * commands for now.
1037 */
1038 void
1039 esrv_update_stats (player *pl)
1040 {
1041 char buf[MAX_BUF];
1042 uint16 flags;
1043
1044 packet sl ("stats");
1045
1046 if (pl->ob)
1047 {
1048 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP);
1049 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP);
1050 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP);
1051 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP);
1052 AddIfShort (pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE);
1053 AddIfShort (pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE);
1054 AddIfShort (pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR);
1055 AddIfShort (pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT);
1056 AddIfShort (pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW);
1057 AddIfShort (pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS);
1058 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX);
1059 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON);
1060 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA);
1061 }
1062
1063 if (pl->socket->exp64)
1064 for (int s = 0; s < NUM_SKILLS; s++)
1065 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp)
1066 {
1067 /* Always send along the level if exp changes. This is only
1068 * 1 extra byte, but keeps processing simpler.
1069 */
1070 sl << uint8 (s + CS_STAT_SKILLINFO)
1071 << uint8 (pl->last_skill_ob[s]->level)
1072 << uint64 (pl->last_skill_ob[s]->stats.exp);
1073
1074 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1075 }
1076
1077 if (pl->socket->exp64)
1078 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) }
1079 else
1080 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
1081
1082 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL);
1083 AddIfShort (pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC);
1084 AddIfShort (pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC);
1085 AddIfShort (pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM);
1086 AddIfFloat (pl->last_speed, pl->ob->speed, CS_STAT_SPEED);
1087 AddIfShort (pl->last_stats.food, pl->ob->stats.food, CS_STAT_FOOD);
1088 AddIfFloat (pl->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);
1089 AddIfInt (pl->last_weight_limit, (sint32) weight_limit[pl->ob->stats.Str], CS_STAT_WEIGHT_LIM);
1090 flags = 0;
1091
1092 if (pl->fire_on)
1093 flags |= SF_FIREON;
1094
1095 if (pl->run_on)
1096 flags |= SF_RUNON;
1097
1098 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);
1099
1100 if (pl->socket->sc_version < 1025)
1101 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1102 else
1103 for (int i = 0; i < NROFATTACKS; i++)
1104 {
1105 /* Skip ones we won't send */
1106 if (atnr_cs_stat[i] == -1)
1107 continue;
1108
1109 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]);
1110 }
1111
1112 if (pl->socket->monitor_spells)
1113 {
1114 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1115 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL);
1116 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY);
1117 }
1118
1119 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */
1120 AddIfString (pl->socket->stats.range, buf, CS_STAT_RANGE);
1121 set_title (pl->ob, buf);
1122 AddIfString (pl->socket->stats.title, buf, CS_STAT_TITLE);
1123
1124 /* Only send it away if we have some actual data */
1125 if (sl.length () > 6)
1126 pl->socket->send_packet (sl);
1127 }
1128
1129 /**
1130 * Tells the client that here is a player it should start using.
1131 */
1132 void
1133 esrv_new_player (player *pl, uint32 weight)
1134 {
1135 pl->last_weight = weight;
1136
1137 packet sl ("player");
1138
1139 sl << uint32 (pl->ob->count)
1140 << uint32 (weight)
1141 << uint32 (pl->ob->face->number)
1142 << data8 (pl->ob->name);
1143
1144 pl->socket->send_packet (sl);
1145 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1146 }
1147
1148 /**
1149 * Need to send an animation sequence to the client.
1150 * We will send appropriate face commands to the client if we haven't
1151 * sent them the face yet (this can become quite costly in terms of
1152 * how much we are sending - on the other hand, this should only happen
1153 * when the player logs in and picks stuff up.
1154 */
1155 void
1156 esrv_send_animation (client * ns, short anim_num)
1157 {
1158 /* Do some checking on the anim_num we got. Note that the animations
1159 * are added in contigous order, so if the number is in the valid
1160 * range, it must be a valid animation.
1161 */
1162 if (anim_num < 0 || anim_num > num_animations)
1163 {
1164 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1165 return;
1166 }
1167
1168 packet sl ("anim");
1169
1170 sl << uint16 (anim_num)
1171 << uint16 (0); /* flags - not used right now */
1172
1173 /* Build up the list of faces. Also, send any information (ie, the
1174 * the face itself) down to the client.
1175 */
1176 for (int i = 0; i < animations[anim_num].num_animations; i++)
1177 {
1178 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1179 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1180
1181 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1182 }
1183
1184 ns->send_packet (sl);
1185
1186 ns->anims_sent[anim_num] = 1;
1187 }
1188
1189
1190 /******************************************************************************
1191 *
1192 * Start of map related commands.
1193 *
1194 ******************************************************************************/
1195
1196 /**
1197 * This adds face_num to a map cell at x,y. If the client doesn't have
1198 * the face yet, we will also send it.
1199 */
1200 static void
1201 esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1202 {
1203 if (newmap->cells[x][y].count >= MAP_LAYERS)
1204 {
1205 //TODO: one or the other, can't both have abort and return, verify and act
1206 LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1207 return;
1208 abort ();
1209 }
1210
1211 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1212 newmap->cells[x][y].count++;
1213
1214 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1215 esrv_send_face (ns, face_num, 0);
1216 }
1217
1218 /** Clears a map cell */
1219 static void
1220 map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count)
1221 {
1222 cell->faces[0] = face0;
1223 cell->faces[1] = face1;
1224 cell->faces[2] = face2;
1225 cell->count = count;
1226 cell->stat_hp = 0;
1227 cell->flags = 0;
1228 cell->player = 0;
1229 }
1230
1231 #define MAX_HEAD_POS MAX(MAX_CLIENT_X, MAX_CLIENT_Y)
1232 #define MAX_LAYERS 3
1233
1234 /* Using a global really isn't a good approach, but saves the over head of
1235 * allocating and deallocating such a block of data each time run through,
1236 * and saves the space of allocating this in the socket object when we only
1237 * need it for this cycle. If the server is ever threaded, this needs to be
1238 * re-examined.
1239 */
1240 static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1241
1242 /**
1243 * Returns true if any of the heads for this
1244 * space is set. Returns false if all are blank - this is used
1245 * for empty space checking.
1246 */
1247 static inline int
1248 have_head (int ax, int ay)
1249 {
1250 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1251 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1252 return 1;
1253
1254 return 0;
1255 }
1256
1257 /**
1258 * check_head is a bit simplistic version of update_space below.
1259 * basically, it only checks the that the head on space ax,ay at layer
1260 * needs to get sent - if so, it adds the data, sending the head
1261 * if needed, and returning 1. If this no data needs to get
1262 * sent, it returns zero.
1263 */
1264 static int
1265 check_head (packet &sl, client &ns, int ax, int ay, int layer)
1266 {
1267 short face_num;
1268
1269 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1270 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
1271 else
1272 face_num = 0;
1273
1274 if (face_num != ns.lastmap.cells[ax][ay].faces[layer])
1275 {
1276 sl << uint16 (face_num);
1277 if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE))
1278 esrv_send_face (&ns, face_num, 0);
1279
1280 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL;
1281 ns.lastmap.cells[ax][ay].faces[layer] = face_num;
1282 return 1;
1283 }
1284
1285 return 0; /* No change */
1286 }
1287
1288 /**
1289 * Removes the need to replicate the same code for each layer.
1290 * this returns true if this space is now in fact different than
1291 * it was.
1292 * sl is the socklist this data is going into.
1293 * ns is the socket we are working on - all the info we care
1294 * about is in this socket structure, so now need not pass the
1295 * entire player object.
1296 * mx and my are map coordinate offsets for map mp
1297 * sx and sy are the offsets into the socket structure that
1298 * holds the old values.
1299 * layer is the layer to update, with 2 being the floor and 0 the
1300 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ)
1301 * take. Interesting to note that before this function, the map1 function
1302 * numbers the spaces differently - I think this was a leftover from
1303 * the map command, where the faces stack up. Sinces that is no longer
1304 * the case, it seems to make more sense to have these layer values
1305 * actually match.
1306 */
1307 static int
1308 update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1309 {
1310 object *ob, *head;
1311 uint16 face_num;
1312 int bx, by, i;
1313
1314 /* If there is a multipart object stored away, treat that as more important.
1315 * If not, then do the normal processing.
1316 */
1317 head = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer];
1318
1319 /* Check to see if this head is part of the set of objects
1320 * we would normally send for this space. If so, then
1321 * don't use the head value. We need to do the check
1322 * here and not when setting up the heads[] value for two reasons -
1323 * 1) the heads[] values will get used even if the space is not visible.
1324 * 2) its possible the head is not on the same map as a part, and I'd
1325 * rather not need to do the map translation overhead.
1326 * 3) We need to do some extra checking to make sure that we will
1327 * otherwise send the image as this layer, eg, either it matches
1328 * the head value, or is not multipart.
1329 */
1330 if (head && !head->more)
1331 {
1332 for (i = 0; i < MAP_LAYERS; i++)
1333 {
1334 ob = GET_MAP_FACE_OBJ (mp, mx, my, i);
1335 if (!ob)
1336 continue;
1337
1338 if (ob->head)
1339 ob = ob->head;
1340
1341 if (ob == head)
1342 {
1343 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer] = NULL;
1344 head = NULL;
1345 break;
1346 }
1347 }
1348 }
1349
1350 ob = head;
1351 if (!ob)
1352 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1353
1354 /* If there is no object for this space, or if the face for the object
1355 * is the blank face, set the face number to zero.
1356 * else if we have the stored head object for this space, that takes
1357 * precedence over the other object for this space.
1358 * otherwise, we do special head processing
1359 */
1360 if (!ob || ob->face == blank_face)
1361 face_num = 0;
1362 else if (head)
1363 {
1364 /* if this is a head that had previously been stored */
1365 face_num = ob->face->number;
1366 }
1367 else
1368 {
1369 /* if the faces for the different parts of a multipart object
1370 * are the same, we only want to send the bottom right most
1371 * portion of the object. That info is in the tail_.. values
1372 * of the head. Note that for the head itself, ob->head will
1373 * be null, so we only do this block if we are working on
1374 * a tail piece.
1375 */
1376
1377 /* tail_x and tail_y will only be set in the head object. If
1378 * this is the head object and these are set, we proceed
1379 * with logic to only send bottom right. Similarly, if
1380 * this is one of the more parts but the head has those values
1381 * set, we want to do the processing. There can be cases where
1382 * the head is not visible but one of its parts is, so we just
1383 * can always expect that ob->arch->tail_x will be true for all
1384 * object we may want to display.
1385 */
1386 if ((ob->arch->tail_x || ob->arch->tail_y) || (ob->head && (ob->head->arch->tail_x || ob->head->arch->tail_y)))
1387 {
1388
1389 if (ob->head)
1390 head = ob->head;
1391 else
1392 head = ob;
1393
1394 /* Basically figure out where the offset is from where we are right
1395 * now. the ob->arch->clone.{x,y} values hold the offset that this current
1396 * piece is from the head, and the tail is where the tail is from the
1397 * head. Note that bx and by will equal sx and sy if we are already working
1398 * on the bottom right corner. If ob is the head, the clone values
1399 * will be zero, so the right thing will still happen.
1400 */
1401 bx = sx + head->arch->tail_x - ob->arch->clone.x;
1402 by = sy + head->arch->tail_y - ob->arch->clone.y;
1403
1404 /* I don't think this can ever happen, but better to check for it just
1405 * in case.
1406 */
1407 if (bx < sx || by < sy)
1408 {
1409 LOG (llevError, "update_space: bx (%d) or by (%d) is less than sx (%d) or sy (%d)\n", bx, by, sx, sy);
1410 face_num = 0;
1411 }
1412 /* single part object, multipart object with non merged faces,
1413 * of multipart object already at lower right.
1414 */
1415 else if (bx == sx && by == sy)
1416 {
1417 face_num = ob->face->number;
1418
1419 /* if this face matches one stored away, clear that one away.
1420 * this code relies on the fact that the map1 commands
1421 * goes from 2 down to 0.
1422 */
1423 for (i = 0; i < MAP_LAYERS; i++)
1424 if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] &&
1425 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i]->face->number == face_num)
1426 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] = NULL;
1427 }
1428 else
1429 {
1430 /* If this head is stored away, clear it - otherwise,
1431 * there can be cases where a object is on multiple layers -
1432 * we only want to send it once.
1433 */
1434 face_num = head->face->number;
1435 for (i = 0; i < MAP_LAYERS; i++)
1436 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] &&
1437 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i]->face->number == face_num)
1438 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = NULL;
1439
1440 /* First, try to put the new head on the same layer. If that is used up,
1441 * then find another layer.
1442 */
1443 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] == NULL)
1444 {
1445 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] = head;
1446 }
1447 else
1448 for (i = 0; i < MAX_LAYERS; i++)
1449 {
1450 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == NULL ||
1451 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == head)
1452 {
1453 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = head;
1454 }
1455 }
1456 face_num = 0; /* Don't send this object - we'll send the head later */
1457 }
1458 }
1459 else
1460 {
1461 /* In this case, we are already at the lower right or single part object,
1462 * so nothing special
1463 */
1464 face_num = ob->face->number;
1465
1466 /* clear out any head entries that have the same face as this one */
1467 for (bx = 0; bx < layer; bx++)
1468 if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] &&
1469 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx]->face->number == face_num)
1470 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] = NULL;
1471 }
1472 } /* else not already head object or blank face */
1473
1474 /* This is a real hack. Basically, if we have nothing to send for this layer,
1475 * but there is a head on the next layer, send that instead.
1476 * Without this, what happens is you can get the case where the player stands
1477 * on the same space as the head. However, if you have overlapping big objects
1478 * of the same type, what happens then is it doesn't think it needs to send
1479 * This tends to make stacking also work/look better.
1480 */
1481 if (!face_num && layer > 0 && heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1])
1482 {
1483 face_num = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1]->face->number;
1484 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1] = NULL;
1485 }
1486
1487 /* Another hack - because of heads and whatnot, this face may match one
1488 * we already sent for a lower layer. In that case, don't send
1489 * this one.
1490 */
1491 if (face_num && layer + 1 < MAP_LAYERS && ns.lastmap.cells[sx][sy].faces[layer + 1] == face_num)
1492 face_num = 0;
1493
1494 /* We've gotten what face we want to use for the object. Now see if
1495 * if it has changed since we last sent it to the client.
1496 */
1497 if (ns.lastmap.cells[sx][sy].faces[layer] != face_num)
1498 {
1499 ns.lastmap.cells[sx][sy].faces[layer] = face_num;
1500 if (!(ns.faces_sent[face_num] & NS_FACESENT_FACE))
1501 esrv_send_face (&ns, face_num, 0);
1502
1503 sl << uint16 (face_num);
1504 return 1;
1505 }
1506
1507 /* Nothing changed */
1508 return 0;
1509 }
1510
1511 /**
1512 * This function is mainly a copy of update_space,
1513 * except it handles update of the smoothing updates,
1514 * not the face updates.
1515 * Removes the need to replicate the same code for each layer.
1516 * this returns true if this smooth is now in fact different
1517 * than it was.
1518 * sl is the socklist this data is going into.
1519 * ns is the socket we are working on - all the info we care
1520 * about is in this socket structure, so know need to pass the
1521 * entire player object.
1522 * mx and my are map coordinate offsets for map mp
1523 * sx and sy are the offsets into the socket structure that
1524 * holds the old values.
1525 * layer is the layer to update, with 2 being the floor and 0 the
1526 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1527 * take.
1528 */
1529
1530 static inline int
1531 update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1532 {
1533 object *ob;
1534 int smoothlevel; /* old face_num; */
1535
1536 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1537
1538 /* If there is no object for this space, or if the face for the object
1539 * is the blank face, set the smoothlevel to zero.
1540 */
1541 if (!ob || ob->face == blank_face || MAP_NOSMOOTH (mp))
1542 smoothlevel = 0;
1543 else
1544 {
1545 smoothlevel = ob->smoothlevel;
1546 if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH))
1547 SendSmooth (&ns, ob->face->number);
1548 } /* else not already head object or blank face */
1549
1550 /* We've gotten what face we want to use for the object. Now see if
1551 * if it has changed since we last sent it to the client.
1552 */
1553 if (smoothlevel > 255)
1554 smoothlevel = 255;
1555 else if (smoothlevel < 0)
1556 smoothlevel = 0;
1557
1558 if (ns.lastmap.cells[sx][sy].smooth[layer] != smoothlevel)
1559 {
1560 ns.lastmap.cells[sx][sy].smooth[layer] = smoothlevel;
1561 sl << uint8 (smoothlevel);
1562 return 1;
1563 }
1564
1565 /* Nothing changed */
1566 return 0;
1567 }
1568
1569 /**
1570 * Returns the size of a data for a map square as returned by
1571 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
1572 * available.
1573 */
1574 int
1575 getExtendedMapInfoSize (client * ns)
1576 {
1577 int result = 0;
1578
1579 if (ns->ext_mapinfos)
1580 {
1581 if (ns->EMI_smooth)
1582 result += 1; /*One byte for smoothlevel */
1583 }
1584
1585 return result;
1586 }
1587
1588 /**
1589 * This function uses the new map1 protocol command to send the map
1590 * to the client. It is necessary because the old map command supports
1591 * a maximum map size of 15x15.
1592 * This function is much simpler than the old one. This is because
1593 * the old function optimized to send as few face identifiers as possible,
1594 * at the expense of sending more coordinate location (coordinates were
1595 * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
1596 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1597 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1598 * and use the other 4 bits for other informatiion. For full documentation
1599 * of what we send, see the doc/Protocol file.
1600 * I will describe internally what we do:
1601 * the socket->lastmap shows how the map last looked when sent to the client.
1602 * in the lastmap structure, there is a cells array, which is set to the
1603 * maximum viewable size (As set in config.h).
1604 * in the cells, there are faces and a count value.
1605 * we use the count value to hold the darkness value. If -1, then this space
1606 * is not viewable.
1607 * we use faces[0] faces[1] faces[2] to hold what the three layers
1608 * look like.
1609 */
1610 void
1611 draw_client_map1 (object *pl)
1612 {
1613 int x, y, ax, ay, d, startlen, max_x, max_y, oldlen;
1614 sint16 nx, ny;
1615 int estartlen, eoldlen;
1616 uint16 mask, emask;
1617 uint8 eentrysize;
1618 uint16 ewhatstart, ewhatflag;
1619 uint8 extendedinfos;
1620 maptile *m;
1621
1622 client &socket = *pl->contr->socket;
1623
1624 check_map_change (pl->contr);
1625
1626 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1627 packet esl;
1628
1629 startlen = sl.length ();
1630
1631 /*Extendedmapinfo structure initialisation */
1632 if (socket.ext_mapinfos)
1633 {
1634 extendedinfos = EMI_NOREDRAW;
1635
1636 if (socket.EMI_smooth)
1637 extendedinfos |= EMI_SMOOTH;
1638
1639 ewhatstart = esl.length ();
1640 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1641 could need to be taken away */
1642 eentrysize = getExtendedMapInfoSize (&socket);
1643 esl << "mapextended "
1644 << uint8 (extendedinfos)
1645 << uint8 (eentrysize);
1646
1647 estartlen = esl.length ();
1648 }
1649 else
1650 {
1651 /* suppress compiler warnings */
1652 ewhatstart = 0;
1653 ewhatflag = 0;
1654 estartlen = 0;
1655 }
1656
1657 /* Init data to zero */
1658 memset (heads, 0, sizeof (object *) * MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS);
1659
1660 /* x,y are the real map locations. ax, ay are viewport relative
1661 * locations.
1662 */
1663 ay = 0;
1664
1665 /* We could do this logic as conditionals in the if statement,
1666 * but that started to get a bit messy to look at.
1667 */
1668 max_x = pl->x + (socket.mapx + 1) / 2;
1669 max_y = pl->y + (socket.mapy + 1) / 2;
1670
1671 if (socket.mapmode == Map1aCmd)
1672 {
1673 max_x += MAX_HEAD_OFFSET;
1674 max_y += MAX_HEAD_OFFSET;
1675 }
1676
1677 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1678 {
1679 ax = 0;
1680 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1681 {
1682 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1683
1684 /* If this space is out of the normal viewable area, we only check
1685 * the heads value ax or ay will only be greater than what
1686 * the client wants if using the map1a command - this is because
1687 * if the map1a command is not used, max_x and max_y will be
1688 * set to lower values.
1689 */
1690 if (ax >= socket.mapx || ay >= socket.mapy)
1691 {
1692 int i, got_one;
1693
1694 oldlen = sl.length ();
1695
1696 sl << uint16 (mask);
1697
1698 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1699 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1700 if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1701
1702 /* If all we are doing is sending 0 (blank) faces, we don't
1703 * actually need to send that - just the coordinates
1704 * with no faces tells the client to blank out the
1705 * space.
1706 */
1707 got_one = 0;
1708 for (i = oldlen + 2; i < sl.length (); i++)
1709 if (sl[i])
1710 got_one = 1;
1711
1712 if (got_one && (mask & 0xf))
1713 sl[oldlen + 1] = mask & 0xff;
1714 else
1715 { /*either all faces blank, either no face at all */
1716 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */
1717 sl.reset (oldlen + 2);
1718 else
1719 sl.reset (oldlen);
1720 }
1721
1722 /*What concerns extendinfos, nothing to be done for now
1723 * (perhaps effects layer later)
1724 */
1725 continue; /* don't do processing below */
1726 }
1727
1728 MapCell &lastcell = socket.lastmap.cells[ax][ay];
1729
1730 d = pl->contr->blocked_los[ax][ay];
1731
1732 /* If the coordinates are not valid, or it is too dark to see,
1733 * we tell the client as such
1734 */
1735 nx = x;
1736 ny = y;
1737 m = get_map_from_coord (pl->map, &nx, &ny);
1738
1739 if (!m)
1740 {
1741 /* space is out of map. Update space and clear values
1742 * if this hasn't already been done. If the space is out
1743 * of the map, it shouldn't have a head
1744 */
1745 if (lastcell.count != -1)
1746 {
1747 sl << uint16 (mask);
1748 map_clearcell (&lastcell, 0, 0, 0, -1);
1749 }
1750 }
1751 else if (d > 3)
1752 {
1753 int need_send = 0, count;
1754
1755 /* This block deals with spaces that are not visible for whatever
1756 * reason. Still may need to send the head for this space.
1757 */
1758
1759 oldlen = sl.length ();
1760
1761 sl << uint16 (mask);
1762
1763 if (lastcell.count != -1)
1764 need_send = 1;
1765
1766 count = -1;
1767
1768 if (socket.mapmode == Map1aCmd && have_head (ax, ay))
1769 {
1770 /* Now check to see if any heads need to be sent */
1771
1772 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1773 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1774 if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1775
1776 lastcell.count = count;
1777 }
1778 else
1779 {
1780 /* properly clear a previously sent big face */
1781 if (lastcell.faces[0] != 0 || lastcell.faces[1] != 0 || lastcell.faces[2] != 0
1782 || lastcell.stat_hp || lastcell.flags || lastcell.player)
1783 need_send = 1;
1784
1785 map_clearcell (&lastcell, 0, 0, 0, count);
1786 }
1787
1788 if ((mask & 0xf) || need_send)
1789 sl[oldlen + 1] = mask & 0xff;
1790 else
1791 sl.reset (oldlen);
1792 }
1793 else
1794 {
1795 /* In this block, the space is visible or there are head objects
1796 * we need to send.
1797 */
1798
1799 /* Rather than try to figure out what everything that we might
1800 * need to send is, then form the packet after that,
1801 * we presume that we will in fact form a packet, and update
1802 * the bits by what we do actually send. If we send nothing,
1803 * we just back out sl.length () to the old value, and no harm
1804 * is done.
1805 * I think this is simpler than doing a bunch of checks to see
1806 * what if anything we need to send, setting the bits, then
1807 * doing those checks again to add the real data.
1808 */
1809 oldlen = sl.length ();
1810 mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1811 eoldlen = esl.length ();
1812 emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1813 sl << uint16 (mask);
1814
1815 if (socket.ext_mapinfos)
1816 esl << uint16 (emask);
1817
1818 unsigned char dummy;
1819 unsigned char *last_ext = &dummy;
1820
1821 /* Darkness changed */
1822 if (lastcell.count != d && socket.darkness)
1823 {
1824 mask |= 0x8;
1825
1826 if (socket.extmap)
1827 {
1828 *last_ext |= 0x80;
1829 last_ext = &sl[sl.length ()];
1830 sl << uint8 (d);
1831 }
1832 else
1833 sl << uint8 (255 - 64 * d);
1834 }
1835
1836 lastcell.count = d;
1837
1838 if (socket.extmap)
1839 {
1840 uint8 stat_hp = 0;
1841 uint8 stat_width = 0;
1842 uint8 flags = 0;
1843 UUID player = 0;
1844
1845 // send hp information, if applicable
1846 if (object *op = GET_MAP_FACE_OBJ (m, nx, ny, 0))
1847 {
1848 if (op->head || op->invisible)
1849 ; // do not show
1850 else if (op->type == PLAYER
1851 || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
1852 {
1853 if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)
1854 {
1855 stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1856 stat_width = op->arch->tail_x;
1857 }
1858 }
1859
1860 if (op->msg && op->msg[0] == '@')
1861 flags |= 1;
1862
1863 if (op->type == PLAYER && op != pl)
1864 player = op->count;
1865 }
1866
1867 if (lastcell.stat_hp != stat_hp)
1868 {
1869 lastcell.stat_hp = stat_hp;
1870
1871 mask |= 0x8;
1872 *last_ext |= 0x80;
1873 last_ext = &sl[sl.length ()];
1874
1875 sl << uint8 (5) << uint8 (stat_hp);
1876
1877 if (stat_width > 1)
1878 {
1879 *last_ext |= 0x80;
1880 last_ext = &sl[sl.length ()];
1881
1882 sl << uint8 (6) << uint8 (stat_width);
1883 }
1884 }
1885
1886 if (lastcell.player != player)
1887 {
1888 lastcell.player = player;
1889
1890 mask |= 0x8;
1891 *last_ext |= 0x80;
1892 last_ext = &sl[sl.length ()];
1893
1894 sl << uint8 (0x47) << uint8 (8) << (uint64)player;
1895 }
1896
1897 if (lastcell.flags != flags)
1898 {
1899 lastcell.flags = flags;
1900
1901 mask |= 0x8;
1902 *last_ext |= 0x80;
1903 last_ext = &sl[sl.length ()];
1904
1905 sl << uint8 (8) << uint8 (flags);
1906 }
1907 }
1908
1909 /* Floor face */
1910 if (update_space (sl, socket, m, nx, ny, ax, ay, 2))
1911 mask |= 0x4;
1912
1913 if (socket.EMI_smooth)
1914 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 2))
1915 emask |= 0x4;
1916
1917 /* Middle face */
1918 if (update_space (sl, socket, m, nx, ny, ax, ay, 1))
1919 mask |= 0x2;
1920
1921 if (socket.EMI_smooth)
1922 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 1))
1923 emask |= 0x2;
1924
1925 if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1))
1926 {
1927 if (lastcell.faces[0] != pl->face->number)
1928 {
1929 lastcell.faces[0] = pl->face->number;
1930 mask |= 0x1;
1931
1932 if (!(socket.faces_sent[pl->face->number] & NS_FACESENT_FACE))
1933 esrv_send_face (&socket, pl->face->number, 0);
1934
1935 sl << uint16 (pl->face->number);
1936 }
1937 }
1938 else
1939 {
1940 /* Top face */
1941 if (update_space (sl, socket, m, nx, ny, ax, ay, 0))
1942 mask |= 0x1;
1943
1944 if (socket.EMI_smooth)
1945 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 0))
1946 emask |= 0x1;
1947 }
1948
1949 /* Check to see if we are in fact sending anything for this
1950 * space by checking the mask. If so, update the mask.
1951 * if not, reset the len to that from before adding the mask
1952 * value, so we don't send those bits.
1953 */
1954 if (mask & 0xf)
1955 sl[oldlen + 1] = mask & 0xff;
1956 else
1957 sl.reset (oldlen);
1958
1959 if (emask & 0xf)
1960 esl[eoldlen + 1] = emask & 0xff;
1961 else
1962 esl.reset (eoldlen);
1963 } /* else this is a viewable space */
1964 } /* for x loop */
1965 } /* for y loop */
1966
1967 /* Verify that we in fact do need to send this */
1968 if (socket.ext_mapinfos)
1969 {
1970 if (!(sl.length () > startlen || socket.sent_scroll))
1971 {
1972 /* No map data will follow, so don't say the client
1973 * it doesn't need draw!
1974 */
1975 ewhatflag &= (~EMI_NOREDRAW);
1976 esl[ewhatstart + 1] = ewhatflag & 0xff;
1977 }
1978
1979 if (esl.length () > estartlen)
1980 socket.send_packet (esl);
1981 }
1982
1983 if (sl.length () > startlen || socket.sent_scroll)
1984 {
1985 socket.send_packet (sl);
1986 socket.sent_scroll = 0;
1987 }
1988 }
1989
1990 /**
1991 * Draws client map.
1992 */
1993 void
1994 draw_client_map (object *pl)
1995 {
1996 int i, j;
1997 sint16 ax, ay, nx, ny; /* ax and ay goes from 0 to max-size of arrays */
1998 New_Face *face, *floor;
1999 New_Face *floor2;
2000 int d, mflags;
2001 struct Map newmap;
2002 maptile *m, *pm;
2003
2004 if (pl->type != PLAYER)
2005 {
2006 LOG (llevError, "draw_client_map called with non player/non eric-server\n");
2007 return;
2008 }
2009
2010 pm = pl->map;
2011
2012 /* If player is just joining the game, he isn't here yet, so the map
2013 * can get swapped out. If so, don't try to send them a map. All will
2014 * be OK once they really log in.
2015 */
2016 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
2017 return;
2018
2019 memset (&newmap, 0, sizeof (struct Map));
2020
2021 for (j = (pl->y - pl->contr->socket->mapy / 2); j < (pl->y + (pl->contr->socket->mapy + 1) / 2); j++)
2022 for (i = (pl->x - pl->contr->socket->mapx / 2); i < (pl->x + (pl->contr->socket->mapx + 1) / 2); i++)
2023 {
2024 ax = i;
2025 ay = j;
2026 m = pm;
2027 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2028
2029 if (mflags & P_OUT_OF_MAP)
2030 continue;
2031
2032 /* If a map is visible to the player, we don't want to swap it out
2033 * just to reload it. This should really call something like
2034 * swap_map, but this is much more efficient and 'good enough'
2035 */
2036 if (mflags & P_NEW_MAP)
2037 m->timeout = 50;
2038 }
2039
2040 /* do LOS after calls to update_position */
2041 if (pl->contr->do_los)
2042 {
2043 update_los (pl);
2044 pl->contr->do_los = 0;
2045 }
2046
2047 /* Big maps need a different drawing mechanism to work */
2048 draw_client_map1 (pl);
2049 }
2050
2051
2052 /*****************************************************************************/
2053
2054 /* GROS: The following one is used to allow a plugin to send a generic cmd to*/
2055
2056 /* a player. Of course, the client need to know the command to be able to */
2057
2058 /* manage it ! */
2059
2060 /*****************************************************************************/
2061 void
2062 send_plugin_custom_message (object *pl, char *buf)
2063 {
2064 pl->contr->socket->send_packet (buf);
2065 }
2066
2067 /**
2068 * This sends the skill number to name mapping. We ignore
2069 * the params - we always send the same info no matter what.
2070 */
2071 void
2072 send_skill_info (client *ns, char *params)
2073 {
2074 packet sl;
2075 sl << "replyinfo skill_info\n";
2076
2077 for (int i = 1; i < NUM_SKILLS; i++)
2078 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);
2079
2080 if (sl.length () >= MAXSOCKBUF)
2081 {
2082 LOG (llevError, "Buffer overflow in send_skill_info!\n");
2083 fatal (0);
2084 }
2085
2086 ns->send_packet (sl);
2087 }
2088
2089 /**
2090 * This sends the spell path to name mapping. We ignore
2091 * the params - we always send the same info no matter what.
2092 */
2093 void
2094 send_spell_paths (client * ns, char *params)
2095 {
2096 packet sl;
2097
2098 sl << "replyinfo spell_paths\n";
2099
2100 for (int i = 0; i < NRSPELLPATHS; i++)
2101 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
2102
2103 if (sl.length () >= MAXSOCKBUF)
2104 {
2105 LOG (llevError, "Buffer overflow in send_spell_paths!\n");
2106 fatal (0);
2107 }
2108
2109 ns->send_packet (sl);
2110 }
2111
2112 /**
2113 * This looks for any spells the player may have that have changed their stats.
2114 * it then sends an updspell packet for each spell that has changed in this way
2115 */
2116 void
2117 esrv_update_spells (player *pl)
2118 {
2119 if (!pl->socket->monitor_spells)
2120 return;
2121
2122 for (object *spell = pl->ob->inv; spell; spell = spell->below)
2123 {
2124 if (spell->type == SPELL)
2125 {
2126 int flags = 0;
2127
2128 /* check if we need to update it */
2129 if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))
2130 {
2131 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
2132 flags |= UPD_SP_MANA;
2133 }
2134
2135 if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))
2136 {
2137 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
2138 flags |= UPD_SP_GRACE;
2139 }
2140
2141 if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))
2142 {
2143 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
2144 flags |= UPD_SP_DAMAGE;
2145 }
2146
2147 if (flags)
2148 {
2149 packet sl;
2150
2151 sl << "updspell "
2152 << uint8 (flags)
2153 << uint32 (spell->count);
2154
2155 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2156 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2157 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2158
2159 pl->socket->send_packet (sl);
2160 }
2161 }
2162 }
2163 }
2164
2165 void
2166 esrv_remove_spell (player *pl, object *spell)
2167 {
2168 if (!pl->socket->monitor_spells)
2169 return;
2170
2171 if (!pl || !spell || spell->env != pl->ob)
2172 {
2173 LOG (llevError, "Invalid call to esrv_remove_spell");
2174 return;
2175 }
2176
2177 packet sl ("delspell");
2178
2179 sl << uint32 (spell->count);
2180
2181 pl->socket->send_packet (sl);
2182 }
2183
2184 /* appends the spell *spell to the Socklist we will send the data to. */
2185 static void
2186 append_spell (player *pl, packet &sl, object *spell)
2187 {
2188 int len, i, skill = 0;
2189
2190 if (!(spell->name))
2191 {
2192 LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
2193 return;
2194 }
2195
2196 /* store costs and damage in the object struct, to compare to later */
2197 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
2198 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
2199 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
2200
2201 /* figure out which skill it uses, if it uses one */
2202 if (spell->skill)
2203 {
2204 for (i = 1; i < NUM_SKILLS; i++)
2205 if (!strcmp (spell->skill, skill_names[i]))
2206 {
2207 skill = i + CS_STAT_SKILLINFO;
2208 break;
2209 }
2210 }
2211
2212 /* send the current values */
2213 sl << uint32 (spell->count)
2214 << uint16 (spell->level)
2215 << uint16 (spell->casting_time)
2216 << uint16 (spell->last_sp)
2217 << uint16 (spell->last_grace)
2218 << uint16 (spell->last_eat)
2219 << uint8 (skill)
2220 << uint32 (spell->path_attuned)
2221 << uint32 (spell->face ? spell->face->number : 0)
2222 << data8 (spell->name)
2223 << data16 (spell->msg);
2224 }
2225
2226 /**
2227 * This tells the client to add the spell *ob, if *ob is NULL, then add
2228 * all spells in the player's inventory.
2229 */
2230 void
2231 esrv_add_spells (player *pl, object *spell)
2232 {
2233 if (!pl)
2234 {
2235 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player");
2236 return;
2237 }
2238
2239 if (!pl->socket->monitor_spells)
2240 return;
2241
2242 packet sl ("addspell");
2243
2244 if (!spell)
2245 {
2246 for (spell = pl->ob->inv; spell != NULL; spell = spell->below)
2247 {
2248 /* were we to simply keep appending data here, we could exceed
2249 * MAXSOCKBUF if the player has enough spells to add, we know that
2250 * append_spells will always append 19 data bytes, plus 4 length
2251 * bytes and 3 strings (because that is the spec) so we need to
2252 * check that the length of those 3 strings, plus the 23 bytes,
2253 * won't take us over the length limit for the socket, if it does,
2254 * we need to send what we already have, and restart packet formation
2255 */
2256 /* Seeing crashes by overflowed buffers. Quick arithemetic seems
2257 * to show add_spell is 26 bytes + 2 strings. However, the overun
2258 * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem
2259 * like it will fix this
2260 */
2261 if (spell->type != SPELL)
2262 continue;
2263
2264 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
2265 {
2266 pl->socket->send_packet (sl);
2267
2268 sl.reset ();
2269 sl << "addspell ";
2270 }
2271
2272 append_spell (pl, sl, spell);
2273 }
2274 }
2275 else if (spell->type != SPELL)
2276 {
2277 LOG (llevError, "Asked to send a non-spell object as a spell");
2278 return;
2279 }
2280 else
2281 append_spell (pl, sl, spell);
2282
2283 if (sl.length () >= MAXSOCKBUF)
2284 {
2285 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2286 fatal (0);
2287 }
2288
2289 /* finally, we can send the packet */
2290 pl->socket->send_packet (sl);
2291 }
2292