ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.156
Committed: Fri Nov 6 12:49:19 2009 UTC (14 years, 7 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.155: +1 -1 lines
Log Message:
make effectively static symbols actually static, part 1

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