ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.130
Committed: Tue May 20 03:14:19 2008 UTC (16 years ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.129: +19 -0 lines
Log Message:
newmap optimisation

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