ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.153
Committed: Wed Nov 4 13:46:37 2009 UTC (14 years, 6 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.152: +1 -5 lines
Log Message:
*** empty log message ***

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