ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.150
Committed: Mon Oct 12 14:00:59 2009 UTC (14 years, 7 months ago) by root
Content type: text/plain
Branch: MAIN
CVS Tags: rel-2_81
Changes since 1.149: +7 -6 lines
Log Message:
clarify license

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