ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.169
Committed: Thu Apr 8 17:36:54 2010 UTC (14 years, 1 month ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.168: +3 -41 lines
Log Message:
move version to perl, support json versions

File Contents

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