ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.160
Committed: Mon Nov 9 18:47:56 2009 UTC (14 years, 6 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.159: +9 -10 lines
Log Message:
remove max_nrof from maps, make spell updates delayed

File Contents

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