ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.84
Committed: Tue Apr 3 00:21:38 2007 UTC (17 years, 2 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.83: +3 -0 lines
Log Message:
- fix ber encoding
- reduce image checksum length to 6 bytes (from 16)
- implement fx packet, which reduces
  face overhead to amortised 10/12 bytes per face instead of
  21/32 bytes and allows an unlimited number of faces
  instead of 2**16.

File Contents

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