ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.94
Committed: Thu May 3 09:26:45 2007 UTC (17 years, 1 month ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.93: +2 -7 lines
Log Message:
only allow one range weapon to be applied at any one time, some dynbuf fixes

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