ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.143
Committed: Tue Dec 23 06:58:24 2008 UTC (15 years, 5 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.142: +13 -18 lines
Log Message:
wizlook

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