ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.104
Committed: Tue Jun 5 13:05:03 2007 UTC (17 years ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.103: +2 -1 lines
Log Message:
- improve observe
- remove more cruft code
- archetype loading almost works again, reloading probbaly still borked.

File Contents

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