ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.111
Committed: Sun Jul 1 04:08:14 2007 UTC (16 years, 10 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.110: +0 -21 lines
Log Message:
- support priority as second argument of askface
- send images of same priority in fifo order,
  but higher priorities first.

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 * This handles the general commands from the client (ie, north, fire, cast,
477 * etc.)
478 */
479 void
480 PlayerCmd (char *buf, int len, player *pl)
481 {
482 /* Check if there is a count. In theory, a zero count could also be
483 * sent, so check for that also.
484 */
485 if (atoi (buf) || buf[0] == '0')
486 {
487 pl->count = atoi ((char *) buf);
488
489 buf = strchr (buf, ' '); /* advance beyond the numbers */
490 if (!buf)
491 return;
492
493 buf++;
494 }
495
496 execute_newserver_command (pl->ob, (char *) buf);
497
498 /* Perhaps something better should be done with a left over count.
499 * Cleaning up the input should probably be done first - all actions
500 * for the command that issued the count should be done before any other
501 * commands.
502 */
503 pl->count = 0;
504 }
505
506 /**
507 * This handles the general commands from the client (ie, north, fire, cast,
508 * etc.). It is a lot like PlayerCmd above, but is called with the
509 * 'ncom' method which gives more information back to the client so it
510 * can throttle.
511 */
512 void
513 NewPlayerCmd (char *buf, int len, player *pl)
514 {
515 if (len <= 6)
516 {
517 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
518 return;
519 }
520
521 uint16 cmdid = net_uint16 ((uint8 *)buf);
522 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
523
524 /* -1 is special - no repeat, but don't update */
525 if (repeat != -1)
526 pl->count = repeat;
527
528 buf += 6; //len -= 6;
529
530 execute_newserver_command (pl->ob, buf);
531
532 /* Perhaps something better should be done with a left over count.
533 * Cleaning up the input should probably be done first - all actions
534 * for the command that issued the count should be done before any other
535 * commands.
536 */
537 pl->count = 0;
538
539 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
540 int time = fabs (pl->ob->speed) < 0.001
541 ? time = MAX_TIME * 100
542 : time = (int) (MAX_TIME / fabs (pl->ob->speed));
543
544 /* Send confirmation of command execution now */
545 packet sl ("comc");
546 sl << uint16 (cmdid) << uint32 (time);
547 pl->ns->send_packet (sl);
548 }
549
550 /** This is a reply to a previous query. */
551 void
552 ReplyCmd (char *buf, int len, client *ns)
553 {
554 if (ns->state == ST_CUSTOM)
555 {
556 INVOKE_CLIENT (REPLY, ns, ARG_DATA (buf, len));
557 return;
558 }
559
560 if (!ns->pl)
561 return; //TODO: depends on the exact reply we are after
562 //TODO: but right now, we always have a ns->pl
563
564 player *pl = ns->pl;
565
566 /* This is to synthesize how the data would be stored if it
567 * was normally entered. A bit of a hack, and should be cleaned up
568 * once all the X11 code is removed from the server.
569 *
570 * We pass 13 to many of the functions because this way they
571 * think it was the carriage return that was entered, and the
572 * function then does not try to do additional input.
573 */
574 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf);
575
576 /* this avoids any hacking here */
577
578 switch (ns->state)
579 {
580 case ST_PLAYING:
581 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
582 break;
583
584 case ST_GET_PARTY_PASSWORD: /* Get password for party */
585 receive_party_password (pl->ob, 13);
586 break;
587
588 default:
589 LOG (llevError, "Unknown input state: %d\n", ns->state);
590 }
591 }
592
593 /**
594 * Client tells its version. If there is a mismatch, we close the
595 * socket. In real life, all we should care about is the client having
596 * something older than the server. If we assume the client will be
597 * backwards compatible, having it be a later version should not be a
598 * problem.
599 */
600 void
601 VersionCmd (char *buf, int len, client * ns)
602 {
603 if (!buf)
604 {
605 LOG (llevError, "CS: received corrupted version command\n");
606 return;
607 }
608
609 ns->cs_version = atoi (buf);
610 ns->sc_version = ns->cs_version;
611
612 LOG (llevDebug, "connection from client <%s>\n", buf);
613
614 //TODO: should log here just for statistics
615
616 //if (VERSION_CS != ns->cs_version)
617 // unchecked;
618
619 char *cp = strchr (buf + 1, ' ');
620 if (!cp)
621 return;
622
623 ns->sc_version = atoi (cp);
624
625 //if (VERSION_SC != ns->sc_version)
626 // unchecked;
627
628 cp = strchr (cp + 1, ' ');
629
630 if (cp)
631 {
632 ns->version = cp + 1;
633
634 if (ns->sc_version < 1026)
635 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
636 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
637 }
638 }
639
640 /** sound related functions. */
641 void
642 SetSound (char *buf, int len, client * ns)
643 {
644 ns->sound = atoi (buf);
645 }
646
647 /** client wants the map resent */
648 void
649 MapRedrawCmd (char *buf, int len, player *pl)
650 {
651 /* This function is currently disabled; just clearing the map state results in
652 * display errors. It should clear the cache and send a newmap command.
653 * Unfortunately this solution does not work because some client versions send
654 * a mapredraw command after receiving a newmap command.
655 */
656 }
657
658 /**
659 * Moves an object (typically, container to inventory).
660 * syntax is: move (to) (tag) (nrof)
661 */
662 void
663 MoveCmd (char *buf, int len, player *pl)
664 {
665 int vals[3], i;
666
667 /* A little funky here. We only cycle for 2 records, because
668 * we obviously are not going to find a space after the third
669 * record. Perhaps we should just replace this with a
670 * sscanf?
671 */
672 for (i = 0; i < 2; i++)
673 {
674 vals[i] = atoi (buf);
675
676 if (!(buf = strchr (buf, ' ')))
677 {
678 LOG (llevError, "Incomplete move command: %s\n", buf);
679 return;
680 }
681
682 buf++;
683 }
684
685 vals[2] = atoi (buf);
686
687 /* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
688 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
689 }
690
691 /******************************************************************************
692 *
693 * Start of commands the server sends to the client.
694 *
695 ******************************************************************************/
696
697 /**
698 * Asks the client to query the user. This way, the client knows
699 * it needs to send something back (vs just printing out a message)
700 */
701 void
702 send_query (client *ns, uint8 flags, const char *text)
703 {
704 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
705 }
706
707 /**
708 * Get player's current range attack in obuf.
709 */
710 static void
711 rangetostring (player *pl, char *obuf)
712 {
713 dynbuf_text buf;
714
715 if (pl->ranged_ob)
716 buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
717
718 if (pl->combat_ob)
719 buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name;
720
721 #if 0
722 //TODO: remove this when slot system is working, this is only for debugging
723 if (pl->ob->chosen_skill)
724 buf << " Skill*: " << pl->ob->chosen_skill->name;
725 #endif
726
727 //TODO: maybe golem should become the current_weapon, quite simply?
728 if (pl->golem)
729 buf << " Golem*: " << pl->golem->name;
730
731 buf << '\0';
732 buf.linearise (obuf);
733 }
734
735 #define AddIfInt64(Old,New,Type) if (Old != New) {\
736 Old = New; \
737 sl << uint8 (Type) << uint64 (New); \
738 }
739
740 #define AddIfInt(Old,New,Type) if (Old != New) {\
741 Old = New; \
742 sl << uint8 (Type) << uint32 (New); \
743 }
744
745 #define AddIfShort(Old,New,Type) if (Old != New) {\
746 Old = New; \
747 sl << uint8 (Type) << uint16 (New); \
748 }
749
750 #define AddIfFloat(Old,New,Type,mult) if (Old != New) {\
751 Old = New; \
752 sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \
753 }
754
755 #define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\
756 free(Old); Old = strdup (New);\
757 sl << uint8 (Type) << data8 (New); \
758 }
759
760 /**
761 * Sends a statistics update. We look at the old values,
762 * and only send what has changed. Stat mapping values are in newclient.h
763 * Since this gets sent a lot, this is actually one of the few binary
764 * commands for now.
765 */
766 void
767 esrv_update_stats (player *pl)
768 {
769 char buf[MAX_BUF];
770 uint16 flags;
771
772 client *ns = pl->ns;
773 if (!ns)
774 return;
775
776 object *ob = pl->observe;
777 if (!ob)
778 return;
779
780 player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl;
781
782 packet sl ("stats");
783
784 AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
785 AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
786 AddIfShort (ns->last_stats.sp, ob->stats.sp, CS_STAT_SP);
787 AddIfShort (ns->last_stats.maxsp, ob->stats.maxsp, CS_STAT_MAXSP);
788 AddIfShort (ns->last_stats.grace, ob->stats.grace, CS_STAT_GRACE);
789 AddIfShort (ns->last_stats.maxgrace, ob->stats.maxgrace, CS_STAT_MAXGRACE);
790 AddIfShort (ns->last_stats.Str, ob->stats.Str, CS_STAT_STR);
791 AddIfShort (ns->last_stats.Dex, ob->stats.Dex, CS_STAT_DEX);
792 AddIfShort (ns->last_stats.Con, ob->stats.Con, CS_STAT_CON);
793 AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);
794 AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
795 AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
796 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
797
798 for (int s = 0; s < NUM_SKILLS; s++)
799 if (object *skill = opl->last_skill_ob[s])
800 if (skill->stats.exp != ns->last_skill_exp [s])
801 {
802 ns->last_skill_exp [s] = skill->stats.exp;
803
804 /* Always send along the level if exp changes. This is only
805 * 1 extra byte, but keeps processing simpler.
806 */
807 sl << uint8 (s + CS_STAT_SKILLINFO)
808 << uint8 (skill->level)
809 << uint64 (skill->stats.exp);
810 }
811
812 AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
813 AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
814 AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
815 AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
816 AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
817 AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK);
818 AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
819 AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK);
820 AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
821
822 flags = 0;
823
824 if (opl->fire_on)
825 flags |= SF_FIREON;
826
827 if (opl->run_on)
828 flags |= SF_RUNON;
829
830 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
831
832 if (ns->sc_version < 1025)
833 { AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
834 else
835 for (int i = 0; i < NROFATTACKS; i++)
836 {
837 /* Skip ones we won't send */
838 if (atnr_cs_stat[i] == -1)
839 continue;
840
841 AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
842 }
843
844 if (pl->ns->monitor_spells)
845 {
846 AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
847 AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
848 AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
849 }
850
851 rangetostring (opl, buf); /* we want use the new fire & run system in new client */
852 AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
853 set_title (ob, buf);
854 AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
855
856 /* Only send it away if we have some actual data */
857 if (sl.length () > 6)
858 ns->send_packet (sl);
859 }
860
861 /**
862 * Tells the client that here is a player it should start using.
863 */
864 void
865 esrv_new_player (player *pl, uint32 weight)
866 {
867 packet sl ("player");
868
869 sl << uint32 (pl->ob->count)
870 << uint32 (weight)
871 << uint32 (pl->ob->face)
872 << data8 (pl->ob->name);
873
874 pl->ns->last_weight = weight;
875 pl->ns->send_packet (sl);
876 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
877 }
878
879 /******************************************************************************
880 *
881 * Start of map related commands.
882 *
883 ******************************************************************************/
884
885 /** Clears a map cell */
886 static void
887 map_clearcell (struct MapCell *cell, int count)
888 {
889 cell->faces[0] = 0;
890 cell->faces[1] = 0;
891 cell->faces[2] = 0;
892 cell->smooth[0] = 0;
893 cell->smooth[1] = 0;
894 cell->smooth[2] = 0;
895 cell->count = count;
896 cell->stat_hp = 0;
897 cell->flags = 0;
898 cell->player = 0;
899 }
900
901 #define MAX_LAYERS 3
902
903 /**
904 * Removes the need to replicate the same code for each layer.
905 * this returns true if this space is now in fact different than
906 * it was.
907 * sl is the socklist this data is going into.
908 * ns is the socket we are working on - all the info we care
909 * about is in this socket structure, so now need not pass the
910 * entire player object.
911 * layer is the layer to update, with 2 being the floor and 0 the
912 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ)
913 * take. Interesting to note that before this function, the map1 function
914 * numbers the spaces differently - I think this was a leftover from
915 * the map command, where the faces stack up. Sinces that is no longer
916 * the case, it seems to make more sense to have these layer values
917 * actually match.
918 */
919 static int
920 update_space (packet &sl, client &ns, mapspace &ms, MapCell &lastcell, int layer)
921 {
922 object *ob = ms.faces_obj [layer];
923
924 /* If there is no object for this space, or if the face for the object
925 * is the blank face, set the face number to zero.
926 * else if we have the stored head object for this space, that takes
927 * precedence over the other object for this space.
928 * otherwise, we do special head processing
929 */
930 uint16 face_num = ob && ob->face != blank_face ? ob->face : 0;
931
932 /* We've gotten what face we want to use for the object. Now see if
933 * if it has changed since we last sent it to the client.
934 */
935 if (lastcell.faces[layer] != face_num)
936 {
937 lastcell.faces[layer] = face_num;
938
939 if (!ns.faces_sent[face_num])
940 if (ob)
941 ns.send_faces (ob);
942 else
943 ns.send_face (face_num);
944
945 sl << uint16 (face_num);
946 return 1;
947 }
948
949 /* Nothing changed */
950 return 0;
951 }
952
953 /**
954 * Returns the size of a data for a map square as returned by
955 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
956 * available.
957 */
958 int
959 getExtendedMapInfoSize (client * ns)
960 {
961 int result = 0;
962
963 if (ns->ext_mapinfos)
964 {
965 if (ns->EMI_smooth)
966 result += 1; /*One byte for smoothlevel */
967 }
968
969 return result;
970 }
971
972 // prefetch (and touch) all maps within a specific distancd
973 static void
974 prefetch_surrounding_maps (maptile *map, int distance)
975 {
976 map->last_access = runtime;
977
978 if (--distance)
979 for (int dir = 4; --dir; )
980 if (const shstr &path = map->tile_path [dir])
981 if (maptile *&neigh = map->tile_map [dir])
982 prefetch_surrounding_maps (neigh, distance);
983 else
984 neigh = maptile::find_async (path, map);
985 }
986
987 // prefetch a generous area around the player
988 static void
989 prefetch_surrounding_maps (object *op)
990 {
991 prefetch_surrounding_maps (op->map, 3);
992 }
993
994 /**
995 * Draws client map.
996 */
997 void
998 draw_client_map (player *pl)
999 {
1000 object *ob = pl->observe;
1001 if (!ob->active)
1002 return;
1003
1004 maptile *plmap = ob->map;
1005
1006 /* If player is just joining the game, he isn't here yet, so the map
1007 * can get swapped out. If so, don't try to send them a map. All will
1008 * be OK once they really log in.
1009 */
1010 if (!plmap || plmap->in_memory != MAP_IN_MEMORY)
1011 return;
1012
1013 int x, y, ax, ay, startlen, max_x, max_y, oldlen;
1014 int estartlen, eoldlen;
1015 uint8 eentrysize;
1016 uint16 ewhatstart, ewhatflag;
1017 uint8 extendedinfos;
1018
1019 check_map_change (pl);
1020 prefetch_surrounding_maps (pl->ob);
1021
1022 /* do LOS after calls to update_position */
1023 if (ob != pl->ob)
1024 clear_los (pl);
1025 else if (pl->do_los)
1026 {
1027 update_los (ob);
1028 pl->do_los = 0;
1029 }
1030
1031 /**
1032 * This function uses the new map1 protocol command to send the map
1033 * to the client. It is necessary because the old map command supports
1034 * a maximum map size of 15x15.
1035 * This function is much simpler than the old one. This is because
1036 * the old function optimized to send as few face identifiers as possible,
1037 * at the expense of sending more coordinate location (coordinates were
1038 * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
1039 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1040 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1041 * and use the other 4 bits for other informatiion. For full documentation
1042 * of what we send, see the doc/Protocol file.
1043 * I will describe internally what we do:
1044 * the ns->lastmap shows how the map last looked when sent to the client.
1045 * in the lastmap structure, there is a cells array, which is set to the
1046 * maximum viewable size (As set in config.h).
1047 * in the cells, there are faces and a count value.
1048 * we use the count value to hold the darkness value. If -1, then this space
1049 * is not viewable.
1050 * we use faces[0] faces[1] faces[2] to hold what the three layers
1051 * look like.
1052 */
1053
1054 client &socket = *pl->ns;
1055
1056 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1057 packet esl;
1058
1059 startlen = sl.length ();
1060
1061 /*Extendedmapinfo structure initialisation */
1062 if (socket.ext_mapinfos)
1063 {
1064 extendedinfos = EMI_NOREDRAW;
1065
1066 if (socket.EMI_smooth)
1067 extendedinfos |= EMI_SMOOTH;
1068
1069 ewhatstart = esl.length ();
1070 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1071 could need to be taken away */
1072 eentrysize = getExtendedMapInfoSize (&socket);
1073 esl << "mapextended "
1074 << uint8 (extendedinfos)
1075 << uint8 (eentrysize);
1076
1077 estartlen = esl.length ();
1078 }
1079
1080 /* x,y are the real map locations. ax, ay are viewport relative
1081 * locations.
1082 */
1083 ay = 0;
1084
1085 /* We could do this logic as conditionals in the if statement,
1086 * but that started to get a bit messy to look at.
1087 */
1088 max_x = ob->x + (socket.mapx + 1) / 2;
1089 max_y = ob->y + (socket.mapy + 1) / 2;
1090
1091 for (y = ob->y - socket.mapy / 2; y < max_y; y++, ay++)
1092 {
1093 sint16 nx, ny;
1094 maptile *m = 0;
1095
1096 ax = 0;
1097 for (x = ob->x - socket.mapx / 2; x < max_x; x++, ax++)
1098 {
1099 // check to see if we can simply go one right quickly
1100 ++nx;
1101 if (m && nx >= m->width)
1102 m = 0;
1103
1104 if (!m)
1105 {
1106 nx = x; ny = y; m = plmap;
1107
1108 if (!xy_normalise (m, nx, ny))
1109 m = 0;
1110 }
1111
1112 int emask, mask;
1113 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1114
1115 MapCell &lastcell = socket.lastmap.cells[ax][ay];
1116
1117 /* If the coordinates are not valid, or it is too dark to see,
1118 * we tell the client as such
1119 */
1120 if (!m)
1121 {
1122 /* space is out of map. Update space and clear values
1123 * if this hasn't already been done. If the space is out
1124 * of the map, it shouldn't have a head
1125 */
1126 if (lastcell.count != -1)
1127 {
1128 sl << uint16 (mask);
1129 map_clearcell (&lastcell, -1);
1130 }
1131
1132 continue;
1133 }
1134
1135 m->touch ();
1136
1137 int d = pl->blocked_los[ax][ay];
1138
1139 if (d > 3)
1140 {
1141
1142 int need_send = 0, count;
1143
1144 /* This block deals with spaces that are not visible for whatever
1145 * reason. Still may need to send the head for this space.
1146 */
1147
1148 oldlen = sl.length ();
1149
1150 sl << uint16 (mask);
1151
1152 if (lastcell.count != -1)
1153 need_send = 1;
1154
1155 count = -1;
1156
1157 /* properly clear a previously sent big face */
1158 if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1159 || lastcell.stat_hp || lastcell.flags || lastcell.player)
1160 need_send = 1;
1161
1162 map_clearcell (&lastcell, count);
1163
1164 if ((mask & 0xf) || need_send)
1165 sl[oldlen + 1] = mask & 0xff;
1166 else
1167 sl.reset (oldlen);
1168 }
1169 else
1170 {
1171 /* In this block, the space is visible.
1172 */
1173
1174 /* Rather than try to figure out what everything that we might
1175 * need to send is, then form the packet after that,
1176 * we presume that we will in fact form a packet, and update
1177 * the bits by what we do actually send. If we send nothing,
1178 * we just back out sl.length () to the old value, and no harm
1179 * is done.
1180 * I think this is simpler than doing a bunch of checks to see
1181 * what if anything we need to send, setting the bits, then
1182 * doing those checks again to add the real data.
1183 */
1184 oldlen = sl.length ();
1185 eoldlen = esl.length ();
1186
1187 sl << uint16 (mask);
1188
1189 unsigned char dummy;
1190 unsigned char *last_ext = &dummy;
1191
1192 /* Darkness changed */
1193 if (lastcell.count != d && socket.darkness)
1194 {
1195 mask |= 0x8;
1196
1197 if (socket.extmap)
1198 {
1199 *last_ext |= 0x80;
1200 last_ext = &sl[sl.length ()];
1201 sl << uint8 (d);
1202 }
1203 else
1204 sl << uint8 (255 - 64 * d);
1205 }
1206
1207 lastcell.count = d;
1208
1209 mapspace &ms = m->at (nx, ny);
1210 ms.update ();
1211
1212 if (socket.extmap)
1213 {
1214 uint8 stat_hp = 0;
1215 uint8 stat_width = 0;
1216 uint8 flags = 0;
1217 tag_t player = 0;
1218
1219 // send hp information, if applicable
1220 if (object *op = ms.faces_obj [0])
1221 {
1222 if (op->head || op->invisible)
1223 ; // do not show
1224 else if (op->type == PLAYER
1225 || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
1226 {
1227 if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)
1228 {
1229 stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1230 stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
1231 }
1232 }
1233
1234 if (op->msg && op->msg[0] == '@')
1235 flags |= 1;
1236
1237 if (op->type == PLAYER && op != ob)
1238 player = op->count;
1239 }
1240
1241 if (lastcell.stat_hp != stat_hp)
1242 {
1243 lastcell.stat_hp = stat_hp;
1244
1245 mask |= 0x8;
1246 *last_ext |= 0x80;
1247 last_ext = &sl[sl.length ()];
1248
1249 sl << uint8 (5) << uint8 (stat_hp);
1250
1251 if (stat_width > 1)
1252 {
1253 *last_ext |= 0x80;
1254 last_ext = &sl[sl.length ()];
1255
1256 sl << uint8 (6) << uint8 (stat_width);
1257 }
1258 }
1259
1260 if (lastcell.player != player)
1261 {
1262 lastcell.player = player;
1263
1264 mask |= 0x8;
1265 *last_ext |= 0x80;
1266 last_ext = &sl[sl.length ()];
1267
1268 sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1269 }
1270
1271 if (lastcell.flags != flags)
1272 {
1273 lastcell.flags = flags;
1274
1275 mask |= 0x8;
1276 *last_ext |= 0x80;
1277 last_ext = &sl[sl.length ()];
1278
1279 sl << uint8 (8) << uint8 (flags);
1280 }
1281 }
1282
1283 /* Floor face */
1284 if (update_space (sl, socket, ms, lastcell, 2))
1285 mask |= 0x4;
1286
1287 /* Middle face */
1288 if (update_space (sl, socket, ms, lastcell, 1))
1289 mask |= 0x2;
1290
1291 if (ms.player () == ob
1292 && (ob->invisible & (ob->invisible < 50 ? 1 : 7)))
1293 {
1294 // force player to be visible to himself if invisible
1295 if (lastcell.faces[0] != ob->face)
1296 {
1297 lastcell.faces[0] = ob->face;
1298
1299 mask |= 0x1;
1300 sl << uint16 (ob->face);
1301
1302 socket.send_faces (ob);
1303 }
1304 }
1305 /* Top face */
1306 else if (update_space (sl, socket, ms, lastcell, 0))
1307 mask |= 0x1;
1308
1309 /* Check to see if we are in fact sending anything for this
1310 * space by checking the mask. If so, update the mask.
1311 * if not, reset the len to that from before adding the mask
1312 * value, so we don't send those bits.
1313 */
1314 if (mask & 0xf)
1315 sl[oldlen + 1] = mask & 0xff;
1316 else
1317 sl.reset (oldlen);
1318
1319 if (socket.ext_mapinfos)
1320 esl << uint16 (emask);
1321
1322 if (socket.EMI_smooth)
1323 {
1324 for (int layer = 2+1; layer--; )
1325 {
1326 object *ob = ms.faces_obj [layer];
1327
1328 // If there is no object for this space, or if the face for the object
1329 // is the blank face, set the smoothlevel to zero.
1330 int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1331
1332 // We've gotten what face we want to use for the object. Now see if
1333 // if it has changed since we last sent it to the client.
1334 if (lastcell.smooth[layer] != smoothlevel)
1335 {
1336 lastcell.smooth[layer] = smoothlevel;
1337 esl << uint8 (smoothlevel);
1338 emask |= 1 << layer;
1339 }
1340 }
1341
1342 if (emask & 0xf)
1343 esl[eoldlen + 1] = emask & 0xff;
1344 else
1345 esl.reset (eoldlen);
1346 }
1347 } /* else this is a viewable space */
1348 } /* for x loop */
1349 } /* for y loop */
1350
1351 socket.flush_fx ();
1352
1353 /* Verify that we in fact do need to send this */
1354 if (socket.ext_mapinfos)
1355 {
1356 if (!(sl.length () > startlen || socket.sent_scroll))
1357 {
1358 /* No map data will follow, so don't say the client
1359 * it doesn't need draw!
1360 */
1361 ewhatflag &= ~EMI_NOREDRAW;
1362 esl[ewhatstart + 1] = ewhatflag & 0xff;
1363 }
1364
1365 if (esl.length () > estartlen)
1366 socket.send_packet (esl);
1367 }
1368
1369 if (sl.length () > startlen || socket.sent_scroll)
1370 {
1371 socket.send_packet (sl);
1372 socket.sent_scroll = 0;
1373 }
1374 }
1375
1376 /*****************************************************************************/
1377 /* GROS: The following one is used to allow a plugin to send a generic cmd to*/
1378 /* a player. Of course, the client need to know the command to be able to */
1379 /* manage it ! */
1380 /*****************************************************************************/
1381 void
1382 send_plugin_custom_message (object *pl, char *buf)
1383 {
1384 pl->contr->ns->send_packet (buf);
1385 }
1386
1387 /**
1388 * This sends the skill number to name mapping. We ignore
1389 * the params - we always send the same info no matter what.
1390 */
1391 void
1392 send_skill_info (client *ns, char *params)
1393 {
1394 packet sl;
1395 sl << "replyinfo skill_info\n";
1396
1397 for (int i = 1; i < NUM_SKILLS; i++)
1398 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);
1399
1400 if (sl.length () >= MAXSOCKBUF)
1401 {
1402 LOG (llevError, "Buffer overflow in send_skill_info!\n");
1403 fatal (0);
1404 }
1405
1406 ns->send_packet (sl);
1407 }
1408
1409 /**
1410 * This sends the spell path to name mapping. We ignore
1411 * the params - we always send the same info no matter what.
1412 */
1413 void
1414 send_spell_paths (client * ns, char *params)
1415 {
1416 packet sl;
1417
1418 sl << "replyinfo spell_paths\n";
1419
1420 for (int i = 0; i < NRSPELLPATHS; i++)
1421 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1422
1423 if (sl.length () >= MAXSOCKBUF)
1424 {
1425 LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1426 fatal (0);
1427 }
1428
1429 ns->send_packet (sl);
1430 }
1431
1432 /**
1433 * This looks for any spells the player may have that have changed their stats.
1434 * it then sends an updspell packet for each spell that has changed in this way
1435 */
1436 void
1437 esrv_update_spells (player *pl)
1438 {
1439 if (!pl->ns)
1440 return;
1441
1442 if (!pl->ns->monitor_spells)
1443 return;
1444
1445 for (object *spell = pl->ob->inv; spell; spell = spell->below)
1446 {
1447 if (spell->type == SPELL)
1448 {
1449 int flags = 0;
1450
1451 /* check if we need to update it */
1452 if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))
1453 {
1454 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1455 flags |= UPD_SP_MANA;
1456 }
1457
1458 if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))
1459 {
1460 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1461 flags |= UPD_SP_GRACE;
1462 }
1463
1464 if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))
1465 {
1466 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
1467 flags |= UPD_SP_DAMAGE;
1468 }
1469
1470 if (flags)
1471 {
1472 packet sl;
1473
1474 sl << "updspell "
1475 << uint8 (flags)
1476 << uint32 (spell->count);
1477
1478 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
1479 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
1480 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
1481
1482 pl->ns->send_packet (sl);
1483 }
1484 }
1485 }
1486 }
1487
1488 void
1489 esrv_remove_spell (player *pl, object *spell)
1490 {
1491 if (!pl->ns->monitor_spells)
1492 return;
1493
1494 if (!pl || !spell || spell->env != pl->ob)
1495 {
1496 LOG (llevError, "Invalid call to esrv_remove_spell");
1497 return;
1498 }
1499
1500 packet sl ("delspell");
1501
1502 sl << uint32 (spell->count);
1503
1504 pl->ns->send_packet (sl);
1505 }
1506
1507 /* appends the spell *spell to the Socklist we will send the data to. */
1508 static void
1509 append_spell (player *pl, packet &sl, object *spell)
1510 {
1511 int i, skill = 0;
1512
1513 if (!(spell->name))
1514 {
1515 LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
1516 return;
1517 }
1518
1519 /* store costs and damage in the object struct, to compare to later */
1520 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1521 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1522 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
1523
1524 /* figure out which skill it uses, if it uses one */
1525 if (spell->skill)
1526 {
1527 for (i = 1; i < NUM_SKILLS; i++)
1528 if (!strcmp (spell->skill, skill_names[i]))
1529 {
1530 skill = i + CS_STAT_SKILLINFO;
1531 break;
1532 }
1533 }
1534
1535 // spells better have a face
1536 if (!spell->face)
1537 {
1538 LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1539 spell->face = face_find ("burnout.x11", blank_face);
1540 }
1541
1542 /* send the current values */
1543 sl << uint32 (spell->count)
1544 << uint16 (spell->level)
1545 << uint16 (spell->casting_time)
1546 << uint16 (spell->last_sp)
1547 << uint16 (spell->last_grace)
1548 << uint16 (spell->last_eat)
1549 << uint8 (skill)
1550 << uint32 (spell->path_attuned)
1551 << uint32 (spell->face)
1552 << data8 (spell->name)
1553 << data16 (spell->msg);
1554 }
1555
1556 /**
1557 * This tells the client to add the spell *ob, if *ob is NULL, then add
1558 * all spells in the player's inventory.
1559 */
1560 void
1561 esrv_add_spells (player *pl, object *spell)
1562 {
1563 if (!pl)
1564 {
1565 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player");
1566 return;
1567 }
1568
1569 if (!pl->ns->monitor_spells)
1570 return;
1571
1572 packet sl ("addspell");
1573
1574 if (!spell)
1575 {
1576 for (spell = pl->ob->inv; spell; spell = spell->below)
1577 {
1578 /* were we to simply keep appending data here, we could exceed
1579 * MAXSOCKBUF if the player has enough spells to add, we know that
1580 * append_spells will always append 19 data bytes, plus 4 length
1581 * bytes and 3 strings (because that is the spec) so we need to
1582 * check that the length of those 3 strings, plus the 23 bytes,
1583 * won't take us over the length limit for the socket, if it does,
1584 * we need to send what we already have, and restart packet formation
1585 */
1586 /* Seeing crashes by overflowed buffers. Quick arithemetic seems
1587 * to show add_spell is 26 bytes + 2 strings. However, the overun
1588 * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem
1589 * like it will fix this
1590 */
1591 if (spell->type != SPELL)
1592 continue;
1593
1594 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
1595 {
1596 pl->ns->send_packet (sl);
1597
1598 sl.reset ();
1599 sl << "addspell ";
1600 }
1601
1602 append_spell (pl, sl, spell);
1603 }
1604 }
1605 else if (spell->type != SPELL)
1606 {
1607 LOG (llevError, "Asked to send a non-spell object as a spell");
1608 return;
1609 }
1610 else
1611 append_spell (pl, sl, spell);
1612
1613 if (sl.length () >= MAXSOCKBUF)
1614 {
1615 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
1616 fatal (0);
1617 }
1618
1619 /* finally, we can send the packet */
1620 pl->ns->send_packet (sl);
1621 }
1622