ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
(Generate patch)

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.59 by pippijn, Sat Jan 6 14:42:31 2007 UTC vs.
Revision 1.87 by root, Thu Apr 19 11:12:46 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
3 3 *
4 Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
5 Copyright (C) 2001 Mark Wedel 5 * Copyright (C) 2001 Mark Wedel
6 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
7 7 *
8 This program is free software; you can redistribute it and/or modify 8 * This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version. 11 * (at your option) any later version.
12 12 *
13 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details. 16 * GNU General Public License for more details.
17 17 *
18 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software 19 * along with this program; if not, write to the Free Software
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 21 *
22 The author can be reached via e-mail to <crossfire@schmorp.de> 22 * The author can be reached via e-mail to <crossfire@schmorp.de>
23*/ 23 */
24 24
25/** 25/**
26 * \file 26 * \file
27 * Client handling. 27 * Client handling.
28 * 28 *
… …
36 * have the prototype of (char *data, int datalen, int client_num). This 36 * have the prototype of (char *data, int datalen, int client_num). This
37 * way, we can use one dispatch table. 37 * way, we can use one dispatch table.
38 * 38 *
39 * esrv_map_new starts updating the map 39 * esrv_map_new starts updating the map
40 * 40 *
41 * esrv_map_setbelow allows filling in all of the faces for the map.
42 * if a face has not already been sent to the client, it is sent now.
43 *
44 */ 41 */
45 42
46#include <global.h> 43#include <global.h>
47#include <sproto.h> 44#include <sproto.h>
48 45
… …
101 * that much difference in bandwidth. 98 * that much difference in bandwidth.
102 */ 99 */
103 mx = ns->mapx; 100 mx = ns->mapx;
104 my = ns->mapy; 101 my = ns->mapy;
105 102
106 if (ns->mapmode == Map1aCmd)
107 {
108 mx += MAX_HEAD_OFFSET;
109 my += MAX_HEAD_OFFSET;
110 }
111
112 /* the x and y here are coordinates for the new map, i.e. if we moved 103 /* the x and y here are coordinates for the new map, i.e. if we moved
113 * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, 104 * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason,
114 * if the destination x or y coordinate is outside the viewable 105 * if the destination x or y coordinate is outside the viewable
115 * area, we clear the values - otherwise, the old values 106 * area, we clear the values - otherwise, the old values
116 * are preserved, and the check_head thinks it needs to clear them. 107 * are preserved, and the check_head thinks it needs to clear them.
… …
141static void 132static void
142clear_map (player *pl) 133clear_map (player *pl)
143{ 134{
144 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); 135 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
145 136
137 pl->ns->force_newmap = false;
138
146 if (pl->ns->newmapcmd == 1) 139 if (pl->ns->newmapcmd == 1)
147 pl->ns->send_packet ("newmap"); 140 pl->ns->send_packet ("newmap");
148 141
149 pl->ns->floorbox_reset (); 142 pl->ns->floorbox_reset ();
150} 143}
151 144
152/** check for map change and send new map data */ 145/** check for map/region change and send new map data */
153static void 146static void
154check_map_change (player *pl) 147check_map_change (player *pl)
155{ 148{
156 client &socket = *pl->ns; 149 client &socket = *pl->ns;
157 object *ob = pl->ob; 150 object *ob = pl->ob;
158 char buf[MAX_BUF]; /* eauugggh */ 151 char buf[MAX_BUF]; /* eauugggh */
159 152
160 if (socket.current_map != ob->map) 153 if (socket.current_map != ob->map || socket.force_newmap)
161 { 154 {
155 clear_map (pl);
162 socket.current_map = ob->map; 156 socket.current_map = ob->map;
163
164 clear_map (pl);
165 157
166 if (socket.mapinfocmd) 158 if (socket.mapinfocmd)
167 { 159 {
168 if (ob->map && ob->map->path[0]) 160 if (ob->map && ob->map->path[0])
169 { 161 {
… …
201 } 193 }
202 } 194 }
203 195
204 socket.current_x = ob->x; 196 socket.current_x = ob->x;
205 socket.current_y = ob->y; 197 socket.current_y = ob->y;
198
199 region *reg = ob->region ();
200 if (socket.current_region != reg)
201 {
202 socket.current_region = reg;
203 socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);
204 }
206} 205}
207 206
208/** 207/**
209 * RequestInfo is sort of a meta command. There is some specific 208 * RequestInfo is sort of a meta command. There is some specific
210 * request of information, but we call other functions to provide 209 * request of information, but we call other functions to provide
… …
346 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 345 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);
347 346
348 pl->ns->send_packet (bigbuf); 347 pl->ns->send_packet (bigbuf);
349} 348}
350 349
351/** This is the Setup cmd - easy first implementation */ 350/** This is the Setup cmd */
352void 351void
353SetUp (char *buf, int len, client * ns) 352SetUp (char *buf, int len, client * ns)
354{ 353{
355 int s, slen; 354 INVOKE_CLIENT (SETUP, ns, ARG_DATA (buf, len));
356 char *cmd, *param, cmdback[HUGE_BUF];
357
358 /* run through the cmds of setup
359 * syntax is setup <cmdname1> <parameter> <cmdname2> <parameter> ...
360 *
361 * we send the status of the cmd back, or a FALSE is the cmd is the server unknown
362 * The client then must sort this out
363 */
364
365 //LOG (llevInfo, "Get SetupCmd:: %s\n", buf);
366
367 strcpy (cmdback, "setup");
368 for (s = 0; s < len; )
369 {
370 cmd = &buf[s];
371
372 /* find the next space, and put a null there */
373 for (; buf[s] && buf[s] != ' '; s++)
374 ;
375
376 buf[s++] = 0;
377
378 while (buf[s] == ' ')
379 s++;
380
381 if (s >= len)
382 break;
383
384 param = &buf[s];
385
386 for (; buf[s] && buf[s] != ' '; s++)
387 ;
388
389 buf[s++] = 0;
390
391 while (buf[s] == ' ')
392 s++;
393
394 slen = strlen (cmdback);
395 safe_strcat (cmdback, " ", &slen, HUGE_BUF);
396 safe_strcat (cmdback, cmd, &slen, HUGE_BUF);
397 safe_strcat (cmdback, " ", &slen, HUGE_BUF);
398
399 if (!strcmp (cmd, "sound"))
400 {
401 ns->sound = atoi (param);
402 safe_strcat (cmdback, param, &slen, HUGE_BUF);
403 }
404 else if (!strcmp (cmd, "exp64"))
405 safe_strcat (cmdback, param, &slen, HUGE_BUF);
406 else if (!strcmp (cmd, "spellmon"))
407 {
408 ns->monitor_spells = atoi (param);
409 safe_strcat (cmdback, param, &slen, HUGE_BUF);
410 }
411 else if (!strcmp (cmd, "darkness"))
412 {
413 ns->darkness = atoi (param);
414 safe_strcat (cmdback, param, &slen, HUGE_BUF);
415 }
416 else if (!strcmp (cmd, "map1cmd"))
417 {
418 if (atoi (param))
419 ns->mapmode = Map1Cmd;
420 /* if beyond this size, need to use map1cmd no matter what */
421 if (ns->mapx > 11 || ns->mapy > 11)
422 ns->mapmode = Map1Cmd;
423 safe_strcat (cmdback, ns->mapmode == Map1Cmd ? "1" : "0", &slen, HUGE_BUF);
424 }
425 else if (!strcmp (cmd, "map1acmd"))
426 {
427 if (atoi (param))
428 ns->mapmode = Map1aCmd;
429 /* if beyond this size, need to use map1acmd no matter what */
430 if (ns->mapx > 11 || ns->mapy > 11)
431 ns->mapmode = Map1aCmd;
432 safe_strcat (cmdback, ns->mapmode == Map1aCmd ? "1" : "0", &slen, HUGE_BUF);
433 }
434 else if (!strcmp (cmd, "newmapcmd"))
435 {
436 ns->newmapcmd = atoi (param);
437 safe_strcat (cmdback, param, &slen, HUGE_BUF);
438// } else if (!strcmp(cmd,"plugincmd")) {
439// ns->plugincmd = atoi(param);
440// safe_strcat(cmdback, param, &slen, HUGE_BUF);
441 }
442 else if (!strcmp (cmd, "mapinfocmd"))
443 {
444 ns->mapinfocmd = atoi (param);
445 safe_strcat (cmdback, "1", &slen, HUGE_BUF);
446 }
447 else if (!strcmp (cmd, "extcmd"))
448 {
449 ns->extcmd = atoi (param);
450 safe_strcat (cmdback, "1", &slen, HUGE_BUF);
451 }
452 else if (!strcmp (cmd, "extmap"))
453 {
454 ns->extmap = atoi (param);
455 safe_strcat (cmdback, "1", &slen, HUGE_BUF);
456 }
457 else if (!strcmp (cmd, "facecache"))
458 {
459 ns->facecache = atoi (param);
460 safe_strcat (cmdback, param, &slen, HUGE_BUF);
461 }
462 else if (!strcmp (cmd, "faceset"))
463 {
464 char tmpbuf[20];
465 int q = atoi (param);
466
467 if (is_valid_faceset (q))
468 ns->faceset = q;
469 sprintf (tmpbuf, "%d", ns->faceset);
470 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
471 /* if the client is using faceset, it knows about image2 command */
472 ns->image2 = 1;
473 }
474 else if (!strcmp (cmd, "itemcmd"))
475 {
476 /* Version of the item protocol command to use. Currently,
477 * only supported versions are 1 and 2. Using a numeric
478 * value will make it very easy to extend this in the future.
479 */
480 char tmpbuf[20];
481 int q = atoi (param);
482
483 if (q < 1 || q > 2)
484 {
485 strcpy (tmpbuf, "FALSE");
486 }
487 else
488 {
489 ns->itemcmd = q;
490 sprintf (tmpbuf, "%d", ns->itemcmd);
491 }
492 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
493 }
494 else if (!strcmp (cmd, "mapsize"))
495 {
496 int x, y = 0;
497 char tmpbuf[MAX_BUF], *cp;
498
499 x = atoi (param);
500 for (cp = param; *cp != 0; cp++)
501 if (*cp == 'x' || *cp == 'X')
502 {
503 y = atoi (cp + 1);
504 break;
505 }
506 if (x < 9 || y < 9 || x > MAP_CLIENT_X || y > MAP_CLIENT_Y)
507 {
508 sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y);
509 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
510 }
511 else
512 {
513 ns->mapx = x;
514 ns->mapy = y;
515 /* better to send back what we are really using and not the
516 * param as given to us in case it gets parsed differently.
517 */
518 sprintf (tmpbuf, "%dx%d", x, y);
519 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
520 /* If beyond this size and still using orig map command, need to
521 * go to map1cmd.
522 */
523 if ((x > 11 || y > 11) && ns->mapmode == Map0Cmd)
524 ns->mapmode = Map1Cmd;
525 }
526 }
527 else if (!strcmp (cmd, "extendedMapInfos"))
528 {
529 /* Added by tchize
530 * prepare to use the mapextended command
531 */
532 char tmpbuf[20];
533
534 ns->ext_mapinfos = (atoi (param));
535 sprintf (tmpbuf, "%d", ns->ext_mapinfos);
536 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
537 }
538 else if (!strcmp (cmd, "extendedTextInfos"))
539 {
540 /* Added by tchize
541 * prepare to use the extended text commands
542 * Client toggle this to non zero to get exttext
543 */
544 char tmpbuf[20];
545
546 ns->has_readable_type = (atoi (param));
547 sprintf (tmpbuf, "%d", ns->has_readable_type);
548 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
549 }
550 else
551 {
552 /* Didn't get a setup command we understood -
553 * report a failure to the client.
554 */
555 safe_strcat (cmdback, "FALSE", &slen, HUGE_BUF);
556 }
557 } /* for processing all the setup commands */
558
559 LOG (llevInfo, "SendBack SetupCmd:: %s\n", cmdback);
560 ns->send_packet (cmdback);
561} 355}
562 356
563/** 357/**
564 * The client has requested to be added to the game. 358 * The client has requested to be added to the game.
565 * This is what takes care of it. We tell the client how things worked out. 359 * This is what takes care of it. We tell the client how things worked out.
566 * I am not sure if this file is the best place for this function. however, 360 * I am not sure if this file is the best place for this function. however,
567 * it either has to be here or init_sockets needs to be exported. 361 * it either has to be here or init_sockets needs to be exported.
568 */ 362 */
569void 363void
570AddMeCmd (char *buf, int len, client * ns) 364AddMeCmd (char *buf, int len, client *ns)
571{ 365{
572 INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); 366 INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
573} 367}
574 368
575/** Reply to ExtendedInfos command */ 369/** Reply to ExtendedInfos command */
… …
687 481
688 ns->send_packet (cmdback); 482 ns->send_packet (cmdback);
689} 483}
690 484
691/** 485/**
692 * A lot like the old AskSmooth (in fact, now called by AskSmooth). 486 * client requested an image. send it rate-limited
693 * Basically, it makes no sense to wait for the client to request a 487 * before flushing.
694 * a piece of data from us that we know the client wants. So
695 * if we know the client wants it, might as well push it to the
696 * client.
697 */
698static void
699SendSmooth (client *ns, uint16 face)
700{
701 uint16 smoothface;
702
703 /* If we can't find a face, return and set it so we won't try to send this
704 * again.
705 */ 488 */
706 if ((!FindSmooth (face, &smoothface)) && (!FindSmooth (smooth_face->number, &smoothface))) 489void
707 { 490AskFaceCmd (char *buf, int len, client *ns)
708 491{
709 LOG (llevError, "could not findsmooth for %d. Neither default (%s)\n", face, &smooth_face->name); 492 ns->askface.push_back (atoi (buf));
710 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
711 return;
712 }
713
714 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
715 esrv_send_face (ns, smoothface, 0);
716
717 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
718
719 packet sl ("smooth");
720
721 sl << uint16 (face)
722 << uint16 (smoothface);
723
724 ns->send_packet (sl);
725} 493}
726 494
727 /** 495/**
728 * Tells client the picture it has to use 496 * Tells client the picture it has to use
729 * to smooth a picture number given as argument. 497 * to smooth a picture number given as argument.
730 */ 498 */
731void 499void
732AskSmooth (char *buf, int len, client *ns) 500AskSmooth (char *buf, int len, client *ns)
733{ 501{
734 SendSmooth (ns, atoi (buf)); 502 ns->send_face (atoi (buf));
503 ns->flush_fx ();
735} 504}
736 505
737/** 506/**
738 * This handles the general commands from the client (ie, north, fire, cast, 507 * This handles the general commands from the client (ie, north, fire, cast,
739 * etc.) 508 * etc.)
… …
798 * commands. 567 * commands.
799 */ 568 */
800 pl->count = 0; 569 pl->count = 0;
801 570
802 //TODO: schmorp thinks whatever this calculates, it makes no sense at all 571 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
803 int time = FABS (pl->ob->speed) < 0.001 572 int time = fabs (pl->ob->speed) < 0.001
804 ? time = MAX_TIME * 100 573 ? time = MAX_TIME * 100
805 : time = (int) (MAX_TIME / FABS (pl->ob->speed)); 574 : time = (int) (MAX_TIME / fabs (pl->ob->speed));
806 575
807 /* Send confirmation of command execution now */ 576 /* Send confirmation of command execution now */
808 packet sl ("comc"); 577 packet sl ("comc");
809 sl << uint16 (cmdid) << uint32 (time); 578 sl << uint16 (cmdid) << uint32 (time);
810 pl->ns->send_packet (sl); 579 pl->ns->send_packet (sl);
… …
846 615
847 case ST_CHANGE_CLASS: 616 case ST_CHANGE_CLASS:
848 key_change_class (pl->ob, buf[0]); 617 key_change_class (pl->ob, buf[0]);
849 break; 618 break;
850 619
851 case ST_CONFIRM_QUIT:
852 key_confirm_quit (pl->ob, buf[0]);
853 break;
854
855 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 620 case ST_GET_PARTY_PASSWORD: /* Get password for party */
856 receive_party_password (pl->ob, 13); 621 receive_party_password (pl->ob, 13);
857 break; 622 break;
858 623
859 default: 624 default:
… …
879 644
880 ns->cs_version = atoi (buf); 645 ns->cs_version = atoi (buf);
881 ns->sc_version = ns->cs_version; 646 ns->sc_version = ns->cs_version;
882 647
883 LOG (llevDebug, "connection from client <%s>\n", buf); 648 LOG (llevDebug, "connection from client <%s>\n", buf);
884
885 649
886 //TODO: should log here just for statistics 650 //TODO: should log here just for statistics
887 651
888 //if (VERSION_CS != ns->cs_version) 652 //if (VERSION_CS != ns->cs_version)
889 // unchecked; 653 // unchecked;
… …
969/** 733/**
970 * Asks the client to query the user. This way, the client knows 734 * Asks the client to query the user. This way, the client knows
971 * it needs to send something back (vs just printing out a message) 735 * it needs to send something back (vs just printing out a message)
972 */ 736 */
973void 737void
974send_query (client *ns, uint8 flags, char *text) 738send_query (client *ns, uint8 flags, const char *text)
975{ 739{
976 ns->send_packet_printf ("query %d %s", flags, text ? text : ""); 740 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
977} 741}
978 742
979#define AddIfInt64(Old,New,Type) if (Old != New) {\ 743#define AddIfInt64(Old,New,Type) if (Old != New) {\
… …
1011esrv_update_stats (player *pl) 775esrv_update_stats (player *pl)
1012{ 776{
1013 char buf[MAX_BUF]; 777 char buf[MAX_BUF];
1014 uint16 flags; 778 uint16 flags;
1015 779
780 client *ns = pl->ns;
1016 if (!pl->ns) 781 if (!ns)
1017 return; 782 return;
1018 783
784 object *ob = pl->ob;
785 if (!ob)
786 return;
787
1019 packet sl ("stats"); 788 packet sl ("stats");
1020 789
1021 if (pl->ob)
1022 {
1023 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); 790 AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
1024 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); 791 AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
1025 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); 792 AddIfShort (ns->last_stats.sp, ob->stats.sp, CS_STAT_SP);
1026 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); 793 AddIfShort (ns->last_stats.maxsp, ob->stats.maxsp, CS_STAT_MAXSP);
1027 AddIfShort (pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE); 794 AddIfShort (ns->last_stats.grace, ob->stats.grace, CS_STAT_GRACE);
1028 AddIfShort (pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE); 795 AddIfShort (ns->last_stats.maxgrace, ob->stats.maxgrace, CS_STAT_MAXGRACE);
1029 AddIfShort (pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR); 796 AddIfShort (ns->last_stats.Str, ob->stats.Str, CS_STAT_STR);
1030 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); 797 AddIfShort (ns->last_stats.Dex, ob->stats.Dex, CS_STAT_DEX);
1031 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); 798 AddIfShort (ns->last_stats.Con, ob->stats.Con, CS_STAT_CON);
1032 AddIfShort (pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT); 799 AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);
1033 AddIfShort (pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS); 800 AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
1034 AddIfShort (pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW); 801 AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
1035 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); 802 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
1036 }
1037 803
1038 for (int s = 0; s < NUM_SKILLS; s++) 804 for (int s = 0; s < NUM_SKILLS; s++)
1039 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) 805 if (object *skill = pl->last_skill_ob[s])
806 if (skill->stats.exp != ns->last_skill_exp [s])
1040 { 807 {
808 ns->last_skill_exp [s] = skill->stats.exp;
809
1041 /* Always send along the level if exp changes. This is only 810 /* Always send along the level if exp changes. This is only
1042 * 1 extra byte, but keeps processing simpler. 811 * 1 extra byte, but keeps processing simpler.
1043 */ 812 */
1044 sl << uint8 (s + CS_STAT_SKILLINFO) 813 sl << uint8 (s + CS_STAT_SKILLINFO)
1045 << uint8 (pl->last_skill_ob[s]->level) 814 << uint8 (skill->level)
1046 << uint64 (pl->last_skill_ob[s]->stats.exp); 815 << uint64 (skill->stats.exp);
1047
1048 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1049 } 816 }
1050 817
1051 AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64); 818 AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
1052 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); 819 AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
1053 AddIfShort (pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC); 820 AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
1054 AddIfShort (pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC); 821 AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
1055 AddIfShort (pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM); 822 AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
1056 AddIfFloat (pl->last_speed, pl->ob->speed, CS_STAT_SPEED); 823 AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED);
1057 AddIfShort (pl->last_stats.food, pl->ob->stats.food, CS_STAT_FOOD); 824 AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
1058 AddIfFloat (pl->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); 825 AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);
1059 AddIfInt (pl->last_weight_limit, (sint32) weight_limit[pl->ob->stats.Str], CS_STAT_WEIGHT_LIM); 826 AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
827
1060 flags = 0; 828 flags = 0;
1061 829
1062 if (pl->fire_on) 830 if (pl->fire_on)
1063 flags |= SF_FIREON; 831 flags |= SF_FIREON;
1064 832
1065 if (pl->run_on) 833 if (pl->run_on)
1066 flags |= SF_RUNON; 834 flags |= SF_RUNON;
1067 835
1068 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 836 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
1069 837
1070 if (pl->ns->sc_version < 1025) 838 if (ns->sc_version < 1025)
1071 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } 839 { AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1072 else 840 else
1073 for (int i = 0; i < NROFATTACKS; i++) 841 for (int i = 0; i < NROFATTACKS; i++)
1074 { 842 {
1075 /* Skip ones we won't send */ 843 /* Skip ones we won't send */
1076 if (atnr_cs_stat[i] == -1) 844 if (atnr_cs_stat[i] == -1)
1077 continue; 845 continue;
1078 846
1079 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); 847 AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
1080 } 848 }
1081 849
1082 if (pl->ns->monitor_spells) 850 if (pl->ns->monitor_spells)
1083 { 851 {
1084 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); 852 AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1085 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); 853 AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
1086 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); 854 AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
1087 } 855 }
1088 856
1089 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */ 857 rangetostring (ob, buf); /* we want use the new fire & run system in new client */
1090 AddIfString (pl->ns->stats.range, buf, CS_STAT_RANGE); 858 AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
1091 set_title (pl->ob, buf); 859 set_title (ob, buf);
1092 AddIfString (pl->ns->stats.title, buf, CS_STAT_TITLE); 860 AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
1093 861
1094 /* Only send it away if we have some actual data */ 862 /* Only send it away if we have some actual data */
1095 if (sl.length () > 6) 863 if (sl.length () > 6)
1096 pl->ns->send_packet (sl); 864 ns->send_packet (sl);
1097} 865}
1098 866
1099/** 867/**
1100 * Tells the client that here is a player it should start using. 868 * Tells the client that here is a player it should start using.
1101 */ 869 */
1102void 870void
1103esrv_new_player (player *pl, uint32 weight) 871esrv_new_player (player *pl, uint32 weight)
1104{ 872{
1105 pl->last_weight = weight;
1106
1107 packet sl ("player"); 873 packet sl ("player");
1108 874
1109 sl << uint32 (pl->ob->count) 875 sl << uint32 (pl->ob->count)
1110 << uint32 (weight) 876 << uint32 (weight)
1111 << uint32 (pl->ob->face->number) 877 << uint32 (pl->ob->face)
1112 << data8 (pl->ob->name); 878 << data8 (pl->ob->name);
1113 879
880 pl->ns->last_weight = weight;
1114 pl->ns->send_packet (sl); 881 pl->ns->send_packet (sl);
1115 SET_FLAG (pl->ob, FLAG_CLIENT_SENT); 882 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1116} 883}
1117
1118/**
1119 * Need to send an animation sequence to the client.
1120 * We will send appropriate face commands to the client if we haven't
1121 * sent them the face yet (this can become quite costly in terms of
1122 * how much we are sending - on the other hand, this should only happen
1123 * when the player logs in and picks stuff up.
1124 */
1125void
1126esrv_send_animation (client * ns, short anim_num)
1127{
1128 /* Do some checking on the anim_num we got. Note that the animations
1129 * are added in contigous order, so if the number is in the valid
1130 * range, it must be a valid animation.
1131 */
1132 if (anim_num < 0 || anim_num > num_animations)
1133 {
1134 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1135 return;
1136 }
1137
1138 packet sl ("anim");
1139
1140 sl << uint16 (anim_num)
1141 << uint16 (0); /* flags - not used right now */
1142
1143 /* Build up the list of faces. Also, send any information (ie, the
1144 * the face itself) down to the client.
1145 */
1146 for (int i = 0; i < animations[anim_num].num_animations; i++)
1147 {
1148 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1149 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1150
1151 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1152 }
1153
1154 ns->send_packet (sl);
1155
1156 ns->anims_sent[anim_num] = 1;
1157}
1158
1159 884
1160/****************************************************************************** 885/******************************************************************************
1161 * 886 *
1162 * Start of map related commands. 887 * Start of map related commands.
1163 * 888 *
1164 ******************************************************************************/ 889 ******************************************************************************/
1165 890
1166/**
1167 * This adds face_num to a map cell at x,y. If the client doesn't have
1168 * the face yet, we will also send it.
1169 */
1170static void
1171esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1172{
1173 if (newmap->cells[x][y].count >= MAP_LAYERS)
1174 {
1175 //TODO: one or the other, can't both have abort and return, verify and act
1176 LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1177 return;
1178 abort ();
1179 }
1180
1181 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1182 newmap->cells[x][y].count++;
1183
1184 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1185 esrv_send_face (ns, face_num, 0);
1186}
1187
1188/** Clears a map cell */ 891/** Clears a map cell */
1189static void 892static void
1190map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) 893map_clearcell (struct MapCell *cell, int count)
1191{ 894{
1192 cell->faces[0] = face0; 895 cell->faces[0] = 0;
1193 cell->faces[1] = face1; 896 cell->faces[1] = 0;
1194 cell->faces[2] = face2; 897 cell->faces[2] = 0;
898 cell->smooth[0] = 0;
899 cell->smooth[1] = 0;
900 cell->smooth[2] = 0;
1195 cell->count = count; 901 cell->count = count;
1196 cell->stat_hp = 0; 902 cell->stat_hp = 0;
1197 cell->flags = 0; 903 cell->flags = 0;
1198 cell->player = 0; 904 cell->player = 0;
1199} 905}
1200 906
1201#define MAX_HEAD_POS MAX(MAX_CLIENT_X, MAX_CLIENT_Y)
1202#define MAX_LAYERS 3 907#define MAX_LAYERS 3
1203
1204/* Using a global really isn't a good approach, but saves the over head of
1205 * allocating and deallocating such a block of data each time run through,
1206 * and saves the space of allocating this in the socket object when we only
1207 * need it for this cycle. If the server is ever threaded, this needs to be
1208 * re-examined.
1209 */
1210static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1211
1212/**
1213 * Returns true if any of the heads for this
1214 * space is set. Returns false if all are blank - this is used
1215 * for empty space checking.
1216 */
1217static inline int
1218have_head (int ax, int ay)
1219{
1220 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1221 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1222 return 1;
1223
1224 return 0;
1225}
1226
1227/**
1228 * check_head is a bit simplistic version of update_space below.
1229 * basically, it only checks the that the head on space ax,ay at layer
1230 * needs to get sent - if so, it adds the data, sending the head
1231 * if needed, and returning 1. If this no data needs to get
1232 * sent, it returns zero.
1233 */
1234static int
1235check_head (packet &sl, client &ns, int ax, int ay, int layer)
1236{
1237 short face_num;
1238
1239 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1240 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
1241 else
1242 face_num = 0;
1243
1244 if (face_num != ns.lastmap.cells[ax][ay].faces[layer])
1245 {
1246 sl << uint16 (face_num);
1247 if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE))
1248 esrv_send_face (&ns, face_num, 0);
1249
1250 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL;
1251 ns.lastmap.cells[ax][ay].faces[layer] = face_num;
1252 return 1;
1253 }
1254
1255 return 0; /* No change */
1256}
1257 908
1258/** 909/**
1259 * Removes the need to replicate the same code for each layer. 910 * Removes the need to replicate the same code for each layer.
1260 * this returns true if this space is now in fact different than 911 * this returns true if this space is now in fact different than
1261 * it was. 912 * it was.
1262 * sl is the socklist this data is going into. 913 * sl is the socklist this data is going into.
1263 * ns is the socket we are working on - all the info we care 914 * ns is the socket we are working on - all the info we care
1264 * about is in this socket structure, so now need not pass the 915 * about is in this socket structure, so now need not pass the
1265 * entire player object. 916 * entire player object.
1266 * mx and my are map coordinate offsets for map mp
1267 * sx and sy are the offsets into the socket structure that
1268 * holds the old values.
1269 * layer is the layer to update, with 2 being the floor and 0 the 917 * layer is the layer to update, with 2 being the floor and 0 the
1270 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ) 918 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ)
1271 * take. Interesting to note that before this function, the map1 function 919 * take. Interesting to note that before this function, the map1 function
1272 * numbers the spaces differently - I think this was a leftover from 920 * numbers the spaces differently - I think this was a leftover from
1273 * the map command, where the faces stack up. Sinces that is no longer 921 * the map command, where the faces stack up. Sinces that is no longer
1274 * the case, it seems to make more sense to have these layer values 922 * the case, it seems to make more sense to have these layer values
1275 * actually match. 923 * actually match.
1276 */ 924 */
1277static int 925static int
1278update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 926update_space (packet &sl, client &ns, mapspace &ms, MapCell &lastcell, int layer)
1279{ 927{
1280 object *ob, *head; 928 object *ob = ms.faces_obj [layer];
1281 uint16 face_num;
1282 int bx, by, i;
1283
1284 /* If there is a multipart object stored away, treat that as more important.
1285 * If not, then do the normal processing.
1286 */
1287 head = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer];
1288
1289 /* Check to see if this head is part of the set of objects
1290 * we would normally send for this space. If so, then
1291 * don't use the head value. We need to do the check
1292 * here and not when setting up the heads[] value for two reasons -
1293 * 1) the heads[] values will get used even if the space is not visible.
1294 * 2) its possible the head is not on the same map as a part, and I'd
1295 * rather not need to do the map translation overhead.
1296 * 3) We need to do some extra checking to make sure that we will
1297 * otherwise send the image as this layer, eg, either it matches
1298 * the head value, or is not multipart.
1299 */
1300 if (head && !head->more)
1301 {
1302 for (i = 0; i < MAP_LAYERS; i++)
1303 {
1304 ob = GET_MAP_FACE_OBJ (mp, mx, my, i);
1305 if (!ob)
1306 continue;
1307
1308 if (ob->head)
1309 ob = ob->head;
1310
1311 if (ob == head)
1312 {
1313 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer] = NULL;
1314 head = NULL;
1315 break;
1316 }
1317 }
1318 }
1319
1320 ob = head;
1321 if (!ob)
1322 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1323 929
1324 /* If there is no object for this space, or if the face for the object 930 /* If there is no object for this space, or if the face for the object
1325 * is the blank face, set the face number to zero. 931 * is the blank face, set the face number to zero.
1326 * else if we have the stored head object for this space, that takes 932 * else if we have the stored head object for this space, that takes
1327 * precedence over the other object for this space. 933 * precedence over the other object for this space.
1328 * otherwise, we do special head processing 934 * otherwise, we do special head processing
1329 */ 935 */
1330 if (!ob || ob->face == blank_face) 936 uint16 face_num = ob && ob->face != blank_face ? ob->face : 0;
1331 face_num = 0;
1332 else if (head)
1333 {
1334 /* if this is a head that had previously been stored */
1335 face_num = ob->face->number;
1336 }
1337 else
1338 {
1339 /* if the faces for the different parts of a multipart object
1340 * are the same, we only want to send the bottom right most
1341 * portion of the object. That info is in the tail_.. values
1342 * of the head. Note that for the head itself, ob->head will
1343 * be null, so we only do this block if we are working on
1344 * a tail piece.
1345 */
1346
1347 /* tail_x and tail_y will only be set in the head object. If
1348 * this is the head object and these are set, we proceed
1349 * with logic to only send bottom right. Similarly, if
1350 * this is one of the more parts but the head has those values
1351 * set, we want to do the processing. There can be cases where
1352 * the head is not visible but one of its parts is, so we just
1353 * can always expect that ob->arch->tail_x will be true for all
1354 * object we may want to display.
1355 */
1356 if ((ob->arch->tail_x || ob->arch->tail_y) || (ob->head && (ob->head->arch->tail_x || ob->head->arch->tail_y)))
1357 {
1358
1359 if (ob->head)
1360 head = ob->head;
1361 else
1362 head = ob;
1363
1364 /* Basically figure out where the offset is from where we are right
1365 * now. the ob->arch->clone.{x,y} values hold the offset that this current
1366 * piece is from the head, and the tail is where the tail is from the
1367 * head. Note that bx and by will equal sx and sy if we are already working
1368 * on the bottom right corner. If ob is the head, the clone values
1369 * will be zero, so the right thing will still happen.
1370 */
1371 bx = sx + head->arch->tail_x - ob->arch->clone.x;
1372 by = sy + head->arch->tail_y - ob->arch->clone.y;
1373
1374 /* I don't think this can ever happen, but better to check for it just
1375 * in case.
1376 */
1377 if (bx < sx || by < sy)
1378 {
1379 LOG (llevError, "update_space: bx (%d) or by (%d) is less than sx (%d) or sy (%d)\n", bx, by, sx, sy);
1380 face_num = 0;
1381 }
1382 /* single part object, multipart object with non merged faces,
1383 * of multipart object already at lower right.
1384 */
1385 else if (bx == sx && by == sy)
1386 {
1387 face_num = ob->face->number;
1388
1389 /* if this face matches one stored away, clear that one away.
1390 * this code relies on the fact that the map1 commands
1391 * goes from 2 down to 0.
1392 */
1393 for (i = 0; i < MAP_LAYERS; i++)
1394 if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] &&
1395 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i]->face->number == face_num)
1396 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] = NULL;
1397 }
1398 else
1399 {
1400 /* If this head is stored away, clear it - otherwise,
1401 * there can be cases where a object is on multiple layers -
1402 * we only want to send it once.
1403 */
1404 face_num = head->face->number;
1405 for (i = 0; i < MAP_LAYERS; i++)
1406 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] &&
1407 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i]->face->number == face_num)
1408 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = NULL;
1409
1410 /* First, try to put the new head on the same layer. If that is used up,
1411 * then find another layer.
1412 */
1413 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] == NULL)
1414 {
1415 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] = head;
1416 }
1417 else
1418 for (i = 0; i < MAX_LAYERS; i++)
1419 {
1420 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == NULL ||
1421 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == head)
1422 {
1423 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = head;
1424 }
1425 }
1426 face_num = 0; /* Don't send this object - we'll send the head later */
1427 }
1428 }
1429 else
1430 {
1431 /* In this case, we are already at the lower right or single part object,
1432 * so nothing special
1433 */
1434 face_num = ob->face->number;
1435
1436 /* clear out any head entries that have the same face as this one */
1437 for (bx = 0; bx < layer; bx++)
1438 if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] &&
1439 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx]->face->number == face_num)
1440 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] = NULL;
1441 }
1442 } /* else not already head object or blank face */
1443
1444 /* This is a real hack. Basically, if we have nothing to send for this layer,
1445 * but there is a head on the next layer, send that instead.
1446 * Without this, what happens is you can get the case where the player stands
1447 * on the same space as the head. However, if you have overlapping big objects
1448 * of the same type, what happens then is it doesn't think it needs to send
1449 * This tends to make stacking also work/look better.
1450 */
1451 if (!face_num && layer > 0 && heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1])
1452 {
1453 face_num = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1]->face->number;
1454 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1] = NULL;
1455 }
1456
1457 /* Another hack - because of heads and whatnot, this face may match one
1458 * we already sent for a lower layer. In that case, don't send
1459 * this one.
1460 */
1461 if (face_num && layer + 1 < MAP_LAYERS && ns.lastmap.cells[sx][sy].faces[layer + 1] == face_num)
1462 face_num = 0;
1463 937
1464 /* We've gotten what face we want to use for the object. Now see if 938 /* We've gotten what face we want to use for the object. Now see if
1465 * if it has changed since we last sent it to the client. 939 * if it has changed since we last sent it to the client.
1466 */ 940 */
1467 if (ns.lastmap.cells[sx][sy].faces[layer] != face_num) 941 if (lastcell.faces[layer] != face_num)
1468 { 942 {
1469 ns.lastmap.cells[sx][sy].faces[layer] = face_num; 943 lastcell.faces[layer] = face_num;
944
1470 if (!(ns.faces_sent[face_num] & NS_FACESENT_FACE)) 945 if (!ns.faces_sent[face_num])
946 if (ob)
947 ns.send_faces (ob);
948 else
1471 esrv_send_face (&ns, face_num, 0); 949 ns.send_face (face_num);
1472 950
1473 sl << uint16 (face_num); 951 sl << uint16 (face_num);
1474 return 1;
1475 }
1476
1477 /* Nothing changed */
1478 return 0;
1479}
1480
1481/**
1482 * This function is mainly a copy of update_space,
1483 * except it handles update of the smoothing updates,
1484 * not the face updates.
1485 * Removes the need to replicate the same code for each layer.
1486 * this returns true if this smooth is now in fact different
1487 * than it was.
1488 * sl is the socklist this data is going into.
1489 * ns is the socket we are working on - all the info we care
1490 * about is in this socket structure, so know need to pass the
1491 * entire player object.
1492 * mx and my are map coordinate offsets for map mp
1493 * sx and sy are the offsets into the socket structure that
1494 * holds the old values.
1495 * layer is the layer to update, with 2 being the floor and 0 the
1496 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1497 * take.
1498 */
1499
1500static inline int
1501update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1502{
1503 object *ob;
1504 int smoothlevel; /* old face_num; */
1505
1506 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1507
1508 /* If there is no object for this space, or if the face for the object
1509 * is the blank face, set the smoothlevel to zero.
1510 */
1511 if (!ob || ob->face == blank_face)
1512 smoothlevel = 0;
1513 else
1514 {
1515 smoothlevel = ob->smoothlevel;
1516 if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH))
1517 SendSmooth (&ns, ob->face->number);
1518 } /* else not already head object or blank face */
1519
1520 /* We've gotten what face we want to use for the object. Now see if
1521 * if it has changed since we last sent it to the client.
1522 */
1523 if (smoothlevel > 255)
1524 smoothlevel = 255;
1525 else if (smoothlevel < 0)
1526 smoothlevel = 0;
1527
1528 if (ns.lastmap.cells[sx][sy].smooth[layer] != smoothlevel)
1529 {
1530 ns.lastmap.cells[sx][sy].smooth[layer] = smoothlevel;
1531 sl << uint8 (smoothlevel);
1532 return 1; 952 return 1;
1533 } 953 }
1534 954
1535 /* Nothing changed */ 955 /* Nothing changed */
1536 return 0; 956 return 0;
… …
1551 if (ns->EMI_smooth) 971 if (ns->EMI_smooth)
1552 result += 1; /*One byte for smoothlevel */ 972 result += 1; /*One byte for smoothlevel */
1553 } 973 }
1554 974
1555 return result; 975 return result;
976}
977
978// prefetch (and touch) all maps within a specific distancd
979static void
980prefetch_surrounding_maps (maptile *map, int distance)
981{
982 map->last_access = runtime;
983
984 if (--distance)
985 for (int dir = 4; --dir; )
986 if (const shstr &path = map->tile_path [dir])
987 if (maptile *&neigh = map->tile_map [dir])
988 prefetch_surrounding_maps (neigh, distance);
989 else
990 neigh = maptile::find_async (path, map);
991}
992
993// prefetch a generous area around the player
994static void
995prefetch_surrounding_maps (object *op)
996{
997 prefetch_surrounding_maps (op->map, 3);
1556} 998}
1557 999
1558/** 1000/**
1559 * This function uses the new map1 protocol command to send the map 1001 * This function uses the new map1 protocol command to send the map
1560 * to the client. It is necessary because the old map command supports 1002 * to the client. It is necessary because the old map command supports
… …
1578 * look like. 1020 * look like.
1579 */ 1021 */
1580void 1022void
1581draw_client_map1 (object *pl) 1023draw_client_map1 (object *pl)
1582{ 1024{
1583 int x, y, ax, ay, d, startlen, max_x, max_y, oldlen; 1025 int x, y, ax, ay, startlen, max_x, max_y, oldlen;
1584 sint16 nx, ny; 1026 sint16 nx, ny;
1585 int estartlen, eoldlen; 1027 int estartlen, eoldlen;
1586 uint16 mask, emask;
1587 uint8 eentrysize; 1028 uint8 eentrysize;
1588 uint16 ewhatstart, ewhatflag; 1029 uint16 ewhatstart, ewhatflag;
1589 uint8 extendedinfos; 1030 uint8 extendedinfos;
1590 maptile *m; 1031 maptile *m;
1591 1032
1592 client &socket = *pl->contr->ns; 1033 client &socket = *pl->contr->ns;
1593 1034
1594 if (!pl->active ()) 1035 if (!pl->active)
1595 return; 1036 return;
1596 1037
1597 check_map_change (pl->contr); 1038 check_map_change (pl->contr);
1039 prefetch_surrounding_maps (pl);
1598 1040
1599 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); 1041 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1600 packet esl; 1042 packet esl;
1601 1043
1602 startlen = sl.length (); 1044 startlen = sl.length ();
… …
1617 << uint8 (extendedinfos) 1059 << uint8 (extendedinfos)
1618 << uint8 (eentrysize); 1060 << uint8 (eentrysize);
1619 1061
1620 estartlen = esl.length (); 1062 estartlen = esl.length ();
1621 } 1063 }
1622 else
1623 {
1624 /* suppress compiler warnings */
1625 ewhatstart = 0;
1626 ewhatflag = 0;
1627 estartlen = 0;
1628 }
1629
1630 /* Init data to zero */
1631 memset (heads, 0, sizeof (object *) * MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS);
1632 1064
1633 /* x,y are the real map locations. ax, ay are viewport relative 1065 /* x,y are the real map locations. ax, ay are viewport relative
1634 * locations. 1066 * locations.
1635 */ 1067 */
1636 ay = 0; 1068 ay = 0;
… …
1639 * but that started to get a bit messy to look at. 1071 * but that started to get a bit messy to look at.
1640 */ 1072 */
1641 max_x = pl->x + (socket.mapx + 1) / 2; 1073 max_x = pl->x + (socket.mapx + 1) / 2;
1642 max_y = pl->y + (socket.mapy + 1) / 2; 1074 max_y = pl->y + (socket.mapy + 1) / 2;
1643 1075
1644 if (socket.mapmode == Map1aCmd) 1076 maptile *plmap = pl->map;
1645 {
1646 max_x += MAX_HEAD_OFFSET;
1647 max_y += MAX_HEAD_OFFSET;
1648 }
1649 1077
1650 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) 1078 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1651 { 1079 {
1652 ax = 0; 1080 ax = 0;
1653 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) 1081 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1654 { 1082 {
1083 int emask, mask;
1655 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1084 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1656 1085
1657 /* If this space is out of the normal viewable area, we only check
1658 * the heads value ax or ay will only be greater than what
1659 * the client wants if using the map1a command - this is because
1660 * if the map1a command is not used, max_x and max_y will be
1661 * set to lower values.
1662 */
1663 if (ax >= socket.mapx || ay >= socket.mapy)
1664 {
1665 int i, got_one;
1666
1667 oldlen = sl.length ();
1668
1669 sl << uint16 (mask);
1670
1671 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1672 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1673 if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1674
1675 /* If all we are doing is sending 0 (blank) faces, we don't
1676 * actually need to send that - just the coordinates
1677 * with no faces tells the client to blank out the
1678 * space.
1679 */
1680 got_one = 0;
1681 for (i = oldlen + 2; i < sl.length (); i++)
1682 if (sl[i])
1683 got_one = 1;
1684
1685 if (got_one && (mask & 0xf))
1686 sl[oldlen + 1] = mask & 0xff;
1687 else
1688 { /*either all faces blank, either no face at all */
1689 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */
1690 sl.reset (oldlen + 2);
1691 else
1692 sl.reset (oldlen);
1693 }
1694
1695 /*What concerns extendinfos, nothing to be done for now
1696 * (perhaps effects layer later)
1697 */
1698 continue; /* don't do processing below */
1699 }
1700
1701 MapCell &lastcell = socket.lastmap.cells[ax][ay]; 1086 MapCell &lastcell = socket.lastmap.cells[ax][ay];
1702
1703 d = pl->contr->blocked_los[ax][ay];
1704 1087
1705 /* If the coordinates are not valid, or it is too dark to see, 1088 /* If the coordinates are not valid, or it is too dark to see,
1706 * we tell the client as such 1089 * we tell the client as such
1707 */ 1090 */
1708 nx = x; 1091 nx = x;
1709 ny = y; 1092 ny = y;
1710 m = get_map_from_coord (pl->map, &nx, &ny); 1093 m = get_map_from_coord (plmap, &nx, &ny);
1711 1094
1712 if (!m) 1095 if (!m)
1713 { 1096 {
1714 /* space is out of map. Update space and clear values 1097 /* space is out of map. Update space and clear values
1715 * if this hasn't already been done. If the space is out 1098 * if this hasn't already been done. If the space is out
1716 * of the map, it shouldn't have a head 1099 * of the map, it shouldn't have a head
1717 */ 1100 */
1718 if (lastcell.count != -1) 1101 if (lastcell.count != -1)
1719 { 1102 {
1720 sl << uint16 (mask); 1103 sl << uint16 (mask);
1721 map_clearcell (&lastcell, 0, 0, 0, -1); 1104 map_clearcell (&lastcell, -1);
1722 } 1105 }
1106
1107 continue;
1723 } 1108 }
1109
1110 m->touch ();
1111
1112 int d = pl->contr->blocked_los[ax][ay];
1113
1724 else if (d > 3) 1114 if (d > 3)
1725 { 1115 {
1726 m->touch ();
1727 1116
1728 int need_send = 0, count; 1117 int need_send = 0, count;
1729 1118
1730 /* This block deals with spaces that are not visible for whatever 1119 /* This block deals with spaces that are not visible for whatever
1731 * reason. Still may need to send the head for this space. 1120 * reason. Still may need to send the head for this space.
1732 */ 1121 */
1733 1122
1734 oldlen = sl.length (); 1123 oldlen = sl.length ();
1735 1124
1736 sl << uint16 (mask); 1125 sl << uint16 (mask);
… …
1738 if (lastcell.count != -1) 1127 if (lastcell.count != -1)
1739 need_send = 1; 1128 need_send = 1;
1740 1129
1741 count = -1; 1130 count = -1;
1742 1131
1743 if (socket.mapmode == Map1aCmd && have_head (ax, ay))
1744 {
1745 /* Now check to see if any heads need to be sent */
1746
1747 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1748 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1749 if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1750
1751 lastcell.count = count;
1752 }
1753 else
1754 {
1755 /* properly clear a previously sent big face */ 1132 /* properly clear a previously sent big face */
1756 if (lastcell.faces[0] != 0 || lastcell.faces[1] != 0 || lastcell.faces[2] != 0 1133 if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1757 || lastcell.stat_hp || lastcell.flags || lastcell.player) 1134 || lastcell.stat_hp || lastcell.flags || lastcell.player)
1758 need_send = 1; 1135 need_send = 1;
1759 1136
1760 map_clearcell (&lastcell, 0, 0, 0, count); 1137 map_clearcell (&lastcell, count);
1761 }
1762 1138
1763 if ((mask & 0xf) || need_send) 1139 if ((mask & 0xf) || need_send)
1764 sl[oldlen + 1] = mask & 0xff; 1140 sl[oldlen + 1] = mask & 0xff;
1765 else 1141 else
1766 sl.reset (oldlen); 1142 sl.reset (oldlen);
1767 } 1143 }
1768 else 1144 else
1769 { 1145 {
1770 m->touch ();
1771
1772 /* In this block, the space is visible or there are head objects 1146 /* In this block, the space is visible.
1773 * we need to send.
1774 */ 1147 */
1775 1148
1776 /* Rather than try to figure out what everything that we might 1149 /* Rather than try to figure out what everything that we might
1777 * need to send is, then form the packet after that, 1150 * need to send is, then form the packet after that,
1778 * we presume that we will in fact form a packet, and update 1151 * we presume that we will in fact form a packet, and update
… …
1781 * is done. 1154 * is done.
1782 * I think this is simpler than doing a bunch of checks to see 1155 * I think this is simpler than doing a bunch of checks to see
1783 * what if anything we need to send, setting the bits, then 1156 * what if anything we need to send, setting the bits, then
1784 * doing those checks again to add the real data. 1157 * doing those checks again to add the real data.
1785 */ 1158 */
1786 oldlen = sl.length (); 1159 oldlen = sl.length ();
1787 mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1788 eoldlen = esl.length (); 1160 eoldlen = esl.length ();
1789 emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1161
1790 sl << uint16 (mask); 1162 sl << uint16 (mask);
1791
1792 if (socket.ext_mapinfos)
1793 esl << uint16 (emask);
1794 1163
1795 unsigned char dummy; 1164 unsigned char dummy;
1796 unsigned char *last_ext = &dummy; 1165 unsigned char *last_ext = &dummy;
1797 1166
1798 /* Darkness changed */ 1167 /* Darkness changed */
… …
1810 sl << uint8 (255 - 64 * d); 1179 sl << uint8 (255 - 64 * d);
1811 } 1180 }
1812 1181
1813 lastcell.count = d; 1182 lastcell.count = d;
1814 1183
1184 mapspace &ms = m->at (nx, ny);
1185
1815 if (socket.extmap) 1186 if (socket.extmap)
1816 { 1187 {
1817 uint8 stat_hp = 0; 1188 uint8 stat_hp = 0;
1818 uint8 stat_width = 0; 1189 uint8 stat_width = 0;
1819 uint8 flags = 0; 1190 uint8 flags = 0;
1820 UUID player = 0; 1191 tag_t player = 0;
1821 1192
1822 // send hp information, if applicable 1193 // send hp information, if applicable
1823 if (object *op = GET_MAP_FACE_OBJ (m, nx, ny, 0)) 1194 if (object *op = ms.faces_obj [0])
1824 { 1195 {
1825 if (op->head || op->invisible) 1196 if (op->head || op->invisible)
1826 ; // do not show 1197 ; // do not show
1827 else if (op->type == PLAYER 1198 else if (op->type == PLAYER
1828 || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)) 1199 || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
… …
1866 1237
1867 mask |= 0x8; 1238 mask |= 0x8;
1868 *last_ext |= 0x80; 1239 *last_ext |= 0x80;
1869 last_ext = &sl[sl.length ()]; 1240 last_ext = &sl[sl.length ()];
1870 1241
1871 sl << uint8 (0x47) << uint8 (8) << (uint64)player; 1242 sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1872 } 1243 }
1873 1244
1874 if (lastcell.flags != flags) 1245 if (lastcell.flags != flags)
1875 { 1246 {
1876 lastcell.flags = flags; 1247 lastcell.flags = flags;
… …
1882 sl << uint8 (8) << uint8 (flags); 1253 sl << uint8 (8) << uint8 (flags);
1883 } 1254 }
1884 } 1255 }
1885 1256
1886 /* Floor face */ 1257 /* Floor face */
1887 if (update_space (sl, socket, m, nx, ny, ax, ay, 2)) 1258 if (update_space (sl, socket, ms, lastcell, 2))
1888 mask |= 0x4; 1259 mask |= 0x4;
1889 1260
1890 if (socket.EMI_smooth)
1891 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 2))
1892 emask |= 0x4;
1893
1894 /* Middle face */ 1261 /* Middle face */
1895 if (update_space (sl, socket, m, nx, ny, ax, ay, 1)) 1262 if (update_space (sl, socket, ms, lastcell, 1))
1896 mask |= 0x2; 1263 mask |= 0x2;
1897 1264
1898 if (socket.EMI_smooth) 1265 if (ms.player () == pl
1899 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 1)) 1266 && (pl->invisible & (pl->invisible < 50 ? 1 : 7)))
1900 emask |= 0x2;
1901
1902 if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1))
1903 { 1267 {
1268 // force player to be visible to himself if invisible
1904 if (lastcell.faces[0] != pl->face->number) 1269 if (lastcell.faces[0] != pl->face)
1905 { 1270 {
1906 lastcell.faces[0] = pl->face->number; 1271 lastcell.faces[0] = pl->face;
1272
1907 mask |= 0x1; 1273 mask |= 0x1;
1908
1909 if (!(socket.faces_sent[pl->face->number] & NS_FACESENT_FACE))
1910 esrv_send_face (&socket, pl->face->number, 0);
1911
1912 sl << uint16 (pl->face->number); 1274 sl << uint16 (pl->face);
1275
1276 socket.send_faces (pl);
1913 } 1277 }
1914 } 1278 }
1915 else
1916 {
1917 /* Top face */ 1279 /* Top face */
1918 if (update_space (sl, socket, m, nx, ny, ax, ay, 0)) 1280 else if (update_space (sl, socket, ms, lastcell, 0))
1919 mask |= 0x1; 1281 mask |= 0x1;
1920
1921 if (socket.EMI_smooth)
1922 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 0))
1923 emask |= 0x1;
1924 } 1282
1925 1283
1926 /* Check to see if we are in fact sending anything for this 1284 /* Check to see if we are in fact sending anything for this
1927 * space by checking the mask. If so, update the mask. 1285 * space by checking the mask. If so, update the mask.
1928 * if not, reset the len to that from before adding the mask 1286 * if not, reset the len to that from before adding the mask
1929 * value, so we don't send those bits. 1287 * value, so we don't send those bits.
… …
1931 if (mask & 0xf) 1289 if (mask & 0xf)
1932 sl[oldlen + 1] = mask & 0xff; 1290 sl[oldlen + 1] = mask & 0xff;
1933 else 1291 else
1934 sl.reset (oldlen); 1292 sl.reset (oldlen);
1935 1293
1294 if (socket.ext_mapinfos)
1295 esl << uint16 (emask);
1296
1297 if (socket.EMI_smooth)
1298 {
1299 for (int layer = 2+1; layer--; )
1300 {
1301 object *ob = ms.faces_obj [layer];
1302
1303 // If there is no object for this space, or if the face for the object
1304 // is the blank face, set the smoothlevel to zero.
1305 int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1306
1307 // We've gotten what face we want to use for the object. Now see if
1308 // if it has changed since we last sent it to the client.
1309 if (lastcell.smooth[layer] != smoothlevel)
1310 {
1311 lastcell.smooth[layer] = smoothlevel;
1312 esl << uint8 (smoothlevel);
1313 emask |= 1 << layer;
1314 }
1315 }
1316
1936 if (emask & 0xf) 1317 if (emask & 0xf)
1937 esl[eoldlen + 1] = emask & 0xff; 1318 esl[eoldlen + 1] = emask & 0xff;
1938 else 1319 else
1939 esl.reset (eoldlen); 1320 esl.reset (eoldlen);
1321 }
1940 } /* else this is a viewable space */ 1322 } /* else this is a viewable space */
1941 } /* for x loop */ 1323 } /* for x loop */
1942 } /* for y loop */ 1324 } /* for y loop */
1325
1326 socket.flush_fx ();
1943 1327
1944 /* Verify that we in fact do need to send this */ 1328 /* Verify that we in fact do need to send this */
1945 if (socket.ext_mapinfos) 1329 if (socket.ext_mapinfos)
1946 { 1330 {
1947 if (!(sl.length () > startlen || socket.sent_scroll)) 1331 if (!(sl.length () > startlen || socket.sent_scroll))
1948 { 1332 {
1949 /* No map data will follow, so don't say the client 1333 /* No map data will follow, so don't say the client
1950 * it doesn't need draw! 1334 * it doesn't need draw!
1951 */ 1335 */
1952 ewhatflag &= (~EMI_NOREDRAW); 1336 ewhatflag &= ~EMI_NOREDRAW;
1953 esl[ewhatstart + 1] = ewhatflag & 0xff; 1337 esl[ewhatstart + 1] = ewhatflag & 0xff;
1954 } 1338 }
1955 1339
1956 if (esl.length () > estartlen) 1340 if (esl.length () > estartlen)
1957 socket.send_packet (esl); 1341 socket.send_packet (esl);
… …
1969 */ 1353 */
1970void 1354void
1971draw_client_map (object *pl) 1355draw_client_map (object *pl)
1972{ 1356{
1973 int i, j; 1357 int i, j;
1974 sint16 ax, ay, nx, ny; /* ax and ay goes from 0 to max-size of arrays */ 1358 sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */
1975 New_Face *face, *floor;
1976 New_Face *floor2;
1977 int d, mflags; 1359 int mflags;
1978 struct Map newmap; 1360 struct Map newmap;
1979 maptile *m, *pm; 1361 maptile *m, *pm;
1980 1362
1981 if (pl->type != PLAYER) 1363 if (pl->type != PLAYER)
1982 { 1364 {
… …
2163 1545
2164/* appends the spell *spell to the Socklist we will send the data to. */ 1546/* appends the spell *spell to the Socklist we will send the data to. */
2165static void 1547static void
2166append_spell (player *pl, packet &sl, object *spell) 1548append_spell (player *pl, packet &sl, object *spell)
2167{ 1549{
2168 int len, i, skill = 0; 1550 int i, skill = 0;
2169 1551
2170 if (!(spell->name)) 1552 if (!(spell->name))
2171 { 1553 {
2172 LOG (llevError, "item number %d is a spell with no name.\n", spell->count); 1554 LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
2173 return; 1555 return;
… …
2185 if (!strcmp (spell->skill, skill_names[i])) 1567 if (!strcmp (spell->skill, skill_names[i]))
2186 { 1568 {
2187 skill = i + CS_STAT_SKILLINFO; 1569 skill = i + CS_STAT_SKILLINFO;
2188 break; 1570 break;
2189 } 1571 }
1572 }
1573
1574 // spells better have a face
1575 if (!spell->face)
1576 {
1577 LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1578 spell->face = face_find ("burnout.x11", blank_face);
2190 } 1579 }
2191 1580
2192 /* send the current values */ 1581 /* send the current values */
2193 sl << uint32 (spell->count) 1582 sl << uint32 (spell->count)
2194 << uint16 (spell->level) 1583 << uint16 (spell->level)
… …
2196 << uint16 (spell->last_sp) 1585 << uint16 (spell->last_sp)
2197 << uint16 (spell->last_grace) 1586 << uint16 (spell->last_grace)
2198 << uint16 (spell->last_eat) 1587 << uint16 (spell->last_eat)
2199 << uint8 (skill) 1588 << uint8 (skill)
2200 << uint32 (spell->path_attuned) 1589 << uint32 (spell->path_attuned)
2201 << uint32 (spell->face ? spell->face->number : 0) 1590 << uint32 (spell->face)
2202 << data8 (spell->name) 1591 << data8 (spell->name)
2203 << data16 (spell->msg); 1592 << data16 (spell->msg);
2204} 1593}
2205 1594
2206/** 1595/**
… …
2221 1610
2222 packet sl ("addspell"); 1611 packet sl ("addspell");
2223 1612
2224 if (!spell) 1613 if (!spell)
2225 { 1614 {
2226 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 1615 for (spell = pl->ob->inv; spell; spell = spell->below)
2227 { 1616 {
2228 /* were we to simply keep appending data here, we could exceed 1617 /* were we to simply keep appending data here, we could exceed
2229 * MAXSOCKBUF if the player has enough spells to add, we know that 1618 * MAXSOCKBUF if the player has enough spells to add, we know that
2230 * append_spells will always append 19 data bytes, plus 4 length 1619 * append_spells will always append 19 data bytes, plus 4 length
2231 * bytes and 3 strings (because that is the spec) so we need to 1620 * bytes and 3 strings (because that is the spec) so we need to

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines