ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.170
Committed: Thu Apr 8 20:05:36 2010 UTC (14 years, 1 month ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.169: +0 -64 lines
Log Message:
remove support for toggleextendedtext

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