ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.101
Committed: Sun Jun 3 17:05:36 2007 UTC (16 years, 11 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.100: +65 -112 lines
Log Message:
- remove slow and unneeded cruft code from map1.
- decouple map display/stats update from ob (use pl->obsere instead)

File Contents

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