ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.129
Committed: Tue May 6 19:37:01 2008 UTC (16 years, 1 month ago) by root
Content type: text/plain
Branch: MAIN
CVS Tags: rel-2_54
Changes since 1.128: +5 -20 lines
Log Message:
exactly

File Contents

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